This paper deals with an adaptive sub-sampling process that is an example of a more general class of data processing. Our approach consists of spanning a Z-tree over the image. The Z-tree is the bin-tree built from the 1D pixel sequence obtained through a peculiar scan called the Peano traversal. A conditional rotation operator, defined to manipulate the Z-tree, supports the Peano scan adaption. Iterating rotations before tree inversion allows us to rebuild various mosaic versions of a same initial image. In the application outlined here, a fair stress is put on the way spatial redundancies are highlighted by this image shuffling process. This helps in constructing various versions from the initial data where both edges are simultaneously detected.
Concurrent edge/region detection from a Peano scan
01.01.2001
610636 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Concurrent Edge/Region Detection from a Peano Scan
British Library Conference Proceedings | 2001
|Classes of semidefinite Peano-kernels.
NTRS | 1969
|Vector quantization of images based on Peano scanning [3545-61]
British Library Conference Proceedings | 1998
|A Modified Fcm with Optimal Peano Scans for Image Segmentation
British Library Conference Proceedings | 2005
|