Hierarchical representation of digitized curves through dominant point detection

Authors:
Biswajit Sarkar;Sanghamitra Roy;Debranjan Sarkar
Affiliations:
Variable Energy Cyclotron Centre, l/AF Bidhan Nagar, Kolkata 700 064, India;Flat No. 112, DB-31, Bidhan Nagar, Kolkata 700 064, India;Variable Energy Cyclotron Centre, l/AF Bidhan Nagar, Kolkata 700 064, India
Venue:
Pattern Recognition Letters
Year:
2003

Citing 18
Cited 5

On the Detection of Dominant Points on Digital Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Applications of spatial data structures: Computer graphics, image processing, and GIS

Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures

The design and analysis of spatial data structures
The arc tree: an approximation scheme to represent arbitrary curved shapes

Computer Vision, Graphics, and Image Processing
An algorithm for detection of dominant points and 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
Optimum polygonal approximation of digitized curves

Pattern Recognition Letters
Hierarchical representation of chain-encoded binary image contours

Computer Vision and Image Understanding
Another look at the dominant point detection of digital curves

Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Hierarchical representation of 2-D shapes using convex polygons: A morphological approach

Pattern Recognition Letters
A new method for polygonal approximation using genetic algorithms

Pattern Recognition Letters
A boundary concavity code to support dominant point detection

Pattern Recognition Letters
Computer Processing of Line-Drawing Images

ACM Computing Surveys (CSUR)
Strip trees: a hierarchical representation for curves

Communications of the ACM
An efficient algorithm for the optimal polygonal approximation of digitized curves

Pattern Recognition Letters
The Performance of Curve Representation Schemes

IEEE Computer Graphics and Applications
Improving fitting quality of polygonal approximation by using the dynamic programming technique

Pattern Recognition Letters

Modified Arc tree based hierarchical representation of digital curve

Pattern Recognition Letters
Any dimension polygonal approximation based on equal errors principle

Pattern Recognition Letters
Multiprimitive segmentation based on meaningful breakpoints for fitting digital planar curves with line segments and conic arcs

Image and Vision Computing
Fast guaranteed polygonal approximations of closed digital curves

SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
A novel framework for making dominant point detection methods non-parametric

Image and Vision Computing

Quantified Score

Hi-index	0.10

Visualization

Abstract

Hierarchical data structures play a key role in representation of spatial data. This paper proposes an algorithm for constructing hierarchical representations of digitized curves based on the dominant points of the curve. The comparison of the proposed scheme with the other hierarchical representation schemes viz. Arc Tree and Strip Tree reveals that the proposed algorithm is generally better than the Arc Tree and compares well with the Strip Tree scheme.