CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - fast_lot
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - fast_lot - List
[
source in ebook
]
dsp_solutions_and_ppt_matlab_sourcefile
DL : 0
清华大学胡广书教授< 数字信号处理理论算法实现>>第二版一书的配套题解和电子课件一书《数字信号处理题解及电子课件》(2007年5月出版)的matlab源程序。-Tsinghua University Professor Hu Guangshu
Update
: 2025-02-17
Size
: 47kb
Publisher
:
薛正亮
[
matlab
]
fast_LOT
DL : 0
lot重叠正交变换快速算法,matlab源代码。-lot lapped orthogonal transform fast algorithm, matlab source code.
Update
: 2025-02-17
Size
: 1kb
Publisher
:
shirley
[
matlab
]
fast_LOT
DL : 0
作为8-9-3的子程序,其中M=8,该程序实现了重叠正交变换。-Subroutine as 8-9-3, where M = 8, the program implements the overlapping orthogonal transformation.
Update
: 2025-02-17
Size
: 1kb
Publisher
:
wine
[
Special Effects
]
fast_LOT
DL : 0
运用近似最佳LOT,对图像进行处理,从而进行比较优异的压缩-The use of best approximation LOT, the image processing, compression and thus excellent comparison
Update
: 2025-02-17
Size
: 1kb
Publisher
:
you
[
matlab
]
tuxiangyasuo
DL : 0
(1)试利用函数dct2,对该图像进行压缩。压缩时可尝试对DCT 变换后的系数采用不同取舍方法,比较其压缩性能。(函数dct2在matlab本身是有的,可以help dct2看看) (2)结合课本例8.7.2 的量化方法,对每一个经DCT变换后的8×8 矩阵量化(Huffman编码部分可省略),从而实现图像压缩。在一定压缩比的情况下,和⑴给出的图像质量相比较。 (3)用所给的子子程序fast_LOT.m 实现对该图像的变换与压缩,并和(1)得出的图像质量相比较-(1) Test using function dct2, the image is compressed. The compression can try to adopt different choices, the DCT transform coefficients after comparing its compression performance. (Function dct2 the matlab itself is some help dct2 see) (2) combined with the textbook cases 8.7.2 of quantitative methods, 88 each DCT transform matrix quantization (Huffman encoding part can be omitted) thereby achieving the image compression. In the case of a certain compression ratio, and the image quality given by the ⑴ compared. (3) with the given sub-subroutine fast_LOT.m transform and compress the image, and (1) gives the image quality compared
Update
: 2025-02-17
Size
: 197kb
Publisher
:
zrf
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.