Sparsity and "something else": an approach to encrypted image folding

Article, Preprint English OPEN
Bowley, James ; Rebollo - Neira, Laura (2011)
  • Related identifiers: doi: 10.1109/LSP.2011.2106496
  • Subject: Computer Science - Computer Vision and Pattern Recognition | Computer Science - Information Theory

A property of sparse representations in relation to their capacity for information storage is discussed. It is shown that this feature can be used for an application that we term Encrypted Image Folding. The proposed procedure is realizable through any suitable transformation. In particular, in this paper we illustrate the approach by recourse to the Discrete Cosine Transform and a combination of redundant Cosine and Dirac dictionaries. The main advantage of the proposed technique is that both storage and encryption can be achieved simultaneously using simple processing steps.
  • References (23)
    23 references, page 1 of 3

    [1] S.S. Chen, D.L. Donoho, and M.A. Saunders. Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing, 20:33-61, 1998.

    [2] D. Donoho and J. Tanner. Sparse nonegative solution of underdetermined linear equations by linear programming. Proceedings of the National Academy of Sciences, 102:94446 - 94451, 2005.

    [3] S. Mallat and Z. Zhang. Matching pursuits with time-frequency dictionaries. IEEE Transactions on Signal Processing, 41:3397-3415, 1993.

    [4] Y.C. Pati, R. Rezaiifar, and P.S. Krishnaprasad. Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In Proceedings of the 27th Annual Asilomar Conference in Signals, System and Computers, volume 1, pages 40-44, 1993.

    [5] L. Rebollo-Neira and D. Lowe. Optimized orthogonal matching pursuit approach. IEEE Signal Processing Letters, 9:137-140, 2002.

    [6] M. Andrle and L. Rebollo-Neira. A swapping-based refinement of orthogonal matching pursuit strategies. Signal Processing, 86:480-495, 2006.

    [7] P. Jost, P. Vandergheynst and P. Frossard. Tree-Based Pursuit: Algorithm and Properties. IEEE Transactions on Signal Processing, vol 54, pp. 4685-4695, 2006.

    [8] D. Donoho, Y. Tsaig, I. Drori and J-L Starck. Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit. Technical Report TR-2006-2, Stanford Statistics Department, 2006

    [9] D. Needell and R. Vershynin. Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit. Found. Comput. Math., 2007. DOI: 10.1007/s10208-008-9031-3.

    [10] D. Needell and J.A. Tropp. CoSaMP: Iterative signal recovery from incomplete and inaccurate sampless. Applied and Computational Harmonic Analysis, 26: 301-321, 2009.

  • Metrics
    No metrics available
Share - Bookmark