Regular ArticleSolution of the Simultaneous Pose and Correspondence Problem Using Gaussian Error Model
References (29)
- et al.
Higher order differential structure of images
Image Vision Comput
(1994) - et al.
Optimal geometric model matching under full 3d perspective
Comput. Vision Image Understanding
(1995) - et al.
3d object recognition from 2d images using geometric hashing
Pattern Recog. Lett
(1992) - et al.
Robust methods for estimating pose and a sensitivity analysis
Comput. Vision Graphics Image Process.
(1994) - et al.
Visual learning and recognition od 3d object from appearance
Int. J. Comput. Vision
(1995) - A. P. Pentland, B. Moghadam, T. Starner, View-based and modular eigenspaces for face recognition, Proc. IEEE Conference...
- et al.
Modal matching for correspondence and recognition
IEEE Trans. Pattern Anal. Mach. Intell.
(1995) - et al.
Person identification using multiple cues
IEEE Trans. Pattern Anal. Mach. Intell.
(1995) The combinatorics of heuristic search term for object recognition in cluttered environment
IEEE Trans. Pattern Anal. Mach. Intell.
(1991)Robust and efficient detection of salient convex groups
IEEE Trans. Pattern Anal. Mach. Intell.
(1996)
Mulidimensional indexing for recognizing visual shapes
IEEE Trans. Pattern Anal. Mach. Intell.
Comparing images using the hausdorff distance
IEEE Trans. Pattern Anal. Mach. Intell.
Cited by (47)
An application independent review of multimodal 3D registration methods
2020, Computers and Graphics (Pergamon)Citation Excerpt :At the end, the remaining transformation space is tightly bounded and includes the globally optimal solution. An early algorithm, similar to BnB, was proposed by Jurie [182] for 2D/3D alignment with a linear approximation of perspective projection. First, an initial volume of pose space is guessed and all of the correspondences compatible with this volume are considered.
A family of globally optimal branch-and-bound algorithms for 2D–3D correspondence-free registration
2019, Pattern RecognitionCitation Excerpt :LP relaxation techniques have been developed for complex and highly non-linear problems e.g. [35], where it is used for inlier set maximisation where correspondences are unknown. With respect to the 2D–3D registration problem, Jurie [36] approximates perspective pose by orthographic pose (a linear transformation) to create a problem that may be solved by similar techniques without the need for convex or concave envelopes. However, its use of the Gaussian error model results in an approach that is not robust to outliers.
A systematic approach for 2D-image to 3D-range registration in urban environments
2012, Computer Vision and Image UnderstandingCitation Excerpt :Our method on the other hand explores the whole space of possible solutions in an efficient manner and is not a probabilistic approach. Solutions in automated matching of 3D with 2D features in the context of object recognition and localization include the following [18–23]. Recently a number of new methods were developed for attacking the problem of automated alignment of images with dense point clouds derived from range scanners.
Gravitational pose estimation
2010, Computers and Electrical EngineeringObject recognition using point uncertainty regions as pose uncertainty regions
2006, Image and Vision Computing