Sparse coding storage optimization method
A technology of storage optimization and sparse coding, which is applied in the field of storage optimization of sparse coding, can solve the problems of affecting signal memory space, occupying a large storage space, and sparse coding storage is not optimized enough to achieve the effect of saving storage space
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0071] The following takes an image signal as an example to illustrate the feasibility of the present invention and give an application example.
[0072] According to the above part, for a trained over-complete dictionary set X, there are n dictionary atoms {x 1 ,x 2 ,...,x n}, each dictionary atom is a d-dimensional vector with mean 0 and modulus 1. Here "overcomplete" means that the number n of atoms in the dictionary set is much larger than the dimension p of atoms. For a target vector y to be represented in a sparse coding, one needs to find a linear combination s 1 x 1 +s 2 x 2 +…+s n x n +o1 to approximate the target vector y, where s 1 ,s 2 ,...,s n and o are linear coefficients, vector 1 is a vector of length d elements all 1.
[0073] According to the linear decomposition method based on MSE and SSIM, the target vector y can be sparsely represented, assuming x 1 ,x 2 ,...,x k is the coefficient s corresponding to nonzero i Selected dictionary atoms of ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



