This paper proposes a bit-level image encryption algorithm based on spatiotemporal chaotic system which is self-adaptive. We use a bit-level encryption scheme to reduce the volume of data during encryption and decryption in order to reduce the execution time. We also use the adaptive encryption scheme to make the ciphered image dependent on the plain image to improve performance. Simulation results show that the performance and security of the proposed encryption algorithm can encrypt plaintext effectively and resist various typical attacks.

A new image encryption scheme, based on a total shuffling and parallel encryption algorithm is proposed in this paper. Two chaotic systems have been used in the encryption algorithm to confuse the relationship between the plain-image and the cipher-image. To make the encryption procedure more confusing and complex, the plain-image is first divided into 4 sub-images and then the position of each sub-image is changed pseudo-randomly according to a logistic map. Next, a total shuffling matrix is used to shuffle the position of pixels in the whole image and then sub-images are encrypted simultaneously in a parallel manner. The experimental results on USC data base demonstrate that the proposed encryption algorithm has a low time complexity and has the advantages of large key space and high sec...

Based on fractional Fourier transform, an image encryption algorithm is proposed and researched. A local random phase encoding is introduced into this algorithm. The data at the local area of complex function is converted by fractional Fourier transform. The local random phase encoding is performed many times. Moreover only one set of random phase data is used in image encryption process. Compare to double random phase encoding, the parameter defining local area can be regarded as the additional key to increase the security of the encryption scheme. Some numerical simulations are achieved to demonstrate the performance of the image encryption scheme.

Degradative encryption, a new selective image encryption paradigm, is proposed to encrypt only a small part of image data to make the detail blurred but keep the skeleton discernible. The efficiency is further optimized by combining compression and encryption. A format-compliant degradative encryption algorithm based on set partitioning in hierarchical trees (SPIHT) is then proposed, and the scheme is designed to work in progressive mode for gaining a tradeoff between efficiency and security. Extensive experiments are conducted to evaluate the strength and efficiency of the scheme, and it is found that less than 10% data need to be encrypted for a secure degradation. In security analysis, the scheme is verified to be immune to cryptographic attacks as well as those adversaries utilizing image processing techniques. The scheme can find its wide applications in online try-and-buy service on mobile devices, searchable multimedia encryption in cloud computing, etc.

An image encryption method with two-step-only quadrature phase-shifting digital holography, based on the calculated intensity of reference wave is proposed. Compared with the presented image encryption method based on phase-shifting technique, the technique need only to record two quadrature-phase holograms on CCD camera, without reference-wave intensity or object-wave intensity measurement, and the encryption keys to perform image encryption on Mach-Zehnder interferometer. When the reference-wave intensity is acquired from 2D correlation coefficient method our presented, the clear retrieved image can be obtained at high speed by certain algorithm. Its feasibility and validity were verified by a series of computer simulations.

This paper puts forward a novel image encryption algorithm that is based on permutation-diffusion architecture. In pixels' permutation stage, algorithm takes full advantage of the idea of magic cube's scrambling. There is only simple cyclic shift operation in each sub-block's permutation, but when the algorithm has disposed the current sub-block, the adjacent sub-blocks will be dealt with, too. In the cyclic shift of each row, stable points will help to decrease the correlation of adjacent pixels. To make encryption procedure uncertain, this paper brings in a parameter named delay-time that is generated by chaotic map. In the diffusion stage, by combining multiple operations and dynamic look-up table together, the proposed algorithm highly increases the uncertainty of the encryption procedure. At last, the experiment results of key space analysis, information entropy analysis, histogram analysis and etc. show that the encryption algorithm has well performance and it can be used in image encryption and transmission.

Degradative encryption, a new selective image encryption paradigm, is proposed to encrypt only a small part of image data to make the detail blurred but keep the skeleton discernible. The efficiency is further optimized by combining compression and encryption. A format-compliant degradative encryption algorithm based on set partitioning in hierarchical trees (SPIHT) is then proposed, and the scheme is designed to work in progressive mode for gaining a tradeoff between efficiency and security. Extensive experiments are conducted to evaluate the strength and efficiency of the scheme, and it is found that less than 10% data need to be encrypted for a secure degradation. In security analysis, the scheme is verified to be immune to cryptographic attacks as well as those adversaries utilizing im...

This paper will put forward a novel chaotic image encryption algorithm with confusion–diffusion architecture. First of all, secret keys will be processed by key generator before they can really be used in the encryption scheme, and in this stage this paper associates plain image with secret keys; Secondly, by imitating the trajectory of water wave movement, encryption algorithm will do scrambling operations to the image. Thirdly, this paper combines water drop motion and dynamic look up table to realize diffusion operations. For an 8 bits pixel, this algorithm will just dispose the higher 4 bits, which is because the higher 4 bits contain the vast majority of information of the image. At last, the experiment results and security analysis show that this proposed algorithm has a desi...

Recently, a colour image encryption algorithm based on chaos was proposed by cascading two position permutation operations and one substitution operation, which are all determined by some pseudo-random number sequences generated by iterating the logistic map. This paper evaluates the security level of this encryption algorithm and finds that the position permutation-only part and the substitution part can be separately broken with only ?(log2(3MN))/8? and 2 chosen plain-images, respectively, where MN is the size of the plain-image. The effectiveness of the proposed chosen-plaintext attack is supported by concise theoretical analyses, and is verified by experimental results.

Confidentiality is an important issue in transmitting digital images over public networks such as the Internet. Image encryption is a useful solution to achieve confidentiality. Among existing encryption schemes, chaos-based approach has suggested fast, efficient and highly secure algorithms. Recently an efficient image encryption method based on chaos and permutation–diffusion architecture is suggested in [G. Zhang, Q. Liu, Opt. Commun. 284 (2011) 2775–2780]. However, the plain-text sensitivity, as reported by the authors, is not satisfying and it is recommended to iterate the algorithm more than twice to get a good ability to resist differential attack. The aim of this paper is to promote the plain-text sensitivity of their approach. As a result, the diffusion performance...

In recent years, a growing number of discrete chaotic cryptographic algorithms have been proposed. However, most of them encounter some problems such as the lack of robustness and security. In this Letter, we introduce a new image encryption algorithm based on one-dimensional piecewise nonlinear chaotic maps. The system is a measurable dynamical system with an interesting property of being either ergodic or having stable period-one fixed point. They bifurcate from a stable single periodic state to chaotic one and vice versa without having usual period-doubling or period-n-tippling scenario. Also, we present the KS-entropy of this maps with respect to control parameter. This algorithm tries to improve the problem of failure of encryption such as small key space, encryption speed and level of security.

Remote-sensing technology plays an important role in military and industrial fields. Remote-sensing image is the main means of acquiring information from satellites, which always contain some confidential information. To securely transmit and store remote-sensing images, we propose a new image encryption algorithm in hybrid domains. This algorithm makes full use of the advantages of image encryption in both spatial domain and transform domain. First, the low-pass subband coefficients of image DWT (discrete wavelet transform) decomposition are sorted by a PWLCM system in transform domain. Second, the image after IDWT (inverse discrete wavelet transform) reconstruction is diffused with 2D (two-dimensional) Logistic map and XOR operation in spatial domain. The experiment results and algorithm...

Chaotic cryptography is a new field that has seen a significant amount of research activity during the last 20 years. Despite the many proposals that use various methods in the design of encryption algorithms, there is a definite need for a mathematically rigorous cryptanalysis of these designs. In this study, we analyze the security weaknesses of the “C. Zhu, A novel image encryption scheme based on improved hyperchaotic sequences, Optics Communications 285 (2012) 29–37”. By applying chosen plaintext attacks, we show that all the secret parameters can be revealed.

Image applications have been increasing in recent years.Encryption is used to provide the security needed for image applications. In this paper, we classify various image encryption schemes and analyze them with respect to various parameters like tunability, visual degradation, compression friendliness,format compliance, encryption ratio, speed, and cryptographic security.

As the multimedia and internet technologies are growing fast, the transmission of digital media plays an important role in communication. The various digital media like audio, video and images are being transferred through internet. There are a lot of threats for the digital data that are transferred through internet. Also, a number of security techniques have been employed to protect the data that is transferred through internet. This paper proposes a new technique for sending secret messages securely, using steganographic technique. Since the proposed system uses multiple level of security for data hiding, where the data is hidden in an image file and the stego file is again concealed in another image. Previously, the secret message is being encrypted with the encryption algorithm which ensures the achievement of high security enabled data transfer through internet.

In recent years, a variety of chaos-based image encryption algorithms have been proposed. Most of them employ the confusion-diffusion architecture and operate at the pixel level. In this paper, we analyze the intrinsic features of the bit distributions, the high correlation among bit planes and other issues related to the bit information of an image. Due to the superior characteristics of bit-level operations and the intrinsic bit features of the image, an expand-and-shrink strategy is employed to shuffle the image with reconstructed permuting plane. Simulations have been carried out and the results demonstrate the superior security and high efficiency of the proposed scheme.

This paper proposes a novel chaotic system, in which variables are treated as encryption keys in order to achieve secure transmission of digital color images. Since the dynamic response of chaotic system is highly sensitive to the initial values of a system and to the variation of a parameter, and chaotic trajectory is so unpredictable, we use elements of variables as encryption keys and apply these to computer internet communication of digital color images. As a result, we obtain much higher communication security. We adopt one statistic method involving correlation coefficient {gamma} and FIPS PUB 140-1 to test on the distribution of distinguished elements of variables for continuous-time chaotic system, and accordingly select optimal encryption keys to use in secure communication of digital color images. At the transmitter end, we conduct RGB level decomposition on digital color images, and encrypt them with chaotic keys, and finally transmit them through computer internet. The same encryption keys are used to decrypt and recover the original images at the receiver end. Even if the encrypted images are stolen in the public channel, an intruder is not able to decrypt and recover the original images because of the lack of adequate encryption keys. Empirical example shows that the chaotic system and encryption keys applied in the encryption, transmission, decryption, and recovery of digital color images can achieve higher communication security and best recovered images.

In this paper, we introduce a symmetric-key Latin square image cipher (LSIC) for grayscale and color images. Our contributions to the image encryption community include 1) we develop new Latin square image encryption primitives including Latin Square Whitening, Latin Square S-box and Latin Square P-box ; 2) we provide a new way of integrating probabilistic encryption in image encryption by embedding random noise in the least significant image bit-plane; and 3) we construct LSIC with these Latin square image encryption primitives all on one keyed Latin square in a new loom-like substitution-permutation network. Consequently, the proposed LSIC achieve many desired properties of a secure cipher including a large key space, high key sensitivities, uniformly distributed ciphertext, excellent confusion and diffusion properties, semantically secure, and robustness against channel noise. Theoretical analysis show that the LSIC has good resistance to many attack models including brute-force attacks, ciphertext-only at...

We propose a hybrid technique for image encryption which employs the concept of carrier image and SCAN patterns generated by SCAN methodology. Although it involves existing method like SCAN methodology, the novelty of the work lies in hybridizing and carrier image creation for encryption. Here the carrier image is created with the help of alphanumeric keyword. Each alphanumeric key will be having a unique 8bit value generated by 4 out of 8-code. This newly generated carrier image is added with original image to obtain encrypted image. The scan methodology is applied to either original image or carrier image, after the addition of original image and carrier image to obtain highly distorted encrypted image. The resulting image is found to be more distorted in hybrid technique. By applying the reverse process we get the decrypted image.

Symbolic encryption, in the style of Dolev-Yao models, is ubiquitous in formal security models. In its common use, encryption on a whole message is specified as a single monolithic block. From a cryptographic perspective, however, this may require a resource-intensive cryptographic algorithm, namely an authenticated encryption scheme that is secure under chosen ciphertext attack. Therefore, many reasonable encryption schemes, such as AES in the CBC or CFB mode, are not among the implementation options. In this paper, we report new attacks on CBC and CFB based implementations of the well-known Needham-Schroeder and Denning-Sacco protocols. To avoid such problems, we advocate the use of refined notions of symbolic encryption that have natural correspondence to standard cryptographic encryption schemes.

