1 May 2017 Matrix sparsification and non-negative factorization for task partitioning in computational sensing and imaging
Author Affiliations +
Abstract
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.
Conference Presentation
© (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
David G. Stork, David G. Stork, Neda Rohani, Neda Rohani, Aggelos K. Katsaggelos, Aggelos K. Katsaggelos, } "Matrix sparsification and non-negative factorization for task partitioning in computational sensing and imaging", Proc. SPIE 10222, Computational Imaging II, 102220P (1 May 2017); doi: 10.1117/12.2257670; https://doi.org/10.1117/12.2257670
PROCEEDINGS
10 PAGES + PRESENTATION

SHARE
RELATED CONTENT


Back to Top