• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.157-165
• /
• 2011

It is challenging to detect foreground objects when background includes an illumination variation, shadow or structural variation due to its motion. Basically pixel-based background models including codebook-based modeling suffer from statistical randomness of each pixel. This paper proposes an algorithm that incorporates Markov random field model into pixel-based background modeling to achieve more accurate foreground detection. Under the assumptions the distance between the pixel on the input imaging and the corresponding background model and the difference between the scene estimates of the spatio-temporally neighboring pixels are exponentially distributed, a recursive approach for estimating the MRF regularizing parameters is proposed. The proposed method alternates between estimating the parameters with the intermediate foreground detection and estimating the foreground detection with the estimated parameters, after computing it with random initial parameters. Extensive experiment is conducted with several videos recorded both indoors and outdoors to compare the proposed method with the standard codebook-based algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.91-102
• /
• 2010

It is very difficult that a previous surveillance system and vehicle detection system find objects on a limited and unstable illumination condition. This paper proposes a robust method of adaptively updating a reference background image for solving problems that are generated by the unstable illumination. The first input image is set up as the reference background image, and is divided into three block categories according to an edge component. Then a block state analysis, which uses a rate of change of the brightness, a stability, a color information, and an edge component on each block, is applied to the input image. On the reference background image, neighbourhood blocks having the same state of a updated block are merged as a block. The proposed method can generate a robust reference background image because it distinguishes a moving object area from an unstable illumination. The proposed method very efficiently updates the reference background image from the point of view of the management and the processing time. In order to demonstrate the superiority of the proposed stable manner in situation that an illumination quickly changes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.477-481
• /
• 2007

A background is a part where do not vary too much or frequently change in an image sequence. Using this assumption, it is presented a background acquisition algorithm for not only static but also dynamic view in this paper. For generating background, we detect a region, where has high correlation rate compared within selected region in the prior pyramid image, from the searching region in the current image. Between a detected region in the current image and a selected region in the prior image, we calculate movement vector for each regions in time sequence. After we calculate whole movement vectors for two successive images, vector histogram is used to determine the camera movement. The vector which has the highest density in the histogram is determined a camera movement. Using determined camera movement, we classify clusters based on pixel intensities which pixels are matched with prior pixels following camera movement. Finally we eliminate clusters which have lower weight than threshold, and combine remained clusters for each pixel to generate multiple background clusters. Experimental results show that we can automatically detect background whether camera move or not.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.59-68
• /
• 2005

Object tracking in a real time image is one of interesting subjects in computer vision and many practical application fields Past couple of years. But sometimes existing systems cannot find object by recognize background noise as object. This paper proposes a method of object detection and tracking using adaptive background image in real time. To detect object which does not influenced by illumination and remove noise in background image, this system generates adaptive background image by real time background image updating. This system detects object using the difference between background image and input image from camera. After setting up MBR(minimum bounding rectangle) using the internal point of detected otject, the system tracks otiect through this MBR. In addition, this paper evaluates the test result about performance of proposed method as compared with existing tracking algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.1
• /
• pp.46-49
• /
• 2017

In this letter, we investigate the impact of image downsampling on the performance of background subtraction in Full-HD soccer videos. To this end, we evaluated the performance of background subtraction in terms of both accuracy and computational time. Furthermore, for the sake of completeness, we used two different background subtraction methods under the same experimental setup. For the quantitative comparison, we employed the F-measure and FPS(frames per second). We believe that this study serves as a practically useful benchmark for researchers and practitioners in developing a fast background subtraction algorithm adopted for building real-time intelligent soccer video analysis systems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.608-611
• /
• 2004

In this paper, we propose a robust face recognition technique based on the principle of eigenfaces. The traditional eigenface recognition (EFR) method works quite well when the input test patterns are cropped fares. However, when confronted with recognizing faces embedded in arbitrary backgrounds, the EFR method fails to discriminate effectively between faces and background patterns, giving rise to many false alarms. In order to improve robustness in the presence of background, we argue in favor of loaming the distribution of background patterns. A background space is constructed from the background patterns and this space together with the face space is used for recognizing faces. The proposed method outperforms the traditional EFR technique and gives very good results even on complicated scenes.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.813-814
• /
• 2008

In this paper, we propose a new tracking algorithm which uses weighted sum of color bin's centroids to find the main centroid of the target. The weights are determined by the proportion of colors of the target and by the colors of background. That is, A color which has high occupation in forming the target is highly weighted and a color which has low occupation is lowly weighted. Moreover, the proposed algorithm prevent track failure by lowering the weight of the colors which forms the background. Therefore, the proposed algorithm performs stable tracking inspite of occlusion and existence of confusing backgrounds.

• Journal of Information Processing Systems
• /
• v.18 no.5
• /
• pp.711-718
• /
• 2022

In this paper, an accurate segmentation algorithm of video dynamic background image (VDBI) based on improved wavelet transform is proposed. Based on the smooth processing of VDBI, the traditional wavelet transform process is improved, and the two-layer decomposition of dynamic image is realized by using two-dimensional wavelet transform. On the basis of decomposition results and information enhancement processing, image features are detected, feature points are extracted, and quantum ant colony algorithm is adopted to complete accurate segmentation of the image. The maximum SNR of the output results of the proposed algorithm can reach 73.67 dB, the maximum time of the segmentation process is only 7 seconds, the segmentation accuracy shows a trend of decreasing first and then increasing, and the global maximum value can reach 97%, indicating that the proposed algorithm effectively achieves the design expectation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3301-3318
• /
• 2016

Online social networks (OSNs) have changed the way people communicate with each other. An OSN usually encourages the participants to provide personal information such as real names, birthdays and educational background to look for and establish friendships among them. Some users are unwilling to reveal personal information on their personal pages due to potential privacy concerns, but their friends may inadvertently reveal that. In this work, we investigate the possibility of leaking personal information on Facebook in an unintentional and involuntary manner. The revealed information may be useful to malicious users for social engineering and spear phishing. We design the inference methods to find birthdays and educational background of Facebook users based on the interactions among friends on Facebook pages and groups, and also leverage J-measure to find the inference rules. The inference improves the finding rate of birthdays from 71.2% to 87.0% with the accuracy of 92.0%, and that of educational background from 75.2% to 91.7% with the accuracy of 86.3%. We also suggest the sanitization strategies to avoid the private information leakage.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.9
• /
• pp.164-171
• /
• 2013

XRF spectrum data of a material include a lot of background signals which are not related to its components. Since an XRF analyzer analyzes components and concentrations of an analyte using the locations and magnitudes of gaussian-shaped peaks extracted from a spectrum, its background signals need to be removed completely from the spectrum for the accurate analysis. Morphology-based method, SNIP-based method and thresholding-based method have been used to remove background signals. In the paper, a background removal method, an improved version of an interval-thresholding-based method, is proposed. The proposed method consists of interval partitioning, interval classifying, and background estimation. Experimental results show that the proposed method has better performance on background removal from the spectrum than the existing methods, morphology-based method and SNIP-based method.