A new APM computer-generated hologram algorithm for minimizing DC components and more effective data recovery is presented for the purpose of an ID tag application. In this method, a technique of randomization of the input data is introduced prior to the Fourier transform. As a result, DC components are localized at the center region, which is only 1 data cell, regardless of input data. The size of the tag pattern is reduced 2.25 times using a color encryption technique. Our experimental result through the image captured by a camera also shows that approximately 50% damaged APM-CGH tags can be reconstructed at a low error rate of about 1.8%.

We present a proof of principle of a straightforward application of distributed imaging to the efficient encryption of images. The basic idea is to exploit, in a ghost-imaging experiment, the correlations of the fields produced by a chaotically seeded parametric downconversion to deduce a Code for reconstructing the image of the object. As this Code results to be much smaller than the entire image size, it can be more efficiently encrypted by any secure quantum key.

This paper presents a novel image encryption/decryption algorithm based on chaotic neural network (CNN). The employed CNN is comprised of two 3-neuron layers called chaotic neuron layer (CNL) and permutation neuron layer (PNL). The values of three RGB (Red, Green and Blue) color components of image constitute inputs of the CNN and three encoded streams are the network outputs. CNL is a chaotic layer where, three well-known chaotic systems i.e. Chua, Lorenz and Lu systems participate in generating weights and biases matrices of this layer corresponding to each pixel RGB features. Besides, a chaotic tent map is employed as the activation function of this layer, and makes the relationship between the plain image and cipher image nonlinear. The output of CNL, i.e. the diffused information, is ...

Traditional public-key cryptosystems suffer from a relatively low encryption/decryption speed, which hampers their applications in resource-constrained environments. A fast public-key cryptosystem is proposed to remedy this drawback. The new algorithm uses Chinese remainder theorem to hide the trapdoor information. The encryption of the system only carries out several modular multiplication operations, and the decryption only needs a modular multiplication and a low-dimensional matrixvector multiplication, which makes the speed of the encryption and the decryption of the scheme very high. The security of the system is based on two difficult number-theoretic problems. The attacker has to solve the integer factorization problem and the simultaneous Diophantine approximation problem simultane...

The usual way of ensuring the confidentiality of the compressed data is to encrypt it with a standard encryption algorithm. Although the computational cost of encryption is practically tolerable in most cases, the lack of flexibility to perform pattern matching on the compressed data due to the encryption level is the main disadvantage. Another alternative to provide privacy in compression is to alter the compression algorithms in such a way that the decompression requires the knowledge of some secret parameters. Securing the arithmetic and Huffman coders along with the dictionary based schemes have been previously studied, where Burrows-Wheeler transform (BWT) has not been addressed before in that sense. On BWT of an input data it is not possible to perform a successful search nor constru...

We propose an optoelectronic image encryption and decryption technique based on coherent superposition principle and digital holography. With the help of a chaotic random phase mask (CRPM) that is generated by using logistic map, a real-valued primary image is encoded into a phase-only version and then recorded as an encoded hologram. As for multiple-image encryption, only one digital hologram is to be transmitted as the encrypted result by using the multiplexing technique changing the reference wave angle. The bifurcation parameters, the initial values for the logistic maps, the number of the removed elements and the reference wave parameters are kept and transmitted as private keys. Both the encryption and decryption processes can be implemented in opto-digital manner or fully digital ma...

We present a watermarking scheme that combines data compression and encryption in application to radiological medical images. In this approach we combine the image moment theory and image homogeneity in order to recover the watermark after a geometrical distortion. Image quality is measured with metrics used in image processing, such as PSNR and MSE.   

The development of efficient data encryption to ensure high security of information transmission has long been a popular research subject. Because electrocardiogram (ECG) signals vary from person to person, and can be used as a new tool for biometric recognition. This study introduces an individual feature of ECG with chaotic Henon and logistic maps for personalized cryptography. This study also develops an encryption algorithm based on the chaos theory to generate initial keys for chaotic logistic and Henon maps. The proposed personalized encryption system uses a convenient handheld device to collect ECG signals from the user. High quality randomness in ECG signals results in a widely expanded key space, making it an ideal key generator for personalized data encryption. The experiments re...

A double random phase encoding based digital phase encryption technique for colored images is proposed in the Fourier domain. The RGB input image is brought to HSV color space and then converted into phase, prior to the encryption. In the decryption process the HSV image is and converted back to the RGB format. The random phase codes used during encryption are prepared by stacking three two-dimensional random phase masks. These random phase codes serve as keys for encryption and decryption. The proposed technique carries all the advantages of phase encryption and is supposedly three-dimensional in nature. Robustness of the technique is analyzed against the variations in random phase codes and shuffling of the random phase masks of a given phase code. Performance of the scheme is also verified against occlusion of Fourier plane random phase code as well as the encrypted image. Effects of noise attacks and attacks using partial windows of correct random phase codes have also been checked. Digital simulations are presented to support the idea.

This paper proposes to put forward an innovative algorithm for symmetric key block cipher named as "Triple Prime Symmetric Key Block Cipher with Variable Key-Spaces (TPSKBCVK)" that employs triple prime integers as private key-spaces of varying lengths to encrypt data files. Principles of modular arithmetic have been elegantly used in the proposed idea of the cipher. Depending on observations of the results of implementation of the proposed cipher on a set of real data files of several types, all results are registered and analyzed. The strength of the underlying design of the cipher and the liberty of using a long key-space expectedly makes it reasonably non-susceptible against possible cryptanalytic intrusions. As a future scope of the work, it is intended to formulate and employ an improved scheme that will use a carrier media (image or multimedia data file) for a secure transmission of the private keys.

Encryption of images is different from that of texts due to some intrinsic features of images such as bulk data capacity and high redundancy, which are generally difficult to handle by traditional methods. Due to the exceptionally desirable properties of mixing and sensitivity to initial conditions and parameters of chaotic maps, chaos-based encryption has suggested a new and efficient way to deal with the intractable problem of fast and highly secure image encryption. In this paper, the two-dimensional chaotic cat map is generalized to 3D for designing a real-time secure symmetric encryption scheme. This new scheme employs the 3D cat map to shuffle the positions (and, if desired, grey values as well) of image pixels and uses another chaotic map to confuse the relationship between the cipher-image and the plain-image, thereby significantly increasing the resistance to statistical and differential attacks. Thorough experimental tests are carried out with detailed analysis, demonstrating the high security and fast encryption speed of the new scheme.

In recent years, a number of methods have been proposed in the literature for the encryption of two-dimensional information by use of the fractional Fourier transform, but most of their encryptions are complex value and need digital hologram technique to record their encrypted information, which is inconvenience for digital transmission. In this paper, we first propose a novel reality-preserving multiple-parameter fractional Fourier transform which share real-valuedness outputs as well as most of the properties required for a fractional transform. Then we propose a new approach for image encryption based on the real-valuedness of the reality-preserving multiple-parameter fractional Fourier transform and the decorrelation property of chaotic maps in order to meet the requirements of the secure image transmission. In the proposed scheme, the image is encrypted by juxtaposition of sections of the image in the reality-preserving multiple-parameter fractional Fourier domains and the alignment of sections is determined by chaotic logistic maps. Numerical simulations are performed to demonstrate that the proposed method is reliable and more robust to blind decryption than several existing methods.

In this paper, a definition of Chebyshev polynomials over Formula Not Shown is introduced. Based on such polynomials, a generalization of a recently proposed public-key encryption algorithm that uses Chebyshev polynomials over prime finite fields is presented. Since our approach uses a finite field trigonometry, it is also possible to analyze some security aspects of the mentioned algorithm in the extension field scenario. The security of the algorithm relies in part on the difficulty of computing discrete logarithms over finite fields.

With the build-out of large transport networks utilizing optical technologies, more and more capacity is being made available. Innovations in Dense Wave Division Multiplexing (DWDM) and the elimination of optical-electrical-optical conversions have brought on advances in communication speeds as we move into 10 Gigabit Ethernet and above. Of course, there is a need to encrypt data on these optical links as the data traverses public and private network backbones. Unfortunately, as the communications infrastructure becomes increasingly optical, advances in encryption (done electronically) have failed to keep up. This project examines the use of optical logic for implementing encryption in the photonic domain to achieve the requisite encryption rates. In order to realize photonic encryption designs, technology developed for electrical logic circuits must be translated to the photonic regime. This paper examines two classes of all optical logic (SEED, gain competition) and how each discrete logic element can be interconnected and cascaded to form an optical circuit. Because there is no known software that can model these devices at a circuit level, the functionality of the SEED and gain competition devices in an optical circuit were modeled in PSpice. PSpice allows modeling of the macro characteristics of the devices in context of a logic element as opposed to device level computational modeling. By representing light intensity as voltage, 'black box' models are generated that accurately represent the intensity response and logic levels in both technologies. By modeling the behavior at the systems level, one can incorporate systems design tools and a simulation environment to aid in the overall functional design. Each black box model of the SEED or gain competition device takes certain parameters (reflectance, intensity, input response), and models the optical ripple and time delay characteristics. These 'black box' models are interconnected and cascaded in an encrypting/scrambling algorithm based on a study of candidate encryption algorithms. We found that a low gate count, cascadable encryption algorithm is most feasible given device and processing constraints. The modeling and simulation of optical designs using these components is proceeding in parallel with efforts to perfect the physical devices and their interconnect. We have applied these techniques to the development of a 'toy' algorithm that may pave the way for more robust optical algorithms. These design/modeling/simulation techniques are now ready to be applied to larger optical designs in advance of our ability to implement such systems in hardware.

A virtually portable (FORTRAN) version of the RSA (Rivest, Shamir, Adleman) algorithm for encryption and decryption of proprietary text has been written. This system uses three previously developed software packages. These are an extended precision integer arithmetic package, an error processing package, and machine-sensitive input/output subprograms from the Text Exchange System.

This paper presents a heuristic attack on the fully homomorphic encryption over the integers by using lattice reduction algorithm. Our result shows that the FHE in [DGHV10] is not secure for some parameter settings. We also present an improvement scheme to avoid the lattice attack in this paper.

Cryptographic techniques are an important means by which security of information and info-communication networks is ensured. Yet it was not until the mid-2000s that the world's largest developer of standards, the International Organization for Standardization (ISO), issued ISO/IEC 18033 on encryption algorithms.The purpose of this article is to explore a relatively understudied aspect of international standardization by focusing on demand for encryption standards. Drawing on the global governance literature, it argues that the demand for cryptographic standards may be generated not only to address the coordinating problem of technological compatibility but also to address the common problem of information security.It is assumed that the demand for international cryptographic standards will be generated by the businesses, particularly those engaged in electronic commerce, as they are interested in enhancing the security of the network where they hold transactions. It is also assumed that on-line privacy advocates will support the standardization of encryption techniques. However, the commercial interests in cryptographic standardization may be in conflict with national security interests. Just as encryption technology can be used to protect financial information and personal data, it can be used to protect confidential information of foreign governments and other organizations. Therefore, spread of cryptographic techniques through standardization can be detrimental to national security activities.Indeed, ISO's early attempt to establish encryption algorithm standard was frustrated by the objection raised by the US government, which was concerned with the standard's implication to national security. In the 1990s, however, the international business community began to pressure government hard to liberalize cryptographic use so that they could take full advantage of the commercial opportunities provided by the exponential growth to the Internet. The commercial interests succeeded in having its preferences reflected in the Organization for Economic Cooperation and Development (OECD) Guideline for Cryptographic Policy of 1997. The guideline, in turn, provided the ISO with an opportunity to launch once-prohibited standardization of encryption technology as it recommended the setting of standards for cryptographic methods at national and international levels. The ISO eventually produced ISO/IEC 18033 to promote the deployment of “state-of-the-art” encryption technology worldwide.Standards and standardization are often dismissed as technological details in the study of International Relations. However, international standardization of encryption sheds light on the new security dilemma in the information age. Most important of all, the evolution of international cryptographic standards highlights the changing balance between national security and commercial interests in encryption.   

In this paper, a novel secure cryptosystem is proposed for direct encryption of color images, based on transformed logistic maps. The proposed cipher provides good confusion and diffusion properties that ensures extremely high security due to the mixing of colors pixels. The encryption scheme makes use of six odd secret keys and chaotic keys for each operation. The operations include initial permutation of all pixels with six odd keys, nonlinear diffusion using first chaotic key, xoring the second chaotic key with resultant values and zig-zag diffusion with third chaotic key. The proposed scheme supports key sizes ranging from 192 to 400 bits. The security and performance of the proposed image encryption technique have been analysed thoroughly using statistical analysis, key sensitivity an...

