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.
|ジャーナル||IEICE Transactions on Information and Systems|
|出版ステータス||Published - 1996 1月 1|
ASJC Scopus subject areas
- コンピュータ ビジョンおよびパターン認識