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 32 for “"Group Sparsity"”.

  1. Recovering Data with Group Sparsity by Alternating Direction Methods

    Group sparsity reveals underlying sparsity patterns and contains rich structural information in data. Hence, exploiting group sparsity will facilitate more efficient techniques for recovering large and complicated data in applications such as compressive sensing, statistics, signal and image …

    rice Repository record for Recovering Data with Group Sparsity by Alternating Direction Methods (opens in a new tab)

  2. Deep Face Morph Detection Based on Wavelet Decomposition

    … algorithms such as image wavelet analysis, group sparsity, feature selection, and the visual attention mechanisms. Wavelet decomposition enables us to leverage the fine-grained frequency content of an image to boost localizing manipulated areas in an image. Our methodologies are as follows: …

    wvu Repository record for Deep Face Morph Detection Based on Wavelet Decomposition (opens in a new tab)

  3. EFFICIENT MACHINE LEARNING METHODS FOR BIG DATA ANALYTICS

    … support vector machines (SVM), tree-structured group sparsity and sparse Gaussian process regression. We first present a strictly safe sample screening method for early discarding of inactive samples prior to solving the SVM, so that the problem size of the SVM can be substantially reduced. …

    nus Repository record for EFFICIENT MACHINE LEARNING METHODS FOR BIG DATA ANALYTICS (opens in a new tab) Download file for EFFICIENT MACHINE LEARNING METHODS FOR BIG DATA ANALYTICS (opens in a new tab)

  4. Scalable Optimization Methods for Machine Learning: Structures, Properties and Applications

    … of all methods is presented. Next we move on to group sparse structured model. We develop an inverse covariance estimator that can regularize for overlapping group sparsity, and provide better estimates, especially when the dimension size is much larger than the number of samples. Furthermore, we …

    umn Repository record for Scalable Optimization Methods for Machine Learning: Structures, Properties and Applications (opens in a new tab)

  5. Deep Learning and Optimization in Visual Target Tracking

    … second developed method is called a structured group local sparse tracker (SGLST), which exploits local patches inside target candidates in the particle filter framework. Unlike the conventional local sparse trackers, the proposed optimization model in SGLST not only adopts local and spatial …

    utahstate Repository record for Deep Learning and Optimization in Visual Target Tracking (opens in a new tab)

  6. Optimization Strategies in Proton Treatment Planning Considering Biological Effects

    … transfer (LET) into the selection process. A group-sparsity formulation with a proximal semi-stochastic gradient descent algorithm is developed to jointly optimize dose and LET distributions, enabling beam selection that enhances tumor effectiveness while reducing LET in critical structures. …

    houston Repository record for Optimization Strategies in Proton Treatment Planning Considering Biological Effects (opens in a new tab) Embargoed until 2028-05-01

  7. Non-Coherent Direction of Arrival Estimation and Localization Based on Sensor Arrays

    … snapshots usually available at an array, a fasT grOup sparsitY Based phAse Retreival (ToyBar) algorithm is proposed to solve the noncoherent DOA estimation problem. To avoid the use of reference signals, an effective array structure based on two uniform linear sub-arrays is proposed first for …

    whiterose Download PDF for Non-Coherent Direction of Arrival Estimation and Localization Based on Sensor Arrays (opens in a new tab)

  8. Learning sparse features and metric in signal and image processing

    … non-convex and can take into account structured sparsity (e.g., group sparsity). We propose an efficient iterative thresholding procedure for solving the optimization. Our method achieves state-of-the-art performance for super-resolution signal spectrum estimation. On the other hand, in order to …

    uiuc Repository record for Learning sparse features and metric in signal and image processing (opens in a new tab)

  9. Neuromorphic Processing on Event-Based Time-Series

    … then clustered and classified into 30 distinct groups using a subsequent 3-layer SNN. To reduce unnecessary neural recording data and demonstrate neuromorphic interoperability, I then propose an adapted dynamic group sparsity algorithm which compresses recordings in real-time, predicated on a …

    jhu Repository record for Neuromorphic Processing on Event-Based Time-Series (opens in a new tab)

  10. Learning Under Implicit Bias and Data Bias

    … reparametrization known as the “diagonally grouped linear neural network”. This reparametriza-tion exhibits a fascinating property wherein gradient descent, operating on the squared regression loss without explicit regularization, biases towards solutions with a group sparsity structure. In …

    tamu Repository record for Learning Under Implicit Bias and Data Bias (opens in a new tab)

  11. Learning Under Implicit Bias and Data Bias

    … reparametrization known as the “diagonally grouped linear neural network”. This reparametriza-tion exhibits a fascinating property wherein gradient descent, operating on the squared regression loss without explicit regularization, biases towards solutions with a group sparsity structure. In …

    tamu Repository record for Learning Under Implicit Bias and Data Bias (opens in a new tab)

  12. Feature Extraction and Recognition for Human Action Recognition

    … to increase the discrimination. In addition, the group sparsity and the geometry constraint are added to the learning process to further increase the discriminative power, so that features are well reconstructed by atoms from the same class and features from the same class with high similarity …

    utk-theses Repository record for Feature Extraction and Recognition for Human Action Recognition (opens in a new tab)

  13. Graphical models for directed acyclic graphs

    … model. The proposed method can incorporate the group information via the group Lasso penalty while accounting for the potential unmeasured confounders. Simulations demonstrated that the proposed method performs better than the original method that does not incorporate group information. Third, …

    bu Repository record for Graphical models for directed acyclic graphs (opens in a new tab)

  14. Bistatic Automotive Radar Sensing: Signal Processing for Motion Parameter Estimation

    … radar signal model is then developed and a sparsity-based method for two-dimensional location and Doppler estimation is proposed. After that, an extension of this application to a multistatic scheme is proposed by deploying multiple cooperative roadside sensors, and adopting the …

    whiterose Download PDF for Bistatic Automotive Radar Sensing: Signal Processing for Motion Parameter Estimation (opens in a new tab)

  15. Integrative Analysis of Non-Euclidean Data

    … non-Euclidean constraints and introduces a group-sparsity penalty to select important variables. The proposed method shows improved empirical performance over existing approaches and is applied to dynamic functional connectivity data from the Human Connectome Project. Furthermore, we …

    washington Repository record for Integrative Analysis of Non-Euclidean Data (opens in a new tab)

  16. Optimization Strategies to Enhance Performance in Matrix/Tensor Factorization and Multi-Source Data Integration

    … the capture of a common set of features through group sparsity. Finally, we acknowledge the potential effectiveness of incorporating randomness in certain scenarios. We partition the parameter learning in multi-task learning into separate processes for task-shared component and task-specific …

    clemson Repository record for Optimization Strategies to Enhance Performance in Matrix/Tensor Factorization and Multi-Source Data Integration (opens in a new tab)

  17. Shape-constrained Regression and False Discovery Rate Control for Functional Data with Applications to Human Intracranial Electroencephalography Study

    … regression functions and develops a weighted group bridge approach for simultaneous function estimation and support recovery in function-on-scalar mixed effect models. We use locally supported B-splines to transform nonparametric functions to vectors of diverging dimension with group sparsity, …

    rice Repository record for Shape-constrained Regression and False Discovery Rate Control for Functional Data with Applications to Human Intracranial Electroencephalography Study (opens in a new tab)

  18. Low-rank matrix recovery: blind deconvolution and efficient sampling of correlated signals

    … structure in signals and images is sparsity, and a new sampling theory; namely, compressive sensing, proves that the sparse signals and images can be reconstructed from incomplete measurements. The signal recovery is achieved using efficient algorithms such as \ell_1-minimization. …

    gatech Repository record for Low-rank matrix recovery: blind deconvolution and efficient sampling of correlated signals (opens in a new tab)

  19. Statistical modeling of high-dimensional categorical data with applications to mutation fitness and sparse text topic analysis

    … exhibiting complex dependencies and high sparsity. Conventional statistical models, designed for continuous or low-dimensional settings, often fall short in capturing the latent structure and combinatorial complexity of such data. This dissertation introduces new statistical modeling …

    colostate Repository record for Statistical modeling of high-dimensional categorical data with applications to mutation fitness and sparse text topic analysis (opens in a new tab)

  20. Nonnegative matrix and tensor factorizations, least squares problems, and applications

    … with successful experimental results. Finally, a group-sparsity regularization method for NMF is presented. A recent challenge in data analysis for science and engineering is that data are often represented in a structured way. In particular, many data mining tasks have to deal with …

    gatech Repository record for Nonnegative matrix and tensor factorizations, least squares problems, and applications (opens in a new tab)

Page 1 of 2