Facsimile and static presentation processing – Natural color facsimile – Scanning
Reexamination Certificate
2011-03-29
2011-03-29
Grant, II, Jerome (Department: 2625)
Facsimile and static presentation processing
Natural color facsimile
Scanning
C711S112000, C711S162000, C714S006130, C714S006130
Reexamination Certificate
active
07916363
ABSTRACT:
It is desirable to provide a bitstream format for compressed data that would allow multiple processors to access and decompress different parts of the data in parallel. Compressed images are usually defined in terms of macroblocks that have a width less than the image width and a height less than the image height. Thus, an image is divided several bands of multiple lines, and each band of multiple lines is divided into a macroblock. The set of macroblocks that define a band is called herein a macroblock rasterscan. The bit stream format includes, for each image, a picture header followed by image scan data. The image scan data includes data corresponding to a plurality of macroblock rasterscans. The data for each macroblock rasterscan includes data for a plurality of macroblocks for a band of lines in the image followed by padding. The padding ensures that data for each macroblock rasterscan terminates on a data boundary. The picture header references an image scan index that indicates a number of macroblock rasterscans in the image scan data and a number of lines per macroblock rasterscan, followed by entries of the index. Each entry in the index includes an offset of the macroblock rasterscan in image scan. The picture header may contain a reference to a picture header type, that references an I_frame_image_descriptor, which references the image scan index.
REFERENCES:
patent: 3769453 (1973-10-01), Bahl et al.
patent: 3984833 (1976-10-01), Van Voorhis
patent: 4044347 (1977-08-01), Van Voorhis
patent: 4092675 (1978-05-01), Saran
patent: 4092677 (1978-05-01), Saran
patent: 4136363 (1979-01-01), Saran
patent: 4302775 (1981-11-01), Widergren et al.
patent: 4325085 (1982-04-01), Gooch
patent: 4330833 (1982-05-01), Pratt et al.
patent: 4385363 (1983-05-01), Widergren et al.
patent: 4394774 (1983-07-01), Widergren et al.
patent: 4410916 (1983-10-01), Pratt et al.
patent: 4476495 (1984-10-01), Fujisawa et al.
patent: 4520490 (1985-05-01), Wei
patent: 4558302 (1985-12-01), Welch
patent: 4558370 (1985-12-01), Mitchell et al.
patent: 4586027 (1986-04-01), Tsukiyama et al.
patent: 4663325 (1987-05-01), Ohtaka et al.
patent: 4698672 (1987-10-01), Chen et al.
patent: 4704628 (1987-11-01), Chen et al.
patent: 4706265 (1987-11-01), Furukawa
patent: 4710813 (1987-12-01), Wallis et al.
patent: 4813056 (1989-03-01), Fedele
patent: 4837571 (1989-06-01), Lutz
patent: 4841299 (1989-06-01), Weaver
patent: 4849812 (1989-07-01), Borgers et al.
patent: 4872009 (1989-10-01), Tsukiyama et al.
patent: 4901075 (1990-02-01), Vogel
patent: 4988998 (1991-01-01), O'Brien
patent: 5027206 (1991-06-01), Vreeswijk et al.
patent: 5049880 (1991-09-01), Stevens
patent: 5072295 (1991-12-01), Murakami et al.
patent: 5128758 (1992-07-01), Azadegan et al.
patent: 5179442 (1993-01-01), Azadegan et al.
patent: 5191436 (1993-03-01), Yonemitsu
patent: 5268686 (1993-12-01), Battail
patent: 5272478 (1993-12-01), Allen
patent: 5291486 (1994-03-01), Koyanagi
patent: 5333135 (1994-07-01), Wendorf
patent: 5426464 (1995-06-01), Casavant et al.
patent: 5428390 (1995-06-01), Cooper et al.
patent: 5461420 (1995-10-01), Yonemitsu et al.
patent: 5559557 (1996-09-01), Kato
patent: 5579413 (1996-11-01), Bjontegaard
patent: 5663763 (1997-09-01), Yagasaki et al.
patent: 5724097 (1998-03-01), Hibi et al.
patent: 5751359 (1998-05-01), Suzuki et al.
patent: 5821887 (1998-10-01), Zhu
patent: 5982437 (1999-11-01), Okazaki et al.
patent: 6023531 (2000-02-01), Peters et al.
patent: 6028639 (2000-02-01), Bhatt et al.
patent: 6198543 (2001-03-01), Ryan
patent: 6249546 (2001-06-01), Bist
patent: 6256349 (2001-07-01), Suzuki et al.
patent: 6438167 (2002-08-01), Shimizu et al.
patent: 6456659 (2002-09-01), Zuccaro et al.
patent: 6484142 (2002-11-01), Miyasaka et al.
patent: 6668088 (2003-12-01), Werner et al.
patent: 6687407 (2004-02-01), Peters et al.
patent: 7212681 (2007-05-01), Chen et al
patent: 7403561 (2008-07-01), Kottke et al.
patent: 7433519 (2008-10-01), Rynderman
patent: 2002/0163966 (2002-11-01), Ramaswamy
patent: 2003/0115021 (2003-06-01), Mates
patent: 2004/0062448 (2004-04-01), Zeng et al.
patent: 2009/0003438 (2009-01-01), Kottke et al.
patent: 0500077 (1992-08-01), None
patent: WO 97/16029 (1997-05-01), None
patent: WO 98/35500 (1998-08-01), None
patent: WO 01/11893 (2001-02-01), None
patent: WO 2004/091221 (2004-10-01), None
Abrahams, J., “Huffinan Code Trees and Variants”, DIMACS, Rutgers University, 1989.
Bolick at al., “Very High Speed Entropy Coding”, IEEE International Conference on Image Processing, vol. 3, pp. 625-629, Nov. 1994.
Chen et al., “Scene Adaptive Coder”, IEEE Transactions on Communications, vol. COM-32, No. 3, Mar. 1984.
Cormack, G.V. et al., “Data Compression Using Dynamic Markov Modelling”, in Computer Journal, vol. 30. No. 6, pp. 541-550, 1987.
Fabris, F., “Variable-Length-to-Variable-Length Source Coding: A Greedy Step-by-Step Algorithm”, IEEE Transactions on Information Theory, vol. 38, No. 5, Sep. 1992.
Freeman, G.H., “Divergence and the Construction of Variable-to-Variable-Length Lossless Codes by Source-Word Extensions”, IEEE Data Compression Conference, 1993, pp. 79-88.
Gallagher et al., “Optimal Source Codes for Geometrically Distributed integer Alphabets”, IEEE Transactions on Information Theory, Mar. 1975.
Huffman, D., “A Method for the Construction of Minimum-Redundancy Codes”, Proceedings of the I.R.E., Sep. 1952.
Jelinek et al., “On Variable-Length-to-Block Coding” IEEE Transactions on Information Theory, vol. IT 19, No. 6, Nov. 1972.
Laemmell et al., “Coded Transmission of Information”, Research Report, Polytechnic Institute of Brooklyn, Jan. 1954.
Langdon, G.G., “An Adaptive Run-Length Coding Algorithm”, IBM Technical Disclosure Bulletin, vol. 26, No. 7B, Dec. 1983.
Linder et al., “Universality and Rates of Convergence in Lossy Source Coding”, Data Compression Conference, Snowbird, Utah, 1993.
Marcus, R., “Discrete Noiseless Coding”, MIT MS Thesis, Feb. 1957.
McCray, W,R., Translating A Variable-Length Code, IBM Technical Disclosure Bulletin, vol. 17, No. 11, Apr. 1975, pp. 3328-3329.
Pirsch, P., “Adaptive Intra-Interframe DPCM Coder”, Picture Coding Symposium, Jun. 1981.
Pratt, W.K., “Spatial Transform Coding of Color Images”, IEEE Transactions on Communication Technology, vol. COM-19, No. 6, Dec. 1971.
Rosenfeld et al., Digital Picture Processing, 2ndEd., vol. 1, pp. 188-191, Academic Press 1982.
Savari et al., “On the Analysis of Variable-to-Variable Length Codes”, Proceedings of the 2002 IEEE International Symposium on Information Theory.
SMPTE 370M-2006, “Standard for Television-Data Structure for DV-Based Audio, Data and Compressed Video”, Section 4.4 Variable Length Coding, pp. 1, 53-55, Apr. 18, 2006.
Tescher, A., “A Dual Transform Coding Algorithm”, Proceedings Nat. Telecommunication Conference, 1979 IEEE.
Tescher, A., “Rate Adaptive Communication”, Proceedings Nat. Telecommunication Conference, 1978 IEEE.
Tunstall, “Synthesis of Noiseless Compression Codes”, Doctoral Thesis, Georgia Institute of Technology, Sep. 1967.
Watson, A., “Image Compression Using the Discrete Cosine Transform”, Mathematica Journal, 4(1), 1994, pp. 81-84.
Chiang, Tihao, et al, “A New Rate Control Scheme Using Quadratic Rate Distortion Model”, IEEE Transactions On Circuits And Systems For Video Technology, vol. 7, No. 1, Feb. 1997, pp. 246-250.
Avid Technology Inc.
Grant II Jerome
Strimpel Oliver
LandOfFree
Bitstream format for compressed image data does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Bitstream format for compressed image data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bitstream format for compressed image data will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2646374