TY - GEN
T1 - Contour extrapolation using probabilistic cue combination
AU - Singh, Manish
AU - Fulvio, Jacqueline M.
PY - 2006
Y1 - 2006
N2 - A common approach to the problem of contour interpolation is based on the calculus of variations. The optimal interpolating contour is taken to be one that minimizes a given smoothness functional. Two important such functionals are total curvature (or bending energy) and variation in curvature. We analyzed contours extrapolated by human observers given arcs of Euler spirals that disappeared behind an occluding surface. Irrespective of whether the Euler spirals had increasing or decreasing curvature as they approached the occluding edge, visually-extrapolated contours were found to be characterized by decaying curvature. This curvature decay is modeled in terms of a Bayesian interaction between probabilistically-expressed constraints to minimize curvature and minimize variation in curvature. The analysis suggests that using fixed smoothness functionals is not appropriate for modeling human vision. Rather, the relative weights assigned to different probabilistic shape constraints may vary as a function of distance from the point(s) of occlusion. Implications are discussed for computational models of shape completion.
AB - A common approach to the problem of contour interpolation is based on the calculus of variations. The optimal interpolating contour is taken to be one that minimizes a given smoothness functional. Two important such functionals are total curvature (or bending energy) and variation in curvature. We analyzed contours extrapolated by human observers given arcs of Euler spirals that disappeared behind an occluding surface. Irrespective of whether the Euler spirals had increasing or decreasing curvature as they approached the occluding edge, visually-extrapolated contours were found to be characterized by decaying curvature. This curvature decay is modeled in terms of a Bayesian interaction between probabilistically-expressed constraints to minimize curvature and minimize variation in curvature. The analysis suggests that using fixed smoothness functionals is not appropriate for modeling human vision. Rather, the relative weights assigned to different probabilistic shape constraints may vary as a function of distance from the point(s) of occlusion. Implications are discussed for computational models of shape completion.
UR - http://www.scopus.com/inward/record.url?scp=33845548565&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33845548565&partnerID=8YFLogxK
U2 - 10.1109/CVPRW.2006.61
DO - 10.1109/CVPRW.2006.61
M3 - Conference contribution
AN - SCOPUS:33845548565
SN - 0769526462
SN - 9780769526461
T3 - Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
BT - 2006 Conference on Computer Vision and Pattern Recognition Workshop
T2 - 2006 Conference on Computer Vision and Pattern Recognition Workshops
Y2 - 17 June 2006 through 22 June 2006
ER -