Techniques to implement one-dimensional compression

Image analysis – Image compression or coding – Lossless compression

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C358S426160

Reexamination Certificate

active

06775413

ABSTRACT:

BACKGROUND
The present disclosure is related to one-dimensional image compression, such as for bi-level images.
As is well-known, a facsimile machine scans a document line by line and converts each line to alternating black and white dots. The resulting document image is referred to as a bilevel image because each pixel is represented by a single bit and its value may be either 0 to represent a black dot or 1 to represent a white dot or pixel. A combination of run-length encoding and modified Huffman coding has been found suitable to compress such bi-level images. The International Telecommunications Union (ITU, formerly known as Consultative Committee on International Telephone and Telegraph—CCITT) has, therefore, provided a number of standards or specifications suitable to compressing such bi-level facsimile images. See, for example, Hunter, et. al., International Digital Facsimile Coding Standards, Proceedings of the IEEE Vol. 68, No. 7, July 1980, pages 854-857. The CCITT Group 3 is one such standard and is applied to facsimile or “fax” machines. The recommendations for Group 3 has two coding schemes—one dimensional and two dimensional. In the one dimensional scheme, the coding of each scan line is performed independently of any other line. Although this standard was recommended for facsimile machines, the approach is also suitable for coding bi-level document images in various other applications, such as, for example, photocopying machines, scanners, etc.
In photocopying or facsimile systems, the performance of the system may be measured in terms of the number of pages copied per minute. It is difficult to specify copying time per page because this time may vary with the content of the page. However, improving the encoding rate to achieve higher pages per minute is desirable in order to improve performance.


