|
|
The Publications
Result of the query in the list of publications :
101 Articles |
81 - Globally optimal regions and boundaries as minimum ratio weight cycles.
I. H. Jermyn and H. Ishikawa. IEEE Trans. Pattern Analysis and Machine Intelligence, 23(10): pages 1075-1088, October 2001.
Keywords : Graph, Ratio, Cycle, Segmentation, Global minimum.
Copyright : ©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
@ARTICLE{jermyn_tpami01,
|
| author |
= |
{Jermyn, I. H. and Ishikawa, H.}, |
| title |
= |
{Globally optimal regions and boundaries as minimum ratio weight cycles}, |
| year |
= |
{2001}, |
| month |
= |
{October}, |
| journal |
= |
{IEEE Trans. Pattern Analysis and Machine Intelligence}, |
| volume |
= |
{23}, |
| number |
= |
{10}, |
| pages |
= |
{1075-1088}, |
| url |
= |
{http://dx.doi.org/10.1109/34.954599}, |
| pdf |
= |
{ftp://ftp-sop.inria.fr/ariana/Articles/jermyn_tpami01.pdf}, |
| keyword |
= |
{Graph, Ratio, Cycle, Segmentation, Global minimum} |
| } |
Abstract :
We describe a new form of energy functional for the modelling and identification of regions in images. The energy is defined on the space of boundaries in the image domain, and can incorporate very general combinations of modelling information both from the boundary (intensity gradients,ldots), em and from the interior of the region (texture, homogeneity,ldots). We describe two polynomial-time digraph algorithms for finding the em global minima of this energy. One of the algorithms is completely general, minimizing the functional for any choice of modelling information. It runs in a few seconds on a 256 times 256 image. The other algorithm applies to a subclass of functionals, but has the advantage of being extremely parallelizable. Neither algorithm requires initialization. |
|
82 - A RJMCMC algorithm for object processes in image processing.
X. Descombes and R. Stoica and L. Garcin and J. Zerubia. Monte Carlo Methods and Applications, 7(1-2): pages 149-156, 2001.
@ARTICLE{xd01c,
|
| author |
= |
{Descombes, X. and Stoica, R. and Garcin, L. and Zerubia, J.}, |
| title |
= |
{A RJMCMC algorithm for object processes in image processing}, |
| year |
= |
{2001}, |
| journal |
= |
{Monte Carlo Methods and Applications}, |
| volume |
= |
{7}, |
| number |
= |
{1-2}, |
| pages |
= |
{149-156}, |
| keyword |
= |
{} |
| } |
|
83 - Image segmentation using Markov random field model in fully parallel cellular network architectures.
T. Szirányi and J. Zerubia and L. Czúni and D. Geldreich and Z. Kato. Real Time Imaging, 6(3): pages 195-211, June 2000.
@ARTICLE{jz00y,
|
| author |
= |
{Szirányi, T. and Zerubia, J. and Czúni, L. and Geldreich, D. and Kato, Z.}, |
| title |
= |
{Image segmentation using Markov random field model in fully parallel cellular network architectures}, |
| year |
= |
{2000}, |
| month |
= |
{June}, |
| journal |
= |
{Real Time Imaging}, |
| volume |
= |
{6}, |
| number |
= |
{3}, |
| pages |
= |
{195-211}, |
| pdf |
= |
{http://dx.doi.org/10.1006/rtim.1998.0159}, |
| keyword |
= |
{} |
| } |
Abstract :
Markovian approaches to early vision processes need a huge amount of computing power. These algorithms can usually be implemented on parallel computing structures. Herein, we show that the Markovian labeling approach can be implemented in fully parallel cellular network architectures, using simple functions and data representations. This makes possible to implement our model in parallel imaging VLSI chips.
As an example, we have developed a simplified statistical image segmentation algorithm for the Cellular Neural/Nonlinear Networks Universal Machine (CNN-UM), which is a new image processing tool, containing thousands of cells with analog dynamics, local memories and processing units. The Modified Metropolis Dynamics (MMD) optimization method can be implemented into the raw analog architecture of the CNN-UM. We can introduce the whole pseudo-stochastic segmentation process in the CNN architecture using 8 memories/cell. We use simple arithmetic functions (addition, multiplication), equality-test between neighboring pixels and very simple nonlinear output functions (step, jigsaw). With this architecture, the proposed VLSI CNN chip can execute a pseudo-stochastic relaxation algorithm of about 100 iterations in about 100 μs.
In the suggested solution the segmentation is unsupervised, where a pixel-level statistical estimation model is used. We have tested different monogrid and multigrid architectures.
In our CNN-UM model several complex preprocessing steps can be involved, such as texture-classification or anisotropic diffusion. With these preprocessing steps, our fully parallel cellular system may work as a high-level image segmentation machine, using only simple functions based on the close-neighborhood of a pixel. |
|
84 - A variational model for image classification and restoration.
C. Samson and L. Blanc-Féraud and G. Aubert and J. Zerubia. IEEE Trans. Pattern Analysis ans Machine Intelligence, 22(5): pages 460-472, May 2000.
@ARTICLE{cs00,
|
| author |
= |
{Samson, C. and Blanc-Féraud, L. and Aubert, G. and Zerubia, J.}, |
| title |
= |
{A variational model for image classification and restoration}, |
| year |
= |
{2000}, |
| month |
= |
{May}, |
| journal |
= |
{IEEE Trans. Pattern Analysis ans Machine Intelligence}, |
| volume |
= |
{22}, |
| number |
= |
{5}, |
| pages |
= |
{460-472}, |
| keyword |
= |
{} |
| } |
|
85 - A Level Set Model for Image Classification.
C. Samson and L. Blanc-Féraud and G. Aubert and J. Zerubia. International Journal of Computer Vision, 40(3): pages 187-198, 2000.
@ARTICLE{cs00b,
|
| author |
= |
{Samson, C. and Blanc-Féraud, L. and Aubert, G. and Zerubia, J.}, |
| title |
= |
{A Level Set Model for Image Classification}, |
| year |
= |
{2000}, |
| journal |
= |
{International Journal of Computer Vision}, |
| volume |
= |
{40}, |
| number |
= |
{3}, |
| pages |
= |
{187-198}, |
| keyword |
= |
{} |
| } |
|
86 - Mise en correspondance et recalage de graphes~: application aux réseaux routiers extraits d'un couple carte/image.
C. Hivernat and X. Descombes and S. Randriamasy and J. Zerubia. Traitement du Signal, 17(1): pages 21-32, 2000.
@ARTICLE{xd00,
|
| author |
= |
{Hivernat, C. and Descombes, X. and Randriamasy, S. and Zerubia, J.}, |
| title |
= |
{Mise en correspondance et recalage de graphes~: application aux réseaux routiers extraits d'un couple carte/image}, |
| year |
= |
{2000}, |
| journal |
= |
{Traitement du Signal}, |
| volume |
= |
{17}, |
| number |
= |
{1}, |
| pages |
= |
{21-32}, |
| keyword |
= |
{} |
| } |
|
87 - Texture analysis through a Markovian modelling and fuzzy classification: Application to urban area Extraction from Satellite Images.
A. Lorette and X. Descombes and J. Zerubia. International Journal of Computer Vision, 36(3): pages 221-236, 2000.
@ARTICLE{xd00a,
|
| author |
= |
{Lorette, A. and Descombes, X. and Zerubia, J.}, |
| title |
= |
{Texture analysis through a Markovian modelling and fuzzy classification: Application to urban area Extraction from Satellite Images}, |
| year |
= |
{2000}, |
| journal |
= |
{International Journal of Computer Vision}, |
| volume |
= |
{36}, |
| number |
= |
{3}, |
| pages |
= |
{221-236}, |
| url |
= |
{http://dx.doi.org/10.1023/A:1008129103384}, |
| pdf |
= |
{http://dx.doi.org/10.1023/A:1008129103384}, |
| keyword |
= |
{} |
| } |
|
88 - Comparison of Filtering Methods for fMRI Datasets.
F. Kruggel and Y. Von Cramon and X. Descombes. NeuroImage, 10: pages 530-543, November 1999.
@ARTICLE{xd99d,
|
| author |
= |
{Kruggel, F. and Von Cramon, Y. and Descombes, X.}, |
| title |
= |
{Comparison of Filtering Methods for fMRI Datasets}, |
| year |
= |
{1999}, |
| month |
= |
{November}, |
| journal |
= |
{NeuroImage}, |
| volume |
= |
{10}, |
| pages |
= |
{530-543}, |
| keyword |
= |
{} |
| } |
|
89 - Some remarks on the equivalence between 2D and 3D classical snakes and geodesic active contours.
L. Blanc-Féraud and G. Aubert. International Journal of Computer Vision, 34(1): pages 19-28, September 1999.
@ARTICLE{lbf99a,
|
| author |
= |
{Blanc-Féraud, L. and Aubert, G.}, |
| title |
= |
{Some remarks on the equivalence between 2D and 3D classical snakes and geodesic active contours}, |
| year |
= |
{1999}, |
| month |
= |
{September}, |
| journal |
= |
{International Journal of Computer Vision}, |
| volume |
= |
{34}, |
| number |
= |
{1}, |
| pages |
= |
{19-28}, |
| keyword |
= |
{} |
| } |
|
90 - Estimation of Markov Random Field prior parameters using Markov chain Monte Carlo Maximum Likelihood.
X. Descombes and R. Morris and J. Zerubia and M. Berthod. IEEE Trans. Image Processing, 8(7): pages 954-963, July 1999.
Keywords : Markov processes, Monte Carlo methods, Potts model, Image segmentation, Maximum likelihood estimation .
@ARTICLE{xd99c,
|
| author |
= |
{Descombes, X. and Morris, R. and Zerubia, J. and Berthod, M.}, |
| title |
= |
{Estimation of Markov Random Field prior parameters using Markov chain Monte Carlo Maximum Likelihood}, |
| year |
= |
{1999}, |
| month |
= |
{July}, |
| journal |
= |
{IEEE Trans. Image Processing}, |
| volume |
= |
{8}, |
| number |
= |
{7}, |
| pages |
= |
{954-963}, |
| pdf |
= |
{http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=16772&arnumber=772239&count=14&index=6}, |
| keyword |
= |
{Markov processes, Monte Carlo methods, Potts model, Image segmentation, Maximum likelihood estimation } |
| } |
Abstract :
Developments in statistics now allow maximum likelihood estimators for the parameters of Markov random fields (MRFs) to be constructed. We detail the theory required, and present an algorithm that is easily implemented and practical in terms of computation time. We demonstrate this algorithm on three MRF models-the standard Potts model, an inhomogeneous variation of the Potts model, and a long-range interaction model, better adapted to modeling real-world images. We estimate the parameters from a synthetic and a real image, and then resynthesize the models to demonstrate which features of the image have been captured by the model. Segmentations are computed based on the estimated parameters and conclusions drawn. |
|
 top of the page
These pages were generated by 
|
get the bibtex
