1 / 12

Optimizing Astronomical Image Analysis Techniques

Delve into the intricacies of KL Transform, PCA, and Blind Deconvolution for astronomical image processing. Learn about data scarcity challenges, improved PSF estimation, and iterative error minimization methods.

donaldpdavis
Download Presentation

Optimizing Astronomical Image Analysis Techniques

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. Commentary on “The Characterization, Subtraction, and Addition of Astronomical Images” by Robert Lupton Rebecca Willett

  2. Focus of commentary • KL transform and data scarcity • Improved PSF estimation via blind deconvolution

  3. First principal component Second principal component Principal Components Analysis(aka KL Transform) Compute sample covariance matrix (pXp) Determine directions of greatest variance using eigenanalysis

  4. Principal Components Analysis(aka KL Transform) Key advantages: • Optimal linear method for dimensionality reduction • Model parameters computed directly from data • Reduction and expansion easy to compute

  5. Data Scarcity • When using the KL to estimate the PSF, • p (dimension of data) = 120 • n (number of point sources observed) = 20 • p >> n • What effect does this have when performing PCA? • Sample covariance matrix not full rank • Need special care in implementation • Naïve computational complexity O(np2)

  6. Working around the data scarcity problem • Preprocess data by performing dimensionality reduction (Johnstone & Lu, 2004) • Use an EM algorithm to solve for k-term PSF; O(knp) complexity (Roweis 1998) • Balance between decorrelation and sparsity (Chennubholta & Jepson, 2001) PCA Sparse PCA

  7. Advantages Not necessary to pick out “training” stars Potential to use prior knowledge of image structure/statistics Possible to estimate distended PSF features (e.g. ghosting effects) Potential to use information from multiple exposures Disadvantages Computational complexity can be prohibitive Can be overkill if only PSF, and not deconvolved image, is desired Blind Deconvolution

  8. Example of blind deconvolution: modified Richardson-Lucy • Start with initial intensity image estimate and initial PSF estimate • R-L update of intensity given PSF • R-L update of PSF estimate given intensity • Goto 2 (depends on good initial estimates) Tsumuraya, Miura, & Baba 1993

  9. Iterative error minimization Minimize this function: Jefferies & Christou, 1993

  10. Simulation example Observations WeinerDeconvolution MaximumEntropyDeconvolution IterativeBlindDeconvolution

  11. If Hi = H.Si, where H is the imager PSF and Si is a known shift operator, then we can use multiple exposures to more accurately estimate H. H2 y2 H3 y3 Data from multiple exposures H1  y1 = Poisson

  12. Takeaway messages • Exercise caution when using the KL transform to estimate the PSF • Avoid computing sample covariance matrix • Consider iterative, low computational complexity methods • Blind deconvolution indirectly estimates PSF • Uses prior knowledge of image structure/statistics • Requires less arbitrary user input • Can estimate non-local PSF components

More Related