Low power VLSI video compression processors are in high demand for the emerging wireless video applications [1]. Video compression processors include VLSI implementation of a motion estimation algorithm. Many motion estimation algorithms are found in the literature. Some of them are fast but can not guarantee an optimal solution; they can be stuck in a local optima. Such algorithms are fast, co...

The minimum-cost flow problem is a classic problem in combinatorial optimization with various applications. Several pseudo-polynomial, polynomial, and strongly polynomial algorithms have been developed in the past decades, and it seems that both the problem and the algorithms are well understood. However, some of the algorithms’ running times observed in empirical studies contrast the running t...

A gênerai exchange algorithm is gwen for the mimmizatwn ofa convex function with equahty and inequahty constraintsAt is a generahzation of the Cheney-Goldstein algorithm, but following an idea gwen by Topfer, afimte séquence ofsub-problems the dimension ofwhich is decreasing, is considered at each itération Gwen a positive number 8, under very gênerai conditions, it is proved that the method, a...

In this paper, we propose a hierarchical three step search algorithm using pyramid hierarchy. Hierarchical Minkowski inequality is adopted to reduce the cost of the sum of absolute difference (SAD) computations. A top-town procedure is developed to search motion vectors hierarchically and the search pattern used in the well-known Three Step Search (TSS) is adopted. We also propose a hybrid moti...

We present a new image recovery algorithm to remove, in addition to blocking, ringing artifacts from compressed images and video. This new algorithm is based on the theory of projections onto convex sets (POCS). A new family of directional smoothness constraint sets is defined based on line processes modeling of the image edge structure. The definition of these smoothness sets also takes into a...

The key idea discussed in this paper is to reconstruct an image from overlapped projections so that the data acquisition process can be shortened while the image quality remains essentially uncompromised. To perform image reconstruction from overlapped projections, the conventional reconstruction approach (e.g., filtered backprojection (FBP) algorithms) cannot be directly used because of two pr...

We present simple and efficient algorithms for calculating qgram frequencies on strings represented in compressed form, namely, as a straight line program (SLP). Given an SLP of size n that represents string T , we present an O(qn) time and space algorithm that computes the occurrence frequencies of all q-grams in T . Computational experiments show that our algorithm and its variation are pract...

We have developed an algorithm for the rigid-body registration of a CT volume to a set of C-arm images. The algorithm uses a gradient-based iterative minimization of a least-squares measure of dissimilarity between the C-arm images and projections of the CT volume. To compute projections, we use a novel method for fast integration of the volume along rays. To improve robustness and speed, we ta...

This paper presents a new algorithm for correcting incorrect projections of a polyhedral scene. Such projections arise in applications where an image of a polyhedral world is taken and its edges and vertices are extracted. Along the way, the true positions of the vertices in the 2D projection are perturbed due to digitization errors and the preprocessing. As most available algorithms for recons...

The growth in the amount of information available on the Internet and thousands of user queries per second brings huge challenges to the index update and query processing of search engines. Index compression is partially responsible for the current performance achievements of existing search engines. The selection of the index compression algorithms must weigh three factors, i.e., compression r...