Novel method to obtain the optimal polygonal approximation of digital planar curves based on Mixed Integer Programming |
| |
| Affiliation: | 1. School of Electronic and Information Engineering, Xi’an Jiaotong University, Xi’an 710049, PR China;2. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, PR China;1. Department of Electronic Engineering, National Ilan University, Yilan 26047, Taiwan;2. Department of Information Management, St. Mary’s Junior College of Medicine, Nursing and Management, Yilan 26644, Taiwan;1. PDPM Indian Institute of Information Technology, Design and Manufacturing Jabalpur, Dumna Airport Road, Jabalpur 482-005, M.P., India;2. Graduate School of Information Science and Engineering, Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8552, Japan;1. Fujian Key Laboratory of Sensing and Computing for Smart City, School of Information Science and Technology, Xiamen University, Xiamen 361005, China;2. Cognitive Science Department, Xiamen University, Xiamen 361005, China;3. Computer Science Department, Xiamen University, Xiamen 361005, China |
| |
| Abstract: | Polygonal approximations of digital planar curves are very useful for a considerable number of applications in computer vision. A great interest in this area has generated a huge number of methods for obtaining polygonal approximations. A good measure to compare these methods is known as Rosin’s merit. This measure uses the optimal polygonal approximation, but the state-of-the-art methods require a tremendous computation time for obtaining this optimal solution.We focus on the problem of obtaining the optimal polygonal approximation of a digital planar curve. Given N ordered points on a Euclidean plane, an efficient method to obtain M points that defines a polygonal approximation with the minimum distortion is proposed.The new solution relies on Mixed Integer Programming techniques in order to obtain the minimum value of distortion. Results, show that computation time for the new method dramatically decreases in comparison with state-of-the-art methods for obtaining the optimal polygonal approximation. |
| |
| Keywords: | Polygonal approximation Digital planar curve Mixed Integer Programming Discrete optimization Dominant points Breakpoints Integral square error Optimization |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
