Abstract
We propose a novel method on stereo matching based on the Global Edge Constraint (GEC) and Graph Cuts. Firstly, the GEC composed of particular image edges is employed to generate the initial disparity maps. And then the reliable disparity maps consistent with the observed data are extracted to construct the data term of the energy function. Finally, we incorporate the GEC as a soft constraint into our global optimization framework, and the optimal solution could be approximated via graph cuts. Experimental results demonstrated the good performance of our proposed approach.
| Original language | English |
|---|---|
| Title of host publication | ICPR 2012 - 21st International Conference on Pattern Recognition |
| Pages | 372-375 |
| Number of pages | 4 |
| State | Published - 2012 |
| Event | 21st International Conference on Pattern Recognition, ICPR 2012 - Tsukuba, Japan Duration: 11 Nov 2012 → 15 Nov 2012 |
Publication series
| Name | Proceedings - International Conference on Pattern Recognition |
|---|---|
| ISSN (Print) | 1051-4651 |
Conference
| Conference | 21st International Conference on Pattern Recognition, ICPR 2012 |
|---|---|
| Country/Territory | Japan |
| City | Tsukuba |
| Period | 11/11/12 → 15/11/12 |
Fingerprint
Dive into the research topics of 'Stereo matching with Global Edge Constraint and Graph Cuts'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver