Analysis of Image Registration with Tangent Distance

Download

index.pdf

Date

2014-01-01

Author

Vural, Elif

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

33
views

0
downloads

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). However, it 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 for solving this problem by exploiting a linear approximation of the transformation manifold of the reference image. 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 and the selection of its parameters. We consider a popular image registration setting using a multiscale pyramid of low-pass filtered versions of the (possibly noisy) reference and target images, which is particularly useful for recovering large transformations. We first show that the alignment error has a nonmonotonic variation with the filter size, due to the opposing effects of filtering on both manifold nonlinearity and image noise. We then study the convergence of the multiscale tangent distance method to the optimal solution. Our theoretical findings are confirmed by experiments on image transformation models involving translations, rotations, and scalings. Our study is the first detailed study of the tangent distance algorithm that leads to a better understanding of its efficacy and to the proper selection of its design parameters.

Subject Keywords

Image registration, Tangent distance, Image analysis, Hierarchical registration methods, Performance analysis

URI

https://hdl.handle.net/11511/38704

Journal

SIAM JOURNAL ON IMAGING SCIENCES

DOI

https://doi.org/10.1137/140974559

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

A performance study of the tangent distance method in transformation-invariant image classification Vural, Elif (2015-08-06) A common problem in image analysis is the transformation-invariant estimation of the similarity between a query image and a set of reference images representing different classes. This typically requires the comparison of the distance between the query image and the transformation manifolds of the reference images. The tangent distance algorithm is a popular method that estimates the manifold distance by employing a linear approximation of the transformation manifolds. In this paper, we present a performanc...
Analysis of Descent-Based Image Registration Vural, Elif (2013-01-01) We present a performance analysis for image registration with gradient descent. We consider a typical multiscale registration setting where the global two-dimensional translation between a pair of images is estimated by smoothing the images and minimizing the distance between them with gradient descent. Our study particularly concentrates on the effect of noise and low-pass filtering on the alignment accuracy. We analyze the well-behavedness of the image distance function by estimating the neighborhood of t...
Alignment of uncalibrated images for multi-view classification Arık, Sercan Ömer; Vural, Elif; Frossard, Pascal (2011-12-29) Efficient solutions for the classification of multi-view images can be built on graph-based algorithms when little information is known about the scene or cameras. Such methods typically require a pairwise similarity measure between images, where a common choice is the Euclidean distance. However, the accuracy of the Euclidean distance as a similarity measure is restricted to cases where images are captured from nearby viewpoints. In settings with large transformations and viewpoint changes, alignment of im...
Efficient algorithms for convolutional inverse problems in multidimensional imaging Doğan, Didem; Öktem, Figen S.; Department of Electrical and Electronics Engineering (2020) Computational imaging is the process of indirectly forming images from measurements using image reconstruction algorithms that solve inverse problems. In many inverse problems in multidimensional imaging such as spectral and depth imaging, the measurements are in the form of superimposed convolutions related to the unknown image. In this thesis, we first provide a general formulation for these problems named as convolutional inverse problems, and then develop fast and efficient image reconstruction algorith...
Extraction of 3D transform and scale invariant patches from range scans Akagunduz, Erdern; Ulusoy, İlkay (2007-06-22) An algorithm is proposed to extract transformation and scale invariant 3D fundamental elements from the surface structure of 3D range scan data. The surface is described by mean and Gaussian curvature values at every data point at various scales and a scale-space search is performed in order to extract the fundamental structures and to estimate the location and the scale of each fundamental structure. The extracted fundamental structures can later be used as nodes in a topological graph where the links betw...

Citation Formats

E. Vural, “Analysis of Image Registration with Tangent Distance,” SIAM JOURNAL ON IMAGING SCIENCES, pp. 2860–2915, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38704.