Probing View Plan Solution Space

Download
  1. (PDF, 453 KB)
DOIResolve DOI: http://doi.org/10.4224/8914055
AuthorSearch for:
TypeTechnical Report
AbstractThe view planning problem (VPP) arises in a number of important computer vision applications such as 3D object reconstruction and inspection. The VPP is known to be isomorphic to a classical problem in combinatorial mathematics, the set covering problem (SCP). This paper characterizes the nature of the VPP and presents a set covering method exploiting knowledge of the topology of viewpoint space.
Publication date
LanguageEnglish
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number47447
NPARC number8914055
Export citationExport as RIS
Report a correctionReport a correction
Record identifier0d5041e7-904c-4420-a79b-666dbb8a76cc
Record created2009-04-22
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)