TY - GEN
T1 - Connected contours
T2 - 2012 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2012
AU - Ming, Yansheng
AU - Li, Hongdong
AU - He, Xuming
PY - 2012
Y1 - 2012
N2 - Contour Completion plays an important role in visual perception, where the goal is to group fragmented low-level edge elements into perceptually coherent and salient contours. This process is often considered as guided by some middle-level Gestalt principles. Most existing methods for contour completion have focused on utilizing rather local Gestalt laws such as good-continuity and proximity. In contrast, much fewer methods have addressed the global contour closure effect, despite that many psychological evidences have shown the usefulness of closure in perceptual grouping. This paper proposes a novel higher-order CRF model to address the contour closure effect, through local connectedness approximation. This leads to a simplified problem structure, where the higher-order inference can be formulated as an integer linear program (ILP) and solved by an efficient cutting-plane variant. Tested on the BSDS benchmark, our method achieves a comparable precision-recall performance, a superior contour grouping ability (measured by Rand index), and more visually pleasing results, compared with existing methods.
AB - Contour Completion plays an important role in visual perception, where the goal is to group fragmented low-level edge elements into perceptually coherent and salient contours. This process is often considered as guided by some middle-level Gestalt principles. Most existing methods for contour completion have focused on utilizing rather local Gestalt laws such as good-continuity and proximity. In contrast, much fewer methods have addressed the global contour closure effect, despite that many psychological evidences have shown the usefulness of closure in perceptual grouping. This paper proposes a novel higher-order CRF model to address the contour closure effect, through local connectedness approximation. This leads to a simplified problem structure, where the higher-order inference can be formulated as an integer linear program (ILP) and solved by an efficient cutting-plane variant. Tested on the BSDS benchmark, our method achieves a comparable precision-recall performance, a superior contour grouping ability (measured by Rand index), and more visually pleasing results, compared with existing methods.
UR - http://www.scopus.com/inward/record.url?scp=84866702722&partnerID=8YFLogxK
U2 - 10.1109/CVPR.2012.6247755
DO - 10.1109/CVPR.2012.6247755
M3 - Conference contribution
SN - 9781467312264
T3 - Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
SP - 829
EP - 836
BT - 2012 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2012
Y2 - 16 June 2012 through 21 June 2012
ER -