Format:
Online-Ressource (IX, 190 S.)
Edition:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540472872
Series Statement:
Lecture notes in computer science 628
Content:
Computer vision and matching -- A classification of matching methods -- Formal description of relational matching -- Problem definition and contributions of the thesis -- Information theory:Selected Topics -- Evaluation of mappings between relational descriptions -- Tree search methods and heuristics -- Relational image and model description -- Evaluation functions for object location -- Strategy and performance of the tree search for object location -- Summary and discussion.
Content:
Relational matching is a method for finding the best correspondences betweenstructural descriptions. It is widely used in computer vision for the recognition and location of objects in digital images. For this purpose, the digital images and the object models are represented by structural descriptions. The matching algorithm then has to determine which image elements and object model parts correspond. This book is the result of abasic study of relational matching. The book focuses particularly on the evaluation of correspondences. In order to find the best match, one needs a measure to evaluate the quality of a match. The author reviews the evaluation measures that have been suggested over the past few decades and presents a new measure based on information theory. The resulting theorycombines matching strategies, information theory, and tree search methods. For the benefit of the reader, comprehensive introductions are given to all these topics.
Note:
Zugl.: Bonn, Univ., Diss.
Additional Edition:
ISBN 3540557989
Additional Edition:
ISBN 9783540557982
Additional Edition:
Erscheint auch als Druck-Ausgabe Vosselman, George Relational matching Berlin : Springer, 1992 ISBN 3540557989
Additional Edition:
ISBN 0387557989
Language:
English
Subjects:
Computer Science
Keywords:
Relationales Matching
;
Bildverarbeitung
;
Maschinelles Sehen
;
Hochschulschrift
DOI:
10.1007/3-540-55798-9
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
