Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Fully dynamic Delaunay triangulation in logarithmic expected time per operation
Computational Geometry: Theory and Applications
Digital video processing
Properties of the Delaunay triangulation
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Geometric compression through topological surgery
ACM Transactions on Graphics (TOG)
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
Multiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision
High-quality video view interpolation using a layered representation
ACM SIGGRAPH 2004 Papers
Automatic Passive Recovery of 3D from Images and Video
3DPVT '04 Proceedings of the 3D Data Processing, Visualization, and Transmission, 2nd International Symposium
Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
Towards 3-D scene reconstruction from broadcast video
Image Communication
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Scalable and Efficient Video Coding Using 3-D Modeling
IEEE Transactions on Multimedia
IEEE Transactions on Image Processing
A mesh-based disparity representation method for view interpolation and stereo image compression
IEEE Transactions on Image Processing
Scene Representation Technologies for 3DTV—A Survey
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.01 |
In any practical application of the 2-D-to-3-D conversion that involves storage and transmission, representation efficiency has an undisputable importance that is not reflected in the attention the topic received. In order to address this problem, a novel algorithm, which yields efficient 3-D representations in the rate distortion sense, is proposed. The algorithm utilizes two views of a scene to build a mesh-based representation incrementally, via adding new vertices, while minimizing a distortion measure. The experimental results indicate that, in scenes that can be approximated by planes, the proposed algorithm is superior to the dense depth map and, in some practical situations, to the block motion vector-based representations in the rate-distortion sense.