The proceedings contain 18 papers. The topics discussed include: noise tolerant dendritic lattice associative memories;algorithms for adaptive nonlinear pattern recognition;massively parallel computation of lattice as...
ISBN:
(纸本)9780819487469
The proceedings contain 18 papers. The topics discussed include: noise tolerant dendritic lattice associative memories;algorithms for adaptive nonlinear pattern recognition;massively parallel computation of lattice associative memory classifiers on multicore processors;fractal-based watermarking of color images;the optimum discrete scan-type approximation of low-pass type signals bounded by a measure like Kullback-Leibler divergence;extension of the concept of multi-legged-type signals to the optimum multidimensional running approximation of multidimensional band-limited signals;limited-photon 3D image recognition using photon-counting integral imaging;aligning images with cad models via quaternion optimization;the optimum approximation of multidimensional vector signals by multi-input multi-output matrix filter banks;multidimensional feature extraction from 3D hyperspectral images;and a comparative test of different compression methods applied to solar images.
The proceedings contain 23 papers. The topics discussed include: biorthogonal wavelets of maximum coding through pseudoframes for subspaces;a skinning prediction scheme for dynamic 3D mesh compression;multi-modal mult...
详细信息
ISBN:
(纸本)0819463949
The proceedings contain 23 papers. The topics discussed include: biorthogonal wavelets of maximum coding through pseudoframes for subspaces;a skinning prediction scheme for dynamic 3D mesh compression;multi-modal multi-fractal boundary encoding in object-based image compression;perspectives on data compression methods for network-level management of multi-sensor systems;exploiting data compression methods for network-level management of multi-sensor systems;a model utilizing artificial neural network for perceptual image;use of adaptive models in watermark identification;data payload optimality: a key issue for for video watermarking applications;quantization index modulation-based watermarking using holography;the optimum estimation of statistical signals based on systematic expression of many types of sample arrays in multidimensional space;and segmentation of motion textures using mixed-state Markov random fields.
In this paper, we present an implementation of the IDEA algorithm for imageencryption. The imageencryption is incorporated into the compression algorithm for transmission over a data network, in the proposed method,...
详细信息
ISBN:
(纸本)0819437670
In this paper, we present an implementation of the IDEA algorithm for imageencryption. The imageencryption is incorporated into the compression algorithm for transmission over a data network, in the proposed method, Embedded Wavelet Zero-tree coding is used for image compression. Experimental results show that our proposed scheme enhances data security and reduces the network bandwidth required for video transmissions. A software implementation and system architecture for hardware implementation of the IDEA imageencryption algorithm based on Field Programmable Gate Array (FPGA) technology are presented in this paper.
In this work, we extend arithmetic coding and present a dataencryption scheme that achieves data compression and data security at the same time. This scheme is based on a chaotic dynamics, which makes use of the fact...
详细信息
ISBN:
(纸本)0819441899
In this work, we extend arithmetic coding and present a dataencryption scheme that achieves data compression and data security at the same time. This scheme is based on a chaotic dynamics, which makes use of the fact that the decoding process of arithmetic coding scheme can be considered as the repetition of Bernoulli shift map. dataencryption is achieved by controlling the piecewise linear maps by a secret key in three kinds of approach: (i) perturbation method, (ii) switching method, and (iii) source extension method. Experimental results show that the obtained arithmetic codes for a message are randomly distributed on the mapping domain [0,1) by using different keys without seriously deteriorating the compression ratio, and the transition of the orbits in the domain [0,1) is similar to the chaotic dynamics.
Past research in the field of cryptography has not given much consideration to arithmetic coding as a feasible encryption technique, with studies proving compression-specific arithmetic. coding to be largely unsuitabl...
详细信息
ISBN:
(纸本)0819454990
Past research in the field of cryptography has not given much consideration to arithmetic coding as a feasible encryption technique, with studies proving compression-specific arithmetic. coding to be largely unsuitable for encryption. Nevertheless, adaptive modelling, which offers a huge model, variable in structure, and as completely as possible a function of the entire text that has been transmitted since the time the model was initialised, is a suitable candidate for a possible encryption-compression combine. The focus of the work presented in this paper has been to incorporate recent results of chaos theory, proven to be cryptographically secure, into arithmetic coding, to devise a convenient method to make the structure of the model unpredictable and variable in nature, and yet to retain, as far as is possible, statistical harmony, so that compression is possible. A chaos-based adaptive arithmetic coding-encryption technique has been designed, developed and tested and its implementation has been discussed. For typical text files, the proposed encoder gives compression between 67.5% and 70.5%, the zero-order compression suffering by about 6% due to encryption, and is not susceptible to previously carried out attacks on arithmetic coding algorithms.
Multimedia data may be transmitted or stored either according to the classical Shannon information theory or according to the newer Autosophy information theory. Autosophy algorithms combine very high "lossless&q...
详细信息
ISBN:
(纸本)0819454990
Multimedia data may be transmitted or stored either according to the classical Shannon information theory or according to the newer Autosophy information theory. Autosophy algorithms combine very high "lossless" data and image compression with virtually unbreakable "codebook" encryption. Shannon's theory treats all data items as "quantities", which are converted into binary digits (bit), for transmission in meaningless bit streams. Only "lossy" data compression is possible. A new "Autosophy" theory was developed by Klaus Holtz in 1974 to explain the functioning of natural self-assembling structures, such as chemical crystals or living trees. The same processes can also be used for growing self-assembling data structures, which grow like data crystals or data trees in electronic memories. This provides true mathematical learning algorithms, according to a new Autosophy information theory. Information in essence is only that which can be perceived and which is not already known by the receiver. The transmission bit rates are dependent on the data content only. applications already include the V.42bis compression standard in modems, the gif and tif formats for lossless image compression, and Autosophy Internet television. A new 64bit data format could make all future communications compatible and solve the Internet's Quality of Service (QoS) problems.
Consideration of the geometry of spaces of textual images leads to description of ensembles of text classes via representation of such imagedata using a multi-scale multi-resolution method. A direct approach to stati...
详细信息
ISBN:
(纸本)0819445606
Consideration of the geometry of spaces of textual images leads to description of ensembles of text classes via representation of such imagedata using a multi-scale multi-resolution method. A direct approach to statistics of textual imagedata using 4 by 4 matrices of pixel values in the image of the document is introduced. The mathematical approach to analysis of occurrences of such pieces of a text image is Matrix Frequency Analysis (MFA). It is shown that MFA provides effective information on the classification of files using small sample sizes.
暂无评论