| dc.contributor.author | PITIE, FRANCOIS | en |
| dc.date.accessioned | 2010-04-29T15:55:24Z | |
| dc.date.available | 2010-04-29T15:55:24Z | |
| dc.date.issued | 2009 | en |
| dc.date.submitted | 2009 | en |
| dc.identifier.citation | F. Pitie, Using One Graph-Cut to Fuse Multiple Candidate Maps in Depth Estimation., IEEE European Conference on Visual Media Production (CVMP), London, UK, 2009, 1-8 | en |
| dc.identifier.other | Y | en |
| dc.identifier.uri | http://hdl.handle.net/2262/39300 | |
| dc.description | PUBLISHED | en |
| dc.description.abstract | Graph-cut techniques for depth and disparity estimations are
known to be powerful but also slow. We propose a graph-cut
framework that is able to estimate depth maps from a set of
candidate values. By employing a restricted set of candidates
for each pixel, rough depth maps can be effectively refined to
be accurate, smooth and continuous. The contribution of this
work is to extend the graph structure proposed in the original
papers on Graph-Cuts by Ishikawa and Roy, in such a way
that sparse sets of candidates can be handled in one graph-cut. | en |
| dc.description.sponsorship | This work was funded by the FP7 European Project i3Dpost. | en |
| dc.format.extent | 1-8 | en |
| dc.language.iso | en | en |
| dc.rights | Y | en |
| dc.subject.lcsh | Graph-Cut, Depth Map Estimation, | en |
| dc.title | Using One Graph-Cut to Fuse Multiple Candidate Maps in Depth Estimation. | en |
| dc.title.alternative | IEEE European Conference on Visual Media Production (CVMP) | en |
| dc.type | Conference Paper | en |
| dc.type.supercollection | scholarly_publications | en |
| dc.type.supercollection | refereed_publications | en |
| dc.identifier.peoplefinderurl | http://people.tcd.ie/pitief | en |
| dc.identifier.rssinternalid | 64069 | en |
| dc.identifier.rssuri | http://www.mee.tcd.ie/~sigmedia/pmwiki/uploads/Main.Publications/fpitie09b.pdf | en |
