A Computational Approach to Edge Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer Vision and Image Processing: A Practical Approach Using Cviptools with Cdrom
Computer Vision and Image Processing: A Practical Approach Using Cviptools with Cdrom
A Pyramidal Data Structure for Triangle-Based Surface Description
IEEE Computer Graphics and Applications
Algorithms for Manipulating Compressed Images
IEEE Computer Graphics and Applications
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Combining Region Splitting and Edge Detection through Guided Delaunay Image Subdivision
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
A Minimum-Variance Adaptive Surface Mesh
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Efficient Approximation of Range Images Through Data-Dependent Adaptive Triangulations
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Compressed-domain techniques for image/video indexing and manipulation
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1
Fast Extraction to Surface Primitives from Range Images
ICPR '96 Proceedings of the International Conference on Pattern Recognition (ICPR '96) Volume III-Volume 7276 - Volume 7276
A New Contour-Based Approach to Object Recognition for Assembly Line Robots
Proceedings of the 23rd DAGM-Symposium on Pattern Recognition
| Hi-index | 0.00 |
A new algorithm for approximating intensity images with adaptive triangular meshes keeping image discontinuities and avoiding optimization is presented. The algorithm consists of two main stages. In the first stage, the original image is adaptively sampled at a set of points, taking into account both image discontinuities and curvatures. In the second stage, the sampled points are triangulated by applying a constrained 2D Delaunay algorithm. The obtained triangular meshes are compact representations that model the regions and discontinuities present in the original image with many fewer points. Thus, image processing operations applied upon those meshes can perform faster than upon the original images. As an example, four simple operations (translation, rotation, scaling and deformation) have been implemented in the 3D geometric domain and compared to their image domain counterparts.