scholarly journals Perbandingan Koefisien NMF dan Proyeksi Bilinear Space Sebagai Fitur pada Pengenalan Ekspresi Wajah Manusia

2012 ◽  
Vol 3 (1) ◽  
pp. 702
Author(s):  
William Salim
Keyword(s):  
High Dimensional Data ◽  
Face Image ◽  
Multimedia Data ◽  
High Dimensional ◽  
Human Face ◽  
Negative Data ◽  
Time Efficiency ◽  
Face Expression ◽  
Classification Technique ◽  
Space Projection

NMF is one new developed method to make the part-based representation of non-negative data, such as human face image. NMF can reduce the dimension of high dimensional data such as multimedia data. In many researches,NMF can also used as a classification technique done by utilizing the extracted feature through NMF process. This article discusses about the classification technique of human face expression using NMF. This is done using NMF coeffisient and bilinear projection of face image. Some researches show the use of NMF coefficient in classification and some others use bilinear space projection. This research is conducted by simulating face espression recognition to the two available approaches and then comparing the accuracy and time efficiency aspect of the two methods. Through this research, it can be concluded that the use of NMF coefficient results in better accuracy compared to bilinear space projection, but bilinear space projection obtains better time efficiency.

A randomized block policy gradient algorithm with differential privacy in Content Centric Networks

2021 ◽  
Vol 17 (12) ◽  
pp. 155014772110599
Author(s):  
Lin Wang ◽  
Xingang Xu ◽  
Xuhui Zhao ◽  
Baozhu Li ◽  
Ruijuan Zheng ◽  
...  
Keyword(s):  
Privacy Protection ◽  
Differential Privacy ◽  
Effective Means ◽  
High Dimensional Data ◽  
Computational Cost ◽  
Gradient Methods ◽  
Multimedia Data ◽  
Gradient Algorithm ◽  
High Dimensional ◽  
Policy Gradient

Policy gradient methods are effective means to solve the problems of mobile multimedia data transmission in Content Centric Networks. Current policy gradient algorithms impose high computational cost in processing high-dimensional data. Meanwhile, the issue of privacy disclosure has not been taken into account. However, privacy protection is important in data training. Therefore, we propose a randomized block policy gradient algorithm with differential privacy. In order to reduce computational complexity when processing high-dimensional data, we randomly select a block coordinate to update the gradients at each round. To solve the privacy protection problem, we add a differential privacy protection mechanism to the algorithm, and we prove that it preserves the [Formula: see text]-privacy level. We conduct extensive simulations in four environments, which are CartPole, Walker, HalfCheetah, and Hopper. Compared with the methods such as important-sampling momentum-based policy gradient, Hessian-Aided momentum-based policy gradient, REINFORCE, the experimental results of our algorithm show a faster convergence rate than others in the same environment.

A Fast Clustering Algorithm for Large-scale and High Dimensional Data

2009 ◽  
Vol 35 (7) ◽  
pp. 859-866
Author(s):  
Ming LIU ◽  
Xiao-Long WANG ◽  
Yuan-Chao LIU
Keyword(s):  
Large Scale ◽  
Clustering Algorithm ◽  
High Dimensional Data ◽  
High Dimensional

Approximate Cluster Heat Maps of Large High-Dimensional Data

2018 ◽  
Author(s):  
Punit Rathore ◽  
James C. Bezdek ◽  
Dheeraj Kumar ◽  
Sutharshan Rajasegarar ◽  
Marimuthu Palaniswami
Keyword(s):  
High Dimensional Data ◽  
High Dimensional ◽  
Heat Maps

scholarly journals The Generalized Bayes Method for High-Dimensional Data Recognition with Applications to Audio Signal Recognition

Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 19
Author(s):  
Hsiuying Wang
Keyword(s):  
Gaussian Mixture Model ◽  
Mixture Model ◽  
Conventional Method ◽  
High Dimensional Data ◽  
Audio Signal ◽  
Gaussian Mixture ◽  
High Dimensional ◽  
Signal Recognition ◽  
Bayes Method ◽  
Generalized Bayes

High-dimensional data recognition problem based on the Gaussian Mixture model has useful applications in many area, such as audio signal recognition, image analysis, and biological evolution. The expectation-maximization algorithm is a popular approach to the derivation of the maximum likelihood estimators of the Gaussian mixture model (GMM). An alternative solution is to adopt a generalized Bayes estimator for parameter estimation. In this study, an estimator based on the generalized Bayes approach is established. A simulation study shows that the proposed approach has a performance competitive to that of the conventional method in high-dimensional Gaussian mixture model recognition. We use a musical data example to illustrate this recognition problem. Suppose that we have audio data of a piece of music and know that the music is from one of four compositions, but we do not know exactly which composition it comes from. The generalized Bayes method shows a higher average recognition rate than the conventional method. This result shows that the generalized Bayes method is a competitor to the conventional method in this real application.

Sign in / Sign up

Export Citation Format

Share Document