KDS-transformation for Data Compression
نویسنده
چکیده
In this paper we present a new simple method to rewrite a given input string into another one which can be efficiently compressed (in some cases) by traditional compression methods. Key-Words:Data compression, Reversible transformation
منابع مشابه
Geometric Algorithms for Objects in Motion
Title of dissertation: GEOMETRIC ALGORITHMS FOR OBJECTS IN MOTION Sorelle Alaina Friedler, Doctor of Philosophy, 2010 Dissertation directed by: Professor David M. Mount Department of Computer Science In this thesis, the theoretical analysis of real-world motivated problems regarding objects in motion is considered. Specifically, four major results are presented addressing the issues of robustne...
متن کاملAlgorithms for Calculating Statistical Properties of Moving Points
Robust statistics and kinetic data structures are two frequently studied theoretical areas with practical motivations. The former topic is the study of statistical estimators that are robust to data outliers. The latter topic is the study of data structures for calculations on moving point sets. The combination of these two areas has not previously been studied. In studying this intersection, w...
متن کاملImage Compression Method Based on QR-Wavelet Transformation
In this paper, a procedure is reported that discuss how linear algebra can be used in image compression. The basic idea is that each image can be represented as a matrix. We apply linear algebra (QR factorization and wavelet transformation algorithms) on this matrix and get a reduced matrix out such that the image corresponding to this reduced matrix requires much less storage space than th...
متن کاملKinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d
This paper presents kinetic data structures (KDS’s) for maintaining the Semi-Yao graph, all the nearest neighbors, and all the (1 + )-nearest neighbors of a set of moving points in R. Our technique provides the first KDS for the SemiYao graph in R. It generalizes and improves on the previous work on maintaining the Semi-Yao graph in R. Our KDS for all nearest neighbors is deterministic. The bes...
متن کاملMaintaining Reeb Graphs of Triangulated 2-Manifolds
Let M be a triangulated, orientable 2-manifold of genus g without boundary, and let h be a height function over M that is linear within each triangle. We present a kinetic data structure (KDS) for maintaining the Reeb graph R of h as the heights of M’s vertices vary continuously with time. Assuming the heights of two vertices of M become equal only O(1) times, the KDS processes O((κ + g)n polyl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 67 شماره
صفحات -
تاریخ انتشار 2005