Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Berlin [u.a.] : Springer
    UID:
    b3kat_BV035721206
    Format: 1 Online-Ressource (IX, 190 S. , graph. Darst.)
    ISBN: 3540557989 , 0387557989
    Series Statement: Lecture notes in computer science 628
    Note: Zugl.: Bonn, Univ., Diss., 1991
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Matching ; Relation ; Relationales Matching ; Maschinelles Sehen ; Matching ; Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Berlin [u.a.] : Springer
    UID:
    gbv_59512707X
    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
    RVK:
    Keywords: Relationales Matching ; Bildverarbeitung ; Maschinelles Sehen ; Hochschulschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Book
    Book
    Berlin u.a. : Springer
    UID:
    b3kat_BV005878870
    Format: IX, 190 S. , graph. Darst.
    ISBN: 3540557989 , 0387557989
    Series Statement: Lecture notes in computer science 628
    Note: Zugl.: Bonn, Univ., Diss., 1991
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Matching ; Relation ; Relationales Matching ; Maschinelles Sehen ; Matching ; Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Book
    Book
    Berlin u.a. :Springer,
    UID:
    almafu_BV005878870
    Format: IX, 190 S. : graph. Darst.
    ISBN: 3-540-55798-9 , 0-387-55798-9
    Series Statement: Lecture notes in computer science 628
    Note: Zugl.: Bonn, Univ., Diss., 1991
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Matching ; Relation ; Relationales Matching ; Maschinelles Sehen ; Matching ; Hochschulschrift ; Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    edoccha_9959186208902883
    Format: 1 online resource (X, 18 p.)
    Edition: 1st ed. 1992.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47287-8
    Series Statement: Lecture Notes in Computer Science, 628
    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: Bibliographic Level Mode of Issuance: Monograph , 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. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-55798-9
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    edocfu_9959186208902883
    Format: 1 online resource (X, 18 p.)
    Edition: 1st ed. 1992.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47287-8
    Series Statement: Lecture Notes in Computer Science, 628
    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: Bibliographic Level Mode of Issuance: Monograph , 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. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-55798-9
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Book
    Book
    Berlin : Springer
    UID:
    gbv_022378650
    Format: IX, 190 S. , Ill., graph. Darst.
    ISBN: 3540557989 , 0387557989
    Series Statement: Lecture notes in computer science 628
    Note: Literaturverz. S. [169] - 180 , Zugl.: Bonn, Univ., Diss.
    Additional Edition: Online-Ausg. Vosselman, George Relational matching Berlin [u.a.] : Springer, 1992 ISBN 9783540472872
    Additional Edition: Erscheint auch als Online-Ausgabe Vosselman, George Relational Matching Berlin, Heidelberg : Springer Berlin Heidelberg, 1992 ISBN 9783540472872
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Relationales Matching ; Bildverarbeitung ; Maschinelles Sehen ; Hochschulschrift
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    UID:
    almahu_9947920884302882
    Format: X, 18 p. , online resource.
    ISBN: 9783540472872
    Series Statement: Lecture Notes in Computer Science, 628
    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: 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.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540557982
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    almahu_9948621643002882
    Format: X, 18 p. , online resource.
    Edition: 1st ed. 1992.
    ISBN: 9783540472872
    Series Statement: Lecture Notes in Computer Science, 628
    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: 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.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662205174
    Additional Edition: Printed edition: ISBN 9783540557982
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    almafu_9959186208902883
    Format: 1 online resource (X, 18 p.)
    Edition: 1st ed. 1992.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47287-8
    Series Statement: Lecture Notes in Computer Science, 628
    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: Bibliographic Level Mode of Issuance: Monograph , 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. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-55798-9
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 3534055799?
Did you mean 3540055789?
Did you mean 3540337989?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages