CA2475186A1 - Method and apparatus for windowing in entropy encoding - Google Patents
Method and apparatus for windowing in entropy encoding Download PDFInfo
- Publication number
- CA2475186A1 CA2475186A1 CA002475186A CA2475186A CA2475186A1 CA 2475186 A1 CA2475186 A1 CA 2475186A1 CA 002475186 A CA002475186 A CA 002475186A CA 2475186 A CA2475186 A CA 2475186A CA 2475186 A1 CA2475186 A1 CA 2475186A1
- Authority
- CA
- Canada
- Prior art keywords
- gamma
- partition
- length
- data segment
- pair
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
- Y10S707/99935—Query augmenting and refining, e.g. inexact access
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
- Y10S707/99936—Pattern matching access
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99942—Manipulating data structure, e.g. compression, compaction, compilation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99943—Generating database or data structure, e.g. via user interface
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99944—Object-oriented database structure
- Y10S707/99945—Object-oriented database structure processing
Abstract
The present invention provides efficient window partitioning algorithms for entropy-encoding. The present invention enhances compression performance of entropy encoding based on the approach of modeling a dataset with the frequencies of its n-grams. The present invention may then employ approximation algorithms to compute good partitions in time O(s*log s) and O(s) respectively, for any data segment S with length s.
Claims (20)
1. A method for partitioning a given data segment, P, with length p into smaller segments, P i, that can be compressed separately, said method comprising the step of:
dividing said data segment, P into a plurality of 2-partition pairs .pi. where both partitions within each pair having a predefined length of at least µ(P);
estimating the compressed length of each partition within each pair; and selecting one of said 2-partition pairs .pi. for partitioning said data segment, P, such that .GAMMA.(.pi.) < .GAMMA.(P), where .GAMMA.(.pi.) represents a compressed length of said partition and .GAMMA.(P) represents a compressed length of said data segment, P.
dividing said data segment, P into a plurality of 2-partition pairs .pi. where both partitions within each pair having a predefined length of at least µ(P);
estimating the compressed length of each partition within each pair; and selecting one of said 2-partition pairs .pi. for partitioning said data segment, P, such that .GAMMA.(.pi.) < .GAMMA.(P), where .GAMMA.(.pi.) represents a compressed length of said partition and .GAMMA.(P) represents a compressed length of said data segment, P.
2. The method of claim 1, wherein if more than one 2-partition pair .pi. is determined to satisfy .GAMMA.(.pi.) < .GAMMA.(P), then said dividing step, said estimating step and said selecting step is recursively applied to each partition of said more than one 2-partition pair .pi..
3. The method of claim 1, wherein said the compressed length of said data segment is estimated using the function of:
where F P[i) is a corresponding array of frequencies for a byte i and .tau. is an estimate for the length of a table of codes or frequencies that a static Huffman or arithmetic compressor needs to decode data.
where F P[i) is a corresponding array of frequencies for a byte i and .tau. is an estimate for the length of a table of codes or frequencies that a static Huffman or arithmetic compressor needs to decode data.
4. The method of claim 1, wherein said method has a computation complexity O(plog p).
5. The method of claim 7 , where .GAMMA.(.pi.) = and µ(P)=max(p/5, .epsilon.) and .epsilon. is an arbitrary parameter.
6. The method of claim 2, further comprising:
picking any one of said .pi. arbitrarily when more than one instance of said .pi. is found.
picking any one of said .pi. arbitrarily when more than one instance of said .pi. is found.
7. The method of claim 1, further comprising:
ordering all 2-partition pairs by the length of their left parts, for all 2-partitions of P with parts having minimum length of µ(P), where µ(P)=max(p/5, .epsilon.) and .epsilon. is an arbitrary parameter; and finding the first .pi.i such that .GAMMA.(.pi.i) < .GAMMA.(P) and .GAMMA.(.pi.i=+1) > .GAMMA.(.pi.i).
ordering all 2-partition pairs by the length of their left parts, for all 2-partitions of P with parts having minimum length of µ(P), where µ(P)=max(p/5, .epsilon.) and .epsilon. is an arbitrary parameter; and finding the first .pi.i such that .GAMMA.(.pi.i) < .GAMMA.(P) and .GAMMA.(.pi.i=+1) > .GAMMA.(.pi.i).
8. The method of claim 7, wherein said finding step comprises:
when said .pi.i is found, then recursively applying a right partition associated with said .pi.i.
when said .pi.i is found, then recursively applying a right partition associated with said .pi.i.
9. A computer-readable medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a processor, cause the processor to perform the steps of a method for partitioning a given data segment, P, with length p into smaller segments, P i, that can be compressed separately, comprising of:
dividing said data segment, P into a plurality of 2-partition pairs .pi. where both partitions within each pair having a predefined length of at least µ(P);
estimating the compressed length of each partition within each pair; and selecting one of said 2-partition pairs .pi. for partitioning said data segment, P, such that .GAMMA.(.pi.) < .GAMMA.(P), where .GAMMA.(.pi.) represents a compressed length of said partition and .GAMMA.(P) represents a compressed length of said data segment, P.
dividing said data segment, P into a plurality of 2-partition pairs .pi. where both partitions within each pair having a predefined length of at least µ(P);
estimating the compressed length of each partition within each pair; and selecting one of said 2-partition pairs .pi. for partitioning said data segment, P, such that .GAMMA.(.pi.) < .GAMMA.(P), where .GAMMA.(.pi.) represents a compressed length of said partition and .GAMMA.(P) represents a compressed length of said data segment, P.
10. The computer-readable medium of claim 9, wherein if more than one 2-partition pair .pi. is determined to satisfy .GAMMA.(.pi.) < .GAMMA.(P), then said dividing step, said estimating step and said selecting step is recursively applied to each partition of said more than one 2-partition pair .pi..
11. The computer-readable medium of claim 9, wherein said the compressed length of said data segment is estimated using the function of:
where F P[i] is a corresponding array of frequencies for a byte i and .tau.is an estimate for the length of a table of codes or frequencies that a static Huffman or arithmetic compressor needs to decode data.
where F P[i] is a corresponding array of frequencies for a byte i and .tau.is an estimate for the length of a table of codes or frequencies that a static Huffman or arithmetic compressor needs to decode data.
12. The computer-readable medium of claim 9, wherein said method has a computation complexity O(plog p).
13. The computer-readable medium of claim 9, where .GAMMA.(.pi.) = and µ(P)=max(p/5, .epsilon.) and .epsilon. is an arbitrary parameter.
14. The computer-readable medium of claim 10, further comprising:
picking any one of said .pi. arbitrarily when more than one instance of said .pi. is found.
picking any one of said .pi. arbitrarily when more than one instance of said .pi. is found.
15. The computer-readable medium of claim 9, further comprising:
ordering all 2-partition pairs by the length of their left parts, for all 2-partitions of P with parts having minimum length of µ(P), where µ(P)=max(p/5, .epsilon.) and .epsilon. is an arbitrary parameter; and finding the first .pi.i such that .GAMMA.(.pi.i) < .GAMMA.(P) and .GAMMA.(.pi.i+1) > .GAMMA.(.pi.i).
ordering all 2-partition pairs by the length of their left parts, for all 2-partitions of P with parts having minimum length of µ(P), where µ(P)=max(p/5, .epsilon.) and .epsilon. is an arbitrary parameter; and finding the first .pi.i such that .GAMMA.(.pi.i) < .GAMMA.(P) and .GAMMA.(.pi.i+1) > .GAMMA.(.pi.i).
16. The computer-readable medium of claim 15, wherein said finding step comprises:
when said .pi.i is found, then recursively applying a right partition associated with said .pi.i.
when said .pi.i is found, then recursively applying a right partition associated with said .pi.i.
17. An apparatus for partitioning a given data segment, P, with length p into smaller segments, P i, that can be compressed separately, comprising:
means for dividing said data segment, P into a plurality of 2-partition pairs .pi. where both partitions within each pair having a predefined length of at least µ(P);
means for estimating the compressed length of each partition within each pair;
and means for selecting one of said 2-partition pairs .pi. for partitioning said data segment, P, such that .GAMMA.(.pi.) < .GAMMA.(P), where .GAMMA.(.pi.) represents a compressed length of said partition and .GAMMA.(P) represents a compressed length of said data segment; P.
means for dividing said data segment, P into a plurality of 2-partition pairs .pi. where both partitions within each pair having a predefined length of at least µ(P);
means for estimating the compressed length of each partition within each pair;
and means for selecting one of said 2-partition pairs .pi. for partitioning said data segment, P, such that .GAMMA.(.pi.) < .GAMMA.(P), where .GAMMA.(.pi.) represents a compressed length of said partition and .GAMMA.(P) represents a compressed length of said data segment; P.
18. The apparatus of claim 17, wherein if more than one 2-partition pair .pi.
is determined to satisfy .GAMMA.(.pi.) < .GAMMA.(P), then said dividing step, said estimating step and said selecting step is recursively applied to each partition of said more than one 2-partition pair .pi..
is determined to satisfy .GAMMA.(.pi.) < .GAMMA.(P), then said dividing step, said estimating step and said selecting step is recursively applied to each partition of said more than one 2-partition pair .pi..
19. The apparatus of claim 17, wherein said the compressed length of said data segment is estimated using the function of:
where F P[i) is a corresponding array of frequencies for a byte i and .tau. is an estimate for the length of a table of codes or frequencies that a static Huffman or arithmetic compressor needs to decode data.
where F P[i) is a corresponding array of frequencies for a byte i and .tau. is an estimate for the length of a table of codes or frequencies that a static Huffman or arithmetic compressor needs to decode data.
20. The apparatus of claim 17, wherein said method has a computation complexity O(plog p).
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CA002686618A CA2686618A1 (en) | 2003-07-17 | 2004-07-19 | Method and apparatus for windowing in entropy encoding |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US48799203P | 2003-07-17 | 2003-07-17 | |
US60/487,992 | 2003-07-17 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002686618A Division CA2686618A1 (en) | 2003-07-17 | 2004-07-19 | Method and apparatus for windowing in entropy encoding |
Publications (2)
Publication Number | Publication Date |
---|---|
CA2475186A1 true CA2475186A1 (en) | 2005-01-17 |
CA2475186C CA2475186C (en) | 2010-01-05 |
Family
ID=34079401
Family Applications (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002686618A Abandoned CA2686618A1 (en) | 2003-07-17 | 2004-07-19 | Method and apparatus for windowing in entropy encoding |
CA002475186A Expired - Fee Related CA2475186C (en) | 2003-07-17 | 2004-07-19 | Method and apparatus for windowing in entropy encoding |
CA002475189A Expired - Fee Related CA2475189C (en) | 2003-07-17 | 2004-07-19 | Method and apparatus for window matching in delta compressors |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002686618A Abandoned CA2686618A1 (en) | 2003-07-17 | 2004-07-19 | Method and apparatus for windowing in entropy encoding |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002475189A Expired - Fee Related CA2475189C (en) | 2003-07-17 | 2004-07-19 | Method and apparatus for window matching in delta compressors |
Country Status (2)
Country | Link |
---|---|
US (4) | US7296030B2 (en) |
CA (3) | CA2686618A1 (en) |
Families Citing this family (67)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7296030B2 (en) * | 2003-07-17 | 2007-11-13 | At&T Corp. | Method and apparatus for windowing in entropy encoding |
WO2008091483A2 (en) * | 2007-01-23 | 2008-07-31 | Euclid Discoveries, Llc | Computer method and apparatus for processing image data |
US8902971B2 (en) | 2004-07-30 | 2014-12-02 | Euclid Discoveries, Llc | Video compression repository and model reuse |
US9743078B2 (en) | 2004-07-30 | 2017-08-22 | Euclid Discoveries, Llc | Standards-compliant model-based video encoding and decoding |
US9578345B2 (en) | 2005-03-31 | 2017-02-21 | Euclid Discoveries, Llc | Model-based video encoding and decoding |
US9532069B2 (en) | 2004-07-30 | 2016-12-27 | Euclid Discoveries, Llc | Video compression repository and model reuse |
US7596632B1 (en) | 2004-10-05 | 2009-09-29 | At&T Intellectual Property Ii, L.P. | Windowing by prefix matching |
US7792694B2 (en) * | 2004-12-16 | 2010-09-07 | International Business Machines Corporation | Method, system, and storage medium for assessing and implementing an organizational transformation |
ES2382814T3 (en) | 2005-05-17 | 2012-06-13 | Merck Sharp & Dohme Ltd. | Cis-4 - [(4-chlorophenyl) sulfonyl] -4- (2,5-difluorophenyl) cyclohexanopropanoic acid for cancer treatment |
WO2007087246A2 (en) | 2006-01-24 | 2007-08-02 | Merck & Co., Inc. | Jak2 tyrosine kinase inhibition |
DE102006021342A1 (en) * | 2006-05-05 | 2007-11-08 | T-Mobile International Ag & Co. Kg | Method for reducing the initial delay time in network initiated data transmissions in mobile networks |
US20080172430A1 (en) * | 2007-01-11 | 2008-07-17 | Andrew Thomas Thorstensen | Fragmentation Compression Management |
EP2106663A2 (en) | 2007-01-23 | 2009-10-07 | Euclid Discoveries, LLC | Object archival systems and methods |
US8243118B2 (en) | 2007-01-23 | 2012-08-14 | Euclid Discoveries, Llc | Systems and methods for providing personal video services |
EP2139332A4 (en) * | 2007-03-28 | 2010-04-21 | Merck Sharp & Dohme | Substituted pyrido[2,3-d]pyrimidine derivatives as cannabinoid-1 receptor modulators |
US8819288B2 (en) * | 2007-09-14 | 2014-08-26 | Microsoft Corporation | Optimized data stream compression using data-dependent chunking |
US8108401B2 (en) * | 2008-03-28 | 2012-01-31 | International Business Machines Corporation | Applying various hash methods used in conjunction with a query with a group by clause |
US7827187B2 (en) * | 2008-04-04 | 2010-11-02 | International Business Machines Corporation | Frequency partitioning: entropy compression with fixed size fields |
US8099440B2 (en) * | 2008-08-15 | 2012-01-17 | International Business Machines Corporation | Method for laying out fields in a database in a hybrid of row-wise and column-wise ordering |
EP2345256B1 (en) | 2008-10-07 | 2018-03-14 | Euclid Discoveries, LLC | Feature-based video compression |
US8447740B1 (en) | 2008-11-14 | 2013-05-21 | Emc Corporation | Stream locality delta compression |
US8751462B2 (en) * | 2008-11-14 | 2014-06-10 | Emc Corporation | Delta compression after identity deduplication |
US8849772B1 (en) | 2008-11-14 | 2014-09-30 | Emc Corporation | Data replication with delta compression |
CN102165778A (en) * | 2009-02-10 | 2011-08-24 | 松下电器产业株式会社 | Image processing apparatus, image processing method, program and integrated circuit |
US8918374B1 (en) * | 2009-02-13 | 2014-12-23 | At&T Intellectual Property I, L.P. | Compression of relational table data files |
US8370326B2 (en) | 2009-03-24 | 2013-02-05 | International Business Machines Corporation | System and method for parallel computation of frequency histograms on joined tables |
US8691825B2 (en) | 2009-04-01 | 2014-04-08 | Merck Sharp & Dohme Corp. | Inhibitors of AKT activity |
US8412848B2 (en) | 2009-05-29 | 2013-04-02 | Exagrid Systems, Inc. | Method and apparatus for content-aware and adaptive deduplication |
UA109417C2 (en) | 2009-10-14 | 2015-08-25 | Мерк Шарп Енд Доме Корп. | Substituted piperidines, which improve activity of p53, and use thereof |
US8999957B2 (en) | 2010-06-24 | 2015-04-07 | Merck Sharp & Dohme Corp. | Heterocyclic compounds as ERK inhibitors |
EP2613782B1 (en) | 2010-09-01 | 2016-11-02 | Merck Sharp & Dohme Corp. | Indazole derivatives useful as erk inhibitors |
US8456333B1 (en) | 2010-10-22 | 2013-06-04 | Smith Micro Software, Inc. | Advanced solid block splitting for lossless data compression |
CN103262424B (en) * | 2010-11-02 | 2016-10-19 | 简·克劳德·科林 | For the method compressing the digital value of image, audio frequency and/or video file |
US8442988B2 (en) * | 2010-11-04 | 2013-05-14 | International Business Machines Corporation | Adaptive cell-specific dictionaries for frequency-partitioned multi-dimensional data |
EP2654748B1 (en) | 2010-12-21 | 2016-07-27 | Merck Sharp & Dohme Corp. | Indazole derivatives useful as erk inhibitors |
US20120185612A1 (en) * | 2011-01-19 | 2012-07-19 | Exar Corporation | Apparatus and method of delta compression |
US8694474B2 (en) * | 2011-07-06 | 2014-04-08 | Microsoft Corporation | Block entropy encoding for word compression |
US8589363B2 (en) | 2011-07-19 | 2013-11-19 | Exagrid Systems, Inc. | Systems and methods for managing delta version chains |
EP2770987B1 (en) | 2011-10-27 | 2018-04-04 | Merck Sharp & Dohme Corp. | Novel compounds that are erk inhibitors |
US9684974B2 (en) | 2012-08-21 | 2017-06-20 | EMC IP Holding Company LLC | Lossless compression of fragmented image data |
JP6280554B2 (en) | 2012-09-28 | 2018-02-14 | メルク・シャープ・アンド・ドーム・コーポレーションMerck Sharp & Dohme Corp. | Novel compounds that are ERK inhibitors |
KR102161331B1 (en) | 2012-11-28 | 2020-09-29 | 머크 샤프 앤드 돔 코포레이션 | Compositions and methods for treating cancer |
ES2707305T3 (en) | 2012-12-20 | 2019-04-03 | Merck Sharp & Dohme | Imidazopyridines substituted as HDM2 inhibitors |
EP2951180B1 (en) | 2013-01-30 | 2018-05-02 | Merck Sharp & Dohme Corp. | 2,6,7,8 substituted purines as hdm2 inhibitors |
US20140358874A1 (en) * | 2013-05-31 | 2014-12-04 | Avaya Inc. | Compression system and method |
US9621917B2 (en) | 2014-03-10 | 2017-04-11 | Euclid Discoveries, Llc | Continuous block tracking for temporal prediction in video encoding |
US10091507B2 (en) | 2014-03-10 | 2018-10-02 | Euclid Discoveries, Llc | Perceptual optimization for model-based video encoding |
US10097851B2 (en) | 2014-03-10 | 2018-10-09 | Euclid Discoveries, Llc | Perceptual optimization for model-based video encoding |
US8878705B1 (en) * | 2014-03-28 | 2014-11-04 | Npression Technologies, LLC | Variable bit-length reiterative lossless compression system and method |
US9805099B2 (en) * | 2014-10-30 | 2017-10-31 | The Johns Hopkins University | Apparatus and method for efficient identification of code similarity |
US20170004160A1 (en) * | 2015-07-02 | 2017-01-05 | Carcema Inc. | Method and System for Feature-Selectivity Investigative Navigation |
US10565182B2 (en) * | 2015-11-23 | 2020-02-18 | Microsoft Technology Licensing, Llc | Hardware LZMA compressor |
JOP20190055A1 (en) | 2016-09-26 | 2019-03-24 | Merck Sharp & Dohme | Anti-cd27 antibodies |
US10679088B1 (en) | 2017-02-10 | 2020-06-09 | Proofpoint, Inc. | Visual domain detection systems and methods |
US10972443B2 (en) * | 2017-03-06 | 2021-04-06 | International Business Machines Corporation | System and method for encrypted document co-editing |
SG11201908813QA (en) | 2017-04-13 | 2019-10-30 | Aduro Biotech Holdings Europe B V | Anti-sirp alpha antibodies |
US9864956B1 (en) * | 2017-05-01 | 2018-01-09 | SparkCognition, Inc. | Generation and use of trained file classifiers for malware detection |
US10616252B2 (en) | 2017-06-30 | 2020-04-07 | SparkCognition, Inc. | Automated detection of malware using trained neural network-based file classifiers and machine learning |
US10305923B2 (en) | 2017-06-30 | 2019-05-28 | SparkCognition, Inc. | Server-supported malware detection and protection |
WO2019094311A1 (en) | 2017-11-08 | 2019-05-16 | Merck Sharp & Dohme Corp. | Prmt5 inhibitors |
CN108268628A (en) * | 2018-01-15 | 2018-07-10 | 深圳前海信息技术有限公司 | The method and device of delta compression based on dynamic anchor point |
WO2019148412A1 (en) | 2018-02-01 | 2019-08-08 | Merck Sharp & Dohme Corp. | Anti-pd-1/lag3 bispecific antibodies |
US20210277009A1 (en) | 2018-08-07 | 2021-09-09 | Merck Sharp & Dohme Corp. | Prmt5 inhibitors |
US20210309688A1 (en) | 2018-08-07 | 2021-10-07 | Merck Sharp & Dohme Corp. | Prmt5 inhibitors |
AU2020408148A1 (en) | 2019-12-17 | 2022-06-16 | Merck Sharp & Dohme Llc | PRMT5 inhibitors |
CN114153790A (en) * | 2022-02-10 | 2022-03-08 | 四川创智联恒科技有限公司 | Method for reducing space occupation of log file, storage medium and terminal |
CN116939047B (en) * | 2023-09-18 | 2023-11-24 | 吉林省车桥汽车零部件有限公司 | Data intelligent communication method for numerical control machine tool system |
Family Cites Families (65)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4333160A (en) * | 1978-11-20 | 1982-06-01 | Victor Company Of Japan, Ltd. | Memory control system |
US4823201A (en) * | 1987-11-16 | 1989-04-18 | Technology, Inc. 64 | Processor for expanding a compressed video signal |
CA1341310C (en) * | 1988-07-15 | 2001-10-23 | Robert Filepp | Interactive computer network and method of operation |
US5081675A (en) * | 1989-11-13 | 1992-01-14 | Kitti Kittirutsunetorn | System for protection of software in memory against unauthorized use |
US5285276A (en) * | 1991-03-12 | 1994-02-08 | Zenith Electronics Corp. | Bi-rate high definition television signal transmission system |
US5104091A (en) * | 1991-05-14 | 1992-04-14 | United Technologies Corporation | Spring assisted ball valve |
US5983004A (en) * | 1991-09-20 | 1999-11-09 | Shaw; Venson M. | Computer, memory, telephone, communications, and transportation system and methods |
US5838834A (en) * | 1991-11-07 | 1998-11-17 | Canon Kabushiki Kaisha | Image processing apparatus and method for quantizing image data and quantization errors using single quantizing unit and pluralities of quantization tables |
US5251273A (en) * | 1992-04-15 | 1993-10-05 | International Business Machines Corporation | Data processing system and method for sequentially repairing character recognition errors for scanned images of document forms |
US5295159A (en) * | 1992-04-17 | 1994-03-15 | Bell Communications Research, Inc. | Coordinated coding for digital transmission |
US5285278A (en) * | 1992-05-21 | 1994-02-08 | Holman Michael J | Electronic redeemable coupon system via television |
US5870036A (en) * | 1995-02-24 | 1999-02-09 | International Business Machines Corporation | Adaptive multiple dictionary data compression |
US5594435A (en) * | 1995-09-13 | 1997-01-14 | Philosophers' Stone Llc | Permutation-based data compression |
US5956674A (en) * | 1995-12-01 | 1999-09-21 | Digital Theater Systems, Inc. | Multi-channel predictive subband audio coder using psychoacoustic adaptive bit allocation in frequency, time and over the multiple channels |
WO1997027589A1 (en) * | 1996-01-26 | 1997-07-31 | Exabyte Corporation | Handling defective frames on hard sectored magnetic tape |
US6122379A (en) * | 1996-05-30 | 2000-09-19 | Deloitte & Touche Inc. | Method and apparatus for performing simultaneous data compression and encryption |
CN1106717C (en) * | 1996-07-03 | 2003-04-23 | 皇家菲利浦电子有限公司 | Transmission and reception of digital information signal |
US5855011A (en) * | 1996-09-13 | 1998-12-29 | Tatsuoka; Curtis M. | Method for classifying test subjects in knowledge and functionality states |
US6374250B2 (en) * | 1997-02-03 | 2002-04-16 | International Business Machines Corporation | System and method for differential compression of data from a plurality of binary sources |
US6263444B1 (en) * | 1997-03-11 | 2001-07-17 | National Aerospace Laboratory Of Science & Technology Agency | Network unauthorized access analysis method, network unauthorized access analysis apparatus utilizing the method, and computer-readable recording medium having network unauthorized access analysis program recorded thereon |
US5946692A (en) * | 1997-05-08 | 1999-08-31 | At & T Corp | Compressed representation of a data base that permits AD HOC querying |
DE19732888A1 (en) * | 1997-07-30 | 1999-02-25 | Still & Saxby Sarl | Operating device for an industrial truck |
US5808068A (en) * | 1997-08-15 | 1998-09-15 | The Picower Institute For Medical Research | HIV nuclear localization inhibitors |
US6198773B1 (en) * | 1997-12-18 | 2001-03-06 | Zoran Corporation | Video memory management for MPEG video decode and display system |
US6249902B1 (en) * | 1998-01-09 | 2001-06-19 | Silicon Perspective Corporation | Design hierarchy-based placement |
US6115689A (en) * | 1998-05-27 | 2000-09-05 | Microsoft Corporation | Scalable audio coder and decoder |
US6253165B1 (en) * | 1998-06-30 | 2001-06-26 | Microsoft Corporation | System and method for modeling probability distribution functions of transform coefficients of encoded signal |
US6499137B1 (en) * | 1998-10-02 | 2002-12-24 | Microsoft Corporation | Reversible load-time dynamic linking |
US6381628B1 (en) * | 1998-10-02 | 2002-04-30 | Microsoft Corporation | Summarized application profiling and quick network profiling |
US6959300B1 (en) * | 1998-12-10 | 2005-10-25 | At&T Corp. | Data compression method and apparatus |
KR100308190B1 (en) * | 1999-01-20 | 2001-09-26 | 윤종용 | Method of removing pyrochlore caused during a ferroelectric crystalline dielectric film process |
US7017043B1 (en) * | 1999-03-19 | 2006-03-21 | The Regents Of The University Of California | Methods and systems for the identification of circuits and circuit designs |
US6381626B1 (en) * | 1999-04-22 | 2002-04-30 | Electronic Data Systems Corporation | ATM video advertising |
TW548454B (en) * | 1999-09-07 | 2003-08-21 | Ind Tech Res Inst | Method of using low voltage to manufacture bulk ferroelectric material reverse region |
US7139700B1 (en) * | 1999-09-22 | 2006-11-21 | Texas Instruments Incorporated | Hybrid speech coding and system |
US7039581B1 (en) * | 1999-09-22 | 2006-05-02 | Texas Instruments Incorporated | Hybrid speed coding and system |
JP3738631B2 (en) * | 1999-09-27 | 2006-01-25 | 三菱電機株式会社 | Image search system and image search method |
US6502097B1 (en) * | 1999-12-23 | 2002-12-31 | Microsoft Corporation | Data structure for efficient access to variable-size data objects |
US6351229B1 (en) * | 2000-09-05 | 2002-02-26 | Texas Instruments Incorporated | Density-modulated dynamic dithering circuits and method for delta-sigma converter |
US7283987B2 (en) * | 2001-03-05 | 2007-10-16 | Sap Ag | Compression scheme for improving cache behavior in database systems |
JP2003022192A (en) * | 2001-07-09 | 2003-01-24 | Hitachi Ltd | Compression programming method using block sort compression algorithm, processor system using the programming method and method for information distribution service |
JP4342753B2 (en) * | 2001-08-10 | 2009-10-14 | 株式会社リコー | Document search apparatus, document search method, program, and computer-readable storage medium |
US7043077B2 (en) * | 2001-11-07 | 2006-05-09 | International Business Machines Corporation | System and method for efficient compression of raster image data |
US6653954B2 (en) * | 2001-11-07 | 2003-11-25 | International Business Machines Corporation | System and method for efficient data compression |
US20030233321A1 (en) * | 2001-11-30 | 2003-12-18 | Scolini Anthony J. | Integrated invoice solution |
US8090730B2 (en) * | 2001-12-04 | 2012-01-03 | University Of Southern California | Methods for fast progressive evaluation of polynomial range-sum queries on real-time datacubes |
AU2002357259A1 (en) * | 2001-12-13 | 2003-07-09 | Digimarc Corporation | Reversible watermarking |
US7240001B2 (en) * | 2001-12-14 | 2007-07-03 | Microsoft Corporation | Quality improvement techniques in an audio encoder |
US20030140337A1 (en) * | 2001-12-21 | 2003-07-24 | Celoxica Ltd. | System, method, and article of manufacture for data transfer reporting for an application |
US20030138045A1 (en) * | 2002-01-18 | 2003-07-24 | International Business Machines Corporation | Video decoder with scalable architecture |
FR2835366B1 (en) * | 2002-01-29 | 2004-06-18 | Canon Kk | METHOD AND DEVICE FOR FORMING A REDUCED COMPRESSED DIGITAL SIGNAL |
US20040039839A1 (en) * | 2002-02-11 | 2004-02-26 | Shivkumar Kalyanaraman | Connectionless internet traffic engineering framework |
FR2837332A1 (en) * | 2002-03-15 | 2003-09-19 | Thomson Licensing Sa | DEVICE AND METHOD FOR INSERTING ERROR CORRECTION AND RECONSTITUTION CODES OF DATA STREAMS, AND CORRESPONDING PRODUCTS |
US7010037B2 (en) * | 2002-08-06 | 2006-03-07 | Koninklijke Philips Electronics N.V. | System and method for rate-distortion optimized data partitioning for video coding using backward adaptation |
US7096311B2 (en) * | 2002-09-30 | 2006-08-22 | Innopath Software, Inc. | Updating electronic files using byte-level file differencing and updating algorithms |
JP4040425B2 (en) * | 2002-10-17 | 2008-01-30 | Necエレクトロニクス株式会社 | Manufacturing method of semiconductor device |
US6667700B1 (en) * | 2002-10-30 | 2003-12-23 | Nbt Technology, Inc. | Content-based segmentation scheme for data compression in storage and transmission including hierarchical segment representation |
US7283591B2 (en) * | 2003-03-28 | 2007-10-16 | Tarari, Inc. | Parallelized dynamic Huffman decoder |
KR20050122275A (en) * | 2003-04-18 | 2005-12-28 | 코닌클리케 필립스 일렉트로닉스 엔.브이. | System and method for rate-distortion optimized data partitioning for video coding using parametric rate-distortion model |
US7013378B2 (en) * | 2003-04-30 | 2006-03-14 | Hewlett-Packard Development Company, L.P. | Method and system for minimizing the length of a defect list for a storage device |
US7296030B2 (en) * | 2003-07-17 | 2007-11-13 | At&T Corp. | Method and apparatus for windowing in entropy encoding |
US7031972B2 (en) * | 2003-07-21 | 2006-04-18 | Innopath Software, Inc. | Algorithms for block-level code alignment of software binary files |
US20050210056A1 (en) * | 2004-01-31 | 2005-09-22 | Itzhak Pomerantz | Workstation information-flow capture and characterization for auditing and data mining |
US7293019B2 (en) * | 2004-03-02 | 2007-11-06 | Microsoft Corporation | Principles and methods for personalizing newsfeeds via an analysis of information novelty and dynamics |
US20050198058A1 (en) * | 2004-03-04 | 2005-09-08 | International Business Machines Corporation | Services offering delivery method |
-
2004
- 2004-07-19 US US10/894,421 patent/US7296030B2/en not_active Expired - Fee Related
- 2004-07-19 CA CA002686618A patent/CA2686618A1/en not_active Abandoned
- 2004-07-19 CA CA002475186A patent/CA2475186C/en not_active Expired - Fee Related
- 2004-07-19 CA CA002475189A patent/CA2475189C/en not_active Expired - Fee Related
- 2004-07-19 US US10/894,424 patent/US7454431B2/en not_active Expired - Fee Related
-
2007
- 2007-10-12 US US11/871,391 patent/US7925639B2/en not_active Expired - Fee Related
-
2011
- 2011-03-22 US US13/069,366 patent/US8200680B2/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
CA2475186C (en) | 2010-01-05 |
CA2475189A1 (en) | 2005-01-17 |
CA2475189C (en) | 2009-10-06 |
US20110173167A1 (en) | 2011-07-14 |
US20050055367A1 (en) | 2005-03-10 |
US20050044294A1 (en) | 2005-02-24 |
US7925639B2 (en) | 2011-04-12 |
US8200680B2 (en) | 2012-06-12 |
CA2686618A1 (en) | 2005-01-17 |
US20080040375A1 (en) | 2008-02-14 |
US7296030B2 (en) | 2007-11-13 |
US7454431B2 (en) | 2008-11-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA2475186A1 (en) | Method and apparatus for windowing in entropy encoding | |
US9118345B2 (en) | Data compression profiler for configuration of compression | |
US7262719B2 (en) | Fast data stream decoding using apriori information | |
EP3620930B1 (en) | File format for accessing data quickly and efficiently | |
US20010024529A1 (en) | Image compression and decompression based on an integer wavelet transform using a lifting scheme and a correction method | |
US20120185612A1 (en) | Apparatus and method of delta compression | |
EP3620931A1 (en) | Searching for data using superset tree data structures | |
JP5134214B2 (en) | System, method and computer instructions for compressing 4D data | |
EP2717475B1 (en) | Method and apparatus for compression of generalized sensor data | |
AU2011283083B2 (en) | System and method for data compression using a field programmable gate array | |
US20180061428A1 (en) | Variable length coding of indices and bit scheduling in a pyramid vector quantizer | |
Jayakar et al. | Color image compression using SPIHT algorithm | |
JP2013013085A (en) | Compression of high bit-depth images | |
Howard et al. | Error modeling for hierarchical lossless image compression | |
EP3617873A1 (en) | Compression scheme for floating point values | |
US8427348B2 (en) | Parallel processing of sequentially dependent digital data | |
KR20180014124A (en) | Information processing apparatus, and data management method | |
WO2015147912A1 (en) | Variable bit-length reiterative lossless compression system and method | |
WO2023043665A1 (en) | Feature compression for video coding for machines | |
US10841405B1 (en) | Data compression of table rows | |
US8819093B2 (en) | Systems and methods to reduce I/O and/or speed up out-of-core linear solvers | |
Qasaimeh et al. | A modified sliding window architecture for efficient bram resource utilization | |
US8934725B1 (en) | Image coding and decoding methods and apparatus | |
CN111819848B (en) | Method and apparatus for image compression and decompression and storage medium | |
US20030120693A1 (en) | Fixed point multiplying apparatus and method using encoded multiplicand |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
MKLA | Lapsed |