登录
首页 » matlab » Somp

Somp

于 2011-06-16 发布 文件大小:623KB
0 188
下载积分: 1 下载次数: 576

代码说明:

  SOMP算法,该算法主要是应用在压缩传感中的信号恢复算法。(Compressed Sensing)

文件列表:

CoSaMP.pdf,299441,2010-11-08
Somp.m,1097,2010-12-20
Somp.pdf,455354,2010-12-18

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论


0 个回复

  • ZCRYPT23
    ZIP文件的一个编解码算法,主要用于ZIP文件的加解密。(ZIP file of a codec algorithm, mainly used in ZIP file encryption and decryption.)
    2007-11-26 12:46:33下载
    积分:1
  • EZW_Matlab_Demo
    EZW matlab 源码用于图像压缩试验()
    2008-03-26 15:32:14下载
    积分:1
  • Zigzag
    zigzag函数的matlab实现,通常图象压缩中经常需要用的ZIGZAG函数(the zigzag function realized by matlab)
    2011-12-24 14:00:54下载
    积分:1
  • ImageMatch
    说明:  这是一个基于matlab的图像匹配算法,通过先后两帧中相同的部位,在前一帧中搜索协方差最大的匹配点。(This is a matlab-based image matching algorithm has the same two parts, a former search the largest covariance matching points.)
    2008-09-19 15:39:44下载
    积分:1
  • Erika
    upx解压,演示upx解压的程序源码,仅供参考。(upx unpack,show upx unpack program source code)
    2016-03-25 11:07:12下载
    积分:1
  • digitalaudio
    详细介绍了数字音频的压缩和传输,同时介绍了mp3、wma和AC-3音频的关键技术。(Details of digital audio compression and transmission, at the same time introduced the mp3, wma and AC-3 audio of key technologies.)
    2007-11-16 00:57:18下载
    积分:1
  • peakfinder
    This function quickly finds local peaks or valleys (local extrema) in a noisy vector using a user defined magnitude threshold to determine if each peak is significantly larger (or smaller) than the data around it. The problem with the strictly derivative based peak finding algorithms is that if the signal is noisy many spurious peaks are found.
    2021-03-12 19:39:25下载
    积分:1
  • hufman
    哈夫曼文本压缩器,两个功能压缩文本文件和解压二进制文件。 内容为源代码,用编译器把源代码运行一遍,把需要压缩的txt文件放到和源代码同一个目录下,压缩名称输入 **.txt 压缩后的名称一定要写二进制格式的 例如 **.dat 只能解压用这个程序压缩后的文件。。 解压名 写 **.dat 解压后名称 **.txt(Huffman text compression, two text files compression and decompression functions binaries)
    2013-12-27 11:06:18下载
    积分:1
  • HAFUMANSHU
    哈夫曼编码(Huffman Coding),又称霍夫曼编码,是一种编码方式,哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法,该方法完全依据字符出现概率来构造异字头的平均长度最短的码字,有时称之为最佳编码,一般就叫做Huffman编码(有时也称为霍夫曼编码)。(Huffman encoding (Huffman Coding), also called Huffman Coding, is a way of Coding, Huffman Coding is variable word length Coding (VLC). Huffman in 1952 put forward a kind of coding method, this method is completely based on the characters of the occurrence probability to construct the average length of the shortest code word, sometimes called the best coding, generally is called Huffman coding (sometimes referred to as the Huffman coding).)
    2016-12-13 00:02:52下载
    积分:1
  • hausdorff1
    对于做模式识别的朋友有很大的帮助~HAUSDORFF距离!!!!!(Pattern Recognition for doing a great friend to help ~ HAUSDORFF distance! ! ! ! !)
    2009-05-26 01:09:25下载
    积分:1
  • 696518资源总数
  • 104847会员总数
  • 24今日下载