Correspondence of projected 3-D points and lines using a continuous GRASP
From MaRDI portal
Publication:4910667
DOI10.1111/j.1475-3995.2011.00810.xzbMath1269.90152OpenAlexW1980277753MaRDI QIDQ4910667
Michael J. Hirsch, Mauricio G. C. Resende, Panos M. Pardalos
Publication date: 19 March 2013
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2011.00810.x
global optimizationnonlinear programmingobject recognitionstochastic local searchcontinuous GRASPpoint/line projection
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonlinear programming (90C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Speeding up continuous GRASP
- Solving systems of nonlinear equations with continuous GRASP
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- A probabilistic heuristic for a computationally difficult set covering problem
- An invitation to 3-D vision. From images to geometric models.
- On the equations relating a three-dimensional object and its two-dimensional images
- Greedy randomized adaptive search procedures
- Global optimization by continuous grasp
- Bakerian Lecture - The physical interpretation of quantum mechanics
This page was built for publication: Correspondence of projected 3-D points and lines using a continuous GRASP