10.03.2015 Views

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

4.6. CARDINALITY AND RANK CONSTRAINT EXAMPLES 337<br />

Figure 90: Massachusetts Institute of Technology (MIT) logo, including its<br />

white boundary, may be interpreted as a rank-5 matrix. (Stanford University<br />

logo rank is much higher;) This constitutes Scene Y observed by the<br />

one-pixel camera in Figure 91 for Example 4.6.0.0.11.<br />

In this example we throw out only so much information as to leave<br />

perfect reconstruction within reach. Specifically, the MIT logo in Figure 90<br />

is perfectly reconstructed from 700 time-sequential samples {y i } acquired<br />

by the one-pixel camera illustrated in Figure 91. The MIT-logo image<br />

in this example effectively impinges a 46×81 array micromirror device.<br />

This mirror array is modulated by a pseudonoise source that independently<br />

positions all the individual mirrors. A single photodiode (one pixel)<br />

integrates incident light from all mirrors. After stabilizing the mirrors to<br />

a fixed but pseudorandom pattern, light so collected is then digitized into<br />

one sample y i by analog-to-digital (A/D) conversion. This sampling process<br />

is repeated with the micromirror array modulated to a new pseudorandom<br />

pattern.<br />

The most important questions are: How many samples do we need for<br />

perfect reconstruction? Does that number of samples represent compression<br />

of the original data?<br />

We claim that perfect reconstruction of the MIT logo can be reliably<br />

achieved with as few as 700 samples y=[y i ]∈ R 700 from this one-pixel<br />

camera. That number represents only 19% of information obtainable from<br />

3726 micromirrors. 4.54<br />

4.54 That number (700 samples) is difficult to achieve, as reported in [260,6]. If a minimal<br />

basis for the MIT logo were instead constructed, only five rows or columns worth of<br />

data (from a 46×81 matrix) are independent. This means a lower bound on achievable<br />

compression is about 230 samples; which corresponds to 6% of the original information.

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

Saved successfully!

Ooh no, something went wrong!