Skip to main content
NIHPA Author Manuscripts logoLink to NIHPA Author Manuscripts
. Author manuscript; available in PMC: 2014 Jul 17.
Published in final edited form as: Opt Lett. 2012 Oct 15;37(20):4209–4211. doi: 10.1364/OL.37.004209

MoCS-OCT: Modified Compressive Sensing Optical Coherence Tomography with noise reduction

Daguang Xu 1,*, Namrata Vaswani 2, Yong Huang 1, Jin U Kang 1
PMCID: PMC4102613  NIHMSID: NIHMS599941  PMID: 23073413

Abstract

We study noise reduction using Modified Compressive Sensing Optical Coherence Tomography (MoCS-OCT). We show that averaged Modified-CS reconstruction achieves better image quality in terms of SNR, local contrast, and contrast to noise ratio (CNR), compared to the classical averaging method while reducing the total amount of data required to reconstruct the images. The same is also true when compared with standard CS based averaging method with same amount of under-sampled data.


Optical Coherence Tomography (OCT) is an optical imaging modality that has been adopted by a wide range of medical fields [1, 2], However, due to the interferometric nature of OCT, noise reduction has long been a focus of OCT research. Various methods of speckle noise reduction have been proposed based on hardware and software to enhance the quality of OCT image [35]. One very successful and classical method is through averaging intensity of a series of B-scans that are successively recorded with slight lateral offset [5]. Typically, average of 10 B-scans recorded with total 300um lateral offset is sufficient to provide a satisfying high-quality image. Ubiquitous system noise is another major noise source. Averaging method is also known to efficiently reduce such system noise.

One limitation of the classical averaging method is data acquisition speed and a large data storage requirement. Because Compressed Sensing (CS) [6, 7] requires only a fraction of the total data to accurately recover image, it is becoming an increasingly popular image processing method in medical imaging. Application of CS in OCT imaging has been proposed [812]. In CS-OCT imaging, the reconstruction is obtained by solving the following constrained optimization problem:

minimizeWx1,s.t.Fux-y2<ε (1)

where x is the reconstructed signal in spatial domain; W is the sparsifying operator that will transform x to a sparse representation. If x itself is sparse, W can be the identity matrix; Fu is the under-sampled Fourier transform matrix; y is the measured k-space data from the scanner; and ε is the parameter controlling the fidelity of the reconstruction to the measured data, or equivalently, it is the parameter reflecting noise level. ε ≈ 0 for noise free images. The notation ||c||1 is the 1 norm, which is defined as ||c||1 = Σi|ci|. The objective function of the optimization problem promotes the sparsity. When 1) Wx is sparse; 2) Fu satisfies restricted isometry property (RIP) [13], CS or Basis Pursuit De-Noising (BPDN) given in Equation (1), will offer successful recovery with much fewer measurements than the Nyquist rate.

Since CS enhances signal’s sparsity, it has been shown to be good at reducing noise [14]. One outstanding benefit for CS comparing to commonly used denoising methods, such as filters, is that no additional denoising procedure is needed. The noise reduction is a by-product of the reconstruction procedure.

Recently, Modified-CS [15, 16] was proposed to reconstruct a sparse signal with partially known support. If the sizes of the errors in the support are small comparing to the support size of the original signal, Modified-CS outperforms CS, particularly when the available number of measurements is too few for CS to work. Sufficient condition for exact reconstruction using Modified-CS is much weaker than those needed for CS [15]. Denote the available support knowledge by T. Modified-CS tries to find the signal that is sparsest outside the set T among all signals that satisfy the data constraint, i.e. it solves

minimize(Wx)Tc1,s.t.Fux-y2<ε (2)

