English
Related papers

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

200 papers

Sparse representation with training-based dictionary has been shown successful on super resolution(SR) but still have some limitations. Based on the idea of making the magnification of function curve without losing its fidelity, we proposed…

Computer Vision and Pattern Recognition · Computer Science 2019-06-12 Junyi Bian , Baojun Lin , Ke Zhang

Estimation of a sparse spectral precision matrix, the inverse of a spectral density matrix, is a canonical problem in frequency-domain analysis of high-dimensional time series (HDTS), with applications in neurosciences and environmental…

Methodology · Statistics 2025-11-11 Navonil Deb , Amy Kuceyeski , Sumanta Basu

Greedy algorithms for feature selection are widely used for recovering sparse high-dimensional vectors in linear models. In classical procedures, the main emphasis was put on the sample complexity, with little or no consideration of the…

Machine Learning · Statistics 2021-02-11 El Mehdi Saad , Gilles Blanchard , Sylvain Arlot

A structured random matrix ensemble that maintains constant modulus entries and unit-norm columns, often called a random phase-rotated (RPR) matrix, is considered in this paper. We analyze the coherence statistics of RPR measurement…

Signal Processing · Electrical Eng. & Systems 2019-10-23 Qiyou Duan , Taejoon Kim , Lin Dai , Erik Perrins

Extended ambiguity performance (EAP), which includes all grating lobes and side peaks, indicates the maximum detectable region without undesired peaks for target parameter estimation and is critical to radar sensor design. Driven by EAP…

Signal Processing · Electrical Eng. & Systems 2024-11-14 Rui Zhang , Shawn Tsai , Tzu-Han Chou , Jiaying Ren , Wenze Qu , Oliver Sun

We consider the high-dimensional sparse linear regression problem of accurately estimating a sparse vector using a small number of linear measurements that are contaminated by noise. It is well known that the standard cadre of…

Statistics Theory · Mathematics 2014-02-25 Divyanshu Vats , Richard G. Baraniuk

We propose a novel application of the Simultaneous Orthogonal Matching Pursuit (S-OMP) procedure for sparsistant variable selection in ultra-high dimensional multi-task regression problems. Screening of variables, as introduced in…

Machine Learning · Statistics 2010-12-20 Mladen Kolar , Eric P. Xing

Remote sensing (RS) image-text retrieval faces significant challenges in real-world datasets due to the presence of Pseudo-Matched Pairs (PMPs), semantically mismatched or weakly aligned image-text pairs, which hinder the learning of…

Computer Vision and Pattern Recognition · Computer Science 2025-12-23 Pengxiang Ouyang , Qing Ma , Zheng Wang , Cong Bai

Deep dictionary learning seeks multiple dictionaries at different image scales to capture complementary coherent characteristics. We propose a method for learning a hierarchy of synthesis dictionaries with an image classification goal. The…

Computer Vision and Pattern Recognition · Computer Science 2019-09-04 Shahin Mahdizadehaghdam , Ashkan Panahi , Hamid Krim , Liyi Dai

Orthogonal Matching Pursuit (OMP) has long been considered a powerful heuristic for attacking compressive sensing problems; however, its theoretical development is, unfortunately, somewhat lacking. This paper presents an improved Restricted…

Data Structures and Algorithms · Computer Science 2011-02-22 Ray Maleh

This paper presents new theoretical results on sparse recovery guarantees for a greedy algorithm, Orthogonal Matching Pursuit (OMP), in the context of continuous parametric dictionaries. Here, the continuous setting means that the…

Information Theory · Computer Science 2020-12-23 Clément Elvira , Rémi Gribonval , Charles Soussen , Cédric Herzet

Distributed deep learning (DDL) is a promising research area, which aims to increase the efficiency of training deep learning tasks with large size of datasets and models. As the computation capability of DDL nodes continues to increase,…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-07-11 Zixuan Chen , Lei Shi , Xuandong Liu , Jiahui Li , Sen Liu , Yang Xu

Sparse random mode decomposition (SRMD) is a novel algorithm that constructs a random time-frequency feature space to sparsely approximate spectrograms, effectively separating modes. However, it fails to distinguish adjacent or overlapped…

Signal Processing · Electrical Eng. & Systems 2025-01-28 Chen Luo , Tao Chen , Lei Xie , Hongye Su

Feature selection for predictive analytics is the problem of identifying a minimal-size subset of features that is maximally predictive of an outcome of interest. To apply to molecular data, feature selection algorithms need to be scalable…

Machine Learning · Statistics 2020-04-02 Michail Tsagris , Zacharias Papadovasilakis , Kleanthi Lakiotaki , Ioannis Tsamardinos

Compressed sensing has a wide range of applications that include error correction, imaging, radar and many more. Given a sparse signal in a high dimensional space, one wishes to reconstruct that signal accurately and efficiently from a…

Numerical Analysis · Mathematics 2009-05-28 Deanna Needell

In the maintenance of optical fiber networks, there is a growing demand for high-precision measurement of optical loss distribution and fault locations over long distances. In this study, we propose an OCDR method incorporating periodic…

State-of-the-art algorithms for sparse subspace clustering perform spectral clustering on a similarity matrix typically obtained by representing each data point as a sparse combination of other points using either basis pursuit (BP) or…

Machine Learning · Computer Science 2017-11-02 Abolfazl Hashemi , Haris Vikalo

Accurate depth estimation is critical for autonomous driving perception systems, particularly for long range vehicle detection on highways. Traditional dense stereo matching methods such as Block Matching (BM) and Semi Global Matching (SGM)…

Computer Vision and Pattern Recognition · Computer Science 2026-04-10 Qihao Huang

Compressive sensing (CS) has recently emerged as a powerful framework for acquiring sparse signals. The bulk of the CS literature has focused on the case where the acquired signal has a sparse or compressible representation in an…

Information Theory · Computer Science 2013-06-24 Mark A. Davenport , Deanna Needell , Michael B. Wakin

High resolution (HR) 3D images are widely used nowadays, such as medical images like Magnetic Resonance Imaging (MRI) and Computed Tomography (CT). However, segmentation of these 3D images remains a challenge due to their high spatial…

Image and Video Processing · Electrical Eng. & Systems 2023-07-11 Hongyi Wang , Lanfen Lin , Hongjie Hu , Qingqing Chen , Yinhao Li , Yutaro Iwamoto , Xian-Hua Han , Yen-Wei Chen , Ruofeng Tong
‹ Prev 1 4 5 6 7 8 10 Next ›