Fast alignment of digital images using a lower bound on an entropy metric
Lists
Only you see this
Abstract
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edge alignment, is fast to compute, and compares well in experiments with competing approaches.
BibTeX
@inproceedings{sabuncu2004fast,
author = {Mert R. Sabuncu and Peter J. Ramadge},
title = {{Fast alignment of digital images using a lower bound on an entropy metric}},
booktitle = {ICIP},
year = {2004},
}Loading related content...