Data embedding is a new steganographic method for combining digital information sets. This paper describes the data embedding method and gives examples of its application using software written in the C-programming language. Sandford and Handel produced a computer program (BMPEMBED, Ver. 1.51 written for IBM PC/AT or compatible, MS/DOS Ver. 3.3 or later) that implements data embedding in an application for digital imagery. Information is embedded into, and extracted from, Truecolor or color-pallet images in Microsoft{reg_sign} bitmap (.BMP) format. Hiding data in the noise component of a host, by means of an algorithm that modifies or replaces the noise bits, is termed {open_quote}steganography.{close_quote} Data embedding differs markedly from conventional steganography, because it uses the noise component of the host to insert information with few or no modifications to the host data values or their statistical properties. Consequently, the entropy of the host data is affected little by using data embedding to add information. The data embedding method applies to host data compressed with transform, or {open_quote}lossy{close_quote} compression algorithms, as for example ones based on discrete cosine transform and wavelet functions. Analysis of the host noise generates a key required for embedding and extracting the auxiliary data from the combined data. The key is stored easily in the combined data. Images without the key cannot be processed to extract the embedded information. To provide security for the embedded data, one can remove the key from the combined data and manage it separately. The image key can be encrypted and stored in the combined data or transmitted separately as a ciphertext much smaller in size than the embedded data. The key size is typically ten to one-hundred bytes, and it is in data an analysis algorithm.

Recently, various encryption techniques based on chaos have been proposed. However, most existing chaotic encryption schemes still suffer from fundamental problems such as small key space, weak security function and slow performance speed. This paper introduces an efficient encryption scheme for still visual data that overcome these disadvantages. The proposed scheme is based on hybrid Linear Feedback Shift Register (LFSR) and chaotic systems in hybrid domains. The core idea is to scramble the pixel positions based on 2D chaotic systems in frequency domain. Then, the diffusion is done on the scrambled image based on cryptographic primitive operations and the incorporation of LFSR and chaotic systems as round keys. The hybrid compound of LFSR, chaotic system and cryptographic primitive oper...

Recently, an image encryption scheme based on chaotic standard and logistic maps was proposed. This paper studies the security of the scheme and shows that it can be broken with only one chosen-plaintext. Some other security defects of the scheme are also reported.

In this paper, a new image encryption scheme using a secret key of 144-bits is proposed. In the substitution process of the scheme, image is divided into blocks and subsequently into color components. Each color component is modified by performing bitwise operation which depends on secret key as well as a few most significant bits of its previous and next color component. Three rounds are taken to complete substitution process. To make cipher more robust, a feedback mechanism is also applied by modifying used secret key after encrypting each block. Further, resultant image is partitioned into several key based dynamic sub-images. Each sub-image passes through the scrambling process where pixels of sub-image are reshuffled within itself by using a generated magic square matrix. Five rounds are taken for scrambling process. The propose scheme is simple, fast and sensitive to the secret key. Due to high order of substitution and permutation, common attacks like linear and differential cryptanalysis are infeasibl...

A cryptographic method for encrypting, transmitting and decrypting keying data between a master unit and at least one remote unit is described comprising the steps of: storing in the master unit and in the remote unit key encryption keys, generating a first storage address effective to identify a master key encryption key from the key encryption keys; indexing the first storage address by a first predetermined amount to define a second storage address effective to identify a first key encryption key from the key encryption keys; indexing the first storage address by a second predetermined amount to define a third storage address effective to identify a second key encryption key from the key encryption keys; generating a data encryption key in the master unit, using the first key encryption key; encrypting the data encryption key using the second key encryption key to produce an encrypted data encryption key; downloading to the remote unit the encrypted data encryption key together with a designator value for identifying the address of the second key encryption key at the remote unit; and decrypting the encrypted data encryption key at the remote unit to reproduce the data encryption key at the remote unit.

The sensor network is a network technique for the implementation of Ubiquitous computing environment. It is wireless network environment that consists of the many sensors of lightweight and low power. Though sensor network provides various capabilities, it is unable to ensure the secure authentication between nodes. Eventually it causes the losing reliability of the entire network and many secure problems. Therefore, encryption algorithm for the implementation of reliable sensor network environments is required to the applicable sensor network. In this paper, we proposed the solution of reliable sensor network to analyze the communication efficiency through measuring performance of AES encryption algorithm by plaintext size, and cost of operation per hop according to the network scale.

The fractal-image addition method and the binary encoding method are assembled to form a hybrid method for encrypting a digital covert image. For this hybrid method, a host image is used to create an overt image with the information of the covert image. First, the fractal-image addition method is used to add some fractal images and the covert image to form an image-mixing matrix. Then, all the pixel values of the image-mixing matrix are transferred into binary data. Finally, the binary data are encoded into the host image to create an overt image. The pixels of the overt image contain eight groups of codes used for reconstructing the covert image. The eight groups of codes are identification codes, row amount codes, covert-image dimension codes, fractal-image amount codes, starting-pixel c...

A method for the encryption, transmission, and subsequent decryption of digital keying data. The method utilizes the Data Encryption Standard and is implemented by means of a pair of apparatus, each of which is selectable to operate as either a master unit or remote unit. Each unit contains a set of key encryption keys which are indexed by a common indexing system. The master unit operates upon command from the remote unit to generate a data encryption key and encrypt the data encryption key using a preselected key encryption key. The encrypted data encryption key and an index designator are then downloaded to the remote unit, where the data encryption key is decrypted for subsequent use in the encryption and transmission data. Downloading of the encrypted data encryption key enables frequent change of keys without requiring manual entry or storage of keys at the remote unit.

On the verge of the 50th anniversary of Vander Lugt’s formulation for pattern matching based on matched filtering and optical correlation, we acknowledge the very intense research activity developed in the field of correlation-based pattern recognition during this period of time. The paper reviews some domains that appeared as emerging fields in the last years of the 20th century and have been developed later on in the 21st century. Such is the case of three-dimensional (3D) object recognition, biometric pattern matching, optical security and hybrid optical–digital processors. 3D object recognition is a challenging case of multidimensional image recognition because of its implications in the recognition of real-world objects independent of their perspective. Biometric recognition is essentially pattern recognition for which the personal identification is based on the authentication of a specific physiological characteristic possessed by the subject (e.g. fingerprint, face, iris, retina, and multifactor combinations). Biometric recognition often appears combined with encryption–decryption processes to secure information. The optical implementations of correlation-based pattern recognition processes still rely on the 4f-correlator, the joint transform correlator, or some of their variants. But the many applications developed in the field have been pushing the systems for a continuous improvement of their architectures and algorithms, thus leading towards merged optical–digital solutions.

This paper proposes a new chaotic symmetric cryptographic system. At first, we use the proposed method, Game of Life permutation which is the initial pattern generated by logistic map, to confuse the plain image. Secondly, we use piecewise linear chaotic map (PWLCM) to diffuse the image, which we just process the higher half pixel to improve the speed. It will not affect the encryption results at the same time, which is because the higher 4 bits (8th, 7th, 6th and 5th) carry almost all information of the image. Experiment results and security analysis not only show that the scheme can achieve good encryption result, but also that the key space is large enough to resist against common attack.

A secure content object protects electronic documents from unauthorized use. The secure content object includes an encrypted electronic document, a multi-key encryption table having at least one multi-key component, an encrypted header and a user interface device. The encrypted document is encrypted using a document encryption key associated with a multi-key encryption method. The encrypted header includes an encryption marker formed by a random number followed by a derivable variation of the same random number. The user interface device enables a user to input a user authorization. The user authorization is combined with each of the multi-key components in the multi-key encryption key table and used to try to decrypt the encrypted header. If the encryption marker is successfully decrypted, the electronic document may be decrypted. Multiple electronic documents or a document and annotations may be protected by the secure content object.

Keystream reuse, also known as the two time pad problem, is a well known weakness in stream ciphers. The implementers of the cryptographic algorithms are still underestimating this threat. The keystream reuse exploitation techniques presented so far assume the underlying plaintext to be textual data and all the heuristics presented previously are based on the language characteristics of the underlying text based data, which fail when compression is applied on the plaintext before encryption. This paper presents exploitation techniques for two time pads in case of stream ciphered digitized and compressed speech signals. In this paper we show that how an adversary can automatically recover the digitized speech signals encrypted under the same keystream provided the language (e.g. English) an...

Multicast in Wireless Sensor Networks (WSNs) is an attractive mechanism for delivering data to multiple receivers as it saves bandwidth. To guarantee the security of multicast, the group key is used to encrypt and decrypt the packages. However, providing key management services in WSNs is complicated because sensor nodes possess limited resources of computing, storage and communication. To address the balance between security and limited resources, a multicast group key management protocol based on the weight-balanced 2-3 tree is proposed to generate, distribute, and update the group key securely and efficiently. The decentralized group key management method is employed. A weight-balanced 2-3 key tree is formed in every subgroup. Instead of using the conventional symmetric and non-symmetric encryption algorithms, the Maximum Distance Separable (MDS) code technique is used to distribute the multicast key dynamically. During the key updating, a series of adjustment rules are summarized to keep the tree weight-b...

Cryptography protects users by providing functionality for the encryption of data and authentication of other users. This technology lets the receiver of an electronic message verify the sender, ensures that a message can be read only by the intended person, and assures the recipient that a message has not be altered in transit. Classical cryptanalysis involves an interesting combination of analytical reasoning, application of mathematical tools and pattern finding. The objectives of the proposed work are to propose a new cryptographic method based on the special matrix called the Hilbert matrix for authentication and confidentiality and to propose a model for confidentiality and authentication using shared key cryptosystems with the concept of digital enveloping using a session key. In the present work various algorithms are presented for encryption and authentication based on Hilbert matrix using a session key.

We developed a completely secured teleradiology solution tailored for e-mail teleradiology applications at low-cost. Data processing consists in creating a couple of files with an encrypted and compressed image archive and a 128 bits decoding key file. No proprietary file format or encryption scheme is used. Files are exchanged using the e-mail (SMTP and POP) protocols, but FTP or sFTP can be used for better performances. Software includes original features such as real-time interactive JPEG compression, instant archive preview or secured data cleanup when a user logs off. We believe that this flexible, integrated and easy to use solution is a robust alternative to more complex architectures for simple image transmissions or occasional circumstances. PMID:18003565

The large-scale proliferation of biometric verification systems creates a demand for effective and reliable security and privacy of its data. Like passwords and PIN codes, biometric data is also not secret and if it is compromised, the integrity of the whole verification system could be at high risk. To address these issues, this paper presents a novel chaotic secure content-based hidden transmission scheme of biometric data. Encryption and data hiding techniques are used to improve the security and secrecy of the transmitted templates. Secret keys are generated by the biometric image and used as the parameter value and initial condition of the chaotic map, and each transaction session has different secret keys to protect from the attacks. Two chaotic maps are incorporated for the encryption to resolve the finite word length effect and to improve the system's resistance against attacks. Encryption is applied on the biometric templates before hiding into the cover/host images to make them secure, and then templates are hidden into the cover image. Experimental results show that the security, performance, and accuracy of the presented scheme are encouraging comparable with other methods found in the current literature.

