Anders C. Hansen

ORCID: 0000-0003-2700-9446
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Sparse and Compressive Sensing Techniques
  • Image and Signal Denoising Methods
  • Medical Imaging Techniques and Applications
  • Mathematical Analysis and Transform Methods
  • Advanced MRI Techniques and Applications
  • Photoacoustic and Ultrasonic Imaging
  • Matrix Theory and Algorithms
  • Blind Source Separation Techniques
  • Machine Learning and Algorithms
  • Adversarial Robustness in Machine Learning
  • Model Reduction and Neural Networks
  • Markov Chains and Monte Carlo Methods
  • Numerical Methods and Algorithms
  • Advanced Optimization Algorithms Research
  • Electrical and Bioimpedance Tomography
  • Quantum Mechanics and Non-Hermitian Physics
  • Spectral Theory in Mathematical Physics
  • Stochastic processes and financial applications
  • Microwave Imaging and Scattering Analysis
  • Random lasers and scattering media
  • Anomaly Detection Techniques and Applications
  • Seismic Imaging and Inversion Techniques
  • Digital Image Processing Techniques
  • Mathematical functions and polynomials
  • Algebraic and Geometric Analysis

University of Cambridge
2015-2025

Sandia National Laboratories
2022

University of Oslo
2014-2022

University of Vienna
2012-2013

California Institute of Technology
2010

Deep learning, due to its unprecedented success in tasks such as image classification, has emerged a new tool reconstruction with potential change the field. In this paper, we demonstrate crucial phenomenon: learning typically yields unstable methods for reconstruction. The instabilities usually occur several forms: 1) Certain tiny, almost undetectable perturbations, both and sampling domain, may result severe artefacts reconstruction; 2) small structural change, example, tumor, not be...

10.1073/pnas.1907377117 article EN Proceedings of the National Academy of Sciences 2020-05-11

This paper presents a framework for compressed sensing that bridges gap between existing theory and the current use of in many real-world applications. In doing so, it also introduces new sampling method yields substantially improved recovery over techniques. applications sensing, including medical imaging, standard principles incoherence sparsity are lacking. Whilst is often used successfully such applications, done largely without mathematical explanation. The introduced this provides...

10.1017/fms.2016.32 article EN cc-by-nc-nd Forum of Mathematics Sigma 2017-01-01

10.1007/s10208-015-9276-6 article EN Foundations of Computational Mathematics 2015-08-19

Significance Instability is the Achilles’ heel of modern artificial intelligence (AI) and a paradox, with training algorithms finding unstable neural networks (NNs) despite existence stable ones. This foundational issue relates to Smale’s 18th mathematical problem for 21st century on limits AI. By expanding methodologies initiated by Gödel Turing, we demonstrate limitations (even randomized) computing NNs. Despite numerous results NNs great approximation properties, only in specific cases do...

10.1073/pnas.2107151119 article EN cc-by-nc-nd Proceedings of the National Academy of Sciences 2022-03-16

We show that it is possible to compute spectra and pseudospectra of linear operators on separable Hilbert spaces given their matrix elements. The core in the theory pseudospectral analysis particular the<inline-formula content-type="math/mathml"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="n"><mml:semantics><mml:mi>n</mml:mi><mml:annotation encoding="application/x-tex">n</mml:annotation></mml:semantics></mml:math></inline-formula>-pseudospectrum residual pseudospectrum....

10.1090/s0894-0347-2010-00676-5 article EN publisher-specific-oa Journal of the American Mathematical Society 2010-07-12

10.1007/s00041-012-9221-x article EN Journal of Fourier Analysis and Applications 2012-02-17

Generalized sampling is a recently developed linear framework for and reconstruction in separable Hilbert spaces. It allows one to recover any element finite-dimensional subspace given finitely many of its samples with respect an arbitrary basis or frame. Unlike more common approaches this problem, such as the consistent technique Eldar others, it leads numerical methods possessing both guaranteed stability accuracy. The purpose paper twofold. First, we give complete formal analysis...

10.1137/120895846 article EN SIAM Journal on Mathematical Analysis 2013-01-01

10.1016/j.jfa.2008.01.006 article EN publisher-specific-oa Journal of Functional Analysis 2008-02-22

10.1016/j.acha.2011.07.004 article EN Applied and Computational Harmonic Analysis 2011-07-25

This paper demonstrates how new principles of compressed sensing, namely asymptotic incoherence, sparsity and multilevel sampling, can be utilised to better understand underlying phenomena in practical sensing improve results real-world applications. The contribution the is fourfold: First, it explains sampling strategy depends not only on signal but also its structure, shows design effective strategies utilising this. Second, that optimal efficiency resolution problem, this phenomenon...

10.48550/arxiv.1406.4178 preprint EN cc-by-nc-sa arXiv (Cornell University) 2014-01-01

10.1016/j.acha.2013.07.001 article EN publisher-specific-oa Applied and Computational Harmonic Analysis 2013-08-02

We prove that any stable method for resolving the Gibbs phenomenon---that is, recovering high-order accuracy from first $m$ Fourier coefficients of an analytic and nonperiodic function---can converge at best root-exponentially fast in $m$. Any with faster convergence must also be unstable, particular, exponential implies ill-conditioning. This result is analogous to a recent theorem Platte, Trefethen, Kuijlaars concerning recovery pointwise function values on equispaced $m$-grid. The main...

10.1137/130908221 article EN SIAM Journal on Numerical Analysis 2014-01-01

We consider the problem of recovering a compactly supported function from finite collection pointwise samples its Fourier transform taken nonuniformly. First, we show that under suitable conditions on sampling frequencies---specifically, their density and bandwidth---it is possible to recover any such $f$ in stable accurate manner given finite-dimensional subspace, particular, one which well suited for approximating $f$. In practice, this carried out using so-called nonuniform generalized...

10.1137/130943431 article EN SIAM Journal on Imaging Sciences 2014-01-01

Abstract Compressed Sensing (CS) techniques are used to measure and reconstruct surface dynamical processes with a helium spin-echo spectrometer for the first time. Helium atom scattering is well established method examining structure dynamics of materials at atomic sized resolution technique opens up possibility compressing data acquisition process. CS methods demonstrating compressibility spectra presented several measurements. Recent developments on structured multilevel sampling that...

10.1038/srep27776 article EN cc-by Scientific Reports 2016-06-15

We consider signal recovery from Fourier measurements using compressed sensing (CS) with wavelets. For discrete signals structured sparse Haar wavelet coefficients, we give the first proof of near-optimal samples taken according to an appropriate variable density sampling scheme. Crucially, in taking into account such sparsity-known as sparsity levels-as opposed just sparsity, this result yields guarantees that agree empirically observed properties CS setting. This complements a recent...

10.1109/lsp.2016.2550101 article EN IEEE Signal Processing Letters 2016-04-04

The purpose of this paper is twofold. first to point out that the property uniform recovery, meaning all sparse vectors are recovered, does not hold in many applications where compressed sensing successfully used. This includes fields like magnetic resonance imaging (MRI), nuclear computerized tomography, electron radio interferometry, helium atom scattering, and fluorescence microscopy. We demonstrate for natural matrices involving a level based reconstruction basis (e.g., wavelets), number...

10.1137/15m1043972 article EN SIAM Journal on Imaging Sciences 2017-01-01

Computing the spectra of operators is a fundamental problem in sciences, with wide-ranging applications condensed-matter physics, quantum mechanics and chemistry, statistical mechanics, etc. While there are algorithms that certain cases converge to spectrum, no general procedure known (a) always converges, (b) provides bounds on errors approximation, (c) approximate eigenvectors. This may lead incorrect simulations. It has been an open since 1950s decide whether such reliable methods exist...

10.1103/physrevlett.122.250201 article EN Physical Review Letters 2019-06-28

This paper provides an extension of compressed sensing which bridges a substantial gap between existing theory and its current use in real-world applications. It introduces mathematical framework that generalizes the three standard pillars - namely, sparsity, incoherence uniform random subsampling to new concepts: asymptotic multilevel sampling. The theorems show is also possible, reveals several advantages, under these substantially relaxed conditions. importance this threefold. First,...

10.48550/arxiv.1302.0561 preprint EN cc-by-nc-sa arXiv (Cornell University) 2013-01-01

10.1016/j.acha.2018.08.004 article EN publisher-specific-oa Applied and Computational Harmonic Analysis 2018-08-23
Coming Soon ...