• Journal of Korea Spatial Information System Society
• /
• v.9 no.1
• /
• pp.105-115
• /
• 2007

Data mining extracts interesting knowledge from a large database. Among numerous data mining techniques, research work is primarily concentrated on clustering and association rules. The clustering technique of the active research topics mainly deals with analyzing spatial and attribute data. And, the technique of association rules deals with identifying frequent patterns. There was an advanced apriori algorithm using an existing bit-clustering algorithm. In an effort to identify an alternative algorithm to improve apriori, we investigated FP-Growth and discussed the possibility of adopting bit-clustering as the alternative method to solve the problems with FP-Growth. FP-Growth using bit-clustering demonstrated better performance than the existing method. We used chess data in our experiments. Chess data were used in the pattern mining evaluation. We made a creation of FP-Tree with different minimum support values. In the case of high minimum support values, similar results that the existing techniques demonstrated were obtained. In other cases, however, the performance of the technique proposed in this paper showed better results in comparison with the existing technique. As a result, the technique proposed in this paper was considered to lead to higher performance. In addition, the method to apply bit-clustering to GML data was proposed.

• Korea Science and Art Forum
• /
• v.31
• /
• pp.21-32
• /
• 2017

Local festivals form the regional cultures and atmosphere of communication; they increase the demand of domestic tourism businesses and thus, have an important role in ripple effects (e.g. regional image improvement, tourist influx, job creation, regional contents development, and local product sales) and economic revitalization. IoT (Internet of Thing) technologies have been developed especially, beacon-one of the IoT services has been applied as plenty of types and forms both domestically and internationally. However, notwithstanding expansion of current digital mobile technologies, it still remains as difficult for the individual to track the information about all the local festivals and to fulfill the tourists' needs of enjoying festivals given the weak strategic approaches and advertisement activities. Furthermore, current festival-related mobile applications don't function well as delivering information and have numerous contents issues (e.g. ways of information delivery within the festival places, independent application usage for each festival, one time usage due to one time event). This research, based on the background mentioned above, aims to develop the local festival mobile application and data analysis system applying beacon technology. First of all, three algorithms were developed, namely, 'festival crowding algorithm', 'visitor stats algorithm', and 'customized information algorithm', and then beta test was followed with the developed application and data analysis system. As a result, they could form the database of visitors' types and behaviors, and provide functions and services, such as personalized information, waiting time for festival contents, and 'hot place' function. Besides, in Google Play store, they also got the titles given with more than 13,000 downloads within first three months and as the most exposed application related with festivals; and, thus, got credited with their marketability and excellence. This research follows this order: chapter 2 shows the literature review of local festival related with technology development, beacon service, and festival application. In Chapter 3, design plans and conditions are described of developing local festival mobile application and data analysis system with beacon. Chapter 4 evaluates the results of the beta performance test to verify applicability of the developed application and data analysis system, and lastly, chapter 5 explains the conclusion and suggests the future research.

• Journal of Internet Computing and Services
• /
• v.14 no.6
• /
• pp.1-8
• /
• 2013

