From Event: SPIE Commercial + Scientific Sensing and Imaging, 2017
We address the mathematical foundations of a special case of the general problem of partitioning an end-to-end sensing algorithm for implementation by optics and by a digital processor for minimal electrical power dissipation. Specifically, we present a non-iterative algorithm for factoring a general k × k real matrix A (describing the end-to-end linear pre-processing) into the product BC, where C has no negative entries (for implementation in linear optics) and B is maximally sparse, i.e., has the fewest possible non-zero entries (for minimal dissipation of electrical power). Our algorithm achieves a sparsification of B: i.e., the number s of non-zero entries in B: of s ≤ 2k, which we prove is optimal for our class of problems.
David G. Stork, Neda Rohani, and Aggelos K. Katsaggelos, "Matrix sparsification and non-negative factorization for task partitioning in computational sensing and imaging," Proc. SPIE 10222, Computational Imaging II, 102220P (Presented at SPIE Commercial + Scientific Sensing and Imaging: April 10, 2017; Published: 1 May 2017); https://doi.org/10.1117/12.2257670.
Conference Presentations are recordings of oral presentations given at SPIE conferences and published as part of the conference proceedings. They include the speaker's narration along with a video recording of the presentation slides and animations. Many conference presentations also include full-text papers. Search and browse our growing collection of more than 14,000 conference presentations, including many plenary and keynote presentations.