• Journal of the Korea institute for structural maintenance and inspection
• /
• v.24 no.6
• /
• pp.77-84
• /
• 2020

In this paper, we developed a damage evaluation technique that can determine the damage location of a long-sized structure such as a cable-stayed bridge, and verified the performance of the developed technique through experiments. The damage assessment method aims to extract data that can evaluate the damage of the structure without the undamage data and can determine the damage location only by analyzing the response data of the structure. To complete this goal, we developed a damage assessment technique that considers variability based on the IMD theory, which is a statistical pattern recognition technique, to identify the damage location. To complete this goal, we developed a damage assessment technique that considers variability based on the IMD theory, which is a statistical pattern recognition technique, to identify the damage location. To evaluate the performance of the developed technique experimentally, cable damage experiments were conducted on model cable-stayed bridges. As a result, the damage assessment method considering variability automatically outputs the damageless data according to external force, and it is confirmed that the performance of extracting information that can determine the damage location of the cable through the analysis of the outputted damageless data and the measured damage data is shown.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.2
• /
• pp.507-513
• /
• 2004

Least-squares support vector machine (LS-SVM) has been very successful in pattern recognition and function estimation problems for crisp data. In this paper, we propose LS-SVM approach to evaluating fuzzy regression model with multiple crisp inputs and a Gaussian fuzzy output. The proposed algorithm here is model-free method in the sense that we do not need assume the underlying model function. Experimental result is then presented which indicate the performance of this algorithm.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.2
• /
• pp.449-455
• /
• 2004

Support vector machine (SVM) has been very successful in pattern recognition and function estimation problems for crisp data. This paper proposes a new method to evaluate interval regression models for crisp input-output data. The proposed method is based on quadratic loss SVM, which implements quadratic programming approach giving more diverse spread coefficients than a linear programming one. The proposed algorithm here is model-free method in the sense that we do not have to assume the underlying model function. Experimental result is then presented which indicate the performance of this algorithm.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.1
• /
• pp.1-9
• /
• 2015

Template matching is used for many applications in image processing. One of the most researched topics is object tracking. Normalized Cross Correlation (NCC) is the basic statistical approach to match images. NCC is used for template matching or pattern recognition. A template can be considered from a reference image, and an image from a scene can be considered as a source image. The objective is to establish the correspondence between the reference and source images. The matching gives a measure of the degree of similarity between the image and the template. A problem with NCC is its high computational cost and occasional mismatching. To deal with this problem, this paper presents an algorithm based on the Sum of Squared Difference (SSD) and an adaptive template matching to enhance the quality of the template matching in object tracking. The SSD provides low computational cost, while the adaptive template matching increases the accuracy matching. The experimental results showed that the proposed algorithm is quite efficient for image matching. The effectiveness of this method is demonstrated by several situations in the results section.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.178-185
• /
• 2009

A signal processing algorithm is proposed for end point detection which is used commonly in accelerometers-based pattern recognition problem. In the conventional method, end points are detected by manual manipulation with an additive button or algorithm based on statistical computation and highpass filtering to cause critical time delay and difficulty for parameters optimization. As an solution, we propose a focused Time Lagged Feedforward Network(TLFN) with respect to a differential signal of acceleration, which is widely applied for time series forecasting. The simple experiment is conducted with handwriting and the detection performance and response characteristic of the proposed algorithm is tested and analyzed.

• Journal of Multimedia Information System
• /
• v.7 no.2
• /
• pp.97-106
• /
• 2020

The subjective experience would degrade the current artificial artistic aesthetic analysis. Since Qiong kiln ceramics have a long history and occupy a very important position in ceramic arts, we employed computer-aided technologies to quickly automatically accurately and quantitatively process a large number of Qiong kiln ceramic images and generate the detailed statistical data. Because the color features are simple and significant visual characteristics, the color features of Qiong kiln ceramics are analyzed for the quantitative aesthetics. The Qiong kiln ceramic images are segmented with GrabCut algorithm. Three moments (1st-order, 2nd-order, and 3rd-order) are calculated in two typical color spaces, namely RGB and HSV. The discrimination powers of the color features are analyzed according to various dynasties (Tang Dynasty, Five Dynasties, Song Dynasty) and various utensils (Pot, kettle, bowl), which are helpful to the selection of the discriminant color features among various dynasties and utensils. This paper is helpful to promoting the quantitative aesthetic research of Qiong kiln ceramics and is also conducive to the research on the aesthetics of other ceramics.

• The Korean Journal of Applied Statistics
• /
• v.13 no.2
• /
• pp.447-455
• /
• 2000

We propose a weighted kernel pattern recognition method using the K -means clustering algorithm to reduce computation and storage required for the full kernel classifier. This technique finds a set of reference vectors and weights which are used to approximate the kernel classifier. Since the hierarchical clustering method implemented in the 'Weighted Parzen Window (WP\V) classifier is not able to rearrange the proper clusters, we adopt the K -means algorithm to find reference vectors and weights from the more properly rearranged clusters \Ve find that the proposed method outperforms the \VP\V method for the repre~entativeness of the reference vectors and the data reduction.

• The KIPS Transactions:PartB
• /
• v.13B no.7 s.110
• /
• pp.689-698
• /
• 2006

Pattern recognition is the study of how machines can observe the environment, learn to distinguish patterns of interest from their background, and make sound and reasonable decisions about the categories of the patterns. Color image consists of various color patterns. And most pattern recognition methods use the information of color which has been trained and extract the feature of the color. This thesis extracts adaptively specific color feature from images with several limited colors. Because the number of the color patterns is limited, the distribution of the color in the image is similar. But, when there are some noises and distortions in the image, its distribution can be various. Therefore we cannot extract specific color regions in the standard image that is well expressed in special color patterns to extract, and special color regions of the image to test. We suggest new method to reduce the error of recognition by extracting the specific color feature adaptively for images with the low distortion, and six test images with some degree of noises and distortion. We consequently found that proposed method shouws more accurate results than those of statistical pattern recognition.

• The KIPS Transactions:PartB
• /
• v.18B no.5
• /
• pp.271-278
• /
• 2011

Storm and flood such as torrential rains and major typhoons has often caused damages on a large scale in Korea and damages from storm and flood have been increasing by climate change and warming. Therefore, it is an essential work to maneuver preemptively against risks and damages from storm and flood by predicting the possibility and scale of the disaster. Generally the research on numerical model based on statistical methods, the KDF model of TCDIS developed by NIDP, for analyzing and predicting disaster risks and damages has been mainstreamed. In this paper, we introduced the model for prediction of damage cost from storm and flood by the neural network algorithm which outstandingly implements the pattern recognition. Also, we compared the performance of the neural network model with that of KDF model of TCDIS. We come to the conclusion that the robustness and accuracy of prediction of damage cost on TCDIS will increase by adapting the neural network model rather than the KDF model.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.3E
• /
• pp.80-86
• /
• 2007

In this paper, we utilize generalized warped filterbanks to improve the performance of speaker recognition systems. At first, the performance of speaker identification systems is analyzed by varying the type of warped filterbanks. Based on the results that the error pattern of recognition system is different depending on the type of filterbank used, we combine the likelihood values of the statistical models that consist of the features extracting from multiple warped filterbanks. Simulation results with TIMIT and NTIMIT database verify that the proposed system shows relative improvement of identification rate by 31.47% and 15.14% comparing it to the conventional system.