Data coding method and device, and data coding program

• US 20050100232A1
• Filed: 12/26/2001
• Published: 05/12/2005
• Est. Priority Date: 12/28/2000
• Status: Active Grant

• Current Assignee: Evolvable System Research Institute Incorporated, National Institute of Advanced Industrial Science and Technology (Government of Japan)
• Original Assignee: Evolvable System Research Institute Incorporated
• Inventors: Higuchi, Tetsuya, Sakanashi, Hidenori
• Granted Patent: US 7,254,273 B2
• Time in Patent Office: Days
• US Class Current: 382/238
• CPC Class Codes: H03M 7/30 Compression speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
• CPC Class Codes: H04N 1/4105 for halftone screened pictures
• CPC Class Codes: H04N 1/417 using predictive or differential encoding
• CPC Class Codes: H04N 1/52 Circuits or arrangements for halftone screening

Abstract

A data compression method using a template, in which a template optimizing means using an artificial intelligent technique (such as a genetic algorithm) applied to segments defined by diving input data into uniform segment units contributes to enhancing the prediction accuracy, data is compressed using the results of optimization, and a database is updated to improve the compression efficiency and speed of the subsequent processings. By updating a database by using an optimized template, a template for improving the prediction accuracy is obtained quickly without applying any artificial intelligent technique.

Claims

1. A data coding apparatus containing a template generating means that is composed by;

a database means that stores template information together with the attribute parameters of the data, a looking up means to look up template information in said database means using said attribute parameters as looking up keys, a deciding means that decides whether optimization should be carried out or not by estimating capability of the template that is obtained as the output of said looking up means, a template optimizing means that generates the optimum template by using an optimization method that uses one or both of the code compression rate and the entropy as an estimation function and a registering means that registers the template information that is outputted from said template optimizing means to said database means.

2. A data coding apparatus claimed in claim 1 wherein the optimization method used for said template optimization is either one of the enumeration method, the genetic algorithm, the evolution strategy, the hill-climbing method, the annealing method, the taboo seeking method and the greedy algorithm.

3. A data coding apparatus claimed in claim 1 wherein said looking up means contains a temporary template generating means that generates a temporary template by analyzing the inputted data and a re-looking up means that searches said database means based on said template information.

4. A data coding apparatus claimed in claim 1 wherein said data coding apparatus further contains a dividing means that divides the inputted data into a plural number of blocks according to features of the inputted data, a compressing means that compresses the inputted data based on the template that is outputted from said template generating means and a composing means that composes the output data of said compressing means, said template information and said block information.

5. A data coding method that codes data by using templates that are generated by a template generating method that contains a looking-up step to look up template information in the database by using attribute parameters as looking-up keys, a deciding step to decide whether template optimization should be carried out or not by estimating capability of the template obtained as the result of said looking-up step, a generating step to generate the optimum template by an optimization method using either one of or both of the code compression rate and the entropy when decision is made that optimization should be done, and a registering step to register the template information of the optimized template into said database.

6. A data coding method claimed in claim 5 wherein said optimization method is either one of the enumeration method, the genetic algorithm, the evolution strategy, the hill-climbing method, the annealing method, the taboo seeking method and the greedy algorithm.

7. A data coding program whereby a computer works as a template generating means that is composed by;

a database means that stores template information together with the attribute parameters of the data, a looking up means to look up template information in said database means using said attribute parameters as looking up keys, a deciding means that decides whether optimization should be carried out or not by estimating capability of the template that is obtained as the output of said looking up means, a template optimizing means that generates the optimum template by using an optimization method that uses one or both of the code compression rate and the entropy as an estimation function and a registering means that registers the template information that is outputted from said template optimizing means to said database means.