An Independent Component Analysis Algorithm through Solving Gradient Equation Combined with Kernel D

来源 :上海交通大学学报(英文版) | 被引量 : 0次 | 上传用户:datoufangyuan
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
A new algorithm for linear instantaneous independent component analysis is proposed based on max-imizing the log-likelihood contrast function which can be changed into a gradient equation. An iterative method is introduced to solve this equation efficiently. The unknown probability density functions as well as their first and second derivatives in the gradient equation are estimated by kernel density method. Computer simulations on artificially generated signals and gray scale natural scene images confirm the efficiency and accuracy of the proposed algorithm.
其他文献
To describe the design approaches of IND-CCA2 (adaptive chosen ciphertext attack) secure public key encryption schemes systematically, the gaps between different kinds of intractable problems and IND-CCA2 security are studied. This paper points out that t
In this paper, we study the problem of employ ensemble learning for computer forensic. We propose a Lazy Local Learning based bagging (L3B) approach, where base learners are trained from a small instance subset surrounding each test instance. More specifi
This paper proposes an adaptively secure solution to certificateless distributed key encapsulation mechanism from pairings by using Canetti\'s adaptive secure key generation scheme based on discrete logarithm. The proposed scheme can withstand adaptive
This paper presents a concrete democratic group signature scheme which holds (t, n)-threshold trace-ability. In the scheme, the capability of tracing the actual signer is distributed among n group members. It gives a valid democratic group signature such
The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols. In this framework, the security of protocols is maintained under a general protocol composition operation. In the paper, we propos
This paper proposes an efficient batch secret sharing protocol among n players resilient to t < n/4 players in asynchronous network. The construction of our protocol is along the line of Hirt\'s protocol which works in synchronous model. Compared with t