Context-based Space Filling Curves
نویسندگان
چکیده
A context-based scanning technique for images is presented. An image is scanned along a context-based space filling curve that is computed so as to exploit inherent coherence in the image. The resulting one-dimensional representation of the image has improved autocorrelation compared with universal scans such as the PeanoHilbert space filling curve. An efficient algorithm for computing context-based space filling curves is presented. We also discuss the potential of improved autocorrelation of context-based space filling curves for image and video lossless compression.
منابع مشابه
Recurrence for Pandimensional Space-Filling Functions
A space-filling function is a bijection from the unit line segment to the unit square, cube, or hypercube. The function from the unit line segment is continuous. The inverse function, while welldefined, is not continuous. Space-filling curves, the finite approximations to space-filling functions, have found application in global optimization, database indexing, and dimension reduction among oth...
متن کاملOptimizing image steganography by combining the GA and ICA
In this study, a novel approach which uses combination of steganography and cryptography for hiding information into digital images as host media is proposed. In the process, secret data is first encrypted using the mono-alphabetic substitution cipher method and then the encrypted secret data is embedded inside an image using an algorithm which combines the random patterns based on Space Fillin...
متن کاملOptimizing Cache Behavior of Ray-Driven Volume Rendering Using Space-Filling Curves
of the Thesis Optimizing Cache Behavior of Ray-Driven Volume Rendering Using Space-Filling Curves by Oleg Mishchenko Master of Science in Computer Science Stony Brook University 2006 We study the cache behavior of space-filling curves in the context of volume rendering with raycasting. An efficient bit-oriented algorithm for 3D Hilbert curve traversal is also proposed. We find that data organiz...
متن کاملParallel domain decomposition and load balancing using space-filling curves
Partitioning techniques based on space-filling curves have received much recent attention due to their low running time and good load balance characteristics. The basic idea underlying these methods is to order the multidimensional data according to a space-filling curve and partition the resulting onedimensional order. However, space-filling curves are defined for points that lie on a uniform ...
متن کاملAlgebraic Formulation and Program Generation of Three-Dimensional Hilbert Space-Filling Curves
We use a tensor product based multi-linear algebra theory to formulate three-dimensional Hilbert space-filling curves. A 3-D Hilbert space-filling curve is specified as a permutation which rearranges threedimensional n n n data elements stored in the row major order as in C language or the column major order as in FORTRAN language to the order of traversing a 3-D Hilbert space-filling curve. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 19 شماره
صفحات -
تاریخ انتشار 2000