Description: 【文本与二值图像的游程】1. 文本游程压缩的原理 对重复字段采用3符号标识法：(1) 重复提示符,比如@,#等；(2) 游程长度参数或重复次数,若用一个字节表示,最大长度可为255个重复字；(3) 重复字符。以上三部分合称为重复因子。可见要获得压缩效益，重复字符应在3个以上。2. 图像游程压缩的原理 对于二值图像，原始数据为零一矩阵，压缩时逐行处理该矩阵：(1) 连续n个1，表示为+n；(2) 连续n个0，表示为-n。-text and binary image -- an outbound trip. Yu Cheng text compression principle on repeated field using three symbols logo Act : (a) repeat prompt, such as @, #, etc.; (2) Run-length parameters, or the number of repeat, if using a byte, the largest the length of 255 to repeat the word; (3) repeat characters. More than three as part of a repeat factor. Visibility to gain compression efficiency, duplication of characters in three more. 2. Run-image compression for the principle of two binary images, a zero original data matrix, progressive compression deal with the matrix : (1) n a row, n; (2) consecutive n 0, expressed as-n. Platform: |
Size: 157491 |
Author:李勃东 |
Hits:
Description: 【文本与二值图像的游程】1. 文本游程压缩的原理 对重复字段采用3符号标识法：(1) 重复提示符,比如@,#等；(2) 游程长度参数或重复次数,若用一个字节表示,最大长度可为255个重复字；(3) 重复字符。以上三部分合称为重复因子。可见要获得压缩效益，重复字符应在3个以上。2. 图像游程压缩的原理 对于二值图像，原始数据为零一矩阵，压缩时逐行处理该矩阵：(1) 连续n个1，表示为+n；(2) 连续n个0，表示为-n。-text and binary image-- an outbound trip. Yu Cheng text compression principle on repeated field using three symbols logo Act : (a) repeat prompt, such as @,#, etc.; (2) Run-length parameters, or the number of repeat, if using a byte, the largest the length of 255 to repeat the word; (3) repeat characters. More than three as part of a repeat factor. Visibility to gain compression efficiency, duplication of characters in three more. 2. Run-image compression for the principle of two binary images, a zero original data matrix, progressive compression deal with the matrix : (1) n a row, n; (2) consecutive n 0, expressed as-n. Platform: |
Size: 562176 |
Author:李勃东 |
Hits:
Description: 传输矩阵法计算啁啾光栅反射谱
本节中给出传输矩阵法计算啁啾光栅反射谱和
时延的完整M at lab 程序实例, 本段代码在
M at lab513 和W indow s2000 环境中运行通过。运行结果如图8 所示。可以改变光栅长度、有效折射率、折射率调制深度、啁啾系数等参数来获得不同参数下光栅反射谱和时延曲线。如果打开“％ 切趾”行的屏蔽符“％ ”则可得到切趾后光栅反射谱和时延特性曲线, 此时计算所得的曲线将比图8 中所示的曲线平滑很多。-Transfer matrix method to calculate reflection spectrum of chirped grating is given in this section transfer matrix method to calculate chirped grating reflection spectrum and the delay of a complete example of M at lab procedures, the above code in M at lab513 and W indow s2000 environment to run through. The results shown in Figure 8. Can change the grating length, the effective refractive index, refractive index modulation depth and chirp coefficient parameters to obtain different parameters of grating reflection spectrum and the time delay curve. If you open Apodization line shielding Fu can be grating after apodization reflection spectrum and the delay characteristic curve, the curve at this time will be calculated as shown in Figure 8 a lot of curve smoothing. Platform: |
Size: 1024 |
Author:金沧 |
Hits:
Description: 数字图像编码方式之一的游程编码实现，利用它可以将灰度矩阵转换成游程编码-, One of the digital image encoding Run-length coding, use it can be converted to grayscale matrix run-length coding Platform: |
Size: 612352 |
Author:david |
Hits:
Description: Gold code sequence generator
Run from editor Debug (F5)
JC 4/25/09
Gold code generation can sometimes be confusing and hopefully this m-file
will be helpful. The m-file uses two preferred pairs of m-sequences (length 2^n-1)
chips long where n=5 with length 31. The 33 gold codes
(two original m-sequences plus 2^n-1 gold codes) produced in a 31x33 matrix
here (with n=5) are probably not to useful for multiple access situations (CDMA)
but is used here to provide a model for learning. The preferred pair used
here is 52 and 5432 or 45 and 75 octal. Other preferred pairs can include values
such as 53 5321, 5431, and 5421. The m-file will also check the cross-correlation
values between any two codes in the matrix and should be three valued (-9,-1,7). The
autocorrelation of a Gold code can also be checked. Some, not all, of the
Gold codes in the matrix are balanced (16 1 s and 15 -1 s). Platform: |
Size: 2048 |
Author:Chandra |
Hits:
Description: Multi-shift CGLS
solves the systems of linear equations
(A *A+TAU(I)*EYE(N))*X(:,I)=A *B (I=1:L)
for X with the multishift CGLS algorithm. The right hand side (column)
vector B must have length M, where the coefficient matrix A is M-by-N.
TAU is a vector of reals (the shifts) of length L.
For a short demo run main.m Platform: |
Size: 6144 |
Author:Ashraf |
Hits:
Description: The aim of this short workshop is to demonstrate the effectiveness of the JPEG encoding/decoding process using test data and test images. As explained in the lectures the major elements of the JPEG encoding process are the DCT, the non-uniform Quantisation matrix and variable run-length encoding.
Building an emulator of the JPEG encoding and decoding algorithm may appear a daunting task, but Matlab is well suited to such coding. Platform: |
Size: 93184 |
Author:jiang nan |
Hits:
Search - run length matrix