OpenAlex
PricingAboutJobs
Log inGet started
Work

Branch-and-Bound Methods for Euclidean Registration Problems

HTML

Year: 2009
Type: article
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence
DOI: 10.1109/tpami.2008.131
Authors: C. Olsson, F. Kahl, M. Oskarsson
Institution: Lund University
Language: English

Topic: 3D Shape Modeling and Analysis
Subfield: Computer Graphics and Computer-Aided Design
Field: Computer Science
Domain: Physical Sciences
Keywords: branch and bound, pose estimation, global optimization, convex underestimators, point-to-point correspondence, similarity transformation, local minima, non-convex optimization, iterative closest point

Open Access status: closed
OpenAlex ID: W2115001439
FWCI: 4.691
Cites: 23
Cited by: 184
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms