• Journal of Internet of Things and Convergence
• /
• v.2 no.4
• /
• pp.15-20
• /
• 2016

This paper describes the construction of knowledge data retrieval management system based on medical image CT. The developed system is aimed to improve the efficiency of the hospital by reading the medical images using the intelligent retrieval technology and diagnosing the patient 's disease name. In this study, the medical image DICOM file of PACS is read, the image is processed, and feature values are extracted and stored in the database. We have implemented a system that retrieves similarity by comparing new CT images required for medical treatment with the feature values of other CTs stored in the database. After converting 100 CT dicom provided for academic research into JPEG files, Code Book Library was constructed using SIFT, CS-LBP and K-Mean Clustering algorithms. Through the database optimization, the similarity of the new CT image to the existing data is searched and the result is confirmed, so that it can be utilized for the diagnosis and diagnosis of the patient.

• Journal of Navigation and Port Research
• /
• v.40 no.3
• /
• pp.97-103
• /
• 2016

The precise prediction of ships propulsion performance is very important to find out the ships optimum route. This paper describes the development of computer program to generate the database of propulsion performance for the ships optimum routing system. The propulsion performance of ship in the sea is caused by not only ships conditions such as drift and hull roughness, but also various sea conditions such as wave and wind. These prediction methods of added resistance are based on the ships speed trial analysis methods of the ISO 15016:2002 standard, and a few prediction methods of the wind and hull roughness are supplemented. These prediction methods have been applied to the comprehensive computer program. And the database calculation for the research ice breaker the Araon has been carried out, which shall be used for the calculation of optimum route. Furthermore, this program shall be used for the route optimization in global shipping routes.

• Journal of the Korean Society for Library and Information Science
• /
• v.49 no.1
• /
• pp.45-67
• /
• 2015

The purpose of this study is to analyse the semantic relations of terms in STNet, a structured terminology dictionary based on author keywords of humanities, social sciences, and art and sport in the Korea Citation Index (KCI) and to describe the procedure for optimizing the relation types and specifying the name of relationships. The results indicate that four logical criteria, such as creating new names for relationships or limitation of typing the relationship by the appearance frequency of same type, consideration of direction of relationship, reflection to accept the existing name of relationships, are required for the optimization of the typing and naming the relationships. We applied these criteria to the relationships in the class "real person" of STNet and the result shows that 1,135 out of 1,743 uncertain relationships such as RT, RT_X or RT_Y are specified and clarified. This rate of optimization with ca. 65% represents the usefulness of the criteria applicable to the cases of database construction and retrieval.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.20 no.4
• /
• pp.367-374
• /
• 2002

Maintainability of highways is an important problem that is considered in the planning steps of a highway development process. A number of asset management systems have been developed to precisely predict maintenance and pavement expenditures for better decision making, But these systems are not helpful in reducing maintenance costs. Optimization of some highway design characteristics in the planning phases may reduce maintenance costs over the life cycle of highway. The formulations for initial and maintenance costs have been developed based on which design variables can be chosen to minimize these costs, focusing on the sideslope in cut and fill sections. Maintenance cost has been represented as a function of sideslope, width of highway cross section, and annual average daily traffic. A real geographic database of between Chung joo and Sang joo city in Choong buk was used and it is presented to investigate the sensitivities of maintenance cost and soil characteristics in selecting alignments. In this study, we present that maintenance cost and soil characteristics are important considerations in alignment optimization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2366-2395
• /
• 2018

Multi-view super-resolution (MVSR) refers to the process of reconstructing a high-resolution (HR) image from a set of low-resolution (LR) images captured from different viewpoints typically by different cameras. These multi-view images are usually obtained by a camera array. In our previous work [1], we super-resolved multi-view LR images via image fusion (IF) and blind deblurring (BD). In this paper, we present a new MVSR method that jointly realizes IF and BD based on an integrated energy function optimization. First, we reformulate the MVSR problem into a multi-channel blind deblurring (MCBD) problem which is easier to be solved than the former. Then the depth map of the desired HR image is calculated. Finally, we solve the MCBD problem, in which the optimization problems with respect to the desired HR image and with respect to the unknown blur are efficiently addressed by the alternating direction method of multipliers (ADMM). Experiments on the Multi-view Image Database of the University of Tsukuba and images captured by our own camera array system demonstrate the effectiveness of the proposed method.

• Korean Journal of Ecology and Environment
• /
• v.41 no.spc
• /
• pp.11-20
• /
• 2008

