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.
Contents: Introduction; Task Abstraction; Prior Approaches; A Linear Programming Approach; Geometry of Registrations and Ellipsoids; Worst-Case Number of Feasible Matchings; Random Patterns; Expected Cost of Feasibility Testing; Expected Size of Search Tree; Monte Carlo Trials; Conclusions.
Henry S. Baird received his doctorate from Princeton University. He is currently a technical staff member et AT & T Bell Laboratories. Model-Based Image Matching Using Location is a 1984 ACM Distinguished Dissertation.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Book by Baird Henry S
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: -OnTimeBooks-, Phoenix, AZ, U.S.A.
Condizione: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail. Codice articolo OTV.0262022206.G
Quantità: 1 disponibili
Da: Kloof Booksellers & Scientia Verlag, Amsterdam, Paesi Bassi
Condizione: 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. Codice articolo 263330
Quantità: 1 disponibili
Da: Mispah books, Redhill, SURRE, Regno Unito
Hardcover. Condizione: Very Good. Very Good .Ships From Multiple Locations. book. Codice articolo ERICA80302620222064
Quantità: 1 disponibili