登录
首页 » matlab » CS

CS

于 2013-06-13 发布 文件大小:1KB
0 304
下载积分: 1 下载次数: 0

代码说明:

说明:  压缩传感omp算法代码,附带一个测试的程序。便于理解。(Omp compressed sensing algorithm code, with a test program. Easy to understand.)

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

发表评论

0 个回复

  • hmm
    连续隐马尔可夫模型hmm的matlab程序(Continuous Hidden Markov Model of matlab procedures hmm)
    2020-06-29 19:00:02下载
    积分:1
  • bin
    传统游程编码,并且又对游程编码进行了一定程度的改进。(The traditional run-length coding has improved it to some extent.)
    2020-06-24 19:40:01下载
    积分:1
  • OMP
    OMP,很好的OMP程序,应用于压缩感知中的。与以前的程序有点不同(OMP, good OMP program, applied to the compression of perception. Is a little different with previous program)
    2013-05-21 09:32:46下载
    积分:1
  • bin
    说明:  传统游程编码,并且又对游程编码进行了一定程度的改进。(The traditional run-length coding has improved it to some extent.)
    2020-06-24 19:40:01下载
    积分:1
  • CS的一些重构算法
    压缩感知的所有重构算法,包括OMP,ROMP,SAMP,StoMP等等算法。(All reconstruction algorithms of compressed sensing include OMP, ROMP, SAMP, StoMP and so on.)
    2021-03-26 22:19:13下载
    积分:1
  • huffman
    huffman编码用于图像的压缩和解压,很好用的,可以用于各类图像的处理(huffman coding for image compression and decompression, useful, and can be used for all kinds of image processing)
    2010-05-08 14:58:05下载
    积分:1
  • jpeg_enc
    一个jpeg编码程序,有效实现了图像的jpeg压缩,是一个非常好的编码试例。(a jpeg coding procedures, the effective realization of the jpeg image compression, is a very good coding test cases.)
    2005-05-27 22:43:19下载
    积分:1
  • 纸飞机4.0
    ssr科学上网工具,该压缩文件已经配置好了,直接解压就可以使用了。(SSR scientific Internet access tool, the compressed file has been configured, the direct decompression can be used.)
    2020-06-29 08:40:01下载
    积分:1
  • xinxi
    哈夫曼编码,基于MFC开发。哈夫曼编码为熵编码中的最佳方法之一,广泛用于各种数据压缩技术中。-Huffman coding, based on the MFC. Huffman coding for entropy coding one of the best ways, for a wide variety of data compression technology.
    2011-07-12 10:33:01下载
    积分:1
  • Traversalalgo
    Codes". Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes") (that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol) that expresses the most common characters using shorter strings of bits than are used for less common source symbols. Huffman was able to design the most efficient compression method of this type: no other mapping of individual source symbols to unique strings of bits will produce a smaller average output size when the actual symbol frequencies agree with those used to create the code. A method was later found to do this in linear time if input probabilities (also known as weights) are sorted.
    2009-12-01 04:47:10下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载