• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.35-38
• /
• 2009

The paper presents an effective method to detect fire in video surveillance and monitoring system. The main contribution of this work is that we successfully use the Hidden Markov Models in the process of detecting the fire with a few preprocessing steps. First, the moving pixels detected from image difference, the color values obtained from the fire flames, and their pixels clustering are applied to obtain the image regions labeled as fire candidates; secondly, utilizing massive training data, including fire videos and non-fire videos, creates the Hidden Markov Models of fire and non-fire, which are used to make the final decision that whether the frame of the real-time video has fire or not in both temporal and spatial analysis. Experimental results demonstrate that it is not only robust but also has a very low false alarm rate, furthermore, on the ground that the HMM training which takes up the most time of our whole procedure is off-line calculated, the real-time detection and alarm can be well implemented when compared with the other existing methods.

• Korean Journal of Optics and Photonics
• /
• v.17 no.1
• /
• pp.31-37
• /
• 2006

We propose a digital watermarking technique using a computer generated hologram. The proposed method uses two random patterns separated from the computer generated hologram (CGH). One of those is embedded into the original image as hidden watermark information and then the reconstructed image can be obtained by an optical decoding algorithm with the other one as a decoding key. We analyze an occlusion of the watermarked image that is the original image containing the hidden pattern. The embedding process is performed digitally and reconstruction optically Computer simulation and an optical experiment are shown in support of the proposed technique.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.3
• /
• pp.522-538
• /
• 2013

Content based image retrieval has become an increasingly important research topic for its wide application. It is highly challenging when facing to large-scale database with large variance. The retrieval systems rely on a key component, the predefined or learned similarity measures over images. We note that, the similarity measures can be potential improved if the data distribution information is exploited using a more sophisticated way. In this paper, we propose a similarity measure learning approach for image retrieval. The similarity measure, so called Fisher kernel, is derived from the probabilistic distribution of images and is the function over observed data, hidden variable and model parameters, where the hidden variables encode high level information which are powerful in discrimination and are failed to be exploited in previous methods. We further propose a discriminative learning method for the similarity measure, i.e., encouraging the learned similarity to take a large value for a pair of images with the same label and to take a small value for a pair of images with distinct labels. The learned similarity measure, fully exploiting the data distribution, is well adapted to dataset and would improve the retrieval system. We evaluate the proposed method on Corel-1000, Corel5k, Caltech101 and MIRFlickr 25,000 databases. The results show the competitive performance of the proposed method.

• Journal of Korea Game Society
• /
• v.10 no.1
• /
• pp.157-165
• /
• 2010

This paper presents a novel real-time rendering algorithm based on spherical coordinate system of the object using convex hull. While OpenGL rendering pipeline touches all vertices of an object, the proposed method takes account the only visible vertices by examining the visible triangles of the object. In order to determine the visible areas of the object in its spherical coordinate representation, the proposed method uses 3D geometric relation of 6 plane equations of the camera frustum and the bounding sphere of the object. In addition, we compute the convex hull of the object and its maximum side factors for hidden surface removal. Simulation results showed that the quality of result image is almost same compared to original image and rendering performance is greatly improved.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.43-54
• /
• 2005

This paper proposes a novel texture segmentation method using Bayesian image segmentation method and SOM(Self Organization feature Map). Multi-scale wavelet coefficients are used as the input of SOM, and likelihood and a posterior probability for observations are obtained from trained SOMs. Texture segmentation is performed by a posterior probability from trained SOMs and MAP(Maximum A Posterior) classification. And the result of texture segmentation is improved by context information. This proposed segmentation method shows better performance than segmentation method by HMT(Hidden Markov Tree) model. The texture segmentation results by SOM and multi-sclae Bayesian image segmentation technique called HMTseg also show better performance than by HMT and HMTseg.

• Journal of Information Processing Systems
• /
• v.18 no.6
• /
• pp.813-821
• /
• 2022

