Benbrook Chen Leckie Lopez: Difference between revisions
imported>Student221 |
imported>Student221 |
||
| Line 11: | Line 11: | ||
The main goal of this project is to experiment with existing image alignment algorithms and analyze their performance. We will focus on comparing algorithms that utilize feature-based, linear transformation models. We used data from the ISET3D software on simulated images taken by various cameras and sensors, and images where the object is moving as well as the global scene. Once we align images, we can use root mean squared error or SSIM (structural similarity) as metrics to compare the results between algorithms. | The main goal of this project is to experiment with existing image alignment algorithms and analyze their performance. We will focus on comparing algorithms that utilize feature-based, linear transformation models. We used data from the ISET3D software on simulated images taken by various cameras and sensors, and images where the object is moving as well as the global scene. Once we align images, we can use root mean squared error or SSIM (structural similarity) as metrics to compare the results between algorithms. | ||
== Algorithms == | == Algorithms == | ||
=== Speeded Up Robust Features (SURF) === | === Speeded Up Robust Features (SURF) === | ||
Our first two algorithms are based on Speeded Up Robust Features (SURF), a patented feature detector and descriptor. SURF accomplishes the task of finding correspondences between two images of the same scene. It accomplishes this in three steps: (1) “interest points” are selected at distinctive locations in the image, (2) the neighborhood of every interest point is represented by a feature vector, and (3) the descriptor vectors are matched between the different images. It is important that the detector is repeatable so that it can reliably find the same interest points under different viewing conditions. It is also important for the descriptor to be distinctive so that it can be broken out from noise, errors, and deformations. | |||
==== Random Sample Consensus (RANSAC) ==== | ==== Random Sample Consensus (RANSAC) ==== | ||
Revision as of 16:33, 10 December 2019
Introduction
Image alignment is the process of matching one image called template with another image. It is a crucial step in many image systems engineering applications such as video stabilization, summarization, and the creation of panoramic mosaics.
Background
Previous work on image alignment algorithms fall into two categories: intensity-based and feature-based. Intensity-based algorithms compare the spatial intensity in sets of images, while feature-based algorithms detect image features like objects or lines. Image alignment algorithms can alternatively be sorted according to the transformation on the target image space to the reference image space. Some models use linear transformations, while other models use non-linear transformations that are elastic or non-rigid.
Methods
The main goal of this project is to experiment with existing image alignment algorithms and analyze their performance. We will focus on comparing algorithms that utilize feature-based, linear transformation models. We used data from the ISET3D software on simulated images taken by various cameras and sensors, and images where the object is moving as well as the global scene. Once we align images, we can use root mean squared error or SSIM (structural similarity) as metrics to compare the results between algorithms.
Algorithms
Speeded Up Robust Features (SURF)
Our first two algorithms are based on Speeded Up Robust Features (SURF), a patented feature detector and descriptor. SURF accomplishes the task of finding correspondences between two images of the same scene. It accomplishes this in three steps: (1) “interest points” are selected at distinctive locations in the image, (2) the neighborhood of every interest point is represented by a feature vector, and (3) the descriptor vectors are matched between the different images. It is important that the detector is repeatable so that it can reliably find the same interest points under different viewing conditions. It is also important for the descriptor to be distinctive so that it can be broken out from noise, errors, and deformations.
Random Sample Consensus (RANSAC)
Least Squares
Enhanced Correlation Coefficient (ECC)
Test Metrics
Root Mean Square Error
Structural Similarity (SSIM)
Results
Conclusions
Appendix
You can write math equations as follows:
You can include images as follows (you will need to upload the image first using the toolbox on the left bar, using the "Upload file" link).