• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.949-955
• /
• 2005

In this Paper, we propose fast block matching algorithm by dividing complex areas based on complexity order of reference block and square sub-block to reduce an amount of computation of full starch(FS) algorithm for fast motion estimation, while keeping the same prediction quality compared with the full search algorithm. By using the fact that matching error is proportional to the gradient of reference block, we reduced unnecessary computations with square sub-block adaptive matching scan based image complexity instead of conventional sequential matching scan and row/column based matching scan. Our algorithm reduces about $30\%$ of computations for block matching error compared with the conventional partial distortion elimination(PDE) algorithm without any prediction quality, and our algorithm will be useful in real-time video coding applications using MPEG-4 AVC or MPEG-2.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.2
• /
• pp.13-19
• /
• 2001

The conventional fractal decoding was required a vast amount computational complexity, since every range blocks was implemented to IFS(iterated function system). In order to improve this, it has been suggested that each range block was classified to iterated and non-iterated regions. Non-iterated regions is called data dependency region, and if data dependency region extended, IFS regions are contractive. In this paper, a searched region of the domain is limited to the range regions that is similar with the domain blocks, and the domain region is more overlapped. As a result, data dependency region has maximum region, that is IFS regions can be minimum region. The minimizing method of domain region is defined to minimum domain(MD) which is minimum IFS region. Using the minimizing method of domain region, there is not influence PSNR(peak signal-to-noise ratio). And it can be performed a fast decoding by reducing the computational complexity for IFS in fractal image decoding.

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

In order to achieve high coding efficiency, H.264/AVC video coding standard adopts the techniques such as variable block size coding, motion estimation with quarter-pel precision, multiple reference frames, rate-distortion optimization, and etc. However, these coding methods have a defect to greatly increase the complexity for motion estimation. Particularly, from multiple reference frame motion estimation, the computational burden increases in proportion to the number of the searched reference frames. Therefore, we propose the method to reduce the complexity by controlling the number of the searched reference frames in motion estimation. Proposed algorithm uses the optimal reference frame information in both $P16{\times}16$ mode and the adjacent blocks, thus omits unnecessary searching process in the rest of inter modes. Experimental results show the proposed method can save an average of 57.31% of the coding time with negligible quality and bit-rate difference. This method also can be adopted with any of the existing motion estimation algorithm. Therefore, additional performance improvement can be obtained.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.3
• /
• pp.179-187
• /
• 2000

Fractal theory has strengths such as high compression rate and fast decoding time in application to image compression, but it suffers from long comparison time necessary for finding an optimally similar domain block in the encoding stage. This paper proposes a neural network based block classifier which enhances the encoding time significantly by classifying domain blocks into 4 patterns and searching only those blocks having the same pattern with the range block to be encoded. Size of a block is differently determined depending on the image complexity of the block. The proposed algorithm has been tested with three different images having various featrues. The experimental results have shown that the proposed algorithm enhances the compression time by 40% on average compared to the conventional fractal encoding algorithms, while maintaining allowable image qualify of PSNR 30 dB.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.12
• /
• pp.58-65
• /
• 2011

This paper presents an ASIP (Application-specific Instruction Processor) for motion estimation that employs specific IME instructions and its programmable and reconfigurable hardware architecture for various video codecs, such as H.264/AVC, MPEG4, etc. With the proposed specific instructions and variable point 2D SAD hardware accelerator, it can handle the real-time processing requirement of High Definition (HD) video. With the SAD unit and its parallel operations using pattern information, the proposed IME instructions support not only full search algorithms but also other fast search algorithms. The hardware size is 25.5K gates for each Processing Element Group (PEG) which has 128 SAD Processor Elements (PEs). The proposed ASIP has been verified by the Synopsys Processor Designer and implemented by the Design Compiler using the IBM 90nm process technology. The hardware size is 453K gates for the IME unit and the operating frequency is 188MHz for 1080p@30 frame in real time. The proposed ASIP can reduce the hardware size about 26% and the number of operation cycles about 18%.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.6 s.312
• /
• pp.57-64
• /
• 2006