here for a vector β, the notation (β)T refers to a sub-vector that contains the elements with indexes in T and we use Tc to denote the complement of the set T, w.r.t [1,2, …n], n is the length of original signal. Equation (2) shows that Modified-CS minimizes l1 norm of (Wx)Tc, not the entire signal, and hence intensity of (Wx)T is not reduced. The noise is random and usually has relatively small intensity which prevents it from T. With non-decreased (Wx)T, the ratio of signal intensity and noise intensity is higher for Modified-CS and thus Modified-CS has better denoising effect than CS. Also, when support changes is small (which is often true [15]), with prior support information, Modified-CS has smaller error rate than CS with same sample rate without extra computation requirement and sometimes, when the sample rate is too small for CS to achieve an accurate reconstruction, Modified-CS still works.

To study Modified-CS in OCT, we used data from a spectral domain OCT (SD OCT). The details of SD OCT can be found in [9]. Reconstruction results using Modified-CS and CS on an OCT image of a mirror surface is shown in Figure 1. The first A-scan is 50% sampled and its support is used to reconstruct the second A-scan whose support will be used for generating the third A-scan. For the second and following A-scans, sample rate is 7%. Follow the same procedure until entire B-scan is reconstructed. W = I. CS used the same sampled data and reconstruction domain as Modified-CS. Since A-scans in SD OCT are independent of each other to acquisition and reconstruction processes, Modified-CS and CS reconstruction is done on each A-scan for time control and simplicity. As we can see from Figure 1,

Fig. 1.

Fig. 1

reconstruction error of each A-scan

Modified-CS has a much smaller reconstruction error than CS. The reconstruction error for each A-scan is defined as ||reconstruction −ground truth||2/||ground truth||2. Actually, for such small sample rate, CS cannot give accurate reconstruction. It can also be inferred that supports of adjacent A-scans often change slowly. However, due to noise and complexity of OCT image, this is not always true.

The noise can be further reduced by averaging the Modified-CS reconstruction results, which takes the advantages of both averaging method and Modified-CS: Modified-CS reduces the amount of data needed for averaging method and improves image quality by increasing SNR and local contrast; averaging method which records successively B-scans at nearly identical position supplies data satisfying the requirements of Modified-CS. Due to duplicated denoising effect, Modified-CS based averaging method will reduce the noise further without influencing the signal.

Assume that the sequence of B-scans has length m and each B-scan contains l A-scans, our method consists of following steps:

  1. Take fully sampled measurements for each A-scan of first B-scan; get reconstructions xi1, for i = 1,2, …l by CS or conventional method; compute the b% energy-support which is defined as T:={k[1n]xk2>ζ,or(Wx)k2>ζ} where ζ is the largest real number for which T contains at least b% of the signal energy, record as T1, T2Tl.

  2. For each A-scan in the following B-scans, take the under-sampled measurement yij for i = 1 … l, j = 2 … m.

  3. Solve equation (2) to get reconstruction xij using yij and Ti, for i = 1 … l, j = 2 … m, here W can be wavelet transform or identity matrix; Fu is the under-sampled Fourier transform corresponding to the random sample mask in step 2.

  4. The final result by averaging for each A-scan is i = mean(|xij|), for i = 1 … l, j = 1 … m.

The size of Ti used for Equation (2) is controlled in order to satisfy requirement of Modified-CS: after step 1, if size of Ti is too big (e.g. more than 10% of signal length), the 10% largest value in xi1 will be taken to generate Ti. According to our experience, (x)T needs to contain at least 70% energy for a satisfying high quality reconstruction, which is usually true for SD OCT image.

To verify performance of proposed method, Modified-CS based averaging method is first applied to chicken fat image. 50% under-sampled measurements are taken for step 2. m = 10; b = 85; ε = 60; W is identity matrix; y is uniformly random sampled in k-domain; the size of each reconstructed A-scan is 2048. The result is compared with classical averaging method on fully sampled measurements, as well as CS based averaging method. Classical averaging method is done by first taking fully sampled measurement for all A-scans; then applying inverse fast Fourier Transform (IFFT) to each A-scan; finally using step 4 mention above to get final result. CS based averaging method is implemented similar to Modified-CS averaging method with the same 50% under-sampled measurements. CS based averaging method replaces Equation (2) in step 3 by Equation (1) and no support is needed. The constraint optimization problem is solved using YALL1 from [17] with default parameters. Reconstruction results are shown in Figure 2. The B-scan image is cut for better display and all four images are shown in the same dynamic range.

