Disocclusion: a variational approach using level lines

Object recognition, robot vision, image and film restoration may require the ability to perform disocclusion. We call disocclusion the recovery of occluded areas in a digital image by interpolation from their vicinity. It is shown in this paper how disocclusion can be performed by means of the level-lines structure, which offers a reliable, complete and contrast-invariant representation of images. Level-lines based disocclusion yields a solution that may have strong discontinuities. The proposed method is compatible with Kanizsa's amodal completion theory.

[1]  Jianhong Shen,et al.  EULER'S ELASTICA AND CURVATURE BASED INPAINTINGS , 2002 .

[2]  Alexei A. Efros,et al.  Texture synthesis by non-parametric sampling , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[3]  Marc Levoy,et al.  Fast texture synthesis using tree-structured vector quantization , 2000, SIGGRAPH.

[4]  Tony F. Chan,et al.  Euler's Elastica and Curvature-Based Inpainting , 2003, SIAM J. Appl. Math..

[5]  J. Morel,et al.  Partial differential equations and image iterative filtering , 1997 .

[6]  Joseph S. B. Mitchell,et al.  Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.

[7]  G. Kanizsa,et al.  Organization in Vision: Essays on Gestalt Perception , 1979 .

[8]  Max Wertheimer,et al.  Untersuchungen zur Lehre von der Gestalt , .

[9]  L. Evans.  Measure theory and fine properties of functions , 1992 .

[10]  John Hershberger,et al.  Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract) , 1991, WADS.

[11]  Jean-Michel Morel,et al.  Level lines based disocclusion , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[12]  Agnès Desolneux.  Evénements significatifs et applications à l'analyse d'images , 2000 .

[13]  David Mumford,et al.  Filtering, Segmentation and Depth , 1993, Lecture Notes in Computer Science.

[14]  Guillermo Sapiro,et al.  Filling-in by joint interpolation of vector fields and gray levels , 2001, IEEE Trans. Image Process..

[15]  L. Ambrosio,et al.  Functions of Bounded Variation and Free Discontinuity Problems , 2000 .

[16]  Simon Masnou.  Filtrage et désocclusion d'images par méthodes d'ensembles de niveau , 1998 .

[17]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[18]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[19]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .