Welcome![Sign In][Sign Up]
Location:
Search - overcomplete

Search list

[WEB CodeGreedyBasisPursuit

Description: a new algorithm for computing sparse signal representations using overcomplete dictionaries
Platform: | Size: 771594 | Author: wfs | Hits:

[File Formataaa

Description: 盲源分离的好文章,可以帮助大家很好的了解超完备盲源分离-Blind Source Separation good article can help you a good understanding of overcomplete blind source separation
Platform: | Size: 955392 | Author: 尹聪 | Hits:

[File Formatocica97-p

Description: 盲源分离的好文章,可以帮助大家很好的了解超完备盲源分离-Blind Source Separation good article can help you a good understanding of overcomplete blind source separation
Platform: | Size: 955392 | Author: 尹聪 | Hits:

[DocumentsGreedyBasisPursuit

Description: a new algorithm for computing sparse signal representations using overcomplete dictionaries
Platform: | Size: 771072 | Author: wfs | Hits:

[Special Effectssparserepresentationofsignals

Description: 详细介绍了信号的稀疏分解和表示方法,可以用于图像特征提取等方面-Details of the sparse signal decomposition and that the method can be used for image feature extraction, etc.
Platform: | Size: 29245440 | Author: kunkun | Hits:

[Industry researchDoubledensity

Description: The double-density DWT is an improvement upon the critically sampled DWT with important additional properties: (1) It employs one scaling function and two distinct wavelets, which are designed to be offset from one another by one half, (2) The double-density DWT is overcomplete by a factor of two, and (3) It is nearly shift-invariant. In two dimensions, this transform outperforms the standard DWT in terms of denoising however, there is room for improvement because not all of the wavelets are directional. That is, although the double-density DWT utilizes more wavelets, some lack a dominant spatial orientation, which prevents them from being able to isolate those directions. -The double-density DWT is an improvement upon the critically sampled DWT with important additional properties: (1) It employs one scaling function and two distinct wavelets, which are designed to be offset from one another by one half, (2) The double-density DWT is overcomplete by a factor of two, and (3) It is nearly shift-invariant. In two dimensions, this transform outperforms the standard DWT in terms of denoising however, there is room for improvement because not all of the wavelets are directional. That is, although the double-density DWT utilizes more wavelets, some lack a dominant spatial orientation, which prevents them from being able to isolate those directions.
Platform: | Size: 38912 | Author: Harry | Hits:

[ActiveX/DCOM/ATLocica97-p

Description: 这是一篇ica盲源分离方法的技术文章 Overcomplete 的方法来解决-Blind Source Separation of More Sources Than Mixtures Using Overcomplete Representations
Platform: | Size: 955392 | Author: 叶惠 | Hits:

[Special Effectsovercomplete

Description: 收集的几篇关于稀疏性号冗余字典建立的中文文献,对初学者很有参考价值。-Collection of several dictionaries on the sparsity of the establishment of redundant number of Chinese literature, a good reference for beginners.
Platform: | Size: 3164160 | Author: | Hits:

[2D Graphiclow-rank-ksvd

Description: 低秩的求解 denoise an image by sparsely representing each block with the already overcomplete trained Dictionary, and averaging the represented parts. Detailed description can be found in "Image Denoising Via Sparse and Redundant representations over Learned Dictionaries-low rankdenoise an image by sparsely representing each block with the already overcomplete trained Dictionary, and averaging the represented parts. Detailed description can be found in "Image Denoising Via Sparse and Redundant representations over Learned Dictionaries
Platform: | Size: 2108416 | Author: 中和 | Hits:

[matlabw97OCWT

Description: Overcomplete wavelet transform using w97
Platform: | Size: 1024 | Author: pui | Hits:

[matlabw53OCWT

Description: Overcomplete wavelet transform using w53
Platform: | Size: 1024 | Author: pui | Hits:

[Software EngineeringSL0MatlabCodereal

Description: 快速的基于光滑的l0范数的过完备的稀疏分解,其速度比L1范数快,恢复效果好-Rapid decomposition overcomplete sparse smooth l0 norm-based, its speed is faster than the L1 norm, restore good effect
Platform: | Size: 4096 | Author: 张世中 | Hits:

[Algorithmk_svd1

Description: K-SVD同MOD一样也分为Sparse Coding和Dictionary Update两个步骤,Sparse Coding没有什么特殊的,也是固定过完备字典D,使用各种迭代算法求信号在字典上的稀疏系数。-K-SVD Sparse Coding and Dictionary Update is also divided into two steps, like MOD, Sparse Coding is not anything special, also fixed overcomplete dictionary D various iterative algorithms to find the signal on the dictionary sparse coefficient.
Platform: | Size: 12527616 | Author: mqf | Hits:

[Special EffectsScSR

Description: Jianchao Yang 的基于稀疏表示的单幅图像重建的原始代码,先将高低训练图像分块,再将块训练成高低字典,将测试图像映射到低字典上,得到系数,再乘以高子典就得到最后的图像。对学习超分辨率同学的参考作用很大。-This is the original matlab code for super resolution by Jianchao Yang 。The method is sparse represent based on the overcomplete dictionary。
Platform: | Size: 27638784 | Author: 刘丹 | Hits:

[Data structsKSVD_Matlab_ToolBox

Description: 这是线性训练K-SVD词典的一种新算法 表示的信号。给定一组信号,K-SVD试图 提取物,可以稀疏表示这些信号最好的词典。 深入讨论了K-SVD算法中可以找到的: “K-SVD:设计的超完备字典的一个算法 稀疏表示”,由M.阿哈,M. Elad和点写,适应性, 在IEEE Transactions出现。在信号处理,卷54,11号, 第4311-4322,十一月2006。-he K-SVD is a new algorithm for training dictionaries for linear representation of signals. Given a set of signals, the K-SVD tries to extract the best dictionary that can sparsely represent those signals. Thorough discussion concerning the K-SVD algorithm can be found in: "The K-SVD: An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation", written by M. Aharon, M. Elad, and A.M. Bruckstein, and appeared in the IEEE Trans. On Signal Processing, Vol. 54, no. 11, pp. 4311-4322, November 2006.
Platform: | Size: 6262784 | Author: 飘摇 | Hits:

[DocumentsAlgebraic-ICA

Description: 介绍了一种代数过完备ICA算法,采用这种方法对混合语言信号进行分解。-Algebraic independent component analysis an approach for separation of overcomplete speech mixtures
Platform: | Size: 373760 | Author: y | Hits:

[AI-NN-PRbatch-omp

Description: KSVDBox - Implementation of the K-SVD and K-SVD denoise algorithms.-K-SVD dictionary training. ksvd - K-SVD dictionary training. Signal denoising. ompdenoise - OMP denoising. ompdenoise1 - OMP denoising of 1-D signals. ompdenoise2 - OMP denoising of 2-D signals. ompdenoise3 - OMP denoising of 3-D signals. ksvddenoise - K-SVD denoising. Overcomplete DCT dictionary. odctdict - Overcomplete DCT dictionary. odct2dict - 2-D overcomplete DCT dictionary. odct3dict - 3-D overcomplete DCT dictionary. odctndict - Multi-dimensional overcomplete DCT dictionary. Demonstrations. ksvddemo - K-SVD training demonstration. ksvddenoisedemo- K-SVD denoising demonstration. Miscellaneous. showdict - Display a dictionary of image patches. ksvdver - K-SVD toolbox version information.
Platform: | Size: 867328 | Author: 时中荣 | Hits:

[Technology ManagementOMP

Description: The problem of optimal approximation of members of a vector space by a linear combination of members of a large overcomplete library of vectors is of importance in many areas including image and video coding, image analysis, control theory, and statistics. Finding the optimal solution in the general case is mathematically intractable. Matching pursuit, and its orthogonal version, provide greedy solutions to this problem. Orthogonal matching pursuit typically provides significantly better solution compared to the nonorthogonal version, but requires much more computation. This paper presents a fast algorithm for implementation of orthogonal matching pursuit which for many coding applications has computational complexity very close to that of the nonorthogonal version.
Platform: | Size: 286720 | Author: ganga | Hits:

[Special EffectsSA-OE

Description: 基于过完备基展开的空间自适应去噪算法。论文《Spatially adaptive image denoising under overcomplete expansion》。-Spatially adaptive image denoising under overcomplete expansion
Platform: | Size: 695296 | Author: locale | Hits:

[Software EngineeringFingerprint-Compression

Description: A new fingerprint compression algorithm based on sparse representation is introduced. Obtaining an overcomplete dictionary from a set of fingerprint patches allows us to represent them as a sparse linear combination of dictionary atoms. In the algorithm, we first construct a dictionary for predefined fingerprint image patches. For a new given fingerprint images, represent its patches according to the dictionary by computing l0-minimization and then quantize and encode the representation. In this paper, we consider the effect of various factors on compression results. Three groups of fingerprint images are tested. The experiments demonstrate that our algorithm is efficient compared with several competing compression techniques (JPEG, JPEG 2000, andWSQ), especially at high compression ratios. The experiments also illustrate that the proposed algorithm is robust to extract minutiae.
Platform: | Size: 3031040 | Author: bala | Hits:
« 12 »

CodeBus www.codebus.net