Reliability-based 3D reconstruction in real environment
Proceedings of the 15th international conference on Multimedia
IEEE Transactions on Pattern Analysis and Machine Intelligence
Compensated Visual Hull with GPU-Based Optimization
PCM '08 Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Real-Time GPU-Based Voxel Carving with Systematic Occlusion Handling
Proceedings of the 31st DAGM Symposium on Pattern Recognition
Real-Time 3D Reconstruction for Occlusion-Aware Interactions in Mixed Reality
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
Multi-view Reconstruction of Unknown Objects within a Known Environment
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
Multi-view Occlusion Reasoning for Probabilistic Silhouette-Based Dynamic Scene Reconstruction
International Journal of Computer Vision
Recovery and Reasoning About Occlusions in 3D Using Few Cameras with Applications to 3D Tracking
International Journal of Computer Vision
3D human modeling from a single depth image dealing with self-occlusion
Multimedia Tools and Applications
Hi-index | 0.01 |
In this paper, we propose a visual hull algorithm, which guarantees a correct construction even in the presence of partial occlusion, while "correct" here means that the real shape is located inside the visual hull. The algorithm is based on a new idea of the "extended silhouette", which requires the silhouette from background subtraction and the "occlusion mask" of the same view. In order to prepare the occlusion mask, we also propose a novel concept of "effective boundary" of moving foreground objects in a video obtained from a static camera. The accumulation of the effective boundary through time automatically gives robust occluder boundaries. We theoretically prove that our algorithm deterministically computes the tightest, correct visual hull in the presence of occlusion. Both synthetic and real examples are given as a demonstration of the correctness of the algorithm. Finally we analyze that this new algorithm is still within the time complexity of the traditional method.