Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompression. To utilize bandwidth more effectively in the Internet environment, it is highly desirable that data be kept and sent over the Internet in the compressed form. In order to support information retrieval for compressed ...

Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompression. Various algorithms have been proposed depending on underlying compression methods in the last decade. Although some algorithms for multipattern searching on compressed text were also presented very recently, all of them are...

Permutations are fundamental objects in combinatorics. An n-permutation is a sequence containing every one of the integers 1,2, . . . ,n exactly once. Within combinatorics, patterns in permutations are an important topic. A permutation T contains a permutation P as a pattern if there exists a subsequence of T that has the same relative order of elements as P. For example 53142 contains 231 as s...

Introduction: The problem of compressed pattern matching deals with ways to find a pattern within a compressed file, without decompressing it first. The techniques for solving this problem fall into two major categories – creating a unique compression scheme that enables efficient pattern matching; or using some known compression scheme and develop algorithms to search the files it produces. In...

In this paper, we present a compressed pattern matching method for searching user queried words in the CCITT Group 4 compressed document images, without decompressing. The feature pixels composed of black changing elements and white changing elements are extracted directly from the CCITT Group 4 compressed document images. The connected components are labeled based on a line-by-line strategy ac...

An improved algorithm for fast motion estimation based on the block matching algorithm (BMA) is presented for use in a blockbased video coding system. To achieve enhanced motion estimation performance, we propose an adaptive search pattern length for each iteration for the current macro block (MB). In addition, search points that must be checked are determined by means of directional informatio...

Given two strings: pattern P and text T of lengths jPj =M and jT j = N . A string matching problem is to nd all occurrences of pattern P in text T . A fully compressed string matching problem is the string matching problem with input strings P and T given in compressed forms p and t respectively, where jpj = m and jtj = n. We present rst, almost optimal, string matching algorithms for LZW-compr...

In this paper we develop a correlation method for the template matching problem in pattern recognition which includes translations, rotations, and dilations in a natural way. The correlation method is implemented using Fourier analysis on the “discrete motion group” and fast Fourier transform methods. A brief introduction to Fourier methods on the discrete motion group is given and the efficien...

Mechanisms for compressing text have been studied for many years, and a wide range of effective methods has been developed. But compression of text makes it unwieldy in other ways – it must be decompressed before being viewed, and it is harder to directly search. One way of addressing these concerns is to build an index for the source document, and search via a query interface [Witten et al., 1...

A practical adaptive compression algorithm based on LZSS is presented, which is especially constructed to solve the compressed pattern matching problem, i.e., pattern matching directly in a compressed text without decompressing.