In this paper, we propose a lossless compression scheme for binary images which consists of a novel encoding algorithm which uses a new edge tracking algorithm. The proposed compression scheme has two sub-stages: (i) encoding binary image data using the proposed encoding method (ii) compression the encoded image data using any well-known image compression method such as Huffman, Run-Length or L...

The Virtual Reality Modeling Language (VRML) is rapidly becoming the standard file format for transmitting 3D virtual worlds across the Internet. Static and dynamic descriptions of 3D objects, multimedia content, and a variety of hyperlinks can be represented in VRML files. Both VRML browsers and authoring tools for the creation of VRML files are widely available for several different platforms...

The Simulation based VLSI Implementation of FELICS (Fast Efficient Lossless Image Compression System) Algorithm is proposed to provide the lossless image compression and is implemented in simulation oriented VLSI (Very Large Scale Integrated). To analysis the performance of Lossless image compression and to reduce the image without losing image quality and then implemented in VLSI based FELICS ...

The peak power delivered by the klystrons in the NLCTA (Next Linear Collider Test Accelerator) now under construction at SLAC is enhanced by a factor of four in a SLED-II type of R.F. pulse compression system (pulse width compression ratio of six). To achieve the desired output pulse duration of 250 ns, a delay line constructed from a 36 m length of circular waveguide is used. Future colliders,...

Pattern substrings analysis to find high redundancy in binary shapes is carried out to improve compression levels in binary objects. Modifications of a recent set of symbols to encode arbitrary contour shapes is proposed. The concept of Pieces of Discrete Straight Lines is introduced and the probability of appearance of symbols in contours is analyzed to propose a code of nine symbols, MDF9. Al...

Image compression consists in reducing information volume representing an image. Elimination of redundancies and non-pertinent information enables memory space minimization and thus faster data transmission. The present work aims to improve the quality of the compressed image while minimizing the time required for compression by using the principle of coherent optics. We present an optical adap...

We have recently established a strong connection between the Tent map (also known as Generalized Luroth Series or GLS which is a chaotic, ergodic and lebesgue measure preserving non-linear dynamical system) and Arithmetic coding which is a popular source compression algorithm used in international compression standards such as JPEG2000 and H.264. This was for independent and identically distrib...

Increase in the use of color images in the continuous expansion of multimedia applications has increased the demand for efficient techniques that can store and transmit visual information. This demand has made image compression a vital factor and has increased the need for efficient algorithms that can result in high compression ratio with minimum loss. This paper proposes an innovative techniq...

We report on numerical results from an independent formalism to describe the quasi-equilibrium structure of nonsynchronous binary neutron stars in general relativity. This is an important independent test of controversial numerical hydrodynamic simulations which suggested that nonsynchronous neutron stars in a close binary can experience compression and even collapse prior to the last stable ci...

We present a methodology of an on-line variable-length binary encoding of a set of integers. The basic principle of this methodology is to maintain the preex property amongst the codes assigned on-line to a set of integers growing dynamically. The preex property enables unique decoding of a string of elements from this set. To show the utility of this on-line variable length binary encoding, we...