An efficient hierarchical technique is presented for obtaining dense stereo correspondence using a color image pyramid. We show that matching results of high quality are obtained when using the hierarchical chromatic Block Matching algorithm. Furthermore, we present some results for parallel implementations of the algorithm. Most stereo matching algorithms can not compute correct dense depth ma...

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...

An approach to Magnetic Resonance (MR) image reconstruction from undersampled data is proposed. Undersampling artifacts are removed using an iterative thresholding algorithm applied to nonlinearly transformed image block arrays. Each block array is transformed using kernel principal component analysis where the contribution of each image block to the transform depends in a nonlinear fashion on ...

Stereo is a well-known technique for obtaining depth information from digital images. Nevertheless, this technique still suffers from a lack in accuracy and/or long computation time needed to match stereo images. A new hierarchical algorithm using an image pyramid for obtaining dense depth maps from color stereo images is presented. We show that matching results of high quality are obtained whe...

| This paper presents a new VLSI architecture of the Motion Estimation in MPEG-2. Previously , a number of full search block matching algorithms (BMA) and architectures using systolic array have been proposed for motion estimation. However, the architectures have an ineeciently large number of external memory access. Recently, to reduce the number of accesses in one candidate block, a block mat...

Stereo vision is a popular method for an artificial vision-based environment perception system used in various applications such as intelligent transportation. With two cameras, the disparity map calculated to find distance and depth of objects front moving vehicle. The key element stereoscopic based on sum absolute differences (SAD) algorithm, which most repeated operation stereo matching subs...

In this work, binary block-to-block distribution matching is considered. m independent and uniformly distributed bits are mapped to n output bits resembling a target product distribution. A rate R is called achieved by a sequence of encoder-decoder pairs, if for m,n → ∞, (1) m/n → R, (2) the informational divergence per bit of the output distribution and the target distribution goes to zero, an...

The key to high performance in image sequence coding lies in an efficient reduction of the temporal redundancies. For this purpose, motion estimation and compensation techniques have been suc­ cessfully applied. This paper studies motion estimation algorithms in the context of first generation coding techniques commonly used in digital TV. In this framework, estimating the motion in the scene i...

In this article, we propose a novel pattern matching algorithm, called BAPM, that performs searching in the encoded genomic sequences. The algorithm works at the level of single bytes and it achieves sublinear performance on average. The preprocessing phase of the algorithm is linear with respect to the size of the searched pattern m. A simple O(m)-space data structure is used to store all fact...

We propose a new motion estimation algorithm and its block-matching criteria using low-resolution quantization. The proposed algorithm reduces both the huge computational cost of the full search algorithm and the performance degradation of the fast algorithms by matching the low-resolution images. Two search steps called the lowresolution search and the full-resolution search are employed. Simu...