| 書目名稱 | Relational Matching | | 編輯 | G. Vosselman | | 視頻video | http://file.papertrans.cn/827/826100/826100.mp4 | | 叢書名稱 | Lecture Notes in Computer Science | | 圖書封面 |  | | 描述 | 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 bystructuraldescriptions. The matching algorithm then has todetermine which imageelements and object model partscorrespond.This book is the result of abasic study of relationalmatching. The book focuses particularly on theevaluation ofcorrespondences. In order to find the best match, one needsa measure to evaluate the quality of a match. The authorreviewsthe evaluation measures that have been suggestedover the past few decadesand presents a new measure basedon information theory. The resulting theorycombinesmatching strategies, information theory, and treesearchmethods. For the benefit of the reader,comprehensiveintroductions are given to all these topics. | | 出版日期 | Book 1992 | | 關(guān)鍵詞 | Baumsuchverfahren; Computer Vision; Object Recognition; Objekterkennung; Photogrammetrie; Photogrammetry; | | 版次 | 1 | | doi | https://doi.org/10.1007/3-540-55798-9 | | isbn_softcover | 978-3-540-55798-2 | | isbn_ebook | 978-3-540-47287-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 | | issn_series | 0302-9743 | | copyright | Springer-Verlag Berlin Heidelberg 1992 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-25 12:40
發(fā)表于 2025-3-21 18:37:46
