Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 38 for “"l1 minimization"”.

  1. Seismic ground-roll separation using sparsity promoting L1 minimization

    The removal of coherent noise generated by surface waves in land based seismic is a prerequisite to imaging the subsurface. These surface waves, termed as ground roll, overlay important reflector information in both the t-x and f-k domains. Standard techniques of ground roll removal commonly alter …

    ubc Repository record for Seismic ground-roll separation using sparsity promoting L1 minimization (opens in a new tab) Download PDF for Seismic ground-roll separation using sparsity promoting L1 minimization (opens in a new tab)

  2. Fast and robust face recognition via parallelized L1 minimization

    … extract low-dimensional features. Several custom L1 solvers are presented that achieve faster convergence on face data than general solvers. Optimized implementations for modern parallel computing architectures are investigated in order to build a system capable of performing highly accurate and …

    uiuc Repository record for Fast and robust face recognition via parallelized L1 minimization (opens in a new tab)

  3. On the Local Correctness of L1-minimization for Dictionary Learning Algorithm

    Item withdrawn by Rebecca Bryant (rabryant@illinois.edu) on 2011-12-01T20:45:07Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 GENG_QUAN.pdf: 460059 bytes, checksum: 9fe702d7efe57d2efd8da6d4af67f05b (MD5)

    uiuc Repository record for On the Local Correctness of L1-minimization for Dictionary Learning Algorithm (opens in a new tab)

  4. On L1 Minimization for Ill-Conditioned Linear Systems with Piecewise Polynomial Solutions

    … using a randomized, SVD-based truncation, and L1-norm regularization. The randomized truncation is a stabilization technique that helps reduce the cost of the traditional SVD truncation for large and severely ill-conditioned matrices. For L1-minimization, we apply a solver based on the …

    rice Repository record for On L1 Minimization for Ill-Conditioned Linear Systems with Piecewise Polynomial Solutions (opens in a new tab)

  5. Application of L1 Minimization Technique to Image Super-Resolution and Surface Reconstruction

    … non-linear finite element technique based on minimization of L1 norm of the total variation of the gradient is introduced. Since minimization in the L1 norm is computationally expensive, we seek to improve the performance of this algorithm in two fronts: first, local L1- minimization, which …

    tamu Repository record for Application of L1 Minimization Technique to Image Super-Resolution and Surface Reconstruction (opens in a new tab)

  6. Global Geometric Conditions on Sensing Matrices for the Success of L1 Minimization Algorithm

    Compressed Sensing concerns a new class of linear data acquisition protocols that are more efficient than the classical Shannon sampling theorem when targeting at signals with sparse structures. In this thesis, we study the stability of a Statistical Restricted Isometry Property and show how this …

    maryland Repository record for Global Geometric Conditions on Sensing Matrices for the Success of L1 Minimization Algorithm (opens in a new tab)

  7. Radial MILO: A 4D Image Registration Algorithm Based on Filtering Block Match Data via l1-minimization

    Minimal l1 Perturbation to Block Match Data (MILO) is a spatially accurate image registration algorithm developed for thoracic CT inhale/exhale images. The MILO algorithm consists of three components: (1) creating an initial estimate for voxel displacement via a Mutual Minimizing Block Matching …

    rice Repository record for Radial MILO: A 4D Image Registration Algorithm Based on Filtering Block Match Data via l1-minimization (opens in a new tab)

  8. Selection of Step Size for Total Variation Minimization in CT

    Medical image reconstruction by total variation minimization is a newly developed area in computed tomography (CT). In compressed sensing literature, it hasbeen shown that signals with sparse representations in an orthonormal basis may be reconstructed via l1-minimization. Furthermore, if an image …

    gsu Repository record for Selection of Step Size for Total Variation Minimization in CT (opens in a new tab)

  9. Application of L1 reconstruction of sparse signals to ambiguity resolution in radar

    … resolution in radar detection data using L1 minimization methods for sparse signals and to investigate the properties of such techniques. This novel approach to ambiguity resolution makes use of the sparse measurement structure of the post-detection data in multiple pulse repetition …

    gatech Repository record for Application of L1 reconstruction of sparse signals to ambiguity resolution in radar (opens in a new tab)

  10. Compressive sensing using lp optimization

    … reweighted (IR), smoothed L0 (SL0), and L1-minimization based algorithms. They also require a reduced amount of computations relative to the IR and L1-minimization based algorithms. The Lp-minimization based algorithms require less computation than the SL0 algorithm. In Chapter 3, the …

    uvic Repository record for Compressive sensing using lp optimization (opens in a new tab)

  11. Image Reconstructions of Compressed Sensing MRI with Multichannel Data

    … we propose a method which extends the reweighted l1 minimization to the CS-MRI with multi-channel data. The individual channel images are recovered according to the reweighted l1 minimization algorithm. Then, the final image is combined by the sum-of-squares method. Computer simulations show that …

    tamu Repository record for Image Reconstructions of Compressed Sensing MRI with Multichannel Data (opens in a new tab)

  12. Efficient Decoupling of Multiphysics Systems for Uncertainty Propagation

    … point sets that makes use of state of the art L1-minimization techniques and cut high dimensional model representations. The methodology is demonstrated on an analytic numerical example and a fire detection satellite system where it is shown to perform well as compared to brute force Monte …

    tamu Repository record for Efficient Decoupling of Multiphysics Systems for Uncertainty Propagation (opens in a new tab)

  13. Efficient algorithms for uncertainty quantification using polynomial chaos expansion and its applications to composite structures

    … problem more tractable, an adaptive L2-minimization algorithm that allows basis adaptivity along with sequential adaptive sampling is developed. Finally, an adaptive algorithm to obtain sparse PCE models with L1-minimization and sequential sampling is also proposed for high-dimensional …

    alabama Repository record for Efficient algorithms for uncertainty quantification using polynomial chaos expansion and its applications to composite structures (opens in a new tab)

  14. Taming Wild Faces: Web-Scale, Open-Universe Face Identification in Still and Video Imagery

    … regression to perform sample selection for l1-minimization, thus harnessing the speed of least-squares and the robustness of SRC. On our large dataset collected from Facebook, LASRC performs equally to standard SRC with a speedup of 100-250x. 2. For video, applying the popular …

    ucf Repository record for Taming Wild Faces: Web-Scale, Open-Universe Face Identification in Still and Video Imagery (opens in a new tab)

  15. Restricted Isometric Projections for Differentiable Manifolds and Applications

    … and robust recovery of all s-sparse vectors via l1-minimization. In infinite Hilbert spaces, a random linear map satisfies a general RIP with high probability and allow recovering and extending many known compressive sampling results. This thesis extends the known restricted isometric projection …

    usf Repository record for Restricted Isometric Projections for Differentiable Manifolds and Applications (opens in a new tab)

  16. Using prior support information in compressed sensing

    … we study certain weighted nonconvex Lp minimization algorithms and a weighted approximate message passing algorithm. In Chapter 1 we describe compressed sensing as a practicable signal acquisition method in application and introduce the generic sparse approximation problem. Then we …

    ubc Repository record for Using prior support information in compressed sensing (opens in a new tab) Download PDF for Using prior support information in compressed sensing (opens in a new tab)

  17. Optimization for high-dimensional analysis and estimation in signal processing and machine learning

    … from the signal space. In compressive sensing,L1-minimization is a widely used framework to find the sparse representations of a signal. It has recently been shown that atomic norm minimization (ANM), which is a generalization of L1-minimization, is an efficient and powerful way for exactly …

    colo-mines Repository record for Optimization for high-dimensional analysis and estimation in signal processing and machine learning (opens in a new tab)

  18. Coded Acquisition of High Speed Videos with Multiple Cameras

    … is posed and solved as a large scale l1 minimization problem by exploiting joint temporal and spatial sparsities of the 3D signal. Three coded video acquisition techniques of varied trade o s between performance and hardware complexity are developed: frame-wise coded acquisition, …

    mcmaster Repository record for Coded Acquisition of High Speed Videos with Multiple Cameras (opens in a new tab)

  19. Seismic data interpolation using sparsity constrained inversion

    … artifacts in the reconstruction. Weighted L1 minimization algorithms have been proposed as a way to mitigate such problems. In this paper, we show the problems associated with the synthesis and analysis approaches when applied to seismic interpolation and propose an approach based on a …

    colo-mines Repository record for Seismic data interpolation using sparsity constrained inversion (opens in a new tab)

  20. Compressive Sensing

    … sparse recovery problem in compressive sensing: l1-minimization methods and greedy methods. Our contribution is that we look at compressive sensing from a different point of view by connecting it with sparse interpolation. We introduce a new algorithm for compressive sensing called generalized …

    clemson Repository record for Compressive Sensing (opens in a new tab)

Page 1 of 2