Motion estimation plays an important role for the compression of video signals. The proposed method utilizes an adaptive threshold and characteristics of a distribution of SAD (sum of absolute difference). Generally, the more complex the SAD distribution is, the larger SAD value tends to be. This proposed algorithm tries to reduce the search points in a simple distribution but increase them in a complex distribution to avoid local minima. A macro block is divided into 9 areas. One of them chosen using spatio-temporal correlation is called the primary area and the others are called the secondary area that will be searched to avoid local minima. The proposed algorithm decides if just one area (the primary area or the secondary area) will be enough to be searched or both areas should be searched, using adaptive threshold. Compared with famous motion estimation algorithms, the simulation result shows that the searching points per macro block and MSE decreases about 16.4% and 32.83 respectively on the average.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.397-400
• /
• 2016

In this paper, we propose an efficient algorithm for computing architecture for high-performance Inter Prediction SAD HEVC encoder. HEVC Motion Estimation (ME) of the Inter Prediction is a process for searching for the currently high prediction block PU and the correlation in the interpolated reference picture in order to remove temporal redundancy. ME algorithm uses full search(FS) or fast search algorithm. Full search technique has the guaranteed optimal results but has many disadvantages which include high calculation and operational time due to the motion prediction with respect to all candidate blocks in a given search area. Therefore, this paper proposes a new algorithm which reduces the computational complexity by reusing the SAD operation in full search to reduce the amount of calculation and computational time of the Inter Prediction. The proposed algorithm is applied to an HEVC standard software HM16.12. There was an improved operational time of 61% compared to the traditional full search algorithm, BDBitrate was decreased by 11.81% and BDPSNR increased by about 0.5%.

• Journal of Digital Convergence
• /
• v.17 no.6
• /
• pp.19-25
• /
• 2019

Recently a number of car sharing studies have been conducted that share vehicles from a consumer perspective. Meanwhile, Japan's MLIT had empirically implemented social experiment and policy for the installation of sharing car in order to make better use of the business forms and rapidly increasing car sharing associated with express bus as a new type of transaction from a sharing economy perspective. Therefore, this study examined the case of connecting with the express bus in Japan and analyzed and discussed the contents at the practical level. In addition, data collected for 229 car sharing users were verified empirically. The multiple liner regression analysis showed that three types of perceived values effect on the usage intention in the order of economic value, time value and psychology value. These findings suggest that car sharing users' perceived values are very important for increasing the degree of satisfaction with usage intention.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.636-644
• /
• 2015

This research aims to suggest methods to improve object tracking performance by combining CAM shift algorithm with 8-way search window, and reduce arithmetic operation by reducing the number of frame used for tracking. CAM shift has its adverse effect in tracking methods using signature color or having difficulty in tracking rapidly moving object. To resolve this, moving search window of CAM shift makes it possible to more accurately track high-speed moving object after finding object by conducting 8-way search by using information at a final successful timing point from a timing point missing tracking object. Moreover, hardware development led to increased unnecessary arithmetic operation by increasing the number of frame produced per second, which indicates efficiency can be enhanced by reducing the number of frame used in tracking to reduce unnecessary arithmetic operation.

• Journal of Korea Multimedia Society
• /
• v.17 no.3
• /
• pp.333-341
• /
• 2014

Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. Multi-view video coding requires high computational complexity. To reduce computational complexity and maintain the image quality, an effective early termination motion estimation method is proposed in this paper. The proposed method exploiting the characteristic of motion vector distribution uses a hierarchical search strategy. This strategy method consists of multi-grid square search pattern, modified diamond search pattern, small diamond search pattern and raster search pattern. Experiment results show that the speedup improvement of the proposed method over TZ search method and FS(Full Search) method JMVC (Joint Multiview Video Coding) can be up to 1.7~4.5 times and 90 times faster respectively while maintaining similar video quality and bit rates.