English
Related papers

Related papers: A Fast HRRP Synthesis Algorithm with Sensing Dicti…

200 papers

Matching pursuits are a class of greedy algorithms commonly used in signal processing, for solving the sparse approximation problem. They rely on an atom selection step that requires the calculation of numerous projections, which can be…

Data Structures and Algorithms · Computer Science 2012-04-06 Manuel Moussallam , Laurent Daudet , Gaël Richard

Heatmap regression (HR) has become one of the mainstream approaches for face alignment and has obtained promising results under constrained environments. However, when a face image suffers from large pose variations, heavy occlusions and…

Computer Vision and Pattern Recognition · Computer Science 2020-12-30 Jun Wan , Zhihui Lai , Jun Liu , Jie Zhou , Can Gao

Sparse decomposition of ground penetration radar (GPR) signals facilitates the use of compressed sensing techniques for faster data acquisition and enhanced feature extraction for target classification. In this paper, we investigate the…

Due to limited camera capacities, digital images usually have a narrower dynamic illumination range than real-world scene radiance. To resolve this problem, High Dynamic Range (HDR) reconstruction is proposed to recover the dynamic range to…

Image and Video Processing · Electrical Eng. & Systems 2023-12-14 Jiaqi Tang , Xiaogang Xu , Sixing Hu , Ying-Cong Chen

A well-known analysis of Tropp and Gilbert shows that orthogonal matching pursuit (OMP) can recover a k-sparse n-dimensional real vector from 4 k log(n) noise-free linear measurements obtained through a random Gaussian measurement matrix…

Information Theory · Computer Science 2015-05-28 Alyson K. Fletcher , Sundeep Rangan

In this paper we present a new coherence-based performance guarantee for the Orthogonal Matching Pursuit (OMP) algorithm. An upper bound for the probability of correctly identifying the support of a sparse signal with additive white…

Information Theory · Computer Science 2016-10-25 Mohammad Emadi , Ehsan Miandji , Jonas Unger , Ehsan Afshari

The simultaneous orthogonal matching pursuit (SOMP) algorithm aims to find the joint support of a set of sparse signals acquired under a multiple measurement vector model. Critically, the analysis of SOMP depends on the maximal inner…

Information Theory · Computer Science 2016-10-14 Jean-François Determe , Jérôme Louveaux , Laurent Jacques , François Horlin

The asymptotically optimal version of Rapidly-exploring Random Tree (RRT*) is often used to find optimal paths in a high-dimensional configuration space. The well-known issue of RRT* is its slow convergence towards the optimal solution. A…

Robotics · Computer Science 2025-03-21 Jonáš Kříž , Vojtěch Vonásek

In this paper, we consider orthogonal matching pursuit (OMP) algorithm for multiple measurement vectors (MMV) problem. The robustness of OMPMMV is studied under general perturbations---when the measurement vectors as well as the sensing…

Information Theory · Computer Science 2011-09-30 Jie Ding , Laming Chen , Yuantao Gu

Millimeter-wave radar plays a vital role in 3D object detection for autonomous driving due to its all-weather and all-lighting-condition capabilities for perception. However, radar point clouds suffer from pronounced sparsity and…

Computer Vision and Pattern Recognition · Computer Science 2024-12-17 Zijian Gu , Jianwei Ma , Yan Huang , Honghao Wei , Zhanye Chen , Hui Zhang , Wei Hong

Compressive Sensing (CS) is a new paradigm for the efficient acquisition of signals that have sparse representation in a certain domain. Traditionally, CS has provided numerous methods for signal recovery over an orthonormal basis. However,…

Information Theory · Computer Science 2019-05-08 Jianchen Zhu , Shengjie Zhao , Qingjiang Shi , Gonzalo R. Arce

Recently, sparsity-based algorithms are proposed for super-resolution spectrum estimation. However, to achieve adequately high resolution in real-world signal analysis, the dictionary atoms have to be close to each other in frequency,…

Machine Learning · Statistics 2015-06-05 Yiyuan She , Huanghuang Li , Jiangping Wang , Dapeng Wu

Motivated by the philosophy and phenomenal success of compressed sensing, the problem of reconstructing a matrix from a sampling of its entries has attracted much attention recently. Such a problem can be viewed as an information-theoretic…

Information Theory · Computer Science 2009-05-15 Zhisu Zhu , Anthony Man-Cho So , Yinyu Ye

Hard Thresholding Pursuit (HTP) is an iterative greedy selection procedure for finding sparse solutions of underdetermined linear systems. This method has been shown to have strong theoretical guarantee and impressive numerical performance.…

Machine Learning · Computer Science 2013-11-26 Xiao-Tong Yuan , Ping Li , Tong Zhang

Accurate depth maps are essential in various applications, such as autonomous driving, scene reconstruction, point-cloud creation, etc. However, monocular-depth estimation (MDE) algorithms often fail to provide enough texture & sharpness,…

Computer Vision and Pattern Recognition · Computer Science 2023-05-04 Aakash Rajpal , Noshaba Cheema , Klaus Illgner-Fehns , Philipp Slusallek , Sunil Jaiswal

This paper is concerned with developing an efficient numerical algorithm for fast implementation of the sparse grid method for computing the $d$-dimensional integral of a given function. The new algorithm, called the MDI-SG ({\em multilevel…

Numerical Analysis · Mathematics 2022-10-27 Huicong Zhong , Xiaobing Feng

There has been increasing interest in the generation of high-quality, realistic synthetic medical images in recent years. Such synthetic datasets can mitigate the scarcity of public datasets for artificial intelligence research, and can…

Image and Video Processing · Electrical Eng. & Systems 2025-07-15 Sanyam Jain , Bruna Neves de Freitas , Andreas Basse-OConnor , Alexandros Iosifidis , Ruben Pauwels

Online augmentation of an oblique aerial image sequence with structural information is an essential aspect in the process of 3D scene interpretation and analysis. One key aspect in this is the efficient dense image matching and depth…

Computer Vision and Pattern Recognition · Computer Science 2019-09-24 Boitumelo Ruf , Thomas Pollok , Martin Weinmann

In this paper, we consider the problem of joint delay-Doppler estimation of moving targets in a passive radar that makes use of orthogonal frequency-division multiplexing (OFDM) communication signals. A compressed sensing algorithm is…

Information Theory · Computer Science 2017-04-05 Le Zheng , Xiaodong Wang

The state-of-the-art automotive radars employ multidimensional discrete Fourier transforms (DFT) in order to estimate various target parameters. The DFT is implemented using the fast Fourier transform (FFT), at sample and computational…

Signal Processing · Electrical Eng. & Systems 2018-01-16 Shaogang Wang , Vishal M. Patel , Athina Petropulu