Sebastian Semper1 and Florian Roemer1,2

Slides:



Advertisements
Similar presentations
Bayesian Belief Propagation
Advertisements

Capacity of MIMO Channels: Asymptotic Evaluation Under Correlated Fading Presented by: Zhou Yuan University of Houston 10/22/2009.
Active Shape Models Suppose we have a statistical shape model –Trained from sets of examples How do we use it to interpret new images? Use an “Active Shape.
Component Analysis (Review)
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Beamforming Issues in Modern MIMO Radars with Doppler
Structured Sparse Principal Component Analysis Reading Group Presenter: Peng Zhang Cognitive Radio Institute Friday, October 01, 2010 Authors: Rodolphe.
Exploiting Sparse Markov and Covariance Structure in Multiresolution Models Presenter: Zhe Chen ECE / CMR Tennessee Technological University October 22,
Manifold Sparse Beamforming
Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.
Shape From Light Field meets Robust PCA
1 Easy Does It: User Parameter Free Dense and Sparse Methods for Spectral Estimation Jian Li Department of Electrical and Computer Engineering University.
EE 290A: Generalized Principal Component Analysis Lecture 6: Iterative Methods for Mixture-Model Segmentation Sastry & Yang © Spring, 2011EE 290A, University.
Volkan Cevher, Marco F. Duarte, and Richard G. Baraniuk European Signal Processing Conference 2008.
Compressed Sensing for Networked Information Processing Reza Malek-Madani, 311/ Computational Analysis Don Wagner, 311/ Resource Optimization Tristan Nguyen,
An Introduction to Kernel-Based Learning Algorithms K.-R. Muller, S. Mika, G. Ratsch, K. Tsuda and B. Scholkopf Presented by: Joanna Giforos CS8980: Topics.
L15:Microarray analysis (Classification). The Biological Problem Two conditions that need to be differentiated, (Have different treatments). EX: ALL (Acute.
Classification Problem 2-Category Linearly Separable Case A- A+ Malignant Benign.
Clustering with Bregman Divergences Arindam Banerjee, Srujana Merugu, Inderjit S. Dhillon, Joydeep Ghosh Presented by Rohit Gupta CSci 8980: Machine Learning.
Compressed Sensing Compressive Sampling
Summarized by Soo-Jin Kim
1 Patch Complexity, Finite Pixel Correlations and Optimal Denoising Anat Levin, Boaz Nadler, Fredo Durand and Bill Freeman Weizmann Institute, MIT CSAIL.
Ilmenau University of Technology Communications Research Laboratory 1  A new multi-dimensional model order selection technique called closed- form PARAFAC.
Algorithms for a large sparse nonlinear eigenvalue problem Yusaku Yamamoto Dept. of Computational Science & Engineering Nagoya University.
Eigenstructure Methods for Noise Covariance Estimation Olawoye Oyeyele AICIP Group Presentation April 29th, 2003.
Cs: compressed sensing
EE369C Final Project: Accelerated Flip Angle Sequences Jan 9, 2012 Jason Su.
Scientific Writing Abstract Writing. Why ? Most important part of the paper Number of Readers ! Make people read your work. Sell your work. Make your.
In-Won Lee, Professor, PE In-Won Lee, Professor, PE Structural Dynamics & Vibration Control Lab. Structural Dynamics & Vibration Control Lab. Korea Advanced.
Learning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization Julio Martin Duarte-Carvajalino, and Guillermo Sapiro.
A note about gradient descent: Consider the function f(x)=(x-x 0 ) 2 Its derivative is: By gradient descent (If f(x) is more complex we usually cannot.
Efficient computation of Robust Low-Rank Matrix Approximations in the Presence of Missing Data using the L 1 Norm Anders Eriksson and Anton van den Hengel.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: ML and Simple Regression Bias of the ML Estimate Variance of the ML Estimate.
* 김 만철, 정 형조, 박 선규, 이 인원 * 김 만철, 정 형조, 박 선규, 이 인원 구조동역학 및 진동제어 연구실 구조동역학 및 진동제어 연구실 한국과학기술원 토목공학과 중복 또는 근접 고유치를 갖는 비비례 감쇠 구조물의 자유진동 해석 1998 한국전산구조공학회 가을.
Sparse Signals Reconstruction Via Adaptive Iterative Greedy Algorithm Ahmed Aziz, Ahmed Salim, Walid Osamy Presenter : 張庭豪 International Journal of Computer.
*Man-Cheol Kim, Hyung-Jo Jung and In-Won Lee *Man-Cheol Kim, Hyung-Jo Jung and In-Won Lee Structural Dynamics & Vibration Control Lab. Structural Dynamics.
Prototype Classification Methods Fu Chang Institute of Information Science Academia Sinica ext. 1819
Z bigniew Leonowicz, Wroclaw University of Technology Z bigniew Leonowicz, Wroclaw University of Technology, Poland XXIX  IC-SPETO.
ECE 8443 – Pattern Recognition Objectives: Jensen’s Inequality (Special Case) EM Theorem Proof EM Example – Missing Data Intro to Hidden Markov Models.
Rank Minimization for Subspace Tracking from Incomplete Data
Large-Scale Matrix Factorization with Missing Data under Additional Constraints Kaushik Mitra University of Maryland, College Park, MD Sameer Sheoreyy.
Feature Extraction 主講人:虞台文. Content Principal Component Analysis (PCA) PCA Calculation — for Fewer-Sample Case Factor Analysis Fisher’s Linear Discriminant.
Regularization of energy-based representations Minimize total energy E p (u) + (1- )E d (u,d) E p (u) : Stabilizing function - a smoothness constraint.
Massive Support Vector Regression (via Row and Column Chunking) David R. Musicant and O.L. Mangasarian NIPS 99 Workshop on Learning With Support Vectors.
High Dimensional Probabilistic Modelling through Manifolds
Spectral Methods for Dimensionality
Biointelligence Laboratory, Seoul National University
Geometric Camera Calibration
Sparsity Based Poisson Denoising and Inpainting
Compressive Coded Aperture Video Reconstruction
Estimation Techniques for High Resolution and Multi-Dimensional Array Signal Processing EMS Group – Fh IIS and TU IL Electronic Measurements and Signal.
Estimation Techniques for High Resolution and Multi-Dimensional Array Signal Processing EMS Group – Fh IIS and TU IL Electronic Measurements and Signal.
Ch 12. Continuous Latent Variables ~ 12
Müjdat Çetin Stochastic Systems Group, M.I.T.
R. Freund, H. Men, C. Nguyen, P. Parrilo and J. Peraire
LECTURE 10: DISCRIMINANT ANALYSIS
Optimum Passive Beamforming in Relation to Active-Passive Data Fusion
Outlier Processing via L1-Principal Subspaces
T. Chernyakova, A. Aberdam, E. Bar-Ilan, Y. C. Eldar
Unrolling: A principled method to develop deep neural networks
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
Clustering (3) Center-based algorithms Fuzzy k-means
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization Presenter: Xia Li.
Optimal sparse representations in general overcomplete bases
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John.
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 – 14, Tuesday 8th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR)
LECTURE 09: DISCRIMINANT ANALYSIS
Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks
Outline Sparse Reconstruction RIP Condition
Presentation transcript:

Sebastian Semper1 and Florian Roemer1,2 ADMM for ND Line Spectral Estimation using Grid-Free Compressive Sensing from Multiple Measurements with Applications to DOA Estimation Sebastian Semper1 and Florian Roemer1,2 1Ilmenau University of Technology, Germany 2Fraunhofer Institute for Nondestructive Testing IZFP

Overview: Line Spectral Estimation Given a (noisy) superposition of sampled harmonics, estimate their frequencies Application: Harmonic retrieval, e.g., for Radar, Image Processing, Signal Reconstruction, Localization, Channel Sounding, DOA estimation Extensions to the classical LSE problem considered in this work Multidimensional harmonics Needed for, e.g., 2-D DOA estimation, bistatic MIMO-Radar Many methods do not generalize easily (e.g., Root-MUSIC/Prony) Generalized line spectral estimation (observe linear mixtures) Facilitates use of realistic antenna arrays (EADF) and Compressed Sensing Most simple methods fail (e.g., ESPRIT, Root-MUSIC)

Line Spectral Estimation Given a (noisy) superposition of sampled harmonics, estimate their frequencies Example DOA: 1-D uniform linear array with isotropic antenna elements where is a Vandermonde matrix

R-D Line Spectral Estimation Given a (noisy) superposition of sampled harmonics, estimate their frequencies Example DOA: 2-D uniform rectangular array with isotropic antenna elements where is a Vandermonde matrix

Generalized Line Spectral Estimation Given a (noisy) superposition of sampled harmonics, estimate their frequencies Example DOA: 1-D arbitrary array with arbitrary antenna patterns (EADF) Effective Aperture Distribution Function (EADF) Let be the array response. Naturally, is 2π-periodic. Also is smooth. Therefore

Generalized R-D Line Spectral Estimation Given a (noisy) superposition of sampled harmonics, estimate their frequencies Example DOA: 2-D arbitrary array with arbitrary antenna patterns (2-D EADF) 2-D Effective Aperture Distribution Function (EADF)

State of the art (excerpt) LSE model only Allows generalized LSE Root-MUSIC / Prony [HS17] Subspace-based Grid-based l1 Bound to 1-D [BTR13] Atomic Norm based grid-free MUSIC [MCW05] ESPRIT, RARE [CC15] (2-D) This paper: Efficient R-D generalized LSE via ADMM Allows R-D [MCW05] Malioutov, Cetin, and Willsky, “A sparse signal reconstruction perspective for source localization with sensor arrays”, 2005. [BTR13] Bhaskar, Tang, and Recht, “Atomic Norm Denoising With Applications to Line Spectral Estimation”, 2013. [CC15] Chi, Chen, “Compressive Two-Dimensional Harmonic Retrieval via Atomic Norm Minimization“, 2015 [HS17] Heckel and Soltanolkotabi, “Generalized Line Spectral Estimation via Convex Optimization”, 2017. [MCW05] Malioutov, Cetin, and Willsky, “A sparse signal reconstruction perspective for source localization with sensor arrays”, 2005.

Step 1: Atomic Norm Minimization Approach Let the atomic set be defined as Define the atomic norm of a given Then the R-D generalized LSE problem can be formulated as Convex but infinite-dimensional problem  cannot be solved directly.

Step 2: Convex reformulation Based on [Tang et. al. 2013, Candés et. al. 2013], it can be shown that … which is an SDP. However, it is huge! For R-D, computations are prohibitive. ADMM to the rescue! where is a Hermitian multi-level Toeplitz matrix e.g., two-level:

Step 3: ADMM formulation The SDP can be formulated via the augmented Lagrangian and then solved iteratively via ADMM ADMM Main difficulty: finding derivatives, especially with respect to u in light of the multi-level Toeplitz structure.

Resulting algorithm: ADMM for R-D Generalized LSE Repeat until convergence: where sums elements along positions in A corresponding to elements in u („diagonals“) projects onto the set of positive semi-definite matrices (truncate negative eigenvalues)

Numerical results: 3-D Line Spectral Estimation N = 3 x 3 x 3 = 27 (no compression) K = 100 snapshots S = 3 sources

Numerical results: 3-D Generalized Line Spectral Estimation N = 3 x 3 x 3 = 27 M = 20 (25% compression with a random Gaussian kernel) K = 100 snapshots S = 3 sources

Numerical results Example 3: 2-D DOA estimation with a stacked uniform circular array (3 stacks with 12 elements each) K = 100 snapshots, noise variance = 10-3.

Conclusions Line Spectral Estimation problem, incorporating: R-D case: Multilevel Toeplitz formulation Generalized LSE: observe linear projections Allows DOA estimation with arbitrary antenna arrays Allows to incorporate Compressed Sensing Continuous, grid-free formulation Solutions Atomic Norm Minimization  SDP reformulation ADMM as a low-complexity solution

BACKUP

Computational complexity? (N1 x 2N2 x … x 2NR) (N x N) (N x N) (N x T) (N x N) (N+T x N+T) where sums elements along positions in A corresponding to elements in u („diagonals“) projects onto the set of positive semi-definite matrices (truncate negative eigenvalues)

1-D DOA Estimation: Stacked UCA N = 24 (2x12) M = 12 S = 2 sources

Reconstruction guarantee (1-D)