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 Image registration is the process of transforming different sets of data into one coordinate system. Data may be multiple photographs, data from different sensors, times, depths, or viewpoints. It is used in computer vision, medical imaging, mili ...

. The main problem is that outliers (that does not fit or does not match the selected model) affect adjustment called

least squares The method of least squares is a standard approach in regression analysis to approximate the solution of overdetermined systems (sets of equations in which there are more equations than unknowns) by minimizing the sum of the squares of the r ...

(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).

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

Random sample consensus (RANSAC)

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: # Of the entire input data set, takes a subset randomly to estimate the model. # Compute model subset. The model is estimated with standard linear algorithms. # Find the matching values of transformation. # 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 transformation In Euclidean geometry, an affine transformation or affinity (from the Latin, ''affinis'', "connected with") is a geometric transformation that preserves lines and parallelism, but not necessarily Euclidean distances and angles. More generall ...

s to perform the spatial verification.

Generalized Hough transform (GHT)

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 A sieve, fine mesh strainer, or sift, is a device for separating wanted elements from unwanted material or for controlling the particle size distribution of a sample, using a screen such as a woven mesh or net or perforated sheet materia ...

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

{, border="0" style="background:#ffffff" align="top" class="sortable wikitable" , + style="background:DarkSlateBlue; color:white", {{big, Differences between RANSAC and GHT , - ! width="100 px" style="background:Lavender; color:Black", ! width="140 px" style="background:Lavender; color:Black", GHT ! width="140 px" style="background:Lavender; color:Black", 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. , - , Advantatges, , 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

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

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.