论文部分内容阅读
提出了一种图象块的分形近似方法。该方法借助于ＳＡＳ以达到对图象块的最小平方的分形近似，其运算量仅为２×Ｍ×Ｎ次乘法和４×Ｍ×Ｎ次加法，Ｍ×Ｎ为图象块大小。由图象块分形近似量化而成的编码，称之为分块分形近似编码。其压缩比依赖于所选取图象块大小和迭代变换系数的量化。对８×８图象块，在不失真情况下，其压缩比达到１７．８倍。通过对大量图象的实验结果表明，只需进行８次迭代，就能得到满意的重构图象。和其它分形编码相比，此方法简洁，编码速度快，对２２０×２２０的＂Ｌｅｎａ＂图象进行编码，在ＰＣ４８６／ＤＸ３３上，仅需时３０秒。
A fractal approximation method for image blocks is proposed. This method achieves the fractal approximation to the least squares of image blocks by means of SAS. The computational complexity is only 2 × M × N multiplications and 4 × M × N additions, and M × N is the image block size. From the image block fractal approximation of quantitative coding, called fractal fractal approximate coding. The compression ratio depends on the selected block size and the quantization of the iterative transform coefficients. For 8 × 8 image blocks, without distortion, the compression ratio reaches 17.8 times. The experimental results on a large number of images show that only 8 iterations are needed to obtain a satisfactory reconstructed image. Compared with other fractal coding, this method is concise and the coding speed is faster. It encodes the 220 × 220 “Lena” image, only 30 seconds on the PC486 / DX33.