• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1559-1565
• /
• 2007

The many target-detection methods that use forward-looking infrared (FUR) images can deal with large targets measuring $70{\times}40$ pixels, utilizing their shape features. However, detection small targets is difficult because they are more obscure and there are many target-like objects. Therefore, few studies have examined how to detect small targets consisting of fewer than $30{\times}10$ pixels. This paper presents a small target detection method using clutter rejection with stochastic hypothesis testing for FLIR imagery. The proposed algorithm consists of two stages; detection and clutter rejection. In the detection stage, the mean of the input FLIR image is first removed and then the image is segmented using Otsu's method. A closing operation is also applied during the detection stage in order to merge any single targets detected separately. Then, the residual of the clutters is eliminated using statistical hypothesis testing based on the t-test. Several FLIR images are used to prove the performance of the proposed algorithm. The experimental results show that the proposed algorithm accurately detects small targets (Jess than $30{\times}10$ pixels) with a low false alarm rate compared to the center-surround difference method using the receiver operating characteristics (ROC) curve.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.11
• /
• pp.2555-2562
• /
• 2010

In this paper, we propose the method that extracts sea level measurements graph from the sea level measurements recording paper image with a little interaction. At first, a pixel that is included in the graph area is selected. Then, background pixels are automatically determined using the distance between a selected pixel and other pixels on LAB color space. In each vertical line, a pixel that is the nearest to the selected pixel on LAB color space is extracted and the graph area is determined using that pixels. Experimental results show that the sea level measurements graph can be extracted with a few interaction from the various sea level measurements recording paper images.

• International Journal of Contents
• /
• v.11 no.4
• /
• pp.56-69
• /
• 2015

This paper proposes an efficient image encryption scheme based on quintuple encryption using two chaotic maps. The encryption process is realized with quintuple encryption by calling the encrypt(E) and decrypt(D) functions five times with five different keys in the form EDEEE. The decryption process is accomplished in the reverse direction by invoking the encrypt and decrypt functions in the form DDDED. The keys for the quintuple encryption/decryption processes are generated by using a Tent map. The chaotic values for the encrypt/decrypt operations are generated by using a Gumowski-Mira map. The encrypt function E is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage scrambles all the rows and columns to chaotically generated positions. This stage reduces the correlation radically among the neighboring pixels. The pixel value rotation stage circularly rotates all the pixels either left or right, and the amount of rotation is based on chaotic values. The last stage performs the diffusion four times by scanning the image in four different directions: Horizontally, Vertically, Principal diagonally and Secondary diagonally. Each of the four diffusion steps performs the diffusion in two directions (forward and backward) with two previously diffused pixels and two chaotic values. This stage ensures the resistance against the differential attacks. The security and performance of the proposed method is investigated thoroughly by using key space, statistical, differential, entropy and performance analysis. The experimental results confirm that the proposed scheme is computationally fast with security intact.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.889-894
• /
• 2009

Accompanied by the rapid development of Computer Vision, Visual surveillance has achieved great evolution with more and more complicated processing. However there are still many problems to be resolved for robust and reliable visual surveillance, and the cast shadow occurring in motion detection process is one of them. Shadow pixels are often misclassified as object pixels so that they cause errors in localization, segmentation, tracking and classification of objects. This paper proposes a novel cast shadow removal method. As opposed to previous conventional methods, which considers pixel properties like intensity properties, color distortion, HSV color system, and etc., the proposed method utilizes observations about edge patterns in the shadow region in the current frame and the corresponding region in the background scene, and applies Laplacian edge detector to the blob regions in the current frame and the background scene. Then, the product of the outcomes of application determines whether the blob pixels in the foreground mask comes from object blob regions or shadow regions. The proposed method is simple but turns out practically very effective for Gaussian Mixture Model, which is verified through experiments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.182-183
• /
• 2018

