Spatial verification

Spatial verification is a technique in which similar locations can be identified in an automated way through a sequence of images. The general method involves identifying a correlation between certain points among sets images, using techniques similar to those used for image registration.

The main problem is that outliers (that does not fit or does not match the selected model) affect adjustment called least squares (numerical analysis technique framed in mathematical optimization, which, given an set of ordered pairs: independent variable, dependent variable, and a family of functions, try to find the continuous function).

## Contents

* 1 Advantages
* 2 Disadvantages
* 3 Methods
* 3.1 Random sample consensus (RANSAC)
* 3.2 Generalized Hough transform (GHT)
* 3.3 Comparison
* 4 References
* 5 External links

## Advantages

* Effective when one is able to find safe features without clutter.
* Good results for correspondence in specific instances.

## Disadvantages

* The scaling models.
* The spatial verification can not be used as post-processing.

## Methods

The most widely used for spatial verification and avoid errors caused by these outliers methods are:

Fitted Line with RANSAC

### Random sample consensus (RANSAC)

Main article: Random sample consensus

Seeks to avoid the impact of outliers, that not fit with the model, so only considers inline which match the model in question. If an outlier is chosen to calculate the current setting, then the resulting line will have little support from the rest of the points. The algorithm that is performed is a loop that performs the following steps:

1. Of the entire input data set, takes a subset randomly to estimate the model.
2. Compute model subset. The model is estimated with standard linear algorithms.
3. Find the matching values of transformation.
4. If the error is minimal model, this is accepted, and if the number of correspondences is long enough, the subset of points involved consensus assembly is referred. And it becomes to compute the estimated model in all correspondences.

The goal is to keep the model with the highest number of matches and the main problem is the number of times you have to repeat the process to obtain the best estimate of the model. RANSAC set in advance the number of iterations of the algorithm.

To specify scenes or objects, is commonly used affine transformations to perform the spatial verification.

### Generalized Hough transform (GHT)

Main article: Generalised Hough transform

This is a technique for detecting shapes in digital images that solves the veracity of space by clusters of points belonging to the model through a voting procedure on a set of parametric figures.

Not all possible combinations comprovar characteristics by adjusting a model for every possible subset, so that the voting technique, in which a vote is stored for each possible line in which each point is used. Then observe what were the lines with the most votes and those are selected.

If we use the local characteristics of scale, rotation and translation invariant, each feature coincidence gives a hypothesis alignment for scaling, translation and orientation of the model in the picture.

One hypothesis generated by a single match can be unreliable, so for each match (match), a vote is done to get a stronger hypothesis in the Hough space. So we have two major phases:

* Training: For each characteristic model, 2D is saved the location, scale and orientation of the model.
* Test: each match is allowed to be performed by the algorithm SIFT and model characteristics vote in the Hough space.

The main disadvantages are:

* The noise or clutter can display more feedback from those aiming to provide objective.
* The size of the storage array should be chosen carefully.

### Comparison

Differences between RANSAC and GHT | GHT  | RANSAC

|
|

Correspondence | Single correspondence, voting for all consistent parameters | Minimum subset of correspondences for estimate the model (count liners)
Representation | Represents uncertainty in the model space | Represent uncertainty in the image space
Complexity | Lineal complexity in the number of correspondences and the number of voting cells | Must find all points of data for check the inliers in every iteration.
Advantages | Can manipulate bigger outliers | Scale better spaces of more dimensions

## References

* Garuman, Kristen. "Recognizing object instances", 9 August 2012. Retrieved on 24 November 2014.
* Sivic, Josef. "Video Google Demo", 13 August 2004. Retrieved on 24 November 2014.
* M. A. Fischler, R. C. Bolles. Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography. Comm. of the ACM, Vol 24, pp 381–395, 1981.
* Sivic, Josef. "Distinctive Image Features", 5 January 2004. Retrieved on 24 November 2014.

## External links

* 'Recovery System Google' . The goal is to recover objects or scenes with ease, speed and pitch in the Google search engine is a website that contains certain words.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Spatial verification. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Spatial_verification&oldid=4348197"