In this study, we applied a Particle Swarm Optimization (PSO) algorithm to predict the changes of chlorophyll-${\alpha}$ related to environmental factors in agricultural reservoirs in Korean national scale. Data were obtained from water quality monitoring networks of reservoirs operated by the Ministry of Agriculture and Forestry and the Ministry of Environment of Korea. From the database of the monitoring networks, 290 reservoirs were chosen with variables such as chlorophyll-${\alpha}$ and 13 environmental factors (COD, TN, TP, Altitude, Bank height, etc.) measured in 2002. Based on Carlson's trophic status index, reservoirs were divided into five groups, and most agricultural reservoirs $(TSI_{CHL}\;64.1%,\;TSI_{TP}\;75.5%)$ were in the eutrophic states. The groups were discriminated with environmental variables, showing that COD, DO, and TP were important factors to determine the trophic states. MLP-PSO (Multilayer perceptron (MLP) with PSO for the optimization) was applied for the prediction of chlorophyll-${\alpha}$ with environment factors, and showed high predictability (r=0.83, p<0.001). Additionally, the sensitivity analysis of the MLP-PSO model showed that COD had the strongest positive effects on the concentration of chlorophyll-${\alpha}$, and followed by TP, TN, DO, whereas altitude and bank height had negative effects on the concentration of chlorophyll-${\alpha}$.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.395-408
• /
• 2004

A conjunctive Boolean text query refers to a query that searches for tort documents containing all of the specified keywords, and is the most frequently used query form in information retrieval systems. Typically, the query specifies a long list of keywords for better precision, and in this case, the order of keyword processing has a significant impact on the query speed. Currently known approaches to this ordering are based on heuristics and, therefore, cannot guarantee an optimal ordering. We can use a systematic approach by leveraging a database query processing algorithm like the dynamic programming, but it is not suitable for a text query with a typically long list of keywords because of the algorithm's exponential run-time (Ο(n2$^{n-1}$)) for n keywords. Considering these problems, we propose a new approach based on a property called the join sequence separability. This property states that the optimal join sequence is separable into two subsequences of different join methods under a certain condition on the joined relations, and this property enables us to find a globally optimal join sequence in Ο(n2$^{n-1}$). In this paper we describe the property formally, present an optimization algorithm based on the property, prove that the algorithm finds an optimal join sequence, and validate our approach through simulation using an analytic cost model. Comparison with the heuristic text query optimization approaches shows a maximum of 100 times faster query processing, and comparison with the dynamic programming approach shows exponentially faster query optimization (e.g., 600 times for a 10-keyword query).

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.3
• /
• pp.109-118
• /
• 2019

Road information is one of the most significant geospatial data for applications such as transportation, city planning, map generation, LBS (Location-Based Service), and GIS (Geographic Information System) database updates. Robust technologies to acquire and update accurate road information can contribute significantly to geospatial industries. In this study, we analyze the limitations of ACO (Ant Colony Optimization) road extraction, which is a recently introduced object-based road extraction method using high-resolution satellite images. Object-based ACO road extraction can efficiently extract road areas using both spectral and morphological information. This method, however, is highly dependent on object descriptor information and requires manual designations of descriptors. Moreover, reasonable iteration closing point needs to be specified. In this study, we perform improved ACO road extraction on VHR (Very High Resolution) optical satellite image by proposing an optimization stopping criteria and descriptors that complements the limitations of the existing method. The proposed method revealed 52.51% completeness, 6.12% correctness, and a 51.53% quality improvement over the existing algorithm.

• Journal of Korea Multimedia Society
• /
• v.15 no.12
• /
• pp.1499-1505
• /
• 2012

Recently, the distributed processing system for big data has been actively investigated owing to the development of high speed network and storage technologies. In addition, virtual system that can provide efficient use of system resources through the consolidation of servers has been increasingly recognized. But, when we configure distributed processing system for big data in virtual machine environments, many problems occur. In this paper, we did an experiment on the optimization of I/O bandwidth according to the creation and placement of VMs and tasks with composing Hadoop cluster in virtual environments and evaluated the results of an experiment. These results conducted by this paper will be used in the study on the development of Hadoop Scheduler supporting I/O bandwidth balancing in virtual environments.

• Proceedings of the KSPS conference
• /
• 2002.11a
• /
• pp.209-213
• /
• 2002

This paper describes the reduction of DB without degradation of speech quality in Corpus-based Speech synthesizer of Korean language. In this paper, it is proposed that the frequency of every unit in reduced DB should reflect the frequency of units in Korean language. So, the target population of every unit is set to be proportional to their frequency in Korean large corpus(780K sentences, 45Mega phonemes). Second, the frequent instances during synthesis should be also maintained in reduced DB. To the last, it is proposed that frequency of every instance should be reflected in clustering criterion and used as criterion for selection of representative instances. The evaluation result with proposed methods reveals better quality than using conventional methods.