default search action
Kiryung Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]Seonho Kim
, Kiryung Lee:
Max-Affine Regression via First-Order Methods. SIAM J. Math. Data Sci. 6(2): 534-552 (2024) - [j25]Seonho Kim
Max-Linear Regression by Convex Programming. IEEE Trans. Inf. Theory 70(3): 1897-1912 (2024) - [j24]Meghna Kalra
Stable Estimation of Pulses of Unknown Shape From Multiple Snapshots via ESPRIT. IEEE Trans. Signal Process. 72: 2637-2648 (2024) - [c24]Seonho Kim, Kiryung Lee:
Sequence of Linear Program for Robust Phase Retrieval. ICASSP 2024: 9791-9795 - [c23]Meghna Kalra, Kiryung Lee, Maxime Ferreira Da Costa:
Small-Noise Sensitivity Analysis of Locating Pulses in the Presence of Adversarial Perturbation. SAM 2024: 1-5 - [c22]Haitham Kanj, Seonho Kim, Kiryung Lee:
Variable Selection for Max-Affine Regression via Sparse Gradient Descent. SAM 2024: 1-5 - 2023
- [j23]Rakshith Sharma Srinivasa
Sketching Low-Rank Matrices With a Shared Column Space by Convex Programming. IEEE J. Sel. Areas Inf. Theory 4: 54-60 (2023) - [j22]Kiryung Lee, Dominik Stöger
Randomly Initialized Alternating Least Squares: Fast Convergence for Matrix Sensing. SIAM J. Math. Data Sci. 5(3): 774-799 (2023) - [c21]Seonho Kim, Kiryung Lee:
Fast max-affine regression via stochastic gradient descent. Allerton 2023: 1-5 - [i23]Seonho Kim, Kiryung Lee:
Max-affine regression via first-order methods. CoRR abs/2308.08070 (2023) - 2022
- [c20]Meghna Kalra, Yoram Bresler
Identification of Pulse Streams Of Unknown Shape From Time Encoding Machine Samples. ICASSP 2022: 5148-5152 - [i22]Kiryung Lee, Dominik Stöger:
Randomly Initialized Alternating Least Squares: Fast Convergence for Matrix Sensing. CoRR abs/2204.11516 (2022) - 2021
- [j21]Sohail Bahmani
Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization. SIAM J. Matrix Anal. Appl. 42(3): 1119-1147 (2021) - [c19]Satish Mulleti, Kiryung Lee, Yonina C. Eldar:
Sub-NYQUIST Multichannel Blind Deconvolution. ICASSP 2021: 5454-5458 - [i21]Seonho Kim, Sohail Bahmani, Kiryung Lee:
Max-Linear Regression by Scalable and Guaranteed Convex Programming. CoRR abs/2103.07020 (2021) - 2020
- [j20]Satish Mulleti
Identifiability Conditions for Compressive Multichannel Blind Deconvolution. IEEE Trans. Signal Process. 68: 4627-4642 (2020) - [c18]Shen Zhao
Convolutional Framework for Accelerated Magnetic Resonance Imaging. ISBI 2020: 1-4 - [i20]Satish Mulleti, Kiryung Lee, Yonina C. Eldar:
Identifiability Conditions for Compressive Multichannel Blind Deconvolution. CoRR abs/2001.00613 (2020) - [i19]Sohail Bahmani, Kiryung Lee:
Low-Rank Matrix Estimation From Rank-One Projections by Unlifted Convex Optimization. CoRR abs/2004.02718 (2020)
2010 – 2019
- 2019
- [j19]Yanjun Li
Blind Gain and Phase Calibration via Sparse Spectral Methods. IEEE Trans. Inf. Theory 65(5): 3097-3123 (2019) - [c17]Rakshith Sharma Srinivasa, Kiryung Lee, Marius Junge, Justin Romberg:
Decentralized sketching of low rank matrices. NeurIPS 2019: 10101-10110 - [i18]Kiryung Lee, Sohail Bahmani, Yonina C. Eldar, Justin Romberg:
Phase Retrieval of Low-Rank Matrices by Anchored Regression. CoRR abs/1910.11477 (2019) - 2018
- [j18]Kiryung Lee
Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness. SIAM J. Imaging Sci. 11(3): 2110-2164 (2018) - [j17]Kiryung Lee
Near-Optimal Compressed Sensing of a Class of Sparse Low-Rank Matrices Via Sparse Power Factorization. IEEE Trans. Inf. Theory 64(3): 1666-1698 (2018) - [j16]Kiryung Lee
Fast and Guaranteed Blind Multichannel Deconvolution Under a Bilinear System Model. IEEE Trans. Inf. Theory 64(7): 4792-4818 (2018) - [j15]Kiryung Lee
Unified Theory for Recovery of Sparse Signals in a General Transform Domain. IEEE Trans. Inf. Theory 64(8): 5457-5477 (2018) - 2017
- [j14]Jong Chul Ye
Compressive Sampling Using Annihilating Filter-Based Low-Rank Interpolation. IEEE Trans. Inf. Theory 63(2): 777-801 (2017) - [j13]Kiryung Lee
Blind Recovery of Sparse Signals From Subsampled Convolution. IEEE Trans. Inf. Theory 63(2): 802-821 (2017) - [j12]Yanjun Li
Identifiability in Bilinear Inverse Problems With Applications to Subspace or Sparsity-Constrained Blind Gain and Phase Calibration. IEEE Trans. Inf. Theory 63(2): 822-842 (2017) - [j11]Yanjun Li
Identifiability and Stability in Blind Deconvolution Under Minimal Assumptions. IEEE Trans. Inf. Theory 63(7): 4619-4633 (2017) - [c16]Kiryung Lee, Ning Tian, Justin Romberg:
Performance guarantees of spectral methods for passive sensing of multiple channels. DSP 2017: 1-5 - [i17]Kiryung Lee, Felix Krahmer, Justin Romberg:
Spectral Methods for Passive Imaging: Non-asymptotic Performance and Robustness. CoRR abs/1708.04343 (2017) - [i16]Yanjun Li, Kiryung Lee, Yoram Bresler:
Blind Gain and Phase Calibration via Sparse Spectral Methods. CoRR abs/1712.00111 (2017) - 2016
- [j10]Yanjun Li
Identifiability in Blind Deconvolution With Subspace or Sparsity Constraints. IEEE Trans. Inf. Theory 62(7): 4266-4275 (2016) - [j9]Yanjun Li
Optimal Sample Complexity for Blind Gain and Phase Calibration. IEEE Trans. Signal Process. 64(21): 5549-5556 (2016) - [c15]Varun Badrinath Krishna, Kiryung Lee, Gabriel A. Weaver, Ravishankar K. Iyer, William H. Sanders:
F-DETA: A Framework for Detecting Electricity Theft Attacks in Smart Grids. DSN 2016: 407-418 - [c14]Yanjun Li, Kiryung Lee, Yoram Bresler
Optimal sample complexity for stable matrix recovery. ISIT 2016: 81-85 - [i15]Yanjun Li, Kiryung Lee, Yoram Bresler:
Optimal Sample Complexity for Stable Matrix Recovery. CoRR abs/1602.04396 (2016) - [i14]Kiryung Lee, Yanjun Li, Kyong Hwan Jin, Jong Chul Ye:
Unified Theory for Recovery of Sparse Signals in a General Transform Domain. CoRR abs/1612.09565 (2016) - 2015
- [i13]Yanjun Li, Kiryung Lee, Yoram Bresler:
A Unified Framework for Identifiability Analysis in Bilinear Inverse Problems with Applications to Subspace and Sparsity Models. CoRR abs/1501.06120 (2015) - [i12]Yanjun Li, Kiryung Lee, Yoram Bresler:
Identifiability in Blind Deconvolution with Subspace or Sparsity Constraints. CoRR abs/1505.03399 (2015) - [i11]Yanjun Li, Kiryung Lee, Yoram Bresler:
Identifiability in Blind Deconvolution under Minimal Assumptions. CoRR abs/1507.01308 (2015) - [i10]Kiryung Lee, Marius Junge:
RIP-like Properties in Subsampled Blind Deconvolution. CoRR abs/1511.06146 (2015) - [i9]Kiryung Lee, Yanjun Li, Marius Junge, Yoram Bresler:
Blind Recovery of Sparse Signals from Subsampled Convolution. CoRR abs/1511.06149 (2015) - [i8]Jong Chul Ye, Jong Min Kim, Kyong Hwan Jin, Kiryung Lee:
Compressive Sampling using Annihilating Filter-based Low-Rank Interpolation. CoRR abs/1511.08975 (2015) - [i7]Yanjun Li, Kiryung Lee, Yoram Bresler:
Optimal Sample Complexity for Blind Gain and Phase Calibration. CoRR abs/1512.07293 (2015) - 2013
- [j8]Kiryung Lee, Yoram Bresler
Corrections to "ADMiRA: Atomic Decomposition for Minimum Rank Approximation". IEEE Trans. Inf. Theory 59(7): 4730-4732 (2013) - [j7]Kiryung Lee, Yoram Bresler
Oblique Pursuits for Compressed Sensing. IEEE Trans. Inf. Theory 59(9): 6111-6141 (2013) - [c13]Kiryung Lee, Yoram Bresler
Oblique pursuits for compressed sensing with random anisotropic measurements. ISIT 2013: 849-853 - [i6]Kiryung Lee, Yihong Wu, Yoram Bresler:
Near Optimal Compressed Sensing of Sparse Rank-One Matrices via Sparse Power Factorization. CoRR abs/1312.0525 (2013) - 2012
- [b1]Kiryung Lee:
Efficient and guaranteed algorithms for sparse inverse problems. University of Illinois Urbana-Champaign, USA, 2012 - [j6]Kiryung Lee, Yoram Bresler
Subspace Methods for Joint Sparse Recovery. IEEE Trans. Inf. Theory 58(6): 3613-3641 (2012) - [i5]Kiryung Lee, Yoram Bresler, Marius Junge:
Oblique Pursuits for Compressed Sensing. CoRR abs/1207.2681 (2012) - 2010
- [j5]Kiryung Lee, Yoram Bresler
ADMiRA: atomic decomposition for minimum rank approximation. IEEE Trans. Inf. Theory 56(9): 4402-4416 (2010) - [i4]Kiryung Lee, Yoram Bresler:
iMUSIC: Iterative MUSIC Algorithm for Joint Sparse Recovery with Any Rank. CoRR abs/1004.3071 (2010)
2000 – 2009
- 2009
- [c12]Yoram Bresler
Efficient and guaranteed rank minimization by atomic decomposition. ISIT 2009: 314-318 - [i3]Kiryung Lee, Yoram Bresler:
Efficient and Guaranteed Rank Minimization by Atomic Decomposition. CoRR abs/0901.1898 (2009) - [i2]Kiryung Lee, Yoram Bresler:
Guaranteed Minimum Rank Approximation from Linear Observations by Nuclear Norm Minimization with an Ellipsoidal Constraint. CoRR abs/0903.4742 (2009) - [i1]Kiryung Lee, Yoram Bresler:
ADMiRA: Atomic Decomposition for Minimum Rank Approximation. CoRR abs/0905.0044 (2009) - 2008
- [j4]Dong Sik Kim
Block-Coordinate Gauss-Newton Optimization and Constrained Monotone Regression for Image Registration in the Presence of Outlier Objects. IEEE Trans. Image Process. 17(5): 798-810 (2008) - [c11]Kiryung Lee, Yoram Bresler
Computing performance guarantees for compressed sensing. ICASSP 2008: 5129-5132 - 2007
- [c10]Dong Sik Kim, Kiryung Lee:
Block-Coordinate Gauss-Newton/regression Method for Image Registration with Efficient Outlier Detection. ICIP (1) 2007: 517-520 - 2006
- [c9]Dong Sik Kim, Kiryung Lee, Kyung Eun Lee, Sung-Sik Han:
Joint Optimization of Spatial Registration and Histogram Compensation for Microscopic Images. EMBC 2006: 3779-3782 - [c8]Dong Sik Kim, Su Yeon Lee, Kiryung Lee:
Empirical Conditional Mean: Nonparametric Estimator for Comparametric Exposure Compensation. ICASSP (2) 2006: 957-960 - [c7]Dong Sik Kim, Su Yeon Lee, Kiryung Lee:
Joint Optimization of Image Registration and Comparametric Exposure Compensation Based on the Lucas-Kanade Algorithm. ICPR (3) 2006: 905-908 - 2005
- [j3]Kiryung Lee, Dong Sik Kim
Regression-based prediction for blocking artifact reduction in JPEG-compressed images. IEEE Trans. Image Process. 14(1): 36-48 (2005) - 2004
- [j2]Hyuk Choi, Kiryung Lee, Taejeong Kim:
Transformed-key asymmetric watermarking system. IEEE Signal Process. Lett. 11(2): 251-254 (2004) - [j1]Tae-Young Kim, Hyuk Choi, Kiryung Lee, Taejeong Kim:
An asymmetric watermarking system with many embedding watermarks corresponding to one detection watermark. IEEE Signal Process. Lett. 11(3): 375-377 (2004) - 2003
- [c6]Dong Sik Kim, Kiryung Lee:
Training sequence size in clustering algorithms and averaging single-particle images. ICIP (2) 2003: 435-438 - [c5]Kiryung Lee, Dong Sik Kim, Kyung-Ae Moon:
Amplitude-modification resilient watermarking based on A-law companding. ICIP (2) 2003: 459-462 - [c4]Tae-Young Kim, Taejeong Kim, Kiryung Lee:
Generation of embedding watermark signals from reference watermark of the detector. ISCAS (4) 2003: 57-60 - [c3]Kiryung Lee, Dong Sik Kim, Taejeong Kim, Kyung-Ae Moon:
EM Estimation of Scale Factor for Quantization-Based Audio Watermarking. IWDW 2003: 316-327 - 2002
- [c2]Kiryung Lee, Dong Sik Kim, Taejeong Kim:
A new postprocessing algorithm based on regression functions. ICASSP 2002: 3684-3687 - 2001
- [c1]Hyuk Choi, Kiryung Lee, Taejeong Kim:
Transformed-key asymmetric watermarking system. Security and Watermarking of Multimedia Contents 2001: 280-289
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: