一种分形图像编码的改进方法

在分析小波包变换和分形编码特点的基础上,先将图像进行小波包分解,对进一步细分的高频部分直接进行频域截断,对低频部分进行分形压缩.计算机模拟试验表明,上述方案与基本分形编码方法相比,在重建图像主观质量和运行时间上都显示出优越性.     

A secure and efficient entropy coding based on arithmetic coding

A novel security arithmetic coding scheme based on nonlinear dynamic filter (NDF) with changeable coefficients is proposed in this paper. The NDF is employed to generate the pseudorandom number generator (NDF-PRNG) and its coefficients are derived from the plaintext for higher security. During the encryption process, the mapping interval in each iteration of arithmetic coding (AC) is decided by both the plaintext and the initial values of NDF, and the data compression is also achieved with entropy optimality simultaneously. And this modification of arithmetic coding methodology which also provides security is easy to be expanded into the most international image and video standards as the last entropy coding stage without changing the existing framework. Theoretic analysis and numerical simulations both on static and adaptive model show that the proposed encryption algorithm satisfies highly security without loss of compression efficiency respect to a standard AC or computation burden.     

Fractal compression coding based on wavelet transform with diamond search

In this paper, a fractal image compression coding scheme based on wavelet transform with diamond search is proposed. The goal is to offer fast positioning. According to search pattern and search path of diamond search, the proposed scheme just needs to search in the domain blocks in the fixed place around the range blocks. Our proposed method has benefits in reducing the search time and enhancing the coding speed compared with other image compression techniques.     

An efficient fractal image coding algorithm using unified feature and DCT

Fractal image compression is a promising technique to improve the efficiency of image storage and image transmission with high compression ratio, however, the huge time consumption for the fractal image coding is a great obstacle to the practical applications. In order to improve the fractal image coding, efficient fractal image coding algorithms using a special unified feature and a DCT coder are proposed in this paper. Firstly, based on a necessary condition to the best matching search rule during fractal image coding, the fast algorithm using a special unified feature (UFC) is addressed, and it can reduce the search space obviously and exclude most inappropriate matching subblocks before the best matching search. Secondly, on the basis of UFC algorithm, in order to improve the quality of the reconstructed image, a DCT coder is combined to construct a hybrid fractal image algorithm (DUFC). Experimental results show that the proposed algorithms can obtain good quality of the reconstructed images and need much less time than the baseline fractal coding algorithm.     

3-D mesh sequence compression using wavelet-based multi-resolution analysis

In this paper, we present two compression methods for irregular three-dimensional (3-D) mesh sequences with constant connectivity. The proposed methods mainly use an exact integer spatial wavelet analysis (SWA) technique to efficiently decorrelate the spatial coherence of each mesh frame and also to adaptively transmit mesh frames with various spatial resolutions. To reduce the temporal redundancy, the first proposed method applies multi-order differential coding (MDC) to the temporal sequences obtained from SWA. MDC determines the optimal order of the differential coder by analyzing the variance of prediction errors. Comparing with the first order differential coding (FDC) scheme, the method can improve the compression performance. The second proposed method applies temporal wavelet analysis (TWA) to the temporal sequences. In particular, this method offers spatio-temporal multi-resolution coding. Through simulations, we prove that our methods enable efficient lossy-to-lossless compression for 3-D mesh sequences in a single frame work.     

Fast fractal image encoding using one-norm of normalised block

The baseline fractal image encoding with full search typically requires a very long encoding time, which is essentially spent on searching for the best-matched block to an input range block in a large domain pool. In this paper, one-norm of normalised block is first utilized to avoid the excessive search, in which the search process might be early terminated, and thus remaining domain blocks could be safely discarded. Then the encoding schemes proposed recently by the authors are used to further reduce the search space and improve the decoded image quality. Experiments show that, for three popular 512 × 512 test images, the proposed algorithm can averagely reduce the runtime by about 40 times while there is averagely the PSNR gain of 0.91 dB, in comparison with the baseline fractal algorithm. Besides, when combined with the kick-out condition and the zero contrast prediction proposed recently by Lai et al. [Lai CM, Lam KM, Siu WC. A fast fractal image coding based on kick-out and zero contrast conditions. IEEE Trans Image Process 2003:11;1398–403], the combined algorithm further reduced the runtime by about 10% while maintaining the same PSNR exactly as that of the proposed algorithm.     

GLS coding based security solution to JPEG with the structure of aggregated compression and encryption

There exists close relation among chaos, coding and cryptography. All the three can be combined into a whole as aggregated chaos-based coding and cryptography (ATC) to compress and encrypt data simultaneously. In particular, image data own high redundancy and wide transmission and thereby it is well worth doing research on ATC for image, which is very helpful to real application.JPEG with high compression ratio has not provided security. If JPEG is incorporated into powerful cryptographic features, its application can be further extended. For this reason, in this paper, GLS coding as a special form of ATC, which attains synchronous compression and encryption, is used to modify JPEG and fill its gap. An image is first initialized using DCT, quantization and run-length coding in turn, just as JPEG. Then, it is encoded and encrypted simultaneously by utilizing GLS coding and binary keystream resulting from the chaotic generator. Results demonstrate that our scheme can not only achieve good compression performance but also resist known/chosen-plaintext attacks efficiently.     

Matching search in fractal video compression and its parallel implementation in distributed computing environments

Fractal video compression is a relatively new video compression method. Its attraction is due to the high compression ratio and the simple decompression algorithm. But its computational complexity is high and as a result parallel algorithms on high performance machines become one way out. In this study we partition the matching search, which occupies the majority of the work in a fractal video compression process, into small tasks and implement them in two distributed computing environments, one using DCOM and the other using .NET Remoting technology, based on a local area network consists of loosely coupled PCs. Experimental results show that the parallel algorithm is able to achieve a high speedup in these distributed environments.     

A new approach based on the surrogating method in the project time compression problems

This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables, and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared by several numerical examples. Computational experience with these data shows the superiority of the new approach.     

Image magnification based on similarity analogy

Aiming at the high time complexity of the decoding phase in the traditional image enlargement methods based on fractal coding, a novel image magnification algorithm is proposed in this paper, which has the advantage of iteration-free decoding, by using the similarity analogy between an image and its zoom-out and zoom-in. A new pixel selection technique is also presented to further improve the performance of the proposed method. Furthermore, by combining some existing fractal zooming techniques, an efficient image magnification algorithm is obtained, which can provides the image quality as good as the state of the art while greatly decrease the time complexity of the decoding phase.     

A simple method for estimating the fractal dimension from digital images: The compression dimension

The fractal structure of real world objects is often analyzed using digital images. In this context, the compression fractal dimension is put forward. It provides a simple method for the direct estimation of the dimension of fractals stored as digital image files. The computational scheme can be implemented using readily available free software. Its simplicity also makes it very interesting for introductory elaborations of basic concepts of fractal geometry, complexity, and information theory. A test of the computational scheme using limited-quality images of well-defined fractal sets obtained from the Internet and free software has been performed. Also, a systematic evaluation of the proposed method using computer generated images of the Weierstrass cosine function shows an accuracy comparable to those of the methods most commonly used to estimate the dimension of fractal data sequences applied to the same test problem.     

Three-Dimensional Embedded Subband Coding with Optimized Truncation (3-D ESCOT)

This paper presents an efficient video coding algorithm: Three-dimensional embedded subband coding with optimized truncation (3-D ESCOT), in which coefficients in different subbands are independently coded using fractional bit-plane coding and candidate truncation points are formed at the end of each fractional bit-plane. A rate-distortion optimized truncation scheme is used to multiplex all subband bitstreams together into a layered one. A novel motion threading technique is proposed to form threads along the motion trajectories in a scene. For efficient coding of motion threads, memory-constrained temporal wavelet transforms are applied along entire motion threads. Block-based motion threading is implemented in conjunction with 3-D ESCOT in a real video coder. Extension of 3-D ESCOT to object-based coding is also addressed. Experiments demonstrate that 3-D ESCOT outperforms MPEG-4 for most test sequences at the same bit rate.     

End-to-end QoS issues of MPEG-4 FGS video streaming traffic delivery in an IP/DVB/UMTS network

The paper addresses the end-to-end QoS problem of MPEG-4 FGS video streaming traffic delivery over a heterogeneous IP/DVB/UMTS network. It proposes and validates an architecture that explores the joint use of packet prioritization and scalable video coding together with the appropriate mapping of UMTS traffic classes to the DiffServ traffic classes. A set of experimental scenarios, involving eight different video sequences, demonstrates the quality gains of both scalable video coding and prioritized packetization.     

利用格蕴涵代数找出所有LI-理想的方法

利用格蕴涵代数中理想的定义未找出所有的理想需要花费大量的时间.给出了利用格蕴涵代数的蕴涵运算表找出格蕴涵代数所有理想的方法;再利用析取运算表找出格蕴涵代数中所有sl_理想的方法;最后,利用蕴涵否运算表找出格蕴涵代数中所有LI-理想的方法.     

具有一定消失矩的优化线性相位滤波器

利用消失矩特性和编码误差最小,给出了一类有限长线性相位的双正交小波滤波器组BNVF的构造方法,BNVF的综合低通和分解高通的系数为二进分数,将其用于图像的分解与重构时,可避免一些乘法运算．三组BNVF用于图像变换编码时,其压缩性能不亚于Cohen,Daubechies等构造的9／7步滤波器组CDF-9／7,且计算复杂度更低．     

The movement towards a more experimental approach to problem solving in mathematics using coding

Motivated by a problem proposed in a coding competition for secondary students, I will show on this paper how coding substantially changed the problem-solving process towards a more experimental approach.     

Efficient image or video encryption based on spatiotemporal chaos system

In this paper, an efficient image/video encryption scheme is constructed based on spatiotemporal chaos system. The chaotic lattices are used to generate pseudorandom sequences and then encrypt image blocks one by one. By iterating chaotic maps for certain times, the generated pseudorandom sequences obtain high initial-value sensitivity and good randomness. The pseudorandom-bits in each lattice are used to encrypt the Direct Current coefficient (DC) and the signs of the Alternating Current coefficients (ACs). Theoretical analysis and experimental results show that the scheme has good cryptographic security and perceptual security, and it does not affect the compression efficiency apparently. These properties make the scheme a suitable choice for practical applications.     

部分联合运输策略下的物流车辆路径优化问题研究

论文分析了物流车辆路径优化问题的特点,提出了企业自营物流和第三方物流协同运输的部分联合运输策略。根据客户需求节点的特点进行了节点分类,建立了以车辆调用成本、车辆运输成本、第三方物流运输成本之和最小为目标的整数线性规划模型。根据部分联合运输策略下各类客户需求点运输方式特点,构造了一种新的变维数矩阵编码结构,并对传统算法中概率选择操作方式进行修改,提出了一种新的智能优化算法并与枚举法和遗传算法的运算结果进行了算法性能对比分析。结果显示,本文提出的逆选择操作蚁群算法具有较快的运算速度和较高的稳定性,是求解此类问题的一种有效算法。     

基于小波分形理论的股价指数信息量测度研究

本把小波分析和分形理论引入到股价指数时间序列的分析中，给出了股价指数波动复杂性的信息量测度方法——信息熵和分形维方法。通过对上证综指和深证成指1994年1月3日至2002年3月4日期间的数据进行的实证分析显示，两种方法均能刻画股价指数波动的复杂程度，这对初步了解我国股市场的波动规律有一定的实际意义。     

Dynamics about Neural Array with Simple Lateral Inhibitory Connections

Lateral inhibitory effect is a well-known feature of information processing in neural systems. This paper presents a neural array model with simple lateral inhibitory connections. After detailed examining into the dynamics of this kind of neural array, the author gives the sufficient conditions under which the outputs of the network will tend to a special stable pattern called spatial sparse pattern in which if the output of a neuron is 1, then the outputs of the neurons in its neighborhood are 0. This ability called spatial sparse coding plays an important role in self-coding, self-organization and associative memory for patterns and pattern sequences. The main conclusions about the dynamics of this kind of neural array which is related to spatial sparse coding are introduced.