• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.127-136
• /
• 2010

With rapid growth of information and computer communication technologies, the numbers of digital documents including multimedia data have been recently exploded. In particular, news video database and news video mining have became the subject of extensive research, to develop effective and efficient tools for manipulation and analysis of news videos, because of their information richness. However, many research focus on browsing, retrieval and summarization of news videos. Up to date, it is a relatively early state to discover and to analyse the plentiful latent semantic knowledge from news videos. In this paper, we propose the news video mining system based on multi-modal approach and text mining, which uses the visual-textual information of news video clips and their scripts. The proposed system systematically constructs a taxonomy of news video stories in automatic manner with hierarchical clustering algorithm which is one of text mining methods. Then, it multilaterally analyzes the topics of news video stories by means of time-cluster trend graph, weighted cluster growth index, and network analysis. To clarify the validity of our approach, we analyzed the news videos on "The Second Summit of South and North Korea in 2007".

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.6
• /
• pp.295-306
• /
• 2016

The purpose of this paper is both to analyze research trends and to predict industrial flows using the meta-data from the previous studies on data quality. There have been many attempts to analyze the research trends in various fields till lately. However, analysis of previous studies on data quality has produced poor results because of its vast scope and data. Therefore, in this paper, we used a text mining, social network analysis for time series network analysis to analyze the vast scope and data of data quality collected from a Web of Science index database of papers published in the international data quality-field journals for 10 years. The analysis results are as follows: Decreases in Mathematical & Computational Biology, Chemistry, Health Care Sciences & Services, Biochemistry & Molecular Biology, Biochemistry & Molecular Biology, and Medical Information Science. Increases, on the contrary, in Environmental Sciences, Water Resources, Geology, and Instruments & Instrumentation. In addition, the social network analysis results show that the subjects which have the high centrality are analysis, algorithm, and network, and also, image, model, sensor, and optimization are increasing subjects in the data quality field. Furthermore, the industrial connection analysis result on data quality shows that there is high correlation between technique, industry, health, infrastructure, and customer service. And it predicted that the Environmental Sciences, Biotechnology, and Health Industry will be continuously developed. This paper will be useful for people, not only who are in the data quality industry field, but also the researchers who analyze research patterns and find out the industry connection on data quality.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.247-258
• /
• 2004

Recently, there have been researches on storage and retrieval technique of moving objects, which are highly concerned by user in database application area such as video databases, spatio-temporal databases, and mobile databases. In this paper, we propose a new signature-based indexing scheme which supports similar sub-trajectory retrieval at well as good retrieval performance on moving objects trajectories. Our signature-based indexing scheme is classified into concatenated signature-based indexing scheme for similar sub-trajectory retrieval, entitled CISR scheme and superimposed signature-based indexing scheme for similar sub-trajectory retrieval, entitled SISR scheme according to generation method of trajectory signature based on trajectory data of moving object. Our indexing scheme can improve retrieval performance by reducing a large number of disk access on data file because it first scans all signatures and does filtering before accessing the data file. In addition, we can encourage retrieval efficiency by appling k-warping algorithm to measure the similarity between query trajectory and data trajectory. Final]y, we evaluate the performance on sequential scan method(SeqScan), CISR scheme, and SISR scheme in terms of data insertion time, retrieval time, and storage overhead. We show from our experimental results that both CISR scheme and SISR scheme are better than sequential scan in terms of retrieval performance and SISR scheme is especially superior to the CISR scheme.

• Journal of Veterinary Clinics
• /
• v.24 no.2
• /
• pp.77-81
• /
• 2007

Diagnostic performance of polymerase chain reaction (PCR) for detecting Dirofilaria immitis in dogs was evaluated when no gold standard test was employed. An enzyme-linked immunosorbent assay test kit (SnapTM, IDEXX, USA) with unknown parameters was also employed. The sensitivity and specificity of the PCR from two-population model were estimated by using both maximum likelihood using expectation-maximization (EM) algorithm and Bayesian method, assuming conditional independence between the two tests. A total of 266 samples, 133 samples in each trial, were randomly retrieved from the heartworm database records during the year 2002-2004 in a university animal hospital. These data originated from the test results of military dogs which were brought for routine medical check-up or testing for heartworm infection. When combined 2 trials, sensitivity and specificity of the PCR was 96.4-96.7% and 97.6-98.8% in EM and 94.4-94.8% and 97.1-98% in Bayesian. There were no statistical differences between estimates. This finding indicates that the PCR assay could be useful screening tool for detecting heartworm antigen in dogs. This study was provided further evidences that Bayesian approach is an alternative approach to draw better inference about the performance of a new diagnostic test in case when either gold test is not available.

• Horticultural Science & Technology
• /
• v.31 no.5
• /
• pp.598-606
• /
• 2013

Anther is the major organ of flower in responsible to reproduction and outward appearance. From anther-specific cDNA library of Lilium Oriental Hybrid 'Acapulco', 2000 expressed sequence tags were selected randomly. Differential slot blot analysis with cDNA probes from the anther and leaf was used to get anther-expressed clone and 570 non-redundant ESTs were obtained and sequenced. Compared to the GenBank database using BLASTX algorithm, 191 clones showed significant similarity but others (66.5%) did not measured to known sequence. Functional categories according to gene ontology (GO) annotation included sequence representing a significant portion of protein in cell and cell part respectively. A transcriptional analysis at 7 different organs and developmental stage was performed using northern blot with thirty ESTs as putative anther specific gene. This report suggest that selection of anther expressed clone using differential slot blot was considered as very effective tool and our current study can provide fundamental information on the lily anther including pollen furthermore.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.1-18
• /
• 2008

