| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| JaLC DOI |
|
| 関連DOI |
|
|
|
|
|
|
|
| 関連URI |
|
|
|
|
|
|
|
| 関連情報 |
|
|
|
|
|
|
|
| 概要 |
A new method of representing a binary-valued picture titled "DF-expression" or "DF-coding" is developed, where the picture is decomposed into a set of square regions of various sizes with uniform gray... level (black or white). A simple context-free grammar having three terminal symbols "0", "1", and "(" is introduced to specify the gray levels and sizes of such regions. With such grammar, every picture is represented as a terminal string of the grammar. The DF-expression of a picture is defined as the reduced terminal string. It preserves every information for reproducing the original picture in spite of high data compressionability. The coding algorithm of raw pictorial data into DF-expression is very simple. Some type of picture processings, such as shifting, expansions and reductions of original pictures, can be performable on DF-expression itself. Moreover, logical operations are available. After the experimental studies on many test pictures, it was made clear that DF-expression is really useful not only for storing or transmitting pictorial data but also for digital picture processing.続きを見る
|
Mendeley出力