Data mining techniques are used to find important and meaningful information from huge databases, and pattern mining is one of the significant data mining techniques. Pattern mining is a method of discovering useful patterns from the huge databases. Frequent pattern mining which is one of the pattern mining extracts patterns having higher frequencies than a minimum support threshold from databases, and the patterns are called frequent patterns. Traditional frequent pattern mining is based on a single minimum support threshold for the whole database to perform mining frequent patterns. This single support model implicitly supposes that all of the items in the database have the same nature. In real world applications, however, each item in databases can have relative characteristics, and thus an appropriate pattern mining technique which reflects the characteristics is required. In the framework of frequent pattern mining, where the natures of items are not considered, it needs to set the single minimum support threshold to a too low value for mining patterns containing rare items. It leads to too many patterns including meaningless items though. In contrast, we cannot mine any pattern if a too high threshold is used. This dilemma is called the rare item problem. To solve this problem, the initial researches proposed approximate approaches which split data into several groups according to item frequencies or group related rare items. However, these methods cannot find all of the frequent patterns including rare frequent patterns due to being based on approximate techniques. Hence, pattern mining model with multiple minimum supports is proposed in order to solve the rare item problem. In the model, each item has a corresponding minimum support threshold, called MIS (Minimum Item Support), and it is calculated based on item frequencies in databases. The multiple minimum supports model finds all of the rare frequent patterns without generating meaningless patterns and losing significant patterns by applying the MIS. Meanwhile, candidate patterns are extracted during a process of mining frequent patterns, and the only single minimum support is compared with frequencies of the candidate patterns in the single minimum support model. Therefore, the characteristics of items consist of the candidate patterns are not reflected. In addition, the rare item problem occurs in the model. In order to address this issue in the multiple minimum supports model, the minimum MIS value among all of the values of items in a candidate pattern is used as a minimum support threshold with respect to the candidate pattern for considering its characteristics. For efficiently mining frequent patterns including rare frequent patterns by adopting the above concept, tree based algorithms of the multiple minimum supports model sort items in a tree according to MIS descending order in contrast to those of the single minimum support model, where the items are ordered in frequency descending order. In this paper, we study the characteristics of the frequent pattern mining based on multiple minimum supports and conduct performance evaluation with a general frequent pattern mining algorithm in terms of runtime, memory usage, and scalability. Experimental results show that the multiple minimum supports based algorithm outperforms the single minimum support based one and demands more memory usage for MIS information. Moreover, the compared algorithms have a good scalability in the results.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.529-544
• /
• 2001

Prefetching is an effective method to minimize the number of roundtrips between the client and the server in database management systems. In this paper we propose new notions of the type-level access pattern and the type-level access locality and developed an efficient prefetchin policy based on the notions. The type-level access patterns is a sequence of attributes that are referenced in accessing the objects: the type-level access locality a phenomenon that regular and repetitive type-level access patterns exist. Existing prefetching methods are based on object-level or page-level access patterns, which consist of object0ids of page-ids of the objects accessed. However, the drawback of these methods is that they work only when exactly the same objects or pages are accessed repeatedly. In contrast, even though the same objects are not accessed repeatedly, our technique effectively prefetches objects if the same attributes are referenced repeatedly, i,e of there is type-level access locality. Many navigational applications in Object-Relational Database Management System(ORDBMs) have type-level access locality. Therefore our technique can be employed in ORDBMs to effectively reduce the number of roundtrips thereby significantly enhancing the performance. We have conducted extensive experiments in a prototype ORDBMS to show the effectiveness of our algorithm. Experimental results using the 007 benchmark and a real GIS application show that our technique provides orders of magnitude improvements in the roundtrips and several factors of improvements in overall performance over on-demand fetching and context-based prefetching, which a state-of the art prefetching method. These results indicate that our approach significantly and is a practical method that can be implemented in commercial ORDMSs.

• Korean Journal of Remote Sensing
• /
• v.21 no.6
• /
• pp.445-456
• /
• 2005

