Fetching the paper…
Reading the bibliography…
We study the multi-channel sparse blind deconvolution (MCS-BD) problem, whose task is to simultaneously recover a kernel $\mathbf a$ and multiple sparse inputs $\{\mathbf x_i\}_{i=1}^p$ from their circulant convolution $\mathbf y_i = \mathbf a \circledast \mathbf x_i $ ($i=1,\cdots,p$).
On convergence rates of subgradient optimization methods
Jean-Louis Goffin · 1977
Earlier work this paper cites.
The null space problem i. complexity
Thomas F Coleman and Alex Pothen · 1986
Earlier work this paper cites.
Robust estimation of a location parameter
Peter J Huber · 1992
Earlier work this paper cites.
Weak sharp minima in mathematical programming
James V Burke and Michael C Ferris · 1993
Earlier work this paper cites.
Subspace methods for the blind identification of multichannel fir filters
Eric Moulines, Pierre Duhamel, J-F Cardoso, and Sylvie Mayrargue · 1995
Earlier work this paper cites.
Sparse approximate solutions to linear systems
Balas Kausik Natarajan · 1995
Earlier work this paper cites.
A least-squares approach to blind channel identification
Guanghan Xu, Hui Liu, Lang Tong, and Thomas Kailath · 1995
Earlier work this paper cites.
Multichannel blind deconvolution and equalization using the natural gradient
Shun-ichi Amari, Scott C Douglas, Andrzej Cichocki, and Howard H Yang · 1997
Earlier work this paper cites.
Fir perfect signal reconstruction from multiple convolutions: minimum deconvolver orders
Gopal Harikumar and Yoram Bresler · 1998
Earlier work this paper cites.
Multichannel blind deconvolution of seismic signals
Kjetil F Kaaresen and Tofinn Taxt · 1998
Earlier work this paper cites.
Subgradient methods
Stephen Boyd, Lin Xiao, and Almir Mutapcic · 2003
Earlier work this paper cites.
Modeling regional and psychophysiologic interactions in fmri: the importance of hemodynamic deconvolution
Darren R Gitelman, William D Penny, John Ashburner, and Karl J Friston · 2003
Earlier work this paper cites.
Imaging intracellular fluorescent proteins at nanometer resolution
Eric Betzig, George H Patterson, Rachid Sougrat, O Wolf Lindwasser, Scott Olenych, Juan S Bonifacino, Michael W Davidson, Jennifer Lippincott-Schwartz, and Harald F Hess · 2006
Earlier work this paper cites.
Toeplitz and circulant matrices: A review
Robert M Gray et al · 2006
Earlier work this paper cites.
Ultra-high resolution imaging by fluorescence photoactivation localization microscopy
Samuel T Hess, Thanu PK Girirajan, and Michael D Mason · 2006
Earlier work this paper cites.
Sub-diffraction-limit imaging by stochastic optical reconstruction microscopy (storm)
Michael J Rust, Mark Bates, and Xiaowei Zhuang · 2006
Earlier work this paper cites.
Deconvolution methods for 3-d fluorescence microscopy images
Pinaki Sarder and Arye Nehorai · 2006
Earlier work this paper cites.
Cvx: Matlab software for disciplined convex programming, 2008
Michael Grant, Stephen Boyd, and Yinyu Ye · 2008
Earlier work this paper cites.
Blind channel identification for speech dereverberation using l1-norm sparse learning
Yuanqing Lin, Jingdong Chen, Youngmoo Kim, and Daniel D Lee · 2008
Earlier work this paper cites.
Optimization algorithms on matrix manifolds
P-A Absil, Robert Mahony, and Rodolphe Sepulchre · 2009
Earlier work this paper cites.
A blind sparse deconvolution method for neural spike identification
Chaitanya Ekanadham, Daniel Tranchina, and Eero P Simoncelli · 2011
Earlier work this paper cites.
Daostorm: an algorithm for high-density super-resolution microscopy
Seamus J Holden, Stephan Uphoff, and Achillefs N Kapanidis · 2011
Earlier work this paper cites.
Understanding blind deconvolution algorithms
Anat Levin, Yair Weiss, Fredo Durand, and William T Freeman · 2011
Earlier work this paper cites.
Decoupling: from dependence to independence
Victor De la Pena and Evarist Giné · 2012
Earlier work this paper cites.
Robust multichannel blind deconvolution via fast alternating minimization
Filip Sroubek and Peyman Milanfar · 2012
Earlier work this paper cites.
Faster storm using compressed sensing
Lei Zhu, Wei Zhang, Daniel Elnatan, and Bo Huang · 2012
Earlier work this paper cites.
Fast convolutional sparse coding
Hilton Bristow, Anders Eriksson, and Simon Lucey · 2013
Earlier work this paper cites.
Matrix analysis
Rajendra Bhatia · 2013
Earlier work this paper cites.
A Mathematical Introduction to Compressive Sensing
Simon Foucart and Holger Rauhut · 2013
Earlier work this paper cites.
A blind deconvolution approach to recover effective connectivity brain networks from resting state fmri data
Guo-Rong Wu, Wei Liao, Sebastiano Stramaglia, Ju-Rong Ding, Huafu Chen, and Daniele Marinazzo · 2013
Cited alongside, same era.
Multi-image blind deblurring using a coupled adaptive sparse prior
Haichao Zhang, David Wipf, and Yanning Zhang · 2013
Cited alongside, same era.
Blind deconvolution using convex programming
Ali Ahmed, Benjamin Recht, and Justin Romberg · 2014
Cited alongside, same era.
Suprema of chaos processes and the restricted isometry property
Felix Krahmer, Shahar Mendelson, and Holger Rauhut · 2014
Cited alongside, same era.
Finding a sparse vector in a subspace: Linear sparsity using alternating directions
Qing Qu, Ju Sun, and John Wright · 2014
Cited alongside, same era.
Fluorophore localization algorithms for super-resolution microscopy
Multichannel myopic deconvolution in underwater acoustic channels via low-rank recovery
Ning Tian, Sung-Hoon Byun, Karim Sabra, and Justin Romberg · 2017
Later among the works it cites.
On the global geometry of sphere-constrained sparse blind deconvolution
Yuqian Zhang, Yenson Lau, Han-Wen Kuo, Sky Cheung, Abhay Pasupathy, and John Wright · 2017
Later among the works it cites.
Leveraging diversity and sparsity in blind deconvolution
Ali Ahmed and Laurent Demanet · 2018
Later among the works it cites.
Subgradient descent learns orthogonal dictionaries
Yu Bai, Qijia Jiang, and Ju Sun · 2018
Later among the works it cites.
Harnessing structures in big data via guaranteed low-rank matrix estimation: Recent theory and fast algorithms via convex and nonconvex optimization
Yudong Chen and Yuejie Chi · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Alex Small and Shane Stahlheber · 2014
Cited alongside, same era.
Upper and lower bounds for stochastic processes: modern methods and classical problems
Michel Talagrand · 2014
Cited alongside, same era.
Phase retrieval via wirtinger flow: Theory and algorithms
Emmanuel J. Candès, Xiaodong Li, and Mahdi Soltanolkotabi · 2015
Cited alongside, same era.
Tail bounds via generic chaining
Sjoerd Dirksen et al · 2015
Cited alongside, same era.
Self-calibration and biconvex compressive sensing
Shuyang Ling and Thomas Strohmer · 2015
Cited alongside, same era.
A fast algorithm for sparse multichannel blind deconvolution
Kenji Nose-Filho, André K Takahata, Renato Lopes, and João MT Romano · 2015
Cited alongside, same era.
Image reconstruction from phased-array data based on multichannel blind deconvolution
Huajun She, Rong-Rong Chen, Dong Liang, Yuchou Chang, and Leslie Ying · 2015
Cited alongside, same era.
Yuejie Chi, Yue M Lu, and Yuxin Chen · 2018
Later among the works it cites.
Subgradient methods for sharp weakly convex functions
Damek Davis, Dmitriy Drusvyatskiy, Kellie J MacPhee, and Courtney Paquette · 2018
Later among the works it cites.
Efficient dictionary learning with gradient descent
Dar Gilboa, Sam Buchanan, and John Wright · 2018
Later among the works it cites.
Convolutional dictionary learning: A comparative review and new algorithms
Cristina Garcia-Cardona and Brendt Wohlberg · 2018
Later among the works it cites.
Global geometry of multichannel sparse blind deconvolution on the sphere
Yanjun Li and Yoram Bresler · 2018
Later among the works it cites.
Bilinear inverse problems with sparsity: optimal identifiability conditions and efficient recovery
Yanjun Li · 2018
Later among the works it cites.
Spectral methods for passive imaging: Nonasymptotic performance and robustness
Kiryung Lee, Felix Krahmer, and Justin Romberg · 2018
Later among the works it cites.
Blind gain and phase calibration via sparse spectral methods
Yanjun Li, Kiryung Lee, and Yoram Bresler · 2018
Later among the works it cites.
Rapid, robust, and reliable blind deconvolution via nonconvex optimization
Xiaodong Li, Shuyang Ling, Thomas Strohmer, and Ke Wei · 2018
Later among the works it cites.
An overview of robust subspace recovery
Gilad Lerman and Tyler Maunu · 2018
Later among the works it cites.
Self-calibration and bilinear inverse problems via linear least squares
Shuyang Ling and Thomas Strohmer · 2018
Later among the works it cites.
Fast and guaranteed blind multichannel deconvolution under a bilinear system model
Kiryung Lee, Ning Tian, and Justin Romberg · 2018
Later among the works it cites.
Nonconvex robust low-rank matrix recovery
Xiao Li, Zhihui Zhu, Anthony Man-Cho So, and Rene Vidal · 2018
Later among the works it cites.
Structured local minima in sparse blind deconvolution
Yuqian Zhang, Han-wen Kuo, and John Wright · 2018
Later among the works it cites.
Dual principal component pursuit: Improved analysis and efficient algorithms
Zhihui Zhu, Yifan Wang, Daniel Robinson, Daniel Naiman, Rene Vidal, and Manolis Tsakiris · 2018
Later among the works it cites.
Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
Vasileios Charisopoulos, Yudong Chen, Damek Davis, Mateo Díaz, Lijun Ding, and Dmitriy Drusvyatskiy · 2019
Closest in time.
Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
Yuxin Chen, Yuejie Chi, Jianqing Fan, and Cong Ma · 2019
Closest in time.
Noisy dual principal component pursuit
Tianyu Ding, Zhihui Zhu, Tianjiao Ding, Yunchen Yang, Daniel Robinson, Manolis Tsakiris, and Rene Vidal · 2019
Closest in time.
Geometry and symmetry in short-and-sparse deconvolution
Han-Wen Kuo, Yenson Lau, Yuqian Zhang, and John Wright · 2019
Closest in time.
Short-and-sparse deconvolution – a geometric approach
Yenson Lau, Qing Qu, Han-Wen Kuo, Pengcheng Zhou, Yuqian Zhang, and John Wright · 2019
Closest in time.
Incremental methods for weakly convex optimization
Xiao Li, Zhihui Zhu, Anthony Man-Cho So, and Jason D Lee · 2019
Closest in time.
Manifold gradient descent solves multi-channel sparse blind deconvolution provably and efficiently, 2019
Laixi Shi and Yuejie Chi · 2019
Closest in time.
Complete dictionary learning via
Yuexiang Zhai, Zitong Yang, Zhenyu Liao, John Wright, and Yi Ma · 2019
Closest in time.
Finding the sparsest vectors in a subspace: Theory, algorithms, and applications, 2020
Qing Qu, Zhihui Zhu, Xiao Li, Manolis C. Tsakiris, John Wright, and René Vidal · 2020
Closest in time.