Fig. 2.

Fig. 2

Result of chicken fat for (a) single frame (image size 320×250) (b) classical averaging result (c) CS based averaging result (d) Modified-CS based averaging result

As we can see from Figure 2, averaging results in (b),(c),(d) show that noise is reduced significantly than single frame image in (a). Result from Modified-CS based averaging method shows clearer structure and the background part for (d) is much darker than (b). The local contrast for (b) (c) (d) in Figure 2 is 5.64, 10.23 and 12.15 respectively. SNR is 17.20dB, 21.26dB and 22.48dB respectively. CNR of (b) (c) (d) is 18.30dB, 18.52dB, 19.33dB respectively.

The definition for local contrast, SNR and CNR is:

localcontrast=μoμb (3)
SNR=20×log10(1No(i,j)objectI(i,j)21Nb(i,j)backgroundI(i,j)2) (4)
CNR=20×log10(μo-μbσb) (5)

where No and Nb are the number of points in the object region and background region respectively. In Figure 2 and 3, area in blue rectangle is object region while the region out of it is background region, including the region cut for display. I(i, j) is the intensity. μo and μb are mean of intensity of object region and background region respectively. σb is the standard deviation of intensity in background region.

Fig. 3.

Fig. 3

Result of polymer layer phantom imaging for (a) single frame (image size 480×250) (b) classical averaging result (c) CS based averaging result (d) Modified-CS based averaging result

Then we compare the methods on polymer layer phantom imaging. m = 10; b = 99; ε = norm(y) × 0.025; W is 4-level daubechies4 wavelet transform matrix; yij is uniformly random sampled in k-domain. The under-sample rate is 37.5%. Reconstruction result is shown in Figure 3. The B-scan is cut for better display. It can also be visually seen that Modified-CS based averaging method leads to a better image quality than classical averaging method. The local contrast for (b) (c) (d) in Figure 3 is 7.96, 7.10 and 9.40 respectively. SNR is 23.80dB, 24.68dB and 25.11dB respectively. CNR of (b) (c) (d) is 16.33dB, 16.15dB and 15.91dB respectively.

In the above two experiments, Modified-CS based averaging method reduces the storage requirement significantly comparing with classical averaging method while resulting in a better image quality. When compared to CS based averaging method, Modified-CS result provides 1.92dB and 2.3dB improvement respectively in local contrast, 1.22dB and 0.43dB improvement respectively in SNR. It is noteworthy to mention that the improvement is stable for Modified-CS method on the local contrast and SNR compared to classical method, no matter in which domain the reconstruction is implemented, while improvement of local contrast is not guaranteed for CS method (as in Figure 3). According to experiments we have done, Modified-CS method always gives bigger improvement for local contrast and SNR than CS method. Enlarging ε will result in higher local contrast and SNR while losing more small signals. Higher energy support percentage will increase local contrast and SNR as long as the support size requirement is satisfied [15]. Larger sample rate gives slightly better local contrast and SNR while resulting in higher storage requirement and longer acquisition time. Reconstruction domain should be chosen in which the signal has sparsest representation. However, spatial domain, where local contrast and SNR are tested, usually offers higher score because the noise is reduced directly. For CNR, Modified-CS and CS does not show stable improvement. This is because the blue rectangle region also contains part of noise whose intensity is reduced by CS and Modified-CS. Thus μo is decreased. Since the object region of Figure 3 is bigger, μo is reduced more which hurts CNR. Another problem with proposed method is some small signals tend to loss because of sparsity enhancement which, though alleviated by averaging, is still an open problem associated with CS relevant methods.

Acknowledgments

The research was supported in part by NIH/NINDS 1R21NS063131-01A1 and NIH/NIE R01, 1R01EY021540-01A1.

