1 / 85

A Similarity-Guided Spots Sorting Method to Increase the Dynamic Range of a Shack Hartmann Sensor

國立中央大學光電科學與工程學系 碩士學位論文口試. A Similarity-Guided Spots Sorting Method to Increase the Dynamic Range of a Shack Hartmann Sensor. Committee Dr. Chao-Wen Liang Dr. Yi-Chun Chen Dr. Chi-Hung Huang. Master’s Oral Defense 24 th July 2013 Phua Soo Fan. Outline. Introduction Literature Review

arvin
Télécharger la présentation

A Similarity-Guided Spots Sorting Method to Increase the Dynamic Range of a Shack Hartmann Sensor

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. 國立中央大學光電科學與工程學系 碩士學位論文口試 A Similarity-Guided Spots Sorting Method to Increase the Dynamic Range of a Shack Hartmann Sensor Committee Dr. Chao-Wen Liang Dr. Yi-Chun ChenDr. Chi-Hung Huang Master’s Oral Defense 24th July 2013 PhuaSoo Fan

  2. Outline • Introduction • Literature Review • Methods • Results • Conclusion

  3. Outline • Introduction • Working principle of Shack-Hartmann sensors • Spot Assignment, Dynamic Range • Motivation • Literature Review • Methods • Results • Conclusion

  4. Working Principles • Transverse ray aberration VS. Wavefront

  5. What is Observed on SH Sensor?

  6. Analysis of SH Data • Spots Centroiding • Spots Assignment • Wavefront Reconstruction

  7. Analysis of SH Data • Determining centroid of all spots • Identify spots • Thresholding • Determine spots’ centroid using the energy distribution • Spots Centroiding • Spots Assignment • Wavefront Reconstruction

  8. Analysis of SH Data • Spots Centroiding • Spots Assignment • Wavefront Reconstruction • Assign SH spots to their lenslets

  9. Analysis of SH Data • Spots Centroiding • Spots Assignment • Wavefront Reconstruction • Reconstruct wavefront from assigned spots • Zonal : Southwell integration • Modal : Zernike polynomials

  10. Outline • Introduction • Working principle of Shack-Hartmann sensors • Spot Assignment, Dynamic Range • Motivation • Literature Review • Methods • Results • Conclusion

  11. What is Sorting / Assignment? Assign spots to their corresponding lenslet Output from CCD + Centroiding

  12. Conventional Sorting Algorithm • Spot shift < Lenslet diameter 2 spots Wrong spot Missing spot

  13. Dynamic Range • The maximum measurable wavefront slope • Focal length , Dynamic range d Long focal length Short focal length

  14. Dynamic Range vs. Sensitivity • Sensitivity: • Focal length , Dynamic range , Sensitivity

  15. Outline • Introduction • Working principle of Shack-Hartmann sensors • Spot Assignment, Dynamic Range • Motivation • Literature Review • Methods • Results • Conclusion

  16. Conventional Syst. Configuration • System Aberration • Collimating Optic • Beam Expander

  17. Conventional Syst. Configuration • System Aberration • Collimating optics are not perfect • Calibration is needed • Reference wavefront • Reference spots • Shifts from reference spots are taken as actual transverse ray aberration

  18. Conventional Syst. Configuration • System Aberration • Collimating optics are not perfect • Calibration is needed • Reference wavefront • Reference spots • Shifts from reference spots are taken as actual transverse ray aberration Generating a reference wavefrontcan be difficult and expensive!

  19. Conventional Syst. Configuration • System Aberration • Collimating optics are not perfect • Calibration is needed Not a once-and-for-all work Test Optic Additional aberration is introduced into the system Test Optic When lenses with different power are tested, beam expanders are needed - To fill the full CCD area

  20. Proposed Configuration • SH system without collimating optics • Smaller system aberration • Calibration of lens array is required • Higher angle of incidence • Correction on off axis aberrations

  21. Proposed Configuration • SH system without collimating optics • Smaller system aberration • Calibration of lens array is required • Measurement of negative lenses is not feasible • Effective area of CCD is decreased Drawback

  22. Proposed Configuration • SH system without collimating optics • Smaller system aberration • Calibration of lens array is required • Measurement of negative lenses is not feasible • Effective area of CCD is decreased • Conventional assignment algorithm not feasible

  23. Proposed Configuration • SH system without collimating optics • Smaller system aberration • Calibration of lens array is required • Measurement of negative lenses is not feasible • Effective area of CCD is decreased • Conventional assignment algorithm not feasible Motivation 1 New assignment algorithm is required!!

  24. Spots’ Crossover • Spots crossover: When aberration is large Motivation 2 Expand dynamic range

  25. Outline • Introduction • Working principle of Shack-Hartmann sensors • Spot Assignment, Dynamic Range • Motivation • Literature Review • Methods • Results • Conclusion

  26. Outline • Introduction • Literature Review • Published Sorting Algorithm • Spiral • Spline Extrapolation • Zernike Extrapolation • Path of Assignment • Methods • Results • Conclusion

  27. General Sorting Algorithms Initialization Obtain Assigned Spots Used to Various Prediction Methods! Predict Locations of Neighboring Spots While unassigned spots ~= 0 Assign closest spots within search region

  28. Spiral • Linear prediction • Prediction basis: 3 spots • Fourth spot forms a parallelogram with the 3 spots

  29. Spline, Zernike

  30. Outline • Introduction • Literature Review • Published Sorting Algorithm • Spiral • Spline Extrapolation • Zernike Extrapolation • Path of Assignment • Methods • Results • Conclusion

  31. Path of Assignment • All published methods follow a pre-determined path, as shown in the video below.

  32. Predetermined Path vs. Guided Path • Predetermined path: • New spots predicted using assigned spots • Error propagation • Guided • Quality map • Spots with higher quality indicator • Assign with higher priority • Avoid error propagation

  33. Outline • Introduction • Literature Review • Published Sorting Algorithm • Spiral • Spline Extrapolation • Zernike Extrapolation • Path of Assignment • Methods • Results • Conclusion

  34. Outline • Introduction • Literature Review • Methods • Quality Map • Linear Assignment • Priority Buffer • NonLinear Assignment • Results • Conclusion

  35. Quality Map • How to determine the quality of spots? • A parameter to identify the quality is required!

  36. Quality Map Low DAP = High quality Initialization Quality Parameter, DAP Obtain Assigned Spots Used to There’s a DIFFERENCE in predicted location and the exact spot location Predict Locations of Neighboring Spots While unassigned spots ~= 0 Assign the closest spot within search region

  37. Location Prediction Initialization Obtain Assigned Spots Used to Predict Locations of Neighboring Spots While unassigned spots ~= 0 Assign the closest spot within search region

  38. Location Prediction • Linear • Fast • Incapable of handling spots crossover • Applied to central region • Non-Linear • Slow • Able to predict crossover positions • Applied to outer region

  39. Outline • Introduction • Literature Review • Methods • Quality Map • Linear Assignment • Priority Buffer • NonLinear Assignment • Results • Conclusion

  40. Linear Assignment Newly-assigned spot, Prediction base

  41. Outline • Introduction • Literature Review • Methods • Quality Map • Linear Assignment • Priority Buffer • NonLinear Assignment • Results • Conclusion

  42. Priority Buffer Initialization: 4 spots assigned (‘X’) Spots 5,6,7 and 8 predicted, inserted into Buffer Spots 1,2,3 and 4 predicted, inserted into Buffer Buffer arranged, Spot 3 assigned Arranged accord. To DAP Spot #1 assigned

  43. Priority Buffer

  44. Outline • Introduction • Literature Review • Methods • Quality Map • Linear Assignment • Priority Buffer • NonLinear Assignment • Results • Conclusion

  45. Non Linear Assignment • Major slope directions (-45, 0, 45, 90) • Direction closest to Slope • Minor slope directions • The two other directions which are not perpendicular to major slope direction

  46. Non Linear Assignment • Major slope directions (-45, 0, 45, 90) • Direction closest to Slope • Minor slope directions • The two other directions which are not perpendicular to major slope direction

  47. Non Linear Assignment • Major slope directions (-45, 0, 45, 90) • Direction closest to Slope • Minor slope directions • The two other directions which are not perpendicular to major slope direction

  48. Prediction Base • Primary base • The newly-assigned spot • Secondary base • Assigned neighbors of primary base Secondary base

  49. Prediction Basis • Comprises of the base + 2 assigned neighbors • Formed along slope directions Predicted spot Minor slope direction Major slope direction Minor slope direction

  50. Prediction Basis • Repeated on every secondary base Predicted spot Minor slope direction Major slope direction Minor slope direction

More Related