Relational Matching (Record no. 35333)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 03254nam a22005415i 4500 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 9783540472872 |
-- | 978-3-540-47287-2 |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 006.3 |
245 10 - TITLE STATEMENT | |
Title | Relational Matching |
Statement of responsibility, etc | edited by G. Vosselman. |
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
Place of publication | Berlin, Heidelberg : |
Name of publisher | Springer Berlin Heidelberg, |
Year of publication | 1992. |
300 ## - PHYSICAL DESCRIPTION | |
Number of Pages | X, 18 p. |
Other physical details | online resource. |
490 1# - SERIES STATEMENT | |
Series statement | Lecture Notes in Computer Science, |
505 0# - FORMATTED CONTENTS NOTE | |
Formatted contents note | 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. |
520 ## - SUMMARY, ETC. | |
Summary, etc | 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. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer science. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Software engineering. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Artificial intelligence. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Optical pattern recognition. |
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer Science. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Artificial Intelligence (incl. Robotics). |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Pattern Recognition. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Models and Principles. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Software Engineering/Programming and Operating Systems. |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Vosselman, G. |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | http://dx.doi.org/10.1007/3-540-55798-9 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | E-BOOKS |
264 #1 - | |
-- | Berlin, Heidelberg : |
-- | Springer Berlin Heidelberg, |
-- | 1992. |
336 ## - | |
-- | text |
-- | txt |
-- | rdacontent |
337 ## - | |
-- | computer |
-- | c |
-- | rdamedia |
338 ## - | |
-- | online resource |
-- | cr |
-- | rdacarrier |
347 ## - | |
-- | text file |
-- | |
-- | rda |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
-- | 0302-9743 ; |
Withdrawn status | Lost status | Damaged status | Not for loan | Current library | Accession Number | Uniform Resource Identifier | Koha item type |
---|---|---|---|---|---|---|---|
IMSc Library | EBK6039 | http://dx.doi.org/10.1007/3-540-55798-9 | E-BOOKS |