Most of the photographs or images of the present age have pixels of various colors that can not be recognized by human eyes. For a specific purpose, pixel-based image processing is inevitable rather than passive investigation using the human eye in order to find areas of color similar to the target color. In this paper, we try to detect all the pixels of the same color or the same color in the image. We will also try to find pixels within the error range that are similar in color to the color we are looking for.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.331-337
• /
• 2017

In this work, we propose an improved form of Zhang's reversible data hiding technique in encrypted image. In the original work, average value of neighboring pixels is used for fluctuation calculation which fails to give good performance. In proposed scheme, to reduce the bit error rate a new function is calculated by summing difference from four neighboring pixels for measuring fluctuation. Moreover, modified calculation of fluctuation function is also proposed where border pixels are considered. The simulation results show that the performance of proposed method outperforms Zhang's and Hong's work. From the results, more information can be sent by using proposed system

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.514-519
• /
• 1992

To make an accurate retrieval of the proportion of each category among mixed pixels (Mixel's) of a remotely sensed imagery, a maximum likelihood estimation method of category proportion is proposed. In this method, the observed multispectral vector is considered as probability variables along with the approximation that the supervised data of each category can be characterized by normal distribution. The results show that this method can retrieve accurate proportion of each category among Mixel's. And a index that can estimate the degree of error in each category is proposed. AS one of the application of the proportion estimation, a method for image classification based on category proportion estimation is proposed. In this method all pixel in a remotely sensed imagery are assumed to be Mixel's, and are classified to most dominant category. Among the Mixel's, there exists unconfidential pixels which should be categorized as unclassified pixels. In order to discriminate them, two types of criteria, Chi square and AIC, are proposed for fitness test on pure pixel hypothesis. Experimental result with a simulated dataset show an usefulness of proposed classification criterion compared to the conventional maximum likelihood criterion and applicability of the fitness tests based on Chi square and AIC,

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.3
• /
• pp.45-52
• /
• 2000

In this study, we propose the image segmentation algorithm for facial region segmentation. The proposed algorithm separates the mean image of low frequency band from the differential image of high frequency band in order to make a boundary using HWT, and then we reduce the isolation pixels, projection pixels, and overlapped boundary pixels from the low frequency band. Also the boundaries are detected and simplified by the proposed boundary detection algorithm, which are cleared on the thinning process of 1 pixel unit. After extracting facial image boundary by using the proposed algorithm, we make the mask and segment facial image through matching original image. In the result of facial region segmentation experiment by using the proposed algorithm, the successive facial segmentation have 95.88% segmentation value.

• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.420-432
• /
• 2014

In detection of moving objects from video sequences, an essential process for intelligent visual surveillance, the cast shadows accompanying moving objects are different from background so that they may be easily extracted as foreground object blobs, which causes errors in localization, segmentation, tracking and classification of objects. Most of the previous research results about moving cast shadow detection and removal usually utilize color information about objects and scenes. In this paper, we proposes a novel cast shadow removal method of moving objects in gray level video data for visual surveillance application. The proposed method utilizes observations about edge patterns in the shadow region in the current frame and the corresponding region in the background scene, and applies Laplacian edge detector to the blob regions in the current frame and the corresponding regions in the background scene. Then, the product of the outcomes of application determines moving object blob pixels from the blob pixels in the foreground mask. The minimal rectangle regions containing all blob pixles classified as moving object pixels are extracted. The proposed method is simple but turns out practically very effective for Adative Gaussian Mixture Model-based object detection of intelligent visual surveillance applications, which is verified through experiments.

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

In this paper, we proposed automatically video colorization method with partial color sources in first frame. The input color sources are propagated to other gray pixels with the high correlation between two pixels. To robust again the errors in portion of the weak boundary, we calculate correlation between two pixels using dual-path comparison. Video colorization method should maintain the color connectivity between frames. Accordingly, we define reliability of primarily color by compare the color of neighborhood frames. We perform the color correction by blending neighboring color when the reliability of primarily color is low. We formalize this premise with energy function, and find the color to minimize the energy function. In this way, using property of video, we reduce the error caused by propagation and get result of natural changes between frames. Through simulation results, we show the proposed method derive a natural result more than previous method.