Generalized method for sorting shack-hartmann spot patterns using local similarity

Daniel G. Smith, John E Greivenkamp

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

The sensitivity and dynamic range of a Shack-Hartmann wavefront sensor is enhanced when the spots produced by the lenslet array are allowed to shift more than one lenslet radius from their on-axis positions. However, this presents the problem of accurately and robustly associating the spots with their respective subapertures. This paper describes a method for sorting spots that takes advantage of the local spot position distortions to unwrap the spot pattern. The described algorithm is both simple and robust and also applicable to any lenslet array geometry that can be described as a two-dimensional lattice, including hexagonal arrays, which are shown here to be more efficient than square arrays.

Original languageEnglish (US)
Pages (from-to)4548-4554
Number of pages7
JournalApplied Optics
Volume47
Issue number25
DOIs
StatePublished - Sep 1 2008

Fingerprint

Wavefronts
classifying
Sorting
Geometry
Sensors
dynamic range
radii
sensitivity
shift
sensors
geometry

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Cite this

Generalized method for sorting shack-hartmann spot patterns using local similarity. / Smith, Daniel G.; Greivenkamp, John E.

In: Applied Optics, Vol. 47, No. 25, 01.09.2008, p. 4548-4554.

Research output: Contribution to journalArticle

@article{2760701ffe9d4945ad9992b0c5454ddf,
title = "Generalized method for sorting shack-hartmann spot patterns using local similarity",
abstract = "The sensitivity and dynamic range of a Shack-Hartmann wavefront sensor is enhanced when the spots produced by the lenslet array are allowed to shift more than one lenslet radius from their on-axis positions. However, this presents the problem of accurately and robustly associating the spots with their respective subapertures. This paper describes a method for sorting spots that takes advantage of the local spot position distortions to unwrap the spot pattern. The described algorithm is both simple and robust and also applicable to any lenslet array geometry that can be described as a two-dimensional lattice, including hexagonal arrays, which are shown here to be more efficient than square arrays.",
author = "Smith, {Daniel G.} and Greivenkamp, {John E}",
year = "2008",
month = "9",
day = "1",
doi = "10.1364/AO.47.004548",
language = "English (US)",
volume = "47",
pages = "4548--4554",
journal = "Applied Optics",
issn = "1559-128X",
publisher = "The Optical Society",
number = "25",

}

TY - JOUR

T1 - Generalized method for sorting shack-hartmann spot patterns using local similarity

AU - Smith, Daniel G.

AU - Greivenkamp, John E

PY - 2008/9/1

Y1 - 2008/9/1

N2 - The sensitivity and dynamic range of a Shack-Hartmann wavefront sensor is enhanced when the spots produced by the lenslet array are allowed to shift more than one lenslet radius from their on-axis positions. However, this presents the problem of accurately and robustly associating the spots with their respective subapertures. This paper describes a method for sorting spots that takes advantage of the local spot position distortions to unwrap the spot pattern. The described algorithm is both simple and robust and also applicable to any lenslet array geometry that can be described as a two-dimensional lattice, including hexagonal arrays, which are shown here to be more efficient than square arrays.

AB - The sensitivity and dynamic range of a Shack-Hartmann wavefront sensor is enhanced when the spots produced by the lenslet array are allowed to shift more than one lenslet radius from their on-axis positions. However, this presents the problem of accurately and robustly associating the spots with their respective subapertures. This paper describes a method for sorting spots that takes advantage of the local spot position distortions to unwrap the spot pattern. The described algorithm is both simple and robust and also applicable to any lenslet array geometry that can be described as a two-dimensional lattice, including hexagonal arrays, which are shown here to be more efficient than square arrays.

UR - http://www.scopus.com/inward/record.url?scp=57049128115&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57049128115&partnerID=8YFLogxK

U2 - 10.1364/AO.47.004548

DO - 10.1364/AO.47.004548

M3 - Article

C2 - 18758524

AN - SCOPUS:57049128115

VL - 47

SP - 4548

EP - 4554

JO - Applied Optics

JF - Applied Optics

SN - 1559-128X

IS - 25

ER -