Image analysis – Image compression or coding
Reexamination Certificate
2007-02-27
2007-02-27
Dang, Duy M. (Department: 2624)
Image analysis
Image compression or coding
C382S244000, C382S248000
Reexamination Certificate
active
10744758
ABSTRACT:
A dictionary based accelerated method of lossless compression and encryption of data with a small statistical redundancy. The sequence of the least distances obtained between every input numerical sample and the samples of the several dictionaries, produced by random number generators, and statistical compression is further applied. The process is accelerated utilizing a packed content addressable memory (CAM) for dictionary and input samples. CAM is scanned for a marking bit indicating a presence of a dictionary sample to find the least distance. CAM is packed and loaded with successful ranges of the amplitudes of both dictionary and input samples to reduce an address space and to accelerate the process of compression further. The least distances are founded for an unique alphabet of the input sequence, and the results are merged with an original input to accelerate the process of compression further.
REFERENCES:
patent: 5406279 (1995-04-01), Anderson
patent: 5533051 (1996-07-01), James
patent: 5612693 (1997-03-01), Craft
patent: 5877711 (1999-03-01), Craft
patent: 5977889 (1999-11-01), Cohen
patent: 6075470 (2000-06-01), Little
patent: 6088699 (2000-07-01), Gampper
patent: 6122379 (2000-09-01), Barbur
patent: 6141445 (2000-10-01), Castelli
patent: 6172624 (2001-01-01), Cooper
patent: 6191710 (2001-02-01), Waletzki
patent: 6333705 (2001-12-01), Amonou
patent: 6351539 (2002-02-01), Djakovic
patent: 6411228 (2002-06-01), Malik
patent: 6411714 (2002-06-01), Yoshiura
patent: 6501398 (2002-12-01), Toyokura
patent: 6518895 (2003-02-01), Weiss
patent: 6535642 (2003-03-01), De Bonet
patent: 6552673 (2003-04-01), Webb
patent: 6618831 (2003-09-01), Lippencott
patent: 2003/0117299 (2003-06-01), Jones
R.N.Willams. An Extremly Fast Ziv-Lempel Data Compression Algorithm. Data Compression Conference, Utah, DCC-1991,IEEE,Los Alamitos,CA. pp. 363-371.
P.A.Franaszek. Algorithms and Data Structures for Compressed-Memory Machines, IBM J.Res. & Dev. v.45, n.2, Mar. 2001, pp. 245-257.
D.Salomon. Data Compression: the complete reference. NY: Springer, 2000.
D.Modha. Codelet Parsing:Quadratic-time,Sequential,Adaptive Algorithms for Lossy Compression.Data Compression Conference,Utah,DCC-2003,IEEE, Los Alamitos,CA. pp. 223-231.
Salomon D. Data Compression. The Complete Reference, Second Edition, Springer, 2000 pp. 62-64, 67, 126, 151-157, 35-37.
Sedgewick R. Algorithms. Addison-Wesley Publishing Company, 1988, pp. 93-98, 333-342, 509-514.
Niederreiter H. Random Number Generation and Quasi—Monte Carlo Methods. Soc. for Ind. and App. Math, Phil. 1992, pp. 165-171, 175, 177, 191-204.
Raok., Yip P. The Transform and Data Compression Handbook CRC Press, 2000, pp. 13-15, 35-37, 61-63 73-75 117-123, 161-167, 191.
Celko J. SQL for Smarties. Morgan Kaufman Publ. S F, 1995, pp. 2-3, 10-11.
Storer J. Data Compression: Methods and Theory Computer Science Press, Rockville, MD, 1988. pp. 6, 7, 10, 11, 103-111, 114-115, 126-128.
LandOfFree
Method of compression of binary data with a random number... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of compression of binary data with a random number..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of compression of binary data with a random number... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3858419