×

Holographic sensing. (English) Zbl 1437.62698

Summary: Holographic representations of data encode information in packets of equal importance that enable progressive recovery. The quality of recovered data improves as more and more packets become available. This progressive recovery of the information is independent of the order in which packets become available. Such representations are ideally suited for distributed storage and for the transmission of data packets over networks with unpredictable delays and or erasures. Several methods for holographic representations of signals and images have been proposed over the years and multiple description information theory also deals with such representations. Surprisingly, however, these methods had not been considered in the classical framework of optimal least-squares estimation theory, until very recently. We develop a least-squares approach to the design of holographic representation for stochastic data vectors, relying on the framework widely used in modeling signals and images.

MSC:

62R07 Statistical aspects of big data and data science
62B10 Statistical aspects of information-theoretic topics
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Equitz, W. H.R.; Cover, T. M., Successive refinement of information, IEEE Trans. Inform. Theory, 37, 2, 269-275 (1991) · Zbl 0721.94005
[2] Donoho, D. L., Compressed sensing, IEEE Trans. Inform. Theory, 52, 4, 1289-1306 (2006) · Zbl 1288.94016
[3] Candès, E. J.; Romberg, J. K.; Tao, T., Stable signal recovery from incomplete and inaccurate measurements, Comm. Pure Appl. Math., 59, 8, 1207-1223 (2006) · Zbl 1098.94009
[4] Elad, M., Optimized projections for compressed sensing, IEEE Trans. Signal Process., 55, 12, 5695-5702 (2007) · Zbl 1390.94168
[5] Eldar, Y.; Kutyniok, G., Compressed Sensing: Theory and Applications (2012), Cambridge University Press
[6] Wang, Y.; Wang, H.; Scharf, L. L., Optimum compression of a noisy measurement for transmission over a noisy channel, IEEE Trans. Signal Process., 62, 5, 1279-1289 (2014) · Zbl 1394.94633
[7] Goyal, V. K., Multiple description coding: compression meets the network, IEEE Signal Process. Mag., 18, 5, 74-93 (2001)
[8] Servetto, S. D.; Ramchandran, K.; Vaishampayan, V. A.; Nahrstedt, K., Multiple description wavelet based image coding, IEEE Trans. Image Process., 9, 5, 813-826 (2000)
[9] Bruckstein, A. M.; Holt, R. J.; Netravali, A. N., Holographic representations of images, IEEE Trans. Image Process., 7, 11, 1583-1597 (1998)
[10] Kutyniok, G.; Pezeshki, A.; Calderbank, R.; Liu, T., Robust dimension reduction, fusion frames, and Grassmannian packings, Appl. Comput. Harmon. Anal., 26, 1, 64-76 (2009) · Zbl 1283.42046
[11] Kailath, T.; Sayed, A.; Hassibi, B., Linear Estimation, Prentice Hall Information and System Sciences (2000), Prentice Hall
[12] Golub, G.; van Loan, C., Matrix Computations, Johns Hopkins Studies in the Mathematical Sciences (2013), Johns Hopkins University Press · Zbl 1268.65037
[13] Casazza, P. G.; Kutyniok, G., Finite Frames: Theory and Applications (2012), Birkhäuser
[14] Gardner, W. A.; Napolitano, A.; Paura, L., Cyclostationarity: half a century of research, Signal Process., 86, 4, 639-697 (2006) · Zbl 1163.94338
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.