• The Korean Journal of Applied Statistics
• /
• v.21 no.6
• /
• pp.981-996
• /
• 2008

Statistical matching techniques whose aim is to achieve a complete data file from different sources. Since the statistical matching method proposed by Rubin (1986) assumes the multivariate normality for data, using this method to data which violates the assumption would involve some problems. This research proposed the statistical matching method using robust regression as an alternative to the linear regression. Furthermore, we carried out a simulation study to compare the performance of the robust regression model and the linear regression model for the statistical matching.

• Korean Journal of Environmental Biology
• /
• v.42 no.2
• /
• pp.207-218
• /
• 2024

Food webs have received global attention as next-generation biomonitoring tools; however, it remains challenging because revealing trophic links between species is costly and laborious. Although a link-extrapolation method utilizing published trophic link data can address this difficulty, it has limitations when applied to construct food webs in domestic streams due to the lack of information on endemic species in global literature. Therefore, this study aimed to develop a link extrapolation-based food web model adapted to Korean stream ecosystems. We considered taxonomic similarity of predation and dominance of generalists in aquatic ecosystems, designing taxonomically higher-level matching methods: family matching for all fish (Family), endemic fish (Family-E), endemic fish playing the role of consumers (Family-EC), and resources (Family-ER). By adding the commonly used genus matching method (Genus) to these four matching methods, a total of five matching methods were used to construct 103 domestic food webs. Predictive power of both individual links and food web indices were evaluated by comparing constructed food webs with corresponding empirical food webs. Results showed that, in both evaluations, proposed methods tended to perform better than Genus in a data-poor environment. In particular, Family-E and Family-EC were the most effective matching methods. Our model addressed domestic data scarcity problems when using a link-extrapolation method. It offers opportunities to understand stream ecosystem food webs and may provide novel insights into biomonitoring.

• Asia pacific journal of information systems
• /
• v.2 no.1
• /
• pp.3-15
• /
• 1992

This paper proposes a new referential model for data retrieval as an alternative to exact matching. While exact matching is an effective data retrieval model, it is based on fairly strict assumptions and limits our capabilities in data retrieval. This study redefines data retrieval to include non-binary data retrieval in addition to binary data retrieval, proposes Double Anchor Preference Model (DAPM), and analyzes its logical charateristics. DAPM supports non-binary data retrieval. Further, it produces the same result as exact matching for the conventional binary data retrieval. These findings show that, at the logical level, the proposed DAPM retains all the desirable features for data retrieval.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.3
• /
• pp.364-377
• /
• 2014

In this paper, we have developed a target recognition algorithm based on a template matching technique using Synthetic Aperture Radar (SAR) images. For efficient computations, Radon transform-based azimuth estimation algorithm was used with the template matching. MSTAR data set was divided into two groups according to the depression angles, which were a train set and a test set. Template data were generated by rotating and cropping chips which were from MSTAR train set using the azimuth estimation algorithm. Then the template matching process between test data and template data was performed under various conditions. Performance variation according to contrast enhancement preprocessing which is scarce in open literature was also presented. The analysis results show that the target recognition algorithm could be useful for the automatic target recognition using SAR images.

• Journal of Korea Game Society
• /
• v.13 no.6
• /
• pp.75-84
• /
• 2013

The recording and matching method of pose and gesture based on PC-window platform is introduced in this paper. The method uses the gesture detection camera, Xtion which is for the Windows PC. To develop the method, the API is first developed which processes and compares the depth data, RGB image data, and skeleton data obtained using the camera. The pose matching method which selectively compares only valid joints is developed. For the gesture matching, the recognition method which can differentiate the wrong pose between poses is developed. The tool which records and tests the sample data to extract the specified pose and gesture is developed. 6 different pose and gesture were captured and tested. Pose was recognized 100% and gesture was recognized 99%, so the proposed method was validated.

• Communications for Statistical Applications and Methods
• /
• v.10 no.2
• /
• pp.333-339
• /
• 2003

In this paper, we develop the probability matching priors for the parameters of non-regular Pareto distribution. We prove the propriety of joint posterior distribution induced by probability matching priors. Through the simulation study, we show that the proposed probability matching Prior matches the coverage probabilities in a frequentist sense. A real data example is given.

• The Journal of the Korea Contents Association
• /
• v.20 no.8
• /
• pp.42-53
• /
• 2020

With the development of social network services, graph structures have been utilized to represent relationships among objects in various applications. Recently, a demand of subgraph matching in real-time graph streams has been increased. Therefore, an efficient approximate Top-k subgraph matching scheme for low latency in real-time graph streams is required. In this paper, we propose an approximate Top-k subgraph matching scheme considering data reuse in graph stream environments. The proposed scheme utilizes the distributed stream processing platform, called Storm to handle a large amount of stream data. We also utilize an existing data reuse scheme to decrease stream processing costs. We propose a distance based summary indexing technique to generate Top-k subgraph matching results. The proposed summary indexing technique costs very low since it only stores distances among vertices that are selected in advance. Finally, we provide k subgraph matching results to users by performing an approximate Top-k matching on the summary indexing. In order to show the superiority of the proposed scheme, we conduct various performance evaluations in diverse real world datasets.

• Geophysics and Geophysical Exploration
• /
• v.17 no.2
• /
• pp.88-94
• /
• 2014

Due to mechanical failure or geographical accessibility, the seismic data can be partially missed. In addition, it can be coarsely sampled such as crossline of the marine streamer data. This seismic data that irregular sampled and spatial aliased may cause problems during seismic data processing. Accurate and efficient interpolation method can solve this problem. Futhermore, interpolation can save the acquisition cost and time by reducing the number of shots and receivers. Among various interpolation methods, the Matching Pursuit method can be applied to any sampling type which is regular or irregular. However, in case of using sinusoidal basis function, this method has a limitation in spatial aliasing. Therefore, in this study, we have developed wavelet based Matching Pursuit method that uses wavelet instead of sinusoidal function for the improvement of dealiasing performance. In addition, we have improved interpolation speed by using inner product instead of L-2 norm.

• Communications for Statistical Applications and Methods
• /
• v.12 no.2
• /
• pp.509-520
• /
• 2005

Data fusion is defined as the process of combining data and information from different sources for the effectiveness of the usage of useful information contents. In this paper, we propose a data fusion algorithm using k-means clustering method for data enrichment to improve data quality in knowledge discovery in database(KDD) process. An empirical study was conducted to compare the proposed data fusion technique with the existing techniques and shows that the newly proposed clustering data fusion technique has low MSE in continuous fusion variables.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.11
• /
• pp.1189-1195
• /
• 2008

We introduce a MEMS-based pedestrian dead reckoning (PDR) system. A walking navigation algorithm for pedestrians is presented and map-matching algorithm for the navigation system based on dead reckoning (DR) is proposed. The PDR is equipped on the human body and provides the position information of pedestrians. And this is able to be used in ubiquitous sensor network (USN), U-hearth monitoring system, virtual reality (VR) and etc. The PDR detects a step using a novel technique and simultaneously estimates step length. Also an azimuth of the pedestrian is calculated using a fluxgate which is the one of magnetometers. Map-matching algorithm can be formulated to integrate the positioning data with the digital road network data. Map-matching algorithm not only enables the physical location to be identified from navigation system but also improves the positioning accuracy. However most of map-matching algorithms which are developed previously are for the car navigation system (CNS). Therefore they are not appropriate to implement to pedestrian navigation system based on DR system. In this paper, we propose walking navigation system and map-matching algorithm for PDR.