抄録
Recently applications of Hubert curves are studied in the area of image processing, image compression, computer hologram, etc. We have proposed a fast Hubert scanning algorithm using lookup tables in N dimensional space. However, this scan is different from the one of previously proposed scanning algorithms. Making the lookup tables is a problem for the generation of several Hubert scans. In this note, we describe a method of making lookup tables from a given Hubert scan which is obtained by other scanning methods.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 249-251 |
| ページ数 | 3 |
| ジャーナル | IEICE Transactions on Information and Systems |
| 巻 | E79-D |
| 号 | 3 |
| 出版ステータス | Published - 1996 1 1 |
| 外部発表 | はい |
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence