Fast curvilinear structure extraction and delineation using density estimation
Computer Vision and Image Understanding
Tangential cover for thick digital curves
Pattern Recognition
Blurred Segments in Gray Level Images for Interactive Line Extraction
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Tangential cover for thick digital curves
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Detection of circular arcs in a digital image using chord and sagitta properties
GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution
Shape decomposition using Farey sequence and saddle points
Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing
Vectorization of thick digital lines using Farey sequence and geometric refinement
Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing
Efficient robust digital hyperplane fitting with bounded error
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
On the representation of a digital contour with an unordered point set for visual perception
Journal of Visual Communication and Image Representation
Topological features for recognizing printed and handwritten Bangla characters
Proceedings of the 2011 Joint Workshop on Multilingual OCR and Analytics for Noisy Unstructured Text Data
A generic and parallel algorithm for 2D digital curve polygonal approximation
Journal of Real-Time Image Processing
Detection of structural concavities in character images--a writer-independent approach
PerMIn'12 Proceedings of the First Indo-Japan conference on Perception and Machine Intelligence
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
Generation of Random Digital Simple Curves with Artistic Emulation
Journal of Mathematical Imaging and Vision
Recognition of Bangla compound characters using structural decomposition
Pattern Recognition
| Hi-index | 0.14 |
Several existing digital straight line segment (DSS) recognition algorithms can be used to determine the digital straightness of a given one-pixel-thick digital curve. Because of the inherent geometric constraints of digital straightness, these algorithms often produce a large number of segments to cover a given digital curve representing a real-life object/image. Thus, a curve segment, which is not exactly digitally straight but appears to be visually straight, is fragmented into multiple DSS when these algorithms are run. In this paper, a new concept of approximate straightness is introduced by relaxing certain conditions of DSS, and an algorithm is described to extract those segments from a digital curve. The number of such segments required to cover the curve is found to be significantly fewer than that of the exact DSS cover. As a result, the data set required for representing a curve also reduces to a large extent. The extracted set of segments can further be combined to determine a compact polygonal approximation of a digital curve based on certain approximation criteria and a specified error tolerance. The proposed algorithm involves only primitive integer operations and, thus, runs very fast compared to those based on exact DSS. The overall time complexity becomes linear in the number of points present in the representative set. Experimental results on several digital curves demonstrate the speed, elegance, and efficacy of the proposed method.