Hledat
Zobrazují se záznamy 1-10 z 15
Local Affine Frames for Wide-Baseline Stereo
(IEEE, 2002)
A novel procedure for establishing wide-baseline correspondence is introduced. Tentative correspondences are established by matching photometrically normalised colour measurements represented in a local affine frame. The ...
Geometric min-Hashing: Finding a (Thick) Needle in a Haystack
(IEEE, 2009-06)
We propose a novel hashing scheme for image retrieval, clustering and automatic object discovery. Unlike commonly used bag-of-words approaches, the spatial extent of image features is exploited in our method. The geometric ...
Large-Scale Discovery of Spatially Related Images
(IEEE, 2010-02)
We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of pairs of images with spatial overlap, the so-called ...
Unsupervised Discovery of Co-occurrence in Sparse High Dimensional Data
(IEEE, 2010-06)
An efficient min-Hash based algorithm for discovery of dependencies in sparse high-dimensional data is presented. The dependencies are represented by sets of features co-occurring with high probability and are called ...
Efficient Representation of Local Geometry for Large Scale Object Retrieval
(IEEE, 2009-06)
State of the art methods for image and object retrieval exploit both appearance (via visual words) and local geometry (spatial extent, relative pose). In large scale problems, memory becomes a limiting factor - local ...
Construction of Precise Local Affine Frames
(IEEE, 2010-08)
We propose a novel method for the refinement of Maximally Stable Extremal Region (MSER) boundaries to sub-pixel precision by taking into account the intensity function in the 2 × 2 neighborhood of the contour points. The ...
Image Matching and Retrieval by Repetitive Patterns
(IEEE, 2010-08)
Detection of repetitive patterns in images has been studied for a long time in computer vision. This paper discusses a method for representing a lattice or line pattern by shift-invariant descriptor of the repeating element. ...
Optimal Randomized RANSAC
(IEEE, 2008-08)
A randomized model verification strategy for RANSAC is presented. The proposed method finds, like RANSAC, a solution that is optimal with user-specified probability. The solution is found in time that is close to the ...
Geometric Hashing with Local Af ne Frames
(IEEE, 2006-06)
We propose a novel representation of local image structure and a matching scheme that are insensitive to a wide range of appearance changes. The representation is a collection of local affine frames that are constructed ...
Randomized RANSAC with Sequential Probability Ratio Test
(IEEE, 2005-10)
A randomized model verification strategy for RANSAC is presented. The proposed method finds, like RANSAC, a solution that is optimal with user-controllable probability n. A provably optimal model verification strategy is ...