• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.647-650
• /
• 2002

The human faces do not have distinct features unlike other general objects. In general the features of eyes, nose and mouth which are first recognized when human being see the face are defined. These features have different characteristics depending on different human face. In this paper, We propose a face recognition algorithm using the hidden Markov model(HMM). In the preprocessing stage, we find edges of a face using the locally adaptive threshold scheme and extract features based on generic knowledge of a face, then construct a database with extracted features. In training stage, we generate HMM parameters for each person by using the forward-backward algorithm. In the recognition stage, we apply probability values calculated by the HMM to input data. Then the input face is recognized by the euclidean distance of face feature vector and the cross-correlation between the input image and the database image. Computer simulation shows that the proposed HMM algorithm gives higher recognition rate compared with conventional face recognition algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2078-2093
• /
• 2019

Visual smoke recognition is a challenging task due to large variations in shape, texture and color of smoke. To improve performance, we propose a novel smoke recognition method by combining dual-encoded features that are extracted from both spatial and Curvelet domains. A Curvelet transform is used to filter an image to generate fifty sub-images of Curvelet coefficients. Then we extract Local Binary Pattern (LBP) maps from these coefficient maps and aggregate histograms of these LBP maps to produce a histogram map. Afterwards, we encode the histogram map again to generate Dual-encoded Local Binary Patterns (Dual-LBP). Histograms of Dual-LBPs from Curvelet domain and Completed Local Binary Patterns (CLBP) from spatial domain are concatenated to form the feature for smoke recognition. Finally, we adopt Gaussian Kernel Optimization (GKO) algorithm to search the optimal kernel parameters of Support Vector Machine (SVM) for further improvement of classification accuracy. Experimental results demonstrate that our method can extract effective and reasonable features of smoke images, and achieve good classification accuracy.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.49 no.1
• /
• pp.13-20
• /
• 2021

In this paper, a new algorithm is proposed to estimate the damage size by combining the reflected area with the reflected position and extracting contours in proportion to the maximum value of pixels from the visible image. The cumulative summation feature vector algorithm is used to obtain the area of the reflected signal. To get the position of the reflected signal, the signal correlation algorithm is used to decompose the reflected signal from the damage. The proposed algorithm is tested and validated for composite panels. Repetitive experiments are performed and it is confirm that the proposed algorithm is reproducible. Further, it is verified that the damage size can be estimated appropriately by the proposed algorithm.

• Journal of the Korean Society of Radiology
• /
• v.3 no.1
• /
• pp.29-39
• /
• 2009

In this paper has proposed to the recognition of the disease on medical images using neural network. The neural network is constructed as three-layers of the input-layer, the hidden-layer and the output-layer. The training method applied for the recognition of disease region is adaptive error back-propagation. The low-frequency region analyzed by DWT are expressed by matrix. The coefficient-values of the characteristic polynomial applied are n+1. The normalized maximum value +1 and minimum value -1 in the range of tangent-sigmoid transfer function are applied to be use as the input vector of the neural network. To prove the validity of the proposed methods used in the experiment with a simulation experiment, the input medical image recognition rate the evaluation of areas of disease. As a result of the experiment, the characteristic polynomial coefficient of low-frequency area matrix, conversed to 4 level DWT, was proved to be optimum to be applied to the feature parameter. As for the number of training, it was marked fewest in 0.01 of learning coefficient and 0.95 of momentum, when the adaptive error back-propagation was learned by inputting standardized feature parameter into organized neural network. As to the training result when the learning coefficient was 0.01, and momentum was 0.95, it was 100% recognized in fifty-five times of the stomach image, fifty-five times of the chest image, forty-six times of the CT image, fifty-five times of ultrasonogram, and one hundred fifty-seven times of angiogram.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.2
• /
• pp.166-172
• /
• 2014

Image classification is an important problem in computer vision. However, it is a very challenging problem due to the variability, ambiguity and scale change that exists in images. In this paper, we propose a method of a hypergraph based modeling can consider the higher-order relationships of semantic attributes of a scene image and apply it to a scene image classification. In order to generate the hypergraph optimized for specific scene category, we propose a novel search method based on a probabilistic subspace method and also propose a method to aggregate the expression values of the member semantic attributes that belongs to the searched subsets based on a linear transformation method via likelihood based estimation. To verify the superiority of the proposed method, we showed that the discrimination power of the feature vector generated by the proposed method is better than existing methods through experiments. And also, in a scene classification experiment, the proposed method shows a competitive classification performance compared with the conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.496-512
• /
• 2007

In this paper, we propose a novel JPEG-2000 compressed image retrieval system using feature vector extracted through partial entropy decoding. Main idea of the proposed method is to utilize the context information that is generated during entropy encoding/decoding. In the framework of JPEG-2000, the context of a current coefficient is determined depending on the pattern of the significance and/or the sign of its neighbors in three bit-plane coding passes and four coding modes. The contexts provide a model for estimating the probability of each symbol to be coded. And they can efficiently describe texture images which have different pattern because they represent the local property of images. In addition, our system can directly search the images in the JPEG-2000 compressed domain without full decompression. Therefore, our proposed scheme can accelerate the work of retrieving images. We create various distortion and similarity image databases using MIT VisTex texture images for simulation. we evaluate the proposed algorithm comparing with the previous ones. Through simulations, we demonstrate that our method achieves good performance in terms of the retrieval accuracy as well as the computational complexity.

• Management & Information Systems Review
• /
• v.4
• /
• pp.257-284
• /
• 2000

According as the drivers increase who have their cars, the comprehensive studies on the automobile for the traffic safety have been raised as the important problems. Visual Recognition System for radio-controled driving is a part of the sensor processor of Unmanned Autonomous Vehicle System. When a driver drives his car on an unknown highway or general road, it produces a model from the successively inputted road traffic information. The suggested Recognition System of the Road Traffic Safety Information Board is to recognize and distinguish automatically a Road Traffic Safety Information Board as one of road traffic information. The whole processes of Recognition System of the Road Traffic Safety Information Board suggested in this study are as follows. We took the photographs of Road Traffic Safety Information Board with a digital camera in order to get an image and normalize bitmap image file with a size of $200{\times}200$ byte with Photo Shop 5.0. The existing True Color is made up the color data of sixteen million kinds. We changed it with 256 Color, because it has large capacity, and spend much time on calculating. We have practiced works of 30 times with erosion and dilation algorithm to remove unnecessary images. We drawing out original image with the Region Splitting Technique as a kind of segmentation. We made three kinds of grouping(Attention Information Board, Prohibit Information Board, and Introduction Information Board) by RYB( Red, Yellow, Blue) color segmentation. We minimized the image size of board, direction, and the influence of rounding. We also minimized the Influence according to position. and the brightness of light and darkness with Eigen Vector and Eigen Value. The data sampling this feature value appeared after building the learning Code Book Database. The suggested Recognition System of the Road Traffic Safety Information Board firstly distinguished three kinds of groups in the database of learning Code Book, and suggested in order to recognize after comparing and judging the board want to recognize within the same group with Nearest Neighborhood Decision Making.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.424-432
• /
• 2003

In this paper, an effective method of stereo image reconstruction through the regularized adaptive disparity estimation is proposed. Althougth the conventional adaptive disparity estimation method can sharply improve the PSNR of a reconstructed stereo image, but some problems of overlapping between the matching windows and disallocation of the matching windows can be occurred, because the matching window size changes adaptively in accordance with the magnitude of feature values. Accordingly, in thia paper, a new regularized adaptive disparity estimation technique is proposed. That is, by regularizing the estimated disparity vector with the neughboring disparity vectors, problems of the conventional adaptive disparity estimated scheme might be solved, and also the predicted stereo image can be more effectively reconstructed. From some experiments using the CCETT'S stereo image pairs of 'Man' and 'Claude', it is analyzed that the proposed disparity estimation scheme can improve PSNRs of the reconstructed images to 10.89dB, 6.13dB for 'Man' and 1.41dB, 0.81dB for 'Claude' by comparing with those of the conventional pixel-based and adaptive estimation method, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2163-2170
• /
• 2009

We present an automated, energy minimized-based method for Lung parenchyma segmenting Chest Computed Tomography(CT) datasets. Deformable model is used for energy minimized segmentation. Quantitative knowledge including expected volume, shape of Chest CT provides more feature constrain to diagnosis or surgery operation planning. Segmentation subdivides an lung image into its consistent regions or objects. Depends on energy-minimizing, the level detail image of subdivision is carried. Segmentation should stop when the objects or region of interest in an application have been detected. The deformable model that has attracted the most attention to date is popularly known as snakes. Snakes or deformable contour models represent a special case of the general multidimensional deformable model theory. This is used extensively in computer vision and image processing applications, particularly to locate object boundaries, in the mean time a new type of external force for deformable models, called gradient vector flow(GVF) was introduced by Xu. Our proposed algorithm of deformable model is new external energy of GVF for exact segmentation. In this paper, Clinical material for experiments shows better results of proposal algorithm in Lung parenchyma segmentation on Chest CT.

• Journal of Broadcast Engineering
• /
• v.21 no.6
• /
• pp.913-919
• /
• 2016

In this paper, we propose the visual tracking algorithm that takes advantage of multiple random walkers. We first show the tracking method based on support vector machine as [1] and suggest a method that suppresses feature vectors extracted from backgrounds while preserve features vectors from foregrounds. We also show how to discriminate between foregrounds and backgrounds. Learned by reducing influences of backgrounds, support vector machine can clearly distinguish foregrounds and backgrounds from the image whose target objects are similar to backgrounds and occluded by another object. Thus, the algorithm can track target objects well. Furthermore, we introduce a simple method improving tracking speed. Finally, experiments validate that proposed algorithm yield better performance than the state-of-the-art trackers on the widely-used benchmark dataset with high speed.