LEADER 03968nam  22006615  450 
001 996466158503316
005 20200629130539.0
010   $a3-540-47287-8
024 7 $a10.1007/3-540-55798-9
035   $a(CKB)1000000000548885
035   $a(SSID)ssj0000326204
035   $a(PQKBManifestationID)11268652
035   $a(PQKBTitleCode)TC0000326204
035   $a(PQKBWorkID)10264985
035   $a(PQKB)11045405
035   $a(DE-He213)978-3-540-47287-2
035   $a(PPN)155216023
035   $a(EXLCZ)991000000000548885
100   $a20121227d1992      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aRelational Matching$b[electronic resource] /$fby George Vosselman
205   $a1st ed. 1992.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992.
215   $a1 online resource (X, 18 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v628
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-55798-9 
327   $aComputer 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.
330   $aRelational 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v628
606   $aComputers
606   $aArtificial intelligence
606   $aPattern recognition
606   $aSoftware engineering
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000
606   $aPattern Recognition$3https://scigraph.springernature.com/ontologies/product-market-codes/I2203X
606   $aModels and Principles$3https://scigraph.springernature.com/ontologies/product-market-codes/I18016
606   $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002
615  0$aComputers.
615  0$aArtificial intelligence.
615  0$aPattern recognition.
615  0$aSoftware engineering.
615 14$aTheory of Computation.
615 24$aArtificial Intelligence.
615 24$aPattern Recognition.
615 24$aModels and Principles.
615 24$aSoftware Engineering/Programming and Operating Systems.
676   $a004.0151
700   $aVosselman$b George$4aut$4http://id.loc.gov/vocabulary/relators/aut$0745699
906   $aBOOK
912   $a996466158503316
996   $aRelational Matching$92830418
997   $aUNISA