A discrete geometry approach for dominant point detection

Authors:
Thanh Phuong Nguyen;Isabelle Debled-Rennesson
Affiliations:
LORIA, UMR 7503, Nancy University, Campus Scientifique - BP 239, 54506 Vanduvre-lès-Nancy Cedex, France;LORIA, UMR 7503, Nancy University, Campus Scientifique - BP 239, 54506 Vanduvre-lès-Nancy Cedex, France
Venue:
Pattern Recognition
Year:
2011

Citing 27
Cited 8

On the Detection of Dominant Points on Digital Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
A piecewise linear approximation method preserving visual feature points of original figures

CVGIP: Graphical Models and Image Processing
Non-parametric dominant point detection

Pattern Recognition
Detection of significant points and polygonal approximation of digitized curves

Pattern Recognition Letters
An algorithm for polygonal approximation of digitized curves

Pattern Recognition Letters
A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves

Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
A boundary concavity code to support dominant point detection

Pattern Recognition Letters
Corner Detection and Interpretation on Planar Curves Using Fuzzy Reasoning

IEEE Transactions on Pattern Analysis and Machine Intelligence
Wavelet-based corner detection technique using optimal scale

Pattern Recognition Letters
Polygon Evolution by Vertex Deletion

SCALE-SPACE '99 Proceedings of the Second International Conference on Scale-Space Theories in Computer Vision
Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature

DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Piecewise Polygonal Approximation of Digital Curves

IV '04 Proceedings of the Information Visualisation, Eighth International Conference
Detection of Dominant Points Based on Noise Suppression and Error Minimisation

ICITA '05 Proceedings of the Third International Conference on Information Technology and Applications (ICITA'05) Volume 2 - Volume 02
Polygonal approximation of closed discrete curves

Pattern Recognition
Dominant point detection by reverse polygonization of digital curves

Image and Vision Computing
Comparison of Discrete Curvature Estimators and Application to Corner Detection

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Angle Detection on Digital Curves

IEEE Transactions on Computers
Optimal blurred segments decomposition of noisy shapes in linear time

Computers and Graphics
Dominant point detection: A new proposal

Image and Vision Computing
Curvature estimation in noisy curves

CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Tangential cover for thick digital curves

DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Fast and robust dominant points detection on digital curves

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Image matching by multiscale oriented corner correlation

ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part I
Fast guaranteed polygonal approximations of closed digital curves

SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
An elementary algorithm for digital line recognition in the general case

DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Optimal algorithm for lossy vector data compression

ICIAR'07 Proceedings of the 4th international conference on Image Analysis and Recognition

Decomposition of a curve into arcs and line segments based on dominant point detection

SCIA'11 Proceedings of the 17th Scandinavian conference on Image analysis
Ellipse detection through decomposition of circular arcs and line segments

ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing: Part I
A non-heuristic dominant point detection based on suppression of break points

ICIAR'12 Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part I
A novel framework for making dominant point detection methods non-parametric

Image and Vision Computing
Contour-based shape representation using principal curves

Pattern Recognition
New method to find corner and tangent vertices in sketches using parametric cubic curves approximation

Pattern Recognition
ε-Isometry based shape approximation for image content representation

Signal Processing
Knot segmentation in noisy 3d images of wood

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose two fast methods for dominant point detection and polygonal representation of noisy and possibly disconnected curves based on a study of the decomposition of the curve into the sequence of maximal blurred segments [2]. Starting from results of discrete geometry [3,4], the notion of maximal blurred segment of width @n[2] has been proposed, well adapted to possibly noisy curves. The first method uses a fixed parameter that is the width of considered maximal blurred segments. The second method is deduced from the first one based on a multi-width approach to obtain a non-parametric method that uses no threshold for working with noisy curves. Comparisons with other methods in the literature prove the efficiency of our approach. Thanks to a recent result [5] concerning the construction of the sequence of maximal blurred segments, the complexity of the proposed methods is O(nlogn). An application of vectorization is also given in this paper.