• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.812-815
• /
• 2009

This paper discusses a searching method for special markers attached with persons in a surveillance video stream. The marker is a small plate with infrared LEDs, which is called a spatiotemporal marker because it shows a 2-D sequential pattern synchronized with video frames. The search is based on the motion vectors which is the same as one in video compression. The experiments using prototype markers show that the proposed method is practical. Though the method is applicable to a video stream independently, it can decrease total computation cost if motion vector analyses of a video compression and the proposed method is unified.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8C
• /
• pp.651-660
• /
• 2010

In this paper, we implement an efficient histogram-based prefiltering to compensate the illumination mismatches in regions between neighboring views. In multi-view video, such illumination disharmony can primarily occur on account of different camera location and orientation and an imperfect camera calibration. This discrepancy can cause the performance decrease of multi-view video coding(MVC) algorithm. A histogram matching algorithm can be exploited to make up for these differences in a prefiltering step. Once all camera frames of a multi-view sequence are adjusted to a predefined reference through the histogram matching, the coding efficiency of MVC is improved. However general frames of multi-view video sequence are composed of several regions with different color composition and their histogram distribution which are mutually independent of each other. In addition, the location and depth of these objects from sequeuces captured from different cameras can be different with different frames. Thus we propose a new algorithm which classify a image into several subpartitions by its depth information first and then histogram matching is performed for each region individually. Experimental results show that the compression ratio for the proposed algorithm is improved comparing with the conventional image-based algorithms.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.671-675
• /
• 2011

DVC (Distributed Video Coding) and FRUC (Frame Rate Up Conversion) techniques need to have an efficient motion compensated frame interpolation algorithms. Conventional works of these applications have mainly focused on the performance improvement of overall system. But, in some applications, it is necessary to evaluate how well the MCI (Motion Compensated Interpolation) frame matches the original frame. For this aim, this paper deals with the modeling methods for evaluating the block-based matching cost. First, several matching criteria, which have already been dealt with the motion compensated frame interpolation, are introduced and then combined to make estimate models for the size of MSE (Mean Square Error) noise of the MCI frame to original one. Through computer simulations, it is shown that the block-based matching criteria are evaluated and the proposed model can be effectively used for estimating the MSE noise.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1097-1100
• /
• 1999

Due to the significant computation of full search in motion estimation, extensive research in fast motion estimation algorithms has been carried out. However, most of the algorithms have the degradation in predicted images compared with the full search algorithm. To reduce an amount of significant computation while keeping the same prediction quality of the full search, we propose a fast block-matching algorithm based on gradient magnitude of reference block without any degradation of predicted image. By using Taylor series expansion, we show that the block matching errors between reference block and candidate block are proportional to the gradient magnitude of matching block. With the derived result, we propose fast full search algorithm with adaptively determined scan direction in the block matching. Experimentally, our proposed algorithm is very efficient in terms of computational speedup and has the smallest computation among all the conventional full search algorithms. Therefore, our algorithm is useful in VLSI implementation of video encoder requiring real-time application.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.278-281
• /
• 2009

In this paper, we propose a fast partial distortion algorithm using normalized dithering matching scan to get uniform distribution of partial distortion which can reduce only unnecessary computation significantly. Our algorithm is based on normalized dithering order matching scan and calibration of threshold error using LOG value for each sub-block continuously for efficient elimination of unlike candidate blocks while keeping the same prediction quality compared with the full search algorithm. Our algorithm reduces about 60% of computations for block matching error compared with conventional PDE (partial distortion elimination) algorithm without any prediction quality, and our algorithm will be useful to real-time video coding applications using MPEG-4 AVC or MPEG-2.

• Journal of Korea Multimedia Society
• /
• v.25 no.1
• /
• pp.103-113
• /
• 2022

