Low-level segmentation of aerial images with fuzzy clustering
IEEE Transactions on Systems, Man and Cybernetics
Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Modeling with Front Propagation: A Level Set Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
SIAM Journal on Applied Mathematics
Active shape models—their training and application
Computer Vision and Image Understanding
Graphical Models and Image Processing
Scale-based fuzzy connected image segmentation: theory, algorithms, and validation
Computer Vision and Image Understanding - Special issue on analysis of volumetric image
Computer Vision and Image Understanding
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model
International Journal of Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hybrid Segmentation of Anatomical Data
MICCAI '01 Proceedings of the 4th International Conference on Medical Image Computing and Computer-Assisted Intervention
Geometric Level Set Methods in Imaging,Vision,and Graphics
Geometric Level Set Methods in Imaging,Vision,and Graphics
Computing Geodesics and Minimal Surfaces via Graph Cuts
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Graph Cuts and Efficient N-D Image Segmentation
International Journal of Computer Vision
Image Processing And Analysis: Variational, Pde, Wavelet, And Stochastic Methods
Image Processing And Analysis: Variational, Pde, Wavelet, And Stochastic Methods
Iterative relative fuzzy connectedness for multiple objects with multiple seeds
Computer Vision and Image Understanding
Links Between Image Segmentation Based on Optimum-Path Forest and Minimum Cut in Graph
Journal of Mathematical Imaging and Vision
Computer Vision and Image Understanding
Affinity functions in fuzzy connectedness based image segmentation I: Equivalence of affinities
Computer Vision and Image Understanding
Computer Vision and Image Understanding
Multidimensional Edge Detection by Hypersurface Fitting
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automatic watershed segmentation of randomly textured color images
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
LS-SVM based image segmentation using color and texture information
Journal of Visual Communication and Image Representation
BI'12 Proceedings of the 2012 international conference on Brain Informatics
Computer Vision and Image Understanding
Hi-index | 0.00 |
In the current vast image segmentation literature, there seems to be considerable redundancy among algorithms, while there is a serious lack of methods that would allow their theoretical comparison to establish their similarity, equivalence, or distinctness. In this paper, we make an attempt to fill this gap. To accomplish this goal, we argue that: (1) every digital segmentation algorithm A should have a well defined continuous counterpart M"A, referred to as its model, which constitutes an asymptotic of A when image resolution goes to infinity; (2) the equality of two such models M"A and M"A"^"' establishes a theoretical (asymptotic) equivalence of their digital counterparts A and A^'. Such a comparison is of full theoretical value only when, for each involved algorithm A, its model M"A is proved to be an asymptotic of A. So far, such proofs do not appear anywhere in the literature, even in the case of algorithms introduced as digitizations of continuous models, like level set segmentation algorithms. The main goal of this article is to explore a line of investigation for formally pairing the digital segmentation algorithms with their asymptotic models, justifying such relations with mathematical proofs, and using the results to compare the segmentation algorithms in this general theoretical framework. As a first step towards this general goal, we prove here that the gradient based thresholding model M"@? is the asymptotic for the fuzzy connectedness Udupa and Samarasekera segmentation algorithm used with gradient based affinity A"@?. We also argue that, in a sense, M"@? is the asymptotic for the original front propagation level set algorithm of Malladi, Sethian, and Vemuri, thus establishing a theoretical equivalence between these two specific algorithms. Experimental evidence of this last equivalence is also provided.