• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.64-70
• /
• 2011

In an H.264/AVC video encoder, the motion estimation at fractional pixel accuracy improves a coding efficiency and image quality. However, it requires additional computation overheads for fractional search and interpolation, and thus, reducing the computation complexity of fractional search becomes more important. This paper proposes a Pixel Re-composition Fractional Motion Estimation (PRFME) algorithm for an H.264/AVC video encoder. Fractional Motion Estimation performs interpolation for the overlapped pixels which increases the computational complexity. PRFME can reduce the computational complexity by eliminating the overlapped pixel interpolation. Compared with the fast full search, the proposed algorithm can reduce 18.1% of computational complexity, meanwhile, the maximum PSNR degradation is less than 0.067dB. Therefore, the proposed PRFME algorithm is quite suitable for mobile applications requiring low power and complexity.

• The Journal of the Korea Contents Association
• /
• v.18 no.12
• /
• pp.35-45
• /
• 2018

Motion Estimation(ME) has been developed to reduce the redundant data in digital video signal. ME is an important part of video encoding system, However, it requires huge computational complexity of the encoder part, and fast motion search methods have been proposed to reduce huge complexity. Multi- view video is obtained by capturing on a three-dimensional scene with many cameras at different positions and its complexity increases in proportion to the number of cameras. In this paper, we proposed an efficient motion method which chooses a search pattern adaptively by using the temporal-spatial correlation of the block and the characteristics of the block. Experiment results show that the computational complexity reduction of the proposed method over TZ search method and FS method can be up to 70~75% and 99% respectively while keeping similar image quality and bit rates.

• Journal of Broadcast Engineering
• /
• v.3 no.1
• /
• pp.85-92
• /
• 1998

The block matching algorithm is the most popular motion estimation method in image sequence coding. In this paper, we propose a VLSI architecture. for implementing a recently proposed fast bolck matching algorith, which uses spatial correlation of motion vectors and hierarchical searching scheme. The proposed architecture consists of a basic searching unit based on a systolic array and two shift register arrays. And it covers a search range of -32~ +31. By using the basic searching unit repeatedly, it reduces the number of gatyes for implementation. For basic searching unit implementation, a proper systolic array can be selected among various conventional ones by trading-off between speed and hardware cost. In this paper, a structure is selected as the basic searching unit so that the hardware cost can be minimized. The proposed overall architecture is fast enough for low bit-rate applications (frame size of $352{\times}288$, 3Oframes/sec) and can be implemented by less than 20,000 gates. Moreover, by simply modifying the basic searching unit, the architecture can be used for the higher bit-rate application of the frame size of $720{\times}480$ and 30 frames/sec.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.151-160
• /
• 2005

In this paper, we propose a new fast motion estimation algorithm based on successive elimination algorithm (SEA) which can dramatically reduce heavy complexity of the variable block size motion estimation in H.264 encoder. The proposed method applies the conventional SEA in the hierarchical manner to the seven block modes. That is, the proposed algorithm can remove the unnecessary computation of SAD by means of the process that the previous minimum SAD is compared to a current SAD for each mode which is obtained by accumulating sum norms or SAD of $4\times4$ blocks. As a result, we have tighter bound in the inequality between SAD and sum norm than in the ordinary SEA. If the basic size of the block is smaller than $4\times4$, the bound will become tighter but it also causes to increase computational complexity, specifically addition operations for sum norm. Compared with fast full search algorithm of JM of H.264, our algorithm saves 60 to $70\%$ of computation on average for several image sequences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8C
• /
• pp.712-719
• /
• 2007

In this paper, we propose a new, effective, fast motion estimation algorithms using $4{\times}4$ pixels Hadamard transform. The Hadamard transform has the advantage of simplicity because it uses only addition and subtraction. Motion estimation is composed of three stages. First, it should be decided whether to terminate the search early and use a previous motion vector with DC(Direct Current) coefficients. Then the adaptive matching scan order for motion estimation should be determined according to the image complexity using AC(Alternating Current) coefficients. Experimentally, we adapted this algorithms to MVFAST and PMVFAST algorithms, and the proposed algorithms turn out to be very efficient in terms of computational speed while remaining almost the same in terms of PSNR(Peak Signal-to-Noise Ratio) compared to MVFAST and PMVFAST algorithms.

