Results 1 - 10
of
24
Distinctive Image Features from Scale-Invariant Keypoints
, 2003
"... This paper presents a method for extracting distinctive invariant features from images, which can be used to perform reliable matching between different images of an object or scene. The features are invariant to image scale and rotation, and are shown to provide robust matching across a a substa ..."
Abstract
-
Cited by 3107 (17 self)
- Add to MetaCart
This paper presents a method for extracting distinctive invariant features from images, which can be used to perform reliable matching between different images of an object or scene. The features are invariant to image scale and rotation, and are shown to provide robust matching across a a substantial range of affine distortion, addition of noise, change in 3D viewpoint, and change in illumination. The features are highly distinctive, in the sense that a single feature can be correctly matched with high probability against a large database of features from many images. This paper also describes an approach to using these features for object recognition. The recognition proceeds by matching individual features to a database of features from known objects using a fast nearest-neighbor algorithm, followed by a Hough transform to identify clusters belonging to a single object, and finally performing verification through leastsquares solution for consistent pose parameters. This approach to recognition can robustly identify objects among clutter and occlusion while achieving near real-time performance.
Mobile Robot Localization and Mapping with Uncertainty using Scale-Invariant Visual Landmarks
, 2002
"... A key component of a mobile robot system is the ability to localize itself accurately and, simultaneously, to build a map of the environment. Most of the existing algorithms are based on laser range finders, sonar sensors or artificial landmarks. In this paper, we describe a vision-based mobile robo ..."
Abstract
-
Cited by 152 (6 self)
- Add to MetaCart
A key component of a mobile robot system is the ability to localize itself accurately and, simultaneously, to build a map of the environment. Most of the existing algorithms are based on laser range finders, sonar sensors or artificial landmarks. In this paper, we describe a vision-based mobile robot localization and mapping algorithm, which uses scale-invariant image features as natural landmarks in unmodified environments. The invariance of these features to image translation, scaling and rotation makes them suitable landmarks for mobile robot localization and map building. With our Triclops stereo vision system, these landmarks are localized and robot ego-motion is estimated by least-squares minimization of the matched landmarks. Feature viewpoint variation and occlusion are taken into account by maintaining a view direction for each landmark. Experiments show that these visual landmarks are robustly matched, robot pose is estimated and a consistent three-dimensional map is built. As image features are not noise-free, we carry out error analysis for the landmark positions and the robot pose. We use Kalman filters to track these landmarks in a dynamic environment, resulting in a database map with landmark positional uncertainty.
Vision-based Mobile Robot Localization And Mapping using Scale-Invariant Features
- In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA
, 2001
"... A key component of a mobile robot system is the ability to localize itself accurately and build a map of the environment simultaneously. In this paper, a vision-based mobile robot localization and mapping algorithm is described which uses scale-invariant image features as landmarks in unmodi ed dyna ..."
Abstract
-
Cited by 93 (10 self)
- Add to MetaCart
A key component of a mobile robot system is the ability to localize itself accurately and build a map of the environment simultaneously. In this paper, a vision-based mobile robot localization and mapping algorithm is described which uses scale-invariant image features as landmarks in unmodi ed dynamic environments. These 3D landmarks are localized and robot ego-motion is estimated by matching them, taking into account the feature viewpoint variation. With our Triclops stereo vision system, experiments show that these features are robustly matched between views, 3D landmarks are tracked, robot pose is estimated and a 3D map is built.
Automatic Panoramic Image Stitching using Invariant Features
, 2007
"... This paper concerns the problem of fully automated panoramic image stitching. Though the 1D problem (single axis of rotation) is well studied, 2D or multi-row stitching is more difficult. Previous approaches have used human input or restrictions on the image sequence in order to establish matching ..."
Abstract
-
Cited by 56 (0 self)
- Add to MetaCart
This paper concerns the problem of fully automated panoramic image stitching. Though the 1D problem (single axis of rotation) is well studied, 2D or multi-row stitching is more difficult. Previous approaches have used human input or restrictions on the image sequence in order to establish matching images. In this work, we formulate stitching as a multi-image matching problem, and use invariant local features to find matches between all of the images. Because of this our method is insensitive to the ordering, orientation, scale and illumination of the input images. It is also insensitive to noise images that are not part of a panorama, and can recognise multiple panoramas in an unordered image dataset. In addition to providing more detail, this paper extends our previous work in the area (Brown and Lowe, 2003) by introducing gain compensation and automatic straightening steps.
Multi-image matching using multi-scale oriented patches
, 2005
"... This paper describes a novel multi-view matching framework based on a new type of invariant feature. Our features are located at Harris corners in discrete scale-space and oriented using a blurred local gradient. This defines a rotationally invariant frame in which we sample a feature descriptor, wh ..."
Abstract
-
Cited by 50 (8 self)
- Add to MetaCart
This paper describes a novel multi-view matching framework based on a new type of invariant feature. Our features are located at Harris corners in discrete scale-space and oriented using a blurred local gradient. This defines a rotationally invariant frame in which we sample a feature descriptor, which consists of an 8 × 8 patch of bias/gain normalised intensity values. The density of features in the image is controlled using a novel adaptive non-maximal suppression algorithm, which gives a better spatial distribution of features than previous approaches. Matching is achieved using a fast nearest neighbour algorithm that indexes features based on their low frequency Haar wavelet coefficients. We also introduce a novel outlier rejection procedure that verifies a pairwise feature match based on a background distribution of incorrect feature matches. Feature matches are refined using RANSAC and used in an automatic 2D panorama stitcher that has been extensively tested on hundreds of sample inputs. 1
Simultaneous localisation and map-building using active vision
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2002
"... Previous work in simultaneous localisation and mapbuilding (SLAM) for mobile robots has focused on the simplified case in which a robot is considered to move in two dimensions on a ground plane. While this is sometimes a good approximation, a large number of real-world applications require robots to ..."
Abstract
-
Cited by 45 (2 self)
- Add to MetaCart
Previous work in simultaneous localisation and mapbuilding (SLAM) for mobile robots has focused on the simplified case in which a robot is considered to move in two dimensions on a ground plane. While this is sometimes a good approximation, a large number of real-world applications require robots to move around terrain which has significant slopes and undulations. In this paper we describe an EKFbased SLAM system permitting unconstrained 3D localisation, and in particular develop models for the motion of a wheeled robot in the presence of unknown slope variations. In a fully automatic implementation, our robot observes visual point features using fixating stereo vision and builds a sparse map on-the-fly. Combining this visual measurement with information from odometry and a roll/pitch accelerometer sensor, the robot performs accurate, repeatable localisation while traversing an undulating course. 1.
Local and Global Localization for Mobile Robots Using Visual Landmarks
- IN PROCEEDINGS OF THE IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS
, 2001
"... Our mobile robot system uses scale-invariant visual landmarks to localize itself and build a 3D map of the environment simultaneously. As image features are not noise-free, we carry out error analysis and use Kalman Filters to track the 3D landmarks, resulting in a database map with landmark positio ..."
Abstract
-
Cited by 36 (5 self)
- Add to MetaCart
Our mobile robot system uses scale-invariant visual landmarks to localize itself and build a 3D map of the environment simultaneously. As image features are not noise-free, we carry out error analysis and use Kalman Filters to track the 3D landmarks, resulting in a database map with landmark positional uncertainty. By matching a set of landmarks as a whole, our robot can localize itself globally based on the database containing landmarks of sucient distinctiveness. Experiments show that recognition of position within a map without any prior estimate can be achieved using the scale-invariant landmarks.
Real-Time Tracking of Complex Structures With on-Line Camera Calibration
- In Proc. British Machine Vision Conference (BMVC’99
, 1999
"... This paper presents a novel three-dimensional model-based tracking system which has been incorporated into a visual servoing system. ..."
Abstract
-
Cited by 27 (4 self)
- Add to MetaCart
This paper presents a novel three-dimensional model-based tracking system which has been incorporated into a visual servoing system.
Geometric Saliency of Curve Correspondences and Grouping of Symmetric Contours
- In European Conference on Computer Vision
, 1996
"... . Dependence on landmark points or high-order derivatives when establishing correspondences between geometrical image curves under various subclasses of projective transformation remains a shortcoming of present methods. In the proposed framework, geometric transformations are treated as smooth func ..."
Abstract
-
Cited by 17 (4 self)
- Add to MetaCart
. Dependence on landmark points or high-order derivatives when establishing correspondences between geometrical image curves under various subclasses of projective transformation remains a shortcoming of present methods. In the proposed framework, geometric transformations are treated as smooth functions involving the parameters of the curves on which the transformation basis points lie. By allowing the basis points to vary along the curves, hypothesised correspondences are freed from the restriction to fixed point sets. An optimisation approach to localising neighbourhood-validated transformation bases is described which uses the deviation between projected and actual curve neighbourhood to iteratively improve correspondence estimates along the curves. However as transformation bases are inherently localisable to different degrees, the concept of geometric saliency is proposed in order to quantise this localisability. This measures the sensitivity of the deviation between projected ...
Image Divergence and Deformation from Closed Curves
- INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH
, 1997
"... This paper describes a novel method to measure the differential invariants of the image velocity field from the integral of normal image velocities around image contours. This is equivalent to measuring the temporal changes in the area of a closed contour. This avoids having to recover a dense i ..."
Abstract
-
Cited by 14 (3 self)
- Add to MetaCart
This paper describes a novel method to measure the differential invariants of the image velocity field from the integral of normal image velocities around image contours. This is equivalent to measuring the temporal changes in the area of a closed contour. This avoids having to recover a dense image velocity field and taking partial derivatives. It also does not require point or line correspondences. Moreover integration provides some immunity to image measurement noise. It is shown

