We show that the completion problem of reconstructing the hidden arcs of the contours of an image, given only the visible ones, has a solution. More precisely we prove that, given an oriented plane graph K having as vertices only T-junctions and nonexterior terminal points, there exists an apparent contour G such that K is the visible part of G. This result is sharp, since the converse statement is easily seen to be satisfied. As a consequence, from K we can reconstruct a solid shape E in three-dimensional space such that K coincides with the visible part of the apparent contour of E. The main tools used to prove our result are a Morse description of K and the Huffman labelling for apparent contour
Bellettini, G., Beorchia, V., Paolini, M. (2009). Completion of visible contours. SIAM JOURNAL ON IMAGING SCIENCES, 2, 777-833 [10.1137/08073456X].
Completion of visible contours
BELLETTINI, GIOVANNI;
2009-01-01
Abstract
We show that the completion problem of reconstructing the hidden arcs of the contours of an image, given only the visible ones, has a solution. More precisely we prove that, given an oriented plane graph K having as vertices only T-junctions and nonexterior terminal points, there exists an apparent contour G such that K is the visible part of G. This result is sharp, since the converse statement is easily seen to be satisfied. As a consequence, from K we can reconstruct a solid shape E in three-dimensional space such that K coincides with the visible part of the apparent contour of E. The main tools used to prove our result are a Morse description of K and the Huffman labelling for apparent contourI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


