Disocclusion: A variational approach using level lines

被引：146

作者：

Masnou, S ^{[1
]}

机构：

[1] Univ Paris 06, Lab Analyze Numer, F-75252 Paris, France

来源：

IEEE TRANSACTIONS ON IMAGE PROCESSING | 2002年 / 11卷 / 02期

关键词：

amodal completion; bounded variation (BV); disocclusion; image interpolation; inpainting; Kanizsa; level lines;

D O I：

10.1109/83.982815

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：68 / 76

页数：9

共 20 条

[1]

Ambrosio L., 2000, OX MATH M, pxviii, DOI 10.1017/S0024609301309281

[2]

[Anonymous], 1999, IEEE INT C COMP VIS

[3]

[Anonymous], 1992, MEASURE THEORY FINE

[4]

BALLESTER C, IN PRESS IEEE T IMAG

[5]

CHAN T, 2001, UNPUB SIAM J APPL MA

[6]

CHAN T, 2001, IN PRESS SIAN J APPL

[7] TRIANGULATING A SIMPLE POLYGON IN LINEAR TIME [J].

CHAZELLE, B .

DISCRETE & COMPUTATIONAL GEOMETRY, 1991, 6 (05) :485-524

[8]

DESOLNEUX A, 2000, THESIS ECOLE NORMALE

[9]

GUICHARD F, 1997, STATE ART NUMERICAL

[10] COMPUTING MINIMUM LENGTH PATHS OF A GIVEN HOMOTOPY CLASS [J].

HERSHBERGER, J ;

SNOEYINK, J .

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1994, 4 (02) :63-97

← 1 2 →