With the advent into the 20th century whole world has been facing the common dilemma of Terrorism. The suicide attacks on US twin towers 11 Sept. 2001, Train bombings in Madrid Spain 11 Mar. 2004, London bombings 7 Jul. 2005 and Mumbai attack 26 Nov. 2008 were some of the most disturbing, destructive and evil acts by terrorists in the last decade which has clearly shown their evil intent that they can go to any extent to accomplish their goals. Many terrorist organizations such as al Quaida, Harakat ul-Mujahidin, Hezbollah, Jaish-e-Mohammed, Lashkar-e-Toiba, etc. are carrying out training camps and terrorist operations which are accompanied with latest technology and high tech arsenal. To counter such terrorism our military is in need of advanced defense technology. One of the major issues of concern is secure communication. It has to be made sure that communication between different military forces is secure so that critical information is not leaked to the adversary. Military forces need secure communication to shield their confidential data from terrorist forces. Leakage of concerned data can prove hazardous, thus preservation and security is of prime importance. There may be a need to perform computations that require data from many military forces, but in some cases the associated forces would not want to reveal their data to other forces. In such situations Secure Multi-party Computations find their application. In this paper, we propose a new highly scalable Secure Multi-party Computation (SMC) protocol and algorithm for Defense applications which can be used to perform computation on encrypted data. Every party encrypts their data in accordance with a particular scheme. This encrypted data is distributed among some created virtual parties. These Virtual parties send their data to the TTP through an Anonymizer layer. TTP performs computation on encrypted data and announces the result. As the data sent was encrypted its actual value can’t be known by TTP and with the use of Anonymizers we have covered the identity of true source of data. Modifier tokens are generated along encryption of data which are distributed among virtual parties, then sent to TTP and finally used in the computation. Thus without revealing the data, right result can be computed and privacy of the parties is maintained. We have also given a probabilistic security analysis of hacking the protocol and shown how zero hacking security can be achieved.

Recent information technology literature, in general, and radiology trade journals, in particular, are rife with allusions to the "cloud" suggesting that moving one's compute and storage assets into someone else's data center magically solves cost, performance, and elasticity problems. More likely, one is only trading one set of problems for another, including greater latency (aka slower turnaround times) since the image data must now leave the local area network and travel longer paths via encrypted tunnels. To offset this, an imaging system design is needed that reduces the number of high-latency image transmissions, yet can still leverage cloud strengths. This work explores the requirements for such a design. PMID:23135215

In today's world the art of sending & displaying the hidden information especially in public places, has received more attention and faced many challenges. Therefore, different methods have been proposed so far for hiding information in different cover media. In this paper a method for hiding of information on the billboard display is presented. It is well known that encryption provides secure channels for communicating entities. However, due to lack of covertness on these channels, an eavesdropper can identify encrypted streams through statistical tests and capture them for further cryptanalysis. In this paper we propose a new form of steganography, on-line hiding of information on the output screens of the instrument. This method can be used for announcing a secret message in public place. It can be extended to other means such as electronic advertising board around sports stadium, railway station or airport. This method of steganography is very similar to image steganography and video steganography. Pr...

A new method of multi-bit embedding based on a protocol of secure asymmetric digital watermarking detection is proposed. Secure watermark detection has been achieved by means of allowing watermark verifier to detect a message without any secret information exposed in extraction process. Our methodology is based on an asymmetric property of a watermark algorithm which hybridizes a statistical watermark algorithm and a public-key algorithm. In 2004, Furukawa proposed a secure watermark detection scheme using patchwork watermarking and Paillier encryption, but the feasibility had not tested in his work. We have examined it and have shown that it has a drawback in heavy overhead in processing time. We overcome the issue by replacing the cryptosystem with the modified El Gamal encryption and improve performance in processing time. We have developed software implementation for both methods and have measured effective performance. The obtained result shows that the performance of our method is better than Frukawa's method under most of practical conditions. In our method, multiple bits can be embedded by assigning distinct generators in each bit, while the embedding algorithm of Frukawa's method assumes a single-bit message. This strongly enhances capability of multi-bit information embedding, and also improves communication and computation cost.   

This paper addresses efficient hardware/software implementation approaches for the AES (Advanced Encryption Standard) algorithm and describes the design and performance testing algorithm for embedded system. Also, with the spread of reconfigurable hardware such as FPGAs (Field Programmable Gate Array) embedded cryptographic hardware became cost-effective. Nevertheless, it is worthy to note that nowadays, even hardwired cryptographic algorithms are not so safe. From another side, the self-reconfiguring platform is reported that enables an FPGA to dynamically reconfigure itself under the control of an embedded microprocessor. Hardware acceleration significantly increases the performance of embedded systems built on programmable logic. Allowing a FPGA-based MicroBlaze processor to self-select the coprocessors uses can help reduce area requirements and increase a system's versatility. The architecture proposed in this paper is an optimal hardware implementation algorithm and takes dynamic partially reconfigurable...

Purpose - This paper seeks to advance research and strategies that lead to a heightened awareness of the need to protect data from disclosure, to guarantee the authenticity of data and messages, and to protect systems from network-based attacks. Design/methodology/approach - The paper introduces the necessary mathematics of cryptography: integer and modular arithmetic, linear congruence, Euclidean and extended Euclidean algorithm, Fermat's theorem, and Elliptic curve. Findings - The results indicate that encryption has expanded beyond confidentiality concerns to include techniques for message integrity checking, sender/receiver identity authentication, digital signatures, interactive proofs, and secure computation. Practical implications - The results of this research show that all forms o...

In recent years, a cryptographic construct, called fuzzy vault, has been proposed, which aims to secure critical data (e.g., secret encryption key) with the fingerprint data in a way that only the authorized user can access the secret by providing the valid fingerprint, and some implementation results have been reported. However, all the previous results adopted the brute-force search to reconstruct the polynomial or skipped the procedure for the polynomial reconstruction. In this paper, we propose a fast polynomial reconstruction algorithm for the fuzzy fingerprint vault which can improve the execution time of the brute-force search by a factor of 300?1,500.   

A hybrid two-step attack scheme that combines the chosen-plaintext attack (CPA) and the known-plaintext attack (KPA) algorithms is proposed to acquire the secret keys of the optical cryptosystem based on double-random phase-amplitude encoding (DRPAE) technique. By implementing our presented attack, an opponent can obtain not only the estimated solutions of the two random phase keys but also the accurate solution of the amplitude modulator (AM), which is introduced to the encryption process and regarded as an additional key to enhance the security level of the DRPAE-based cryptosystem. The validity and effectiveness of this attack strategy is analyzed theoretically and then verified by computer simulations.

In conventional interference-based optical encryption schemes, a potential cracker can retrieve partial information (silhouette) of the secret image using only one phase-only mask (POM). We resolve this drawback using a phase-blend operation and piecewise linear chaotic map (PWLCM) to further encode the POMs. One cannot recover a secret image visibly when inverse phase-blend operation and inverse chaotic permutation are not carried out with the correct decryption keys. Chaotic parameters of PWLCM, and random phase-angle function in the phase-blend operation enlarge the key space and improve the security of the proposed system greatly. Numerical simulations and optoelectronic experiments are performed to verify the effectiveness of the proposed scheme.

Encryption performance, in terms of bits per second encrypted, has not scaled well as network performance has increased. The authors felt that multiple encryption modules operating in parallel would be the cornerstone of scalable encryption. One major problem with parallelizing encryption is ensuring that each encryption module is getting the proper portion of the key sequence at the correct point in the encryption or decryption of the message. Many encryption schemes use linear recurring sequences, which may be generated by a linear feedback shift register. Instead of using a linear feedback shift register, the authors describe a method to generate the linear recurring sequence by using parallel decimated sequences, one per encryption module. Computing decimated sequences can be time consuming, so the authors have also described a way to compute these sequences with logic gates rather than arithmetic operations.

Many Petri nets-based methods have been developed and applied to analyze cryptographic protocols. Most of them offer the analysis of one attack trace only. Only a few of them provide the analysis of multiple attack traces, but they are rather inefficient. Similarly, the limitation of the analysis of one attack trace occurs in most model checking methods for cryptographic protocols. Recently, we proposed a simple but practical Petri nets-based model checking methodology for the analysis of cryptographic protocols, which offers an efficient analysis of all attack traces. In our previous analysis, we assume that the underlying cryptographic algorithms are black boxes, and attackers cannot learn anything from cipher text if they do not have a correct key. In this paper, we relax this assumption by considering some algebraic properties of the underlying encryption algorithm. Then, we apply our new method to TMN authenticated key exchange protocol as a case study. Surprisingly, we obtain a very efficient analysis when the numbers of attack traces and states are large, and we discover two new attacks which exploit the algebraic properties of the encryption.   

We proposed an image signature method for content authentication, which applies a hierarchical approach to construct an image signature. In the first level, DWT and DCT are used to extract image features; then these features are encrypted by using sub-keys that are generated by a cryptographically hash function. In the second level, Karhunen-Loeve transformation is used to reduce the signature length. The main features of the proposed method are as follows: (i) It achieves a trade-off between robustness and tampering sensitivity. (ii) It provides a tool for image tampering detection and tampering localization. (iii) It can be used to detect the thumbnail of the large image to improve detection efficiency. (iv) It provides the compact signature, and the signature length is independent of th...

In this paper we design a stream cipher that uses the algebraic structure of the multiplicative group $\\bbbz_p^*$ (where p is a big prime number used in ElGamal algorithm), by defining a quasigroup of order $p-1$ and by doing quasigroup string transformations. The cryptographical strength of the proposed stream cipher is based on the fact that breaking it would be at least as hard as solving systems of multivariate polynomial equations modulo big prime number $p$ which is NP-hard problem and there are no known fast randomized or deterministic algorithms for solving it. Unlikely the speed of known ciphers that work in $\\bbbz_p^*$ for big prime numbers $p$, the speed of this stream cipher both in encryption and decryption phase is comparable with the fastest symmetric-key stream ciphers.

Radio frequency identification (RFID) technology system is quickly evolved many applications to manage personnel can be more efficient for automation systems. We combine the RSA encryption and decryption algorithms to raise the safety and the information security systems. The RFID environment has been communicated to exchange data for heterogeneous wireless networks. In this paper, it is implemented the RFID-based campus system solutions to security and privacy of RFID system for wireless mesh network applications. We propose to enhance the security algorithm combined RFID devices for the antenna arrays system. This paper is also presented the integrated framework for the application and integration systems based on service oriented architecture, and given a specific application of the fra...

The security of our recently proposed dual polarization encryption scheme of images is evaluated by numerical simulations. This consists of testing the resistance of the scheme against brute force, known-plaintext, chosen-plaintext and video sequence attacks. While some attacks are ineffective (brute force, video sequence) others are effective (known-plaintext, chosen-plaintext), but only under certain assumptions. An optimization of the setup, which is based on a regular rotation of polarization optics angles (polarizers, wave plates), is proposed associating the use of a high dynamic range for the key image, or the use of a phase-only spatial light modulator in the target and in the key image channel. The possibility of the attacker decrypting an unknown image is thus strongly reduced. The precision required for optical specifications is also evaluated, in order to ensure a good decryption for an authorized user.

This book contains papers presented at a conference on Optical and Digital Pattern Recognition. Topics include the following: imaging processing; hybrid computers and algorithms, and, parallel algorithms in image processing.

PURPOSE: Current state-of-the-art algorithms for functional uptake volume segmentation in PET imaging consist of threshold-based approaches, whose parameters often require specific optimization for a given scanner and associated reconstruction algorithms. Different advanced image segmentation approa...

This paper discusses two areas of computer vision: image processing hardware and parallel image understanding algorithms; including connectionist theories of perception and cognition and robotic vision.

This report describes the technical accomplishments of the FY96 Cross Cutting and Advanced Technology (CC&AT) project at Los Alamos National Laboratory. The project focused on developing algorithms for segmenting range images. The image segmentation algorithm developed during the project is described here. In addition to segmenting range images, the algorithm can fuse multiple range images thereby providing true 3D scene models. The algorithm has been incorporated into the Rapid World Modelling System at Sandia National Laboratory.

John the Ripper (JtR) is an open source software package commonly used by system administrators to enforce password policy. JtR is designed to attack (i.e., crack) passwords encrypted in a wide variety of commonly used formats. While parallel implementations of JtR exist, there are several limitations to them. This research reports on two distinct algorithms that enhance this password cracking tool using the Message Passing Interface. The first algorithm is a novel approach that uses numerous processors to crack one password by using an innovative approach to workload distribution. In this algorithm the candidate password is distributed to all participating processors and the word list is divided based on probability so that each processor has the same likelihood of cracking the password while eliminating overlapping operations. The second algorithm developed in this research involves dividing the passwords within a password file equally amongst available processors while ensuring load-balanced and fault-tolerant behavior. This paper describes John the Ripper, the design of these two algorithms and preliminary results. Given the same amount of time, the original JtR can crack 29 passwords, whereas our algorithms 1 and 2 can crack an additional 35 and 45 passwords respectively.

