Produktart
Zustand
Einband
Weitere Eigenschaften
Land des Verkäufers
Verkäuferbewertung
Verlag: MIT Press, 1985
ISBN 10: 0262022206ISBN 13: 9780262022200
Anbieter: Ammareal, Morangis, Frankreich
Buch
Hardcover. Zustand: Très bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 1985. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Edition 1985. Ammareal gives back up to 15% of this item's net price to charity organizations.
Verlag: MIT Press, 1985
ISBN 10: 0262022206ISBN 13: 9780262022200
Anbieter: Ammareal, Morangis, Frankreich
Buch
Hardcover. Zustand: Bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 1985. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Slight signs of wear on the cover. Edition 1985. Ammareal gives back up to 15% of this item's net price to charity organizations.
Verlag: Mit Pr, 1985
ISBN 10: 0262022206ISBN 13: 9780262022200
Anbieter: Kloof Booksellers & Scientia Verlag, Amsterdam, Niederlande
Buch
Zustand: as new. Cambridge, MA: The MIT Press, 1985. Hardcover. 128 pp.- This work deals with the computer vision problem of recognizing and locating rigid shapes in the plane which have been subjected to unknown rotation, scaling, and noise. The recognition task includes both locating the overall pattern and identifying each of its features. Location is achieved by finding a geometric registration function that does a good job of superimposing the instance and the model. Identifying the features requires matching each model feature with the corresponding instance feature. A pruned tree-search algorithm is developed which makes effective use of the Soviet ellipsoid algorithm for feasibility of linear constraints. An interesting blend of theoretical analysis and practical implementation shows that the resulting algorithm has an expected runtime that is theoretically asymptotically quadratic in the number of feature points, but practically linear in n for patterns with fewer than 100 points. English text. Condition : as new. Condition : as new copy. ISBN 9780262022200. Keywords : , Pattern recognition.