Scalable layered coding in a multi-layer, compound-image...

Image analysis – Image segmentation – Distinguishing text from other regions

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C382S181000, C382S190000, C382S232000

Reexamination Certificate

active

06898313

ABSTRACT:
A data coder prepares a frame of data for transmission over a data channel. The frame is first broken into a series of non-overlapping blocks. The blocks are analyzed to determine if they are a “picture” block or a “non-picture” block. Picture blocks are compressed to produce one or more layers of data, including a base layer and, optionally, one or more enhanced layers. Non-picture blocks are similarly compressed, but according to different compression procedures. Prior to sending the compressed layers of data to a scheduler for transmission on the data channel, the blocks are checked to see if they have changed more than a threshold amount from the last time they were sent. If the block has changed more than the threshold, the changed block is sent to the scheduler, in compressed form. If the block has not changed more than the threshold, only an indication of the block, and not the block itself, is sent to the scheduler.

REFERENCES:
patent: 5778092 (1998-07-01), MacLeod et al.
patent: 5809167 (1998-09-01), Al-Hussein
patent: 5854853 (1998-12-01), Wang
patent: 6058214 (2000-05-01), Bottou et al.
patent: 6192155 (2001-02-01), Fan
D. Cheng and C. Bouman, “Document Compression Using Rate-Distortion Optimized Segmentation ”, J. Electronic Imaging 10(02), Apr. 2001, pp. 460-474.
X. Li et al., “Block-based Segmentation and Adaptive Coding for Visually Lossless Compression of Scanned Documents”, ICIP'2001.
R.L. de Queiroz et al., “Optimizing Block-Thresholding Segmentation For Multi-Layer Compression Of Compound Images”, IEEE Trans. on Image Processing, vol. 9, Sep. 2000, pp. 1461-1471.
M. J. Weinberger , “The LOCO-1 Lossless Image Compression Algorithm: Principles and Standardization into JPEG-LS”, IEEE Transactions On Image Processing, vol. 9, No. 8, Aug. 2000, pp. 1309-1324.
D. Taubman, “High Performance Scalable Image Compression with EBCOT”, IEEE Transactions On Image Processing, vol. 9, No. 7, Jul. 2000, pp. 1158-1170.
W. Zeng et al., “An Efficient Color Re-Indexing Scheme For Palette-Based Compression”, Proceeding of ICIP'2000, Vancouver, Canada.
A. Said and A. Drukarev, “Simplified Segmentation for Compound Image Compression”, Proceeding of ICIP'1999.
L. Bottou et al., “High Quality Document Image Compression with DjVu”, Journal of Electronic Imaging, vol. 7, Jul. 1998, pp. 410-425.
A. Said and W. Pearlman, “A New Fast and Efficient Image Codec Based on Set Partitioning in Hierarchical Trees”, IEEE Trans. CSVT, vol. 6, Jun. 1996, pp. 243-250.
W. Sweldens, “The Lifting Scheme: A Custom-Design Construction Of Biorthogonal Wavelets”, Wavelet Applications in Signal and Image Processing III, Proc. SPIE 2569, 1995, pp. 68-79.
D. Taubman and A. Zakhor, “Multirate 3-D Subband Coding of Video”, IEEE Trans. On Image Processing, vol. 3, No. 5, Sep. 1994, pp. 572-588.
F. Ono et al., “Bi-Level Image Coding With Melcode—Comparison Of Block Type Code And Arithmetic Type Code”, IEEE Globecom'1989, pp. 255-260.
A. Said and W. Pearlman, “An Image Multiresolution Representation for Lossless and Lossy Compression”, IEEE Trans. Image Processing, vol. 5, No. 9 pp. 1303-1310.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Scalable layered coding in a multi-layer, compound-image... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Scalable layered coding in a multi-layer, compound-image..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable layered coding in a multi-layer, compound-image... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3394302

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.