• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.2
• /
• pp.163-172
• /
• 2005

When tracking a human face in the moving pictures with complex background under irregular lighting conditions, the detected face can be larger including background or smaller including only a part of the face. Even background can be detected as a face area. To solve these problems, this paper proposes a new face tracking method using a block difference image and a Kalman estimator. The block difference image allows us to detect even a small motion of a human and the face area is selected using the skin color inside the detected motion area. If the pixels with skin color inside the detected motion area, the boundary of the area is represented by a code sequence using the 8-neighbor window and the head area is detected analysing this code. The pixels in the head area is segmented by colors and the region most similar with the skin color is considered as a face area. The detected face area is represented by a rectangle including the area and its four vertices are used as the states of the Kalman estimator to trace the motion of the face area. It is proved by the experiments that the proposed method increases the accuracy of face detection and reduces the fare detection time significantly.

• Journal of Broadcast Engineering
• /
• v.18 no.6
• /
• pp.816-822
• /
• 2013

The latest video coding standard HEVC was developed by the joint work of JCT-VC(Joint Collaborative Team on Video Coding) from ITU-T VCEG and ISO/IEC MPEG. The HEVC standard reduces the BD-Bitrate of about 50% compared with the H.264/AVC standard. However, using the various methods for obtaining the coding gains has increased complexity problems. The proposed method reduces the complexity of HEVC by using both CPU parallel processing and GPU-accelerated processing. The experiment result for UHD($3840{\times}2144$) video sequences achieves 15fps encoding/decoding performance by applying the proposed method. Sooner or later, we expect that the H/W speedup of data transfer rates between CPU and GPU will result in reducing the encoding/decoding times much more.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.925-931
• /
• 2008

In video coding standard H.264/AVC, variable block size mode algorithm improves compression efficiency but has need of a large amount of computation for various block modes and mode decision. Meanwhile, decided inter block modes depend on the complexity of a block image, and then the more complex a macroblock is, the smaller its block size is. This paper proposes fast inter block mode decision algorithm. It limits valid block modes to the block modes with a great chance for decision using the image complexity and carries out motion estimation rate-distortion optimization with only the valid block modes. In addition to that, it applies fast motion estimation PDE to the valid block modes with only the $16{\times}16$ block mode. The reference software JM 9.5 was executed to estimate the proposed algorithm's performance. The simulation results showed that the proposed algorithm could save about 24.12% of the averaged motion estimation time while keeping the image quality and the bit rate to be -0.02dB and -0.12% on the average, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1713-1720
• /
• 1999

This paper presents a new key frame extraction technique, for scene change detection, using the proposed AHIM (Accumulative Histogram Intersection Measure) from the DC image constructed by DCT DC coefficients in the compressed video sequence that is video compression standard such as MPEG. For fast content-based browsing and video retrieval in a video database, we also provide a novel coarse-to-fine video indexing scheme. In the extracted key frame, we perform the region segmentation as a preprocessing. First, the segmented image is projected with the horizontal direction, then we transform the result into a histogram, which is saved as a database index. In the second step, we calculate the moments and change them into a distance value. From the simulation results, the proposed method clearly shows the validity and superiority in respect of computation time and memory space, and that in conjunction with other techniques for indexing, such as color, can provide a powerful framework for image indexing and retrieval.

• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.515-527
• /
• 2005

A next-generation codec should be developed to be a scalable video codec(SVC) that not only maximizes the coding efficiency but also adaptively copes with the various communication devices and the variation of network environments. To meet these requirements, Joint Video Team (JVT) of ISO/IEC and ITU-T is standardizing H.264/AVC based SVC. In this paper, we introduce research directions and status on SVC standardization and also analyze techniques and algorithms adopted in the current SVC.

• Journal of KIISE:Software and Applications
• /
• v.28 no.4
• /
• pp.369-379
• /
• 2001

본 논문은 부영역 분할과 코드워드 인텍스의 캐시 개념을 이용하여 벡터 양자화를 위한 고속코드북 생성 및 부호화 방법을 제안한다. 제안한 방법은 인접한 입력 벡터는 대개 코드북내 특정 코드워드에 의해 나타내어지는 국부성에 바탕을 두고 있다. 초기에 모든 학습 벡터가 거리에 기반한 근접성을 이용하여 정해진 수의 부영역으로 분할된다. 각 부영역에 하나의 코드워드 인덱스 캐시가 할당되는데 이 캐시는 학습 초기에는 전체 코드북 크기에 대응하는 코드워드 인덱스를 갖는다. 학습이 진행되면서 입력 벡터가 갖는 국부성 때문에 각 부영역내 캐시중 사용되지 않는 코드워드 인덱스가 점차 발생하게 되므로 이들은 LRU(Least Recently Used) 삭제 알고리즘에 의해 제거된다. 학습이 진행됨에 따라 부영역 캐시에는 주어진 입력 벡터에 의해 참조되는 코드워드 인덱스만이 남게 되므로 한 학습 주기 동한 필요한 학습 시간이 점차 짧아지게 되어 전체적으로 코드북 생성 시간을 크게 줄일 수 있게 된다. 제안한 방법은 매 학습주기마다, 코드워드 인덱스 삭제 후보 중 주어진 부영역 중심으로부터 거리에 의해 멀리 떨어진 것부터 반만을 제거함에 따라. 복원된 영상의 화질 열화가 거의 없다. 시뮬레이션 결과 제안한 방법은 기존의 LBG 방법에 비해 화질 열화는 거의 없지만 코드북 생성 (또는 부호화) 속도를 2.6-5.4배 (또는3.7-18.8배) 향상시킨다.

• The KIPS Transactions:PartB
• /
• v.15B no.3
• /
• pp.245-252
• /
• 2008

We present a classification algorithm based on ant colony system(ACS) for classifying digital images. The ACS has been recently emerged as a useful tool for the pattern recognition, image extraction, and edge detection. The classification algorithm of digital images is very important in the application areas of digital image coding, image analysis, and image recognition because it significantly influences the quality of images. The conventional procedures usually classify digital images with the fixed value for the associated parameters and it requires postprocessing. However, the proposed algorithm utilizing randomness of ants yields the stable and enhanced images even for processing the rapidly changing images. It is also expected that, due to this stability and flexibility of the present procedure, the digital images are stably classified for processing images with various noises and error signals arising from processing of the drastically fast moving images could be automatically compensated and minimized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.933-941
• /
• 2006

In this paper, we proposed an efficient coding method for digital hologram (fringe pattern) acquired by a CCD camera or by computer generation using multi-view prediction technique and MPEG video compression standard technique. It proceeds each R, G, or B color component separately. The basic processing unit is a partial image segmented into the size of $N{\times}N$. Each partial image retains the information of the whole object. This method generates an assembled image for a row of the segmented and frequency-transformed partial images, which is the basis of the coding process. That is, a motion estimation and compensation technique of MPEG is applif:d to the reconstructed images from the assembled images with the disparities found during generation of assembled image and the original partial images. Therefore the compressed results are the disparity of eachpartial image to form the assembled image for the corresponding row, assembled image, and the motion vectors and the compensated image for each partial image. The experimental results with the implemented algorithm showed that the proposed method has NC (Normal Correlation) values about 4% higher than the previous method, by which ours has better compression efficiency. Consequently, the Proposed method is expected to be used effectively in the application areas to transmit the digital hologram data. can be identified in comparison with the previous researches and commercial IPs.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.3
• /
• pp.318-327
• /
• 2002

This paper Introduces a new scanning method for network-adaptive scalable streaming video coding methodologies such as the MPEG-4 Fine Granular Scalable (FGS) Coding. Proposed scanning method can guarantee the subjectively improved picture quality of the region of the interest in the decoded video by managing the image information of that interested region to be encoded and transmitted most-preferentially, and also to be decoded most-preferentially. Proposed scanning method can lead the FGS coding method to achieve improved picture quality, in about 1dB ~ 3dB better, especially on the region of interest.

• Journal of Internet Computing and Services
• /
• v.11 no.2
• /
• pp.49-60
• /
• 2010

H.264/AVC offers a better encoding efficiency than conventional video standards by adopting many new encoding techniques. However, the advanced coding techniques also add to the overall complexity for H.264/AVC encoder. Accordingly, it is necessary to perform optimization to alleviate the level of complexity for the video encoder. The amount of computation for motion estimation is of particular importance. In this paper, we propose a diamond web-grid search algorithm combined with efficient stationary block skip method which employs full diamond and dodecagon search patterns, and the variable thresholds are used for performing an effective skip of stationary blocks. The experimental results indicate that the proposed technique reduces the computations of the unsymmetrical-cross multi-hexagon-grid search algorithm by up to 12% while maintaining a similar PSNR performance.