12.07.2015 Views

To the Graduate Council: I am submitting herewith a dissertation ...

To the Graduate Council: I am submitting herewith a dissertation ...

To the Graduate Council: I am submitting herewith a dissertation ...

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Chapter 2: Related Work 14heuristics were also used in this work to achieve robustness to missing and unreliabledata. Eggert et al [Eggert96] used both point position and normal information in <strong>the</strong>search for correspondences. All <strong>the</strong> views were represented in a single coordinatefr<strong>am</strong>e, and <strong>the</strong> search was performed on <strong>the</strong> combined point sets.Using analogy to physics Eggert et al [Eggert96], and stoddart et al [Stoddart96]devised a force-based optimization method to register <strong>the</strong> data sets. The closest pointswere connected by springs assuring better convergence to local minima. Formulating<strong>the</strong> multiple-views registration problem in graph <strong>the</strong>oretic fr<strong>am</strong>ework, Neugebauer etal [Neugebauer97] represented <strong>the</strong> different datasets as nodes and <strong>the</strong> transformationsas links. The registration task in this approach consisted of finding a network withbalanced registration errors. For improved computational efficiency, a multi-resolutionhierarchical approach was adopted, where <strong>the</strong> number of points used at <strong>the</strong> start is lowand increases as <strong>the</strong> registration proceeds. A similar graph <strong>the</strong>oretical algorithm wasproposed by Huber and Hebert [Huber03]. Recently a hybrid algorithm employinginvariant features was used to enhance <strong>the</strong> performance of <strong>the</strong> standard ICP [Sharp02].The search for closest matches was performed in <strong>the</strong> extended positional and featurespace. For recent surveys and comparisons of several common variants of <strong>the</strong> ICPalgorithm <strong>the</strong> following references [Dalley02][Rodrigues02][Rusinkiewicz01] can beconsulted.Several researchers studied <strong>the</strong> relationship between surface shape complexity and <strong>the</strong>registration accuracy. In this context, Pennec and Thirion [Pennec97] characterized <strong>the</strong>uncertainty of point set registration. Stoddart et al [Stoddart96] defined a registrationindex measuring shape information, and Brujic and Ristic [Brujic96] used MonteCarlo simulation to study <strong>the</strong> dependence of accuracy and complexity. <strong>To</strong> enhance <strong>the</strong>alignment in <strong>the</strong> case of scenes with low shape information content, Pito [Pito97]designed a registration aid that can be placed with <strong>the</strong> scanned objects ensuring precisematching.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!