Making use of the theory of continuous homotopy and the relation betweensymmetric polynomtal and polynomtal in one variable the arthors devoted ims article to constructing a regularly homotopic curve with probability ...Making use of the theory of continuous homotopy and the relation betweensymmetric polynomtal and polynomtal in one variable the arthors devoted ims article to constructing a regularly homotopic curve with probability one. Discrete tracingalong this honlotopic curve leads 10 a class of Durand-Kerner algorithm with stepparameters. The convergernce of this class of algorithms is given, which solves theconjecture about the global property of Durand-Kerner algorithm. The.problem forsteplength selection is thoroughly discussed Finally, sufficient numerical examples areused to verify our theory展开更多
Arithmetic coding is a relatively new loss-less data compression technique that has attracted much attention in recent years. We show the iteration of bit-level arithmetic coding can be specified by a continuous funct...Arithmetic coding is a relatively new loss-less data compression technique that has attracted much attention in recent years. We show the iteration of bit-level arithmetic coding can be specified by a continuous function. The analysis expression and some properties of this function are discussed. An application of the function is provided for exploring the security of arithmetic codes when they are used for data encryption.展开更多
Motivated by wavelet transform, this paper presents a pyramid linear prediction coding (PLPC) algorithmfor digitial images.The algorithm otltpots the rough colltour of an image and a prediction ermr sequence. In contr...Motivated by wavelet transform, this paper presents a pyramid linear prediction coding (PLPC) algorithmfor digitial images.The algorithm otltpots the rough colltour of an image and a prediction ermr sequence. In contrastto the conventional linear prediction method, PLPC exhibits very little sensitivity to channel ermrs and provides amore efficient compression performance. The results of simulations with Lena 512 X 512 and bitrates ranging from0.17 to 3.2 (lossless)bits/pixel are given to show that the PLPC method is very suitable for the human visualperception.展开更多
文摘Making use of the theory of continuous homotopy and the relation betweensymmetric polynomtal and polynomtal in one variable the arthors devoted ims article to constructing a regularly homotopic curve with probability one. Discrete tracingalong this honlotopic curve leads 10 a class of Durand-Kerner algorithm with stepparameters. The convergernce of this class of algorithms is given, which solves theconjecture about the global property of Durand-Kerner algorithm. The.problem forsteplength selection is thoroughly discussed Finally, sufficient numerical examples areused to verify our theory
文摘Arithmetic coding is a relatively new loss-less data compression technique that has attracted much attention in recent years. We show the iteration of bit-level arithmetic coding can be specified by a continuous function. The analysis expression and some properties of this function are discussed. An application of the function is provided for exploring the security of arithmetic codes when they are used for data encryption.
文摘Motivated by wavelet transform, this paper presents a pyramid linear prediction coding (PLPC) algorithmfor digitial images.The algorithm otltpots the rough colltour of an image and a prediction ermr sequence. In contrastto the conventional linear prediction method, PLPC exhibits very little sensitivity to channel ermrs and provides amore efficient compression performance. The results of simulations with Lena 512 X 512 and bitrates ranging from0.17 to 3.2 (lossless)bits/pixel are given to show that the PLPC method is very suitable for the human visualperception.
