A Study of Image Analysis with Tangent Distance
Elif Vural, Pascal Frossard

TL;DR
This paper provides a detailed theoretical and experimental analysis of the tangent distance algorithm for image registration, exploring its performance, convergence, and application in classification, with insights into parameter selection.
Contribution
It offers the first comprehensive study of tangent distance, analyzing its performance, convergence, and effectiveness in image classification, guiding better implementation.
Findings
Alignment error varies nonmonotonically with filter size.
Multiscale tangent distance converges to the optimal solution.
Effective in classifying images with transformations.
Abstract
The computation of the geometric transformation between a reference and a target image, known as registration or alignment, corresponds to the projection of the target image onto the transformation manifold of the reference image (the set of images generated by its geometric transformations). It, however, often takes a nontrivial form such that the exact computation of projections on the manifold is difficult. The tangent distance method is an effective algorithm to solve this problem by exploiting a linear approximation of the manifold. As theoretical studies about the tangent distance algorithm have been largely overlooked, we present in this work a detailed performance analysis of this useful algorithm, which can eventually help its implementation. We consider a popular image registration setting using a multiscale pyramid of lowpass filtered versions of the (possibly noisy)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Vision and Imaging · Optical measurement and interference techniques · Image and Object Detection Techniques
