國立高雄大學圖資館 |

登入

回首頁

Generalized principal component analysis (GPCA) :An algebraic geometric approach to subspace clustering and motion segmentation

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Generalized principal component analysis (GPCA) :
其他題名:	An algebraic geometric approach to subspace clustering and motion segmentation
作者:	Vidal, Rene Esteban.
面頁冊數:	167 p.
附註:	Chair: Shankar Sastry.
附註:	Source: Dissertation Abstracts International, Volume: 65-02, Section: B, page: 0945.
Contained By:	Dissertation Abstracts International65-02B.
標題:	Engineering, Electronics and Electrical.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3121739
ISBN:	0496690906

Generalized principal component analysis (GPCA) :An algebraic geometric approach to subspace clustering and motion segmentation
Vidal, Rene Esteban.

Generalized principal component analysis (GPCA) :An algebraic geometric approach to subspace clustering and motion segmentation [electronic resource] - 167 p.

Chair: Shankar Sastry.

Thesis (Ph.D.)--University of California, Berkeley, 2003.

For the classes of problems considered in this thesis, such segmentation independent constraints are polynomials of a certain degree in several variables. The degree of the polynomials corresponds to the number of groups and the factors of the polynomials encode the model parameters associated with each group. The problem is then reduced to (1) Computing the number of groups from data: this question is answered by looking for polynomials with the smallest possible degree that fit all the data points. This leads to simple rank constraints on the data from which one can estimate the number of groups after embedding the data into a higher-dimensional linear space. (2) Estimating the polynomials representing all the groups from data: this question is trivially answered by showing that the coefficients of the polynomials representing the data lie in the null space of the embedded data matrix. (3) Factoring such polynomials to obtain the model for each group: this question is answered with a novel polynomial factorization technique based on computing roots of univariate polynomials, plus a combination of linear algebra with multivariate polynomial differentiation and division. The solution can be obtained in closed form if and only if the number of groups is less than or equal to four. (Abstract shortened by UMI.)

ISBN: 0496690906Subjects--Topical Terms:

226981
Engineering, Electronics and Electrical.

Generalized principal component analysis (GPCA) :An algebraic geometric approach to subspace clustering and motion segmentation
LDR:03170nmm _2200289 _450 001 162450
005 20051017073448.5
008 230606s2003 eng d
020 $a 0496690906
035 $a 00148951
035 $a 162450
040 $a UnM $c UnM
100 0 $a Vidal, Rene Esteban. $3 227589
245 1 0 $a Generalized principal component analysis (GPCA) : $b An algebraic geometric approach to subspace clustering and motion segmentation $h [electronic resource]
300 $a 167 p.
500 $a Chair: Shankar Sastry.
500 $a Source: Dissertation Abstracts International, Volume: 65-02, Section: B, page: 0945.
502 $a Thesis (Ph.D.)--University of California, Berkeley, 2003.
520 # $a For the classes of problems considered in this thesis, such segmentation independent constraints are polynomials of a certain degree in several variables. The degree of the polynomials corresponds to the number of groups and the factors of the polynomials encode the model parameters associated with each group. The problem is then reduced to (1) Computing the number of groups from data: this question is answered by looking for polynomials with the smallest possible degree that fit all the data points. This leads to simple rank constraints on the data from which one can estimate the number of groups after embedding the data into a higher-dimensional linear space. (2) Estimating the polynomials representing all the groups from data: this question is trivially answered by showing that the coefficients of the polynomials representing the data lie in the null space of the embedded data matrix. (3) Factoring such polynomials to obtain the model for each group: this question is answered with a novel polynomial factorization technique based on computing roots of univariate polynomials, plus a combination of linear algebra with multivariate polynomial differentiation and division. The solution can be obtained in closed form if and only if the number of groups is less than or equal to four. (Abstract shortened by UMI.)
520 # $a This thesis presents a novel algebraic geometric framework for simultaneous data segmentation and model estimation, with the hope of providing a theoretical footing for the problem as well as an algorithm for initializing iterative techniques. The algebraic geometric approach presented in this thesis is based on eliminating the data segmentation part algebraically and then solving the model estimation part directly using all the data and without having to iterate between data segmentation and model estimation. The algebraic elimination of the data segmentation part is achieved by finding algebraic equations that are segmentation independent, that is equations that are satisfied by all the data regardless of the group or model associated with each point.
590 $a School code: 0028.
650 # 0 $a Engineering, Electronics and Electrical. $3 226981
650 # 0 $a Computer Science. $3 212513
690 $a 0544
690 $a 0984
710 0 # $a University of California, Berkeley. $3 212474
773 0 # $g 65-02B. $t Dissertation Abstracts International
790 $a 0028
790 1 0 $a Sastry, Shankar, $e advisor
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://libsw.nuk.edu.tw/login?url=http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3121739 $z http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3121739