Virtual Private Networks (VPN) is an important technology allowing for secure communications through insecure transmission media (i.e., Internet) by adding authentication and encryption to the existing protocols. This paper describes some VPN performance indicators measured over international communication links. An ISDN based VPN link was established between the Joint Research Centre, Ispra site, Italy, and EURATOM Safeguards in Luxembourg. This link connected two EURATOM Safeguards FAST surveillance stations, and used different vendor solutions hardware (Cisco router 1720 and Nokia CC-500 Gateway). To authenticate and secure this international link, we have used several methods at the different levels of the seven-layered ISO network protocol stack (i.e., Callback feature, CHAP - Challenge Handshake Protocol - authentication protocol). The tests made involved the use of different encryption algorithms and the way session secret keys are periodically renewed, considering these elements influence significantly the transmission throughput. Future tests will include the use of a wide variety of wireless media transmission and terminal equipment technologies, in particular PDAs (Personal Digital Assistants) and Notebook PCs. These tests aim at characterising the functionality of VPNs whenever field inspectors wish to contact headquarters to access information from a central archive database or transmit local measurements or documents. These technologies cover wireless transmission needs at different geographical scales: roombased level Bluetooth, floor or building level Wi-Fi and region or country level GPRS.

We propose a framework for joint entropy coding and encryption using Chaotic maps. We begin by observing that the message symbols can be treated as the symbolic sequence of a discrete dynamical system. For an appropriate choice of the dynamical system, we could back-iterate and encode the message as the initial condition of the dynamical system. We show that such an encoding achieves Shannon's entropy and hence optimal for compression. It turns out that the appropriate discrete dynamical system to achieve optimality is the piecewise-linear Generalized Luroth Series (GLS) and further that such an entropy coding technique is exactly equivalent to the popular Arithmetic Coding algorithm. GLS is a generalization of Arithmetic Coding with different modes of operation. GLS preserves the Lebesgue measure and is ergodic. We show that these properties of GLS enable a framework for joint compression and encryption and thus give a justification of the recent work of Grangetto et al. and Wen et al. Both these methods hav...

In (k, n) visual cryptographic schemes (VCS), a secret image is encrypted into n pages of cipher text, each printed on a transparency sheet, which are distributed among n participants. The image can be visually decoded if any k(?2) of these sheets are stacked on top of one another, while this is not possible by stacking any k ? 1 or fewer sheets. We employ a Kronecker algebra to obtain necessary and sufficient conditions for the existence of a (k, n) VCS with a prior specification of relative contrasts that quantify the clarity of the recovered image. The connection of these conditions with an L 1-norm formulation as well as a convenient linear programming formulation is explored. These are employed to settle certain conjectures on contrast optimal VCS for the cases k = 4 and 5. Furthermor...

For the past 10 years, medical imaging techniques have been increasingly applied to forensic investigations. To obtain histological and toxicological information, tissue and liquid samples are required. In this article, we describe the development of a low-cost, secure, and reliable approach for a telematic add-on for remotely planning biopsies on the Virtobot robotic system. Data sets are encrypted and submitted over the Internet. A plugin for the OsiriX medical image viewer allows for remote planning of needle trajectories that are used for needle placement. The application of teleradiological methods to image-guided biopsy in the forensic setting has the potential to reduce costs and, in conjunction with a mobile computer tomographic scanner, allows for tissue sampling in a mass casualty situation involving nuclear, biological, or chemical agents, in a manner that minimizes the risk to involved staff. PMID:22150550

Different chaos synchronization based encryption schemes are reviewed and compared from the practical point of view. As an efficient cryptanalysis tool for chaos encryption, a proposal based on the Error Function Attack is presented systematically and used to evaluate system security. We define a quantitative measure (Quality Factor) of the effective applicability of a chaos encryption scheme, which takes into account the security, the encryption speed, and the robustness against channel noise. A comparison is made of several encryption schemes and it is found that a scheme based on one-way coupled chaotic map lattices performs outstandingly well, as judged from Quality Factor.

In many areas of nuclear materials management there is a need for communication, archival, and retrieval of annotated image data between heterogeneous platforms and devices to effectively implement safety, security, and safeguards of nuclear materials. Current image formats such as JPEG are not ideally suited in such scenarios as they are not scalable to different viewing formats, and do not provide a high-level representation of images that facilitate automatic object/change detection or annotation. The new Scalable Vector Graphics (SVG) open standard for representing graphical information, recommended by the World Wide Web Consortium (W3C) is designed to address issues of image scalability, portability, and annotation. However, until now there has been no viable technology to efficiently field images of high visual quality under this standard. Recently, LANL has developed a vectorized image representation that is compatible with the SVG standard and preserves visual quality. This is based on a new geometric framework for characterizing complex features in real-world imagery that incorporates perceptual principles of processing visual information known from cognitive psychology and vision science, to obtain a polygonal image representation of high fidelity. This representation can take advantage of all textual compression and encryption routines unavailable to other image formats. Moreover, this vectorized image representation can be exploited to facilitate automated object recognition that can reduce time required for data review. The objects/features of interest in these vectorized images can be annotated via animated graphics to facilitate quick and easy display and comprehension of processed image content.

Quantum states cannot be cloned. I show how to extend this property to classical messages encoded using quantum states, a task I call "uncloneable encryption." An uncloneable encryption scheme has the property that an eavesdropper Eve not only cannot read the encrypted message, but she cannot copy it down for later decoding. She could steal it, but then the receiver Bob would not receive the message, and would thus be alerted that something was amiss. I prove that any authentication scheme for quantum states acts as a secure uncloneable encryption scheme. Uncloneable encryption is also closely related to quantum key distribution (QKD), demonstrating a close connection between cryptographic tasks for quantum states and for classical messages. Thus, studying uncloneable encryption and quantum authentication allows for some modest improvements in QKD protocols. While the main results apply to a one-time key with unconditional security, I also show uncloneable encryption remains secure with a pseudorandom key. In...

With the increasing availability of high-resolution isotropic three- or four-dimensional medical datasets from sources such as magnetic resonance imaging, computed tomography, and ultrasound, volumetric image visualization techniques have increased in importance. Over the past two decades, a number of new algorithms and improvements have been developed for practical clinical image display. More recently, further efficiencies have been attained by designing and implementing volume-rendering algorithms on graphics processing units (GPUs). In this paper, we review volumetric image visualization pipelines, algorithms, and medical applications. We also illustrate our algorithm implementation and evaluation results, and address the advantages and drawbacks of each algorithm in terms of image qua...

We investigate a simple agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications, capturing the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing it on random geometric graphs, local communications being local broadcasts, we can model the corresponding agreement dynamics in large-scale, autonomously operating wireless sensor networks. A potential application of the algorithm is encryption key creation for a community of agents for secure communications, visible only to the members of the community. The late-stage temporal behavior of the dynamics of the Naming Game can be understood in terms of the theory of coarsening, occurring in domain and phase ordering in physical and chemical systems.

The Authenticated Tracking and Monitoring System (ATMS) has been designed to address the need for global monitoring of the status and location of proliferation-sensitive items. Conceived to utilize the proposed Global Verification and Location System (GVLS) satellite link, ATMS could use the existing International Maritime Satellite commercial communication system until GVLS is operational. The ATMS concept uses sensor packs to monitor items and environmental conditions, collects a variety of event data through a sensor processing unit, and transmits the data to a satellite, which then sends data to ground stations. Authentication and encryption algorithms will be used to secure the data. A typical ATMS application would be to track and monitor the safety and security of a number of items in transit along a scheduled shipping route. This paper also discusses a proof-of-concept system demonstration.

Secure communication by the synchronization of coupled chaotic systems may be destroyed by channel noise and inaccurate estimation of system parameters. This paper attempts to develop a robust synchronization scheme for two different chaotic systems which are exposed to a bounded noise and their parameters are uncertain. Based on the Lyapunov stability theory and the dead-zone algorithm, a controller that is robust to a bounded noise and independent of the system parameters is proposed to asymptotically synchronize two different chaotic systems. The proposed synchronization controller is embedded in a secure communication scheme, which is not only robust to the channel noise but can also incorporate the noise as part of the encryption key and thus enhance the key security. Numerical simula...

The Authenticated Tracking and Monitoring System (ATMS) is designed to answer the need for global monitoring of the status and location of proliferation-sensitive items on a worldwide basis, 24 hours a day. ATMS uses wireless sensor packs to monitor the status of the items within the shipment and surrounding environmental conditions. Receiver and processing units collect a variety of sensor event data that is integrated with GPS tracking data. The collected data are transmitted to the International Maritime Satellite (INMARSAT) communication system, which then sends the data to mobile ground stations. Authentication and encryption algorithms secure the data during communication activities. A typical ATMS application would be to track and monitor the stiety and security of a number of items in transit along a scheduled shipping route. The resulting tracking, timing, and status information could then be processed to ensure compliance with various agreements.

Proper privacy protection in RFID systems is important. However, many of the schemes known are impractical, either because they use hash functions instead of the more hardware efficient symmetric encryption schemes as a efficient cryptographic primitive, or because they incur a rather costly key search time penalty at the reader. Moreover, they do not allow for dynamic, fine-grained access control to the tag that cater for more complex usage scenarios. In this paper we investigate such scenarios, and propose a model and corresponding privacy friendly protocols for efficient and fine-grained management of access permissions to tags. In particular we propose an efficient mutual authentication protocol between a tag and a reader that achieves a reasonable level of privacy, using only symmetric key cryptography on the tag, while not requiring a costly key-search algorithm at the reader side. Moreover, our protocol is able to recover from stolen readers.

A fundamentally new algorithm for data compression is considered. A theoretical basis is provided for the formation, modification, and conversion of data positions aimed at their reversible compression. The specifics are described of a method development based on structure encryption, i.e., reformatting the architecture of the compressed data alphabet based on the positionality and conditionality properties of the compression level and the structural numbering of the reformatted alphabet?s architecture in a positional multilevel space. We substantiate the principle of redundancy reduction due to the following: the simultaneous modification of the positions inhibiting the appearance of noninteger values of new positions and constraints on the digit capacity of the elements in positioning ar...

With the proliferation of IEEE 802.11 wireless local area networks, large numbers of wireless access points have been deployed, and it is often the case that a user can detect several access points simultaneously in dense metropolitan areas. Most owners, however, encrypt their networks to prevent the public from accessing them due to the increased traffic and security risk. In this work, we use pricing as an incentive mechanism to motivate the owners to share their networks with the public, while at the same time satisfying users' service demand. Specifically, we propose a “federated network” concept, in which radio resources of various wireless local area networks are managed together. Our algorithm identifies two candidate access points with the lowest price being offered (if available) to each user. We then model the price announcements of access points as a game, and characterize the Nash Equilibrium of the system. The efficiency of the Nash Equilibrium solution is evaluated via simulation studies as well.   

In this paper, a data-hiding algorithm with large data payload for H.264/AVC is proposed. The secret information is embedded by modulating the prediction modes of 4??4 luminance blocks. If the best mode does not match the information bit, the prediction mode should be modulated by replacing the best mode with the substitute mode. The substitute mode is the one with the least Lagrangian cost among those having different parity with the best mode. Due to high secrecy and easy reproducibility of chaos, the secret information is first encrypted by a chaotic sequence and then a small number of luminance blocks used for data embedding are randomly selected in each macroblock based on another chaotic sequence. The usefulness of multilevel chaotic keys and privacy of the number of 4??4 luminance...

Due to the enormous spreading of applied wireless networks, security is actually one of the most important issues for telecommunications. One of the main issue in the field of securing wireless information exchanging is the initial common knowledge between source and destination. A shared secret is normally mandatory in order to decide the encryption (algorithm or code or key) of the information stream. It is usual to exchange this common a priori knowledge by using a ?secure?? channel. Nowadays a secure wireless channel is not possible. In fact normally the common a priori knowledge is already established (but this is not secure) or by using a non-radio channel (that implies a waste of time and resource). This contribution deals with the proposal of a new modulation technique ensuring sec...

