Image analysis – Image compression or coding – Lossless compression
Reexamination Certificate
2007-07-18
2008-09-30
Tran, Phuoc (Department: 2624)
Image analysis
Image compression or coding
Lossless compression
C382S233000
Reexamination Certificate
active
07430331
ABSTRACT:
A data compression system and method for that is capable of detecting and eliminating repeated phrases of variable length within a window of virtually unlimited size.
REFERENCES:
patent: 4322795 (1982-03-01), Lange et al.
patent: 4814746 (1989-03-01), Miller et al.
patent: 4876541 (1989-10-01), Storer
patent: 5049881 (1991-09-01), Gibson et al.
patent: 5087913 (1992-02-01), Eastman
patent: 5307413 (1994-04-01), Denzer
patent: 5371499 (1994-12-01), Graybill et al.
patent: 5377329 (1994-12-01), Seitz
patent: 5394879 (1995-03-01), Gorman
patent: 5450562 (1995-09-01), Rosenberg et al.
patent: 5485526 (1996-01-01), Tobin
patent: 5633871 (1997-05-01), Bloks
patent: 5864554 (1999-01-01), Rostoker et al.
patent: 5867114 (1999-02-01), Barbir
patent: 5892549 (1999-04-01), Feng
patent: 5903230 (1999-05-01), Masenas
patent: 5951623 (1999-09-01), Reynar et al.
patent: 5966385 (1999-10-01), Fujii et al.
patent: 5996022 (1999-11-01), Krueger et al.
patent: 6014712 (2000-01-01), Islam et al.
patent: 6067381 (2000-05-01), Benayoun et al.
patent: 6100824 (2000-08-01), MacLeod et al.
patent: 6339595 (2002-01-01), Rekhter et al.
patent: 6351465 (2002-02-01), Han
patent: 6456209 (2002-09-01), Savari
patent: 6484210 (2002-11-01), Adriano et al.
patent: 6490356 (2002-12-01), Beuque
patent: 6498809 (2002-12-01), Dean et al.
patent: 6584093 (2003-06-01), Salama et al.
patent: 6614785 (2003-09-01), Huai et al.
patent: 6665725 (2003-12-01), Dietz et al.
patent: 6748520 (2004-06-01), Maynard et al.
patent: 6760336 (2004-07-01), Mangin et al.
patent: 6771646 (2004-08-01), Sarkissian et al.
patent: 6822589 (2004-11-01), Dye et al.
patent: 6907048 (2005-06-01), Treadaway et al.
patent: 6937574 (2005-08-01), Delaney et al.
patent: 2001/0056416 (2001-12-01), Garcia-Luna-Aceves
patent: 2002/0044553 (2002-04-01), Chakravorty
patent: 2002/0071438 (2002-06-01), Singh
patent: 2002/0184390 (2002-12-01), Alkhatib
patent: 2003/0058856 (2003-03-01), Salett et al.
patent: 2005/0105506 (2005-05-01), Birdwell et al.
patent: 2006/0114939 (2006-06-01), Singh
patent: 2180039 (1999-01-01), None
patent: 0 127 815 (1984-12-01), None
patent: 0 643 491 (1995-03-01), None
patent: 1 134 900 (2001-09-01), None
patent: WO 00/07124 (2000-10-01), None
European Search Report for corresponding European Application No. EP 07 02 2712, dated Feb. 25, 2008, 10 pgs.
European Search Report for corresponding European Application No. EP 07 02 2713 dated May 6, 2008, 7 pgs.
Clark, A.D., “Adaptive source coding techniques for communications systems,” Telecommunications, 1989, Second IEEE National Conference on Telecommunications, p. 53-60.
Obaidat, M.S., et al. “Verification of Computer User Using Keystroke Dynamics,” IEEE Transactions of Systems, Man, and Cybernetics—Part B: Cybernetics, vol. 27, No. 2, pp. 261-269, Apr. 1997.
Liu, Z. et al., Scalable Robust Efficient Dictionary-Based Compression (SCRIBE), Mar. 22, 2001, [online] [Retrieved on Feb. 21, 2005] Retrived from the Internet <URL:http://www.watersprings.org/pub/id/draft-liu-rohc-scribe-00.txt>.
Nevill-Manning, C. et al., “Identifying Hierarchical Structure In Sequences: A Linear-Time Algorithm,” Journal of Artificial Intelligence Research, Sep. 1997, pp. 67-82, vol. 7.
Nevill-Manning, C. et al., “Linear Time, Incremental Hierarchy Inference For Compression,” Data Compression Conference, 1997, DCC '97, Proceedings Snowbird, Mar. 25-27, 1997, Los Alamitos, CA, USA, IEEE Comput. Soc., Mar. 25, 1997, pp. 3-11.
Nevill-Manning, C. et al., “Phrase Hierarchy Inference And Compression In Bounded Space,” Data Compression Conference, 1998, DCC '98, Proceedings Snowbird, Mar. 1-Apr. 1998, Los Alamitos, CA, USA, IEEE Comput. Soc., Mar. 30, 1998, pp. 179-188.
Banga, G. et al., “Optimistic Deltas For WWW Latency Reduction,” 1997 Annual Technical Conference, Usenix Association, 1997, pp. 289-303.
Chi, C. et al., “Compression Proxy Server: Design And Implementation,” Proceedings of USITS'99: The 2ndUSENIX Symposium On Internet Technologies & Systems, The Usenix Association, Oct. 11-14, 1999, 13 pages.
Heywood, P., “Compression And Routers, Together At Last,” International News Analysis, Data Communications, Apr. 24, 1995, pp. 55-56, 61-63, No. 5.
Nand, A. et al., “Mail Servers With Embedded Data Compression Mechanism,” IEEE, 1998, p. 566.
Nevill-Manning, C. et al., “Compression And Explanation Using Hierarchical Grammars,” The Computer Journal, 1997, pp. 103-116, vol. 40.
Sheu, S. et al., “A Link Level Compression Strategy For High-Speed Backbone ATM Networks,” pp. 1-5.
Supplemental European Search Report of European Application No. 01 955 826.6, Feb. 22, 2005, 3 pgs.
Notification of Transmittal of the International Search Report or the Declaration, PCT/US01/22690, Apr. 24, 2002.
First Substantive Examination Report from the European Patent Office for Application No. 01 955 826.6-2223, dated Jun. 6, 2006, 7 pgs.
Storer, J.A., “Data Compression Via Textual Substitution,” Journal of the Association for Computing Machinery, 29(4): 928-951 (1982).
Huffman, D.A., “A Method for the Construction of Minimum-Redundancy Codes,” Proceedings of the IRE, 40:1098-1101 (1952).
Witten et al., “Arithmetic Coding for Data Compression,” Comunications of the Association for Computing Machinery, 30(6):520-540 (1987).
Shannon, C.E., “A Mathematical Theory of Communication,” The Bell System Technical Journal, vol. 27, 55 pgs. (1948).
Ziv et al., “A Universal Algorithm for Sequential Data Compression,” IEEE Transactions on Information Theory, IT-23(3):337-343 (1977).
Ziv et al., “Compression of Individual Sequences via Variable-Rate Coding,” IEEE Transactions on Information Theory, IT-24(5):530-536 (1978).
Larsson et al., “Offline Dictionary-Based Compression,” Proceedings Data Compression Conference, 10 pgs. (1999).
Juniper Networks, Inc.
Shumaker & Sieffert P.A.
Tran Phuoc
LandOfFree
System and method for incremental and continuous 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 System and method for incremental and continuous data..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for incremental and continuous data... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3987741