A heuristic method for initial dominant point detection for polygonal approximations
- 11 Downloads
This paper presents a novel initial dominant point detection technique for polygonal approximation in digital planar curves. This technique concentrates on the local and global deviation of the curve and detects the dominant point of the polygon. An iterative split and merge strategy is used effectively to insert and/or delete vertex during the approximation of the polygon. Since the internal steps are automated, a symmetric and better approximation is achieved. The technique is robust to rotation and noise of the shape and produces better results compared to the results obtained by recent work. The performance of the proposed system is evaluated using the benchmark data set and the same is compared in terms of the quantitative and qualitative measures. The experimental results show that proposed technique has outperformed an existing similar method with respect to visual perception and numeric metrics.
KeywordsPolygonal approximation Digital planar curve Dominant points Local deviation Global deviation Break points Split and merge
Compliance with ethical standards
Conflict of interest
The authors do not have any conflicts of interest to declare.
- Cherkassky BV, Goldberg AV, Radzik T (1994) Shortest paths algorithms: theory and experimental evaluation. In: SODA: ACM-SIAM symposium on discrete algorithms (a conference on theoretical and experimental analysis of discrete algorithms)Google Scholar
- Hosur PI, Kai-Kuang M (1999) A novel scheme for progressive polygon approximation of shape contours. In: IEEE 3rd workshop on multimedia, signal process, pp 309–314Google Scholar
- Jeannin S, Bober M (1999) Description of core experiments for MPEG-7 motion/shape, MPEG-7, ISO/IEC/JTC1/SC29/WG11/MPEG99/N2690, SeoulGoogle Scholar
- MPEG-7 Core Experiment CE-Shape-1 Test Set (Part B), benchmarking image database for shape recognition techniques. http://www.cis.temple.edu/~latecki/TestData/mpeg7shapeB.tar.gz