An Experimental Comparison of Range Image Segmentation Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
Energy Minimization via Graph Cuts: Settling What is Possible
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Motion Layer Extraction in the Presence of Occlusion Using Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Cut Based Point-Cloud Segmentation for Polygonal Reconstruction
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part II
A modular framework for 2d/3d and multi-modal segmentation with joint super-resolution
ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume 2
| Hi-index | 0.01 |
Planar patch detection aims at simplifying data from 3D imaging sensors to a more compact scene description. We propose a fusion of intensity and depth information using Graph-Cut methods for this problem. Different known algorithms are additionally evaluated on low-resolution high-frame rate image sequences and used as an initialisation for the Graph-Cut approach. In experiments, we show a significant improvement of the detected patch boundaries after the refinement with our method.