PROCESSING METHODS FOR CODED APERTURE IMAGING

• US 20090028451A1
• Filed: 02/06/2007
• Published: 01/29/2009
• Est. Priority Date: 02/06/2006
• Status: Active Grant

• Current Assignee: Qinetiq Limited (QinetiQ Group PLC)
• Original Assignee: Qinetiq Limited (QinetiQ Group PLC)
• Inventors: Slinger, Christopher William, Payne, Douglas Alan, De Villiers, Geoffrey Derek
• Granted Patent: US 8,068,680 B2
• Time in Patent Office: Days
• US Class Current: 382/233
• CPC Class Codes: G01T 1/295 using coded aperture devices, e.g. Fresnel zone plates handling of radiation of particles, e.g. using diaphragms, collimators, diffraction G21K1/00
• CPC Class Codes: G02B 2207/129 Coded aperture imaging

Abstract

The present invention relates to processing of coded aperture images. Multiple frames of data acquired by the coded aperture imaging system, each with a different coded aperture array, are processed to form an image. The processing incorporates the constraints that the image solution must be positive and that the solution should be zero outside an expected image region. In one embodiment image enhancement may involve dividing the processed image into image regions having a spatially invariant point spread function and solving an inverse problem for each image region to reduce image blurring.

Claims

1. A method of forming an image from data captured from a coded aperture imaging system comprising the steps of taking a plurality of frames of data recorded by the coded aperture imaging system, each frame of data acquired using a different coded aperture array, taking for each frame of data a decoding pattern corresponding to the coded aperture array used to acquire that frame of data and processing the data to provide an image solution which is a combined regularised least squares fit to all the frames of data.

2. A method of forming an image as claimed in claim 1 wherein the processing incorporates at least one of the constraints that the solution must be positive and that the solution must be zero outside of an expected image region.

3. A method of forming an image as claimed in claim 1 wherein the data recorded by the coded aperture system is an intensity pattern of radiation for which diffraction effects are significant.

4. A method as claimed in claim 1 comprising a multi-image Tikhonov regularization.

5. A method as claimed in claim 1 wherein the step of processing the data incorporates the constraint that the solution is positive using a Landweber iteration.

6. A method as claimed in claim 5 wherein the Landweber iteration applies a projection operator onto the set of functions which is one for all parts of the solution which are positive and zero for all parts of the solution which are negative.

7. A method as claimed in claim 1 wherein the step of processing the data incorporates the constraint that the solution is zero outside an expected image region using a Landweber iteration.

8. A method as claimed in claim 6 wherein the Landweber iteration applies a projection operator onto the set of functions which is one for all areas within the expected image region and zero for all areas outside the expected image region.

9. A method as claimed in claim 5 wherein the evaluation step of the Landweber iteration is performed in the frequency domain and the constraints on the solution are imposed in the spatial domain.

10. A method as claimed in claim 1 wherein the step of processing the data to provide an image solution which is a least squares fit to the data comprises an initial step of forming a first estimate of the image solution, and then an iterative improvement step incorporating the constraints that the solution must be positive and that the solution must be zero outside an expected image region.

11. A method as claimed in claim 10 wherein the iterative step applies the Landweber iteration.

12. A method as claimed in claim 1 comprising an initial step of processing each frame of data to form an initial image prior to performing the least squares fit.

13. A method as claimed in claim 12 further comprising the step of dividing each initial image into a series of image regions prior to performing the least squares fit.

14. A method as claimed in claim 13 wherein a separate least squares fit is applied to the data for each image region.

15. A method as claimed in claim 14 wherein the least squares fit for each region uses a decoding pattern optimised for that image region.

16. A method as claimed in claim 14 wherein the least squares fit to the data for each image region comprises a Tikhonov regularization.

17. A method as claimed in claim 14 wherein the least squares fit to the data for each image region incorporates the constraint that the solution should be positive.

18. A method as claimed in claim 14 wherein the image regions overlap and only the values of the least squares fit at the centre of each region are stored.

19. A method as claimed in claim 12 wherein the step of processing each frame of data to form an initial image comprises performing a cross correlation on each frame of data with a decoding pattern appropriate to the coded aperture array used to capture that frame of data.

22. A method as claimed in claim 1 wherein the data recorded by the coded aperture imaging system is the intensity pattern of radiation within the visible, ultraviolet or infrared spectra.

23. A coded aperture imaging system comprising a detector array arranged to image a scene through a reconfigurable coded aperture mask means and a processor, wherein the reconfigurable coded aperture mask means is adapted to provide a plurality of different coded aperture arrays in series and the processor records the signal from the detector array for each different coded aperture array and applies the method as claimed in claim 1 to form an image.

20. A method of forming an image from data captured from a coded aperture imaging array comprising the steps of taking a plurality of frames of data, each frame of data acquired using a different coded aperture array, taking for each frame of data a decoding pattern corresponding to the appropriate coded aperture array and processing the data to provide a first image solution for each frame of data and then deblurring the plurality of first image solutions using a set of deblurring functions derived from a set of decoding patterns each optimised for different regions of the image.

21. A method as claimed in claim 20 wherein the step of deblurring the first image solution incorporates the constraint that the solution is positive.