paper-with-me

Papers

Robust Time-Frequency Reconstruction by Learning Structured Sparsity

2020-04-30 · Lei Jiang, Haijian Zhang, Lei Yu

Time-frequency distributions (TFDs) play a vital role in providing descriptive analysis of non-stationary signals involved in realistic scenarios. It is well known that low time-frequency (TF) resolution and the emergency of cross-terms (CTs) are two main issues, which make it difficult to analyze and interpret practical signals using TFDs. In order to address these issues, we propose the U-Net aided iterative shrinkage-thresholding algorithm (U-ISTA) for reconstructing a near-ideal TFD by exploiting structured sparsity in signal TF domain. Specifically, the signal ambiguity function is firstly compressed, followed by unfolding the ISTA as a recurrent neural network. To consider continuously distributed characteristics of signals, a structured sparsity constraint is incorporated into the unfolded ISTA by regarding the U-Net as an adaptive threshold block, in which structure-aware thresholds are learned from enormous training data to exploit the underlying dependencies among neighboring TF coefficients. The proposed U-ISTA model is trained by both non-overlapped and overlapped synthetic signals including closely and far located non-stationary components. Experimental results demonstrate that the robust U-ISTA achieves superior performance compared with state-of-the-art algorithms, and gains a high TF resolution with CTs greatly eliminated even in low signal-to-noise ratio (SNR) environments.

📄 PDF Abstract BibTeX arXiv:2004.14820

Code (0)

등록된 구현이 없습니다.

Tasks

Descriptive

Methods 이 논문이 사용한 방법론

ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
Concatenated Skip Connection A Concatenated Skip Connection is a type of skip connection that seeks to reuse features by concatenating them to new layers, allowing more information to be retained from…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
U-Net 설명 없음

Similar Papers 제목 키워드 기반

Clustering Noisy Signals with Structured Sparsity Using Time-Frequency Representation

2015-10-18 · Tom Hope, Avishai Wagner, Or Zuk

We propose a simple and efficient time-series clustering framework particularly suited for low Signal-to-Noise Ratio (SNR), by simultaneous smoothing and dimensionality reduction aimed at preserving clustering informatio…

ClusteringDimensionality ReductionTime SeriesTime Series Analysis+2

Frequency-Based 3D Reconstruction of Transparent and Specular Objects

2014-06-01 · CVPR 2014 6 · Ding Liu, Xida Chen, Yee-Hong Yang

3D reconstruction of transparent and specular objects is a very challenging topic in computer vision. For transparent and specular objects, which have complex interior and exterior structures that can reflect and refract…

3D ReconstructionImage Matting

Hyperspectral Compressive Sensing Using Manifold-Structured Sparsity Prior

2015-12-01 · ICCV 2015 12 · Lei Zhang, Wei Wei, Yanning Zhang, Fei Li 외

To reconstruct hyperspectral image (HSI) accurately from a few noisy compressive measurements, we present a novel manifold-structured sparsity prior based hyperspectral compressive sensing (HCS) method in this study. A m…

Compressive Sensing

Dynamic super-resolution in particle tracking problems

2022-04-08 · Ping Liu, Habib Ammari

Particle tracking in biological imaging is concerned with reconstructing the trajectories, locations, or velocities of the targeting particles. The standard approach of particle tracking consists of two steps: first reco…

Dynamic ReconstructionSuper-Resolution

S$^3$: Structured Sparsity Specification

2026-04-13 · Ayoub Ghriss arxiv

We introduce the Structured Sparsity Specification (S$^3$), an algebraic framework for defining, composing, and implementing structured sparse patterns. S$^3$ specifies sparsity through three components: a View that resh…