• Journal of Korea Multimedia Society
• /
• v.9 no.5
• /
• pp.585-594
• /
• 2006

Due to the size limit, the voice coil motor (VCM) is adopted in most of the mobile phone camera to control auto-focus instead of step motor. The optical system using the VCM has the property that the focus values are varying even though the same current is induced. It means that an error of the lens position was taken placed due to the characteristics of the VCM. In this paper, a algorithm was proposed to compensate the lens position error using the step size and the search count of each stage. In the proposed algorithm -7 step middle searching stage is inserted the conventional searching algorithm for the fast auto-focus searching and the final searing step size was set to +1 for the precise focus control, respectively. In the experimental results, the focus values was found more fast in the proposed algorithm than the conventional. And more the image quality by the proposed algorithm was superior to that of the conventional.

• Journal of KIISE
• /
• v.43 no.11
• /
• pp.1298-1306
• /
• 2016

Backlight has a major factor in power consumption of TFT-LCDs which are most popular in portable devices. There have been a lot of attempts to achieve power savings by backlight dimming. At the same time, the researches have shown image compensation due to decreased brightness of a displayed image. However, existing image compensation methods such as histogram equalization have some limits in completely satisfying the human visual system (HVS)-awareness. This paper proposes an enhanced dimming technique to obtain both power saving and HVS-awareness by combining pixel compensation and histogram specification for TFT-LCDs. This method executes a search algorithm and an automation algorithm employing simplified calculations for fast image processing. Experimental results showed that the proposed method achieved significant improvement in visual satisfaction per power saving over existing backlight dimming.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.853-862
• /
• 2002

Face Detection can be defined as follows : Given a digitalized arbitrary or image sequence, the goal of face detection is to determine whether or not there is any human face in the image, and if present, return its location, direction, size, and so on. This technique is based on many applications such face recognition facial expression, head gesture and so on, and is one of important qualify factors. But face in an given image is considerably difficult because facial expression, pose, facial size, light conditions and so on change the overall appearance of faces, thereby making it difficult to detect them rapidly and exactly. Therefore, this paper proposes fast and exact face detection which overcomes some restrictions by using neural network. The proposed system can be face detection irrelevant to facial expression, background and pose rapidily. For this. face detection is performed by neural network and detection response time is shortened by reducing search region and decreasing calculation time of neural network. Reduced search region is accomplished by using skin color segment and frame difference. And neural network calculation time is decreased by reducing input vector sire of neural network. Principle Component Analysis (PCA) can reduce the dimension of data. Also, pose estimates in extracted facial image and eye region is located. This result enables to us more informations about face. The experiment measured success rate and process time using the Squared Mahalanobis distance. Both of still images and sequence images was experimented and in case of skin color segment, the result shows different success rate whether or not camera setting. Pose estimation experiments was carried out under same conditions and existence or nonexistence glasses shows different result in eye region detection. The experiment results show satisfactory detection rate and process time for real time system.

• Journal of Korea Multimedia Society
• /
• v.2 no.4
• /
• pp.409-418
• /
• 1999

The fractal image compression is based on the self-similarity that some area in an image exhibits a very similar shape with other areas. This compression technique has very long encoding time although it has high compression ratio and fast decompression. To cut-off the encoding time, most researches have restricted the search of domain blocks for a range block. These researches have been mainly focused on the coherence between a domain block and a range block, while they have not utilized the coherence among range blocks well. Therefore, we give an analysis on the coherence among range blocks in order to develope an efficient fractal Image compression algorithm. We analysis the range blocks according to not only measures for defining the range block coherence but also threshold of each measure. If these results are joined in a prior work of other fractal compression algorithms, it will give a great effectiveness in encoding time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.67-70
• /
• 2005

As the demand of sea leisure increases recently, interest is converged sea safety and offer of quick and systematic information according to weather environment that change rapidly. Use of Electronic Navigational Chart(ENC) in the sea in offer of geography information through Mobile terminal was gone to level that run in PDA environment in domestic by bulky good physician data information and complicated processing way of island in the sea expression in sea, and is loaded in obligatory sailing equipment of ship yet and is used. In this paper, we develop server system that take charge index for offer of quick information through Restrictive resource management and Caching Technique, image conversion and database construction and fast search to service various marine leisure informations of Weather Data and so on and image information of ENC in the sea to Mobile portable phone terminal efficiently.