A method of making lookup tables for hubert scans

Seiichiro Kamata, Michiharu Niimi, Eiji Kawaguchi

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)249-251
Number of pages3
JournalIEICE Transactions on Information and Systems
VolumeE79-D
Issue number3
Publication statusPublished - 1996
Externally publishedYes

    Fingerprint

Keywords

  • Hubert curves
  • Image compression
  • Lookup tables
  • N dimensional space

ASJC Scopus subject areas

  • Information Systems
  • Computer Graphics and Computer-Aided Design
  • Software

Cite this