Iterative Reconstrained Low-Rank Representation via Weighted Nonconvex Regularizer

Benefiting from the joint consideration of geometric structures and low-rank constraint, graph low-rank representation (GLRR) method has led to the state-of-the-art results in many applications. However, it faces the limitations that the structure of errors should be known a prior, the isolated cons...

Full description

Bibliographic Details
Main Authors: Jianwei Zheng, Cheng Lu, Hongchuan Yu, Wanliang Wang, Shengyong Chen
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8466962/
id doaj-baf94c5fe8bc42fcbbdbcc961c44a66d
record_format Article
spelling doaj-baf94c5fe8bc42fcbbdbcc961c44a66d2021-03-29T20:58:51ZengIEEEIEEE Access2169-35362018-01-016516935170710.1109/ACCESS.2018.28703718466962Iterative Reconstrained Low-Rank Representation via Weighted Nonconvex RegularizerJianwei Zheng0https://orcid.org/0000-0001-6017-0552Cheng Lu1Hongchuan Yu2Wanliang Wang3Shengyong Chen4School of Computer Science and Engineering, Zhejiang University of Technology, Hangzhou, ChinaSchool of Computer Science and Engineering, Zhejiang University of Technology, Hangzhou, ChinaNational Centre for Computer Animation, Bournemouth University, Poole, U.K.School of Computer Science and Engineering, Zhejiang University of Technology, Hangzhou, ChinaSchool of Computer Science and Engineering, Zhejiang University of Technology, Hangzhou, ChinaBenefiting from the joint consideration of geometric structures and low-rank constraint, graph low-rank representation (GLRR) method has led to the state-of-the-art results in many applications. However, it faces the limitations that the structure of errors should be known a prior, the isolated construction of graph Laplacian matrix, and the over shrinkage of the leading rank components. To improve GLRR in these regards, this paper proposes a new LRR model, namely iterative reconstrained LRR via weighted nonconvex regularization, using three distinguished properties on the concerned representation matrix. The first characterizes various distributions of the errors into an adaptively learned weight factor for more flexibility of noise suppression. The second generates an accurate graph matrix from weighted observations for less afflicted by noisy features. The third employs a parameterized rational function to reveal the importance of different rank components for better approximation to the intrinsic subspace structure. Following a deep exploration of automatic thresholding, parallel update, and partial SVD operation, we derive a computationally efficient low-rank representation algorithm using an iterative reconstrained framework and accelerated proximal gradient method. Comprehensive experiments are conducted on synthetic data, image clustering, and background subtraction to achieve several quantitative benchmarks as clustering accuracy, normalized mutual information, and execution time. Results demonstrate the robustness and efficiency of IRWNR compared with other state-of-the-art models.https://ieeexplore.ieee.org/document/8466962/Low-rank representation (LRR)weighted nonconvex constraintaccelerated proximal gradientsingular value thresholdingpower method
collection DOAJ
language English
format Article
sources DOAJ
author Jianwei Zheng
Cheng Lu
Hongchuan Yu
Wanliang Wang
Shengyong Chen
spellingShingle Jianwei Zheng
Cheng Lu
Hongchuan Yu
Wanliang Wang
Shengyong Chen
Iterative Reconstrained Low-Rank Representation via Weighted Nonconvex Regularizer
IEEE Access
Low-rank representation (LRR)
weighted nonconvex constraint
accelerated proximal gradient
singular value thresholding
power method
author_facet Jianwei Zheng
Cheng Lu
Hongchuan Yu
Wanliang Wang
Shengyong Chen
author_sort Jianwei Zheng
title Iterative Reconstrained Low-Rank Representation via Weighted Nonconvex Regularizer
title_short Iterative Reconstrained Low-Rank Representation via Weighted Nonconvex Regularizer
title_full Iterative Reconstrained Low-Rank Representation via Weighted Nonconvex Regularizer
title_fullStr Iterative Reconstrained Low-Rank Representation via Weighted Nonconvex Regularizer
title_full_unstemmed Iterative Reconstrained Low-Rank Representation via Weighted Nonconvex Regularizer
title_sort iterative reconstrained low-rank representation via weighted nonconvex regularizer
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2018-01-01
description Benefiting from the joint consideration of geometric structures and low-rank constraint, graph low-rank representation (GLRR) method has led to the state-of-the-art results in many applications. However, it faces the limitations that the structure of errors should be known a prior, the isolated construction of graph Laplacian matrix, and the over shrinkage of the leading rank components. To improve GLRR in these regards, this paper proposes a new LRR model, namely iterative reconstrained LRR via weighted nonconvex regularization, using three distinguished properties on the concerned representation matrix. The first characterizes various distributions of the errors into an adaptively learned weight factor for more flexibility of noise suppression. The second generates an accurate graph matrix from weighted observations for less afflicted by noisy features. The third employs a parameterized rational function to reveal the importance of different rank components for better approximation to the intrinsic subspace structure. Following a deep exploration of automatic thresholding, parallel update, and partial SVD operation, we derive a computationally efficient low-rank representation algorithm using an iterative reconstrained framework and accelerated proximal gradient method. Comprehensive experiments are conducted on synthetic data, image clustering, and background subtraction to achieve several quantitative benchmarks as clustering accuracy, normalized mutual information, and execution time. Results demonstrate the robustness and efficiency of IRWNR compared with other state-of-the-art models.
topic Low-rank representation (LRR)
weighted nonconvex constraint
accelerated proximal gradient
singular value thresholding
power method
url https://ieeexplore.ieee.org/document/8466962/
work_keys_str_mv AT jianweizheng iterativereconstrainedlowrankrepresentationviaweightednonconvexregularizer
AT chenglu iterativereconstrainedlowrankrepresentationviaweightednonconvexregularizer
AT hongchuanyu iterativereconstrainedlowrankrepresentationviaweightednonconvexregularizer
AT wanliangwang iterativereconstrainedlowrankrepresentationviaweightednonconvexregularizer
AT shengyongchen iterativereconstrainedlowrankrepresentationviaweightednonconvexregularizer
_version_ 1724193766073434112