Please use this identifier to cite or link to this item:
https://doi.org/10.1109/CVPR.2011.5995497
DC Field | Value | |
---|---|---|
dc.title | Segment an image by looking into an image corpus | |
dc.contributor.author | Liu, X. | |
dc.contributor.author | Feng, J. | |
dc.contributor.author | Yan, S. | |
dc.contributor.author | Lin, L. | |
dc.contributor.author | Jin, H. | |
dc.date.accessioned | 2014-06-19T03:27:04Z | |
dc.date.available | 2014-06-19T03:27:04Z | |
dc.date.issued | 2011 | |
dc.identifier.citation | Liu, X.,Feng, J.,Yan, S.,Lin, L.,Jin, H. (2011). Segment an image by looking into an image corpus. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition : 2249-2256. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/CVPR.2011.5995497" target="_blank">https://doi.org/10.1109/CVPR.2011.5995497</a> | |
dc.identifier.isbn | 9781457703942 | |
dc.identifier.issn | 10636919 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/71724 | |
dc.description.abstract | This paper investigates how to segment an image into semantic regions by harnessing an unlabeled image corpus. First, the image segmentation task is recast as a small-size patch grouping problem. Then, we discover two novel patch-pair priors, namely the first-order patch-pair density prior and the second-order patch-pair co-occurrence prior, founded on two statistical observations from the natural image corpus. The underlying rationalities are: 1) a patch-pair falling within the same object region generally has higher density than a patch-pair falling on different objects, and 2) two patch-pairs with high co-occurrence frequency are likely to bear similar semantic consistence confidences (SCCs), i.e. the confidence of the consisted two patches belonging to the same semantic concept. These two discriminative priors are further integrated into a unified objective function in order to augment the intrinsic patch-pair similarities, originally calculated using patch-level visual features, into the semantic consistence confidences. Nonnegative constraint is also imposed over the output variables and an efficient iterative procedure is provided to seek the optimal solution. The ultimate patch grouping is conducted by first building a similarity graph, which takes the atomic patches as vertices and the augmented patch-pair SCCs as edge weights, and then employing the popular Normalized Cut approach to group patches into semantic clusters. Extensive image segmentation experiments on two public databases clearly demonstrate the superiority of the proposed approach over various state-of-the-arts unsupervised image segmentation algorithms. © 2011 IEEE. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/CVPR.2011.5995497 | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.doi | 10.1109/CVPR.2011.5995497 | |
dc.description.sourcetitle | Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition | |
dc.description.page | 2249-2256 | |
dc.description.coden | PIVRE | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple 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.