scholarly journals A RPCA-Based ISAR Imaging Method for Micromotion Targets

Sensors ◽  
2020 ◽  
Vol 20 (10) ◽  
pp. 2989
Author(s):  
Liangyou Lu ◽  
Peng Chen ◽  
Lenan Wu
Keyword(s):  
Simulated Data ◽  
Principal Component ◽  
Low Rank ◽  
Synthetic Aperture ◽  
Imaging Method ◽  
Method Of Multipliers ◽  
Robust Principal Component Analysis ◽  
Isar Imaging ◽  
Numerical Robustness ◽  
Alternative Direction Method

Micro-Doppler generated by the micromotion of a target contaminates the inverse synthetic aperture radar (ISAR) image heavily. To acquire a clear ISAR image, removing the Micro-Doppler is an indispensable task. By exploiting the sparsity of the ISAR image and the low-rank of Micro-Doppler signal in the Range-Doppler (RD) domain, a novel Micro-Doppler removal method based on the robust principal component analysis (RPCA) framework is proposed. We formulate the model of sparse ISAR imaging for micromotion target in the framework of RPCA. Then, the imaging problem is decomposed into iterations between the sub-problem of sparse imaging and Micro-Doppler extraction. The alternative direction method of multipliers (ADMM) approach is utilized to seek for the solution of each sub-problem. Furthermore, to improve the computational efficiency and numerical robustness in the Micro-Doppler extraction, an SVD-free method is presented to further lessen the calculative burden. Experimental results with simulated data validate the effectiveness of the proposed method.

scholarly journals Differentially Expressed Genes Extracted by the Tensor Robust Principal Component Analysis (TRPCA) Method

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Yue Hu ◽  
Jin-Xing Liu ◽  
Ying-Lian Gao ◽  
Sheng-Jun Li ◽  
Juan Wang
Keyword(s):  
Principal Component Analysis ◽  
Differentially Expressed Genes ◽  
Principal Component ◽  
Component Analysis ◽  
Differentially Expressed ◽  
Low Rank ◽  
Cancer Gene ◽  
Sequencing Data ◽  
Robust Principal Component Analysis ◽  
The Matrix

In the big data era, sequencing technology has produced a large number of biological sequencing data. Different views of the cancer genome data provide sufficient complementary information to explore genetic activity. The identification of differentially expressed genes from multiview cancer gene data is of great importance in cancer diagnosis and treatment. In this paper, we propose a novel method for identifying differentially expressed genes based on tensor robust principal component analysis (TRPCA), which extends the matrix method to the processing of multiway data. To identify differentially expressed genes, the plan is carried out as follows. First, multiview data containing cancer gene expression data from different sources are prepared. Second, the original tensor is decomposed into a sum of a low-rank tensor and a sparse tensor using TRPCA. Third, the differentially expressed genes are considered to be sparse perturbed signals and then identified based on the sparse tensor. Fourth, the differentially expressed genes are evaluated using Gene Ontology and Gene Cards tools. The validity of the TRPCA method was tested using two sets of multiview data. The experimental results showed that our method is superior to the representative methods in efficiency and accuracy aspects.

scholarly journals Background modeling from video sequences via online motion-aware RPCA

2021 ◽  
pp. 29-29
Author(s):  
Xu Weiyao ◽  
Xia Ting ◽  
Jing Changqiang
Keyword(s):  
Principal Component ◽  
Background Modeling ◽  
Low Rank ◽  
Video Frame ◽  
Robust Principal Component Analysis ◽  
Online Application ◽  
Rank Matrix ◽  
Computer Vision Applications ◽  
Low Rank Matrix ◽  
Nuclear Norm Regularization

Background modeling of video frame sequences is a prerequisite for computer vision applications. Robust principal component analysis(RPCA), which aims to recover low rank matrix in applications of data mining and machine learning, has shown improved background modeling performance. Unfortunately, The traditional RPCA method considers the batch recovery of low rank matrix of all samples, which leads to higher storage cost. This paper proposes a novel online motion-aware RPCA algorithm, named OM-RPCAT, which adopt truncated nuclear norm regularization as an approximation method for of low rank constraint. And then, Two methods are employed to obtain the motion estimation matrix, the optical flow and the frame selection, which are merged into the data items to separate the foreground and background. Finally, an efficient alternating optimization algorithm is designed in an online manner. Experimental evaluations of challenging sequences demonstrate promising results over state-of-the-art methods in online application.

