|
The Publications
Result of the query in the list of publications :
245 Conference articles |
19 - Morphological road segmentation in urban areas from high resolution satellite images. R. Gaetano and J. Zerubia and G. Scarpa and G. Poggi. In International Conference on Digital Signal Processing, Corfu, Greece, July 2011. Keywords : Segmentation, Classification, skeletonization , pattern recognition, shape analysis.
@INPROCEEDINGS{GaetanoDSP,
|
author |
= |
{Gaetano, R. and Zerubia, J. and Scarpa, G. and Poggi, G.}, |
title |
= |
{Morphological road segmentation in urban areas from high resolution satellite images}, |
year |
= |
{2011}, |
month |
= |
{July}, |
booktitle |
= |
{International Conference on Digital Signal Processing}, |
address |
= |
{Corfu, Greece}, |
url |
= |
{http://hal.inria.fr/inria-00618222/fr/}, |
keyword |
= |
{Segmentation, Classification, skeletonization , pattern recognition, shape analysis} |
} |
Abstract :
High resolution satellite images provided by the last generation
sensors significantly increased the potential of almost
all the image information mining (IIM) applications related
to earth observation. This is especially true for the extraction
of road information, task of primary interest for many remote
sensing applications, which scope is more and more extended
to complex urban scenarios thanks to the availability of highly
detailed images. This context is particularly challenging due
to such factors as the variability of road visual appearence
and the occlusions from entities like trees, cars and shadows.
On the other hand, the peculiar geometry and morphology of
man-made structures, particularly relevant in urban areas, is
enhanced in high resolution images, making this kind of information
especially useful for road detection.
In this work, we provide a new insight on the use of morphological
image analysis for road extraction in complex urban
scenarios, and propose a technique for road segmentation
that only relies on this domain. The keypoint of the technique
is the use of skeletons as powerful descriptors for road objects:
the proposed method is based on an ad-hoc skeletonization
procedure that enhances the linear structure of road segments,
and extracts road objects by first detecting their skeletons
and then associating each of them with a region of the
image. Experimental results are presented on two different
high resolution satellite images of urban areas. |
|
20 - Regularizing parameter estimation for Poisson noisy image restoration. M. Carlavan and L. Blanc-Féraud. In International ICST Workshop on New Computational Methods for Inverse Problems, Paris, France, May 2011. Keywords : Parameter estimation, discrepancy principle, Poisson noise.
@INPROCEEDINGS{NCMIP11,
|
author |
= |
{Carlavan, M. and Blanc-Féraud, L.}, |
title |
= |
{Regularizing parameter estimation for Poisson noisy image restoration}, |
year |
= |
{2011}, |
month |
= |
{May}, |
booktitle |
= |
{International ICST Workshop on New Computational Methods for Inverse Problems}, |
address |
= |
{Paris, France}, |
url |
= |
{http://hal.inria.fr/inria-00590906/fr/}, |
keyword |
= |
{Parameter estimation, discrepancy principle, Poisson noise} |
} |
Abstract :
Deblurring images corrupted by Poisson noise is a challeng- ing process which has devoted much research in many ap- plications such as astronomical or biological imaging. This problem, among others, is an ill-posed problem which can be regularized by adding knowledge on the solution. Several methods have therefore promoted explicit prior on the im- age, coming along with a regularizing parameter to moder- ate the weight of this prior. Unfortunately, in the domain of Poisson deconvolution, only a few number of methods have been proposed to select this regularizing parameter which is most of the time set manually such that it gives the best visual results. In this paper, we focus on the use of l1 -norm prior and present two methods to select the regularizing pa- rameter. We show some comparisons on synthetic data using classical image fidelity measures. |
|
21 - A novel algorithm for occlusions and perspective effects using a 3d object process. A. Gamal Eldin and X. Descombes and J. Zerubia. In ICASSP 2011 (International Conference on Acoustics, Speech and Signal Processing), Prague, Czech Republic, May 2011. Keywords : Occlusions, 3D object process, multiple object extraction, Multiple Birth and Death, Penguins Counting.
@INPROCEEDINGS{ICASSP_2011,
|
author |
= |
{Gamal Eldin, A. and Descombes, X. and Zerubia, J.}, |
title |
= |
{A novel algorithm for occlusions and perspective effects using a 3d object process}, |
year |
= |
{2011}, |
month |
= |
{May}, |
booktitle |
= |
{ICASSP 2011 (International Conference on Acoustics, Speech and Signal Processing)}, |
address |
= |
{Prague, Czech Republic}, |
url |
= |
{http://hal.inria.fr/inria-00592449/fr/}, |
keyword |
= |
{Occlusions, 3D object process, multiple object extraction, Multiple Birth and Death, Penguins Counting} |
} |
Abstract :
In this paper, we introduce a novel probabilistic approach to handle occlusions and perspective effects. The proposed method is an object based method embedded in a marked point process framework. We apply it for the size estimation of a penguin colony, where we model a penguin colony as an unknown number of 3D objects. The main idea of the proposed approach is to sample some candidate configurations consisting of 3D objects lying in the real plane. A Gibbs energy is define on the configuration space, which takes into account both prior and data information. These configurations are projected onto the image plane. The configurations are modified until convergence using the multiple birth and death optimization algorithm and by measuring the similarity between the projected image of the configuration and the real image. During optimization, the proposed configuration is modeled by a mixed graph which represents all dependencies between the objects, including interaction between neighbor objects and parent-child dependency for occluded objects. We tested our model on synthetic image, and real images. |
|
22 - A new variational method for preserving point-like and curve-like singularities in 2d images. D. Graziani and L. Blanc-Féraud and G. Aubert. In Proc. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Prague, Czech Republic, May 2011. Keywords : Convex optimization, nesterov scheme, laplacian operator.
@INPROCEEDINGS{ICASSP_Graziani11,
|
author |
= |
{Graziani, D. and Blanc-Féraud, L. and Aubert, G.}, |
title |
= |
{A new variational method for preserving point-like and curve-like singularities in 2d images}, |
year |
= |
{2011}, |
month |
= |
{May}, |
booktitle |
= |
{Proc. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}, |
address |
= |
{Prague, Czech Republic}, |
url |
= |
{http://hal.inria.fr/inria-00592603/fr/}, |
keyword |
= |
{Convex optimization, nesterov scheme, laplacian operator} |
} |
Abstract :
We propose a new variational method to restore point-like and curve-like singularities in 2-D images. As points and open curves are fine structures, they are difficult to restore by means of first order derivative operators computed in the noisy image. In this paper we propose to use the Laplacian operator of the observed intensity, since it becomes singular at points and curves. Then we propose to restore these singularities by introducing suitable regularization involving the l-1-norm of the Laplacian operator. Results are shown on synthetic an real data.
|
|
23 - Wavefront sensing for aberration modeling in fluorescence MACROscopy. P. Pankajakshan and A. Dieterlen and G. Engler and Z. Kam and L. Blanc-Féraud and J. Zerubia and J.C. Olivo-Marin. In Proc. IEEE International Symposium on Biomedical Imaging (ISBI), Chicago, USA, April 2011. Keywords : fluorescence MACROscopy , phase retrieval, field aberration.
@INPROCEEDINGS{PanjakshanISBI2011,
|
author |
= |
{Pankajakshan, P. and Dieterlen, A. and Engler, G. and Kam, Z. and Blanc-Féraud, L. and Zerubia, J. and Olivo-Marin, J.C.}, |
title |
= |
{Wavefront sensing for aberration modeling in fluorescence MACROscopy}, |
year |
= |
{2011}, |
month |
= |
{April}, |
booktitle |
= |
{Proc. IEEE International Symposium on Biomedical Imaging (ISBI)}, |
address |
= |
{Chicago, USA}, |
url |
= |
{http://hal.inria.fr/inria-00563988/en/}, |
keyword |
= |
{fluorescence MACROscopy , phase retrieval, field aberration} |
} |
Abstract :
In this paper, we present an approach to calculate the wavefront in
the back pupil plane of an objective in a fluorescent MACROscope.
We use the three-dimensional image of a fluorescent bead because it
contains potential pupil information in the ‘far’ out-of-focus planes
for sensing the wavefront at the back focal plane of the objective.
Wavefront sensing by phase retrieval technique is needed for several
reasons. Firstly, the point-spread function of the imaging system
can be calculated from the estimated pupil phase and used for image
restoration. Secondly, the aberrations in the optics of the objective
can be determined by studying this phase. Finally, the estimated
wavefront can be used to correct the aberrated optical path with-
out a wavefront sensor. In this paper, we estimate the wavefront of
a MACROscope optical system by using Bayesian inferencing and
derive the Gerchberg-Saxton algorithm as a special case. |
|
24 - Brain tumor vascular network segmentation from micro-tomography. X. Descombes and F. Plouraboue and El Boustani Habdelhkim and Fonta Caroline and |LeDuc Geraldine and Serduc Raphael and Weitkamp Timm. In Internation Symposium of Biomedical Imaging (ISBI), Chicago, USA, April 2011. Keywords : Segmentation, Markov random field, Tomography, Brain, vascular network. Copyright : IEEE
@INPROCEEDINGS{isbi11,
|
author |
= |
{Descombes, X. and Plouraboue, F. and Boustani Habdelhkim, El and Caroline, Fonta and Geraldine, |LeDuc and Raphael, Serduc and Timm, Weitkamp}, |
title |
= |
{Brain tumor vascular network segmentation from micro-tomography}, |
year |
= |
{2011}, |
month |
= |
{April}, |
booktitle |
= |
{Internation Symposium of Biomedical Imaging (ISBI)}, |
address |
= |
{Chicago, USA}, |
url |
= |
{http://dx.doi.org/10.1109/ISBI.2011.5872596}, |
keyword |
= |
{Segmentation, Markov random field, Tomography, Brain, vascular network} |
} |
Abstract :
Micro-tomography produces high resolution images of biological structures such as vascular networks. In this paper, we present a new approach for segmenting vascular network into pathological and normal regions from considering their micro-vessel 3D structure only. We define and use a conditional random field for segmenting the output of a watershed algorithm. The tumoral and normal classes are thus characterized by their respective distribution of watershed region size interpreted as local vascular territories. |
|
25 - Multiple Birth and Cut Algorithm for Point Process Optimization. A. Gamal Eldin and X. Descombes and J. Zerubia. In Proc. IEEE International Conference on Signal-Image Technology and Internet-based Systems (SITIS), Kuala Lumpur, Malaysia, December 2010. Keywords : Multiple Birth and Cut, Graph Cut, Multiple Birth and Death, Marked point process.
@INPROCEEDINGS{MBC_MPP_SITIS10,
|
author |
= |
{Gamal Eldin, A. and Descombes, X. and Zerubia, J.}, |
title |
= |
{Multiple Birth and Cut Algorithm for Point Process Optimization}, |
year |
= |
{2010}, |
month |
= |
{December}, |
booktitle |
= |
{Proc. IEEE International Conference on Signal-Image Technology and Internet-based Systems (SITIS)}, |
address |
= |
{Kuala Lumpur, Malaysia}, |
url |
= |
{http://hal.archives-ouvertes.fr/inria-00516305/fr/}, |
keyword |
= |
{Multiple Birth and Cut, Graph Cut, Multiple Birth and Death, Marked point process} |
} |
Abstract :
In this paper, we describe a new optimization method which we call Multiple Birth and Cut (MBC). It combines the recently developed Multiple Birth and Death (MBD) algorithm and the Graph-Cut algorithm. MBD and MBC optimization methods are applied to the energy minimization of an object based model, the marked point process. We compare the MBC to the MBD showing the advantages and disadvantages, where the most important advantage is the reduction of the number of parameters. We validated our algorithm on the counting problem of flamingos in colony, where our algorithm outperforms the performance of the MBD algorithm. |
|
26 - A theoretical and numerical study of a phase field higher-order active contour model of directed networks. A. El Ghoul and I. H. Jermyn and J. Zerubia. In The Tenth Asian Conference on Computer Vision (ACCV), Queenstown, New Zealand, November 2010. Keywords : Phase Field, Shape prior, Directed networks, Stability analysis, river extraction, remote sensing. Copyright : Springer-Verlag GmbH Berlin Heidelberg
@INPROCEEDINGS{Elghoul10b,
|
author |
= |
{El Ghoul, A. and Jermyn, I. H. and Zerubia, J.}, |
title |
= |
{A theoretical and numerical study of a phase field higher-order active contour model of directed networks}, |
year |
= |
{2010}, |
month |
= |
{November}, |
booktitle |
= |
{The Tenth Asian Conference on Computer Vision (ACCV)}, |
address |
= |
{Queenstown, New Zealand}, |
pdf |
= |
{http://hal.archives-ouvertes.fr/inria-00522443/fr/}, |
keyword |
= |
{Phase Field, Shape prior, Directed networks, Stability analysis, river extraction, remote sensing} |
} |
Abstract :
We address the problem of quasi-automatic extraction of directed networks, which have characteristic geometric features, from images. To include the necessary prior knowledge about these geometric features, we use a phase field higher-order active contour model of directed networks. The model has a large number of unphysical parameters (weights of energy terms), and can favour different geometric structures for different parameter values. To overcome this problem, we perform a stability analysis of a long, straight bar in order to find parameter ranges that favour networks. The resulting constraints necessary to produce
stable networks eliminate some parameters, replace others by physical parameters such as network branch width, and place lower and upper bounds on the values of the rest.We validate the theoretical analysis via numerical experiments, and then apply the model to the problem of hydrographic network extraction from multi-spectral VHR satellite images. |
|
27 - Point-spread function model for fluorescence MACROscopy imaging. P. Pankajakshan and Z. Kam and A. Dieterlen and G. Engler and L. Blanc-Féraud and J. Zerubia and J.C. Olivo-Marin. In Asilomar Conference on Signals, Systems and Computers, pages 1364-136, Pacific Grove, CA, USA , November 2010. Keywords : fluorescence MACROscopy , point-spread function, pupil function, vignetting .
@INPROCEEDINGS{PanjakshanASILOMAR2010,
|
author |
= |
{Pankajakshan, P. and Kam, Z. and Dieterlen, A. and Engler, G. and Blanc-Féraud, L. and Zerubia, J. and Olivo-Marin, J.C.}, |
title |
= |
{Point-spread function model for fluorescence MACROscopy imaging}, |
year |
= |
{2010}, |
month |
= |
{November}, |
booktitle |
= |
{Asilomar Conference on Signals, Systems and Computers}, |
pages |
= |
{1364-136}, |
address |
= |
{Pacific Grove, CA, USA }, |
url |
= |
{http://hal.inria.fr/inria-00555940/}, |
keyword |
= |
{fluorescence MACROscopy , point-spread function, pupil function, vignetting } |
} |
Abstract :
In this paper, we model the point-spread function (PSF) of a fluorescence MACROscope with a field aberration. The MACROscope is an imaging arrangement that is designed to directly study small and large specimen preparations without physically sectioning them. However, due to the different optical components of the MACROscope, it cannot achieve the condition of lateral spatial invariance for all magnifications. For example, under low zoom settings, this field aberration becomes prominent, the PSF varies in the lateral field, and is proportional to the distance from the center of the field. On the other hand, for larger zooms, these aberrations become gradually absent. A computational approach to correct this aberration often relies on an accurate knowledge of the PSF. The PSF can be defined either theoretically using a scalar diffraction model or empirically by acquiring a three-dimensional image of a fluorescent bead that approximates a point source. The experimental PSF is difficult to obtain and can change with slight deviations from the physical conditions. In this paper, we model the PSF using the scalar diffraction approach, and the pupil function is modeled by chopping it. By comparing our modeled PSF with an experimentally obtained PSF, we validate our hypothesis that the spatial variance is caused by two limiting optical apertures brought together on different conjugate planes. |
|
28 - Parameter estimation for a marked point process within a framework of multidimensional shape extraction from remote sensing images. S. Ben Hadj and F. Chatelain and X. Descombes and J. Zerubia. In Proc. ISPRS Technical Commission III Symposium on Photogrammetry Computer Vision and Image Analysis (PCV), Paris, France, September 2010. Keywords : Shape extraction, Marked point process, RJMCMC, Simulated Annealing, Stochastic EM (SEM).
@INPROCEEDINGS{sbenhadj10a,
|
author |
= |
{Ben Hadj, S. and Chatelain, F. and Descombes, X. and Zerubia, J.}, |
title |
= |
{Parameter estimation for a marked point process within a framework of multidimensional shape extraction from remote sensing images}, |
year |
= |
{2010}, |
month |
= |
{September}, |
booktitle |
= |
{Proc. ISPRS Technical Commission III Symposium on Photogrammetry Computer Vision and Image Analysis (PCV)}, |
address |
= |
{Paris, France}, |
url |
= |
{http://hal.archives-ouvertes.fr/docs/00/52/63/45/PDF/ISPRS_SBH_FC_XD_JZ_Final2.pdf}, |
keyword |
= |
{Shape extraction, Marked point process, RJMCMC, Simulated Annealing, Stochastic EM (SEM)} |
} |
|
29 - Tree crown detection in high resolution optical and LiDAR images of tropical forest. J. Zhou and C. Proisy and X. Descombes and I. Hedhli and N. Barbier and J. Zerubia and J.-P. Gastellu-Etchegorry and P. Couteron. In Proc. SPIE Symposium on Remote Sensing, Toulouse, France, September 2010. Keywords : Tropical forest, tree detection, Marked point process.
@INPROCEEDINGS{Zhou10,
|
author |
= |
{Zhou, J. and Proisy, C. and Descombes, X. and Hedhli, I. and Barbier, N. and Zerubia, J. and Gastellu-Etchegorry, J.-P. and Couteron, P.}, |
title |
= |
{Tree crown detection in high resolution optical and LiDAR images of tropical forest}, |
year |
= |
{2010}, |
month |
= |
{September}, |
booktitle |
= |
{Proc. SPIE Symposium on Remote Sensing}, |
address |
= |
{Toulouse, France}, |
url |
= |
{http://dx.doi.org/10.1117/12.865068}, |
keyword |
= |
{Tropical forest, tree detection, Marked point process} |
} |
|
30 - Multi-spectral Image Analysis for Skin Pigmentation Classification. S. Prigent and X. Descombes and D. Zugaj and P. Martel and J. Zerubia. In Proc. IEEE International Conference on Image Processing (ICIP), Hong-Kong, China, September 2010. Keywords : skin hyper-pigmentation, Multi-spectral images, Support Vector Machines, Independant Component Analysis, Data reduction.
@INPROCEEDINGS{sp02,
|
author |
= |
{Prigent, S. and Descombes, X. and Zugaj, D. and Martel, P. and Zerubia, J.}, |
title |
= |
{Multi-spectral Image Analysis for Skin Pigmentation Classification}, |
year |
= |
{2010}, |
month |
= |
{September}, |
booktitle |
= |
{Proc. IEEE International Conference on Image Processing (ICIP)}, |
address |
= |
{Hong-Kong, China}, |
pdf |
= |
{http://hal.inria.fr/docs/00/49/94/92/PDF/Article_ICIP.pdf}, |
keyword |
= |
{skin hyper-pigmentation, Multi-spectral images, Support Vector Machines, Independant Component Analysis, Data reduction} |
} |
Abstract :
In this paper, we compare two different approaches for semi-automatic detection of skin hyper-pigmentation on multi-spectral images. These two methods are support vector machine (SVM) and blind source separation. To apply SVM, a dimension reduction method adapted to data classification is proposed. It allows to improve the quality of SVM classification as well as to have reasonable computation time. For the blind source separation approach we show that, using independent component analysis, it is possible to extract a relevant cartography of skin pigmentation.
|
|
31 - Segmentation of networks from VHR remote sensing images using a directed phase field HOAC model. A. El Ghoul and I. H. Jermyn and J. Zerubia. In Proc. ISPRS Technical Commission III Symposium on Photogrammetry Computer Vision and Image Analysis (PCV), Paris, France, September 2010. Keywords : Phase Field, Shape prior, Directed networks, Road network extraction, river extraction, remote sensing. Copyright : ISPRS
@INPROCEEDINGS{Elghoul10a,
|
author |
= |
{El Ghoul, A. and Jermyn, I. H. and Zerubia, J.}, |
title |
= |
{Segmentation of networks from VHR remote sensing images using a directed phase field HOAC model}, |
year |
= |
{2010}, |
month |
= |
{September}, |
booktitle |
= |
{Proc. ISPRS Technical Commission III Symposium on Photogrammetry Computer Vision and Image Analysis (PCV)}, |
address |
= |
{Paris, France}, |
pdf |
= |
{https://hal.inria.fr/inria-00491017}, |
keyword |
= |
{Phase Field, Shape prior, Directed networks, Road network extraction, river extraction, remote sensing} |
} |
Abstract :
We propose a new algorithm for network segmentation from VHR remote sensing images. The algorithm performs this task quasi-automatically,
that is, with no human intervention except to fix some parameters. The task is made difficult by the amount of prior knowledge about network region geometry needed to perform the task, knowledge that is usually provided by a human being. To include such prior knowledge, we make use of methodological advances in region modelling: a phase field higher-order active contour of directed networks is used as the prior model for region geometry. By adjoining an approximately conserved flow to a phase field model encouraging network shapes (i.e. regions composed of branches meeting at junctions), the model favours network regions in which different branches may have very different widths, but in which width change along a branch is slow; in which branches do not
come to an end, hence tending to close gaps in the network; and in which junctions show approximate ‘conservation of width’. We also introduce image models for network and background, which are validated using maximum likelihood segmentation against other possibilities. We then test the full model on VHR optical and multispectral satellite images. |
|
32 - Classification of very high resolution SAR images of urban areas by dictionary-based mixture models, copulas and Markov random fields using textural features. A. Voisin and G. Moser and V. Krylov and S.B. Serpico and J. Zerubia. In Proc. of SPIE (SPIE Symposium on Remote Sensing 2010), Vol. 7830, Toulouse, France, September 2010. Keywords : SAR Images, Supervised classification, Urban areas, Textural features, Copulas, Markov Random Fields. Copyright : SPIE
@INPROCEEDINGS{7830-23,
|
author |
= |
{Voisin, A. and Moser, G. and Krylov, V. and Serpico, S.B. and Zerubia, J.}, |
title |
= |
{Classification of very high resolution SAR images of urban areas by dictionary-based mixture models, copulas and Markov random fields using textural features}, |
year |
= |
{2010}, |
month |
= |
{September}, |
booktitle |
= |
{Proc. of SPIE (SPIE Symposium on Remote Sensing 2010)}, |
volume |
= |
{7830}, |
address |
= |
{Toulouse, France}, |
url |
= |
{http://hal.archives-ouvertes.fr/inria-00516333/en}, |
pdf |
= |
{http://hal.archives-ouvertes.fr/docs/00/51/63/33/PDF/Classification_of_VHR_SAR_SPIE_sept2010_Toulouse_Voisin.pdf}, |
keyword |
= |
{SAR Images, Supervised classification, Urban areas, Textural features, Copulas, Markov Random Fields} |
} |
Abstract :
This paper addresses the problem of the classification of very high resolution SAR amplitude images of urban areas. The proposed supervised method combines a finite mixture technique to estimate class-conditional probability density functions, Bayesian classification, and Markov random fields (MRFs). Textural features, such as those extracted by the grey-level co-occurrency method, are also integrated in the technique, as they allow improving the discrimination of urban areas. Copula theory is applied to estimate bivariate joint class-conditional statistics, merging the marginal distributions of both textural and SAR amplitude features. The resulting joint distribution estimates are plugged into a hidden MRF model, endowed with a modified Metropolis dynamics scheme for energy minimization. Experimental results with COSMO-SkyMed images point out the accuracy of the proposed method, also as compared with previous contextual classifiers. |
|
33 - Building Detection in a Single Remotely Sensed Image with a Point Process of Rectangles. C. Benedek and X. Descombes and J. Zerubia. In Proc. International Conference on Pattern Recognition (ICPR), Istanbul, Turkey, August 2010. Keywords : Marked point process, multiple birth-and-death dynamics, Building extraction.
@INPROCEEDINGS{benedekICPR10,
|
author |
= |
{Benedek, C. and Descombes, X. and Zerubia, J.}, |
title |
= |
{Building Detection in a Single Remotely Sensed Image with a Point Process of Rectangles}, |
year |
= |
{2010}, |
month |
= |
{August}, |
booktitle |
= |
{Proc. International Conference on Pattern Recognition (ICPR)}, |
address |
= |
{Istanbul, Turkey}, |
pdf |
= |
{http://hal.archives-ouvertes.fr/inria-00481019/en/}, |
keyword |
= |
{Marked point process, multiple birth-and-death dynamics, Building extraction} |
} |
Abstract :
In this paper we introduce a probabilistic approach of building extraction in remotely sensed images. To cope with data heterogeneity we construct a flexible hierarchical framework which can create various building appearance models from different elementary feature based modules. A global optimization process attempts to find the optimal configuration of buildings, considering simultaneously the observed data, prior knowledge, and interactions between the neighboring building parts. The proposed method is evaluated on various aerial image sets containing more than 500 buildings, and the results are matched against two state-of-the-art techniques. |
|
34 - Graph-based Analysis of Textured Images for Hierarchical Segmentation. R. Gaetano and G. Scarpa and T. Sziranyi. In Proc. British Machine Vision Conference (BMVC), Aberystwyth, UK, August 2010.
@INPROCEEDINGS{Gaetano2010,
|
author |
= |
{Gaetano, R. and Scarpa, G. and Sziranyi, T.}, |
title |
= |
{Graph-based Analysis of Textured Images for Hierarchical Segmentation}, |
year |
= |
{2010}, |
month |
= |
{August}, |
booktitle |
= |
{Proc. British Machine Vision Conference (BMVC)}, |
address |
= |
{Aberystwyth, UK}, |
url |
= |
{http://hal.archives-ouvertes.fr/inria-00506596}, |
keyword |
= |
{} |
} |
Abstract :
The Texture Fragmentation and Reconstruction (TFR) algorithm has beenrecently introduced to address the problem of image segmentationby textural properties, based on a suitable image description toolknown as the Hierarchical Multiple Markov Chain (H-MMC) model. TFRprovides a hierarchical set of nested segmentation maps by firstidentifying the elementary image patterns, and then merging themsequentially to identify complete textures at different scales ofobservation.In this work, we propose a major modification to the TFR by resortingto a graph based description of the image content and a graph clusteringtechnique for the enhancement and extraction of image patterns. Aprocedure based on mathematical morphology will be introduced thatallows for the construction of a color-wise image representationby means of multiple graph structures, along with a simple clusteringtechnique aimed at cutting the graphs and correspondingly segmentgroups of connected components with a similar spatial context.The performance assessment, realized both on synthetic compositionsof real-world textures and images from the remote sensing domain,confirm the effectiveness and potential of the proposed method. |
|
35 - Multichannel SAR Image Classification by Finite Mixtures, Copula Theory and Markov Random Fields. V. Krylov and G. Moser and S.B. Serpico and J. Zerubia. In Proc. of Bayesian Inference and Maximum Entropy Methods in Science and Engineering (MaxEnt 2010), Vol. 1305, pages 319-326, Chamonix, France, July 2010. Keywords : multichannel SAR, Classification, probability density function estimation, Markov random field, copula. Copyright : AIP
@INPROCEEDINGS{krylovMaxEnt10,
|
author |
= |
{Krylov, V. and Moser, G. and Serpico, S.B. and Zerubia, J.}, |
title |
= |
{Multichannel SAR Image Classification by Finite Mixtures, Copula Theory and Markov Random Fields}, |
year |
= |
{2010}, |
month |
= |
{July}, |
booktitle |
= |
{Proc. of Bayesian Inference and Maximum Entropy Methods in Science and Engineering (MaxEnt 2010)}, |
volume |
= |
{1305}, |
pages |
= |
{319-326}, |
address |
= |
{Chamonix, France}, |
url |
= |
{http://hal.archives-ouvertes.fr/inria-00495557/en/}, |
pdf |
= |
{http://hal.archives-ouvertes.fr/docs/00/49/55/57/PDF/krylov_MaxEnt2010.pdf}, |
keyword |
= |
{multichannel SAR, Classification, probability density function estimation, Markov random field, copula} |
} |
Abstract :
The last decades have witnessed an intensive development and a significant increase of interest to remote sensing, and, in particular, to synthetic aperture radar (SAR) imagery. In this paper we develop a supervised classification approach for medium and high resolution multichannel SAR amplitude images. The proposed technique combines finite mixture modeling for probability density function estimation, copulas for multivariate distribution modeling and the Markov random field approach to Bayesian image classification. The finite mixture modeling is done via a recently proposed SAR-specific dictionary-based stochastic expectation maximization approach to class-conditional amplitude probability density function estimation, which is applied separately to all the SAR channels. For modeling the class-conditional joint distributions of multichannel data the statistical concept of copulas is employed, and a dictionary-based copula selection method is proposed. Finally, the Markov random field approach enables to take into account the contextual information and to gain robustness against the inherent noise-like phenomenon of SAR known as speckle. The designed method is an extension and a generalization to multichannel SAR of a recently developed single-channel and Dual-pol SAR image classification technique. The accuracy of the developed multichannel SAR classification approach is validated on several multichannel Quad-pol RADARSAT-2 images and compared to benchmark classification techniques. |
|
36 - Hybrid Multi-view Reconstruction by Jump-Diffusion. F. Lafarge and R. Keriven and M. Brédif and H. Vu. In Proc. IEEE Computer Vision and Pattern Recognition (CVPR), San Franscico, U.S., June 2010.
@INPROCEEDINGS{lafarge_cvpr10,
|
author |
= |
{Lafarge, F. and Keriven, R. and Brédif, M. and Vu, H.}, |
title |
= |
{Hybrid Multi-view Reconstruction by Jump-Diffusion}, |
year |
= |
{2010}, |
month |
= |
{June}, |
booktitle |
= |
{Proc. IEEE Computer Vision and Pattern Recognition (CVPR)}, |
address |
= |
{San Franscico, U.S.}, |
pdf |
= |
{http://certis.enpc.fr/publications/papers/CVPR10a.pdf}, |
keyword |
= |
{} |
} |
|
37 - Spectral Analysis and Unsupervised SVM Classification for Skin Hyper-pigmentation Classification. S. Prigent and X. Descombes and D. Zugaj and J. Zerubia. In Proc. IEEE Workshop on Hyperspectral Image and Signal Processing : Evolution in Remote Sensing (WHISPERS), Reykjavik, Iceland, June 2010. Keywords : Sectral analysis, Data reduction, Projection pursuit, Support Vector Machines, skin hyper-pigmentation.
@INPROCEEDINGS{sp01,
|
author |
= |
{Prigent, S. and Descombes, X. and Zugaj, D. and Zerubia, J.}, |
title |
= |
{Spectral Analysis and Unsupervised SVM Classification for Skin Hyper-pigmentation Classification}, |
year |
= |
{2010}, |
month |
= |
{June}, |
booktitle |
= |
{Proc. IEEE Workshop on Hyperspectral Image and Signal Processing : Evolution in Remote Sensing (WHISPERS)}, |
address |
= |
{Reykjavik, Iceland}, |
pdf |
= |
{http://hal.inria.fr/docs/00/49/55/60/PDF/whispers2010_submission_124.pdf}, |
keyword |
= |
{Sectral analysis, Data reduction, Projection pursuit, Support Vector Machines, skin hyper-pigmentation} |
} |
Abstract :
Data reduction procedures and classification via support vector machines (SVMs) are often associated with multi or hyperspectral image analysis. In this paper, we propose an automatic method with these two schemes in order to perform a classification of skin hyper-pigmentation on multi-spectral images. We propose a spectral analysis method to partition the spectrum as a tool for data reduction, implemented by projection pursuit. Once the data is reduced, an SVM is used to differentiate the pathological from the healthy areas. As SVM is a supervised classification method, we propose a spatial criterion for spectral analysis in order to perform automatic learning. |
|
38 - Hidden fuzzy Markov chain model with K discrete classes. A. Gamal Eldin and Fabien Salzenstein and Christophe Collet. In Information Sciences Signal Processing and their Applications (ISSPA), May 2010. Keywords : hidden fuzzy Markov chain, multispectral image segmentation, parameterized joint density.
@INPROCEEDINGS{fuzzy_segmentation10,
|
author |
= |
{Gamal Eldin, A. and Salzenstein, Fabien and Collet, Christophe}, |
title |
= |
{Hidden fuzzy Markov chain model with K discrete classes}, |
year |
= |
{2010}, |
month |
= |
{May}, |
booktitle |
= |
{Information Sciences Signal Processing and their Applications (ISSPA)}, |
url |
= |
{http://hal.inria.fr/hal-00616372}, |
keyword |
= |
{hidden fuzzy Markov chain, multispectral image segmentation, parameterized joint density} |
} |
Abstract :
This paper deals with a new unsupervised fuzzy Bayesian segmentation method based on the hidden Markov chain model, in order to separate continuous from discrete components in the hidden data. We present a new F-HMC (fuzzy hidden Markov chain) related to three hard classes, based on a general extension of the previously algorithms proposed. For a given observation, the hidden variable owns a density according to a measure containing Dirac and Lebesgue components. We have performed our approach in the multispectral context. The hyper-parameters are estimated using a Stochastic Expectation Maximization (SEM) algorithm. We present synthetic simulations and also segmentation results related to real multi-band data. |
|
39 - Detection and tracking of threats in aerial infrared images by a minimal path approach. G. Aubert and A. Baudour and L. Blanc-Féraud and L. Guillot and Y. Le Guilloux. In Proc. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Dallas, Texas, USA, March 2010.
@INPROCEEDINGS{ICASSP10,
|
author |
= |
{Aubert, G. and Baudour, A. and Blanc-Féraud, L. and Guillot, L. and Le Guilloux, Y.}, |
title |
= |
{Detection and tracking of threats in aerial infrared images by a minimal path approach}, |
year |
= |
{2010}, |
month |
= |
{March}, |
booktitle |
= |
{Proc. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}, |
address |
= |
{Dallas, Texas, USA}, |
pdf |
= |
{http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5495518}, |
keyword |
= |
{} |
} |
|
40 - Extraction of arbitrarily shaped objects using stochastic multiple birth-and-death dynamics and active contours. M. S. Kulikova and I. H. Jermyn and X. Descombes and E. Zhizhina and J. Zerubia. In Proc. IS&T/SPIE Electronic Imaging, San Jose, USA, January 2010. Keywords : Object extraction, Marked point process, Shape prior, Active contour, birth-and-death dynamics. Copyright : Copyright 2010 by SPIE and IS&T. This paper was published in the proceedings of IS&T/SPIE Electronic Imaging 2010 Conference in San Jose, USA, and is made available as an electronic reprint with permission of SPIE and IS&T. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited.
@INPROCEEDINGS{Kulikova10a,
|
author |
= |
{Kulikova, M. S. and Jermyn, I. H. and Descombes, X. and Zhizhina, E. and Zerubia, J.}, |
title |
= |
{Extraction of arbitrarily shaped objects using stochastic multiple birth-and-death dynamics and active contours}, |
year |
= |
{2010}, |
month |
= |
{January}, |
booktitle |
= |
{Proc. IS&T/SPIE Electronic Imaging}, |
address |
= |
{San Jose, USA}, |
pdf |
= |
{http://hal.archives-ouvertes.fr/docs/00/46/54/72/PDF/Kulikova_SPIE2010.pdf}, |
keyword |
= |
{Object extraction, Marked point process, Shape prior, Active contour, birth-and-death dynamics} |
} |
Abstract :
We extend the marked point process models that have been used for object extraction from images to arbitrarily shaped objects, without greatly increasing the computational complexity of sampling and estimation. From an alternative point of view, the approach can be viewed as an extension of the active contour methodology to an a priori unknown number of
objects. Sampling and estimation are based on a stochastic birth-and-death process defined on the configuration space of an arbitrary number of objects, where the objects are defined by the image data and prior information. The performance of the approach is demonstrated via experimental results on synthetic and real data. |
|
41 - High resolution SAR-image classification by Markov random fields and finite mixtures. G. Moser and V. Krylov and S.B. Serpico and J. Zerubia. In Proc. of SPIE (IS&T/SPIE Electronic Imaging 2010), Vol. 7533, pages 753308, San Jose, USA, January 2010. Keywords : SAR image classification, Dictionary, amplitude probability density, Stochastic EM (SEM), Markov random field, copula. Copyright : SPIE
@INPROCEEDINGS{moserSPIE2010a,
|
author |
= |
{Moser, G. and Krylov, V. and Serpico, S.B. and Zerubia, J.}, |
title |
= |
{High resolution SAR-image classification by Markov random fields and finite mixtures}, |
year |
= |
{2010}, |
month |
= |
{January}, |
booktitle |
= |
{Proc. of SPIE (IS&T/SPIE Electronic Imaging 2010)}, |
volume |
= |
{7533}, |
pages |
= |
{753308}, |
address |
= |
{San Jose, USA}, |
url |
= |
{http://proceedings.spiedigitallibrary.org/proceeding.aspx?articleid=776565}, |
pdf |
= |
{http://hal.archives-ouvertes.fr/inria-00442348/en/}, |
keyword |
= |
{SAR image classification, Dictionary, amplitude probability density, Stochastic EM (SEM), Markov random field, copula} |
} |
Abstract :
In this paper we develop a novel classification approach for high and very high resolution polarimetric synthetic aperture radar (SAR) amplitude images. This approach combines the Markov random field model to Bayesian image classification and a finite mixture technique for probability density function estimation. The finite mixture modeling is done via a recently proposed dictionary-based stochastic expectation maximization approach for SAR amplitude probability density function estimation. For modeling the joint distribution from marginals corresponding to single polarimetric channels we employ copulas. The accuracy of the developed semiautomatic supervised algorithm is validated in the application of wet soil classification on several high resolution SAR images acquired by TerraSAR-X and COSMO-SkyMed. |
|
42 - A marked point process model with strong prior shape information for extraction of multiple, arbitrarily-shaped objects. M. S. Kulikova and I. H. Jermyn and X. Descombes and E. Zhizhina and J. Zerubia. In Proc. IEEE SITIS, Publ. IEEE Computer Society, Marrakech, Maroc, December 2009. Keywords : Object extraction, Marked point process, Shape prior, Active contour, multiple birth-and-death dynamics.
@INPROCEEDINGS{Kulikova09a,
|
author |
= |
{Kulikova, M. S. and Jermyn, I. H. and Descombes, X. and Zhizhina, E. and Zerubia, J.}, |
title |
= |
{A marked point process model with strong prior shape information for extraction of multiple, arbitrarily-shaped objects}, |
year |
= |
{2009}, |
month |
= |
{December}, |
booktitle |
= |
{Proc. IEEE SITIS}, |
publisher |
= |
{IEEE Computer Society}, |
address |
= |
{Marrakech, Maroc}, |
pdf |
= |
{http://hal.inria.fr/docs/00/43/63/20/PDF/PID1054029.pdf}, |
keyword |
= |
{Object extraction, Marked point process, Shape prior, Active contour, multiple birth-and-death dynamics} |
} |
Abstract :
We define a method for incorporating strong prior shape information into a recently extended Markov point process model for the extraction of arbitrarily-shaped objects from images. To estimate the optimal configuration of objects, the process is sampled using a Markov chain based on a stochastic birth-and-death process defined in a space of multiple
objects. The single objects considered are defined by both the image data
and the prior information in a way that controls the computational
complexity of the estimation problem. The method is tested via experiments
on a very high resolution aerial image of a scene composed of tree crowns. |
|
43 - Building Extraction and Change Detection in Multitemporal Remotely Sensed Images with Multiple Birth and Death Dynamics. C. Benedek and X. Descombes and J. Zerubia. In IEEE Workshop on Applications of Computer Vision (WACV), pages 100-105, Snowbird, Utah, USA, December 2009. Keywords : Marked point process, Change detection, Aerial images, Building extraction, Satellite images.
@INPROCEEDINGS{benedekWacv09,
|
author |
= |
{Benedek, C. and Descombes, X. and Zerubia, J.}, |
title |
= |
{Building Extraction and Change Detection in Multitemporal Remotely Sensed Images with Multiple Birth and Death Dynamics}, |
year |
= |
{2009}, |
month |
= |
{December}, |
booktitle |
= |
{IEEE Workshop on Applications of Computer Vision (WACV)}, |
pages |
= |
{100-105}, |
address |
= |
{Snowbird, Utah, USA}, |
pdf |
= |
{http://hal.archives-ouvertes.fr/docs/00/42/66/18/PDF/benedekWACV09.pdf}, |
keyword |
= |
{Marked point process, Change detection, Aerial images, Building extraction, Satellite images} |
} |
Abstract :
In this paper we introduce a new probabilistic method which integrates building extraction with change detection in remotely sensed image pairs. A global optimization process attempts to find the optimal configuration of buildings, considering the observed data, prior knowledge, and interactions between the neighboring building parts. The accuracy is ensured by a Bayesian object model verification, meanwhile the computational cost is significantly decreased by a non-uniform stochastic object birth process, which proposes relevant objects with higher probability based on low-level image features.
|
|
44 - Reconstruction 3D du bâti par la technique des ombres chinoises. P. Lukashevish and A. Kraushonak and X. Descombes and J.D. Durou and B. Zalessky and E. Zhizhina. In GRETSI Dijon, Dijon, France, November 2009. Keywords : 3D reconstruction.
@INPROCEEDINGS{luka09,
|
author |
= |
{Lukashevish, P. and Kraushonak, A. and Descombes, X. and Durou, J.D. and Zalessky, B. and Zhizhina, E.}, |
title |
= |
{Reconstruction 3D du bâti par la technique des ombres chinoises}, |
year |
= |
{2009}, |
month |
= |
{November}, |
booktitle |
= |
{GRETSI Dijon}, |
address |
= |
{Dijon, France}, |
url |
= |
{http://hal.inria.fr/inria-00399208/fr/}, |
keyword |
= |
{3D reconstruction} |
} |
|
45 - Combining meshes and geometric primitives for accurate and semantic modeling. F. Lafarge and R. Keriven and M. Brédif. In Proc. British Machine Vision Conference (BMVC), London, U.K., November 2009.
@INPROCEEDINGS{lafarge_bmvc09,
|
author |
= |
{Lafarge, F. and Keriven, R. and Brédif, M.}, |
title |
= |
{Combining meshes and geometric primitives for accurate and semantic modeling}, |
year |
= |
{2009}, |
month |
= |
{November}, |
booktitle |
= |
{Proc. British Machine Vision Conference (BMVC)}, |
address |
= |
{London, U.K.}, |
url |
= |
{http://recherche.ign.fr/labos/matis/pdf/articles_conf/2009/bmvc_final_09.pdf}, |
keyword |
= |
{} |
} |
|
46 - A markov random field model for extracting near-circular shapes. T. Blaskovics and Z. Kato and I. H. Jermyn. In Proc. IEEE International Conference on Image Processing (ICIP), Cairo, Egypt, November 2009. Keywords : Segmentation, Markov Random Fields, Shape prior.
@INPROCEEDINGS{Blaskovics09,
|
author |
= |
{Blaskovics, T. and Kato, Z. and Jermyn, I. H.}, |
title |
= |
{A markov random field model for extracting near-circular shapes}, |
year |
= |
{2009}, |
month |
= |
{November}, |
booktitle |
= |
{Proc. IEEE International Conference on Image Processing (ICIP)}, |
address |
= |
{Cairo, Egypt}, |
pdf |
= |
{http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5413472}, |
keyword |
= |
{Segmentation, Markov Random Fields, Shape prior} |
} |
|
47 - Object extraction from high resolution SAR images using a birth and death dynamics. F. Arslan and X. Descombes and J. Zerubia. In Proc. IEEE International Conference on Image Processing (ICIP), Cairo, Egypt, November 2009. Keywords : High resolution SAR images, Object extraction, Marked point process, birth and death process.
@INPROCEEDINGS{Fatih09,
|
author |
= |
{Arslan, F. and Descombes, X. and Zerubia, J.}, |
title |
= |
{Object extraction from high resolution SAR images using a birth and death dynamics}, |
year |
= |
{2009}, |
month |
= |
{November}, |
booktitle |
= |
{Proc. IEEE International Conference on Image Processing (ICIP)}, |
address |
= |
{Cairo, Egypt}, |
url |
= |
{http://dx.doi.org/10.1109/ICIP.2009.5413907}, |
keyword |
= |
{High resolution SAR images, Object extraction, Marked point process, birth and death process} |
} |
Abstract :
We present a new approach to extract predefined objects, such as trees and oil tanks for instance, from high resolution SAR images. We consider a stochastic approach based on an object process also called marked point process. The objects represent trees or oil tanks which are modeled by disks in the image. We first define a Gibbs density that takes into account both prior information and the data. The energy we define is composed of two terms, one is a prior, penalizing overlaps between objects, and the other is a data term, which measures the suitability of an object in the SAR image. The problem is then reduced to an energy minimization problem. We sample the process to extract the configuration of objects minimizing the energy by a fast birth-and-death dynamics, leading to the total number of objects (trees or oil tanks in our case). This approach is much faster than manual counts and does not need any preprocessing or supervision of a user. |
|
48 - Multi-class SVM for forestry classification. N. Hajj Chehade and JG. Boureau and C. Vidal and J. Zerubia. In Proc. IEEE International Conference on Image Processing (ICIP), Cairo, Egypt, November 2009. Keywords : Support Vector Machines, texture segmentation, Haralick feature, remote sensing, Forest vegetation.
@INPROCEEDINGS{Nabil09,
|
author |
= |
{Hajj Chehade, N. and Boureau, JG. and Vidal, C. and Zerubia, J.}, |
title |
= |
{Multi-class SVM for forestry classification}, |
year |
= |
{2009}, |
month |
= |
{November}, |
booktitle |
= |
{Proc. IEEE International Conference on Image Processing (ICIP)}, |
address |
= |
{Cairo, Egypt}, |
url |
= |
{http://dx.doi.org/10.1109/ICIP.2009.5413395}, |
keyword |
= |
{Support Vector Machines, texture segmentation, Haralick feature, remote sensing, Forest vegetation} |
} |
Abstract :
In this paper we propose a method for classifying the vegetation types in an aerial color infra-red (CIR) image. Different vegetation types do not only differ in color, but also in texture. We study the use of four Haralick features (energy, contrast, entropy, homogeneity) for texture analysis, and then perform the classification using the one-against-all (OAA) multi-class support vector machine (SVM), which is a popular supervised learning technique for classification. The choice of features (along with their corresponding parameters), the choice of the training set, and the choice of the SVM kernel highly affect the performance of the classification. The study was done on several CIR aerial images provided by the French National Forest Inventory (IFN). In this paper, we will show one example on a national forest near Sedan (in France), and compare our result with the IFN map. |
|
49 - Estimation des paramčtres de processus ponctuels marqués dans le cadre de l'extraction d’objets en imagerie de télédétection. F. Chatelain and X. Descombes and J. Zerubia. In Proc. Symposium on Signal and Image Processing (GRETSI), Dijon, France, November 2009.
@INPROCEEDINGS{cha09a,
|
author |
= |
{Chatelain, F. and Descombes, X. and Zerubia, J.}, |
title |
= |
{Estimation des paramčtres de processus ponctuels marqués dans le cadre de l'extraction d’objets en imagerie de télédétection}, |
year |
= |
{2009}, |
month |
= |
{November}, |
booktitle |
= |
{Proc. Symposium on Signal and Image Processing (GRETSI)}, |
address |
= |
{Dijon, France}, |
url |
= |
{http://hal.inria.fr/inria-00399258/fr/}, |
keyword |
= |
{} |
} |
|
50 - Lidar Waveform Modeling using a Marked Point Process. C. Mallet and F. Lafarge and F. Bretar and U. Soergel and C. Heipke. In Proc. IEEE International Conference on Image Processing (ICIP), Cairo, Egypt, November 2009. Keywords : 3D point cloud, Lidar, Marked point process, RJMCMC.
@INPROCEEDINGS{mallet_icip09,
|
author |
= |
{Mallet, C. and Lafarge, F. and Bretar, F. and Soergel, U. and Heipke, C.}, |
title |
= |
{Lidar Waveform Modeling using a Marked Point Process}, |
year |
= |
{2009}, |
month |
= |
{November}, |
booktitle |
= |
{Proc. IEEE International Conference on Image Processing (ICIP)}, |
address |
= |
{Cairo, Egypt}, |
url |
= |
{http://dx.doi.org/10.1109/ICIP.2009.5413380}, |
keyword |
= |
{3D point cloud, Lidar, Marked point process, RJMCMC} |
} |
Abstract :
Lidar waveforms are 1D signal consisting of a train of echoes where each of them correspond to a scattering target of the Earth surface. Modeling these echoes with the appropriate parametric function is necessary to retrieve physical information about these objects and characterize their properties. This paper presents a marked point process based model to reconstruct a lidar signal in terms of a set of parametric functions. The model takes into account both a data term which measures the coherence between the models and the waveforms, and a regularizing term which introduces physical knowledge on the reconstructed signal. We search for the best configuration of functions by performing a Reversible Jump Markov Chain Monte Carlo sampler coupled with a simulated annealing. Results are finally presented on different kinds of signals in urban areas. |
|
51 - A phase field higher-order active contour model of directed networks. A. El Ghoul and I. H. Jermyn and J. Zerubia. In 2nd IEEE Workshop on Non-Rigid Shape Analysis and Deformable Image Alignment, at ICCV, Kyoto, Japan, September 2009. Keywords : Geometric prior, Shape, Higher-order actif contours, Phase Field, Directed networks. Copyright : ©2009 IEEE.
@INPROCEEDINGS{ElGhoul09b,
|
author |
= |
{El Ghoul, A. and Jermyn, I. H. and Zerubia, J.}, |
title |
= |
{A phase field higher-order active contour model of directed networks}, |
year |
= |
{2009}, |
month |
= |
{September}, |
booktitle |
= |
{2nd IEEE Workshop on Non-Rigid Shape Analysis and Deformable Image Alignment, at ICCV}, |
address |
= |
{Kyoto, Japan}, |
url |
= |
{https://hal.inria.fr/inria-00409910}, |
pdf |
= |
{http://hal.inria.fr/docs/00/40/99/10/PDF/nordia09aymenelghoul.pdf}, |
keyword |
= |
{Geometric prior, Shape, Higher-order actif contours, Phase Field, Directed networks} |
} |
Abstract :
The segmentation of directed networks is an important
problem in many domains, e.g. medical imaging (vascular
networks) and remote sensing (river networks). Directed
networks carry a unidirectional flow in each branch, which
leads to characteristic geometric properties. In this paper,
we present a nonlocal phase field model of directed networks.
In addition to a scalar field representing a region
by its smoothed characteristic function and interacting nonlocally
so as to favour network configurations, the model
contains a vector field representing the ‘flow’ through the
network branches. The vector field is strongly encouraged
to be zero outside, and of unit magnitude inside the region;
and to have zero divergence. This prolongs network
branches; controls width variation along a branch; and
produces asymmetric junctions for which total incoming
branch width approximately equals total outgoing branch
width. In conjunction with a new interaction function, it
also allows a broad range of stable branch widths. We
analyse the energy to constrain the parameters, and show
geometric experiments confirming the above behaviour. We
also show a segmentation result on a synthetic river image. |
|
52 - Algorithme rapide pour la restauration d'image régularisée sur les coefficients d'ondelettes. M. Carlavan and P. Weiss and L. Blanc-Féraud and J. Zerubia. In Proc. Symposium on Signal and Image Processing (GRETSI), Dijon, France, September 2009. Keywords : Deconvolution, nesterov scheme, Wavelets, l1 norm.
@INPROCEEDINGS{GRETSICarlavan09,
|
author |
= |
{Carlavan, M. and Weiss, P. and Blanc-Féraud, L. and Zerubia, J.}, |
title |
= |
{Algorithme rapide pour la restauration d'image régularisée sur les coefficients d'ondelettes}, |
year |
= |
{2009}, |
month |
= |
{September}, |
booktitle |
= |
{Proc. Symposium on Signal and Image Processing (GRETSI)}, |
address |
= |
{Dijon, France}, |
url |
= |
{http://www.math.univ-toulouse.fr/~weiss/Publis/Conferences/CarlavanGretsi09.pdf}, |
pdf |
= |
{http://www.math.univ-toulouse.fr/~weiss/Publis/Conferences/CarlavanGretsi09.pdf}, |
keyword |
= |
{Deconvolution, nesterov scheme, Wavelets, l1 norm} |
} |
Résumé :
De nombreuses méthodes de restauration d'images consistent ŕ minimiser une énergie convexe. Nous nous focalisons sur l'utilisation de ces méthodes et considérons la minimisation de deux critčres contenant une norme l1 des coefficients en ondelettes. La plupart des travaux publiés récemment proposent un critčre ŕ minimiser dans le domaine des coefficients en ondelettes, utilisant ainsi un a priori de parcimonie. Nous proposons un algorithme rapide et des résultats de déconvolution par minimisation d'un critčre dans le domaine image, avec un a priori de régularité exprimé dans le domaine image utilisant une décomposition redondante sur une trame. L'algorithme et le modčle proposés semblent originaux pour ce problčme en traitement d'images et sont performants en terme de temps de calculs et de qualité de restauration. Nous montrons des comparaisons entre les deux types d' a priori. |
Abstract :
Many image restoration techniques are based on convex energy minimization. We focus on the use of these techniques and consider the minimization of two criteria holding a l1-norm of wavelet coefficients. Most of the recent research works are based on the minimization of a criterion in the wavelet coefficients domain, namely as a sparse prior. We propose a fast algorithm and deconvolution results obtained by minimizing a criterion in the image domain using a redundant decomposition on a frame. The algorithm and model proposed are unusual for this problem and very efficient in term of computing time and quality of restoration results. We show comparisons between the two different priors. |
|
53 - Estimation d'hyperparamčtres pour la résolution de problčmes inverses ŕ l'aide d'ondelettes. C. Chaux and L. Blanc-Féraud. In Proc. Symposium on Signal and Image Processing (GRETSI), Dijon, France, September 2009.
@INPROCEEDINGS{ChauxGRETSI09,
|
author |
= |
{Chaux, C. and Blanc-Féraud, L.}, |
title |
= |
{Estimation d'hyperparamčtres pour la résolution de problčmes inverses ŕ l'aide d'ondelettes}, |
year |
= |
{2009}, |
month |
= |
{September}, |
booktitle |
= |
{Proc. Symposium on Signal and Image Processing (GRETSI)}, |
address |
= |
{Dijon, France}, |
url |
= |
{http://hdl.handle.net/2042/28911}, |
keyword |
= |
{} |
} |
Résumé :
Nous nous intéressons ŕ l'estimation des paramčtres de régularisation pour la restauration d'image floue et bruitée. Dans l'approche variationnelle, la restauration consiste ŕ minimiser un critčre convexe composé d'un terme de rappel aux données (quadratique) et d'un terme de régularisation (norme I1) opérant dans le domaine ondelettes. Nous proposons une méthode d'estimation des paramčtres de régularisation (hyperparamčtres, un par sous-bande) par maximum de vraisemblance, ŕ partir de la seule image observée. La difficulté de l'estimation en données incomplčtes est de pouvoir échantillonner des lois sur des champs de variables aléatoires dont les interactions entre voisins sont étendues, du fait de l'opérateur linéaire de flou. Nous proposons une méthode qui permet de calculer ces échantillons par MCMC (échantillonnage de Gibbs et Metropolis-Hastings). Pour l'estimation, nous utilisons une méthode de gradient. Les résultats de simulation obtenus montrent la faisabilité de la méthode et ses bonnes performances en terme d'estimation. |
|
54 - Inflection point model under phase field higher-order active contours for network extraction from VHR satellite images. A. El Ghoul and I. H. Jermyn and J. Zerubia. In Proc. European Signal Processing Conference (EUSIPCO), Glasgow, Scotland, August 2009. Keywords : Geometric prior, Shape, Higher-order active contour, Phase Field, remote sensing. Copyright : EURASIP
@INPROCEEDINGS{ElGhoul09a,
|
author |
= |
{El Ghoul, A. and Jermyn, I. H. and Zerubia, J.}, |
title |
= |
{Inflection point model under phase field higher-order active contours for network extraction from VHR satellite images}, |
year |
= |
{2009}, |
month |
= |
{August}, |
booktitle |
= |
{Proc. European Signal Processing Conference (EUSIPCO)}, |
address |
= |
{Glasgow, Scotland}, |
url |
= |
{http://hal.inria.fr/inria-00390446/fr/}, |
pdf |
= |
{http://hal.inria.fr/docs/00/39/04/46/PDF/eusipco09aymenelghoul.pdf}, |
keyword |
= |
{Geometric prior, Shape, Higher-order active contour, Phase Field, remote sensing} |
} |
Abstract :
The segmentation of networks is important in several imaging domains, and models incorporating prior shape knowledge are often essential for the automatic performance of this task. We incorporate such knowledge via phase fields and higher-order active contours (HOACs). In this paper: we introduce an improved prior model, the phase field HOAC ‘inflection point’ model of a network; we present an improved data term for the segmentation of road networks; we confirm the robustness of the resulting model to choice of gradient descent initialization; and we illustrate these points via road network extraction results on VHR satellite images. |
|
55 - Parameter estimation for marked point processes. Application to object extraction from remote sensing images. (poster). F. Chatelain and X. Descombes and J. Zerubia. In Proc. Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR), Bonn, Germany, August 2009.
@INPROCEEDINGS{ChatelainEMMCVPR09,
|
author |
= |
{Chatelain, F. and Descombes, X. and Zerubia, J.}, |
title |
= |
{Parameter estimation for marked point processes. Application to object extraction from remote sensing images. (poster)}, |
year |
= |
{2009}, |
month |
= |
{August}, |
booktitle |
= |
{Proc. Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR)}, |
address |
= |
{Bonn, Germany}, |
url |
= |
{http://link.springer.com/chapter/10.1007%2F978-3-642-03641-5_17}, |
keyword |
= |
{} |
} |
|
56 - A proximal method for inverse problems in image processing. P. Weiss and L. Blanc-Féraud. In Proc. European Signal Processing Conference (EUSIPCO), Glasgow, Scotland, August 2009. Keywords : Extragradient method, proximal method, Image decomposition, Meyer's model, convergence rate.
@INPROCEEDINGS{PWEISS_Eusipco,
|
author |
= |
{Weiss, P. and Blanc-Féraud, L.}, |
title |
= |
{A proximal method for inverse problems in image processing}, |
year |
= |
{2009}, |
month |
= |
{August}, |
booktitle |
= |
{Proc. European Signal Processing Conference (EUSIPCO)}, |
address |
= |
{Glasgow, Scotland}, |
url |
= |
{http://www.math.univ-toulouse.fr/~weiss/Publis/Conferences/Eusipco09.pdf}, |
pdf |
= |
{http://www.math.univ-toulouse.fr/~weiss/Publis/Conferences/Eusipco09.pdf}, |
keyword |
= |
{Extragradient method, proximal method, Image decomposition, Meyer's model, convergence rate} |
} |
Abstract :
In this paper, we present a new algorithm to solve some inverse problems coming from the field of image processing. The models we study consist in minimizing a regularizing, convex criterion under a convex and compact set. The main idea of our scheme consists in solving the underlying variational inequality with a proximal method rather than the initial convex problem. Using recent results of A. Nemirovski [13], we show that the scheme converges at least as O(1/k) (where k is the iteration counter). This is in some sense an optimal rate of convergence. Finally, we compare this approach to some others on a problem of image cartoon+texture decomposition. |
|
57 - Complex wavelet regularization for solving inverse problems in remote sensing. M. Carlavan and P. Weiss and L. Blanc-Féraud and J. Zerubia. In Proc. IEEE International Geoscience and Remote Sensing Symposium (IGARSS), Cape Town, South Africa, July 2009. Keywords : Deconvolution, Dual smoothing, nesterov scheme, remote sensing, wavelet.
|
58 - Conditional mixed-state model for structural change analysis from very high resolution optical images. B. Belmudez and V. Prinet and J.F. Yao and P. Bouthemy and X. Descombes. In Proc. IEEE International Geoscience and Remote Sensing Symposium (IGARSS), Cape Town, South Africa, July 2009. Keywords : Change detection, mixed Markov models.
@INPROCEEDINGS{bel09,
|
author |
= |
{Belmudez, B. and Prinet, V. and Yao, J.F. and Bouthemy, P. and Descombes, X.}, |
title |
= |
{Conditional mixed-state model for structural change analysis from very high resolution optical images}, |
year |
= |
{2009}, |
month |
= |
{July}, |
booktitle |
= |
{IGARSS}, |
address |
= |
{Cape Town, South Africa}, |
url |
= |
{http://hal.archives-ouvertes.fr/inria-00398062/}, |
keyword |
= |
{Change detection, mixed Markov models} |
} |
Abstract :
The present work concerns the analysis of dynamic scenes from earth observation images. We are interested in building a map which, on one hand locates places of change, on the other hand, reconstructs a unique visual information of the non-change areas. We show in this paper that such a problem can naturally be takled with conditional mixed-state random field modeling (mixed-state CRF), where the ”mixed state” refers to the symbolic or continous nature of the unknown variable. The maximum a posteriori (MAP) estimation of the CRF is, through the Hammersley-Clifford theorem, turned into an energy minimisation problem. We tested the model on several Quickbird images and illustrate the quality of the results. |
|
59 - Point-spread function retrieval for fluorescence microscopy. P. Pankajakshan and L. Blanc-Féraud and Z. Kam and J. Zerubia. In Proc. IEEE International Symposium on Biomedical Imaging (ISBI), Publ. IEEE, Org. IEEE, Boston, USA, June 2009. Keywords : fluorescence microscopy, point spread function, EM algorithm, Deconvolution. Copyright : Copyright 2009 IEEE. Published in the 2009 International Symposium on Biomedical Imaging: From Nano to Macro (ISBI 2009), scheduled for June 28 - July 1, 2009 in Boston, Massachusetts, U.S.A. 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. Contact: Manager, Copyrights and Permissions / IEEE Service Center / 445 Hoes Lane / P.O. Box 1331 / Piscataway, NJ 08855-1331, USA. Telephone: + Intl. 908-562-3966.
@INPROCEEDINGS{ppankajakshan09a,
|
author |
= |
{Pankajakshan, P. and Blanc-Féraud, L. and Kam, Z. and Zerubia, J.}, |
title |
= |
{Point-spread function retrieval for fluorescence microscopy}, |
year |
= |
{2009}, |
month |
= |
{June}, |
booktitle |
= |
{Proc. IEEE International Symposium on Biomedical Imaging (ISBI)}, |
publisher |
= |
{IEEE}, |
organization |
= |
{IEEE}, |
address |
= |
{Boston, USA}, |
pdf |
= |
{http://hal.inria.fr/docs/00/39/55/34/PDF/pankajakshan.pdf}, |
keyword |
= |
{fluorescence microscopy, point spread function, EM algorithm, Deconvolution} |
} |
Abstract :
In this paper we propose a method for retrieving the Point-Spread Function (PSF) of an imaging system given the observed images of fluorescent microspheres. Theoretically calculated PSFs often lack the experimental or microscope specific signatures while empirically obtained data are either over sized or (and) too noisy. The effect of noise and the influence of the microsphere size can be mitigated from the experimental data by using a Maximum Likelihood Expectation Maximization (MLEM) algorithm. The true experimental parameters can then be estimated by fitting the result to a model based on the scalar diffraction theory. The algorithm was tested on some simulated data and the results obtained validate the usefulness of the approach for retrieving the PSF from measured data. |
|
60 - A new variational method to detect points in biological images. D. Graziani and L. Blanc-Féraud and G. Aubert. In ISBI'09, Org. IEEE International Symposium on Biomedical Imaging, Boston, USA, June 2009. Keywords : Biological images, points detection, Gamma-convergence.
@INPROCEEDINGS{GRAZIANI_ISBI2009,
|
author |
= |
{Graziani, D. and Blanc-Féraud, L. and Aubert, G.}, |
title |
= |
{A new variational method to detect points in biological images}, |
year |
= |
{2009}, |
month |
= |
{June}, |
booktitle |
= |
{ISBI'09}, |
organization |
= |
{IEEE International Symposium on Biomedical Imaging}, |
address |
= |
{Boston, USA}, |
url |
= |
{http://dx.doi.org/10.1109/ISBI.2009.5193301}, |
keyword |
= |
{Biological images, points detection, Gamma-convergence} |
} |
Abstract :
We propose a new variational method to isolate points in biological images. As points are fine structures they are difficult to detect by derivative operators computed in the noisy image. In this paper we propose to compute a vector field from the observed intensity so that its divergence explodes at points. As the image could contains spots but also noise and curves where the divergence also blows up, we propose to capture spots by introducing suitable energy whose minimizers are given by the points we want to detect. In order to provide numerical experiments we approximate this energy by means of a sequence of more treatable functionals by a Gamma-convergence approach. Results are shown on synthetic and biological images. |
|
61 - Fast Realization of Digital Elevation Model . X. Descombes and A. Kraushonak and P. Lukashevish and B. Zalessky. In PRIP , pages 156-160, Minsk, Belarus, May 2009.
@INPROCEEDINGS{KRA-09,
|
author |
= |
{Descombes, X. and Kraushonak, A. and Lukashevish, P. and Zalessky, B.}, |
title |
= |
{Fast Realization of Digital Elevation Model }, |
year |
= |
{2009}, |
month |
= |
{May}, |
booktitle |
= |
{PRIP }, |
pages |
= |
{156-160}, |
address |
= |
{Minsk, Belarus}, |
url |
= |
{http://www.iapr.org/members/newsletter/Newsletter09-03/index_files/Page420.htm}, |
pdf |
= |
{https://hal.inria.fr/inria-00423678/document}, |
keyword |
= |
{} |
} |
|
62 - Smoothing techniques for convex problems. Applications in image processing. P. Weiss and M. Carlavan and L. Blanc-Féraud and J. Zerubia. In Proc. SAMPTA (international conference on Sampling Theory and Applications), Marseille, France, May 2009. Keywords : nesterov scheme, convergence rate, Dual smoothing.
@INPROCEEDINGS{PWEISS_SAMPTA09,
|
author |
= |
{Weiss, P. and Carlavan, M. and Blanc-Féraud, L. and Zerubia, J.}, |
title |
= |
{Smoothing techniques for convex problems. Applications in image processing}, |
year |
= |
{2009}, |
month |
= |
{May}, |
booktitle |
= |
{Proc. SAMPTA (international conference on Sampling Theory and Applications)}, |
address |
= |
{Marseille, France}, |
url |
= |
{http://www.math.univ-toulouse.fr/~weiss/Publis/Conferences/Eusipco09.pdf}, |
pdf |
= |
{http://www.math.univ-toulouse.fr/~weiss/Publis/Conferences/Sampta09.pdf}, |
keyword |
= |
{nesterov scheme, convergence rate, Dual smoothing} |
} |
Abstract :
In this paper, we present two algorithms to solve some inverse problems coming from the field of image processing. The problems we study are convex and can be expressed simply as sums of lp-norms of affine transforms of the image. We propose 2 different techniques. They are - to the best of our knowledge - new in the domain of image processing and one of them is new in the domain of mathematical programming. Both methods converge to the set of minimizers. Additionally, we show that they converge at least as O(1/N) (where N is the iteration counter) which is in some sense an ``optimal'' rate of convergence. Finally, we compare these approaches to some others on a toy problem of image super-resolution with impulse noise. |
|
63 - Dictionary-based probability density function estimation for high-resolution SAR data. V. Krylov and G. Moser and S.B. Serpico and J. Zerubia. In Proc. of SPIE (IS&T/SPIE Electronic Imaging 2009), Vol. 7246, pages 72460S, San Jose, USA, January 2009. Keywords : SAR image, Probability density function, parametric estimation, finite mixture models, Stochastic EM (SEM). Copyright : SPIE
@INPROCEEDINGS{KrylovSPIE09,
|
author |
= |
{Krylov, V. and Moser, G. and Serpico, S.B. and Zerubia, J.}, |
title |
= |
{Dictionary-based probability density function estimation for high-resolution SAR data}, |
year |
= |
{2009}, |
month |
= |
{January}, |
booktitle |
= |
{Proc. of SPIE (IS&T/SPIE Electronic Imaging 2009)}, |
volume |
= |
{7246}, |
pages |
= |
{72460S}, |
address |
= |
{San Jose, USA}, |
url |
= |
{http://proceedings.spiedigitallibrary.org/proceeding.aspx?articleid=812524}, |
pdf |
= |
{http://hal.archives-ouvertes.fr/inria-00361384/en/}, |
keyword |
= |
{SAR image, Probability density function, parametric estimation, finite mixture models, Stochastic EM (SEM)} |
} |
Abstract :
In the context of remotely sensed data analysis, a crucial problem is represented by the need to develop accurate models for the statistics of pixel intensities. In this work, we develop a parametric finite mixture model for the statistics of pixel intensities in high resolution synthetic aperture radar (SAR) images. This method is an extension of previously existing method for lower resolution images. The method integrates the stochastic expectation maximization (SEM) scheme and the method of log-cumulants (MoLC) with an automatic technique to select, for each mixture component, an optimal parametric model taken from a predefined dictionary of parametric probability density functions (pdf). The proposed dictionary consists of eight state-of-the-art SAR- specific pdfs: Nakagami, log-normal, generalized Gaussian Rayleigh, Heavy-tailed Rayleigh, Weibull, K-root, Fisher and generalized Gamma. The designed scheme is endowed with the novel initialization procedure and the algorithm to automatically estimate the optimal number of mixture components. The experimental results with a set of several high resolution COSMO-SkyMed images demonstrate the high accuracy of the designed algorithm, both from the viewpoint of a visual comparison of the histograms, and from the viewpoint of quantitive accuracy measures such as correlation coefficient (above 99,5%). The method proves to be effective on all the considered images, remaining accurate for multimodal and highly heterogeneous scenes. |
|
64 - Phase diagram of a long bar under a higher-order active contour energy: application to hydrographic network extraction from VHR satellite images. A. El Ghoul and I. H. Jermyn and J. Zerubia. In International Conference on Pattern Recognition (ICPR), Tampa, Florida, December 2008. Keywords : Phase diagram, Higher-order actif contours, Shape, river extraction.
@INPROCEEDINGS{ElGhoul08b,
|
author |
= |
{El Ghoul, A. and Jermyn, I. H. and Zerubia, J.}, |
title |
= |
{Phase diagram of a long bar under a higher-order active contour energy: application to hydrographic network extraction from VHR satellite images}, |
year |
= |
{2008}, |
month |
= |
{December}, |
booktitle |
= |
{International Conference on Pattern Recognition (ICPR)}, |
address |
= |
{Tampa, Florida}, |
url |
= |
{https://hal.inria.fr/inria-00316619}, |
pdf |
= |
{http://hal.inria.fr/docs/00/31/66/19/PDF/icpr08aymenelghoul.pdf}, |
keyword |
= |
{Phase diagram, Higher-order actif contours, Shape, river extraction} |
} |
Abstract :
The segmentation of networks is important in several imaging domains, and models incorporating prior shape knowledge are often essential for the automatic performance of this task. Higher-order active contours
provide a way to include such knowledge, but their behaviour can vary significantly with parameter values: e.g. the same energy can model networks or a ‘gas of circles’. In this paper, we present a stability analysis
of a HOAC energy leading to the phase diagram of a long bar. The results, which are confirmed by numerical experiments, enable the selection of parameter values for the modelling of network shapes using the energy.
We apply the resulting model to the problem of hydrographic network extraction from VHR satellite images. |
|
65 - A Mixed Markov Model for Change Detection in Aerial Photos with Large Time Differences. C. Benedek and T. Szirányi. In Proc. International Conference on Pattern Recognition (ICPR), Tampa, USA, December 2008. Keywords : Aerial images, Change detection, mixed Markov models.
@INPROCEEDINGS{benedekICPR08,
|
author |
= |
{Benedek, C. and Szirányi, T.}, |
title |
= |
{A Mixed Markov Model for Change Detection in Aerial Photos with Large Time Differences}, |
year |
= |
{2008}, |
month |
= |
{December}, |
booktitle |
= |
{Proc. International Conference on Pattern Recognition (ICPR)}, |
address |
= |
{Tampa, USA}, |
pdf |
= |
{http://hal.inria.fr/docs/00/35/91/16/PDF/benedekICPR08.pdf}, |
keyword |
= |
{Aerial images, Change detection, mixed Markov models} |
} |
Abstract :
In the paper we propose a novel multi-layer Mixed Markov model for detecting relevant changes in registered aerial images taken with significant time differences. The introduced approach combines global intensity statistics with local correlation and contrast features. A global energy optimization process simultaneously ensures optimal local feature selection and smooth, observation-consistent classification. Validation is given on real aerial photos. |
|
66 - A contrast equalization procedure for change detection algorithms: applications to remotely sensed images of urban areas. A. Fournier and P. Weiss and L. Blanc-Féraud and G. Aubert. In International Conference on Pattern Recognition (ICPR), Tampa, USA, December 2008. Keywords : Change detection, Level Lines, remote sensing. 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.
@INPROCEEDINGS{l_lines_icpr08,
|
author |
= |
{Fournier, A. and Weiss, P. and Blanc-Féraud, L. and Aubert, G.}, |
title |
= |
{A contrast equalization procedure for change detection algorithms: applications to remotely sensed images of urban areas}, |
year |
= |
{2008}, |
month |
= |
{December}, |
booktitle |
= |
{International Conference on Pattern Recognition (ICPR)}, |
address |
= |
{Tampa, USA}, |
url |
= |
{http://www.math.univ-toulouse.fr/~weiss/Publis/Conferences/icpr2008.pdf}, |
pdf |
= |
{http://www.math.univ-toulouse.fr/~weiss/Publis/Conferences/icpr2008.pdf}, |
keyword |
= |
{Change detection, Level Lines, remote sensing} |
} |
|
67 - Texture representation by geometric objects using a jump-diffusion process. F. Lafarge and G. Gimel'farb. In Proc. British Machine Vision Conference (BMVC), Leeds, U.K., November 2008.
@INPROCEEDINGS{lafarge_bmvc08,
|
author |
= |
{Lafarge, F. and Gimel'farb, G.}, |
title |
= |
{Texture representation by geometric objects using a jump-diffusion process}, |
year |
= |
{2008}, |
month |
= |
{November}, |
booktitle |
= |
{Proc. British Machine Vision Conference (BMVC)}, |
address |
= |
{Leeds, U.K.}, |
url |
= |
{http://www.comp.leeds.ac.uk/bmvc2008/proceedings/papers/86.pdf}, |
keyword |
= |
{} |
} |
|
68 - An extended phase field higher-order active contour model for networks and its application to road network extraction from VHR satellite images. T. Peng and I. H. Jermyn and V. Prinet and J. Zerubia. In Proc. European Conference on Computer Vision (ECCV), Marseille, France, October 2008. Keywords : Dense urban area, Phase Field, Road network, Variational methods, Very high resolution. Copyright :
@INPROCEEDINGS{Peng08c,
|
author |
= |
{Peng, T. and Jermyn, I. H. and Prinet, V. and Zerubia, J.}, |
title |
= |
{An extended phase field higher-order active contour model for networks and its application to road network extraction from VHR satellite images}, |
year |
= |
{2008}, |
month |
= |
{October}, |
booktitle |
= |
{Proc. European Conference on Computer Vision (ECCV)}, |
address |
= |
{Marseille, France}, |
pdf |
= |
{http://link.springer.com/chapter/10.1007%2F978-3-540-88690-7_38}, |
keyword |
= |
{Dense urban area, Phase Field, Road network, Variational methods, Very high resolution} |
} |
Abstract :
This paper addresses the segmentation from an image of entities that have the form of a 'network', i.e. the region in the image corresponding to the entity is composed of branches joining together at junctions, e.g. road or vascular networks. We present a new phase field higher-order active contour (HOAC) prior model for network regions, and apply it to the segmentation of road networks from very high resolution satellite images. This is a hard problem for two reasons. First, the images are complex, with much 'noise' in the road region due to cars, road markings, etc., while the background is very varied, containing many features that are locally similar to roads. Second, network regions are complex to model, because they may have arbitrary topology. In particular, we address a severe limitation of a previous model in which network branch width was constrained to be similar to maximum network branch radius of curvature, thereby providing a poor model of networks with straight narrow branches or highly curved, wide branches. To solve this problem, we propose a new HOAC prior energy term, and reformulate it as a nonlocal phase field energy. We analyse the stability of the new model, and find that in addition to solving the above problem by separating the interactions between points on the same and opposite sides of a network branch, the new model permits the modelling of two widths
simultaneously. The analysis also fixes some of the model parameters in terms of network width(s). After adding a likelihood energy, we use the model to extract the road network quasi-automatically from pieces of a QuickBird image, and compare the results to other models in the literature. The results demonstrate the superiority of the new model, the importance of strong prior knowledge in general, and of the new term in particular. |
|
top of the page
These pages were generated by
|