Matrix computations (3rd ed.)
An Efficient k-Means Clustering Algorithm: Analysis and Implementation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Image Compression via TRITREE Decomposition
SIBGRAPI '00 Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing
A Feature-Based Scalable Codec for Image Compression
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2
Visual Computing: Geometry, Graphics, And Vision (Graphics Series)
Visual Computing: Geometry, Graphics, And Vision (Graphics Series)
Texture recognition from sparsely and irregularly sampled data
Computer Vision and Image Understanding
Image compression by linear splines over adaptive triangulations
Signal Processing
Image Authentication and Restoration Using Irregular Sampling for Traffic Enforcement Applications
ICICIC '06 Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 3
High-accuracy stereo depth maps using structured light
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Fractal image compression based on Delaunay triangulation and vector quantization
IEEE Transactions on Image Processing
Image compression using binary space partitioning trees
IEEE Transactions on Image Processing
A fast approach for accurate content-adaptive mesh generation
IEEE Transactions on Image Processing
Representing images using points on image surfaces
IEEE Transactions on Image Processing
An edge-oriented progressive image coding
IEEE Transactions on Circuits and Systems for Video Technology
IEEE Transactions on Circuits and Systems for Video Technology
Depth MAP compression VIA compressed sensing
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Development of a Multi-modal Multi-user Telepresence and Teleaction System
International Journal of Robotics Research
Grid smoothing: a graph-based approach
CIARP'10 Proceedings of the 15th Iberoamerican congress conference on Progress in pattern recognition, image analysis, computer vision, and applications
Fast depth map compression and meshing with compressed tritree
ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part II
A generalization of quad-trees applied to image coding
Integrated Computer-Aided Engineering
| Hi-index | 0.01 |
The interest in content adaptive mesh generation of images has been arising lately due to its wide area of applications in image processing. The major issue is to represent an image with a low number of pixels while preserving its content. These pixels or the nonuniform samples are then used to generate a mesh that approximates the corresponding image. This work presents a novel method based on Binary Space Partitions in combination with three clustering schemes to approximate an image with a mesh. The algorithm has the ability to simultaneously reduce the number of pixels and generate the mesh approximation. The idea is to assume each triangle of the mesh as a plane. Consequently, it will be possible to reconstruct the inlying pixels with planar equations defined from the three nodes of each triangle. If a triangle's equation does not have the ability to reconstruct the pixels lying within up to a predefined error, it is split into two new triangles. Tested on several real images, the proposed method leads to reduced size meshes in a fast manner while retaining the visual quality of the reconstructed images. In addition, it is parallelizable due to the property of Binary Space Partitions which facilitates its application in real-time scenarios.