• 대한원격탐사학회지
• /
• 제36권1호
• /
• pp.55-65
• /
• 2020

Image classification needs the spectral similarity comparison between spectral features of each pixel and the representative spectral features of each class. The spectral similarity is obtained by computing the spectral feature vector distance between the pixel and the class. Each spectral feature contributes differently in the image classification depending on the class separability of the spectral feature, which is computed using a suitable vector distance measure such as the Bhattacharyya distance. We propose a method to determine the weight value of each spectral feature in the computation of feature vector distance for the similarity measurement. The weight value is determined by the ratio between each feature separability value to the total separability values of all the spectral features. We created ten spectral features consisting of seven bands of Landsat-8 OLI image and three indices, NDVI, NDWI and NDBI. For three experimental test sites, we obtained the overall accuracies between 95.0% and 97.5% and the kappa coefficients between 90.43% and 94.47%.

• Earthquakes and Structures
• /
• 제25권5호
• /
• pp.325-342
• /
• 2023

The damping modification factor (DMF) is used to modify the 5%-damped response spectrum to produce spectral values that correspond to other necessary damping ratios for seismic design. The DMF has been the subject of numerous studies, and it has been discovered that seismological parameters like magnitude and distance can have an impact on it. However, DMF formulations incorporating these seismological parameters cannot be directly applied to seismic design because these parameters are not specified in the present seismic codes. The goal of this study is to develop a formulation for the DMF that can be directly applied in seismic design and that takes the effects of magnitude, distance, and site conditions into account. To achieve this goal, 16660 ground motions with magnitudes ranging from 4 to 9 and epicentral distances ranging from 10 to 200 km are used to systematically study the effects of magnitude, distance, and site conditions on the DMF. Furthermore, according to the knowledge that magnitude and distance affect the DMF primarily by changing the spectral shape, a spectral shape factor is adopted to reflect influences of magnitude and distance, and a new formulation for the DMF incorporating the spectral shape factor is developed. In comparison to the current formulations, the proposed formulation provides a more accurate prediction of the DMF and can be employed directly in seismic design.

• 한국군사과학기술학회지
• /
• 제14권6호
• /
• pp.1073-1080
• /
• 2011

In this study, a target detection algorithm was proposed for using hyperspectral imagery. The proposed algorithm is designed to have minimal processing time, low false alarm rate, and flexible threshold selection. The target detection procedure can be divided into two steps. Initially, candidates of target pixel are extracted using matching ratio of spectral pattern that can be calculated by spectral derivation. Secondly, spectral distance is computed only for those candidates using Euclidean distance. The proposed two-step method showed lower false alarm rate than the Euclidean distance detector applied over the whole image. It also showed much lower processing time as compared to the Mahalanobis distance detector.

• 대한수학회보
• /
• 제59권4호
• /
• pp.1045-1067
• /
• 2022

Given a graph G, a {1, 3, …, 2n-1}-factor of G is a spanning subgraph of G, in which each degree of vertices is one of {1, 3, …, 2n-1}, where n is a positive integer. In this paper, we first establish a lower bound on the size (resp. the spectral radius) of G to guarantee that G contains a {1, 3, …, 2n-1}-factor. Then we determine an upper bound on the distance spectral radius of G to ensure that G has a {1, 3, …, 2n-1}-factor. Furthermore, we construct some extremal graphs to show all the bounds obtained in this contribution are best possible.

• 한국지진공학회논문집
• /
• 제20권1호
• /
• pp.45-54
• /
• 2016

This study suggests a prediction model of ground motion spectral shape considering characteristics of earthquake records in Korea. Based on the Graizer and Kalkan's prediction procedure, a spectral shape model is defined as a continuous function of period in order to improve the complex problems of the conventional models. The approximate spectral shape function is then developed with parameters such as moment magnitude, fault distance, and average shear velocity of independent variables. This paper finally determines estimator coefficients of subfunctions which explain the corelation among the independent variables using the nonlinear optimization. As a result of generating the prediction model of ground motion spectral shape, the ground motion spectral shape well estimates the response spectrum of earthquake recordings in Korea.

• 전자공학회논문지B
• /
• 제33B권4호
• /
• pp.174-182
• /
• 1996

