Search results

With the advent of technology, a huge amount of data is being transmitted and received through the internet. Large bandwidth and storage are required for the exchange of data and storage, respectively. Hence, compression of the data which is to be transmitted over the channel is unavoidable. The main purpose of the proposed system is to use the bandwidth effectively. The videos are compressed at the transmitter’s end and reconstructed at the receiver’s end. Compression techniques even help for smaller storage requirements.

The paper proposes a novel compression technique for three-dimensional (3D) videos using a zig-zag 3D discrete cosine transform. The method operates a 3D discrete cosine transform on the videos, followed by a zig-zag scanning process. Finally, to convert the data into a single bit stream for transmission, a run-length encoding technique is used. The videos are reconstructed by using the inverse 3D discrete cosine transform, inverse zig-zag scanning (quantization) and inverse run length coding techniques. The proposed method is simple and reduces the complexity of the convolutional techniques.

Coding reduction, code word reduction, peak signal to noise ratio (PSNR), mean square error, compression percent and compression ratio values are calculated, and the dominance of the proposed method over the convolutional methods is seen.

With zig-zag quantization and run length encoding using 3D discrete cosine transform for 3D video compression, gives compression up to 90% with a PSNR of 41.98 dB. The proposed method can be used in multimedia applications where bandwidth, storage and data expenses are the major issues.

The purpose of this paper is to propose a lossy/lossless binary textual image compression method based on an improved pattern matching (PM) technique.

In the Farsi/Arabic script, contrary to the printed Latin script, letters usually attach together and produce various patterns. Hence, some patterns are fully or partially subsets of some others. Two new ideas are proposed here. First, the number of library prototypes is reduced by detecting and then removing the fully or partially similar prototypes. Second, a new effective pattern encoding scheme is proposed for all types of patterns including text and graphics. The new encoding scheme has two operation modes of chain coding and soft PM, depending on the ratio of the pattern area to its chain code effective length. In order to encode the number sequences, the authors have modified the multi‐symbol QM‐coder. The proposed method has three levels for the lossy compression. Each level, in its turn, further increases the compression ratio. The first level includes applying some processing in the chain code domain such as omission of small patterns and holes, omission of inner holes of characters, and smoothing the boundaries of the patterns. The second level includes the selective pixel reversal technique, and the third level includes using the proposed method of prioritizing the residual patterns for encoding, with respect to their degree of compactness.

Experimental results show that the compression performance of the proposed method is considerably better than that of the best existing binary textual image compression methods as high as 1.6‐3 times in the lossy case and 1.3‐2.4 times in the lossless case at 300 dpi. The maximum compression ratios are achieved for Farsi and Arabic textual images.

Only the binary printed typeset textual images are considered.

The proposed method has a high‐compression ratio for archiving and storage applications.

To the authors' best knowledge, the existing textual image compression methods or standards have not so far exploited the property of full or partial similarity of prototypes for increasing the compression ratio for any scripts. Also, the idea of combining the boundary description methods with the run‐length and arithmetic coding techniques has not so far been used.

The application of a variable to fixed‐length compression coding technique to two bibliographic data bases (MARC and INSPEC) is described. By appropriate transformation of characters or digrams into bit patterns reflecting more accurately the distributions of characters in the data bases, and application of the encoding process, varying degrees of compression can be obtained.

The purpose of this paper is to study extensive enlargement and safety of flight data recorder memory.

The study involves the moving the memory of flight data recorders from an internal embedded device to a cloud.

The implementation has made the embedded memory device of flight data recorder effectively unlimited, and, hence, much more information can be stored.

The possibility of a flight data recorder to be damaged or lost in a crash is not so high, but the implementation can be very helpful in cases such as aerial disappearances.

The implication is larger and protected memory for flight data recorders.

Finding reasons for crashes is faster, and immediate actions can be taken to find remedy to the failures.

The use of internet and cellphones in airplanes is nothing special at present. It is suggested to take this technology for flight data recorders as well.

Pictures are natural and effective means of communication among people, computers, and robotics. A pictorial database is a collection of sharable pictorial data encoded in various formats. During the past several years, pictorial databases have attracted growing attention as an important component in building pictorial information systems as well as intelligent information systems. Eight research tasks are presented. They are comparing the numerical and the linguistic variable approaches, examining new linguistic hedges, studying the similarity of various similarity measures, investigating pictorial data compression techniques, performing pictorial data compression using array grammars, applying the entity‐relationship (ER) model to picture description; further investigating the relationship hierarchy for picture representation using ER diagrams, and extracting pictorial knowledge from pictorial databases. The research results may have a major impact on the development of object‐oriented pictorial databases.

Highlights the role of facsimile in inter‐office communication, the development of fax technology and its current popularity over e‐mail. Presents in detail factors to be considered when choosing a fax. Discusses the existing standards for various groups of machines, the features most in demand from users and outlines the particular market context in India – particularly the entrance of fax into the SOHO market after its complete acceptance in the enterprise office.

The properties of the human senses are described, and the article continues with a short review of text display. Text and image processing are discussed with reference to resolution and scanning. Image processing is covered in some detail, including processing of grey scale and colour images, and Television and other cathode ray tube displays. Sections on compression, communication theory and coding follow. The article concludes with a review of data transport in complete systems followed by 36 references.

In the big data era, image compression is of significant importance in today’s world. Importantly, compression of large sized images is required for everyday tasks; including electronic data communications and internet transactions. However, two important measures should be considered for any compression algorithm: the compression factor and the quality of the decompressed image. In this paper, we use Frei-Chen bases technique and the Modified Run Length Encoding (RLE) to compress images. The Frei-Chen bases technique is applied at the first stage in which the average subspace is applied to each 3 × 3 block. Those blocks with the highest energy are replaced by a single value that represents the average value of the pixels in the corresponding block. Even though Frei-Chen bases technique provides lossy compression, it maintains the main characteristics of the image. Additionally, the Frei-Chen bases technique enhances the compression factor, making it advantageous to use. In the second stage, RLE is applied to further increase the compression factor. The goal of using RLE is to enhance the compression factor without adding any distortion to the resultant decompressed image. Integrating RLE with Frei-Chen bases technique, as described in the proposed algorithm, ensures high quality decompressed images and high compression rate. The results of the proposed algorithms are shown to be comparable in quality and performance with other existing methods.

Research and application on the design, implementation and testing of an image compression system for a 3U CubeSat.

This paper is an intensive study on image compression technique, proposed design and approach on appropriate hardware for image compression on-board the CubeSats.

The paper reveals a method on improving image compression ration while maintaining the image quality unchanged. It also discusses about an appropriate hardware (world smallest super computer) for image compression on-board the CubeSats.

The study provides insight into image compression algorithm.

Recognition of a tactile image independent of position, size and orientation has been a goal of much recent research. Many tasks (e.g. parts identification) often give rise to situations which demand a more generalized methodology than the derivation of a single forward measurement, such as the computation of part area and perimeter from its run‐length‐coding representation. In this situation, an interpretation procedure generally adopts the techniques and methodology of a pattern recognition approach. To achieve maximum utility and flexibility, the methods used should be sensitive to any image change in size, translation and rotation, and should provide good repeatability. The algorithm used in this article generally meets these conditions. The results show that recognition schemes based on these invariants are position, size and orientation independent, and also flexible enough to learn most sets of parts. Assuming that parts can vary only in location, orientation and size, then certain moments are very convenient for normalization. For instance, the first moments of area give the centroid of a part, which is a natural origin of co‐ordinates for translation invariant measurements. Similarly, the eigenvectors of the matrix of second central moments define the directions of principal axes, which leads to rotation moment invariant measurements.