• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.10
• /
• pp.1845-1852
• /
• 2008

The key elements of inter prediction are motion estimation(ME) and motion compensation(MC). Motion estimation is to find the optimum motion vectors, not only by using a distance criteria like the SAD, but also by taking into account the resulting number of 비트s in the 비트 stream. Motion compensation is compensate for movement of blocks of current frame. Inter-prediction Encoding is always the main bottleneck in high-quality streaming applications. Therefore, in real-time streaming applications, dedicated hardware for executing Inter-prediction is required. In this paper, we studied a motion estimator(ME) for H.264/AVC. The designed motion estimator is based on 2-D systolic array and it connects processing elements for fast SAD(Sum of Absolute Difference) calculation in parallel. By providing different path for the upper and lower lesion of each reference data and adjusting the input sequence, consecutive calculation for motion estimation is executed without pipeline stall. With data reuse technique, it reduces memory access, and there is no extra delay for finding optimal partitions and motion vectors. The motion estimator supports variable-block size and takes 328 cycles for macro-block calculation. The proposed architecture is local memory-free different from paper [6] using local memory. This motion estimation encoder can be applicable to real-time video processing.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.100-110
• /
• 2007

When compressed video data is transmitted over error-prone network such as wireless channel, data is likely to be lost, so the quality of reconstructed picture is severely decreased. It is specially so in case that important information such as motion vector or macroblock mode is lost. H.264/AVC standard includes DP as error resilient technique for protecting important information from error in which data is labeled according to its relative importance. But DP technique requires a network that supports different reliabilities of transmitted data. In general, the benefits of UEP is sought by sending multiple times of same packets corresponding to important information. In this paper, we propose MDC technique based on data partitioning technique. The proposed method encodes motion vector of H.264/AVC standard into multiple parts using MDC and transmits each part as independent packet. Even if partial packet is lost, the proposed scheme can decode the compressed bitstream by using estimated motion vector with partial packets correctly transmitted, so that achieving improved performance of error concealment with minimal effect of channel error. Also in decoding process, the proposed multiple description matching increases the accuracy of estimated lost motion vector and quality of reconstructed video.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.55-65
• /
• 2006

Most of fast block motion estimation algorithms reported so far in literatures aim to reduce the computation in terms of the number of search points, thus do not fit well with multimedia processors due to their irregular data flow. For multimedia processors, proper reuse of data is more important than reducing number of absolute difference operations because the execution cycle performance strongly depends on the number of off-chip memory access. Therefore, in this paper, we propose a Hexagon-shape line search (HEXSLS) algorithm using line search pattern which can increase data reuse from on-chip local buffer, and check sub-sampling points in line search pattern to reduce unnecessary SAD operation. Our experimental results show that the prediction error (MAE) performance of the proposed HEXSLS is similar to that of the full search block matching algorithm (FSBMA), while compared with the hexagon-based search (HEXBS), the HEXSLS outperforms. Also the proposed HEXSLS requires much lesser off-chip memory access than the conventional fast motion estimation algorithm such as the hexagon-based search (HEXBS) and the predictive line search (PLS). As a result, the proposed HEXSLS algorithm requires smaller number of execution cycles on media processor.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.258-268
• /
• 2001

The compression method is necessarily used to send the high quality moving picture that contains a number of data in image processing. In the field of moving picture compression method, the motion estimation algorithm is used to reduce the temporal redundancy. Block matching algorithm to be usually used is distinguished partial search algorithm with full search algorithm. Full search algorithm be used in this paper is the method to compare the reference block with entire block in the search window. It is very efficient and has simple data flow and control circuit. But the bigger the search window, the larger hardware size, because large computational operation is needed. In this paper, we design the full search block matching motion estimator. Using the DCT DC values, we decide luminance. And we apply 3 bit compare-selector using bit plane to I(Intra coded) picture, not using 8 bit luminance signals. Also it is suggested that use the same selective bit for the P(Predicted coded) and B(Bidirectional coded) picture. We compare based full search method with PSNR(Peak Signal to Noise Ratio) for C language modeling. Its condition is the reference block 8$\times$8, the search window 24$\times$24 and 352$\times$288 gray scale standard video images. The result has small difference that we cannot see. And we design the suggested motion estimator that hardware size is proved to reduce 38.3％ for structure I and 30.7％ for structure II. The memory is proved to reduce 31.3％ for structure I and II.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3165-3177
• /
• 1999

With the recent outstanding advance in computer software and hardware, a number of researches to enhance the manufacturing speed and the process accuracy has been undertaken in many fields of textile industry. Frequently issued problems of automatic recognition of textile wrinkles in a grey scale image are as follows. First, changes in grey level intensity of wrinkles are so minute. Second, as both colors and patterns in a grey scale image appear in grey level intensity, it is difficult to sort out the wrinkle information only. Third, it is also difficult to distinguish grey level intensity changed by wrinkles from those by uneven illumination. This paper suggests a method of automatic recognition of textile wrinkles that can solve above problems concerned with wrinkles, which can be raised in a manufacturing process as one of errors. In this paper, we first make the outline of wrinkles distinctly, apply the block matching algorithm used in motion estimation, and then estimate block locations of target images corresponding to blocks of standard images with the assumption that wrinkles are kind of textile distortions caused by directional forces. We plot a "wrinkle map" considering distances between wrinkles as depths of wrinkles. But because mismatch can occur by different illumination intensity and changes in tensions and directions of the force, there are also undesirable patterns in the map. Post processing is needed to filter them out and get wrinkles information only. We use average grey level intensity of wrinkle map to recognize wrinkles. When it comes to textile with colors and patterns, previous researches on wrinkles in grey scale image hasn't been successful. But we make it possible by considering wrinkles as distortion.istortion.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.6
• /
• pp.78-86
• /
• 2013

