Deterministic Column-Based Matrix Decomposition

Authors:
Xuelong Li;Yawei Pang
Affiliations:
Chinese Academy of Sciences, Xi'an;Tianjin University, Tianjin
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
2010

Citing 0
Cited 13

Maximum margin criterion with tensor representation

Neurocomputing
Incremental pairwise discriminant analysis based visual tracking

Neurocomputing
Non-goal scene analysis for soccer video

Neurocomputing
A linear discriminant analysis method based on mutual information maximization

Pattern Recognition
Transfer latent variable model based on divergence analysis

Pattern Recognition
Beyond search: Event-driven summarization for web videos

ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Learning optimal spatial filters by discriminant analysis for brain-computer-interface

Neurocomputing
A method using long digital straight segments for fingerprint recognition

Neurocomputing
Efficient image matching using weighted voting

Pattern Recognition Letters
Scale invariant image matching using triplewise constraint and weighted voting

Neurocomputing
Similarity learning for object recognition based on derived kernel

Neurocomputing
Biview face recognition in the shape-texture domain

Pattern Recognition
Characteristic matrix of covering and its application to Boolean matrix decomposition

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a deterministic column-based matrix decomposition method. Conventional column-based matrix decomposition (CX) computes the columns by randomly sampling columns of the data matrix. Instead, the newly proposed method (termed as CX_D) selects columns in a deterministic manner, which well approximates singular value decomposition. The experimental results well demonstrate the power and the advantages of the proposed method upon three real-world data sets.