• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.507-512
• /
• 2001

Feature-based similarity has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects. the performance of conventional multidimensional data structures tends to deteriorate as the number of dimensions of feature vectors increase. The $R^{*}-Tree$ is the most successful variant of the R-Tree. In this paper, we propose a SOM-based $R^{*}-Tree$ as a new indexing method for high-dimensional feature vectors. The SOM-based $R^{*}-Tree$ combines SOM and $R^{*}-Tree$ to achieve search performance more scalable to high-dimensionalties. Self-Organizingf Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two-dimensional space. The map is called a topological feature map, and preserves the mutual relationships (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. We experimentally compare the retrieval time cost of a SOM-based $R^{*}-Tree$ with of an SOM and $R^{*}-Tree$ using color feature vectors extracted from 40,000 images. The results show that the SOM-based $R^{*}-Tree$ outperform both the SOM and $R^{*}-Tree$ due to reduction of the number of nodes to build $R^{*}-Tree$ and retrieval time cost.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.3 no.1
• /
• pp.57-72
• /
• 2008

Serve and do so that graft together specialists' view application field of computer and developmental disability diagnosis estimation data to construct developmental disability diagnosis estimation system in this Paper and constructed developmental disability diagnosis estimation system. Developmental disability diagnosis estimation must supply information of specification area that specialists are having continuously. Developmental disability diagnosis estimation specialist system need multimedia data processing that is specialized little more for developmental disability classification diagnosis and decision-making and is atomized for this. Characteristic of developmental disability diagnosis estimation system that study in this paper can supply quick feedback about result, and can reduce mistake on recording and calculation as well as can shorten examination's enforcement time, and background of training is efficient system fairly in terms of nonprofessional who is not many can use easily. But, as well as when multimedia information that is essential data of system construction for developmental disability diagnosis estimation is having various kinds attribute and a person must achieve description about all developmental disability diagnosis estimation informations, great amount of work done is accompanied, technology about equal data can become different according to management. Because of these problems, applied search technology of contents base (Content-based) that search connection information by contents of edit target data for developmental disability diagnosis estimation data processing multimedia data processing technical development. In the meantime, typical access way for conversation style data processing to support fast image search, after draw special quality of data by N-dimension vector, store to database regarding this as value of N dimension and used data structure of Tree techniques to use index structure that search relevant data based on this costs. But, these are not coincided correctly in purpose of developmental disability diagnosis estimation because is developed focusing in application field that use data of low dimension such as original space DataBase or geography information system. Therefore, studied save structure and index mechanism of new way that support fast search to search bulky good physician data.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.187-198
• /
• 2004

The World-Wide Web is the largest distributed Information space and has grown to encompass diverse information resources. However, although Web is growing exponentially, the individual's capacity to read and digest contents is essentially fixed. From the view point of Web users, they can be confused by explosion of Web information, by constantly changing Web environments, and by lack of understanding needs of Web users. In these Web environments, mining traversal patterns is an important problem in Web mining with a host of application domains including system design and Information services. Conventional traversal pattern mining systems use the inter-pages association in sessions with only a very restricted mechanism (based on vector or matrix) for generating frequent k-Pagesets. We develop a family of novel algorithms (termed WebPR - Web Page Recommend) for mining frequent traversal patterns and then pageset to recommend. Our algorithms provide Web users with new page views, which Include pagesets to recommend, so that users can effectively traverse its Web site. The main distinguishing factors are both a point consistently spanning schemes applying inter-pages association for mining frequent traversal patterns and a point proposing the most efficient tree model. Our experimentation with two real data sets, including Lady Asiana and KBS media server site, clearly validates that our method outperforms conventional methods.

• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.595-604
• /
• 2004

Automatic analysis of concepts or semantic relations from text documents enables not only an efficient acquisition of relevant information, but also a comparison of documents in the concept level. We present a multiple cause model-based approach to text analysis, where latent topics are automatically extracted from document sets and similarity between documents is measured by semantic kernels constructed from the extracted topics. In our approach, a document is assumed to be generated by various combinations of underlying topics. A topic is defined by a set of words that are related to the same topic or cooccur frequently within a document. In a network representing a multiple-cause model, each topic is identified by a group of words having high connection weights from a latent node. In order to facilitate teaming and inferences in multiple-cause models, some approximation methods are required and we utilize an approximation by Helmholtz machines. In an experiment on TDT-2 data set, we extract sets of meaningful words where each set contains some theme-specific terms. Using semantic kernels constructed from latent topics extracted by multiple cause models, we also achieve significant improvements over the basic vector space model in terms of retrieval effectiveness.

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.434-445
• /
• 2009

Content-based image retrieval(CBIR) is the retrieval technique which uses the contents of images. However, in contrast to text data, multimedia data are ambiguous and there is a big difference between system's low-level representation and human's high-level concept. So it doesn't always mean that near points in the vector space are similar to user. We call this the semantic-gap problem. Due to this problem, performance of image retrieval is not good. To solve this problem, the relevance feedback(RF) which uses user's feedback information is used. But existing RF doesn't consider user's region-of-interest(ROI), and therefore, irrelevant regions are used in computing new query points. Because the system doesn't know user's ROI, RF is proceeded in the image-level. We propose a new ROI RF method which guides a user to select ROI from relevant images for the retrieval of complex satellite image, and this improves the accuracy of the image retrieval by computing more accurate query points in this paper. Also we propose a pruning technique which improves the accuracy of the image retrieval by using images not selected by the user in this paper. Experiments show the efficiency of the proposed ROI RF and the pruning technique.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.581-591
• /
• 2005

Collaborative filtering systems have problems involving sparsity and the provision of recommendations by making correlations between only two users' preferences. These systems recommend items based only on the preferences without taking in to account the contents of the items. As a result, the accuracy of recommendations depends on the data from user-rated items. When users rate items, it can be expected that not all users ran do so earnestly. This brings down the accuracy of recommendations. This paper proposes a collaborative recommendation method for extracting typical group preferences using user-item matrix optimization and user profiles in collaborative tittering systems. The method excludes unproven users by using entropy based on data from user-rated items and groups users into clusters after generating user profiles, and then extracts typical group preferences. The proposed method generates collaborative user profiles by using association word mining to reflect contents as well as preferences of items and groups users into clusters based on the profiles by using the vector space model and the K-means algorithm. To compensate for the shortcoming of providing recommendations using correlations between only two user preferences, the proposed method extracts typical preferences of groups using the entropy theory The typical preferences are extracted by combining user entropies with item preferences. The recommender system using typical group preferences solves the problem caused by recommendations based on preferences rated incorrectly by users and reduces time for retrieving the most similar users in groups.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.706-714
• /
• 2012

The Korea Meteorological Administration provided the recent four-years records of weather dataset for our very short-term heavy rainfall prediction. We divided the dataset into three parts: train, validation and test set. Through feature selection, we select only important features among 72 features to avoid significant increase of solution space that arises when growing exponentially with the dimensionality. We used a differential evolution algorithm and two classifiers as the fitness function of evolutionary computation to select more accurate feature subset. One of the classifiers is Support Vector Machine (SVM) that shows high performance, and the other is k-Nearest Neighbor (k-NN) that is fast in general. The test results of SVM were more prominent than those of k-NN in our experiments. Also we processed the weather data using undersampling and normalization techniques. The test results of our differential evolution algorithm performed about five times better than those using all features and about 1.36 times better than those using a genetic algorithm, which is the best known. Running times when using a genetic algorithm were about twenty times longer than those when using a differential evolution algorithm.

• Korean Journal of Remote Sensing
• /
• v.37 no.3
• /
• pp.503-514
• /
• 2021

Rice production with adequate level of area is important for decision making of rice supply and demand policy. It is essential to grasp rice cultivation areas in advance for estimating rice production of the year. This study was carried out to classify paddy rice cultivation in Gimje-si using sentinel-1 SAR (synthetic aperture radar) and UAV imagery in early July. Time-series Sentinel-1A and 1B images acquired from early May to early July were processed to convert into sigma naught (dB) images using SNAP (SeNtinel application platform, Version 8.0) toolbox provided by European Space Agency. Farm map and parcel map, which are spatial data of vector polygon, were used to stratify paddy field population for classifying rice paddy cultivation. To distinguish paddy rice from other crops grown in the paddy fields, we used the decision tree method using threshold levels and random forest model. Random forest model, trained by mainly rice cultivation area and rice and soybean cultivation area in UAV image area, showed the best performance as overall accuracy 89.9%, Kappa coefficient 0.774. Through this, we were able to confirm the possibility of early estimation of rice cultivation area in Gimje-si using UAV image.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.1A
• /
• pp.31-43
• /
• 2009

In this study, the numerical method is presented, which can consider the various train types and can solve the equations of motion for a vehicle-bridge interaction analysis by non-iteration procedure through formulating the coupled equations of motion. The coupled equations of motion for the vehicle-bridge interaction are solved by the Newmark ${\beta}$ of a direct integration method, and by composing the effective stiffness matrix and the effective force vector according to a analysis step, those can be solved with the same manner of the solving procedure of equilibrium equations in static analysis. Also, the effective stiffness matrix is reconstructed by the Skyline method for increasing the analysis effectiveness. The Cholesky's matrix decomposition scheme is applied to the analysis procedure for minimizing the numerical errors that can be generated in directly calculating the inverse matrix. The equations of motion for the conventional trains are derived, and the numerical models of the conventional trains are idealized by a set of linear springs and dashpots with 16 degrees of freedom. The bridge models are simplified by the 3 dimensional space frame element which is based on the Euler-Bernoulli theory. The rail irregularities of vertical and lateral directions are generated by the PSD functions of the Federal Railroad Administration (FRA). The results of the vehicle-bridge interaction analysis are verified by the experimental results for the railway plate girder bridges of a span length with 12 m, 18 m, and the experimental and analytical data are applied to the low pass filtering scheme, and the basis frequency of the filtering is a 2 times of the 1st fundamental frequency of a bridge bending.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.6
• /
• pp.1009-1014
• /
• 2023

Comprehensive observations of the Euler method and the Lagrangian method were performed in order to obtain high-resolution observation data in space and time for the complex environment of new city. The two radiosondes, which measure meteorological parameters using Lagrangian methods, produced air pressure, wind speed and wind direction. They were generally consistent with each other even if the observation points or times were different. The temperature measured by the sensor exposed to the air during the day was relatively high as the altitude increased due to the influence of solar radiation. The temporal difference in wind direction and speed was found in the comparison of Euler's wind profiler data with radiosonde data. When the wind field is horizontally in homogeneous, this result implies the need to consider the advection component to compare the data of the two observation methods. In this study, a method of using observation data at different times for each altitude section depending on the observation period of the Euler method is proposed to effectively compare the data of the two observation methods.