Use of monocular groupings and occlusion analysis in a hierarchical stereo system
Computer Vision and Image Understanding
Stereo Matching with Nonlinear Diffusion
International Journal of Computer Vision
Mean Shift: A Robust Approach Toward Feature Space Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
Occlusions, Discontinuities, and Epipolar Lines in Stereo
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume I - Volume I
Multi-camera Scene Reconstruction via Graph Cuts
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Stereo matching and occlusion detection with integrity and illusion sensitivity
Pattern Recognition Letters
Advances in Computational Stereo
IEEE Transactions on Pattern Analysis and Machine Intelligence
Symmetric Stereo Matching for Occlusion Handling
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
A Dense Stereo Matching Using Two-Pass Dynamic Programming with Generalized Ground Control Points
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
A Symmetric Patch-Based Correspondence Model for Occlusion Handling
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Efficient Dense Stereo with Occlusions for New View-Synthesis by Four-State Dynamic Programming
International Journal of Computer Vision
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
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
Estimating Optimal Parameters for MRF Stereo from a Single Image Pair
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stereo-based 3D Face Modeling using Annealing in Local Energy Minimization
ICIAP '07 Proceedings of the 14th International Conference on Image Analysis and Processing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Model-based stereo with occlusions
AMFG'07 Proceedings of the 3rd international conference on Analysis and modeling of faces and gestures
Robust stereo matching with improved graph and surface models and occlusion handling
Journal of Visual Communication and Image Representation
Local stereo matching using geodesic support weights
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
High-accuracy stereo depth maps using structured light
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Stereo Matching with Reliable Disparity Propagation
3DIMPVT '11 Proceedings of the 2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission
Stereo matching using iterated graph cuts and mean shift filtering
ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part I
Object stereo -- Joint stereo matching and object segmentation
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Cost Aggregation and Occlusion Handling With WLS in Stereo Matching
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
A number of stereo matching algorithms have been developed in the last few years, which also have successfully detected occlusions in stereo images. These algorithms typically fall short of a systematic study of occlusions; they predominantly emphasize matching and regard occlusion filling as a secondary operation. Filling occlusions, however, is useful in many applications such as image-based rendering where 3D models are desired to be as complete as possible. In this paper, we study occlusions in a systematic way and propose two algorithms to fill occlusions reliably by applying statistical modeling, visibility constraints, and scene constraints. We introduce a probabilistic, model-based filling order of the occluded points to maintain consistency in filling. Furthermore, we show how an ambiguity in the interpolation of the disparity value of an occluded point can safely be avoided using color homogeneity when the point's neighborhood consists of multiple scene surfaces. We perform a comparative study and show that statistically, the new algorithms deliver good quality results compared to existing algorithms.