Shape decomposition using Farey sequence and saddle points

Authors:
Sanjoy Pratihar;Partha Bhowmick
Affiliations:
University Institute of Technology, University of Burdwan, Burdwan, India;Indian Institute of Technology, Kharagpur, India
Venue:
Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing
Year:
2010

Citing 12
Cited 0

Morphological Shape Decomposition

IEEE Transactions on Pattern Analysis and Machine Intelligence
FORMS: a flexible object recognition and modeling system

International Journal of Computer Vision
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Concrete Math

Concrete Math
Nonparametric Segmentation of Curves into Various Representations

IEEE Transactions on Pattern Analysis and Machine Intelligence
Decomposing Polygon Meshes by Means of Critical Points

MMM '04 Proceedings of the 10th International Multimedia Modelling Conference
Digital Geometry: Geometric Methods for Digital Picture Analysis

Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital straightness: a review

Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
The representation and matching of categorical shape

Computer Vision and Image Understanding
Digital Straight Line Segments

IEEE Transactions on Computers
A Thinning-free Algorithm for Straight Edge Detection in a Gray-scale Image

ICAPR '09 Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition
Fast Polygonal Approximation of Digital Curves Using Relaxed Straightness Properties

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

A novel algorithm for boundary-based shape decomposition is proposed. The algorithm uses Farey sequence for determining several measures, such as slopes of edges and turn types at vertices of the polygonal cover P corresponding to the concerned shape. The fraction ranks (indices) in the Farey sequence have been used in the related procedures to enable computations in the integer domain while merging straight edges of P, which are almost collinear, and to perform turn checking at the vertices of P. Such turn checking aids in extracting the saddle points and constructing the visibility graph to finally output the decomposition. Experimental results demonstrate the efficiency and elegance of the proposed algorithm.