Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ICIP
2004
IEEE

favoriteEmaildiscussreport

129views Image Processing» more ICIP 2004»

Fast alignment of digital images using a lower bound on an entropy metric

14 years 6 months ago

Fast alignment of digital images using a lower bound on an entropy metric

Download www.princeton.edu

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.

Mert R. Sabuncu, Peter J. Ramadge

Real-time Traffic

Favors Edge Alignment | ICIP 2004 | Image Processing |

claim paper

Related Content

» Exploiting Interframe Correlation for Fast Video to Reference Image Alignment

» Exploiting local autocorrelation function for fast video to reference image alignment

Post Info
More Details (n/a)

Added	24 Oct 2009
Updated	27 Oct 2009
Type	Conference
Year	2004
Where	ICIP
Authors	Mert R. Sabuncu, Peter J. Ramadge

Comments (0)