Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
A graph-based method for face identification from a single 2D line drawing
Autore:
Liu, JZ; Lee, YT;
Indirizzi:
Nanyang Technol Univ, Sch Mech & Prod Engn, Singapore 2263, Singapore Nanyang Technol Univ Singapore Singapore 2263 Singapore 2263, Singapore Chinese Univ Hong Kong, Dept Elect Engn, Shatin, Hong Kong, Peoples R China Chinese Univ Hong Kong Shatin Hong Kong Peoples R China Peoples R China
Titolo Testata:
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
fascicolo: 10, volume: 23, anno: 2001,
pagine: 1106 - 1119
SICI:
0162-8828(200110)23:10<1106:AGMFFI>2.0.ZU;2-4
Fonte:
ISI
Lingua:
ENG
Soggetto:
OBJECT;
Keywords:
3D object reconstruction; depth-first search; face identification; graph algorithms; line drawing interpretation; maximum weight clique problem;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
12
Recensione:
Indirizzi per estratti:
Indirizzo: Liu, JZ Chinese Univ Hong Kong, Dept Elect Engn, Shatin, Hong Kong, Peoples R China Chinese Univ Hong Kong Shatin Hong Kong Peoples R China R China
Citazione:
J.Z. Liu e Y.T. Lee, "A graph-based method for face identification from a single 2D line drawing", IEEE PATT A, 23(10), 2001, pp. 1106-1119

Abstract

The faces in a 2D line drawing, of an object provide important informationfor the reconstruction of its 3D geometry. In this paper, a graph-based optimization method is proposed for identifying the faces in a line drawing. The face identification is formulated as, a maximum weight clique problem. This formulation is proven to be equivalent to the formulation proposed by Shpitalni and Lipson in [1]. The advantage of our formulation is that it enables us to develop a much faster algorithm to find the faces in a drawing. The significant improvement in speed is derived from two algorithms provided in this paper: The depth-first graph search for quickly generating possible faces from a drawing and the maximum weight clique finding for obtaining the optimal face configurations of the drawing. The experimental results show that our algorithm generates the same results of face identification as Shpitalni and Lipson's, but is much faster when dealing with objects of more than 20 faces.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 01/04/20 alle ore 11:17:33