Please use this identifier to cite or link to this item:
https://doi.org/10.1109/CVPR.2012.6247724
Title: | Efficient inference for fully-connected CRFs with stationarity | Authors: | Zhang Y. Chen T. |
Issue Date: | 2012 | Citation: | Zhang Y., Chen T. (2012). Efficient inference for fully-connected CRFs with stationarity. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition : 582-589. ScholarBank@NUS Repository. https://doi.org/10.1109/CVPR.2012.6247724 | Abstract: | The Conditional Random Field (CRF) is a popular tool for object-based image segmentation. CRFs used in practice typically have edges only between adjacent image pixels. To represent object relationship statistics beyond adjacent pixels, prior work either represents only weak spatial information using the segmented regions, or encodes only global object co-occurrences. In this paper, we propose a unified model that augments the pixel-wise CRFs to capture object spatial relationships. To this end, we use a fully connected CRF, which has an edge for each pair of pixels. The edge potentials are defined to capture the spatial information and preserve the object boundaries at the same time. Traditional inference methods, such as belief propagation and graph cuts, are impractical in such a case where billions of edges are defined. Under only one assumption that the spatial relationships among different objects only depend on their relative positions (spatially stationary), we develop an efficient inference algorithm that converges in a few seconds on a standard resolution image, where belief propagation takes more than one hour for a single iteration. | Source Title: | Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition | URI: | http://scholarbank.nus.edu.sg/handle/10635/146130 | ISBN: | 9781467312264 | ISSN: | 10636919 | DOI: | 10.1109/CVPR.2012.6247724 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.