Range image compression using the fan algorithm

Author

Obaid, A. ; Rivest, J.-F.

Author_Institution

Dept. of Electr. Eng., Ottawa Univ., Ont., Canada

fYear

1994

fDate

25-28 Sep 1994

Firstpage

517

Abstract

Range images, which are a representation of the surface of a 3-D object, are gaining popularity in many applications including CAD/CAM, multimedia and virtual reality. There is, thus, a need for compression of these 3-D images. Current standards, such as JPEG, are not appropriate for such images, due to their very nature. This has led us to develop a new compression method for range images. It approximates raster lines by many straight line segments within a user-specified maximum tolerance level. The extremities of the straight-line segments are non-redundant points (NRPs). Huffman coding, with a fixed Huffman tree, is used to encode the horizontal distance between the NRPs and their altitudes. The algorithm performance is illustrated on range images acquired at the Institute for Information Technology, National Research Council of Canada

Keywords

Huffman codes; data compression; edge detection; image coding; image segmentation; 3D object; CAD/CAM; Huffman coding; algorithm performance; fan algorithm; fixed Huffman tree; multimedia; nonredundant points; range image compression; raster lines; straight line segments; user-specified maximum tolerance level; virtual reality; Data compression; Huffman codes; Image coding; Image line pattern analysis; Image segmentation;

fLanguage

English

Publisher

ieee

Conference_Titel

Electrical and Computer Engineering, 1994. Conference Proceedings. 1994 Canadian Conference on

Conference_Location

Halifax, NS

Print_ISBN

0-7803-2416-1

Type

conf

DOI

10.1109/CCECE.1994.405802

Filename

405802