The land surface parameters should be determined with sufficient accuracy, because these play an important role in climate change near the ground. As the surface reflectance presents strong anisotropy, off-nadir viewing results a strong dependency of observations on the Sun - target - sensor geometry. They contribute to the random noise which is produced by surface angular effects. The principal objective of the study is to provide a database of accurate surface reflectance eliminated the angular effects from MODIS 250m reflective channel data over Korea. The MODIS (Moderate Resolution Imaging Spectroradiometer) sensor has provided visible and near infrared channel reflectance at 250m resolution on a daily basis. The successive analytic processing steps were firstly performed on a per-pixel basis to remove cloudy pixels. And for the geometric distortion, the correction process were performed by the nearest neighbor resampling using 2nd-order polynomial obtained from the geolocation information of MODIS Data set. In order to correct the surface anisotropy effects, this paper attempted the semiempirical kernel-driven Bi- directional Reflectance Distribution Function(BRDF) model. The algorithm yields an inversion of the kernel-driven model to the angular components, such as viewing zenith angle, solar zenith angle, viewing azimuth angle, solar azimuth angle from reflectance observed by satellite. First we consider sets of the model observations comprised with a 31-day period to perform the BRDF model. In the next step, Nadir view reflectance normalization is carried out through the modification of the angular components, separated by BRDF model for each spectral band and each pixel. Modeled reflectance values show a good agreement with measured reflectance values and their RMSE(Root Mean Square Error) was totally about 0.01(maximum=0.03). Finally, we provide a normalized surface reflectance database consisted of 36 images for 2001 over Korea.

• Korean Journal of Remote Sensing
• /
• v.38 no.6_1
• /
• pp.1505-1514
• /
• 2022

Image matching is a crucial preprocessing step for effective utilization of multi-temporal and multi-sensor very high resolution (VHR) satellite images. Deep learning (DL) method which is attracting widespread interest has proven to be an efficient approach to measure the similarity between image pairs in quick and accurate manner by extracting complex and detailed features from satellite images. However, Image matching of VHR satellite images remains challenging due to limitations of DL models in which the results are depending on the quantity and quality of training dataset, as well as the difficulty of creating training dataset with VHR satellite images. Therefore, this study examines the feasibility of DL-based method in matching pair extraction which is the most time-consuming process during image registration. This paper also aims to analyze factors that affect the accuracy based on the configuration of training dataset, when developing training dataset from existing multi-sensor VHR image database with bias for DL-based image matching. For this purpose, the generated training dataset were composed of correct matching pairs and incorrect matching pairs by assigning true and false labels to image pairs extracted using a grid-based Scale Invariant Feature Transform (SIFT) algorithm for a total of 12 multi-temporal and multi-sensor VHR images. The Siamese convolutional neural network (SCNN), proposed for matching pair extraction on constructed training dataset, proceeds with model learning and measures similarities by passing two images in parallel to the two identical convolutional neural network structures. The results from this study confirm that data acquired from VHR satellite image database can be used as DL training dataset and indicate the potential to improve efficiency of the matching process by appropriate configuration of multi-sensor images. DL-based image matching techniques using multi-sensor VHR satellite images are expected to replace existing manual-based feature extraction methods based on its stable performance, thus further develop into an integrated DL-based image registration framework.

• Journal of Korea Water Resources Association
• /
• v.56 no.6
• /
• pp.403-417
• /
• 2023

In this research, a methodology was developed for constructing an appropriate rainfall image database for estimating rainfall intensity based on CCTV video. The database was constructed in the Large-Scale Climate Environment Chamber of the Korea Conformity Laboratories, which can control variables with high irregularity and variability in real environments. 1,728 scenarios were designed under five different experimental conditions. 36 scenarios and a total of 97,200 frames were selected. Rain streaks were extracted using the k-nearest neighbor algorithm by calculating the difference between each image and the background. To prevent overfitting, data with pixel values greater than set threshold, compared to the average pixel value for each image, were selected. The area with maximum pixel variability was determined by shifting with every 10 pixels and set as a representative area (180×180) for the original image. After re-transforming to 120×120 size as an input data for convolutional neural networks model, image augmentation was progressed under unified shooting conditions. 92% of the data showed within the 10% absolute range of PBIAS. It is clear that the final results in this study have the potential to enhance the accuracy and efficacy of existing real-world CCTV systems with transfer learning.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.4 no.3
• /
• pp.31-40
• /
• 2001

