• Journal of Bio-Environment Control
• /
• v.20 no.2
• /
• pp.63-71
• /
• 2011

Pattern recognition of a cucumber were conducted to detect directly the binary images by using thresholding method, which have the threshold level at the optimum intensity value. By restricting conditions of learning pattern, output patterns could be extracted from the same and similar input patterns by the algorithm. The algorithm of pattern recognition was developed to determine the position of the cucumber from a real image within working condition. The algorithm, designed and developed for this project, learned two, three or four learning pattern, and each learning pattern applied it to twenty sample patterns. The restored success rate of output pattern to sample pattern form two, three or four learning pattern was 65.0%, 45.0%, 12.5% respectively. The more number of learning pattern had, the more number of different out pattern detected when it was conversed. Detection of feature pattern of cucumber was processed by using auto scanning with real image of 30 by 30 pixel. The computing times required to execute the processing time of cucumber recognition took 0.5 to 1 second. Also, five real images tested, false pattern to the learning pattern is found that it has an elimination rate which is range from 96 to 98%. Some output patterns was recognized as a cucumber by the algorithm with the conditions. the rate of false recognition was range from 0.1 to 4.2%.

• Journal of Convergence for Information Technology
• /
• v.11 no.6
• /
• pp.219-225
• /
• 2021

As for the battery package method, a prismatic package method is preferred for stability reasons, but it is rapidly expanding due to the stability verification of a pouch type package. The pouch type using the lamination process has an advantage of high battery energy density because it can reduce space waste, but has a disadvantage of low productivity. Therefore, in this paper, by extracting edge detection algorithm precision, pattern algorithm precision, and motion controller recall rate by improving backlight lighting fixtures to minimize light diffusion, securing standards for stereo camera position relationship displacement monitoring, and securing standards for lens release monitoring. We propose to implement a system that ensures accuracy and reliability in positioning. As a result of the experiment, the proposed system shows an average error range of 0.032mm for edge detection, 0.02mm for pattern algorithm, and 0.014mm for motion controller, thus ensuring the accuracy and reliability of the positioning mechanism.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1807-1823
• /
• 2016

Local Binary Pattern (LBP) and its variants have powerful discriminative capabilities but most of them just consider each LBP code independently. In this paper, we propose sub oriented histograms of LBP for smoke detection and image classification. We first extract LBP codes from an image, compute the gradient of LBP codes, and then calculate sub oriented histograms to capture spatial relations of LBP codes. Since an LBP code is just a label without any numerical meaning, we use Hamming distance to estimate the gradient of LBP codes instead of Euclidean distance. We propose to use two coordinates systems to compute two orientations, which are quantized into discrete bins. For each pair of the two discrete orientations, we generate a sub LBP code map from the original LBP code map, and compute sub oriented histograms for all sub LBP code maps. Finally, all the sub oriented histograms are concatenated together to form a robust feature vector, which is input into SVM for training and classifying. Experiments show that our approach not only has better performance than existing methods in smoke detection, but also has good performance in texture classification.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.654-662
• /
• 2010

In this paper, we suggest an advanced algorithm, to recognize pedestrian/non-pedestrian using second-stage cascade method, which applies Adaboost algorithm to make a strong classification from weak classifications. First, we extract two feature vectors: (i) Histogram of Oriented Gradient (HOG) which includes gradient information and differential magnitude; (ii) Curvature-HOG which is based on four different curvature features per pixel. And then, a strong classification needs to be obtained from weak classifications for composite recognition method using both HOG and curvature-HOG. In the proposed method, we use one feature vector and one strong classification for the first stage of recognition. For the recognition-failed image, the other feature and strong classification will be used for the second stage of recognition. Based on our experiment, the proposed algorithm shows higher recognition rate compared to the traditional method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.5
• /
• pp.103-110
• /
• 2008

A reliable extraction of welded area is the precedent task before the detection of weld defects in industrial radiography. This paper describes an attempt to detect and extract the welded features of steel tubes from the computed radiography(CR) images. The statistical properties are first analyzed on over 160 sample radiographic images which represent either weld or non-weld area to identify the differences between them. The analysis is then proceeded by pattern classification to determine the clustering parameters. These parameters are the width, the functional match, and continuity. The observed weld image is processed line by line to calculate these parameters for each flexible moving window in line image pixel set. The local statistic line-clustering method is used as the classifier to recognize each window data as weld or non-weld cluster. The sequential procedure is to track the edge lines between two distinct regions by iterative calculation of threshold, and it results in extracting the weld feature. Our methodology is concluded to be effective after experiment with CR weld images.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.51-56
• /
• 2007

Feature functions were used for the classification of music. The spectral roll-off, variance, average peak level, and class were chosen to make up a feature function vector. Among these, it is the spectral roll-off function that has a low-frequency to high-frequency ratio. To find the optimal roll-off point, the roll-off points from 0.05 to 0.95 were swept. The classification success rate was monitored as the roll-off point was being changed. The data that were used for the experiments were taken from the sounds made by a modern violin and a baroque one. Their shapes and sounds are similar, but they differ slightly in sound texture. As such, the data obtained from the sounds of these two kinds of violin can be useful in finding an adequate roll-off point. The optimal roll-off point, as determined through the experiment, was 0.85. At this point, the classification success rate was 85%, which was the highest.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.21-26
• /
• 2011