REFERENCES:
patent: 4040093 (1977-08-01), Nakagome et al.
patent: 4185303 (1980-01-01), Mounts et al.
patent: 4245257 (1981-01-01), Yamazaki et al.
patent: 4486784 (1984-12-01), Abraham et al.
patent: 4558371 (1985-12-01), Rallapalli et al.
patent: 4760461 (1988-07-01), Sato
patent: 5196945 (1993-03-01), Ho et al.
patent: 5875122 (1999-02-01), Acharya
patent: 5995210 (1999-11-01), Acharya
patent: 6009201 (1999-12-01), Acharya
patent: 6009206 (1999-12-01), Acharya
patent: 6047303 (2000-04-01), Acharya
patent: 6091851 (2000-07-01), Acharya
patent: 6094508 (2000-07-01), Acharya et al.
patent: 6108453 (2000-08-01), Acharya
patent: 6124811 (2000-09-01), Acharya et al.
patent: 6130960 (2000-10-01), Acharya
patent: 6151069 (2000-11-01), Dunton et al.
patent: 6151415 (2000-11-01), Acharya et al.
patent: 6166664 (2000-12-01), Acharya
patent: 6178269 (2001-01-01), Acharya
patent: 6195026 (2001-02-01), Acharya
patent: 6215908 (2001-04-01), Pazmino et al.
patent: 6215916 (2001-04-01), Acharya
patent: 6229578 (2001-05-01), Acharya et al.
patent: 6233358 (2001-05-01), Acharya
patent: 6236433 (2001-05-01), Acharya et al.
patent: 6236765 (2001-05-01), Acharya
patent: 6269181 (2001-07-01), Acharya
patent: 6275206 (2001-08-01), Tsai et al.
patent: 6285796 (2001-09-01), Acharya et al.
patent: 6292114 (2001-09-01), Tsai et al.
patent: 6301392 (2001-10-01), Acharya
patent: 6348929 (2002-02-01), Acharya et al.
patent: 6351555 (2002-02-01), Acharya et al.
patent: 6356276 (2002-03-01), Acharya
patent: 6366692 (2002-04-01), Acharya
patent: 6366694 (2002-04-01), Acharya
patent: 6373481 (2002-04-01), Tan et al.
patent: 6377280 (2002-04-01), Acharya et al.
patent: 6381357 (2002-04-01), Tan et al.
patent: 6392699 (2002-05-01), Acharya
patent: 0288219 (1988-10-01), None
patent: 51-013748 (1986-01-01), None
Hunter, et al., “International Digital Facsimile Coding Standards”, 1980 IEEE, British Post Office Centre, Martlesham Heath, England, pp. 854-867.
Acharya, “A Memory Based VLSI Architecture for Image Compression” Applicaion No: 08/885,415, Filed: Jun. 30, 1997, 37 pgs.
Bawolek, et al., “Infrared Correction System”, Application No: 09/126,203, Filed Jul. 30, 1998, 23 Pgs.
Pazmino, et al., “Method of Compressing and/or Decompressing a Data Set Using Significance Mapping”, Application No: 09/151,336, filed: Sep. 11, 1998, 25 pgs.
Tan, et al., “Robust Sequential Approach in Detecting Defective Pixels Within an Image Sensor”, Application No: 09/191,310, 35 Pgs.
Acharya, et al., “Color Interpolation for a Four Color Mosaic Pattern”, Application No: 09/199,836, Filed. Nov. 24, 1998, 26 Pgs.
Acharya, “A Mathematical Model for Gray Scale and Contrast Enhancement of a Digital Image”, Application No; 09/207,153, Filed: Dec. 8, 1998, 28 pgs.
Acharya, “Enhancing Image Compression Performance by morphological Processing”, Application No: 09/291,810, Filed: Apr. 14, 1999, 31 Pgs.
Tan, et al., “Using an Electronic Camera to Build a File Containing Text”, Application No: 09/301,753, Filed Apr. 29, 1999, 21 pgs.
Tsai, et al., “Method and Apparatus for Adaptively Sharpening an Image”, Application No: 09/320,192, Filed May 26, 1999, 27 pgs.
Tan, et al., “Method and Apparatus for Adaptively Sharpening Local Image Content of an Image”, Application No: 09/328,935, Filed: Jun. 9, 1999, 29 pgs.
Tan, et al., “A Hardware Efficient Wavelet-Based Video Compression Scheme”, Application No: 09/342,863, Filed: Jun. 26, 1999, 32 pgs.
Tan, et al., “A Methodology for Color Correction with Noise Regulation”, Application No: 09/359,831, Filed: Jul. 23, 1999, 30 pgs.
Acharya, et al., “Image Processing Method and Apparatus”, Application No: 09/359,523, filed: Jul. 23, 1999, 16 pgs.
Acharya., et al, “Zerotree Encoding of Wavelet Data”, Application No; 09/390,255, Filed: Sep. 3, 1999, 22 pgs.
Acharya, et al., “A Fuzzy Based Threshold Technique for Image Segmentation”, Application No; 09/393,136, Filed: Sep. 10, 1999, 28 pgs.
Acharya, et al., “A Fuzzy Distinction Based Thresholding Technique for Image Segmentation”, Application No: 09/393,017, Filed: Sep. 10, 1999, 29 pgs.
Acharya, “Video Motion Estimation”, Application No: 09/406,032, Filed: Sep. 27, 1999, 24 pgs.
Acharya,et al., “Method of Interpolating Color Pixel Signals from a Subsampled Color Image”, Application No: 09/410,800, Filed: Oct. 1, 1999, 20 pgs.
Acharya, et al., “Method of Compressing a Color Image” Application No: 09/411,697, Filed: Oct. 1, 1999, 26 pgs.
Acharya, et al., “Square Root Raised Cosine Symmetric Filter for Mobile Telecommunications” Application No: 09/429,058, Filed: Oct. 29, 1999, 36 pgs.
Acharya, “Discrete Filter”, Application No: 09/432,337, Filed Nov. 2, 1999, Atty. docket No: 042390.P7626, 15 pgs.
Acharya, et al., “Indexing Wavelet Compressed Video for Efficeint Data Handling”, Application No: 09/438,091, Filed: Nov. 10, 1999, 29 pgs.
Acharya, et al., “Method of Upscaling a Color Image”, Application No: 09/461,080, Filed: Dec. 14, 1999, 22 pgs.
Acharya, “Method of Converting a Sub-Sampled Color Image”, Application No: 09/461,068, Filed: Dec. 14, 1999, 22 pgs.
Acharya, et al., “Chip Rate Selectable Square Root Raised Cosine Filter for Mobile Telecommunications”, Application No: 09/467,487, Filed: Dec. 20, 1999, 44 pgs.
Miao, et al., “Dual Mode Filter For Mobile Telecommunications”, Application No: 09/467,611, filed: Dec. 20, 1999, 49 pgs.
Metz, et al., “Image Processing Architecture”, Application No: 09/473,643, Filed: Dec. 28, 1999, 15 pgs.
Acharya, et al., “Method of Inverse Quantizing Signal Samples of an Image During Image Decompression”, Application No: 09/507,213, Filed: Feb. 18, 2000, 32 pgs.
Acharya, et al., “Method of Quantizing Signal Samples of an Image During Compression”, Application No: 09/507,399, Filed: Feb. 18, 2000, 24 pgs.
Acharya, et al., “Method of Integrating a Watermark into an Image”, Application No: 09/519,874, Filed: Mar. 6, 2000, 27 pgs.
Acharya, et al., “Method of Integrating a Watermark Into a Compressed Image”, Application No: 09/519,135, Filed: Mar. 6, 2000, 25 pgs.
Acharya, et al. “Method of Using Hue to Interpolate Color Pixel Signals”, Application No: 09/591,867, Filed: Jun. 12, 2000, 23 pgs.
Kim, et al. “Method of Performing Motion Estimation”, Application No: 09/596,127, Filed: Jun. 16, 2000, 29 pgs.
Acharya, et al.

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

Techniques to implement one-dimensional compression does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Techniques to implement one-dimensional compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Techniques to implement one-dimensional compression will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3337758

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