-
Moth用于从各种数据源中创建2D图形。第一个版本可以读取文本文件、rrd文件和MySQL数据库，可以输出jpeg 和png图像...
Moth用于从各种数据源中创建2D图形。第一个版本可以读取文本文件、rrd文件和MySQL数据库，可以输出jpeg 和png图像-Woolf used data from a variety of sources to create 2D graphics. A first version can read text files, documents and rrd-users-request@list.ee.ethz.ch MySQL database, and can output jpeg images png
- 2022-03-20 07:53:56下载
- 积分：1
-
章 图像编码与压缩
图像编码基础
无损压缩编码 行程编码
哈夫曼（ Huffman ）编码
算术编码 词典编码
有损压缩编码...
章 图像编码与压缩
图像编码基础
无损压缩编码 行程编码
哈夫曼（ Huffman ）编码
算术编码 词典编码
有损压缩编码
预测编码
正交变换编码
MATLAB 实现余弦变换压缩
17.3.4 MATLAB 实现小波变换压缩 -S image coding and compression image coding based lossless compression stroke Huffman coding (Huffman) coding arithmetic coding, dictionary coding lossy compression encoding prediction coded orthogonal transform coding MATLAB realization of cosine transform compression 17.3.4 MATLAB wavelet compression to achieve
- 2022-02-02 11:15:16下载
- 积分：1
-
DM code is a common two
DM码是一种常见的二维条形码，提供一个编码器，供学习参考。-DM code is a common two-dimensional bar code, providing an encoder, for the study reference.
- 2023-03-26 15:25:03下载
- 积分：1
-
基于信息熵的改进型遗传算法，并加入了基于群体浓度更新的操作算子。...
基于信息熵的改进型遗传算法，并加入了基于群体浓度更新的操作算子。-based on information entropy IAGA, and to join groups based on the concentration updated Operator.
- 2022-03-22 18:30:19下载
- 积分：1
-
图像恢复-维纳滤波一般算法
将噪声方差比图a降了5个数量级的被污染图像进行维纳滤波，具有各种典型的噪声类型可供选择，有较为详尽的注释，适合图像处理的初学钻研者
- 2022-04-08 15:39:35下载
- 积分：1
-
非均匀有理b样条曲线nurbs的C＋＋源码库。
非均匀有理b样条曲线nurbs的C＋＋源码库。-non-uniform rational b-spline NURBS curves of the C++ source library.
- 2022-05-27 05:27:01下载
- 积分：1
-
Svgacc图形库示例
Svgacc图形库示例-Svgacc graphics library Example
- 2022-11-19 21:10:03下载
- 积分：1
-
delphi画正弦曲线，抛砖引玉，发挥后可完成绘图的一些功能
delphi画正弦曲线，抛砖引玉，发挥后可完成绘图的一些功能-delphi painting sine curve, something to play after the completion of some functional mapping
- 2022-01-26 05:54:41下载
- 积分：1
-
图像处理的VC++开发库源代码
图像处理的VC++开发库源代码-image processing VC source development libraries
- 2023-08-19 10:10:05下载
- 积分：1
-
Polygon clipping is one of those humble tasks computers do all the time. It s a...
Polygon clipping is one of those humble tasks computers do all the time. It s a basic operation in creating graphic output of all kinds. There are several well-known polygon clipping algorithms, each having its strengths and weaknesses. The oldest one (from 1974) is called the Sutherland-Hodgman algorithm. In its basic form, it is relatively simple. It is also very efficient in two important cases, one being when the polygon is completely inside the boundaries, and the other when it s completely outside.
- 2022-09-16 13:35:03下载
- 积分：1
