• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.33 no.6
• /
• pp.496-500
• /
• 2000

Partial fragments of nuclear 185 rDNAs from morphologically wide and narrow thalli of the seaweed Porphyra pseudolineazis were amplified and sequenced to compare their DNA homology. Both sequences of 311 base pairs showed $100{\%}$ identical each other. They showed $97.7{\%}$ similarity with a wild strain collected at Sodol in Kangwondo, and $99.4{\%}$ similarity with the GenBank accession number AB013185 of the Japanese P. pseudolinearis. Thus the morphological difference of wide and narrow blades might not be a classification criterion for the sub-species level of P. pseudolinearis.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.6_2
• /
• pp.665-672
• /
• 2012

Amid rapidly increasing imagery inputs and their volume in a remote sensing imagery database, Content-Based Image Retrieval (CBIR) is an effective tool to search for an image feature or image content of interest a user wants to retrieve. It seeks to capture salient features from a 'query' image, and then to locate other instances of image region having similar features elsewhere in the image database. For a CBIR approach that uses texture as a primary feature primitive, designing a texture descriptor to better represent image contents is a key to improve CBIR results. For this purpose, an extended feature vector combining the Gabor filter and co-occurrence histogram method is suggested and evaluated for quantitywise and qualitywise retrieval performance criterion. For the better CBIR performance, assessing similarity between high dimensional feature vectors is also a challenging issue. Therefore a number of distance metrics (i.e. L1 and L2 norm) is tried to measure closeness between two feature vectors, and its impact on retrieval result is analyzed. In this paper, experimental results are presented with several CBIR samples. The current results show that 1) the overall retrieval quantity and quality is improved by combining two types of feature vectors, 2) some feature is better retrieved by a specific feature vector, and 3) retrieval result quality (i.e. ranking of retrieved image tiles) is sensitive to an adopted similarity metric when the extended feature vector is employed.

• Korean Journal of Remote Sensing
• /
• v.31 no.1
• /
• pp.1-9
• /
• 2015

Mobility and cloud platform have become the dominant paradigm to develop web services dealing with huge and diverse digital contents for scientific solution or engineering application. These two trends are technically combined into mobile cloud computing environment taking beneficial points from each. The intention of this study is to design and implement a mobile cloud application for remotely sensed image fusion for the further practical geo-based mobile services. In this implementation, the system architecture consists of two parts: mobile web client and cloud application server. Mobile web client is for user interface regarding image fusion application processing and image visualization and for mobile web service of data listing and browsing. Cloud application server works on OpenStack, open source cloud platform. In this part, three server instances are generated as web server instance, tiling server instance, and fusion server instance. With metadata browsing of the processing data, image fusion by Bayesian approach is performed using functions within Orfeo Toolbox (OTB), open source remote sensing library. In addition, similarity of fused images with respect to input image set is estimated by histogram distance metrics. This result can be used as the reference criterion for user parameter choice on Bayesian image fusion. It is thought that the implementation strategy for mobile cloud application based on full open sources provides good points for a mobile service supporting specific remote sensing functions, besides image fusion schemes, by user demands to expand remote sensing application fields.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.2
• /
• pp.15-23
• /
• 2021

Most of the open-source decision tree algorithms are based on three splitting criteria (Entropy, Gini Index, and Gain Ratio). Therefore, the advantages and disadvantages of these three popular algorithms need to be studied more thoroughly. Comparisons of the three algorithms were mainly performed with respect to the predictive performance. In this work, we conducted a comparative experiment on the splitting criteria of three decision trees, focusing on their interpretability. Depth, homogeneity, coverage, lift, and stability were used as indicators for measuring interpretability. To measure the stability of decision trees, we present a measure of the stability of the root node and the stability of the dominating rules based on a measure of the similarity of trees. Based on 10 data collected from UCI and Kaggle, we compare the interpretability of DT (Decision Tree) algorithms based on three splitting criteria. The results show that the GR (Gain Ratio) branch-based DT algorithm performs well in terms of lift and homogeneity, while the GINI (Gini Index) and ENT (Entropy) branch-based DT algorithms performs well in terms of coverage. With respect to stability, considering both the similarity of the dominating rule or the similarity of the root node, the DT algorithm according to the ENT splitting criterion shows the best results.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.2
• /
• pp.113-121
• /
• 2011

