Cantitate/Preț
Produs

Relational Matching: Lecture Notes in Computer Science, cartea 628

Autor George Vosselman
en Limba Engleză Paperback – 10 sep 1992
Relational matching is a method for finding the bestcorrespondences betweenstructural descriptions. It iswidely used in computer vision for the recognition andlocation of objects in digital images. For this purpose, thedigital images and the object models are represented bystructural descriptions. The matching algorithm then has todetermine which image elements and object model partscorrespond.This book is the result of abasic study of relationalmatching. The book focuses particularly on the evaluation ofcorrespondences. In order to find the best match, one needsa measure to evaluate the quality of a match. The authorreviews the evaluation measures that have been suggestedover the past few decades and presents a new measure basedon information theory. The resulting theorycombinesmatching strategies, information theory, and tree searchmethods. For the benefit of the reader, comprehensiveintroductions are given to all these topics.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32809 lei

Preț vechi: 41012 lei
-20% Nou

Puncte Express: 492

Preț estimativ în valută:
6280 6531$ 5262£

Carte tipărită la comandă

Livrare economică 13-27 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540557982
ISBN-10: 3540557989
Pagini: 208
Ilustrații: X, 18 p.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.3 kg
Ediția:1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.