Feature ranking is useful to gain knowledge of data and identify relevant features. In this study, we proposed a use of feature ranking for classification of neuro-degeneration and vascular dementia in micro-Raman spectra of platelet. The entire region of the spectrum is divided into local region including several peaks, followed by Gaussian curve fitting method in the region to be modeled. Local minima select from the subregion and then remove the background based on the position by using interpolation method. After preprocessing steps, significant features were selected by feature ranking method to improve the classification accuracy and the computational complexity of classification system. PCA (principal component analysis) transform the selected features and the overall features that is used classification with the number of principal components. These were classified as MAP (maximum a posteriori) and it compared with classification result using overall features. In all experiments, the computational complexity of the classification system was remarkably reduced and the classification accuracy was partially increased. Particularly, the proposed method increased the classification accuracy in the experiment classifying the Parkinson's disease and normal with the average 1.7 %. From the result, it confirmed that proposed method could be efficiently used in the classification system of the neuro-degenerative disease and vascular dementia of platelet.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.7
• /
• pp.519-527
• /
• 2003

Speech is much influenced by the existence of outliers which are introduced by such an unexpected happenings as additive background noise, change of speaker's utterance pattern and voice detection errors. These kinds of outliers may result in severe degradation of speaker recognition performance. In this paper, we proposed the GMM based on robust principal component analysis (RPCA-GMM) using M-estimation to solve the problems of both ouliers and high dimensionality of training feature vectors in speaker identification. Firstly, a new feature vector with reduced dimension is obtained by robust PCA obtained from M-estimation. The robust PCA transforms the original dimensional feature vector onto the reduced dimensional linear subspace that is spanned by the leading eigenvectors of the covariance matrix of feature vector. Secondly, the GMM with diagonal covariance matrix is obtained from these transformed feature vectors. We peformed speaker identification experiments to show the effectiveness of the proposed method. We compared the proposed method (RPCA-GMM) with transformed feature vectors to the PCA and the conventional GMM with diagonal matrix. Whenever the portion of outliers increases by every 2%, the proposed method maintains almost same speaker identification rate with 0.03% of little degradation, while the conventional GMM and the PCA shows much degradation of that by 0.65% and 0.55%, respectively This means that our method is more robust to the existence of outlier.

• Korean Journal of Remote Sensing
• /
• v.36 no.1
• /
• pp.15-27
• /
• 2020

Accurate knowledge of land use/land cover (LULC) features and their relative changes over upon the time are essential for sustainable urban management. Urban sprawl growth has been always also a worldwide concern that needs to carefully monitor particularly in a developing country where unplanned building constriction has been expanding at a high rate. Recently, remotely sensed imageries with a very high spatial/spectral resolution and state of the art machine learning approaches sent the urban classification and growth monitoring to a higher level. In this research, we classified the Quickbird satellite imagery by object-based image analysis of Dempster-Shafer (OBIA-DS) for the years of 2002 and 2015 at Karbala-Iraq. The real LULC changes including, residential sprawl expansion, amongst these years, were identified via change detection procedure. In accordance with extracted features of LULC and detected trend of urban pattern, the future LULC dynamic was simulated by using land transformation model (LTM) in geospatial information system (GIS) platform. Both classification and prediction stages were successfully validated using ground control points (GCPs) through accuracy assessment metric of Kappa coefficient that indicated 0.87 and 0.91 for 2002 and 2015 classification as well as 0.79 for prediction part. Detail results revealed a substantial growth in building over fifteen years that mostly replaced by agriculture and orchard field. The prediction scenario of LULC sprawl development for 2030 revealed a substantial decline in green and agriculture land as well as an extensive increment in build-up area especially at the countryside of the city without following the residential pattern standard. The proposed method helps urban decision-makers to identify the detail temporal-spatial growth pattern of highly populated cities like Karbala. Additionally, the results of this study can be considered as a probable future map in order to design enough future social services and amenities for the local inhabitants.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.6
• /
• pp.800-807
• /
• 2016

We propose a fast algorithm using Extreme Contour Point (ECP) to detect the angle of rotated images, is implemented by rotation feature of one covered frame image that can be applied to correct the rotated images like in image processing for real time applications, while CORDIC is inefficient to calculate various points like high definition image since it is only possible to detect rotated angle between one point and the other point. The two advantages of this algorithm, namely compatibility to images in preprocessing by using Sobel edge process for pattern recognition. While the other one is its simplicity for rotated angle detection with cyclic shift of two $1{\times}n$ matrix set without complexity in calculation compared with CORDIC algorithm. In ECP, the edge features of the sample image of gray scale were determined using the Sobel Edge Process. Then, it was subjected to binary code conversion of 0 or 1 with circular boundary to constitute the rotation in invariant conditions. The results were extracted to extreme points of the binary image. Its components expressed not just only the features of angle ${\theta}$ but also the square of radius $r^2$ from the origin of the image. The detected angle of this algorithm is limited only to an angle below 10 degrees but it is appropriate for real time application because it can process a 200 degree with an assumption 20 frames per second. ECP algorithm has an O ($n^2$) in Big O notation that improves the execution time about 7 times the performance if CORDIC algorithm is used.