Fast Block-Sparse Decomposition Based on SL0

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-642-15995-4_53

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Berlin Heidelberg

Related search

Robust-Sl0 for Stable Sparse Representation in Noisy Settings

2009English

Fast Sparse Representation Based on Smoothed ℓ0 Norm

English

Sparse Signal Subspace Decomposition Based on Adaptive Over-Complete Dictionary

Eurasip Journal on Image and Video Processing
Electronic EngineeringSignal ProcessingInformation SystemsElectrical
2017English

Fast Scrambling on Sparse Graphs

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
2019English

Image Fusion Based on Combined Multi-Scale Decomposition and Improved Sparse Representation

DEStech Transactions on Computer Science and Engineering
2018English

Sparse-View Computed Tomography Image Reconstruction via a Combination of L1 and SL0 Regularization

Bio-Medical Materials and Engineering
MedicineBiomaterialsBiomedical Engineering
2015English

Fast Block Matching Algorithm Based on the Winner-Update Strategy

IEEE Transactions on Image Processing
Computer GraphicsComputer-Aided DesignSoftware
2001English

Fast Sparse Matrix Multiplication

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

H.264 Fast Inter-Mode Selection Based on Coded Block Patterns

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy