• Smart Media Journal
• /
• v.6 no.2
• /
• pp.9-14
• /
• 2017

A packet loss in wireless environments causes a severe degradation of video quality in video communications. In this paper, a novel video error concealment algorithm is presented by combining boundary errors and a block reliability measure. The block reliability measure decides the reliability of a block by checking residual errors of a block. In the proposed approach, a motion vector of a missing unreliable block in an inter coded frame is obtained initially based on the motion vector of the same block in the reference frame. Furthermore, if the block in the reference frame is unreliable according to the reliability measure, a new motion vector is decided based on block boundary errors around the initial motion vector. According to our simulations, the proposed approach shows promising results for error concealment in error-prone wireless environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1971-1978
• /
• 1999

In this paper, we study the effects of long-range dependence (LRD) in VBR video traffic on queueing system. This paper consists of Part I and II. In Part I, we present a (LRD) video traffic model based on the shifting-level (SL) process. We observe that the ACF of an empirical video trace is accurately captured by the shifting-level process with compound correlation (SLCC): an exponential function in short range and a hyperbolic function in long range. We present an accurate parameter matching algorithm for video traffic. In the Part II, we offer the queueing analysis of SL/D/1/K called ‘quantization reduction method’. Comparing the queueing performances of the DAR(1) model and the SLCC with that of a real video trace, we identify the effects of SRD and LRD in VBR video traffic on queueing performance. Simulation results show that Markoivian models can estimate network performances fairly accurately under a moderate traffic load and buffer condition, whereas LRD may have a significant effect on queueing behavior under a heavy traffic load and large buffer condition.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.151-156
• /
• 2006

This paper presents an background edge generation based automatic algorithm for detection of moving objects under moving camera. Background image is generated by rotating the fixed the camera on the tripod horizontally, aligning and reorganizing this images. We develop an efficient approach for robust panoramic background edge generation as well as method of edge matching between input image and background image. We applied the proposed algorithm to real image sequences. The proposed method can be successfully realized in various monitoring systems like intrusion detection as well as video surveillance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.3
• /
• pp.221-230
• /
• 1988

This paper presents an effective block matching algorithm(BMA) in which the number of search point is about a half of that of three step search, and the number of search step is fixed a four. The performance of the proposed algorithm is compared with those of three step search and one-at-at time search(OTS) for three video sequences composed of 16 framse. Moreover the performance of applying subsampling or integral projection to each BMA for further reducing the amount of computation is considered.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.201-208
• /
• 2003

The error concealment is very useful technique for real-time communication, such as video conference. In this paper. we propose the error concealment technique to minimize discontinuity of block boundary in consideration of the fact that human visual system is sensitive to discontinuity. The error concealment for each loss block is performed by extended block matching method based on gradient difference. In the simulation result, performance improvement for the proposed technique is on the average 1.32㏈ in comparison with the conventional technique.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.4
• /
• pp.189-197
• /
• 2009

This paper suggests the system for searching and application is to be in combination between existing hair art area and Image/Video processing area. This proposed system usually saves various hair types into a database, then, users send images of their face over the internet by using WebCam. Finally, they can find the hair types for users. Hair cutting is technology that form draft to make hair style. Man cut must decide how in image of sinciput, image of side bean curd, after lower image must operate. Silhouette is produced as is different by change of this three places. Customer increases in the beauty salon and beauty salon chain being changed, research about beauty art is necessary point of time. In this treatise, our country of when swim and operate haircut about problem that happen sample survey and analysis.

• The Journal of the Korea Contents Association
• /
• v.3 no.4
• /
• pp.11-16
• /
• 2003

In this paper, a Fast Block Sum Pyramid Algorithm (FBSPA) is presented for motion estimation in video coding. PBSPA is based on Block Sum Pyramid Algorithm(BSPA), Efficient Multilevel Successive Elimination Algorithms for Block Matching Motion Estimation, and Fast Algorithms for the Estimation of Motion Vectors. FBSPA reduces the computations for motion estimation of BSPA 29％ maximally using partial distortion elimination(PDE) scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7A
• /
• pp.705-710
• /
• 2002

In this paper, we present a method to find motion vectors in frequency domain for video data compression. The proposed algorithm is based on the Format Number Transform (FNT), and it declares the most correlated-block as the best matching block, as opposed to declaring the block with least sum of differences between blocks. We show that the proposed method is equivalent to declaring the block with the minimum L2-norm as the best matching block. Unlike other previous fast algorithms, the time requirement for the proposed algorithm does not defend on the image type for finding the optimum solution.

• Journal of the Korean Society of Safety
• /
• v.18 no.4
• /
• pp.23-27
• /
• 2003

To improve the road transportation safety, the road traffic data is monitored by applying an image detection system. The road traffic safety is analysed using image processing techniques. For more accurate measurement, the coordinate matching of real road data to image is one of the most essential parts of the image detection technique. The road image is skewed at the input screen, because the video camera is installed at the roadside. A fast and precise algorithm for the coordinate matching is developed to convert image coordinates into road coordinates.

• Journal of Korea Multimedia Society
• /
• v.24 no.6
• /
• pp.796-804
• /
• 2021

In computer vision, visual tracking method addresses the problem of localizing an specific object in video sequence according to the bounding box. In this paper, we propose a tracking method by introducing the feature correlation comparison into the siamese network to increase its matching identification. We propose a way to compute location of object to improve matching performance by a correlation operation, which locates parts for solving the searching problem. The higher layer in the network can extract a lot of object information. The lower layer has many location information. To reduce error rate of the object center point, we built a siamese network that extracts the distribution and location information of target objects. As a result of the experiment, the average center error rate was less than 25%.