Conference Proceeding

Efficient error free chain coding of binary documents

Center for Image Process. & Integrated Comput., California Univ., Davis, CA
Proceedings of the Data Compression Conference 04/1995; DOI:10.1109/DCC.1995.515502 ISBN: 0-8186-7012-6 In proceeding of: Data Compression Conference, 1995. DCC '95. Proceedings
Source: IEEE Xplore

ABSTRACT Finite context models improve the performance of chain based
encoders to the point that they become attractive, alternative models
for binary image compression. The resulting code is within 4% of JBIG at
200 dpi and is 9% more efficient at 400 dpi

0 0
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: In this paper we present an appearance-based sign language recognition sys- tem which uses a weighted combination of different features in the statistical framework of a large vocabulary speech recognition system. The perfor- mance of the approach is systematically evaluated and it is shown that a sig- nificant improvement can be gained over a baseline system whe n appropriate features are suitably combined. In particular, the word err or rate is improved from 50% for the baseline system to 30% for the optimized system.
    Proceedings of the British Machine Vision Conference 2006, Edinburgh, UK, September 4-7, 2006; 01/2006
  • [show abstract] [hide abstract]
    ABSTRACT: In this paper, we propose two lossless compression techniques that represent a two dimensional Run-length Coding which can achieve high compression ratio. This method works by partitioning the block regions of the input image into rectangles instead of working by runs of adjacent pixels, so it is found to be more efficient than ID RLE Run-length Coding for transmitting texts and image. In the first method, length and width of consecutive black and white rectangles are transmitted. The idea of this method is new and it can be very effective for some images which have large blocks of black or white pixels. But in the second method only black rectangles are considered in order to transmit and an intelligent procedure is exploited to encoding the image. The first method is faster and simpler to implement than the second one but its compression ratio is lesser. Our proposed second scheme is more suitable for text compression and has outperformed the existence partitioning methods. Therefore, if we used these partitioning methods instead of previous partitioning methods in well-known lossless compression techniques, we would have a better compression ratio.
    Signal Processing (ICSP), 2010 IEEE 10th International Conference on; 01/2010
  • [show abstract] [hide abstract]
    ABSTRACT: This paper proposes a new method to embed data in binary images, including scanned text, figures, and cartoon images. The proposed method is based on the manipulating of chains, which are a representation of binary image, to hide data. The chain records the edge information of an image, and the modifications of chains are modifications of edge area. It is difficult to be recognized by human eyes. The features for data hiding are summarized, and rules to find embeddable chains are outlined in this paper. By manipulating the embeddable chains and using pseudo-random permutation, the method can embed a significant amount of data without causing noticeable artifacts.
    Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2009), Kyoto, Japan, 12-14 September, 2009, Proceedings; 01/2009