Computing Eigenspaces With Low Rank Constraints

2021 ◽  
Vol 43 (1) ◽  
pp. A586-A608
Author(s):  
Christian Krumnow ◽  
Max Pfeffer ◽  
André Uschmajew
Keyword(s):  
Low Rank ◽  
Author(s):  
Mei Sun ◽  
Jinxu Tao ◽  
Zhongfu Ye ◽  
Bensheng Qiu ◽  
Jinzhang Xu ◽  
...  

Background: In order to overcome the limitation of long scanning time, compressive sensing (CS) technology exploits the sparsity of image in some transform domain to reduce the amount of acquired data. Therefore, CS has been widely used in magnetic resonance imaging (MRI) reconstruction. </P><P> Discussion: Blind compressed sensing enables to recover the image successfully from highly under- sampled measurements, because of the data-driven adaption of the unknown transform basis priori. Moreover, analysis-based blind compressed sensing often leads to more efficient signal reconstruction with less time than synthesis-based blind compressed sensing. Recently, some experiments have shown that nonlocal low-rank property has the ability to preserve the details of the image for MRI reconstruction. Methods: Here, we focus on analysis-based blind compressed sensing, and combine it with additional nonlocal low-rank constraint to achieve better MR images from fewer measurements. Instead of nuclear norm, we exploit non-convex Schatten p-functionals for the rank approximation. </P><P> Results & Conclusion: Simulation results indicate that the proposed approach performs better than the previous state-of-the-art algorithms.


2017 ◽  
Author(s):  
Arnaud Dupuy ◽  
Alfred Galichon ◽  
Yifei Sun

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 49967-49978 ◽  
Author(s):  
Xiao Jin ◽  
Yuting Su ◽  
Liang Zou ◽  
Yongwei Wang ◽  
Peiguang Jing ◽  
...  

2019 ◽  
Vol 8 (4) ◽  
pp. 677-689
Author(s):  
Arnaud Dupuy ◽  
Alfred Galichon ◽  
Yifei Sun

Abstract In this paper, we address the problem of estimating transport surplus (a.k.a. matching affinity) in high-dimensional optimal transport problems. Classical optimal transport theory specifies the matching affinity and determines the optimal joint distribution. In contrast, we study the inverse problem of estimating matching affinity based on the observation of the joint distribution, using an entropic regularization of the problem. To accommodate high dimensionality of the data, we propose a novel method that incorporates a nuclear norm regularization that effectively enforces a rank constraint on the affinity matrix. The low-rank matrix estimated in this way reveals the main factors that are relevant for matching.


Sign in / Sign up

Export Citation Format

Share Document