scholarly journals An Evaluation of Supervised Dimensionality Reduction For Large Scale Data

2022 ◽  
pp. 17-25
Author(s):  
Nancy Jan Sliper
Keyword(s):  
Dimensionality Reduction ◽  
Large Scale ◽  
Simulated Data ◽  
Principal Component ◽  
Low Rank ◽  
Learning Tools ◽  
Large Scale Data ◽  
Reduction Methods ◽  
Low Dimensional ◽  
Scale Data

Experimenters today frequently quantify millions or even billions of characteristics (measurements) each sample to address critical biological issues, in the hopes that machine learning tools would be able to make correct data-driven judgments. An efficient analysis requires a low-dimensional representation that preserves the differentiating features in data whose size and complexity are orders of magnitude apart (e.g., if a certain ailment is present in the person's body). While there are several systems that can handle millions of variables and yet have strong empirical and conceptual guarantees, there are few that can be clearly understood. This research presents an evaluation of supervised dimensionality reduction for large scale data. We provide a methodology for expanding Principal Component Analysis (PCA) by including category moment estimations in low-dimensional projections. Linear Optimum Low-Rank (LOLR) projection, the cheapest variant, includes the class-conditional means. We show that LOLR projections and its extensions enhance representations of data for future classifications while retaining computing flexibility and reliability using both experimental and simulated data benchmark. When it comes to accuracy, LOLR prediction outperforms other modular linear dimension reduction methods that require much longer computation times on conventional computers. LOLR uses more than 150 million attributes in brain image processing datasets, and many genome sequencing datasets have more than half a million attributes.

Low-rank tensor train for tensor robust principal component analysis

2020 ◽  
Vol 367 ◽  
pp. 124783 ◽  
Author(s):  
Jing-Hua Yang ◽  
Xi-Le Zhao ◽  
Teng-Yu Ji ◽  
Tian-Hui Ma ◽  
Ting-Zhu Huang
Keyword(s):  
Principal Component Analysis ◽  
Principal Component ◽  
Component Analysis ◽  
Low Rank ◽  
Robust Principal Component Analysis ◽  
Rank Tensor

scholarly journals Robust principal component analysis using facial reduction

2019 ◽  
Vol 21 (3) ◽  
pp. 1195-1219
Author(s):  
Shiqian Ma ◽  
Fei Wang ◽  
Linchuan Wei ◽  
Henry Wolkowicz
Keyword(s):  
Principal Component Analysis ◽  
Principal Component ◽  
Low Rank ◽  
Data Matrix ◽  
Weighted Sum ◽  
Np Hard ◽  
Robust Principal Component Analysis ◽  
First Order ◽  
Facial Reduction ◽  
First Order Methods

AbstractWe introduce a novel approach for robust principal component analysis (RPCA) for a partially observed data matrix. The aim is to recover the data matrix as a sum of a low-rank matrix and a sparse matrix so as to eliminate erratic noise (outliers). This problem is known to be NP-hard in general. A classical approach to solving RPCA is to consider convex relaxations. One such heuristic involves the minimization of the (weighted) sum of a nuclear norm part, that promotes a low-rank component, with an $$\ell _1$$ ℓ 1 norm part, to promote a sparse component. This results in a well-structured convex problem that can be efficiently solved by modern first-order methods. However, first-order methods often yield low accuracy solutions. Moreover, the heuristic of using a norm consisting of a weighted sum of norms may lose some of the advantages that each norm had when used separately. In this paper, we propose a novel nonconvex and nonsmooth reformulation of the original NP-hard RPCA model. The new model adds a redundant semidefinite cone constraint and solves small subproblems using a PALM algorithm. Each subproblem results in an exposing vector for a facial reduction technique that is able to reduce the size significantly. This makes the problem amenable to efficient algorithms in order to obtain high-level accuracy. We include numerical results that confirm the efficacy of our approach.

Sign in / Sign up

Export Citation Format

Share Document