Based on the information framework and regulatory focus theory, this paper verifies the impact on the advertising effect when the matching effect forms between the video advertising content type (Information Type, Entertainment Type) and the information framework (Promotional, Prevention) and the regulatory focus (Promotion Orientation, Prevention Orientation) in social media. In order to verify, after selecting of the experimental subjects and finishing the prior investigation of the experimental operation, four video advertisements and formal experiments were performed. The experimental results showed that first, the content type affects the advertising effect of the video and the information framework; when the information video matches the preventive information framework, it will have a more obvious positive effect on the advertising effect; when the entertainment video matches the promotion information framework, it will have a more obvious positive effect on the advertising effect. Second, with the two matches of video content type and information framework, the entertainment-oriented video has a more obvious positive effect for the information-oriented video audience; the above results enrich user created content research and improve the quality and communication efficiency of video in social media.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2833-2850
• /
• 2014

This paper proposes a novel framework for traffic video classification based on chaotic features. First, each pixel intensity series in the video is modeled as a time series. Second, the chaos theory is employed to generate chaotic features. Each video is then represented by a feature vector matrix. Third, the mean shift clustering algorithm is used to cluster the feature vectors. Finally, the earth mover's distance (EMD) is employed to obtain a distance matrix by comparing the similarity based on the segmentation results. The distance matrix is transformed into a matching matrix, which is evaluated in the classification task. Experimental results show good traffic video classification performance, with robustness to environmental conditions, such as occlusions and variable lighting.

• Journal of the Korean Society for Railway
• /
• v.8 no.6 s.31
• /
• pp.559-565
• /
• 2005

In this paper, we propose a stereoscopic video coding scheme for subway accident monitoring system. The proposed designed for providing flexible video among various displays, such ass control center, station employees and train driver. We uses MPEG-2 standard for coding the left-view sequence and IBMDC coding scheme predicts matching block by interpolating both motion and disparity predicted macroblocks. To provide efficient stereoscopic video service, we define both temporally and spatially scalable layers for each eye's-view by using the concept of Spatio-Temporal scalability. The experimental results show the efficiency of proposed coding scheme by comparison with already known methods and the advantages of disparity estimation in terms of scalability overhead. According to the experimental results, we expect the proposed functionalities will play a key role in establishing highly flexible stereoscopic video codec for ubiquitous display environment where devices and network connections are heterogeneous.

• Journal of Digital Convergence
• /
• v.20 no.1
• /
• pp.179-184
• /
• 2022

With the development of information and communication technology, the production and distribution of digital contents is rapidly increasing, and the distribution of illegally copied contents also increases, causing various problems. In order to prevent illegal distribution of contents, a DRM (Digital Rights Management)-based approach can be used, but in a situation where the contents are already copied and distributed, a method of searching and detecting the duplicated contents is required. In this paper, a duplication detection method based on the contents of video content is proposed. The proposed method divides the video into scene units using the visual rhythm extracted from the video, and hierarchically applies the playback time and color feature values of each divided scene to quickly and efficiently detect duplicate videos in a large database. Through experiments, it was shown that the proposed method can reliably detect various replication modifications.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.06a
• /
• pp.131-136
• /
• 1997

We present a method to estimate a dense and sharp depth map using multiple cameras for the application to flexible video production. A key issue for obtaining sharp depth map is how to overcome the harmful influence of occlusion. Thus, we first propose to selectively use the depth information from multiple cameras. With a simple sort and discard technique, we resolve the occlusion problem considerably at a slight sacrifice of noise tolerance. However, boundary overreach of more textured area to less textured area at object boundaries still remains to be solved. We observed that the amount of boundary overreach is less than half the size of the matching window and, unlike usual stereo matching, the boundary overreach with the proposed occlusion-overcoming method shows very abrupt transition. Based on these observations, we propose a hierarchical estimation scheme that attempts to reduce boundary overreach such that edges of the depth map coincide with object boundaries on the one hand, and to reduce noisy estimates due to insufficient size of matching window on the other hand. We show the hierarchical method can produce a sharp depth map for a variety of images.