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 ...
Read More
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.
Read Less
Add this copy of Relational Matching (Lecture Notes in Computer Science to cart. $6.30, Sold by Zubal Books rated 4.0 out of 5 stars, ships from Cleveland, OH, UNITED STATES, published 1992 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
190 pp., Paperback, ex library, else text clean and binding tight. -If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.
Add this copy of Relational Matching (Lecture Notes in Computer Science) to cart. $7.70, very good condition, Sold by GuthrieBooks rated 5.0 out of 5 stars, ships from Spring Branch, TX, UNITED STATES, published 1992 by Springer.
Add this copy of Relational Matching (Lecture Notes in Computer Science, to cart. $35.65, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 1992 by Springer.
Add this copy of Relational Matching to cart. $51.65, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1992 by Springer.
Add this copy of Relational Matching to cart. $58.06, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 1992 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Glued binding. 18 p. Lecture Notes in Computer Science, 628. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Relational Matching to cart. $58.06, like new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 1992 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Trade paperback (US). Glued binding. 18 p. Lecture Notes in Computer Science, 628. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
