This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Search for Publication

Year(s) from:  to 
Keywords (separated by spaces):

The framework of least squares template matching

M. Berger
180, 1998
Image Science Lab, ETH Z├╝rich


The accurate registration of image series and exact matching of image parts is essential to numerous problems in computer vision. The framework presented in this paper is a generic matching algorithm suitable for many applications where feature extraction is difficult or inaccurate.

Least squares template matching (LSM) is an area-based matching algorithm. It replaces the conventional multi-stage approach where feature detection is followed by thresholding, binarization and a discrete search. Thus, LSM does not depend on the extraction of binary (also called non-iconic) image features. This is a very important advantage especially in low-contrast and blurred imagery, where feature detection is mostly unreliable. Furthermore, unlike in most correlation methods, the optimum transformation is not searched by testing all possible cases, but approached using an optimization scheme. Assuming that a fair initial guess can be supplied, this is not only faster but also more accurate.

Download in postscript format
Download in pdf format
  author = {M. Berger},
  title = {The framework of least squares template matching},
  year = {1998},
  number = {180},
  institution = {Image Science Lab, ETH Z\"urich},
  keywords = {medical image analysis, matching, deformable, measurement, optimization}