资源列表
MINNDz
- Multiple-Instance Nearest Neighbour with Distribution learner.
MINND
- Multiple-Instance Nearest Neighbour with Distribution learner.
2004-10_2004102994048550
- import flash.display.Sprite import flash.display.Bitmap import flash.display.BitmapData import flash.filters.BlurFilter import flash.events.Event import flash.geom.Point import flash.events.MouseEvent import flash.display.SimpleB
yasuo-vb
- vb压缩图片的实例程序加代码，可以自己的软件中方便的添加vb压缩功能-vb examples of image compression program plus the code, you can own the software easy to add compression vb
Gif_codec
- GIF图片解压成RGB格式的程序，可根据需要，转成灰阶或其它格式
convert8k
- 降采样程序，从16k16bit数据 降采样到8k16bit-resample program，it resample the 16k16bit pcm to 8k16bit pcm
shuzutuxiangyasuo
- 数字图像压缩的完整程序，包括各个子程序，它是基于DCT的压缩-Complete digital image compression procedures, including various subroutines, which is based on DCT compression
venb
- H.261图像压缩芯片控制软件-H.261 image compression chip control software
c3
- 若用0~9之间不同的三个数构成一个三个数，统计出有多少个这样的三位数-If using a different three numbers between 0 and 9 constitute a three numbers, the statistics of the number of such three-digit
haffman
- 在Jpeg中Huffman采用的是范式Huffman编码。经过查相关资料有两种不同说法，请高手指点。谢谢！ 1、构造范式 Huffman 编码的方法大致是： 分别统计从最大编码长度 maxlength 到 1 的每个长度对应了多少个符号。根据这一信息从 maxlength 个 0 开始以递增顺序为每个符号分配编码。例如，编码长度为 5 的符号有 4 个，长度为 3 的有 1 个，长度为 2 的有 3 个，则分配的编码依次为： 00000 00001 00010 00011
Huffman_coding
- Extended Huffman coding. Huffman encoding and Huffman decoding. Note: need to change the file path of the picture for compressing.-Extended Huffman coding. Huffman encoding and Huffman decoding
Huffman
- 用huffman编码定理对文件进行压缩与解压缩-Huffman coding theorem using the file compression and decompression