You are not logged in.
Openly accessible

Nonnegative Matrix Factorization Applied to Nonlinear Speech and Image Cryptosystems

Xie, Shengli, Yang, Zuyuan and Fu, Yuli 2008, Nonnegative Matrix Factorization Applied to Nonlinear Speech and Image Cryptosystems, IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 55, no. 8, pp. 2356-2367, doi: 10.1109/TCSI.2008.918233.

Attached Files
Name Description MIMEType Size Downloads
yang-nonnegativematrix-2008.pdf Published version application/pdf 2.11MB 96

Title Nonnegative Matrix Factorization Applied to Nonlinear Speech and Image Cryptosystems
Author(s) Xie, Shengli
Yang, Zuyuan
Fu, Yuli
Journal name IEEE Transactions on Circuits and Systems I: Regular Papers
Volume number 55
Issue number 8
Start page 2356
End page 2367
Total pages 12
Publisher IEEE Xplore
Place of publication Piscataway, New Jersey
Publication date 2008
ISSN 1057-7122
Keyword(s) Nonnegative matrix factorization
Blind source separation (BSS)
Signal encryption
Summary Nonnegative matrix factorization (NMF) is widely used in signal separation and image compression. Motivated by its successful applications, we propose a new cryptosystem based on NMF, where the nonlinear mixing (NLM) model with a strong noise is introduced for encryption and NMF is used for decryption. The security of the cryptosystem relies on following two facts: 1) the constructed multivariable nonlinear function is not invertible; 2) the process of NMF is unilateral, if the inverse matrix of the constructed linear mixing matrix is not nonnegative. Comparing with Lin's method (2006) that is a theoretical scheme using one-time padding in the cryptosystem, our cipher can be used repeatedly for the practical request, i.e., multitme padding is used in our cryptosystem. Also, there is no restriction on statistical characteristics of the ciphers and the plaintexts. Thus, more signals can be processed (successfully encrypted and decrypted), no matter they are correlative, sparse, or Gaussian. Furthermore, instead of the number of zero-crossing-based method that is often unstable in encryption and decryption, an improved method based on the kurtosis of the signals is introduced to solve permutation ambiguities in waveform reconstruction. Simulations are given to illustrate security and availability of our cryptosystem.
Language eng
DOI 10.1109/TCSI.2008.918233
Field of Research 080109 Pattern Recognition and Data Mining
Socio Economic Objective 890205 Information Processing Services (incl. Data Entry and Capture)
HERDC Research category C1.1 Refereed article in a scholarly journal
Copyright notice ©2008, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30059312

Document type: Journal Article
Collections: School of Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 12 times in TR Web of Science
Scopus Citation Count Cited 11 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 56 Abstract Views, 96 File Downloads  -  Detailed Statistics
Created: Wed, 08 Jan 2014, 13:28:05 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.