Skip to Main Content
A picture coding strategy titled DF-expression (Depth-First picture expression) is now studied from another point of view. The basic idea of DF-expression is briefly reviewed at first. Its capability in data compression is demonstrated using 1024 Ã 1024 binary pictures. Then the new aspects of DF-expression are studied in reference to picture processing algorithm on the coded form. They include circular shiftings, spectrum of primitives, logical operations, etc. Application of DF-expression to gray images (or multivalued pictures) is the next topics of the paper. DF-expression is applicable to bit-plane coding of any binary image data. Our conclusion with this point is that the gray code is the best binary code system for DF-expression in information preserving sense. Information-lossy type data reduction is another topics in this paper. The authors propose a new data reduction technique in terms of uniformalization of excessively complicated regions in bit-planes. Experimental study follows using a 256 Ã 256 sized fourbit test picture. Finally, conclusions and other possibility of the applications are remarked.