Intelligent monitoring, life entertainment, medical rehabilitation, and other fields are only a few examples where visual image technology is becoming increasingly sophisticated and playing a significant role. Recognizing Wushu, or martial arts, movements through the use of visual image technology helps promote and develop Wushu. In order to segment and extract the signals of Wushu movements, this study analyzes the denoising of the original data using the wavelet transform and provides a sliding window data segmentation technique. Wushu movement The Wushu movement recognition model is built based on the hidden Markov model (HMM). The HMM model is trained and taught with the help of the Baum-Welch algorithm, which is then enhanced using the frequency weighted training approach and the mean training method. To identify the dynamic Wushu movement, the Viterbi algorithm is used to determine the probability of the optimal state sequence for each Wushu movement model. In light of the foregoing, an HMM-based martial arts movements recognition model is developed. The recognition accuracy of the HMM model increases to 99.60% when the number of samples is 4,000, which is greater than the accuracy of the SVM (by 0.94%), the CNN (by 1.12%), and the BP (by 1.14%). From what has been discussed, it appears that the suggested system for detecting martial arts acts is trustworthy and effective, and that it may contribute to the growth of martial arts.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.759-766
• /
• 2017

In this paper, we preserve the transparency of digital contents by compressing and storing the medical image for a certain period so as to be safe and robust against various attacks of medical images. The proposed algorithm generates an encrypted image authentication code that extracts the feature value of the original image and combines it with the user's information. in order to extract hidden data, the authentication code is first decrypts the encrypted medical image and extracts the hidden data using the spatial characteristics of image. The proposed algorithm guarantees integrity when comparing extracted authentication code and newly generated authentication code for image authentication after directly inserting it into content itself through watermarking. We have proved various security of attack of image data and proved that the certification rate is improved to 98.4%.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1852-1860
• /
• 2000

Distinct from the Markov random field or pseudo 2D HMM models for image analysis, this paper proposes a new model of 2D hidden Markov mesh chain(HMMM) model which subsumes the definitions of and the assumptions underlying the conventional HMM. The proposed model is a new theoretical realization of 2D HMM with the causality of top-down and left-right progression and the complete lattice constraint. These two conditions enable an efficient mesh decoding for model estimation and a recursive maximum likelihood estimation of model parameters. Those algorithms are developed in theoretical perspective and, in particular, the training algorithm, it is proved, attains the optimal set of parameters.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.3
• /
• pp.23-30
• /
• 2008

A data hiding method based on least significant bit (LSB) substitution and multi-pixel differencing (MPD) is presented on the proposed method to improve the capacity of the hidden secret data and to provide an imperceptible visual quality. First, a sum of different values for four-pixel sub-block is calculated. The low value of the sum can be located on a smooth block and the high value is located on an edged block. The secret data are hidden into the cover image by LSB method in the smooth block, while MPD method in the edged block. The experimental results show that the proposed method has a higher capacity and maintains a good visual quality.

• Journal of Biosystems Engineering
• /
• v.37 no.4
• /
• pp.271-278
• /
• 2012

Worldwide trends in animal welfare have resulted in an increased interest in individual management of sows housed in groups within hog barns. Estrus detection has been shown to be one of the greatest determinants of sow productivity. Purpose: We conducted this study to develop a method that can automatically detect the estrus state of a sow by selecting optimal texture parameters from images of a sow's pudendum and by optimizing the number of neurons in the hidden layer of an artificial neural network. Methods: Texture parameters were analyzed according to changes in a sow's pudendum in estrus such as mucus secretion and expansion. Of the texture parameters, eight gray level co-occurrence matrix (GLCM) parameters were used for image analysis. The image states were classified into ten grades for each GLCM parameter, and an artificial neural network was formed using the values for each grade as inputs to discriminate the estrus state of sows. The number of hidden layer neurons in the artificial neural network is an important parameter in neural network design. Therefore, we determined the optimal number of hidden layer units using a trial and error method while increasing the number of neurons. Results: Fifteen hidden layers were determined to be optimal for use in the artificial neural network designed in this study. Thirty images of 10 sows were used for learning, and then 30 different images of 10 sows were used for verification. Conclusions: For learning, the back propagation neural network (BPN) algorithm was used to successful estimate six texture parameters (homogeneity, angular second moment, energy, maximum probability, entropy, and GLCM correlation). Based on the verification results, homogeneity was determined to be the most important texture parameter, and resulted in an estrus detection rate of 70%.