| Download | - View accepted manuscript: View Planning with a Registration Component (PDF, 693 KiB)
|
|---|
| Author | Search for: Scott, William; Search for: Roth, Gerhard; Search for: Rivest, J.-F. |
|---|
| Format | Text, Article |
|---|
| Conference | Proceedings of the 3D Imaging and Modeling Conference (3DIM), May 28 - June 1, 2001., Québec, Québec, Canada |
|---|
| Abstract | The view planning problem, also known as the next-best- view (NBV) problem, for object reconstruction and inspection has been shown to be isomorphic to the set covering problem which is NP-Complete. In this paper we express a theoretical framework for the NBV problem as an integer programming problem including a registration constraint. Experimental view planning results using a modified greedy search algorithm are presented. |
|---|
| Publication date | 2001 |
|---|
| Language | English |
|---|
| NRC number | NRCC 44166 |
|---|
| NPARC number | 5765758 |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | 8ac6a1e3-8ed1-4528-aee1-ceb1ea169602 |
|---|
| Record created | 2009-03-29 |
|---|
| Record modified | 2020-03-27 |
|---|
