Many methods for computing optical ow (image motion vector) have been proposed while others continue to appear. Block-matching methods are widely used because of their simplicity and easy implementation. The motion vector is uniquely de ned, in block-matching methods, by the best t of a small reference subblock from a previous image frame in a larger, search region from the present image frame....

In this paper, it is considered the image compression scheme, in which a part of coded data extracted in the coding process is hidden into the other parts of coded data of own image, especially into the block address data of the best matching block within restricted blocks. The proposed scheme is able to be used in a fractal image coding in which the best matching domain block is searched, in a...

This paper introduces an improved block matching algorithm for the estimation of the parallax field between the left and the right image of a stereo pair. When the block size is small, e.g. for computer vision purposes, traditional block matching alone fails. Most of the small blocks do not expose enough structure to be reliably matched. Therefore, in this paper a parallax field estimated with ...

This paper applies ideas from fractal compression and optimization theory to attack the problem of e cient content-based image indexing and retrieval. Similarity of images is measured by block matching after optimal (geometric, photometric, etc.) transformation. Such block matching which, by de nition, consists of localized optimization, is further governed by a global dynamic programming techn...

Block matching motion estimation algorithms have been developed for very different applications in image processing. In recent years, the variable block-size (VBS) motion estimation has been widely employed to improve the performance of the block matching algorithm. In this paper, we compare the performance of several variable block-size motion estimation algorithms based on merge and split pro...

We are working to develop beating-heart atrial septal defect (ASD) closure techniques using real-time 3D ultrasound guidance. The major image processing challenges are the low-image quality and the processing of information at high-frame rate. This paper presents comparative results for ASD tracking in time sequences of 3D volumes of cardiac ultrasound. We introduce a block flow technique, whic...

Combining the features of block matching algorithm and block recursive algorithm a new motion estimation method is proposed for complex motion phenomenon. With the full searching procedure used in block matching algorithm and the adaptive searching procedure used in block recursive algorithm, the proposed combinative algorithm can be used to estimate more complex motion parameters such as trans...

This paper presents a novel approach to remotely authenticating a user by applying the Vaulted Fingerprint Verification (VFV) protocol. It proposes an adaptation of the Vaulted Verification (VV) concept with fingerprint minutia triangle representation. Over the past decade, triangle features have been used in multiple fingerprint algorithms. Triangles are constructed from three fingerprint minu...

In this paper, we proposed a temporal error concealment (EC) using the concealed boundary pixels and the adaptive block matching method. The proposed boundary matching method improves the spatial correlation of the macroblocks (MBs) by reusing the pixels of the concealed MB to estimate a motion vector of a error MB. The adaptive block matching method inspects horizontal edge and vertical edge f...

Hierarchical block matching is an eecient motion estimation technique which provides an adaptation of the block size and the search area to the properties of the image. In this work, we propose two novel special-purpose architectures to implement hierarchical block matching for real-time applications. The rst architecture is memory-eecient, but requires a large external memory bandwidth and a l...