Showing 1 - 20 results of 79 for search '"sparsity"', query time: 0.08s Refine Results
  1. 1

    Nonparametric Sparsity and Regularization by Rosasco, Lorenzo Andrea, Villa, Silvia, Mosci, Sofia, Santoro, Matteo, Verri, Alessandro

    Published 2013
    “…Based on this intuition we propose a new notion of nonparametric sparsity and a corresponding least squares regularization scheme. …”
    Get full text
    Get full text
    Article
  2. 2

    Rank-Sparsity Incoherence for Matrix Decomposition by Chandrasekaran, Venkat, Sanghavi, Sujay, Parrilo, Pablo A., Willsky, Alan S.

    Published 2011
    “…We develop a notion of rank-sparsity incoherence, expressed as an uncertainty principle between the sparsity pattern of a matrix and its row and column spaces, and we use it to characterize both fundamental identifiability as well as (deterministic) sufficient conditions for exact recovery. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Necessary and Sufficient Conditions for Sparsity Pattern Recovery by Fletcher, Alyson K., Goyal, Vivek K., Rangan, Sundeep

    Published 2010
    “…he paper considers the problem of detecting the sparsity pattern of a k -sparse vector in BBR n from m random noisy measurements. …”
    Get full text
    Article
  4. 4

    Better approximations for Tree Sparsity in Nearly-Linear Time by Backurs, Arturs, Indyk, Piotr, Schmidt, Ludwig

    Published 2017
    “…The Tree Sparsity problem is defined as follows: given a node-weighted tree of size n and an integer k, output a rooted subtree of size k with maximum weight. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Transform-domain sparsity regularization for inverse problems in geosciences by Jarapour, Behnam, Goyal, Vivek K., McLaughlin, Dennis, Freeman, William T.

    Published 2012
    “…Where we have tested our sparsity regulariza-tion approach, it has performed better than traditional alter-natives.…”
    Get full text
    Get full text
    Article
  6. 6

    Notes on PCA, Regularization, Sparsity and Support Vector Machines by Poggio, Tomaso, Girosi, Federico

    Published 2004
    “…In addition to extending the close relations between regularization, Support Vector Machines and sparsity, our work also illuminates and formalizes the LFA concept of Penev and Atick (1996). …”
    Get full text
  7. 7

    A Sparsity Detection Framework for On–Off Random Access Channels by Fletcher, Alyson K., Rangan, Sundeep, Goyal, Vivek K.

    Published 2010
    “…Using recent sparsity results, we derive upper and lower bounds on the capacities of these channels. …”
    Get full text
    Article
  8. 8

    Sparsity-Promoting Calibration for GRAPPA Accelerated Parallel MRI Reconstruction by Weller, Daniel S., Polimeni, Jonathan R., Grady, Leo, Wald, Lawrence L., Adalsteinsson, Elfar, Goyal, Vivek K.

    Published 2014
    “…To improve the quality of calibration when the number of auto-calibration signal (ACS) lines is restricted, we propose a sparsity-promoting regularized calibration method that finds a GRAPPA kernel consistent with the ACS fit equations that yields jointly sparse reconstructed coil channel images. …”
    Get full text
    Get full text
    Article
  9. 9
  10. 10

    Regularizing GRAPPA using simultaneous sparsity to recover de-noised images by Goyal, Vivek K., Polimeni, Jonathan R., Grady, Leo, Wald, Lawrence L., Adalsteinsson, Elfar, Weller, Daniel Stuart

    Published 2012
    “…This novel combination of GRAPPA and CS regularizes the GRAPPA kernel computation step using a simultaneous sparsity penalty function of the coil images. This approach can be implemented by formulating the problem as the joint optimization of the least squares fit of the kernel to the ACS lines and the sparsity of the images generated using GRAPPA with the kernel.…”
    Get full text
    Get full text
    Article
  11. 11

    Exploiting sparsity in time-of-flight range acquisition using a single time-resolved sensor by Kirmani, Ahmed, Colaco, Andrea B., Wong, Franco N. C., Goyal, Vivek K.

    Published 2012
    “…Then, a convex optimization that exploits sparsity of the Laplacian of the depth map of a typical scene determines correspondences between spatial positions and depths. …”
    Get full text
    Get full text
    Article
  12. 12
  13. 13
  14. 14

    Nearly Linear-Time Model-Based Compressive Sensing by Hegde, Chinmay, Indyk, Piotr, Schmidt, Ludwig

    Published 2018
    “…In particular, two main barriers arise: (i) Existing recovery algorithms involve several projections into the structured sparsity model. For several sparsity models (such as tree-sparsity), the best known model-projection algorithms run in time Ω(kn), which can be too slow for large k. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16
  17. 17

    Simple Type-Level Unsupervised POS Tagging by Lee, Yoong Keok, Haghighi, Aria, Barzilay, Regina

    Published 2011
    “…Part-of-speech (POS) tag distributions are known to exhibit sparsity — a word is likely to take a single predominant tag in a corpus. …”
    Get full text
    Get full text
    Article
  18. 18

    Lasso Methods for Gaussian Instrumental Variables Models by Belloni, Alexandre, Chernozhukov, Victor, Hansen, Christian

    Published 2011
    “…We derive asymptotic distributions for the resulting IV estimators and provide conditions under which these sparsity-based IV estimators are asymptotically oracle-efficient. …”
    Get full text
    Working Paper
  19. 19

    Simultaneously Sparse Solutions to Linear Inverse Problems with Multiple System Matrices and a Single Observation Vector by Adalsteinsson, Elfar, Zelinski, Adam C., Goyal, Vivek K.

    Published 2010
    “…Experiments involve sparsity pattern recovery in noiseless and noisy settings and MRI RF pulse design.…”
    Get full text
    Get full text
    Article
  20. 20

    Sequential Compressed Sensing by Malioutov, Dmitry M., Sanghavi, Sujay R., Willsky, Alan S.

    Published 2011
    “…Existing results in compressed sensing literature have focused on characterizing the achievable performance by bounding the number of samples required for a given level of signal sparsity. However, using these bounds to minimize the number of samples requires a priori knowledge of the sparsity of the unknown signal, or the decay structure for near-sparse signals. …”
    Get full text
    Get full text
    Article