IEEE Transactions on Pattern Analysis and Machine Intelligence
Perceptual Organization and Curve Partitioning
IEEE Transactions on Pattern Analysis and Machine Intelligence
Three-dimensional object recognition from single two-dimensional images
Artificial Intelligence
Segmentation of edges into lines and arcs
Image and Vision Computing
On the Detection of Dominant Points on Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Techniques for segmenting image curves into meaningful descriptions
Pattern Recognition
Segmentation of digital plane curves: a dynamic focusing approach
Pattern Recognition Letters
Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Comments on "Nonparametric Segmentation of Curves Into Various Representations"
IEEE Transactions on Pattern Analysis and Machine Intelligence
Nonparametric Segmentation of Curves into Various Representations
IEEE Transactions on Pattern Analysis and Machine Intelligence
A rotationally invariant two-phase scheme for corner detection
Pattern Recognition
Object recognition using wavelets, L-G graphs and synthesis of regions
Pattern Recognition
On the decomposition of cell clusters
Journal of Mathematical Imaging and Vision
Segmentation and multi-model approximation of digital curves
Pattern Recognition Letters
Hi-index | 0.14 |
A breakpoint classification and tuning approach is proposed for the multiprimitive segmentation of planar curves, and cockhead-like graph is suggested to evaluate the multiprimitive segmentation algorithms. The breakpoints are divided into corners and smooth joints and the types of the segments on both sides of a breakpoint are identified. Then, a joint tuning procedure is exercised to merge/split segments and adjust the joint locations. The carefully designed cockhead-like graph includes all possible combinations and parameters of line and arc segments and serves as a benchmark to test the algorithms. The proposed scheme is simple, fast, threshold-free and robust to quantization and preprocessing errors, thus allowing it to be employed in a variety of applications such as matching and recognition. Test against the suggested benchmark and comparison with those in the literature assures the superiority of the method suggested herein.