Multiple Contour Finding and Perceptual Grouping using Minimal Paths

Authors:
Laurent D. Cohen
Affiliations:
CEREMADE, UMR 7534 Université Paris-Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris cedex 16, France. cohen@ceremade.dauphine.fr
Venue:
Journal of Mathematical Imaging and Vision
Year:
2001

Citing 11
Cited 17

On active contour models and balloons

CVGIP: Image Understanding
Shape Modeling with Front Propagation: A Level Set Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence
Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours

IEEE Transactions on Pattern Analysis and Machine Intelligence
Sub-pixel distance maps and weighted distance transforms

Journal of Mathematical Imaging and Vision - Special issue on topology and geometry in computer vision
Inferring global perceptual contours from local features

International Journal of Computer Vision - Special issue on computer vision research at the University of Southern California
Geodesic Active Contours

International Journal of Computer Vision
Global Minimum for Active Contour Models: A Minimal Path Approach

International Journal of Computer Vision
Finite-Element Methods for Active Contour Models and Balloons for 2-D and 3-D Images

IEEE Transactions on Pattern Analysis and Machine Intelligence
Finding Shortest Paths on Surfaces Using Level Sets Propagation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Local Parallel Computation of Stochastic Completion Fields

CVPR '96 Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96)
Stochastic completion fields: a neural model of illusory contour shape and salience

ICCV '95 Proceedings of the Fifth International Conference on Computer Vision

Multiple Contour Finding and Perceptual Grouping as a Set of Energy Minimizing Paths

EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Energy Partitions and Image Segmentation

Journal of Mathematical Imaging and Vision
Globally Optimal Geodesic Active Contours

Journal of Mathematical Imaging and Vision
Fast Constrained Surface Extraction by Minimal Paths

International Journal of Computer Vision
Geodesic Remeshing Using Front Propagation

International Journal of Computer Vision
Fast Surface Segmentation Guided by User Input Using Implicit Extension of Minimal Paths

Journal of Mathematical Imaging and Vision
Local or Global Minima: Flexible Dual-Front Active Contours

IEEE Transactions on Pattern Analysis and Machine Intelligence
Attribute-space connectivity and connected filters

Image and Vision Computing
Meshless geometric subdivision

Graphical Models
Fast Object Segmentation by Growing Minimal Paths from a Single Point on 2D or 3D Images

Journal of Mathematical Imaging and Vision
Fuzzy energy-based active contours

IEEE Transactions on Image Processing
The extrema edges

Scale Space'03 Proceedings of the 4th international conference on Scale space methods in computer vision
Geodesic Methods in Computer Vision and Graphics

Foundations and Trends® in Computer Graphics and Vision
Heuristically driven front propagation for geodesic paths extraction

VLSM'05 Proceedings of the Third international conference on Variational, Geometric, and Level Set Methods in Computer Vision
Local or global minima: flexible dual-front active contours

CVBIA'05 Proceedings of the First international conference on Computer Vision for Biomedical Image Applications
A hybrid scheme for contour detection and completion based on topological gradient and fast marching algorithms - application to inpainting and segmentation

SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
Contour detection and completion for inpainting and segmentation based on topological gradient and fast marching algorithms

Journal of Biomedical Imaging - Special issue on Mathematical Methods for Images and Surfaces 2011

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in the image. A new method to find complete curves from a set of contours or edge points is presented. Our approach is based on a previous work on finding contours as minimal paths between two end points using the fast marching algorithm (L. D Cohen and R. Kimmel, International Journal of Computer Vision, Vol. 24, No. 1, pp. 57–78, 1997). Given a set of key points, we find the pairs of points that have to be linked and the paths that join them. We use the saddle points of the minimal action map. The paths are obtained by backpropagation from the saddle points to both points of each pair.In a second part, we propose a scheme that does not need key points for initialization. A set of key points is automatically selected from a larger set of admissible points. At the same time, saddle points between pairs of key points are extracted. Next, paths are drawn on the image and give the minimal paths between selected pairs of points. The set of minimal paths completes the initial set of contours and allows to close them. We illustrate the capability of our approach to close contours with examples on various images of sets of edge points of shapes with missing contours.