560 likes | 693 Views
Combining Laser Scans Yong Joo Kil 1 , Boris Mederos 2 , and Nina Amenta 1 1 Department of Computer Science, University of California at Davis 2 Instituto Nacional de Matematica Pura e Aplicada - IMPA. IDAV Institute for Data Analysis and Visualization
E N D
Combining Laser Scans Yong Joo Kil1, Boris Mederos2, and Nina Amenta1 1 Department of Computer Science, University of California at Davis 2 Instituto Nacional de Matematica Pura e Aplicada - IMPA IDAV Institute for Data Analysis and Visualization Visualization and Graphics Research Group
2D Super Resolution A Fast Super-Resolution Reconstruction Algorithm, [Michael Elad, Yacov Hel-Or] Low Resolution Images Super Resolution Image
Surface Super Resolution One Raw Scan Super resolved (100 scans) Photo
Improve 3D Acquisition Methods • Better hardware • Costly • Multiple scans + software • Refine output of current hardware • Cost effective • Smaller devices
xy Physical Setup Minolta Vivid 910 z (viewing direction)
3D Super Resolution Pipeline Global Registration Input Scans Super Resolution Smoothing Super Resolution Mesh Yes Convergence No Super Registration
Viewing direction axis z x y
Sample PointsLow Resolution Sample Spacing Width Of one Scan
Super Resolution Sample Spacing width/4 N(q) q
Super Resolution Method Global Registration Input Scans Super Resolution Smoothing Super Resolution Mesh Yes Convergence No Super Registration
Super Resolution Method Global Registration Input Scans Super Resolution Smoothing Super Resolution Mesh Yes Convergence No Super Registration
Super Registration super resolution mesh raw scan
Super Resolution Method Global Registration Input Scans Super Resolution Smoothing Super Resolution Mesh Yes Convergence No Super Registration
Point Samples (1st Model) Band limited signal Nyquist Sampling Theorem: Sample signal finely enough, then Reconstruct original signal perfectly. Derived from Super-Resolution Reconstruction of Images - Static and Dynamic Paradigms [Michael Elad]
Sampling at lower resolution That’s it! Derived from Super-Resolution Reconstruction of Images - Static and Dynamic Paradigms [Michael Elad]
Linear Model with Blur (2nd Model) Transformation Blur Decimation Noise Y + 1 F C D E C D E 1 1 1 1 Y + N F N N N N High- Resolution Image X Low- Resolution Images Derived from Super-Resolution Reconstruction of Images - Static and Dynamic Paradigms [Michael Elad]
The Model as One Equation Derived from Super-Resolution Reconstruction of Images - Static and Dynamic Paradigms [Michael Elad]
Peak reconstruction Pipeline : Laser Scanner Surface CCD sensor laser beam Derived from Better Optical Triangulation through Spacetime Analysis, Curless and Levoy, 1995
Video sequence x y time
Simplification • Assume • Points from Surface • Gaussian Noise
+ k E Point Sampling Model Low- Resolution Images High- Resolution Image X Gaussian Noise Transformation Blur Decimation x Y F D C k k k k Solution Average [ ELAD M., HEL-OR Y.: A fast super-resolution reconstruction algorithm for pure translational motion and common space invariant blur. IEEE Transactions on Image Processing 10,8 (2001) ]
Simplification • Solution • Register scans • Averaging • Easy • Inexpensive • It works!
Close-up Scan of Parrot • 146 Scans • 4 times the original resolution.
Super resolve far & close objects? Surface CCD sensor Derived from Better Optical Triangulation through Spacetime Analysis, Curless and Levoy, 1995
Super resolve small & large objects? One raw Scan Super resolution (117 scans)
Is it worth taking more than one scan? One raw scan Super resolution Subdivion of (a) Photograph
Is it worth shifting? With Shifts (117scans) Without Shifts (117scans)
Sampling Pattern Random xy shift + Rotation
Systematic Errors Super resolved Photo
Future work • 2.5D to 3D • Resolving Systematic Errors • Other Devices
Acknowledgements • Kelcey Chen • Geomagic Studios • NSF CCF-0331736 • Brazilian National Council of Technological and Scientific Development (CNPq)
Solving this linear system is equivalent to an average. [ ELAD M., HEL-OR Y.: A fast super-resolution reconstruction algorithm for pure translational motion and common space invariant blur. IEEE Transactions on Image Processing 10,8 (2001) ] Mimize Can be a permutation or displacement matrix Equivalent to Diagonal Matrix