Discriminative Low-Rank Subspace Learning with Nonconvex Penalty

2019 ◽  
Vol 33 (10) ◽  
pp. 1951006
Author(s):  
Kan Xie ◽  
Wei Liu ◽  
Yue Lai ◽  
Weijun Li
Keyword(s):  
Face Recognition ◽  
State Of The Art ◽  
Subspace Learning ◽  
Experimental Results ◽  
Low Rank ◽  
Learning Method ◽  
Original Solution ◽  
Discriminative Subspace ◽  
Low Rank Representation ◽  
Facial Images

Subspace learning has been widely utilized to extract discriminative features for classification task, such as face recognition, even when facial images are occluded or corrupted. However, the performance of most existing methods would be degraded significantly in the scenario of that data being contaminated with severe noise, especially when the magnitude of the gross corruption can be arbitrarily large. To this end, in this paper, a novel discriminative subspace learning method is proposed based on the well-known low-rank representation (LRR). Specifically, a discriminant low-rank representation and the projecting subspace are learned simultaneously, in a supervised way. To avoid the deviation from the original solution by using some relaxation, we adopt the Schatten [Formula: see text]-norm and [Formula: see text]-norm, instead of the nuclear norm and [Formula: see text]-norm, respectively. Experimental results on two famous databases, i.e. PIE and ORL, demonstrate that the proposed method achieves better classification scores than the state-of-the-art approaches.

Computing Robust Principal Components by A* Search

2018 ◽  
Vol 27 (07) ◽  
pp. 1860013 ◽  
Author(s):  
Swair Shah ◽  
Baokun He ◽  
Crystal Maung ◽  
Haim Schweitzer
Keyword(s):  
State Of The Art ◽  
Principal Component ◽  
Low Rank ◽  
A Algorithm ◽  
Running Time ◽  
Current State ◽  
Dimensionality Reduction Technique ◽  
Related Variant ◽  
Low Rank Representation ◽  
The Cost

Principal Component Analysis (PCA) is a classical dimensionality reduction technique that computes a low rank representation of the data. Recent studies have shown how to compute this low rank representation from most of the data, excluding a small amount of outlier data. We show how to convert this problem into graph search, and describe an algorithm that solves this problem optimally by applying a variant of the A* algorithm to search for the outliers. The results obtained by our algorithm are optimal in terms of accuracy, and are shown to be more accurate than results obtained by the current state-of-the- art algorithms which are shown not to be optimal. This comes at the cost of running time, which is typically slower than the current state of the art. We also describe a related variant of the A* algorithm that runs much faster than the optimal variant and produces a solution that is guaranteed to be near the optimal. This variant is shown experimentally to be more accurate than the current state-of-the-art and has a comparable running time.

scholarly journals A Boosting Framework of Factorization Machine

2021 ◽  
pp. 2159036
Author(s):  
Jun Zhou ◽  
Longfei Li ◽  
Ziqi Liu ◽  
Chaochao Chen
Keyword(s):  
Large Scale ◽  
State Of The Art ◽  
Experimental Results ◽  
Low Rank ◽  
Inner Product ◽  
Adaptive Boosting ◽  
Rank Matrix ◽  
Factorization Machine ◽  
Fixed Rank ◽  
Low Rank Matrix

Recently, Factorization Machine (FM) has become more and more popular for recommendation systems due to its effectiveness in finding informative interactions between features. Usually, the weights for the interactions are learned as a low rank weight matrix, which is formulated as an inner product of two low rank matrices. This low rank matrix can help improve the generalization ability of Factorization Machine. However, to choose the rank properly, it usually needs to run the algorithm for many times using different ranks, which clearly is inefficient for some large-scale datasets. To alleviate this issue, we propose an Adaptive Boosting framework of Factorization Machine (AdaFM), which can adaptively search for proper ranks for different datasets without re-training. Instead of using a fixed rank for FM, the proposed algorithm will gradually increase its rank according to its performance until the performance does not grow. Extensive experiments are conducted to validate the proposed method on multiple large-scale datasets. The experimental results demonstrate that the proposed method can be more effective than the state-of-the-art Factorization Machines.

Subspace Learning Based Low-Rank Representation

2017 ◽  
pp. 416-431 ◽  
Author(s):  
Kewei Tang ◽  
Xiaodong Liu ◽  
Zhixun Su ◽  
Wei Jiang ◽  
Jiangxin Dong
Keyword(s):  
Subspace Learning ◽  
Low Rank ◽  
Low Rank Representation

Joint low-rank representation and spectral regression for robust subspace learning

2020 ◽  
Vol 195 ◽  
pp. 105723
Author(s):  
Yong Peng ◽  
Leijie Zhang ◽  
Wanzeng Kong ◽  
Feiwei Qin ◽  
Jianhai Zhang
Keyword(s):  
Subspace Learning ◽  
Low Rank ◽  
Low Rank Representation ◽  
Spectral Regression

scholarly journals Part-Based Visual Tracking via Online Weighted P-N Learning

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Heng Fan ◽  
Jinhai Xiang ◽  
Jun Xu ◽  
Honghong Liao
Keyword(s):  
Visual Tracking ◽  
State Of The Art ◽  
The State ◽  
Tracking Algorithm ◽  
Local Feature ◽  
Experimental Results ◽  
Learning Method ◽  
Target Model ◽  
Tracking Process

We propose a novel part-based tracking algorithm using online weighted P-N learning. An online weighted P-N learning method is implemented via considering the weight of samples during classification, which improves the performance of classifier. We apply weighted P-N learning to track a part-based target model instead of whole target. In doing so, object is segmented into fragments and parts of them are selected as local feature blocks (LFBs). Then, the weighted P-N learning is employed to train classifier for each local feature block (LFB). Each LFB is tracked through the corresponding classifier, respectively. According to the tracking results of LFBs, object can be then located. During tracking process, to solve the issues of occlusion or pose change, we use a substitute strategy to dynamically update the set of LFB, which makes our tracker robust. Experimental results demonstrate that the proposed method outperforms the state-of-the-art trackers.

scholarly journals Multimodal verge for scale and pose variant real time face tracking and recognition

2019 ◽  
Vol 13 (2) ◽  
pp. 665
Author(s):  
Ramkumar Govindaraj ◽  
E. Logashanmugam
Keyword(s):  
Image Processing ◽  
Face Recognition ◽  
Real Time ◽  
Research Field ◽  
Face Tracking ◽  
Low Rank ◽  
Facial Features ◽  
The Face ◽  
Low Rank Representation ◽  
Tracking And Recognition

In recent times face tracking and face recognition have turned out to be increasingly dynamic research field in image processing. This work proposed the framework DEtecting Contiguous Outliers in the LOw-rank Representation for face tracking, in this algorithm the background is assessed by a low-rank network and foreground articles can be distinguished as anomalies. This is suitable for non-rigid foreground motion and moving camera. The face of a foreground person is caught from the frame and then it is contrasted and the speculated pictures stored in the dataset. Here we used Viola-Jones algorithm for face recognition. This approach outperforms the traditional algorithms on multimodal video methodologies and it works adequately on extensive variety of security and surveillance purposes. Results on the continuous demonstrate that the proposed calculation can correctly obtain facial features points. The algorithm is relegate on the continuous camera input and under ongoing ecological conditions.

Sign in / Sign up

Export Citation Format

Share Document