| Project/Area Number |
09450152
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
情報通信工学
|
|---|
| Research Institution | NAGOYA UNIVERSITY |
|---|
Principal Investigator |
TANIMOTO Masayuki Nagoya University, Graduate School of Engineering, Professor, 工学研究科, 教授 (30109293)
|
|---|
| Project Period (FY) |
1997 – 1998
|
| Project Status |
Completed (Fiscal Year 1998)
|
| Budget Amount *help |
¥13,400,000 (Direct Cost: ¥13,400,000)
Fiscal Year 1998: ¥6,500,000 (Direct Cost: ¥6,500,000)
Fiscal Year 1997: ¥6,900,000 (Direct Cost: ¥6,900,000)
|
|---|
| Keywords | image compression / fractal image coding / region adaptive image coding / range block / block matching / fast algorithm / merge criterion / error propagation / サブバンド符号化 / 時変サブバンドフィルタ / 可変形状 / 領域適応 / 形状情報 |
|---|
| Research Abstract |
Main results obtained in the research are listed below.
(a) We studied new region adaptive fractal image coding in which primitive blocks are merged into a variable size range block. We have obtained following results.
i. In the merging process of primitive blocks, the use of increase of overall error caused by block merging results in the improvement of SN ratio by 1dB.
ii. It is effective to the scheme of (i) that the threshold of increase is not constant but firstly small values and increased gradually.
iii. The scheme where a range block is re-merged with surrounding blocks in reverse order when a range block merged in an order is obtained reduces influence of merging order.
iv. The above schemes of (i) - (iii) achieve the improvement of compression performance by 2dB.
v. A new fractal image encoding scheme which can select decoding iteration times shows decoding are finished within a constant time.
(b) We studied block matching which is the core of the new region adaptive image compression and obtain following results.
i. A mathematical algorithm that reduces calculation times of MSE between two blocks is proposed. It calculates about 3 times faster than the conventional scheme.
ii. Moreover, modification of searching order and restriction of searching range result in the half of processing time.
(c) In image compression schemes which depend on the region already encoded, a new method is proposed that the data is completely decoded and that the inner buffer is modified until decoding process of the next region starts if decoding process is not completed because of a delay of encoded data or a break of iteration. This method greatly reduces error propagation.
|