Geography Information System is divided to many details fields such as Urban Information System, Land Information System, Military Information System etc. These detailed fields are connected each other and make National Geography Information System. Now Geography Information System is being used in many fields with Urban Information System. And information of all field is being constructed to network for share each other. Now Land Information System(LIS) is being constructed to two dimensional. But LIS can construct and utilize three dimensional geographic data by connecting Geography Information System and this effect will be greatest. Thus, the study of connecting cadastral map and digital terrain map must be continued. Through the study of connecting digital terrain map, the construction and analysis of three dimensional digital elevation model will be able to construct Land Information System effectively. To this study, the authors constructed integrated geographic data by uniting digital terrain map and cadastral map and constructed three dimensional digital elevation model. By connecting cadastral information database, the authors developed three dimensional Integrated Land Information System.

• Journal of Korean Society for Geospatial Information Science
• /
• v.21 no.4
• /
• pp.45-53
• /
• 2013

Global warming causes sea levels to rise and global changes apparently taking place including coastline changes. Coastline change due to sea level rise is also one of the most significant phenomena affected by global climate change. Accordingly, Coastline change detection can be utilized as an indicator of representing global climate change. Generally, Coastline change has happened mainly because of not only sea level rise but also artificial factor that is reclaimed land development by mud flat reclamation. However, Arctic coastal areas have been experienced serious change mostly due to sea level rise rather than other factors. The purposes of this study are automatic extraction of coastline and identifying change. In this study, in order to extract coastline automatically, contrast of the water and the land was maximized utilizing modified NDWI(Normalized Difference Water Index) and it made automatic extraction of coastline possibile. The imagery converted into modified NDWI were applied image processing techniques in order that appropriate threshold value can be found automatically to separate the water and land. Then the coastline was extracted through edge detection algorithm and changes were detected using extracted coastlines. Without the help of other data, automatic extraction of coastlines using LANDSAT was possible and similarity was found by comparing NLCD data as a reference data. Also, the results of the study area that is permafrost always frozen below $0^{\circ}C$ showed quantitative changes of the coastline and verified that the change was accelerated.

• Asian-Australasian Journal of Animal Sciences
• /
• v.31 no.5
• /
• pp.738-747
• /
• 2018

Objective: In a previous study, analysis of Illumina sequenced metagenomic DNA data of bacteria in Vietnamese goats' rumen showed a high diversity of putative lignocellulolytic genes. In this study, taxonomy speculation of microbial community and lignocellulolytic bacteria population in the rumen was conducted to elucidate a role of bacterial structure for effective degradation of plant materials. Methods: The metagenomic data had been subjected into Basic Local Alignment Search Tool (BLASTX) algorithm and the National Center for Biotechnology Information non-redundant sequence database. Here the BLASTX hits were further processed by the Metagenome Analyzer program to statistically analyze the abundance of taxa. Results: Microbial community in the rumen is defined by dominance of Bacteroidetes compared to Firmicutes. The ratio of Firmicutes versus Bacteroidetes was 0.36:1. An abundance of Synergistetes was uniquely identified in the goat microbiome may be formed by host genotype. With regard to bacterial lignocellulose degraders, the ratio of lignocellulolytic genes affiliated with Firmicutes compared to the genes linked to Bacteroidetes was 0.11:1, in which the genes encoding putative hemicellulases, carbohydrate esterases, polysaccharide lyases originated from Bacteroidetes were 14 to 20 times higher than from Firmicutes. Firmicutes seem to possess more cellulose hydrolysis capacity showing a Firmicutes/Bacteroidetes ratio of 0.35:1. Analysis of lignocellulolytic potential degraders shows that four species belonged to Bacteroidetes phylum, while two species belonged to Firmicutes phylum harbouring at least 12 different catalytic domains for all lignocellulose pretreatment, cellulose, as well as hemicellulose saccharification. Conclusion: Based on these findings, we speculate that increasing the members of Bacteroidetes to keep a low ratio of Firmicutes versus Bacteroidetes in goat rumen has resulted most likely in an increased lignocellulose digestion.