منابع مشابه
LPF Computation Revisited
We present efficient algorithms for storing past segments of a text. They are computed using two previously computed read-only arrays (SUF and LCP) composing the Suffix Array of the text. They compute the maximal length of the previous factor (subword) occurring at each position of the text in a table called LPF. This notion is central both in many conservative text compression techniques and i...
متن کاملSimulating Term-Rewriting in LPF and in Display Logic
We show how the convenience and power of term-rewriting can sometimes be obtained in logical systems which do not explicitly have this capability. We consider the Logic of Partial Functions, and show how an undeened term can often be rewritten to a deened term. Although LPF and Display Logic are unrelated, we also show how Display Logic eeectively allows rewrite-style simpliications, although t...
متن کاملAutomatic Image Shadow Identification using LPF in Homomorphic Processing System
In this paper, we have used homomorphic system and HSV color space for shadow detection. Here, we have defined a LPF to detect the shadow over a dark object on the background. In this case, we omit the phase information in order not to emphasize the reflection component. Furthermore, the presented experimental results which are obtained for shadow identification, show the efficiency of the prop...
متن کاملOn A New Hybrid Speech Coder using Variables LPF
To encode the speech quality with reduce the redundancy within samples that resulted from domain processing method like PCM and LPC, Source coding or Waveform coding methods can be considered. However, it is well known that when conventional sampling methods are applied directly to speech signal, the required amount of data is comparable to or more than that of uniform sampling method. To overc...
متن کاملEfficient algorithms for three variants of the LPF table
The concept of a longest previous factor (LPF) is inherent to Ziv-Lempel factorization of strings in text compression, as well as in statistics of repetitions and symmetries. It is expressed in the form of a table --LPF[i] is the maximum length of a factor starting at position i, that also appears earlier in the given text. We show how to compute efficiently three new tables storing different v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista Alicantina de Estudios Ingleses
سال: 1992
ISSN: 2171-861X,0214-4808
DOI: 10.14198/raei.1992.5.05