Footnotes

OCIS Codes: 170.4500, 100.3010, 030.4280, 110.4280

References

  • 1.Drexler, Fujimot J, editors. Optical Coherence Tomography: Technology and Applications. Springer; Berlin Germany: 2008. [Google Scholar]
  • 2.Fercher AF, Drexler W, Hitzenberger CK, Lasser T. Optical coherence tomography - principles and application. Rep Prog Phys. 2003;66(2):239–303. [Google Scholar]
  • 3.Szkulmowski M, Gorcznsk I, Szlag D, Sylwestrzak M, Kowalczyk A, Wojtkowski M. Efficient reduction of speckle noise in Optical Coherence Tomography. Opt Express. 2012;20(2):1337–1359. doi: 10.1364/OE.20.001337. [DOI] [PubMed] [Google Scholar]
  • 4.Adler DC, Ko TH, Fujimoto JG. Speckle reduction in optical coherence tomography images by use of a spatially adaptive wavelet filter. Opt lett. 2004;29(24):2878–2880. doi: 10.1364/ol.29.002878. [DOI] [PubMed] [Google Scholar]
  • 5.Sander B, Larsen M, Thrane L. Enhanced optical coherence tomography imaging by multiple scan averaging. Br J Ophthalmol. 2005;89:207–212. doi: 10.1136/bjo.2004.045989. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 6.Donoho DL. Compressed Sensing. IEEE Trans Inf Theory. 2006;52(4):1289–1306. [Google Scholar]
  • 7.Candes EJ, Romberg J, Tao T. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. Inf Theory. 2006;52(2):489–509. [Google Scholar]
  • 8.Mohan N, Stojanovic I, Karl WC, Saleh BEA, Teich MC. Compressed sensing in optical coherence tomography. Three-Dimensional and Multidimensional Microscopy: Image Acquisition and Processing XVII, SPIE. 2010;7570:75700L. [Google Scholar]
  • 9.Liu X, Kang JU. Compressive SD-OCT: the application of compressed sensing in spectral domain optical coherence tomography. Opt Express. 2010;18(21):22010–22019. doi: 10.1364/OE.18.022010. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 10.Lebed E, Mackenzie PJ, Sarunic MV, Beg FM. Rapid volumetric OCT image acquisition using compressive sampling. Opt Express. 2010;18(29):21003–21012. doi: 10.1364/OE.18.021003. [DOI] [PubMed] [Google Scholar]
  • 11.Young M, Lebed E, Jian Y, Mackenzie PJ, Beg MF, Sarunic MV. Real-time high-speed volumetric imaging using compressive sampling optical coherence tomography. Biomedical Optics Express. 2011;2(9):2690–2697. doi: 10.1364/BOE.2.002690. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 12.Fang L, Li S, Nie Q, Izatt JA, Toth CA, Farsiu S. Sparsity based denoising of spectral domain opticacoherence tomography images. Biomedical Optics Express. 2012;3(5):927–942. doi: 10.1364/BOE.3.000927. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 13.Candes EJ, Tao T. Near-optical signal recovery from random projection: universal encoding strategies? IEEE Trans Inform Theory. 2006;52(12):5406–5425. [Google Scholar]
  • 14.lusting M, Donoho D, Pauly JM. Sparse MRI: The application of compressed sensing for rapid MR imaging. Magn Reson Med. 2007;58(6):1182–1195. doi: 10.1002/mrm.21391. [DOI] [PubMed] [Google Scholar]
  • 15.Vaswani N, Lu W. Modified-cs: Modifying compressive sensing for problems with partially known support. IEEE Trans on Sig Proc. 2010;58(9):4595–4607. [Google Scholar]
  • 16.Lu W, Vaswani N. Modified BPDN for noisy compressive sensing with partially known support. ICASSP. 2010 [Google Scholar]
  • 17.Yang J, Yang Y, Yin W. YALL1: Your Algorithm for L1. 2011 yall1.blogs.rice.edu.

RESOURCES