2005
DOI: 10.1364/opex.13.009527
|View full text |Cite
|
Sign up to set email alerts
|

Extended object wavefront sensing based on the correlation spectrum phase

Abstract: In this paper we investigate the performance of a Fourier based algorithm for fast subpixel shift determination of two mutually shifted images subjected to noise. The algorithm will be used for Shack-Hartmann based adaptive optics correction of images of an extended object subjected to dynamical atmospheric fluctuations. The performance of the algorithm is investigated both analytically and by Monte Carlo simulations. Good agreement is achieved in relation to how the precision of the shift estimate depends on … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(8 citation statements)
references
References 7 publications
0
8
0
Order By: Relevance
“…That is, because of the assumption of periodicity implicit in finite-size Fourier transforms, for large shifts, structures in one image are not matched with structures at the shifted location but with structures shifted in from the opposite side of the image. Knutsson et al (2005) derived a method based on the Fourier spectrum of the correlation function (correlation spectrum phase). It is supposed to give results similar to the CFF method but with some accuracy sacrificed for speed.…”
Section: Correlation Algorithmsmentioning
confidence: 99%
“…That is, because of the assumption of periodicity implicit in finite-size Fourier transforms, for large shifts, structures in one image are not matched with structures at the shifted location but with structures shifted in from the opposite side of the image. Knutsson et al (2005) derived a method based on the Fourier spectrum of the correlation function (correlation spectrum phase). It is supposed to give results similar to the CFF method but with some accuracy sacrificed for speed.…”
Section: Correlation Algorithmsmentioning
confidence: 99%
“…11 The "phase correlation" technique estimates the displacement of the correlation figure in the Fourier domain, thereby considerably reducing the computational cost of the correlation; [12][13][14] however, it has been reported to be very susceptible to noise 12 and is only adequate for small displacements between live and reference images due to the Fourier phase wrapping around the −π to π range, which leaves no reliable phase values when the displacement is of the order of half the FoV, the 2D-DFT is the same size as the FoV and in the presence of noise. 13 In contrast, the "periodic correlation" technique, consisting of obtaining the correlation figure in the Fourier domain with 2D-DFTs of the same size as the live image, has reported to be adequate only when the image quality is good, due to spatial aliasing. 12 Table 1 shows the results of computational requirement estimations for an example of SHWFS with 80 × 80 subapertures, 16 × 16 detector pixels per subaperture, the imposed condition of finishing the complete centroids computation in 100 μs, and for the four centroiding methods.…”
Section: Comparison Of Weighted Fourier Phase Slopementioning
confidence: 99%
“…To accelerate the computations, shifts of these maxima could be estimated by two-di mensional mutual inte nsity spectra at s ub-apertures of current and reference frames [9]. After finding the integer coordinates , m m i j of t he maximum points of mutual correlation function, their values are adjusted using the quadratic approximation…”
Section: Algorithms For Local Wavefront Slopes Estimationmentioning
confidence: 99%