IEEE Transactions on Pattern Analysis and Machine 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
Computer graphics handbook: geometry and mathematics
Computer graphics handbook: geometry and mathematics
Scale-Based Detection of Corners of Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Corner Detection and Interpretation on Planar Curves Using Fuzzy Reasoning
IEEE Transactions on Pattern Analysis and Machine Intelligence
CAD/Cam Theory and Practice
Nonparametric Segmentation of Curves into Various Representations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improving fitting quality of polygonal approximation by using the dynamic programming technique
Pattern Recognition Letters
Pattern Recognition Letters
Pattern Recognition Letters
Approximation of digital curves with line segments and circular arcs using genetic algorithms
Pattern Recognition Letters
Hierarchical representation of digitized curves through dominant point detection
Pattern Recognition Letters
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
A randomized knot insertion algorithm for outline capture of planar images using cubic spline
Proceedings of the 2007 ACM symposium on Applied computing
Outline Capture of Images by Multilevel Coordinate Search on Cubic Splines
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Hi-index | 0.00 |
This paper presents a multiprimitive segmentation method with line segments and conic arcs based on the types of breakpoints. In this method, a joint tuning procedure is proposed to merge consecutive segments and adjust their locations to achieve more accurate and stable conic arcs. No threshold is required in the multiprimitive segmentation by using the proposed scheme. And, the types of breakpoints among line segments and conic arcs are defined and they are useful and meaningful for pattern recognition and shape analysis. Besides, the computational complexity of the proposed method is O(n log n) which is lower than most other conic fitting methods. Further, the concept of types of breakpoints can be easily extended to other primitives.