Issue No. 06 - June (1997 vol. 19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.601245
<p><b>Abstract</b>—Local search is a well established and highly effective method for solving complex combinatorial optimization problems. Here, local search is adapted to solve difficult geometric matching problems. Matching is posed as the problem of finding the optimal many-to-many correspondence mapping between a line segment model and image line segments. Image data is assumed to be fragmented, noisy, and cluttered. The algorithms presented have been used for robot navigation, photo interpretation, and scene understanding. This paper explores how local search performs as model complexity increases, image clutter increases, and additional model instances are added to the image data. Expected run-times to find optimal matches with 95 percent confidence are determined for 48 distinct problems involving six models. Nonlinear regression is used to estimate run-time growth as a function of problem size. Both polynomial and exponential growth models are fit to the run-time data. For problems with random clutter, the polynomial model fits better and growth is comparable to that for tree search. For problems involving symmetric models and multiple model instances, where tree search is exponential, the polynomial growth model is superior to the exponential growth model for one search algorithm and comparable for another.</p>
Object recognition, optimal model matching, line segment models, run-time performance characterization, random-starts local search.
E. M. Riseman and J. R. Beveridge, "How Easy is Matching 2D Line Models Using Local Search?," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 19, no. , pp. 564-579, 1997.