Recovery of Surfaces and Functions in High Dimensions: Sampling Theory and Links to Neural Networks

被引:2
作者
Zou, Qing [1 ]
Jacob, Mathews [2 ]
机构
[1] Univ Iowa, Appl Math & Computat Sci, Iowa City, IA 52242 USA
[2] Univ Iowa, Dept Elect & Comp Engn, Iowa City, IA 52242 USA
关键词
level set; surface recovery; function representation; image denoising; neural networks; LEVEL-SET; MANIFOLD RECOVERY; REGULARIZATION; UNION; REPRESENTATIONS; RECONSTRUCTION; ALGORITHMS; MACHINE; SPARSE; IMAGES;
D O I
10.1137/20M1340654
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Several imaging algorithms including patch-based image denoising, image time series recovery, and convolutional neural networks can be thought of as methods that exploit the manifold structure of signals. While the empirical performance of these algorithms is impressive, the understanding of recovery of the signals and functions that live on the manifold is less understood. In this paper, we focus on the recovery of signals that live on a union of surfaces. In particular, we consider signals living on a union of smooth band-limited surfaces in high dimensions. We show that an exponential mapping transforms the data to a union of low-dimensional subspaces. Using this relation, we introduce a sampling theoretical framework for the recovery of smooth surfaces from few samples and the learning of functions living on smooth surfaces. The low-rank property of the features is used to determine the number of measurements needed to recover the surface. Moreover, the low-rank property of the features also provides an efficient approach, which resembles a neural network, for the local representation of multidimensional functions on the surface. The direct representation of such a function in high dimensions often suffers from the curse of dimensionality; the large number of parameters would translate to the need for extensive training data. The low-rank property of the features can significantly reduce the number of parameters, which makes the computational structure attractive for learning and inference from limited labeled training data.
引用
收藏
页码:580 / 619
页数:40
相关论文
共 59 条
  • [21] Distance Regularized Level Set Evolution and Its Application to Image Segmentation
    Li, Chunming
    Xu, Chenyang
    Gui, Changfeng
    Fox, Martin D.
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2010, 19 (12) : 3243 - 3254
  • [22] Li T, 2011, IEEE IMAGE PROC, P1037, DOI 10.1109/ICIP.2011.6115601
  • [23] A theory for sampling signals from a union of subspaces
    Lu, Yue M.
    Do, Minh N.
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (06) : 2334 - 2345
  • [24] Mairal J, 2014, ADV NEURAL INFORM PR, P2627
  • [25] Xampling: Signal Acquisition and Processing in Union of Subspaces
    Mishali, Moshe
    Eldar, Yonina C.
    Elron, Asaf J.
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2011, 59 (10) : 4719 - 4734
  • [26] Mohan K, 2012, J MACH LEARN RES, V13, P3441
  • [27] Accelerated Dynamic MRI Using Patch Regularization for Implicit Motion Compensation
    Mohsin, Yasir Q.
    Lingala, Sajan Goud
    DiBella, Edward
    Jacob, Mathews
    [J]. MAGNETIC RESONANCE IN MEDICINE, 2017, 77 (03) : 1238 - 1248
  • [28] An introduction to kernel-based learning algorithms
    Müller, KR
    Mika, S
    Rätsch, G
    Tsuda, K
    Schölkopf, B
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 2001, 12 (02): : 181 - 201
  • [29] A Kernel-Based Low-Rank (KLR) Model for Low-Dimensional Manifold Recovery in Highly Accelerated Dynamic MRI
    Nakarmi, Ukash
    Wang, Yanhua
    Lyu, Jingyuan
    Liang, Dong
    Ying, Leslie
    [J]. IEEE TRANSACTIONS ON MEDICAL IMAGING, 2017, 36 (11) : 2297 - 2307
  • [30] Ongie G, 2017, PR MACH LEARN RES, V70