ML Anthology

Efficient Guaranteed Search for Gray-Level Patterns

William Rucklidge
CVPR 1997 pp. 717-723
doi:10.1109/CVPR.1997.609405 /cvpr/1997/rucklidge1997cvpr-efficient/

Abstract

We address the problem of locating a gray-level pattern in a gray-level image. The pattern can have been transformed by an affine transformation, and may have undergone some additional changes. We define a difference function based on comparing each pixel of the pattern with a window in the image, and search efficiently for transformations that minimize the difference function. The search is guaranteed: it will always find the transformation minimising the difference function, and not get fooled by a local minimum; it is also efficient, in that it does not need to examine every transformation in order to achieve this guarantee. This technique can be applied to object location, motion tracking, optical flow, or block-based motion compensation in video image sequence compression (e.g., MPEG).

CVPR Semantic Scholar

Cite

Text

Rucklidge. "Efficient Guaranteed Search for Gray-Level Patterns." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1997. doi:10.1109/CVPR.1997.609405

Markdown

[Rucklidge. "Efficient Guaranteed Search for Gray-Level Patterns." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1997.](https://mlanthology.org/cvpr/1997/rucklidge1997cvpr-efficient/) doi:10.1109/CVPR.1997.609405

BibTeX

@inproceedings{rucklidge1997cvpr-efficient,
  title     = {{Efficient Guaranteed Search for Gray-Level Patterns}},
  author    = {Rucklidge, William},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1997},
  pages     = {717-723},
  doi       = {10.1109/CVPR.1997.609405},
  url       = {https://mlanthology.org/cvpr/1997/rucklidge1997cvpr-efficient/}
}