Reconstruction of compressed video via non-convex minimization
This paper studies the sparsity prior to compressed video reconstruction algorithms. An effective non-convex 3DTPV regularization (0 < p < 1) is proposed for sparsity promotion. Based on the augmented Lagrangian reconstruction algorithm, this paper analyzes and compares three non-convex proxim...
Main Authors: | Chao Ji, Jinshou Tian, Liang Sheng, Kai He, Liwei Xin, Xin Yan, Yanhua Xue, Minrui Zhang, Ping Chen, Xing Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
AIP Publishing LLC
2020-11-01
|
Series: | AIP Advances |
Online Access: | http://dx.doi.org/10.1063/5.0022860 |
Similar Items
-
Convex Combinations of Minimal Graphs
by: Michael Dorff, et al.
Published: (2012-01-01) -
Greedy Strategies for Convex Minimization
by: Nguyen, Hao Thanh
Published: (2013) -
Subgradient methods for convex minimization
by: NediÄ , Angelia
Published: (2005) -
Reconstructing convex sets
by: Greschak, John Paul
Published: (2005) -
Non-convex block-sparse compressed sensing with coherent tight frames
by: Xiaohu Luo, et al.
Published: (2020-01-01)