EE 381V Project : A Survey on Sparse PCA

نویسنده

  • Rashish Tandon
چکیده

Principal Component Analysis (PCA) is a frequently used tool to analyse, visualize and reduce the dimensionality of data occurring in a variety of fields in science and engineering. Given a data matrix X ∈ Rn×p (where n is the number of points and p is the dimensionality), PCA finds a set of d(≪ p) orthonormal vectors V = {v1, v2, . . . , vd} in R such that the span(V ) explains the maximum amount of variance in the data (or equivalently, the projection of the data onto span(V ) is maximized). This can be cast as a sequence of optimization problems, as follows :

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New IRIS Segmentation Method Based on Sparse Representation

Iris recognition is one of the most reliable methods for identification. In general, itconsists of image acquisition, iris segmentation, feature extraction and matching. Among them, iris segmentation has an important role on the performance of any iris recognition system. Eyes nonlinear movement, occlusion, and specular reflection are main challenges for any iris segmentation method. In thi...

متن کامل

A New IRIS Segmentation Method Based on Sparse Representation

Iris recognition is one of the most reliable methods for identification. In general, itconsists of image acquisition, iris segmentation, feature extraction and matching. Among them, iris segmentation has an important role on the performance of any iris recognition system. Eyes nonlinear movement, occlusion, and specular reflection are main challenges for any iris segmentation method. In thi...

متن کامل

Face Detection and Recognition Using PCA and PPCA

In this project you will explore the use of Principle Component Analysis (PCA) and Probabilistic PCA (PPCA). PPCA is closely-related to factor analysis, which is described in chapter 14 of your text. Our application is face recognition, following on the work of Moghadden and Pentland. A minimum version of this project would involve reading chapter 14 and conducting a face recognition experiment...

متن کامل

Ee 381v: Large Scale Optimization 12.1 Last Time 12.2 Quadratically Constrained Quadratic Program

In the previous lecture, in the first place, we talked about duality for general non-convex optimization. And we know that dual functions are always convex. The dual of the dual problem is also convex. In applications, the dual of the dual can be used as the convex relaxation of the primal (and we will see this explicitly in the next lecture). Then, we covered the concepts of weak duality and s...

متن کامل

Yelp + + : 10 Times More Information per View

In this project we investigate two machine learning methods, one supervised and one unsupervised, that will allow the information content of Yelp data to be efficiently conveyed to the users. The first is matrix completion via the novel ”max-norm” constraint which out results show to be more powerful than the traditional nuclear norm minimization. The second is text summary via sparse PCA which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012