Selectively lossy, lossless, and/or error robust data...

Image analysis – Image compression or coding

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C382S254000, C382S263000, C382S162000

Reexamination Certificate

active

07907784

ABSTRACT:
Lossless compression techniques provide efficient compression of hyperspectral satellite data. The present invention combines the advantages of a clustering with linear modeling. A number of visualizations are presented, which help clarify why the approach of the present invention is particularly effective on this dataset. At each stage, the algorithm achieves an efficient grouping of the data points around a relatively small number of lines in a very large dimensional data space. The parametrization of these lines is very efficient, which leads to efficient descriptions of data points. The method of the present invention yields compression ratios that compare favorably with what is currently achievable by other approaches.

REFERENCES:
patent: 5400371 (1995-03-01), Natarajan
patent: 5825830 (1998-10-01), Kopf
patent: 6023525 (2000-02-01), Cass
patent: 6546146 (2003-04-01), Hollinger
patent: 6661924 (2003-12-01), Abe
patent: 6701021 (2004-03-01), Qian
patent: 6724940 (2004-04-01), Qian
patent: 6804400 (2004-10-01), Sharp
patent: 7261565 (2007-08-01), Chosack et al.
patent: 7433696 (2008-10-01), Dietrich et al.
patent: 2002/0159617 (2002-10-01), Hu
patent: 2004/0008896 (2004-01-01), Suzuki
patent: 2004/0093364 (2004-05-01), Cheng
patent: 2004/0102906 (2004-05-01), Roder
patent: 2005/0036661 (2005-02-01), Viggh
patent: 2005/0047670 (2005-03-01), Qian
patent: 2006/0038705 (2006-02-01), Brady
patent: 2006/0251324 (2006-11-01), Bachmann
patent: 1209917 (2002-05-01), None
patent: 1209627 (2006-05-01), None
patent: WO2005022399 (2005-03-01), None
D. Salomon, Data Compression: The Complete Reference, Springer, New York, 2004 (third edition).
H.H. Aumann, M.T. Chahine, C. Gautier, M. D. Goldberg, E. Kalnay, L.M. McMillan, H. Revercomb, P.W. Rosenkranz, W.L. Smith, D.H. Staelin, L.L. Strow, and J. Susskind, “AIRS/AMSU/HSB on the Aqua Mission: design, science objectives, data products, and processing systems,” IEEE Trans. Geosci. Remote Sensing 41(2), pp. 253-264, 2003.
M. Goldberg, Y. Qu, L. M. McMillan, W. Wolf, L. Zhou, and M. Divakarla, “AIRS near-real-time products and algorithms in support of operational numerical weather prediction,” IEEE Transactions on Geoscience and RemoteSensing 41, pp. 379-389, 2003.
D. Huffman, “A method for the construction of minimum redundancy codes,” Proc of IRE 40, pp. 1098-1101, 1952.
C. E. Shannon, “Communications in the presence of noise,” Proc. of IRE 37, pp. 10-21, 1949.
C. E. Shannon, “A Mathematical Theory of Communication,” The Bell System Technical Journal 27, pp. 379-423, 623-656, 1948.
H. H. Aumann, D.T. Gregorich, S.L. Gaiser, D.F. Hagan, T.S. Pagano, L. Strow, and D. Ting, “AIRS level lb algorithm theoretical basis document (ATBD) part 1 (IR),” Nov. 10, 2000.
G. Davis and A. Nosratinia, “Wavelet-based image coding: An overview,” Applied and Computational Control, Signals, and Circuits 1(1), 1998.
R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification, S.E, Wiley Interscience, 2000.

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

Selectively lossy, lossless, and/or error robust 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 Selectively lossy, lossless, and/or error robust data..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Selectively lossy, lossless, and/or error robust data... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2630541

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