A Computational Approach to Edge Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computational geometry in C
Run-Based Algorithms for Binary Image Analysis and Processing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Convexity rule for shape decomposition based on discrete contour evolution
Computer Vision and Image Understanding
Fast algorithm for generating sorted contour strings
Computers & Geosciences
Digital Image Processing: PIKS Inside
Digital Image Processing: PIKS Inside
Algorithms for Graphics and Imag
Algorithms for Graphics and Imag
Shape Analysis and Classification: Theory and Practice
Shape Analysis and Classification: Theory and Practice
A new one-pass algorithm to detect region boundaries
Pattern Recognition Letters
Technical Section: Volume-enclosing surface extraction
Computers and Graphics
| Hi-index | 0.00 |
In this paper, a new framework for one-dimensional contour extraction from discrete two-dimensional data sets is presented. Contour extraction is important in many scientific fields such as digital image processing, computer vision, pattern recognition, etc. This novel framework includes (but is not limited to) algorithms for dilated contour extraction, contour displacement, shape skeleton extraction, contour continuation, shape feature based contour refinement and contour simplification. Many of the new techniques depend strongly on the application of a Delaunay tessellation. In order to demonstrate the versatility of this novel toolbox approach, the contour extraction techniques presented here are applied to scientific problems in material science, biology, handwritten letter recognition, astronomy and heavy ion physics.