Nowadays, a user authentication is very important in network environments. For safe authentication, they came up with six essential conditions in earlier studies. And a variety of mechanisms is presented by research scientists. However, they could not achieve the PFS. Because, though all these schemes are assumed that the communication between a smart card and a host is safe, actually it is not. Therefore, in this paper, we will point out what the communication between a smart card and a host is not safe, and propose a new user authentication mechanism that can reach to the PFS. And also, an encryption algorithm is used about 45% less than earlier studies in our proposed scheme. Thus, we can say that enhance the efficiency.   

The present conference on microwave frequency electronic warfare and military sensor equipment developments consider radar warning receivers, optical frequency spread spectrum systems, mobile digital communications troposcatter effects, wideband bulk encryption, long range air defense radars (such as the AR320, W-2000 and Martello), multistatic radars, and multimode airborne and interceptor radars. IR system and subsystem component topics encompass thermal imaging and active IR countermeasures, class 1 modules, and diamond coatings, while additional radar-related topics include radar clutter in airborne maritime reconnaissance systems, microstrip antennas with dual polarization capability, the synthesis of shaped beam antenna patterns, planar phased arrays, radar signal processing, radar cross section measurement techniques, and radar imaging and pattern analysis. Attention is also given to optical control and signal processing, mm-wave control technology and EW systems, W-band operations, planar mm-wave arrays, mm-wave monolithic solid state components, mm-wave sensor technology, GaAs monolithic ICs, and dielectric resonator and wideband tunable oscillators.

It requires spatio-temporal recognition of point and resolved objects at high ... image processing scene acquisition object discrimination spatio-temporal ... 2-D imaging 3-D imaging parallel processing algorithms linear vector signals, en_US ...

An algorithm for determining satellite track endpoints with sub-pixel resolution in spaced-based images is presented. The algorithm allows for significant curvature in the imaged track due to rotation of the spacecraft capturing the image. The motivation behind the subpixel endpoint determination is first presented, followed by a description of the methodology used. Results from running the algorithm on real ground-based and simulated spaced-based images are shown to highlight its effectiveness.

The need for data encryption that protects sensitive data in a database has increased rapidly. However, encrypted data can no longer be efficiently queried because nearly all of the data should be decrypted. Several order-preserving encryption schemes that enable indexes to be built over encrypted data have been suggested to solve this problem. They allow any comparison operation to be directly applied to encrypted data. However, one of the main disadvantages of these schemes is that they expose sensitive data to inference attacks with order information, especially when the data are used together with unencrypted columns in the database. In this study, a new order-preserving encryption scheme that provides secure queries by hiding the order is introduced. Moreover, it provides efficient queries because any user who has the encryption key knows the order. The proposed scheme is designed to be efficient and secure in such an environment. Thus, it is possible to encrypt only sensitive data while leaving other data unencrypted. The encryption is not only robust against order exposure, but also shows high performance for any query over encrypted data. In addition, the proposed scheme provides strong updates without assumptions of the distribution of plaintext. This allows it to be integrated easily with the existing database system.   

We have designed a new class of public key algorithms based on quasigroup string transformations using a specific class of quasigroups called multivariate quadratic quasigroups (MQQ). Our public key algorithm is a bijective mapping, it does not perform message expansions and can be used both for encryption and signatures. The public key consist of n quadratic polynomials with n variables where n=140, 160, ... . A particular characteristic of our public key algorithm is that it is very fast and highly parallelizable. More concretely, it has the speed of a typical modern symmetric block cipher - the reason for the phrase "A Public Key Block Cipher" in the title of this paper. Namely the reference C code for the 160-bit variant of the algorithm performs decryption in less than 11,000 cycles (on Intel Core 2 Duo -- using only one processor core), and around 6,000 cycles using two CPU cores and OpenMP 2.0 library. However, implemented in Xilinx Virtex-5 FPGA that is running on 249.4 MHz it achieves decryption thro...

Multifarious image enhancement algorithms have been used in different applications. Still, some algorithms or modules are imperfect for practical use. When the image enhancement modules have been fixed or combined by a series of algorithms, we need to repair them as a whole part without changing the inside. This report aims to find an algorithm based on trained filters to repair low-quality image enhancement modules. A brief review on basic image enhancement techniques and pixel classification methods will be presented, and the procedure of trained filters will be described step by step. The experiments and result comparisons for this algorithm will be described in detail.

Time-frequency representations of audio signals often resemble texture images. This paper derives a simple audio classification algorithm based on treating sound spectrograms as texture images. The algorithm is inspired by an earlier visual classification scheme particularly efficient at classifying textures. While solely based on time-frequency texture features, the algorithm achieves surprisingly good performance in musical instrument classification experiments.

In this paper, the authors propose a new algorithm to hide data inside image using steganography technique. The proposed algorithm uses binary codes and pixels inside an image. The zipped file is used before it is converted to binary codes to maximize the storage of data inside the image. By applying the proposed algorithm, a system called Steganography Imaging System (SIS) is developed. The system is then tested to see the viability of the proposed algorithm. Various sizes of data are stored inside the images and the PSNR (Peak signal-to-noise ratio) is also captured for each of the images tested. Based on the PSNR value of each images, the stego image has a higher PSNR value. Hence this new steganography algorithm is very efficient to hide the data inside the image.

We study the semi-convergence behavior of the projected SIRT algorithms, including the projected Landweber algorithm. Inspired by recent work on the standard algorithms, we propose new ways to specify the relaxation parameters for the projected algorithms, in such a way that the propagated noise component of the solution is controlled. We demonstrate the performance of our strategies by examples taken from tomographic imaging.

Iterative image reconstruction algorithms for optoacoustic tomography (OAT), also known as photoacoustic tomography, have the ability to improve image quality over analytic algorithms due to their ability to incorporate accurate models of the imaging physics, instrument response, and measurement noise. However, to date, there have been few reported attempts to employ advanced iterative image reconstruction algorithms for improving image quality in three-dimensional (3D) OAT. In this work, we implement and investigate two iterative image reconstruction methods for use with a 3D OAT small animal imager: namely, a penalized least-squares (PLS) method employing a quadratic smoothness penalty and a PLS method employing a total variation norm penalty. The reconstruction algorithms employ accurate models of the ultrasonic transducer impulse responses. Experimental data sets are employed to compare the performances of the iterative reconstruction algorithms to that of a 3D filtered backprojection (FBP) algorithm. By ...

Purpose: To build an infrastructure that enables radiologists on-call and external users a teleradiological access to the HTML-based image distribution system inside the hospital via internet. In addition, no investment costs should arise on the user side and the image data should be sent renamed using cryptographic techniques. Materials and Methods: A pure HTML-based system manages the image distribution inside the hospital, with an open source project extending this system through a secure gateway outside the firewall of the hospital. The gateway handles the communication between the external users and the HTML server within the network of the hospital. A second firewall is installed between the gateway and the external users and builds up a virtual private network (VPN). A connection between the gateway and the external user is only acknowledged if the computers involved authenticate each other via certificates and the external users authenticate via a multi-stage password system. All data are transferred encrypted. External users get only access to images that have been renamed to a pseudonym by means of automated processing before. Results: With an ADSL internet access, external users achieve an image load frequency of 0.4 CT images per second. More than 90% of the delay during image transfer results from security checks within the firewalls. Data passing the gateway induce no measurable delay. (orig.)

In this paper, we propose an encryption-based multilevel model for database management systems. The proposed model is a combination of the Multilevel Relational (MLR) model and an encryption system. This encryption system encrypts each data in the tuple with different field-key according to a security class of the data element. Each field is decrypted individually by the field-key of which security class is higher than or equal to that of the encrypted field-key. The proposed model is characterized by three achievements: (1) utilizing an encryption system as an additional security layer over the multilevel security layer for the database, (2) reducing the multilevel database size, and (3) improving the response time of the data retrieval from the multilevel database. Also this paper summar...

In order to overcome the disadvantages of low accuracy rate, high complexity and poor robustness to image noise in many traditional algorithms of cloud image detection, this paper proposed a novel algorithm on the basis of Markov Random Field (MRF) modeling. This paper first defined algorithm model and derived the core factors affecting the performance of the algorithm, and then, the solving of this algorithm was obtained by the use of Belief Propagation (BP) algorithm and Iterated Conditional Modes (ICM) algorithm. Finally, experiments indicate that this algorithm for the cloud image detection has higher average accuracy rate which is about 98.76% and the average result can also reach 96.92% for different type of image noise.

Many classical encoding algorithms of Vector Quantization (VQ) that can obtain global optimal solution have computational complexity O(N). In this paper, a quantum VQ encoding algorithm with computational complexity less than sqrt(N)that for most images is presented.

Oct 31, 2009 ... All supporting documentation for algorithms and code shall be delivered within 6 ...... Develop the lattice Boltzmann algorithms for hydrodynamics to be ...... shall advance the development of the current 3D-IPE (3-D Image ...

This book presents papers given at a conference on acoustics, speech and signal processing. Topics included the following: algorithms for signal approximation; flatwire extraction by spline functions; shape recognition; object classification and registration by fast Radon transform based invariants; shape coding and representation algorithms; image processing of noise images; texture and recognition; and real-time analysis of full spray images.

For ghost imaging, pursuing high resolution images and short acquisition times required for reconstructing images are always two main goals. We report an image reconstruction algorithm called compressive sampling (CS) reconstruction to recover ghost images. By CS reconstruction, ghost imaging with both super-resolution and a good signal-to-noise ratio can be obtained via short acquisition times. Both effect influencing and approaches further improving the resolution of ghost images via CS reconstruction, relationship between ghost imaging and CS theory are also discussed.

Diffraction calculations, such as the angular spectrum method and Fresnel diffractions, are used for calculating scalar light propagation. The calculations are used in wide-ranging optics fields: for example, Computer Generated Holograms (CGHs), digital holography, diffractive optical elements, microscopy, image encryption and decryption, three-dimensional analysis for optical devices and so on. However, increasing demands made by large-scale diffraction calculations have rendered the computational power of recent computers insufficient. We have already developed a numerical library for diffraction calculations using a Graphic Processing Unit (GPU), which was named the GWO library. However, this GWO library is not user-friendly, since it is based on C language and was also run only on a GPU. In this paper, we develop a new C++ class library for diffraction and CGH calculations, which is referred to as a CWO++ library, running on a CPU and GPU. We also describe the structure, performance, and usage examples of the CWO++ library.

Diffraction calculations, such as the angular spectrum method and Fresnel diffractions, are used for calculating scalar light propagation. The calculations are used in wide-ranging optics fields: for example, Computer Generated Holograms (CGHs), digital holography, diffractive optical elements, microscopy, image encryption and decryption, three-dimensional analysis for optical devices and so on. However, increasing demands made by large-scale diffraction calculations have rendered the computational power of recent computers insufficient. We have already developed a numerical library for diffraction calculations using a Graphic Processing Unit (GPU), which was named the GWO library. However, this GWO library is not user-friendly, since it is based on C language and was also run only on a GP...

A picture can tell a thousand words, but it may also be used to hide them, too. Steganography involves hiding information inside other information. Text can be hidden in images, sound files, or even other text. The methods for doing this, and for detecting it when it happens, have evolved over time. David Frith, senior consultant at Siemens Insight Consulting, explains the history and future of steganography, and discusses some of the techniques both for doing it, and undoing it. This article offers an explanation of how steganography works, its limitations and the various approaches used. It also reviews some of the implications of hidden encryption for those who fight it and the various detection options and tools that can be used.

Electrical Capacitance Tomography (ECT) image reconstruction is a key problem that is not well solved due to the influence of soft-field in the ECT system. In this paper, a new hybrid ECT image reconstruction algorithm is proposed by combining Tikhonov regularization theory and Simultaneous Reconstruction Technique (SIRT) algorithm. Tikhonov regularization theory is used to solve ill-posed image reconstruction problem to obtain a stable original reconstructed image in the region of the optimized solution aggregate. Then, SIRT algorithm is used to improve the quality of the final reconstructed image. In order to satisfy the industrial requirement of real-time computation, the proposed algorithm is further been modified to improve the calculation speed. Test results show that the quality of reconstructed image is better than that of the well-known Filter Linear Back Projection (FLBP) algorithm and the time consumption of the new algorithm is less than 0.1 second that satisfies the online requirements.

Sequences of random bits can be extracted from small areas of paper by probing its 3D structure. The same sequence can be obtained with a high probability even after repositioning the sample. Such a random fingerprint can be used for encryption. This property of paper for self-encryption can be used to secure information printed on the document. By combining self-encryption with some classical encryption methods could lead to a significant progress in the fight against counterfeiting because decryption is equivalent to proving originality of the paper document.

A new single-frame blind deconvolution algorithm for the linear shift-invariant imaging system is presented. The algorithm processes the partial images segmented from one single degraded image by multi-frame approach to recover the point spread function (PSF). Then a deconvolution method is employed to restore the whole image with the recovered PSF. In addition, in order to improve the fidelity and resolution of the recovered PSF, the coprimeness of the partial images is utilized. Results of simulated and real atmospheric turbulence degraded images using the algorithm are reported.

This paper presents a combined DWT and LSB based biometric watermarking algorithm that securely embeds a face template in a fingerprint image. The proposed algorithm is robust to geometric and frequency attacks and protects the integrity of both the face template and the fingerprint image. Experimental results performed on a database of 750 face and 750 fingerprint images show that the algorithm has the advantages of both the existing DWT and LSB based algorithms. A multimodal biometric algorithm is used as a metric to evaluate the combined performance of both face and fingerprint recognition.   

We describe an algorithm to enhance and binarize a fingerprint image. The algorithm is based on accurate determination of orientation flow of the ridges of the fingerprint image by computing variance of the neighborhood pixels around a pixel in different directions. We show that an iterative algorithm which captures the mutual interdependence of orientation flow computation, enhancement and binarization gives very good results on poor quality images.

Algorithmic and software support of an interactive problem-solving system based on levelwise image transmission through the Internet and hierarchical video data representation structures is described.

In this paper, we propose an image completion algorithm which takes advantage of the countless number of images available on Internet photo sharing sites to replace occlusions in an input image. The algorithm 1) automatically selects the most suitable images from a database of downloaded images and 2) seamlessly completes the input image using the selected images with minimal user intervention. Experimental results on input images captured at various locations and scene conditions demonstrate the effectiveness of the proposed technique in seamlessly reconstructing user-defined occlusions.   

