v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization

convexoptimization.com
from convexoptimization.com More from this publisher
10.03.2015 Views

328 CHAPTER 4. SEMIDEFINITE PROGRAMMING image/(reconstruction)error ratio 4.43 barrier that seems impenetrable by the total-variation objective. Total-variation minimization has met with moderate success, in retrospect, only because some medical images are moderately piecewise-constant signals. One simply hopes a reconstruction, that is in some sense equal to a known subset of samples and whose gradient is most sparse, is that unique image we seek. The total-variation objective, operating on an image, is expressible as norm of a linear transformation (765). It is natural to ask whether there exist other sparsifying transforms that might break the real-life 30dB barrier (@20% 256×256 data) in MRI. There has been much research into application of wavelets, discrete cosine transform (DCT), randomized orthogonal bases, splines, etcetera, but with suspiciously little focus on objective measures like image/error or illustration of difference images; the predominant basis of comparison instead being subjectively visual (Duensing & Huang, ISMRM Toronto 2008). 4.44 Despite choice of transform, there seems yet to have been a breakthrough of the 30dB barrier. Application of compressed sensing to MRI, therefore, remains fertile in 2008 for continued research. Lagrangian form of compressed sensing in imaging We now repeat Candès’ image reconstruction experiment from 2004 [61] which led to discovery of sparse sampling theorems. But we achieve perfect reconstruction with an algorithm based on vanishing gradient of the compressed sensing problem’s Lagrangian; our contraction method (p.334) [308,IIIA] is computationally 10× faster than contemporary methods because matrix multiplications are replaced by fast Fourier transforms 4.43 Noise considered here is due only to the reconstruction process itself; id est, noise in excess of that produced by the best reconstruction of an image from a complete set of samples in the sense of Shannon. At less than 30dB image/error, artifacts generally remain visible to the naked eye. We estimate about 50dB is required to eliminate noticeable distortion in a visual A/B comparison. 4.44 I have never calculated the PSNR of these reconstructed images [of Barbara]. −Jean-Luc Starck The sparsity of the image is the percentage of transform coefficients sufficient for diagnostic-quality reconstruction. Of course the term “diagnostic quality” is subjective. ...I have yet to see an “objective” measure of image quality. Difference images, in my experience, definitely do not tell the whole story. Often I would show people some of my results and get mixed responses, but when I add artificial Gaussian noise to an image, often people say that it looks better. −Michael Lustig

4.6. CARDINALITY AND RANK CONSTRAINT EXAMPLES 329 and number of constraints is cut in half by sampling symmetrically. Convex iteration for cardinality minimization is introduced which allows perfect reconstruction of a phantom at 4% subsampling rate; 50% Candès’ rate. By making neighboring pixel selection variable, we show image-gradient sparsity of the Shepp-Logan phantom to be 1.9% ; 33% lower than previously reported. We demonstrate application of image-gradient sparsification to the n×n=256×256 Shepp-Logan phantom, simulating ideal acquisition of MRI data by radial sampling in the Fourier domain (Figure 87). 4.45 Define a Nyquist-centric discrete Fourier transform (DFT) matrix ⎡ ⎤ 1 1 1 1 · · · 1 1 e −j2π/n e −j4π/n e −j6π/n · · · e −j(n−1)2π/n F = ∆ 1 e −j4π/n e −j8π/n e −j12π/n · · · e −j(n−1)4π/n 1 ⎢ 1 e −j6π/n e −j12π/n e −j18π/n · · · e −j(n−1)6π/n √ ∈ C n×n ⎥ n ⎣ . . . . ... . ⎦ 1 e −j(n−1)2π/n e −j(n−1)4π/n e −j(n−1)6π/n · · · e −j(n−1)2 2π/n (747) a symmetric (nonHermitian) unitary matrix characterized F = F T F −1 = F H (748) Denoting an unknown image U ∈ R n×n , its two-dimensional discrete Fourier transform F is F(U) ∆ = F UF (749) hence the inverse discrete transform U = F H F(U)F H (750) FromA.1.1 no.25 we have a vectorized two-dimensional DFT via Kronecker product ⊗ vec F(U) ∆ = (F ⊗F ) vec U (751) and from (750) its inverse [140, p.24] vec U = (F H ⊗F H )(F ⊗F ) vec U = (F H F ⊗ F H F ) vec U (752) 4.45 k-space is conventional acquisition terminology indicating domain of the continuous raw data provided by an MRI machine. An image is reconstructed by inverse discrete Fourier transform of that data sampled on a Cartesian grid in two dimensions.

328 CHAPTER 4. SEMIDEFINITE PROGRAMMING<br />

image/(reconstruction)error ratio 4.43 barrier that seems impenetrable by<br />

the total-variation objective. Total-variation minimization has met with<br />

moderate success, in retrospect, only because some medical images are<br />

moderately piecewise-constant signals. One simply hopes a reconstruction,<br />

that is in some sense equal to a known subset of samples and whose gradient<br />

is most sparse, is that unique image we seek.<br />

The total-variation objective, operating on an image, is expressible<br />

as norm of a linear transformation (765). It is natural to ask<br />

whether there exist other sparsifying transforms that might break the<br />

real-life 30dB barrier (@20% 256×256 data) in MRI. There has been much<br />

research into application of wavelets, discrete cosine transform (DCT),<br />

randomized orthogonal bases, splines, etcetera, but with suspiciously little<br />

focus on objective measures like image/error or illustration of difference<br />

images; the predominant basis of comparison instead being subjectively<br />

visual (Duensing & Huang, ISMRM Toronto 2008). 4.44 Despite choice of<br />

transform, there seems yet to have been a breakthrough of the 30dB barrier.<br />

Application of compressed sensing to MRI, therefore, remains fertile in 2008<br />

for continued research.<br />

Lagrangian form of compressed sensing in imaging<br />

We now repeat Candès’ image reconstruction experiment from 2004 [61]<br />

which led to discovery of sparse sampling theorems. But we achieve<br />

perfect reconstruction with an algorithm based on vanishing gradient of the<br />

compressed sensing problem’s Lagrangian; our contraction method (p.334)<br />

[308,IIIA] is computationally 10× faster than contemporary methods<br />

because matrix multiplications are replaced by fast Fourier transforms<br />

4.43 Noise considered here is due only to the reconstruction process itself; id est, noise<br />

in excess of that produced by the best reconstruction of an image from a complete set<br />

of samples in the sense of Shannon. At less than 30dB image/error, artifacts generally<br />

remain visible to the naked eye. We estimate about 50dB is required to eliminate noticeable<br />

distortion in a visual A/B comparison.<br />

4.44 I have never calculated the PSNR of these reconstructed images [of Barbara].<br />

−Jean-Luc Starck<br />

The sparsity of the image is the percentage of transform coefficients sufficient for<br />

diagnostic-quality reconstruction. Of course the term “diagnostic quality” is subjective.<br />

...I have yet to see an “objective” measure of image quality. Difference images, in my<br />

experience, definitely do not tell the whole story. Often I would show people some of my<br />

results and get mixed responses, but when I add artificial Gaussian noise to an image,<br />

often people say that it looks better.<br />

−Michael Lustig

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!