In this paper, we propose design of a high-performance vehicle imaging information system for an efficient vehicle imaging stabilization. The proposed system was designed the algorithm by divided as motion estimation and motion compensation. The motion estimation were configured as local motion vector estimation and irregular local motion vector detection, global motion vector estimation. The motion compensation was corrected for the four directions for compensate to the shake of vehicle video image using estimate GMV. The designed algorithm were designed the motion compensation technology chip by applied to IP for vehicle imaging stabilization. In this paper, the experimental results of the proposed vehicle imaging information system were proved to the effectiveness by compared with other methods, because imaging stabilization of moving vehicle was not used of memory by processing real-time. Also, it could be obtained to reduction effect of calculation time by arithmetic operation through to block matching.

• Journal of Digital Contents Society
• /
• v.9 no.2
• /
• pp.305-315
• /
• 2008

Pre-proposed AHHS(Adaptive Hierarchical Hexagon Search) is a kind of the fast hierarchical block matching algorithm based on the AHS(Adaptive Hexagon Search). It is characterized as keeping the merits of the AHS capable of fast estimating motion vectors and also adaptively reducing the local minima often occurred in the video sequences with higher spatio-temporal motion activity. The objective of this paper is to propose the method effectively extending the horizontal biased pattern and the vertical biased pattern of the AHHS to improve its predictive image quality. In the paper, based on computer simulation results for multiple video sequences with different motion characteristics, the performance of the proposed method was analysed and assessed in terms of the predictive image quality and the computational time. The simulation results indicated that the proposed method was both suitable for (quasi-) stationary and large motion searches. While the proposed method increased the computational load on the process extending the hexagon search patterns, it could improve the predictive image quality so as to cancel out the increase of the computational load.

• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.181-191
• /
• 2002

Video based surveillance systems based on an active camera require a fast algorithm for real time detection and tracking of local motion in the presence of global motion. This paper presents a new fast and efficient motion detection and tracking algorithm using the displaced frame difference (DFD). In the Proposed algorithm, first, a Previous frame is adaptively selected according to the magnitude of object motion, and the global motion is estimated by using only a few confident matching blocks for a fast and accurate result. Then, a DFD is obtained between the current frame and the selected previous frame displaced by the global motion. Finally, a moving object is extracted from the noisy DFD by utilizing the correlation between the DFD and current frame. We implement this algorithm into an active camera system including a pan-tilt unit and a standard PC equipped with an AMD 800MHz processor. The system can perform the exhaustive search for a search range of 120, and achieve the processing speed of about 50 frames/sec for video sequences of 320$\times$240. Thereby, it provides satisfactory tracking results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10C
• /
• pp.787-797
• /
• 2008

In this paper, we propose a fast disparity estimation method considering temporal and spatial redundancy based on a dynamic programming for stereo matching. For the first step, the dynamic programming is performed to estimate disparity vectors with correlation between neighboring pixels in an image. Next, we efficiently compensate regions, which disparity vectors are not allocated, with neighboring disparity vectors assuming that disparity vectors in same object are quite similar. Moreover, in case of video sequence, we can decrease a complexity with temporal redundancy between neighboring frames. For performance comparison, we generate an intermediate-view image using the estimated disparity vector. Test results show that the proposed algorithm gives $0.8{\sim}2.4dB$-increased PSNR(peak signal to noise ratio) compared to a conventional block matching algorithm, and the proposed algorithm also gives approximately 0.1dB-increased PSNR and $48{\sim}68%$-lower complexity compared to the disparity estimation method based on general dynamic programming.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.3
• /
• pp.2192-2200
• /
• 2015

In this paper, we propose an efficient vehicle image compensation algorithm based on Histogram Equalization. The proposed a vehicle image compensation algorithm was elimination to the vehicle image shake using motion compensation and motion estimation. And, algorithm was calculated the histogram of pixel values from each sub-image by dividing the image as the constant size areas in order to image enhancement. Also, it had enhancement to the image by adjusting the gradient. The proposed algorithm was evaluate the difference between of performance and time, image by applied to the IP, and were confirmed the image enhancement with removing of vehicle camera image shake. In this paper, the proposed vehicle image enhancement algorithm was demonstrated effectiveness when compared to existing vehicle image stabilization, because the elimination of shake for the vehicle images used real-time processing without using a memory. And it was obtained the reduction effect of the computation time by the calculated through block matching, and obtained the better restoration result for naturalness of the image with the lowest noise.