We present a new sketch-based product form exploration technique that works from images and sketches of existing products. At the heart of our approach, is a multi-stroke curve beautification method and a curve-based image deformation algorithm. The proposed approach converts groups of strokes into piecewise clothoid curves in order to produce visually pleasing shapes. The deformation diffusion algorithm then spatially distributes the user specified deformations through out the image to produce smooth transformations from the original image to the resulting image. We demonstrate the technique on a variety of images including photo-realistic images, real product images, and sketches.

This thesis uses detailed physical models to derive algorithms for computer vision. General models are adopted which describe the interaction of light with surfaces in image formation. Objects are modeled in terms of their geometric and physical properties. From the models, the author examine the structure of reflectance functions and derive several vision algorithms. The first algorithm contributes to color image segmentation. This algorithm is used to classify surfaces according to material composition. Two other algorithms are derived which are used to infer intrinsic properties of an object from an image. The first algorithm is used to infer local surface shape from specular reflection. The second algorithm is used to infer surface spectral reflectance. Experimental results obtained using these algorithms are presented.

We describe a simple technique for coaxial holographic image recording and reconstruction, employing a spatial light modulator (SLM) modified in pure phase mode. In the image encoding system, both the reference beam in the outside part and the signal beam in the inside part are displayed by an SLM based on the twisted nematic LCD. For a binary image, the part with amplitude of "1" is modulated with random phase, while the part with amplitude of "0" is modulated with constant phase. After blocking the dc component of the spatial frequencies, a Fourier transform (FT) hologram is recorded with a uniform intensity distribution. The amplitude image is reconstructed by illuminating the reference beam onto the hologram, which is much simpler than existing phase modulated FT holography techniques. The technique of coaxial holographic image encoding and recovering with pure phase modulation is demonstrated theoretically and experimentally in this paper. As the holograms are recorded without the high-intensity dc component, the storage density with volume medium may be increased with the increase of dynamic range. Such a simple modulation method will have potential applications in areas such as holographic encryption and high-density disk storage systems. PMID:22192995

by collision or volcanic activities. ... image after edge filtering and convex analysis . ... are set in the crater matching algorithm to ensure a high probability of .... images, two hash tables are created and each contains the invarizuits (Eq. 10) for ...

images of the globular cluster NGC, 6397 observed with 11S?' approximately two ... dctcctccl stars from the images and reran the finding algorithm to scarcll for any newly-revealed ... tlla)) it lMC1 bee

We have designed computer programs to simulate ultrasound projection scans and to reconstruct the tomographic planar image. We have also used the reconstruction algorithm on actual test data and have obtained a crude but promising image. 11 refs., 9 figs.

Storing digital medical images is standardized by the digital imaging and communications in Medicine (DICOM) report. Lossy pulse-echo ultrasonic image compression by a joint photographic expert group (JPEG) baseline system is permitted by it. Although significant compression is achievable by lossy algorithms, they do not permit the exact recovery of the original image. The objective of this study is to reduce the data volume and to achieve a low bit rate in the digital representation of pulse-echo ultrasonic images without a perceived loss in image quality. In image compression with a JPEG baseline system, it is possible to control the compression ratio and image quality by controlling quantization values. In this paper, we apply the Hamiltonian algorithm to optimize JPEG quantization tables. We construct the evaluation function involving the compression ratio and image quality. Results reveal that it is possible to optimize these quantization values by the Hamiltonian algorithm for lossy pulse-echo ultrasonic image compression.   

The Hurricane Imaging Radiometer System (HIRAD) is a new airborne passive microwave remote sensor developed to observe hurricanes. HIRAD incorporates synthetic thinned array radiometry technology, which use Fourier synthesis to reconstruct images from an array of correlated antenna elements. The HIRAD system response to a point emitter has been measured in an anechoic chamber. With this data, a Fourier inversion image reconstruction algorithm has been developed. Performance analysis of the apparatus is presented, along with an overview of the image reconstruction algorithm

Image filtering algorithms are applied on images to remove the different types of noise that are either present in the image during capturing or injected in to the image during transmission. Underwater images when captured usually have Gaussian noise, speckle noise and salt and pepper noise. In this work, five different image filtering algorithms are compared for the three different noise types. The performances of the filters are compared using the Peak Signal to Noise Ratio (PSNR) and Mean Square Error (MSE). The modified spatial median filter gives desirable results in terms of the above two parameters for the three different noise. Forty underwater images are taken for study.

In this paper, an information-theoretic approach for multimodal image registration is presented. In the proposed approach, image registration is carried out by maximizing a Tsallis entropy-based divergence using a modified simultaneous perturbation stochastic approximation algorithm. This divergence measure achieves its maximum value when the conditional intensity probabilities of the transformed target image given the reference image are degenerate distributions. Experimental results are provided to demonstrate the registration accuracy of the proposed approach in comparison to existing entropic image alignment techniques. The feasibility of the proposed algorithm is demonstrated on medical images from magnetic resonance imaging, computer tomography, and positron emission tomography.

The Hidden Vector Encryption scheme is one of the searchable public key encryption schemes that allow for searching encrypted data. The Hidden Vector Encryption scheme supports conjunctive equality, comparison, and subset queries, as well as arbitrary conjunctive combinations of these queries. In a Hidden Vector Encryption scheme, a receiver generates a token for a vector of searchable components and sends the token to a query server which has the capability to evaluate it on encrypted data. All of the existing Hidden Vector Encryption schemes, which are all pairing-based, require token elements and pairing computations proportional to the number of searchable components in the token. In this paper, we suggest an improved paring-based Hidden Vector Encryption scheme where the token elements and pairing computations are independent of the number of searchable components. Namely, for an arbitrary conjunctive search query, the token is of size O(1) and the query server only needs O(1) pairing computations. The latter improvement in particular might be very attractive to a query server in a larger search system with many users. To achieve our goal, we introduce a novel technique to generate a token, which may be of independent interest.   

This paper explains the recent developments in security and encryption. The Butterfly cipher and quantum cryptography are reviewed and compared. Examples of their relative uses are discussed and suggestions for future developments considered. In addition application to network security together with a substantial review of classification of encryption systems and a summary of security weaknesses are considered.

A 64Kb logic Resistive Random Access Memory (RRAM) test chip for encryption keys storage is presented for the first time. The excellent security features of resisting physical attacks and side-channel attacks are theoretically analyzed and experimentally proved. The chip is fabricated in 0.13µm standard logic process, and can directly integrate with encryption logic circuits of information systems.   

We extend the generic framework of reproducibility for reuse of randomness in multi-recipient encryption schemes as proposed by Bel- lare et al. (PKC 2003). A new notion of weak reproducibility captures not only encryption schemes which are (fully) reproducible under the criteria given in the pr...

New clinical studies in medicine are based on patients and controls using different imaging diagnostic modalities. Medical information systems are not designed for clinical trials employing clinical imaging. Although commercial software and communication systems focus on storage of image data, they are not suitable for storage and mining of new types of quantitative data. We sought to design a Web-tool to support diagnostic clinical trials involving different experts and hospitals or research centres. The image analysis of this project is based on skeletal X-ray imaging. It involves a computerised image method using quantitative analysis of regions of interest in healthy bone and skeletal metastases. The database is implemented with ASP.NET 3.5 and C# technologies for our Web-based application. For data storage, we chose MySQL v.5.0, one of the most popular open source databases. User logins were necessary, and access to patient data was logged for auditing. For security, all data transmissions were carried over encrypted connections. This Web-tool is available to users scattered at different locations; it allows an efficient organisation and storage of data (case report form) and images and allows each user to know precisely what his task is. The advantages of our Web-tool are as follows: (1) sustainability is guaranteed; (2) network locations for collection of data are secured; (3) all clinical information is stored together with the original images and the results derived from processed images and statistical analysis that enable us to perform retrospective studies; (4) changes are easily incorporated because of the modular architecture; and (5) assessment of trial data collected at different sites is centralised to reduce statistical variance. PMID:20517632

A new natural gradient-based algorithm for a blind deconvolution of blurred images is proposed. In the proposed algorithm, phase spectral constraint condition is newly introduced, and a natural gradient descent method on an amplitude spectrum is applied. The effectiveness of the proposed algorithm is confirmed by comparing with the conventional method.   

Geometric tomography and conventional algebraic tomography algorithms are used to reconstruct cross-sections of an InAs nanowire from a tilt series of experimental annular dark-field images. Both algorithms are also applied to a test object to assess what factors affect the reconstruction quality. When using the present algorithms, geometric tomography is faster, but artifacts in the reconstruction may be difficult to recognize.

The principles of image reconstruction in positron emission tomography will be presented in the lecture. The filtered backprojection algorithm will be explained in detail for 2D reconstruction. The generalization of the algorithm in 3D will be described. A brief introduction to iterative reconstruction methods will be given, and their advantages and disadvantages against the filtered backprojection algorithm will be discussed.

We present an algorithm to segment an unstructured table top scene. Operating on the depth image of a Kinect camera, the algorithm robustly separates objects of previously unknown shape in cluttered scenes of stacked and partially occluded objects. The model-free algorithm finds smooth surface patch...

In this paper, we propose a cryptosystem which can encrypt and decrypt long (text) messages in efficient manner. The proposed cryptosystem is a combination of symmetric-key and asymmetric-key cryptography, where asymmetric-key cryptography is used to transmit the secret key to an intended receiver and the sender/receiver encrypts/decrypts messages using that secret key. In 2002, Hwang et al. proposed a scheme for encrypting long messages. The main drawback of their scheme is that it requires more computational overhead. Our proposed scheme is more efficient from the computational point of view compared to that of their scheme. Our scheme is a block cipher, long messages are broken into fixed length plaintext blocks for encryption. It supports parallel computation, since encryption/decryption of all the blocks of plaintext/plaintext are independent and thus can be carried out simultaneously. In addition, our scheme retains the same security level as their scheme.

