We introduce an algorithm for the automatic computation of global parameterizations on arbitrary simplicial 2manifolds, whose parameter lines are guided by a given frame field, for example, by principal curvature frames. The parameter lines are globally continuous and allow a remeshing of the surface into quadrilaterals. The algorithm converts a given frame field into a single vector field on a...

Manipulating digital video using desktop computers, especially in uncompressed form, and communicating it over networks can be time-consuming because of it large bandwidth requirements. While the size of a videoframe is large, the amount of new information in each video frame is open quite small. We present an algorithm that predicts those parts of the video image that change from frame to fram...

In this paper we present a simple adaptive block-matching algorithm for video compression. Our method is an adaptive approach to pixel difference classification (PDC) matching criterion. A constant threshold is used in original PDC algorithm in which optimum threshold varies from sequence to sequence. In contrast to the original PDC algorithm, adaptive PDC (APDC) employs a time variant threshol...

In this work we present a fractal image compression algorithm for inter/intra-frame video coding. We have shown previously how the Iterated TransformationTheory (ITT ) compression algorithm proposed by Jacquin can be modeled as the solution of a second kind twoscale functional equation. This approach allows us to introduce a chain of functional equations which we use to build a pyramid algorith...

In this paper, the authors treat the key frame extraction problem from a viewpoint of shot reconstruction. As a result, a novel criterion called shot reconstruction degree (SRD) is proposed for key frame selection based on the degree of retaining motion dynamics of a video shot. Compared with the widely used fidelity criterion, the key frame set produced by SRD can better capture the detailed d...