中文
相关论文

相关论文: Hankel Matrix Nuclear Norm Regularized Tensor Comp…

200 篇论文

Many signals are modeled as a superposition of exponential functions in spectroscopy of chemistry, biology and medical imaging. This paper studies the problem of recovering exponential signals from a random subset of samples. We exploit the…

信号处理 · 电气工程与系统科学 2018-10-17 Jiaxi Ying , Jian-Feng Cai , Di Guo , Gongguo Tang , Zhong Chen , Xiaobo Qu

Exponential is a basic signal form, and how to fast acquire this signal is one of the fundamental problems and frontiers in signal processing. To achieve this goal, partial data may be acquired but result in the severe artifacts in its…

信号处理 · 电气工程与系统科学 2021-12-21 Yihui Huang , Jinkui Zhao , Zi Wang , Vladislav Orekhov , Di Guo , Xiaobo Qu

Many problems can be formulated as recovering a low-rank tensor. Although an increasingly common task, tensor recovery remains a challenging problem because of the delicacy associated with the decomposition of higher order tensors. To…

机器学习 · 统计学 2014-05-09 Ming Yuan , Cun-Hui Zhang

This paper explores robust recovery of a superposition of $R$ distinct complex exponential functions from a few random Gaussian projections. We assume that the signal of interest is of $2N-1$ dimensional and $R<<2N-1$. This framework covers…

信息论 · 计算机科学 2015-03-11 Jian-Feng Cai , Xiaobo Qu , Weiyu Xu , Gui-Bo Ye

Recovering a low-rank tensor from incomplete information is a recurring problem in signal processing and machine learning. The most popular convex relaxation of this problem minimizes the sum of the nuclear norms of the unfoldings of the…

机器学习 · 统计学 2013-08-16 Cun Mu , Bo Huang , John Wright , Donald Goldfarb

Signal sampling and reconstruction is a fundamental engineering task at the heart of signal processing. The celebrated Shannon-Nyquist theorem guarantees perfect signal reconstruction from uniform samples, obtained at a rate twice the…

信号处理 · 电气工程与系统科学 2020-02-19 Charilaos I. Kanatsoulis , Xiao Fu , Nicholas D. Sidiropoulos , Mehmet Akçakaya

The paper studies the problem of recovering a spectrally sparse object from a small number of time domain samples. Specifically, the object of interest with ambient dimension $n$ is assumed to be a mixture of $r$ complex multi-dimensional…

信息论 · 计算机科学 2015-01-06 Yuxin Chen , Yuejie Chi

Minimizing the nuclear norm of a matrix has been shown to be very efficient in reconstructing a low-rank sampled matrix. Furthermore, minimizing the sum of nuclear norms of matricizations of a tensor has been shown to be very efficient in…

机器学习 · 统计学 2017-07-26 Morteza Ashraphijuo , Xiaodong Wang

Currently, low-rank tensor completion has gained cumulative attention in recovering incomplete visual data whose partial elements are missing. By taking a color image or video as a three-dimensional (3D) tensor, previous studies have…

计算机视觉与模式识别 · 计算机科学 2018-05-29 Shengke Xue , Wenyuan Qiu , Fan Liu , Xinyu Jin

In this paper, we introduce a novel low-rank Hankel tensor completion approach to address the problem of multi-measurement spectral compressed sensing. By lifting the multiple signals to a Hankel tensor, we reformulate this problem into a…

信息论 · 计算机科学 2025-07-08 Jinsheng Li , Xu Zhang , Shuang Wu , Wei Cui

The paper explores the problem of \emph{spectral compressed sensing}, which aims to recover a spectrally sparse signal from a small random subset of its $n$ time domain samples. The signal of interest is assumed to be a superposition of $r$…

信息论 · 计算机科学 2015-01-05 Yuxin Chen , Yuejie Chi

Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the…

数值分析 · 数学 2014-11-04 Holger Rauhut , Reinhold Schneider , Zeljka Stojanac

We investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries. In the Tucker decomposition framework, we show that the Riemannian optimization algorithm with initial value…

机器学习 · 统计学 2019-11-13 Jian-Feng Cai , Lizhang Miao , Yang Wang , Yin Xian

In this paper, we propose a novel model to recover a low-rank tensor by simultaneously performing double nuclear norm regularized low-rank matrix factorizations to the all-mode matricizations of the underlying tensor. An block successive…

计算机视觉与模式识别 · 计算机科学 2020-05-07 Haijin Zeng , Xiaozhen Xie , Jifeng Ning

Recently, low-rank tensor completion has become increasingly attractive in recovering incomplete visual data. Considering a color image or video as a three-dimensional (3D) tensor, existing studies have put forward several definitions of…

计算机视觉与模式识别 · 计算机科学 2019-01-09 Shengke Xue , Wenyuan Qiu , Fan Liu , Xinyu Jin

This note addresses the question if and why the nuclear norm heuristic can recover an impulse response generated by a stable single-real-pole system, if elements of the upper-triangle of the associated Hankel matrix were given. Since the…

系统与控制 · 计算机科学 2014-04-24 Liang Dai , Kristiaan Pelckmans

We consider the problem of recovering the superposition of $R$ distinct complex exponential functions from compressed non-uniform time-domain samples. Total Variation (TV) minimization or atomic norm minimization was proposed in the…

信息论 · 计算机科学 2017-11-07 Weiyu Xu , Jirong Yi , Soura Dasgupta , Jian-Feng Cai , Mathews Jacob , Myung Cho

Recovering a large matrix from limited measurements is a challenging task arising in many real applications, such as image inpainting, compressive sensing and medical imaging, and this kind of problems are mostly formulated as low-rank…

计算机视觉与模式识别 · 计算机科学 2014-06-12 Yilun Wang , Xinhua Su

Nuclear Magnetic Resonance (NMR) spectroscopy, which is modeled as the sum of damped exponential signals, has become an indispensable tool in various scenarios, such as the structure and function determination, chemical analysis, and…

医学物理 · 物理学 2020-11-17 Tianyu Qiu , Wenjing Liao , Di Guo , Dongbao Liu , Xin Wang , Jian-Feng Cai , Xiaobo Qu

This paper studies the problem of reconstructing spectrally sparse signals from a small random subset of time domain samples via low-rank Hankel matrix completion with the aid of prior information. By leveraging the low-rank structure of…

信息论 · 计算机科学 2021-05-05 Xu Zhang , Yulong Liu , Wei Cui
‹ 上一页 1 2 3 10 下一页 ›