• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.219-222
• /
• 2001

Moving objects in video data are main elements for video analysis and retrieval. In this paper, we propose a new algorithm for tracking and segmenting moving objects in color image sequences that include complex camera motion such as zoom, pan and rotating. The Proposed algorithm is based on the Mean-shift color segmentation and stochastic region matching method. For segmenting moving objects, each sequence is divided into a set of similar color regions using Mean-shift color segmentation algorithm. Each segmented region is matched to the corresponding region in the subsequent frame. The motion vector of each matched region is then estimated and these motion vectors are summed to estimate global motion. Once motion vectors are estimated for all frame of video sequences, independently moving regions can be segmented by comparing their trajectories with that of global motion. Finally, segmented regions are merged into the independently moving object by comparing the similarities of trajectories, positions and emerging period. The experimental results show that the proposed algorithm is capable of segmenting independently moving objects in the video sequences including complex camera motion.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.298-300
• /
• 2004

In the decoding process of interframe wavelet coding, the inverse wavelet transform requires huge computational complexity. However, the decoder may need to be used in various devices such as PDAs, notebooks, PCs or set-top Boxes. Therefore, the decoder's complexity should be adapted to the processor's computational power. A decoder designed in accordance with the processor's computational power would provide optimal services for such devices. So, it is natural that the complexity scalability and the low complexity codec are also listed in the requirements for scalable video coding. In this contribution, we develop a method of controlling and lowering the complexity of the spatial wavelet transform while sustaining almost the same coding efficiency as the conventional spatial wavelet transform. In addition, the proposed method may alleviate the ringing effect for certain video data.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.195-198
• /
• 2003

Monitoring and analyzing people in video images are important and attract attention from many researchers in computer vision field. In this paper, we propose a new technique by which people overlapped one another in an image can be extracted and counted. After extracting moving people from video images as foreground, their heads are searched by Hough Transform inside the foreground. Since heads are comparatively stable in spite of motion in video images, semicircles along the head tops can be important features to be found in an edge map. In our experiment, the technique successfully separated people who existed at the same vertical positions, which was Impossible by existing techniques. Meanwhile, it showed high dependency on edge information and false results were obtained when the rather were rather incomplete.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.325-329
• /
• 2007

The mobile and multimedia service on wireless network have been leaded from the improvement of telecommunication techniques. A typical multimedia service, a video transmission usually requires larger bandwidth than voice transmission. Many channel allocation algorithms for Orthogonal Frequency Division Multiple Access (OFBMA) to use resources more efficiently, Previous channel allocation algorithms have developed with an assumption that the data traffic is constant bit rate (CBR). However, existing algorithms are not suitable to video traffic because it usually generates a variable bit rate (VBR) traffic. In this paper, we proposed a new channel allocation algorithm called a queue-based channel allocation. it is more suitable to transmit the video traffics. Also, a problem are notified in case of realtime generated video traffic and a corresponding heuristic solution was proposed.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.176-178
• /
• 2005

In the images of a video camera employed for surveillance, detecting targets by extracting foreground image is of great importance. The foreground regions detected, however, include not only moving targets but also their shadows. This paper presents a novel technique to detect shadow pixels in the foreground image of a video camera. The image characteristics of video cameras employed, a web-cam and a CCD, are first analysed in the HSV color space and a pixel-level shadow detection technique is proposed based on the analysis. Compared with existing techniques where unified criteria are used to all pixels, the proposed technique determines shadow pixels utilizing a fact that the effect of shadowing to each pixel is different depending on its brightness in background image. Such an approach can accommodate local features in an image and hold consistent performance even in changing environment. In experiments targeting pedestrians, the proposed technique showed better results compared with an existing technique.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.908-911
• /
• 2002

Over the past 30 years, many efficient 2D video coding techniques have been presented and developed from many research centers for commercialization. However, direct application of these monocular compression schemes is not optimal for stereo video coding. In this paper, we present a new technique for coding stereo video sequences based on Discrete Wavelet Transform (DWT). The proposed technique exploits Zerotree Entropy Coding (ZTE) that makes use of the wavelet block concept to achieve low bit rate stereo video coding. The one of two image streams, called main stream, is independently coded by modified MPEG-4 encoder and the other stream, called auxiliary stream, is coded by predicting from its corresponding image, its previous image or its follow image.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1023-1026
• /
• 2002

In this paper, we propose an efficient transcoding of MPEG video. Transcoding is the process of converting a compressed video format to another different compressed video format. We propose an simple and efficient transcoding by requantization in which MPEG coded video at high bit-rate is converted into MPEG bitstream at lower bit-rate. To reduce a image quality degradation, we use HVS(Human Visual System) that is the effect that visibility of noise is less in high activity regions than in low activity regions. By using the effect, the part of image in high activity region is coarsely quantized without seriously degrading the image quality. Experimental results show that the proposed method can provide good performance.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1109-1112
• /
• 1999

본 논문에서는 영상확대 chip의 video 입력부에 부분화면을 저장할 frame memory의 구조를 개선하고자 하였다. 영상확대 video scaler인 gm833×2는 입력단 측에 frame buffer memory가 필요하게 되지만, 이를 외부에 장착하려면 일반적으로 대용량의 FIFO 메모리를 사용하게 된다. 이것은 dualport SRAM으로 구성이 되며, 메모리 제어를 고가의 FIFO칩에 의존하는 결과를 가져온다. 또한 기존의 scaler chip은 단순히 확대처리만을 하며, 입력 전, 후에 data의 변경 또는 이미지처리가 불가능한 구조가 된다. 본 논문에서는 외부에 필요한 메모리를 내장한 새로운 기능의 chip을 설계하는 데에 있어 필수적인 메모리제어 로직을 제안하고자 한다. 여기서는 더 나은 기능의 향상된 메모리 제어회로를 제시하고 이를 One-chip에 집적할 수 있도록 하였다 이를 사용한 Video Scaler Processor chip은 SDRAM을 별도의 제어회로 없이 외부에 장착할 수 있도록 하여 scaler의 기능을 향상시키면서 전체 시스템의 구조를 간단히 할 수 있을 것으로 기대된다. 본 논문에서는 먼저 메모리 제어회로를 포함한 Video Scaler Processor chip의 메모리제어 하드웨어의 구조를 제시하고, 메모리 access model과 제어로직을 소개하고자 한다.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.137-140
• /
• 2000

In this paper, we propose as new algorithm for the selection of key frames in a given video. For the selected key frames to be well defined, the selected key frames need to spread out on the whole temporal domain of the given video and guaranteed not to be duplicate. For this purpose, we take the first frame of each shot of the video as the candidate key frame to represent the video. To reduce the overall processing time, we eliminate some candidate key frames which are visually indistinct in the histogram difference. The key frames are then selected using a clustering processing based on the singly linked hierarchical tree. To make the selected key frames be distributed evenly on the whole video, the deviation and time difference between the selected key frames are used. The simulation results demonstrate that our method provides the better performance compared with previous methods.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1855-1858
• /
• 2003

In this paper, we propose image retrieval method more accurate and efficient than the conventional one. First of ail, we perform a shot detection and key frame extraction from the DC image constructed by DCT DC coefficients in the compressed video stream that is video compression standard such as MPEG[I][2]. We get principal axis applying PCA(Principal Component Analysis) to key frames for obtaining indexing information, and divide a domain. Video retrieval uses indexing information of high dimension. We apply KD-Trees(K Dimensional-Trees)[3] which shows efficient retrieval in data set of high dimension to video retrieval method. The proposed method can represent property of images more efficiently and property of domains more accurately using KD-Trees.