Because we can usually get many information through analyzing trajectories of moving objects on spatial networks, efficient trajectory index structures are required to achieve good retrieval performance on their trajectories. However, there has been little research on trajectory index structures for spatial networks such as FNR-tree and MON-tree. Also, because FNR-tree and MON-tree store the segment unit of moving objects, they can't support the trajectory of whole moving objects. In this paper, we propose an efficient trajectory index structures based on signatures on a spatial network, named SigMO-Tree. For this, we divide moving object data into spatial and temporal attributes, and design an index structure which supports not only range query but trajectory query by preserving the whole trajectory of moving objects. In addition, we divide user queries into trajectory query based on spatio-temporal area and similar-tralectory query, and propose query processing algorithms to support them. The algorithm uses a signature file in order to retrieve candidate trajectories efficiently Finally, we show from our performance analysis that our trajectory index structure outperforms the existing index structures like FNR-Tree and MON-Tree.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.669-680
• /
• 2011

R-trees are widely used in various areas such as geographical information systems, CAD systems and spatial databases in order to efficiently index multi-dimensional data. As data sets used in these areas grow in size and complexity, however, range query operations on R-tree are needed to be further faster to meet the area-specific constraints. To address this problem, there have been various research efforts to develop strategies for acceleration query processing on R-tree by using the buffer mechanism or parallelizing the query processing on R-tree through multiple disks and processors. As a part of the strategies, approaches which parallelize query processing on R-tree through Graphics Processor Units(GPUs) have been explored. The use of GPUs may guarantee improved performances resulting from faster calculations and reduced disk accesses but may cause additional overhead costs caused by high memory access latencies and low data exchange rate between GPUs and the CPU. In this paper, to address the overhead problems and to adapt GPUs efficiently, we propose a novel approach which uses a GPU as a buffer to parallelize query processing on R-tree. The use of buffer algorithm can give improved performance by reducing the number of disk access and maximizing coalesced memory access resulting in minimizing GPU memory access latencies. Through the extensive performance studies, we observed that the proposed approach achieved up to 5 times higher query performance than the original CPU-based R-trees.

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

An analysis model for the dynamics information of two-dimensional time-series patterns is described. In the proposed model, two novel transforms that visualize the dynamic characteristics are proposed. The first transform, referred to as speed equalization, reproduces a time-series pattern assuming a constant linear velocity to effectively model the temporal characteristics of the signing process. The second transform, referred to as velocity transform, maps the signal onto a horizontal vs. vertical velocity plane where the variation oi the velocities over time is represented as a visible shape. With the transforms, the dynamic characteristics in the original signing process are reflected in the shape of the transformed patterns. An analysis in the context of these shapes then naturally results in an effective analysis of the dynamic characteristics. The proposed transform technique is applied to an online signature verification problem for evaluation. Experimenting on a large signature database, the performance evaluated in EER(Equal Error Rate) was improved to 1.17$\%$ compared to 1.93$\%$ of the traditional signature verification algorithm in which no transformed patterns are utilized. In the case of skilled forgery experiments, the improvement was more outstanding; it was demonstrated that the parameter set extracted from the transformed patterns was more discriminative in rejecting forgeries

• Journal of Korean Society of Transportation
• /
• v.23 no.2
• /
• pp.161-172
• /
• 2005

This study is to develop Bus Transit Route Analysis and Evaluation Model that can product the quantitative performance measures for Bus Transit Route Network Design. So far, in Korea, there are no so many models that evaluate a variety of other performance measures or service quality that are of concern to both the transit users and operator because of lower-level bus database system and transit route network analysis algorithm's limit. The BTRAEM in this research differ from the previous approach in that the BTRAEM employs a multiple path transit trip assignment model that explicitly considers the transfer and different travel time after boarding. And we develop input-output data structure and quantitative performance measure for the BTRAEM. In the numerical experimental applying BTRAEM to Mandl transit network, We got the meaningful results on performance measure of bus transit route network. In the future, we expect BTRAEM to give a good solution in real transit network.

• Korean Journal of Remote Sensing
• /
• v.23 no.4
• /
• pp.297-309
• /
• 2007

The first Korean geostationary weather satellite, Communications, Oceanography and Meteorology Satellite (COMS) will be launched in 2008. The ground station for COMS needs to perform geometric correction to improve accuracy of satellite image data and to broadcast geometrically corrected images to users within 30 minutes after image acquisition. For such a requirement, we developed automated and fast geometric correction techniques. For this, we generated control points automatically by matching images against coastline data and by applying a robust estimation called RANSAC. We used GSHHS (Global Self-consistent Hierarchical High-resolution Shoreline) shoreline database to construct 211 landmark chips. We detected clouds within the images and applied matching to cloud-free sub images. When matching visible channels, we selected sub images located in day-time. We tested the algorithm with GOES-9 images. Control points were generated by matching channel 1 and channel 2 images of GOES against the 211 landmark chips. The RANSAC correctly removed outliers from being selected as control points. The accuracy of sensor models established using the automated control points were in the range of $1{\sim}2$ pixels. Geometric correction was performed and the performance was visually inspected by projecting coastline onto the geometrically corrected images. The total processing time for matching, RANSAC and geometric correction was around 4 minutes.