In this paper, we proposed the method automatically to match areal feature based on similarity using spatial information. For this, we extracted candidate matching pairs intersected between two different spatial datasets, and then measured a shape similarity, which is calculated by an weight sum method of each matching criterion automatically derived from CRITIC method. In this time, matching pairs were selected when similarity is more than a threshold determined by outliers detection of adjusted boxplot from training data. After applying this method to two distinct spatial datasets: a digital topographic map and street-name address base map, we conformed that buildings were matched, that shape is similar and a large area is overlaid in visual evaluation, and F-Measure is highly 0.932 in statistical evaluation.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.36-39
• /
• 2003

This paper proposes a simultaneous application of homogeneity analysis and fuzzy clustering with in complete data. Taking the similarity between the loss of homogeneity in homogeneity analysis and the least squares criterion in principal component analysis into account, the new objective function is defined in a similar formulation to the linear fuzzy clustering with missing values. Numerical experiment shows the characteristic properties of the proposed method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.5
• /
• pp.596-599
• /
• 2003

In this paper, a new asymptotic stability condition of continuous fuzzy system is proposed. The new stability condition considers the nonquadratic stability by using the P-matrix measure. Later the relationship of the suggested stability condition and the well-known stability condition is discussed and it is shown in a rigorous manner that the proposed criterion includes the conventional conditions.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.71-78
• /
• 2009

An element of a ring R with identity is called strongly clean if it is the sum of an idempotent and a unit that commute, and R is called strongly clean if every element of R is strongly clean. Let R be a noncommutative local ring, a criterion in terms of solvability of a simple quadratic equation in R is obtained for $M_2$(R) to be strongly clean.

• The Journal of the Korea Contents Association
• /
• v.7 no.6
• /
• pp.22-30
• /
• 2007

Most real word systems such as world economy, stock market, and medical applications, contain a series of dynamic and complex phenomena. One of common methods to understand these systems is to build a model and analyze the behavior of the system. In this paper, we investigated methods for best clustering over time series data. As a first step for clustering, BIC (Bayesian Information Criterion) approximation is used to determine the number of clusters. A search technique to improve clustering efficiency is also suggested by analyzing the relationship between data size and BIC values. For clustering, two methods, model-based and similarity based methods, are analyzed and compared. A number of experiments have been performed to check its validity using real data(stock price). BIC approximation measure has been confirmed that it suggests best number of clusters through experiments provided that the number of data is relatively large. It is also confirmed that the model-based clustering produces more reliable clustering than similarity based ones.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.3
• /
• pp.287-293
• /
• 2012

This paper presents an efficient image registration method by measuring the similarity, which is based on multi-dimensional intensity fluctuation. Multi-dimensional intensity which considers 4 directions of the image, is applied to reflect more properties in similarity decision. And an intensity fluctuation is also applied to measure comprehensively the similarity by considering a change in brightness between the adjacent pixels of image. The normalized cross-correlation(NCC) is calculated by considering an intensity fluctuation to each of 4 directions. The 5 correlation coefficients based on the NCC have been used to measure the registration, which are total NCC, the arithmetical mean and a simple product on the correlation coefficient of each direction and on the normalized correlation coefficient by the maximum NCC, respectively. The proposed method has been applied to the problem for registrating the 22 face images of 243*243 pixels and the 9 person images of 500*500 pixels, respectively. The experimental results show that the proposed method has a superior registration performance that appears the image properties well. Especially, the arithmetical mean on the correlation coefficient of each direction is the best registration measure.