• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.1
• /
• pp.8-14
• /
• 2017

Deinterlacing is a method to convert interlaced video, including two fields (even and odd), to progressive video. It can be divided into spatial and temporal methods. The deinterlacing method in the spatial domain can easily be hardware-implemented, but yields image degradation if information about the deinterlaced pixel does not exist in the same field. On the other hand, the method in the temporal domain yields a deinterlaced image with higher quality but uses more memory, and hardware implementation is more difficult. Furthermore, the deinterlacing method in the temporal domain degrades image quality when motion is not estimated properly. The proposed method is for deinterlacing in the spatial domain. It uses several deinterlacing methods according to statistical characteristics in neighboring pixel locations. In this procedure, the proposed method uses the C4.5 algorithm, a typical classification algorithm based on entropy for choosing optimal methods from among the candidates. The simulation results show that the proposed algorithm outperforms previous deinterlacing methods in terms of objective and subjective image quality.

• Journal of Broadcast Engineering
• /
• v.20 no.3
• /
• pp.449-463
• /
• 2015

Video object tracking is important for variety of applications, such as security, video indexing and retrieval, video surveillance, communication, and compression. This paper proposes an object tracking method in HEVC bitstreams. Without pixel reconstruction, motion vector (MV) and size of prediction unit in the bitstream are employed in an Spatio-Temporal Markov Random Fields (ST-MRF) model which represents the spatial and temporal aspects of the object's motion. Coefficient-based object shape adjustment is proposed to solve the over-segmentation and the error propagation problems caused in other methods. In the experimental results, the proposed method provides on average precision of 86.4%, recall of 79.8% and F-measure of 81.1%. The proposed method achieves an F-measure improvement of up to 9% for over-segmented results in the other method even though it provides only average F-measure improvement of 0.2% with respect to the other method. The total processing time is 5.4ms per frame, allowing the algorithm to be applied in real-time applications.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.2
• /
• pp.20-32
• /
• 2010

Previous hardware devices to capture human motion have many limitations; expensive equipment, complexity of manipulation or constraints of human motion. In order to overcome these problems, real-time motion capture algorithms based on computer vision have been actively proposed. This paper presents an efficient analysis method of multiple view images for real-time motion capture. First, we detect the skin color regions of human being, and then correct the image coordinates of the regions by using camera calibration and epipolar geometry. Finally, we track the human body part and capture human motion using kalman filter. Experimental results show that the proposed algorithm can estimate a precise position of the human body.

• Journal of Advanced Navigation Technology
• /
• v.16 no.2
• /
• pp.386-393
• /
• 2012

In this paper, we propose an efficient multi-object recognition and tracking scheme based on interest points of objects and their feature descriptors. To do that, we first define a set of object types of interest and collect their sample images. For sample images, we detect interest points and construct their feature descriptors using SURF. Next, we perform a statistical analysis of the local features to select representative points among them. Intuitively, the representative points of an object are the interest points that best characterize the object. in addition, we make the movement vectors of the interest points based on matching between their SURF descriptors and track the object using these vectors. Since our scheme treats all the objects independently, it can recognize and track multiple objects simultaneously. Through the experiments, we show that our proposed scheme can achieve reasonable performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.388-396
• /
• 2009

This paper proposes a new fire-smoke detection method by using extracted features from camera images and pattern recognition technique. First, moving regions are detected by analyzing the frame difference between two consecutive images and generate candidate smoke regions by applying smoke color model. A smoke region generally has a few characteristics such as similar color, simple texture and upward motion. From these characteristics, we extract brightness, wavelet high frequency and motion vector as features. Also probability density functions of three features are generated using training data. Probabilistic models of smoke region are then applied to observation nodes of our proposed Dynamic Bayesian Networks (DBN) for considering time continuity. The proposed algorithm was successfully applied to various fire-smoke tasks not only forest smokes but also real-world smokes and showed better detection performance than previous method.

• Journal of Broadcast Engineering
• /
• v.5 no.1
• /
• pp.10-22
• /
• 2000

In this paper, we present a texture description method as a standardization of multimedia contents description. Like color, shape, object and camera motion information, texture is one of very important information in the visual part of international standard (MPEG-7) in multimedia contents description. Current MPEG-7 texture descriptor has been designed to fit human visual system. Many psychophysical experiments give evidence that the brain decomposes the spectra into perceptual channels that are bands in spatial frequency. The MPEG-7 texture description method has employed Radon transform that fits with HVS behavior. By taking average energy and energy deviation of HVS channels, the texture descriptor is generated. To test the performance of current texture descriptor, experiments with MPEG-7 Texture data sets of T1 to T7 are performed. Results show that the current MPEG-7 texture descriptor gives better retrieval rate and fast and fast extraction time for texture feature.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.6
• /
• pp.77-83
• /
• 1999

H.263 is an international standard of ITU-T that can makes the service such as video phone, video conference in the transmission line less than 64Kbps. This recommendation draft has used motion estimation/compensation, transform coding and quantizing methods. TMN5 used for the performance estimation of H.263 has fundamentally used DCT in transform coding method and presented quantizer for quantizing the DCT transform coefficient. This paper is presenting adaptive quantizer effectively able to quantize DCT coefficient considering the human visual sensitivity while the structure of TMN5 is maintaining. As quantizer that proposed DCT-based H.263 could make transmit more frame than TMN5 in a same transfer speed, it could lower the frame drop effect. And the luminance signal appeared the difference of -0.3 ～ +0.7dB in the average PSNR for the estimation of objective image quality and the chrominance signal appeared the improvement in about 1.5dB in comparision with TMN5. As a result it can attain the better image quality compared to TMN5 in the estimation of subjective image quality.

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

The gait recognition is presented for human identification from a sequence of noisy silhouettes segmented from video by capturing at a distance. The proposed gait recognition algorithm gives better performance than the baseline algorithm because of segmentation of the object by using multiple modules; i) motion detection, ii) object region detection, iii) head detection, and iv) active shape models, which solve the baseline algorithm#s problems to make background, to remove shadow, and to be better recognition rates. For the experiment, we used the HumanID Gait Challenge data set, which is the largest gait benchmarking data set with 122 objects, For realistic simulation we use various values for the following parameters; i) viewpoint, ii) shoe, iii) surface, iv) carrying condition, and v) time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.1998-2009
• /
• 1998

An effective algorithm for tracking rigid or non-rigid moving object(s) which segments local moving parts from image sequence in the presence of backgraound motion by camera movenment, predicts the direction of it, and tracks the object is proposed. It requires no camera calibration and no knowledge of the installed position of camera. In order to segment the moving object, feature points configuring the shape of moving object are firstly selected, feature flow field composed of motion vectors of the feature points is computed, and moving object(s) is (are) segmented by clustering the feature flow field in the multi-dimensional feature space. Also, we propose IRMAS, an efficient algorithm that finds the convex hull in order to cinstruct the shape of moving object(s) from clustered feature points. And, for the purpose of robjst tracking the objects whose movement characteristics bring about the abrupt change of moving trajectory, an improved order adaptive lattice structured linear predictor is used.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.2
• /
• pp.39-46
• /
• 2023

We present an efficient packet transmission strategy for massively multiplayer online first-person shooter (MMOFPS) games using movement-adaptive packet transmission interval. The player motion in FPS games shows a wide spectrum of movement variability both in speed and orientation, where there is room for reducing the number of packets to be transmitted to the server depending on the predictability of the character's movement. In this work, the degree of variability (nonlinearity) of the player movements is measured at every packet transmission to calculate the next transmission time, which implements the adaptive transmission frequency according to the amount of movement change. Server-side prediction with a few auxiliary heuristics is performed in concert with the incoming packets to ensure reliability for synchronizing the connected clients. The comparison of our method with the previous fixed-interval transmission scheme is presented by demonstrating them using a test game environment.