Through a series of studies on arithmetic coding and arithmetic encryption, a novel image joint compression- encryption algorithm based on adaptive arithmetic coding is proposed. The contexts produced in the process o...Through a series of studies on arithmetic coding and arithmetic encryption, a novel image joint compression- encryption algorithm based on adaptive arithmetic coding is proposed. The contexts produced in the process of image compression are modified by keys in order to achieve image joint compression encryption. Combined with the bit-plane coding technique, the discrete wavelet transform coefficients in different resolutions can be encrypted respectively with different keys, so that the resolution selective encryption is realized to meet different application needs. Zero-tree coding is improved, and adaptive arithmetic coding is introduced. Then, the proposed joint compression-encryption algorithm is simulated. The simulation results show that as long as the parameters are selected appropriately, the compression efficiency of proposed image joint compression-encryption algorithm is basically identical to that of the original image compression algorithm, and the security of the proposed algorithm is better than the joint encryption algorithm based on interval splitting.展开更多
This paper proposes an efficient lossless image compression scheme for still images based on an adaptive arithmetic coding compression algorithm. The algorithm increases the image coding compression rate and ensures t...This paper proposes an efficient lossless image compression scheme for still images based on an adaptive arithmetic coding compression algorithm. The algorithm increases the image coding compression rate and ensures the quality of the decoded image combined with the adaptive probability model and predictive coding. The use of adaptive models for each encoded image block dynamically estimates the probability of the relevant image block. The decoded image block can accurately recover the encoded image according to the code book information. We adopt an adaptive arithmetic coding algorithm for image compression that greatly improves the image compression rate. The results show that it is an effective compression technology.展开更多
This paper presents a new method of lossless image compression. An image is characterized by homogeneous parts. The bit planes, which are of high weight are characterized by sequences of 0 and 1 are successive encoded...This paper presents a new method of lossless image compression. An image is characterized by homogeneous parts. The bit planes, which are of high weight are characterized by sequences of 0 and 1 are successive encoded with RLE, whereas the other bit planes are encoded by the arithmetic coding (AC) (static or adaptive model). By combining an AC (adaptive or static) with the RLE, a high degree of adaptation and compression efficiency is achieved. The proposed method is compared to both static and adaptive model. Experimental results, based on a set of 12 gray-level images, demonstrate that the proposed scheme gives mean compression ratio that are higher those compared to the conventional arithmetic encoders.展开更多
Due to the development of CT (Computed Tomography), MRI (Magnetic Resonance Imaging), PET (Positron Emission Tomography), EBCT (Electron Beam Computed Tomography), SMRI (Stereotactic Magnetic Resonance Imaging), etc. ...Due to the development of CT (Computed Tomography), MRI (Magnetic Resonance Imaging), PET (Positron Emission Tomography), EBCT (Electron Beam Computed Tomography), SMRI (Stereotactic Magnetic Resonance Imaging), etc. has enhanced the distinguishing rate and scanning rate of the imaging equipments. The diagnosis and the process of getting useful information from the image are got by processing the medical images using the wavelet technique. Wavelet transform has increased the compression rate. Increasing the compression performance by minimizing the amount of image data in the medical images is a critical task. Crucial medical information like diagnosing diseases and their treatments is obtained by modern radiology techniques. Medical Imaging (MI) process is used to acquire that information. For lossy and lossless image compression, several techniques were developed. Image edges have limitations in capturing them if we make use of the extension of 1-D wavelet transform. This is because wavelet transform cannot effectively transform straight line discontinuities, as well geographic lines in natural images cannot be reconstructed in a proper manner if 1-D transform is used. Differently oriented image textures are coded well using Curvelet Transform. The Curvelet Transform is suitable for compressing medical images, which has more curvy portions. This paper describes a method for compression of various medical images using Fast Discrete Curvelet Transform based on wrapping technique. After transformation, the coefficients are quantized using vector quantization and coded using arithmetic encoding technique. The proposed method is tested on various medical images and the result demonstrates significant improvement in performance parameters like Peak Signal to Noise Ratio (PSNR) and Compression Ratio (CR).展开更多
Accurately modeling real network dynamics is a grand challenge in network science.The network dynamics arise from node interactions,which are shaped by network topology.Real networks tend to exhibit compact or highly ...Accurately modeling real network dynamics is a grand challenge in network science.The network dynamics arise from node interactions,which are shaped by network topology.Real networks tend to exhibit compact or highly optimized topologies.But the key problems arise:how to compress a network to best enhance its compactness,and what the compression limit of the network reflects?We abstract the topological compression of complex networks as a dynamic process of making them more compact and propose the local compression modulus that plays a key role in effective compression evolution of networks.Subsequently,we identify topological compressibility-a general property of complex networks that characterizes the extent to which a network can be compressed-and provide its approximate quantification.We anticipate that our findings and established theory will provide valuable insights into both dynamics and various applications of complex networks.展开更多
The high temperature deformation behaviors of α＋β type titanium alloy TC11 （Ti-6.5Al-3.5Mo-1.5Zr-0.3Si） with coarse lamellar starting microstructure were investigated based on the hot compression tests in the tem...The high temperature deformation behaviors of α＋β type titanium alloy TC11 （Ti-6.5Al-3.5Mo-1.5Zr-0.3Si） with coarse lamellar starting microstructure were investigated based on the hot compression tests in the temperature range of 950-1100 ℃ and the strain rate range of 0.001-10 s-1. The processing maps at different strains were then constructed based on the dynamic materials model, and the hot compression process parameters and deformation mechanism were optimized and analyzed, respectively. The results show that the processing maps exhibit two domains with a high efficiency of power dissipation and a flow instability domain with a less efficiency of power dissipation. The types of domains were characterized by convergence and divergence of the efficiency of power dissipation, respectively. The convergent domain in a＋fl phase field is at the temperature of 950-990 ℃ and the strain rate of 0.001-0.01 s^-1, which correspond to a better hot compression process window of α＋β phase field. The peak of efficiency of power dissipation in α＋β phase field is at 950 ℃ and 0.001 s 1, which correspond to the best hot compression process parameters of α＋β phase field. The convergent domain in β phase field is at the temperature of 1020-1080 ℃ and the strain rate of 0.001-0.1 s^-l, which correspond to a better hot compression process window of β phase field. The peak of efficiency of power dissipation in ℃ phase field occurs at 1050 ℃ over the strain rates from 0.001 s^-1 to 0.01 s^-1, which correspond to the best hot compression process parameters of ,8 phase field. The divergence domain occurs at the strain rates above 0.5 s^-1 and in all the tested temperature range, which correspond to flow instability that is manifested as flow localization and indicated by the flow softening phenomenon in stress-- strain curves. The deformation mechanisms of the optimized hot compression process windows in a＋β and β phase fields are identified to be spheroidizing and dynamic recrystallizing controlled by self-diffusion mechanism, respectively. The microstructure observation of the deformed specimens in different domains matches very well with the optimized results.展开更多
For protecting the copyright of a text and recovering its original content harmlessly,this paper proposes a novel reversible natural language watermarking method that combines arithmetic coding and synonym substitutio...For protecting the copyright of a text and recovering its original content harmlessly,this paper proposes a novel reversible natural language watermarking method that combines arithmetic coding and synonym substitution operations.By analyzing relative frequencies of synonymous words,synonyms employed for carrying payload are quantized into an unbalanced and redundant binary sequence.The quantized binary sequence is compressed by adaptive binary arithmetic coding losslessly to provide a spare for accommodating additional data.Then,the compressed data appended with the watermark are embedded into the cover text via synonym substitutions in an invertible manner.On the receiver side,the watermark and compressed data can be extracted by decoding the values of synonyms in the watermarked text,as a result of which the original context can be perfectly recovered by decompressing the extracted compressed data and substituting the replaced synonyms with their original synonyms.Experimental results demonstrate that the proposed method can extract the watermark successfully and achieve a lossless recovery of the original text.Additionally,it achieves a high embedding capacity.展开更多
In this paper, we analyse a new chaos-based cryptosystem with an embedded adaptive arithmetic coder, which was proposed by Li Heng-Jian and Zhang J S （Li H J and Zhang J S 2010 Chin. Phys. B 19 050508）. Although thi...In this paper, we analyse a new chaos-based cryptosystem with an embedded adaptive arithmetic coder, which was proposed by Li Heng-Jian and Zhang J S （Li H J and Zhang J S 2010 Chin. Phys. B 19 050508）. Although this new method has a better compression performance than its original version, it is found that there are some problems with its security and decryption processes. In this paper, it is shown how to obtain a great deal of plain text from the cipher text without prior knowledge of the secret key. After discussing the security and decryption problems of the Li Heng-Jian et al. algorithm, we propose an improved chaos-based cryptosystem with an embedded adaptive arithmetic coder that is more secure.展开更多
A comparison of arithmetic operations of two dynamic process optimization approaches called quasi-sequential approach and reduced Sequential Quadratic Programming(rSQP)simultaneous approach with respect to equality co...A comparison of arithmetic operations of two dynamic process optimization approaches called quasi-sequential approach and reduced Sequential Quadratic Programming(rSQP)simultaneous approach with respect to equality constrained optimization problems is presented.Through the detail comparison of arithmetic operations,it is concluded that the average iteration number within differential algebraic equations(DAEs)integration of quasi-sequential approach could be regarded as a criterion.One formula is given to calculate the threshold value of average iteration number.If the average iteration number is less than the threshold value,quasi-sequential approach takes advantage of rSQP simultaneous approach which is more suitable contrarily.Two optimal control problems are given to demonstrate the usage of threshold value.For optimal control problems whose objective is to stay near desired operating point,the iteration number is usually small.Therefore,quasi-sequential approach seems more suitable for such problems.展开更多
The optimal design of a compression refrigeration system(CRS) with multiple temperature levels is very important to chemical process industries and also represents considerable challenges in process systems engineerin...The optimal design of a compression refrigeration system(CRS) with multiple temperature levels is very important to chemical process industries and also represents considerable challenges in process systems engineering. In this paper, a general methodology for the optimal synthesis of the CRS, which simultaneously integrates CRS and Heat Exchanger Networks(HEN) to minimize the total compressor shaft work consumption based on an MINLP model, has been proposed. The major contribution of this method is in addressing the optimal design of refrigeration cycle with variable refrigeration temperature levels. The method can be used to make major decisions in the CRS design, such as the number of levels, temperature levels, and heat transfer duties. The performance of the developed methodology has been illustrated with a case study of an ethylene CRS in an industrial ethylene plant, and the optimal solution has been examined by rigorous simulations in Aspen Plus to verify its feasibility and consistency.展开更多
In this study an adaptive arithmetic coder is embedded in the Baptista-type chaotic cryptosystem for implementing secure data compression. To build the multiple lookup tables of secure data compression, the phase spac...In this study an adaptive arithmetic coder is embedded in the Baptista-type chaotic cryptosystem for implementing secure data compression. To build the multiple lookup tables of secure data compression, the phase space of chaos map with a uniform distribution in the search mode is divided non-uniformly according to the dynamic probability estimation of plaintext symbols. As a result, more probable symbols are selected according to the local statistical characters of plaintext and the required number of iterations is small since the more probable symbols have a higher chance to be visited by the chaotic search trajectory. By exploiting non-uniformity in the probabilities under which a number of iteration to be coded takes on its possible values, the compression capability is achieved by adaptive arithmetic code. Therefore, the system offers both compression and security. Compared with original arithmetic coding, simulation results on Calgary Corpus files show that the proposed scheme suffers from a reduction in compression performance less than 12% and is not susceptible to previously carried out attacks on arithmetic coding algorithms.展开更多
The method of data compression, using orthogonal transform, is introduced so as to insure the minimal distortion of signal restoration. It, featured with transformation, can compress the data according to the needed p...The method of data compression, using orthogonal transform, is introduced so as to insure the minimal distortion of signal restoration. It, featured with transformation, can compress the data according to the needed precision. The ratio of compressed data is closely related to precision. The results show it to be favorable to different kinds of data compression.展开更多
Though progress has been made in fractal compression techniques, the longencoding times still remain the main drawback of this technique, which results from the need ofperforming a large number of range-domain matches...Though progress has been made in fractal compression techniques, the longencoding times still remain the main drawback of this technique, which results from the need ofperforming a large number of range-domain matches. The total encoding time is the sum of the timerequired to perform each match. In order to make this method more efficient in practical use, thefuzzy theory based on feature extraction of the projection and normalized codebook method has beenprovided to optimize the encoding time, based on the c-means clustering approach. The results of theimplementation of Rate Mean Square (RMS), Peak signal noise ratio (PSNR) and the encoding time ofthis proposed method have been compared to other methods like the Feature Extraction andSelf-orgarnization methods to show its efficiency.展开更多
This paper proposes an enhanced arithmetic optimization algorithm(AOA)called PSAOA that incorporates the proposed probabilistic search strategy to increase the searching quality of the original AOA.Furthermore,an adju...This paper proposes an enhanced arithmetic optimization algorithm(AOA)called PSAOA that incorporates the proposed probabilistic search strategy to increase the searching quality of the original AOA.Furthermore,an adjustable parameter is also developed to balance the exploration and exploitation operations.In addition,a jump mechanism is included in the PSAOAto assist individuals in jumping out of local optima.Using 29 classical benchmark functions,the proposed PSAOA is extensively tested.Compared to the AOA and other well-known methods,the experiments demonstrated that the proposed PSAOA beats existing comparison algorithms on the majority of the test functions.展开更多
In this paper, we present a method using video codec technology to compress ECG signals. This method exploits both intra-beat and inter-beat correlations of the ECG signals to achieve high compression ratios (CR) and ...In this paper, we present a method using video codec technology to compress ECG signals. This method exploits both intra-beat and inter-beat correlations of the ECG signals to achieve high compression ratios (CR) and a low percent root mean square difference (PRD). Since ECG signals have both intra-beat and inter-beat redundancies like video signals, which have both intra-frame and inter-frame correlation, video codec technology can be used for ECG compression. In order to do this, some pre-process will be needed. The ECG signals should firstly be segmented and normalized to a sequence of beat cycles with the same length, and then these beat cycles can be treated as picture frames and compressed with video codec technology. We have used records from MIT-BIH arrhythmia database to evaluate our algorithm. Results show that, besides compression efficiently, this algorithm has the advantages of resolution adjustable, random access and flexibility for irregular period and QRS false detection.展开更多
Compression of short text strings, such as the GSM Short Message Service (SMS) and Twitter messages, has received relatively little attention compared to the compression of longer texts. This is not surprising given t...Compression of short text strings, such as the GSM Short Message Service (SMS) and Twitter messages, has received relatively little attention compared to the compression of longer texts. This is not surprising given that for typical cellular and internet-based networks, the cost of compression probably outweighs the cost of delivering uncompressed messages. However, this is not necessarily true in the case where the cost of data transport is high, for example, where satellite back-haul is involved, or on bandwidth-starved mobile mesh networks, such as the mesh networks for disaster relief, rural, remote and developing contexts envisaged by the Serval Project [1-4]. This motivated the development of a state-of-art text compression algorithm that could be used to compress mesh-based short-message traffic, culminating in the development of the stats3 SMS compression scheme described in this paper. Stats3 uses word frequency and 3rd-order letter statistics embodied in a pre-constructed dictionary to affect lossless compression of short text messages. This scheme shows that our scheme compressing text messages typically reduces messages to less than half of their original size, and in so doing substantially outperforms all public SMS compression systems, while also matching or exceeding the marketing claims of the commercial options known to the authors. We also outline approaches for future work that has the potential to further improve the performance and practical utility of stats3.展开更多
In the present paper, we answer the question: for 0a what are the greatest value p(a) and the least value q(a) such that the double inequality Jp(a,b)aA(a,b)+ (1-a)G(a,b)Jq(a,b) holds for all a,b>0 with a is not eq...In the present paper, we answer the question: for 0a what are the greatest value p(a) and the least value q(a) such that the double inequality Jp(a,b)aA(a,b)+ (1-a)G(a,b)Jq(a,b) holds for all a,b>0 with a is not equal to?b ?展开更多
Compressed sensing(CS),as an efficient data transmission method,has achieved great success in the field of data transmission such as image,video and text.It can robustly recover signals from fewer Measurements,effecti...Compressed sensing(CS),as an efficient data transmission method,has achieved great success in the field of data transmission such as image,video and text.It can robustly recover signals from fewer Measurements,effectively alleviating the bandwidth pressure during data transmission.However,CS has many shortcomings in the transmission of hyperspectral image(HSI)data.This work aims to consider the application of CS in the transmission of hyperspectral image(HSI)data,and provides a feasible research scheme for CS of HSI data.HSI has rich spectral information and spatial information in bands,which can reflect the physical properties of the target.Most of the hyperspectral image compressed sensing(HSICS)algorithms cannot effectively use the inter-band information of HSI,resulting in poor reconstruction effects.In this paper,A three-stage hyperspectral image compression sensing algorithm(Three-stages HSICS)is proposed to obtain intra-band and inter-band characteristics of HSI,which can improve the reconstruction accuracy of HSI.Here,we establish a multi-objective band selection(Mop-BS)model,amulti-hypothesis prediction(MHP)model and a residual sparse(ReWSR)model for HSI,and use a staged reconstruction method to restore the compressed HSI.The simulation results show that the three-stage HSICS successfully improves the reconstruction accuracy of HSICS,and it performs best among all comparison algorithms.展开更多
基金supported by the Natural Science Foundation of Hainan Province, China (Grant No. 613155)
文摘Through a series of studies on arithmetic coding and arithmetic encryption, a novel image joint compression- encryption algorithm based on adaptive arithmetic coding is proposed. The contexts produced in the process of image compression are modified by keys in order to achieve image joint compression encryption. Combined with the bit-plane coding technique, the discrete wavelet transform coefficients in different resolutions can be encrypted respectively with different keys, so that the resolution selective encryption is realized to meet different application needs. Zero-tree coding is improved, and adaptive arithmetic coding is introduced. Then, the proposed joint compression-encryption algorithm is simulated. The simulation results show that as long as the parameters are selected appropriately, the compression efficiency of proposed image joint compression-encryption algorithm is basically identical to that of the original image compression algorithm, and the security of the proposed algorithm is better than the joint encryption algorithm based on interval splitting.
基金supported by the National Natural Science Foundation of China (Grant Nos. 60573172 and 60973152)the Superior University Doctor Subject Special Scientific Research Foundation of China (Grant No. 20070141014)the Natural Science Foundation of Liaoning Province of China (Grant No. 20082165)
文摘This paper proposes an efficient lossless image compression scheme for still images based on an adaptive arithmetic coding compression algorithm. The algorithm increases the image coding compression rate and ensures the quality of the decoded image combined with the adaptive probability model and predictive coding. The use of adaptive models for each encoded image block dynamically estimates the probability of the relevant image block. The decoded image block can accurately recover the encoded image according to the code book information. We adopt an adaptive arithmetic coding algorithm for image compression that greatly improves the image compression rate. The results show that it is an effective compression technology.
文摘This paper presents a new method of lossless image compression. An image is characterized by homogeneous parts. The bit planes, which are of high weight are characterized by sequences of 0 and 1 are successive encoded with RLE, whereas the other bit planes are encoded by the arithmetic coding (AC) (static or adaptive model). By combining an AC (adaptive or static) with the RLE, a high degree of adaptation and compression efficiency is achieved. The proposed method is compared to both static and adaptive model. Experimental results, based on a set of 12 gray-level images, demonstrate that the proposed scheme gives mean compression ratio that are higher those compared to the conventional arithmetic encoders.
文摘Due to the development of CT (Computed Tomography), MRI (Magnetic Resonance Imaging), PET (Positron Emission Tomography), EBCT (Electron Beam Computed Tomography), SMRI (Stereotactic Magnetic Resonance Imaging), etc. has enhanced the distinguishing rate and scanning rate of the imaging equipments. The diagnosis and the process of getting useful information from the image are got by processing the medical images using the wavelet technique. Wavelet transform has increased the compression rate. Increasing the compression performance by minimizing the amount of image data in the medical images is a critical task. Crucial medical information like diagnosing diseases and their treatments is obtained by modern radiology techniques. Medical Imaging (MI) process is used to acquire that information. For lossy and lossless image compression, several techniques were developed. Image edges have limitations in capturing them if we make use of the extension of 1-D wavelet transform. This is because wavelet transform cannot effectively transform straight line discontinuities, as well geographic lines in natural images cannot be reconstructed in a proper manner if 1-D transform is used. Differently oriented image textures are coded well using Curvelet Transform. The Curvelet Transform is suitable for compressing medical images, which has more curvy portions. This paper describes a method for compression of various medical images using Fast Discrete Curvelet Transform based on wrapping technique. After transformation, the coefficients are quantized using vector quantization and coded using arithmetic encoding technique. The proposed method is tested on various medical images and the result demonstrates significant improvement in performance parameters like Peak Signal to Noise Ratio (PSNR) and Compression Ratio (CR).
基金supported inpart by the National Natural Science Foundation of China(Grant No. 12371088)the Innovative Research Group Project of Natural Science Foundation of Hunan Provinceof China (Grant No. 2024JJ1008)in part by the Australian Research Council (ARC) through the Discovery Projects scheme (Grant No. DP220100580)。
文摘Accurately modeling real network dynamics is a grand challenge in network science.The network dynamics arise from node interactions,which are shaped by network topology.Real networks tend to exhibit compact or highly optimized topologies.But the key problems arise:how to compress a network to best enhance its compactness,and what the compression limit of the network reflects?We abstract the topological compression of complex networks as a dynamic process of making them more compact and propose the local compression modulus that plays a key role in effective compression evolution of networks.Subsequently,we identify topological compressibility-a general property of complex networks that characterizes the extent to which a network can be compressed-and provide its approximate quantification.We anticipate that our findings and established theory will provide valuable insights into both dynamics and various applications of complex networks.
基金Project (51005112) supported by the National Natural Science Foundation of ChinaProject (2010ZF56019) supported by the Aviation Science Foundation of China+1 种基金Project (GJJ11156) supported by the Education Commission of Jiangxi Province, ChinaProject(GF200901008) supported by the Open Fund of National Defense Key Disciplines Laboratory of Light Alloy Processing Science and Technology, China
文摘The high temperature deformation behaviors of α＋β type titanium alloy TC11 （Ti-6.5Al-3.5Mo-1.5Zr-0.3Si） with coarse lamellar starting microstructure were investigated based on the hot compression tests in the temperature range of 950-1100 ℃ and the strain rate range of 0.001-10 s-1. The processing maps at different strains were then constructed based on the dynamic materials model, and the hot compression process parameters and deformation mechanism were optimized and analyzed, respectively. The results show that the processing maps exhibit two domains with a high efficiency of power dissipation and a flow instability domain with a less efficiency of power dissipation. The types of domains were characterized by convergence and divergence of the efficiency of power dissipation, respectively. The convergent domain in a＋fl phase field is at the temperature of 950-990 ℃ and the strain rate of 0.001-0.01 s^-1, which correspond to a better hot compression process window of α＋β phase field. The peak of efficiency of power dissipation in α＋β phase field is at 950 ℃ and 0.001 s 1, which correspond to the best hot compression process parameters of α＋β phase field. The convergent domain in β phase field is at the temperature of 1020-1080 ℃ and the strain rate of 0.001-0.1 s^-l, which correspond to a better hot compression process window of β phase field. The peak of efficiency of power dissipation in ℃ phase field occurs at 1050 ℃ over the strain rates from 0.001 s^-1 to 0.01 s^-1, which correspond to the best hot compression process parameters of ,8 phase field. The divergence domain occurs at the strain rates above 0.5 s^-1 and in all the tested temperature range, which correspond to flow instability that is manifested as flow localization and indicated by the flow softening phenomenon in stress-- strain curves. The deformation mechanisms of the optimized hot compression process windows in a＋β and β phase fields are identified to be spheroidizing and dynamic recrystallizing controlled by self-diffusion mechanism, respectively. The microstructure observation of the deformed specimens in different domains matches very well with the optimized results.
基金This project is supported by National Natural Science Foundation of China(No.61202439)partly supported by Scientific Research Foundation of Hunan Provincial Education Department of China(No.16A008)partly supported by Hunan Key Laboratory of Smart Roadway and Cooperative Vehicle-Infrastructure Systems(No.2017TP1016).
文摘For protecting the copyright of a text and recovering its original content harmlessly,this paper proposes a novel reversible natural language watermarking method that combines arithmetic coding and synonym substitution operations.By analyzing relative frequencies of synonymous words,synonyms employed for carrying payload are quantized into an unbalanced and redundant binary sequence.The quantized binary sequence is compressed by adaptive binary arithmetic coding losslessly to provide a spare for accommodating additional data.Then,the compressed data appended with the watermark are embedded into the cover text via synonym substitutions in an invertible manner.On the receiver side,the watermark and compressed data can be extracted by decoding the values of synonyms in the watermarked text,as a result of which the original context can be perfectly recovered by decompressing the extracted compressed data and substituting the replaced synonyms with their original synonyms.Experimental results demonstrate that the proposed method can extract the watermark successfully and achieve a lossless recovery of the original text.Additionally,it achieves a high embedding capacity.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 60573172 and 60973152)the Doctoral Program Foundation of Institution of Higher Education of China (Grant No. 20070141014)the Natural Science Foundation of Liaoning Province of China (Grant No. 20082165)
文摘In this paper, we analyse a new chaos-based cryptosystem with an embedded adaptive arithmetic coder, which was proposed by Li Heng-Jian and Zhang J S （Li H J and Zhang J S 2010 Chin. Phys. B 19 050508）. Although this new method has a better compression performance than its original version, it is found that there are some problems with its security and decryption processes. In this paper, it is shown how to obtain a great deal of plain text from the cipher text without prior knowledge of the secret key. After discussing the security and decryption problems of the Li Heng-Jian et al. algorithm, we propose an improved chaos-based cryptosystem with an embedded adaptive arithmetic coder that is more secure.
基金Supported by the National Natural Science Foundation of China（20676117） the National Creative Research Groups Science Foundation of China（60421002）
文摘A comparison of arithmetic operations of two dynamic process optimization approaches called quasi-sequential approach and reduced Sequential Quadratic Programming(rSQP)simultaneous approach with respect to equality constrained optimization problems is presented.Through the detail comparison of arithmetic operations,it is concluded that the average iteration number within differential algebraic equations(DAEs)integration of quasi-sequential approach could be regarded as a criterion.One formula is given to calculate the threshold value of average iteration number.If the average iteration number is less than the threshold value,quasi-sequential approach takes advantage of rSQP simultaneous approach which is more suitable contrarily.Two optimal control problems are given to demonstrate the usage of threshold value.For optimal control problems whose objective is to stay near desired operating point,the iteration number is usually small.Therefore,quasi-sequential approach seems more suitable for such problems.
基金Supported by the National Natural Science Foundation of China(21676183)
文摘The optimal design of a compression refrigeration system(CRS) with multiple temperature levels is very important to chemical process industries and also represents considerable challenges in process systems engineering. In this paper, a general methodology for the optimal synthesis of the CRS, which simultaneously integrates CRS and Heat Exchanger Networks(HEN) to minimize the total compressor shaft work consumption based on an MINLP model, has been proposed. The major contribution of this method is in addressing the optimal design of refrigeration cycle with variable refrigeration temperature levels. The method can be used to make major decisions in the CRS design, such as the number of levels, temperature levels, and heat transfer duties. The performance of the developed methodology has been illustrated with a case study of an ethylene CRS in an industrial ethylene plant, and the optimal solution has been examined by rigorous simulations in Aspen Plus to verify its feasibility and consistency.
基金Project supported by the National Natural Science Foundation of China (Grant No. 60971104)the Basic Research Foundation of Sichuan Province,China (Grant No. 2006J013-011)the Outstanding Young Researchers Foundation of Sichuan Province,China (Grant No. 09ZQ026-091)
文摘In this study an adaptive arithmetic coder is embedded in the Baptista-type chaotic cryptosystem for implementing secure data compression. To build the multiple lookup tables of secure data compression, the phase space of chaos map with a uniform distribution in the search mode is divided non-uniformly according to the dynamic probability estimation of plaintext symbols. As a result, more probable symbols are selected according to the local statistical characters of plaintext and the required number of iterations is small since the more probable symbols have a higher chance to be visited by the chaotic search trajectory. By exploiting non-uniformity in the probabilities under which a number of iteration to be coded takes on its possible values, the compression capability is achieved by adaptive arithmetic code. Therefore, the system offers both compression and security. Compared with original arithmetic coding, simulation results on Calgary Corpus files show that the proposed scheme suffers from a reduction in compression performance less than 12% and is not susceptible to previously carried out attacks on arithmetic coding algorithms.
文摘The method of data compression, using orthogonal transform, is introduced so as to insure the minimal distortion of signal restoration. It, featured with transformation, can compress the data according to the needed precision. The ratio of compressed data is closely related to precision. The results show it to be favorable to different kinds of data compression.
文摘Though progress has been made in fractal compression techniques, the longencoding times still remain the main drawback of this technique, which results from the need ofperforming a large number of range-domain matches. The total encoding time is the sum of the timerequired to perform each match. In order to make this method more efficient in practical use, thefuzzy theory based on feature extraction of the projection and normalized codebook method has beenprovided to optimize the encoding time, based on the c-means clustering approach. The results of theimplementation of Rate Mean Square (RMS), Peak signal noise ratio (PSNR) and the encoding time ofthis proposed method have been compared to other methods like the Feature Extraction andSelf-orgarnization methods to show its efficiency.
基金partially supported by the Fundamental Research Funds for the Central Universities(WUT:2022IVA067)the National Natural Science Foundation of China(Grant No.:72172112)the Fundamental Research Funds for the Central Universities(HUST:2019kfyRCPY038).
文摘This paper proposes an enhanced arithmetic optimization algorithm(AOA)called PSAOA that incorporates the proposed probabilistic search strategy to increase the searching quality of the original AOA.Furthermore,an adjustable parameter is also developed to balance the exploration and exploitation operations.In addition,a jump mechanism is included in the PSAOAto assist individuals in jumping out of local optima.Using 29 classical benchmark functions,the proposed PSAOA is extensively tested.Compared to the AOA and other well-known methods,the experiments demonstrated that the proposed PSAOA beats existing comparison algorithms on the majority of the test functions.
文摘In this paper, we present a method using video codec technology to compress ECG signals. This method exploits both intra-beat and inter-beat correlations of the ECG signals to achieve high compression ratios (CR) and a low percent root mean square difference (PRD). Since ECG signals have both intra-beat and inter-beat redundancies like video signals, which have both intra-frame and inter-frame correlation, video codec technology can be used for ECG compression. In order to do this, some pre-process will be needed. The ECG signals should firstly be segmented and normalized to a sequence of beat cycles with the same length, and then these beat cycles can be treated as picture frames and compressed with video codec technology. We have used records from MIT-BIH arrhythmia database to evaluate our algorithm. Results show that, besides compression efficiently, this algorithm has the advantages of resolution adjustable, random access and flexibility for irregular period and QRS false detection.
文摘Compression of short text strings, such as the GSM Short Message Service (SMS) and Twitter messages, has received relatively little attention compared to the compression of longer texts. This is not surprising given that for typical cellular and internet-based networks, the cost of compression probably outweighs the cost of delivering uncompressed messages. However, this is not necessarily true in the case where the cost of data transport is high, for example, where satellite back-haul is involved, or on bandwidth-starved mobile mesh networks, such as the mesh networks for disaster relief, rural, remote and developing contexts envisaged by the Serval Project [1-4]. This motivated the development of a state-of-art text compression algorithm that could be used to compress mesh-based short-message traffic, culminating in the development of the stats3 SMS compression scheme described in this paper. Stats3 uses word frequency and 3rd-order letter statistics embodied in a pre-constructed dictionary to affect lossless compression of short text messages. This scheme shows that our scheme compressing text messages typically reduces messages to less than half of their original size, and in so doing substantially outperforms all public SMS compression systems, while also matching or exceeding the marketing claims of the commercial options known to the authors. We also outline approaches for future work that has the potential to further improve the performance and practical utility of stats3.
文摘In the present paper, we answer the question: for 0a what are the greatest value p(a) and the least value q(a) such that the double inequality Jp(a,b)aA(a,b)+ (1-a)G(a,b)Jq(a,b) holds for all a,b>0 with a is not equal to?b ?
基金supported by the National Natural Science Foundation of China under Grant No.61806138Key R&D program of Shanxi Province(High Technology)under Grant No.201903D121119Science and Technology Development Foundation of the Central Guiding Local under Grant No.YDZJSX2021A038.
文摘Compressed sensing(CS),as an efficient data transmission method,has achieved great success in the field of data transmission such as image,video and text.It can robustly recover signals from fewer Measurements,effectively alleviating the bandwidth pressure during data transmission.However,CS has many shortcomings in the transmission of hyperspectral image(HSI)data.This work aims to consider the application of CS in the transmission of hyperspectral image(HSI)data,and provides a feasible research scheme for CS of HSI data.HSI has rich spectral information and spatial information in bands,which can reflect the physical properties of the target.Most of the hyperspectral image compressed sensing(HSICS)algorithms cannot effectively use the inter-band information of HSI,resulting in poor reconstruction effects.In this paper,A three-stage hyperspectral image compression sensing algorithm(Three-stages HSICS)is proposed to obtain intra-band and inter-band characteristics of HSI,which can improve the reconstruction accuracy of HSI.Here,we establish a multi-objective band selection(Mop-BS)model,amulti-hypothesis prediction(MHP)model and a residual sparse(ReWSR)model for HSI,and use a staged reconstruction method to restore the compressed HSI.The simulation results show that the three-stage HSICS successfully improves the reconstruction accuracy of HSICS,and it performs best among all comparison algorithms.