A new GPU-based scan-conversion algorithm implemented using OpenGL is described. The compute performance of this new algorithm running on a modem GPU is compared to the performance of three common scan-conversion algorithms (nearest-neighbor, linear interpolation and bilinear interpolation) implemented in software using a modem CPU. The quality of the images produced by the algorithm, as measured by signal-to-noise power, is also compared to the quality of the images produced using these three common scan-conversion algorithms. PMID:21710829

Time-reversal with Multiple Signal Classification (TR-MUSIC) is an ultrasound imaging algorithm for detecting small targets embedded in a medium. This technique can produce images with subwavelength resolution when the targets are pointlike, and when the number of targets is fewer than the number of transducer elements used to image the medium. In this experimental study, we evaluate the performance of the TR-MUSIC algorithm when the interrogated medium contains extended targets that cannot be considered as point scatterers. We construct tissue-mimicking phantoms embedded with distributed glass spheres. We show that the quality of the phantom images obtained using the TR-MUSIC algorithm decreases with increasing sphere size. However, significant improvement is achieved when the image plane is divided into sub-regions, where each sub-region is imaged separately. The windowed TR-MUSIC algorithm accurately locates the spheres (extended targets), but the images do not provide quantitative information about the shape and reflectivity of the spheres.

In order to improve image quality, a novel Retinex algorithm for image enhancement was presented. Different from conventional algorithms, it was based on certain defined points containing the illumination information in the intensity image to estimate the illumination. After locating the points, the whole illumination image was computed by an interpolation technique. When attempting to recover the reflectance image, an adaptive method which can be considered as an optimization problem was employed to suppress noise in dark environments and keep details in other areas. For color images, it was taken in the band of each channel separately. Experimental results demonstrate that the proposed algorithm is superior to the traditional Retinex algorithms in image entropy.

Robot vision algorithms have been implemented on an 8-node NCUBE-AT hypercube system onboard a mobile robot (HERMIES) developed at Oak Ridge National Laboratory. Images are digitized using a faremgrabber mounted in a VME rack. Image processing and analysis are performed on the hypercube system. The vision system is integrated with robot navigation and control software, enabling the robot to find the front of a mockup control panel, move up to the panel, and read an analog meter. Among the concurrent algorithms used for image analysis are a new component labelign algorithm and a Hough transform algorithm with load balancing. 14 refs., 3 figs., 2 tabs.

In this paper an Adaptive Bacterial Foraging is proposed for fuzzy entropy optimization when it is applied to the segmentation of gray images. The proposed algorithm represents the improved version of classical bacterial foraging algorithm which is a newly developed stochastic optimization tool. This optimization technique is applied for optimization of the fitness function which is fuzzy entropy. Classical bacterial foraging algorithm is improved by adaptively selecting the exploitation and exploration state in chemotaxis of E.coli. bacteria. The newly developed algorithm is applied on benchmark gray images and proved to be suitable for thresholding based image segmentation.

This master's thesis develops an algorithm for tracking of cars robust enough to handle turning cars. It is implemented in the image processing environment Image Processing Application Programming Interface (IPAPI) for use with the WITAS project. Firstly, algorithms, comparable with one currently us...

A new inverse microwave imaging algorithm is presented which has the ability to obtain quantitative dielectric maps of large biological bodies. By using a priori information, obtained with a first order algorithm, the final image is obtained by solving the direct problem and an ill-conditioned syste...

We propose an algorithm that can be used by amateur astronomers to analyze the images acquired during solar eclipses. The proposed algorithm analyzes the image, detects the eclipse and produces results for parameters like magnitude of eclipse, eclipse obscuration and the approximate distance between the Earth and the Moon.

In this paper, we develop a free space detection algorithm for the visual navigation of the autonomous robot mounting a catadioptiric omnidirectional imaging system. The algorithm detects the dominant plane as the free space from a sequence of omnidirectional images cap- tured by a camera mounted on...

This book presents the papers given at a conference on image processing and pattern recognition. Topics considered at the conference included the shape of three-dimensional objects, algorithms, map data, optimization, the segmentation of images, data analysis, computerized simulation, parallel processing, computer graphics, robot vision, parallel processors, satellite imagery, signal-to-noise ratio, vectors, image analysis in petrography, and real-time image processing.

In this paper, we propose an algorithm for automated segmentation of midsagittal brain MR images. First, we apply thresholding to obtain binary images. From the binary images, we locate some landmarks. Based on the landmarks and anatomical information, we preprocess the binary images, which substant...

Many applications such as real-time image processing and pattern recognition require computational capability far beyond what can be obtained from the fastest single processor computer available. Hence, their utility is restricted. In this thesis, the author deals with the development of efficient parallel algorithms for some of the important pattern recognition and image-processing tasks: image template matching, image shrinking, image expanding, image translation, image rotation, image scaling, median filtering, pattern clustering and string-to-string editing. Most of his algorithms are optimal and/or have optimal processor-time product. He shows that the hypercube is a good general-purpose interconnection network for the above image-processing and pattern-recognition tasks. He implements some of his algorithms on a NCUBE/7 hypercube with 64 nodes. The experiments suggest that it is possible to achieve good speedups on a NCUBE/7 for many of the applications.

Assuming a resonant origin of the twin peak quasiperiodic oscillations observed in the X-ray neutron star binary systems, we apply a genetic algorithm method for selection of neutron star models. It was suggested that pairs of kilohertz peaks in the X-ray Fourier power density spectra of some neutron stars reflect a non-linear resonance between two modes of accretion disk oscillations. We investigate this concept for a specific neutron star source. Each neutron star model is characterized by the equation of state (EOS), rotation frequency ? and central energy density rho_{c}. These determine the spacetime structure governing geodesic motion and position dependent radial and vertical epicyclic oscillations related to the stable circular geodesics. Particular kinds of resonances (KR) between the oscillations with epicyclic frequencies, or the frequencies derived from them, can take place at special positions assigned ambiguously to the spacetime structure. The pairs of resonant eigenfrequencies relevant to those positions are therefore fully given by KR, rho_{c}, ?, EOS and can be compared to the observationally determined pairs of eigenfrequencies in order to eliminate the unsatisfactory sets (KR, rho_{c}, ?, EOS). For the elimination we use the advanced genetic algorithm. Genetic algorithm comes out from the method of natural selection when subjects with the best adaptation to assigned conditions have most chances to survive. The chosen genetic algorithm with sexual reproduction contains one chromosome with restricted lifetime, uniform crossing and genes of type 3/3/5. For encryption of physical description (KR, rho_{c}, ?, EOS) into the chromosome we use the Gray code. As a fitness function we use correspondence between the observed and calculated pairs of eigenfrequencies.

A vehicle detection plays an important role in the traffic control at signalised intersections. This paper introduces a vision-based algorithm for vehicles presence recognition in detection zones. The algorithm uses linguistic variables to evaluate local attributes of an input image. The image attributes are categorised as vehicle, background or unknown features. Experimental results on complex traffic scenes show that the proposed algorithm is effective for a real-time vehicles detection.

We develop an efficient algorithm for Synthetic Aperture Sonar imaging based on the one-way wave equations. The algorithm utilizes the operator-splitting method to integrate the one-way wave equations. The well-posedness of the one-way wave equations and the proposed algorithm is shown. A computational result against real field data is reported and the resulting image is enhanced by the BV-like regularization.

A simple approach for orthogonal wavelets in compressed sensing (CS) applications is presented. We compare efficient algorithm for different orthogonal wavelet measurement matrices in CS for image processing from scanned photographic plates (SPP). Some important characteristics were obtained for astronomical image processing of SPP. The best orthogonal wavelet choice for measurement matrix construction in CS for image compression of images of SPP is given. The image quality measure for linear and nonlinear image compression method is defined.

We propose a solution to the image deconvolution problem where the convolution kernel or point spread function (PSF) is assumed to be only partially known. Small perturbations generated from the model are exploited to produce a few principal components explaining the PSF uncertainty in a high dimensional space. Unlike recent developments on blind deconvolution of natural images, we assume the image is sparse in the pixel basis, a natural sparsity arising in magnetic resonance force microscopy (MRFM). Our approach adopts a Bayesian Metropolis-within-Gibbs sampling framework. The performance of our Bayesian semi-blind algorithm for sparse images is superior to previously proposed semi-blind algorithms such as the alternating minimization (AM) algorithm and blind algorithms developed for natural images. We illustrate our myopic algorithm on real MRFM tobacco virus data.

For iterative x-ray computed tomography (CT) reconstruction, the convex algorithm combined with ordered subset (OSC) [1] is a relatively fast algorithm and has shown its potential for low-dose situations. But it needs one forward projection and two backprojections per iteration. Unlike convex algorithm, the gradient algorithm only requires one forward projection and one backprojection per iteration. Here, we applied ordered subsets of projection data to a modified gradient algorithm. In order to further reduce computation time, the new algorithm, the ordered subset gradient (OSG) algorithm, can be adjusted with a step size. We also implemented another OS-type algorithm called OSTR. The OSG algorithm is compared with OSC algorithm and OSTR algorithm using three-dimensional simulated helical cone-beam CT data. The performance is evaluated in terms of log-likelihood, contrast recovery, and bias-variance studies. Results show that images of OSG has compatible visual image quality to those of OSC and OSTR, but in the resolution and bias-variance studies, OSG seems to reach stable values with faster speed. In particular, OSTR has better recovery in a smoother region, but both OSG and OSC have better recovery in the high-frequency regions. Moreover, in terms of log likelihood with respect to computation time, OSG has faster convergence rate than that of OSC and similar to that of OSTR. We conclude that OSG has potential to provide comparable image quality and is more computationally efficient, and thus could be suitable for low-dose, helical cone-beam CT image reconstruction.

Visual Pattern Image Sequence Coding (VPISC) is a pyramidal image coding scheme which utilizes human visual system (HVS) properties to achieve low bit rates while maintaining a good perceived image quality, all with extremely low computational cost. This paper describes extensions of VPISC, termed Foveal VPISC (FVPISC) and Adaptive VPISC (AVPISC). Both algorithms produce decreased bit rates by selectively allowing some image regions to be coded at low resolution. In FVPISC, a foveation criterion is used to select a region of interest. In AVPISC, the algorithm adaptively determines which regions require high-resolution coding in order to maintain uniform image quality over the entire image.

We present a superresolution image reconstruction from a sequence of aliased imagery. The subpixel shifts (displacement) among the images are unknown due to the uncontrolled natural jitter of the imager. A correlation method is utilized to estimate subpixel shifts between each low-resolution aliased image with respect to a reference image. An error-energy reduction algorithm is derived to reconstruct the high-resolution alias-free output image. The main feature of this proposed error-energy reduction algorithm is that we treat the spatial samples from low-resolution images that possess unknown and irregular (uncontrolled) subpixel shifts as a set of constraints to populate an oversampled (sampled above the desired output bandwidth) processing array. The estimated subpixel locations of these samples and their values constitute a spatial domain constraint. Furthermore, the bandwidth of the alias-free image (or the sensor imposed bandwidth) is the criterion used as a spatial frequency domain constraint on the oversampled processing array. The results of testing the proposed algorithm on the simulated low- resolution forward-looking infrared (FLIR) images, real-world FLIR images, and visible images are provided. A comparison of the proposed algorithm with a standard interpolation algorithm for processing the simulated low-resolution FLIR images is also provided. PMID:16826246

The trimodal imager (TMI) images gamma-ray sources from a mobile platform using both coded aperture (CA) and Compton imaging (CI) modalities. In this paper we will discuss development and performance of image reconstruction algorithms for the TMI. In order to develop algorithms in parallel with detector hardware we are using a GEANT4 [J. Allison, K. Amako, J. Apostolakis, H. Araujo, P.A. Dubois, M. Asai, G. Barrand, R. Capra, S. Chauvie, R. Chytracek, G. Cirrone, G. Cooperman, G. Cosmo, G. Cuttone, G. Daquino, et al., IEEE Trans. Nucl. Sci. NS-53 (1) (2006) 270] based simulation package to produce realistic data sets for code development. The simulation code incorporates detailed detector modeling, contributions from natural background radiation, and validation of simulation results against measured data. Maximum likelihood algorithms for both imaging methods are discussed, as well as a hybrid imaging algorithm wherein CA and CI information is fused to generate a higher fidelity reconstruction.