In multi-label classification tasks, labels are commonly related with each other. It has been well recognized that utilizing label relationship is essential to multi-label learning. One way to utilizing label relationship is to map labels to a lower-dimensional space of uncorrelated labels, where the relationship could be encoded in the mapping. Previous linear mapping methods commonly result i...

In this paper, we present an approach of using binary tree structures for efficient progressive image compression. General ideas of progressive transmission and image approximation are discussed. We also present a specific technique, which provides compression ratios comparable to the ratios of the best algorithms known in the literature. Besides, it is computationally simple and specially desi...

Using rf pulse compression it will be possible to boost the 50to lOO-MW output expected from high-power microwave tubes operating in the loto 20-GHz frequency range, to the 300to lOOO-MW level required by the next generation of high-gradient linacs for linear colliders. A high-power X-band three-stage binary rf pulse compressor has been implemented and operated at the S&ford Linear Accelerator ...

Document retrieval and web search engines index large quantities of text. The static costs associated with storing the index can be traded against dynamic costs associated with using it during query evaluation. Typically, index representations that are effective and obtain good compression tend not to be efficient, in that they require more operations during query processing. In this paper we d...

Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...

To preserve all the information in analog documents when they are digitized , high resolution scanning of them has become common. When the ana-log document has a large physical size, which is frequently the case, the resulting digital image occupies a large storage space. Hence, methods that compress document images substantially without loss of signi-cant information are of great practical imp...

Branch predictors and processor front-ends have been the focus of a number of computer architecture studies. Typically they are evaluated separately from other components using trace-driven simulation based on instruction traces. To offer a faithful representation of processor’s workload the traces are very large, and hence difficult to manage if kept in uncompressed form. In order to reduce si...

Data compression (or source coding) is the process of creating binary representations of data which require less storage space than the original data 7; 14; 15]. Lossless compression is used where perfect reproduction is required while lossy compression is used where perfect reproduction is not possible or requires too many bits. Achieving optimal compression with respect to resource constraint...

A novel watermarking scheme for color images has been proposed using column DCT wavelet transform. To improve the robustness of watermarking scheme, compressed watermark with tolerable fidelity is embedded into host image. Middle frequency coefficients are selected for embedding watermark so that the proposed scheme can sustain attacks like lossy image compression where high frequency coefficie...