In continuous speech recognition system, it is possible to implement the system which can handle unlimited number of words by using limited number of phonetic units such as phonemes. Dividing continuous speech into the string of tems of phonemes prior to recognition process can lower the complexity of the system. But because of the coarticulations between neiboring phonemes, it is very difficult ot extract exactly their boundaries. In this paper, we propose the algorithm ot extract short terms which can represent each phonemes instead of extracting their boundaries. The short terms of lower spectral change and higher spectral chang eare detcted. Then phoneme changes are detected using distance measure with this lower spectral change terms, and hgher spectral change terms are regarded as transition terms or short phoneme terms. Finally lower spectral change terms and the mid-term of higher spectral change terms are regarded s the represent each phonemes. The cepstral coefficients and weighted cepstral distance are used for speech feature and measuring the distance because of less computational complexity, and the speech data used in this experimetn was recoreded at silent and ordinary in-dorr environment. Through the experimental results, the proposed algorithm showed higher performance with less computational complexity comparing with the conventional segmetnation algorithms and it can be applied usefully in phoneme-based continuous speech recognition.

• Korean Journal of Geomatics
• /
• 제5권1호
• /
• pp.27-34
• /
• 2005

Unsupervised classification is an important area of research in image processing because supervised classification has the disadvantages such as long task-training time and high cost and low objectivity in training information. This paper focuses on unsupervised classification, which can extract ground object information with the minimum 'Spectral Angle Distance' operation on be behalf of 'Spectral Euclidian Distance' in the clustering process. Unlike previous studies, our algorithm uses the unit vector, not the spectral distance, to compute the cluster mean, and the Single-Pass algorithm automatically determines the seed points. Atmospheric correction for more accurate results was adapted on the Hyperion data and the results were analyzed. We applied the algorithm to the Hyperion and ETM+ data and compared the results with K-Means and the former USAM algorithm. From the result, USAM classified the water and dark forest area well and gave more accurate results than K-Means, so we believe that the 'Spectral Angle' can be one of the most accurate classifiers of not only multispectral images but hyperspectral images. And also the unit vector can be an efficient technique for characterizing the Remote Sensing data.

• 대한음성학회지:말소리
• /
• 제56호
• /
• pp.225-235
• /
• 2005

Speech unit concatenation with a large database is presently the most popular method for speech synthesis. In this approach, the mismatches at the unit boundaries are unavoidable and become one of the reasons for quality degradation. This paper proposes an algorithm to reduce undesired discontinuities between the subsequent units. Optimal matching points are calculated in two steps. Firstly, the fullback-Leibler distance measurement is utilized for the spectral matching, then the unit sliding and the overlap windowing are used for the waveform matching. The proposed algorithm is implemented for the corpus-based unit concatenating Korean text-to-speech system that has an automatically labeled database. Experimental results show that our algorithm is fairly better than the raw concatenation or the overlap smoothing method.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.134-137
• /
• 2005

Unsupervised spectral angle classification (USAC) is the algorithm that can extract ground object information with the minimum 'Spectral Angle' operation on behalf of 'Spectral Euclidian Distance' in the clustering process. In this study, our algorithm uses the unit vector instead of the spectral distance to compute the mean of cluster in the unsupervised classification. The proposed algorithm (MUSAC) is applied to the Hyperion and ETM+ data and the results are compared with K-Meails and former USAC algorithm (FUSAC). USAC is capable of clearly classifying water and dark forest area and produces more accurate results than K-Means. Atmospheric correction for more accurate results was adapted on the Hyperion data (Hyperion-FLAASH) but the results did not have any effect on the accuracy. Thus we anticipate that the 'Spectral Angle' can be one of the most accurate classifiers of not only multispectral images but also hyperspectral images. Furthermore the cluster unit vector can be an efficient technique for determination of each cluster mean in the USAC.

• Journal of Information Processing Systems
• /
• 제20권2호
• /
• pp.185-199
• /
• 2024

In this paper, an improved automated spectral clustering (IASC) algorithm is proposed to address the limitations of the traditional spectral clustering (TSC) algorithm, particularly its inability to automatically determine the number of clusters. Firstly, a cluster number evaluation factor based on the optimal clustering principle is proposed. By iterating through different k values, the value corresponding to the largest evaluation factor was selected as the first-rank number of clusters. Secondly, the IASC algorithm adopts a density-sensitive distance to measure the similarity between the sample points. This rendered a high similarity to the data distributed in the same high-density area. Thirdly, to improve clustering accuracy, the IASC algorithm uses the cosine angle classification method instead of K-means to classify the eigenvectors. Six algorithms-K-means, fuzzy C-means, TSC, EIGENGAP, DBSCAN, and density peak-were compared with the proposed algorithm on six datasets. The results show that the IASC algorithm not only automatically determines the number of clusters but also obtains better clustering accuracy on both synthetic and UCI datasets.