Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 249-251 |
| Number of pages | 3 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E79-D |
| Issue number | 3 |
| Publication status | Published - 1996 Jan 1 |
| Externally published | Yes |
Keywords
- Hubert curves
- Image compression
- Lookup tables
- N dimensional space
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence