Combinatorial Surface Integration

Author

Fraile, Roberto ; Hancock, Edwin R.

Author_Institution

Dept. of Comput. Sci., York Univ.

Volume

1

fYear

0

fDate

0-0 0

Firstpage

59

Lastpage

62

Abstract

Graph-spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper presents a generalisation that uses Minimum Spanning Trees of the weighted grid graph of surface normals, which scales with no need for surface segmentation. The problem of choosing an integration path is reduced to defining a local weight function. The method is assessed at weighting human face surface normals with geometric and information-theoretic functions of local support

Keywords

image reconstruction; image segmentation; trees (mathematics); combinatorial surface integration; geometric functions; graph-spectral surface integration; human face surface normals; information-theoretic functions; integration path; minimum spanning trees; surface segmentation; weighted grid graph; Belief propagation; Computational complexity; Computational efficiency; Computer errors; Computer science; Face; Humans; Information resources; Surface reconstruction; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 2006. ICPR 2006. 18th International Conference on

Conference_Location

Hong Kong

ISSN

1051-4651

Print_ISBN

0-7695-2521-0

Type

conf

DOI

10.1109/ICPR.2006.379

Filename

1698833