• Corpus ID: 610376

On Sifts and Their Scales Lihi Zelnik-manor Technion

@inproceedings{Mayzels2012OnSA,
  title={On Sifts and Their Scales Lihi Zelnik-manor Technion},
  author={Viki Mayzels and Lihi Zelnik-Manor},
  year={2012}
}
Scale invariant feature detectors often find stable scales in only a few image pixels. Consequently, methods for feature matching typically choose one of two extreme options: matching a sparse set of scale invariant features, or dense matching using arbitrary scales. In this paper we turn our attention to the overwhelming majority of pixels, those where stable scales are not found by standard techniques. We ask, is scale-selection necessary for these pixels, when dense, scale-invariant matching… 
2 Citations

Figures and Tables from this paper

Adjacent bin stability evaluating for feature description

It is argued that the stability of a bin depends on the Differences across adjacent pairs more than the differences across all scale pairs, and a new local descriptor is composed based on the hypothesis.

A novel local descriptor based on accumulated ranking and averaged bin across multiple scales

A novel local descriptor is proposed, which is a measure of the stability across all scales, and its superiority to the state-of-the-art descriptors is demonstrated.

References

SHOWING 1-10 OF 31 REFERENCES

Is SIFT scale invariant

This note is devoted to a mathematical exploration of whether Lowe's Scale-Invariant Feature Transform (SIFT)[21], a very successful image matching method, is similarity invariant as claimed. It is

Scale invariance without scale selection

This work constructs scale invariant descriptors (SIDs) without requiring the estimation of image scale and shows that the constructed SIDs outperform state-of-the-art descriptors on standard datasets and the performance of a boundary-based model is systematically improved on an object detection task.

The Generalized PatchMatch Correspondence Algorithm

This paper generalizes PatchMatch in three ways: to find k nearest neighbors, as opposed to just one, to search across scales and rotations, in addition to just translations, and to match using arbitrary descriptors and distances, not just sum-of-squared-differences on patch colors.

DAISY: An Efficient Dense Descriptor Applied to Wide-Baseline Stereo

An EM-based algorithm to compute dense depth and occlusion maps from wide-baseline image pairs using a local image descriptor, DAISY, which is very efficient to compute densely and robust against many photometric and geometric transformations.

Scale & Affine Invariant Interest Point Detectors

A comparative evaluation of different detectors is presented and it is shown that the proposed approach for detecting interest points invariant to scale and affine transformations provides better results than existing methods.

Sampling Strategies for Bag-of-Features Image Classification

It is shown experimentally that for a representative selection of commonly used test databases and for moderate to large numbers of samples, random sampling gives equal or better classifiers than the sophisticated multiscale interest operators that are in common use.

SIFT Flow: Dense Correspondence across Different Scenes

A method to align an image to its neighbors in a large image collection consisting of a variety of scenes, and applies the SIFT flow algorithm to two applications: motion field prediction from a single static image and motion synthesis via transfer of moving objects.

Feature Detection with Automatic Scale Selection

  • T. Lindeberg
  • Computer Science
    International Journal of Computer Vision
  • 2004
It is shown how the proposed methodology applies to the problems of blob detection, junction detection, edge detection, ridge detection and local frequency estimation and how it can be used as a major mechanism in algorithms for automatic scale selection, which adapt the local scales of processing to the local image structure.

SIFT Flow: Dense Correspondence across Scenes and Its Applications

SIFT flow is proposed, a method to align an image to its nearest neighbors in a large image corpus containing a variety of scenes, where image information is transferred from the nearest neighbors to a query image according to the dense scene correspondence.

Evaluation of Stereo Matching Costs on Images with Radiometric Differences

Among the best costs are BilSub, which performs consistently very well for low radiometric differences; HMI, which is slightly better as pixelwise matching cost in some cases and for strong image noise; and Census, which showed the best and most robust overall performance.