• The Journal of the Korea Contents Association
• /
• v.22 no.8
• /
• pp.33-43
• /
• 2022

Labeled graphs are used to represent entities, their relationships, and their structures in real data such as knowledge graphs and protein interactions. With the rapid development of IT and the explosive increase in data, there has been a need for a subgraph matching technology to provide information that the user is interested in. In this paper, we propose an approximate Top-k labeled subgraph matching scheme that considers the semantic similarity of labels and the difference in graph structure. The proposed scheme utilizes a learning model using FastText in order to consider the semantic similarity of a label. In addition, the label similarity graph(LSG) is used for approximate subgraph matching by calculating similarity values between labels in advance. Through the LSG, we can resolve the limitations of the existing schemes that subgraph expansion is possible only if the labels match exactly. It supports structural similarity for a query graph by performing searches up to 2-hop. Based on the similarity value, we provide k subgraph matching results. We conduct various performance evaluations in order to show the superiority of the proposed scheme.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.129-137
• /
• 2001

Matching pursuit algorithm was successfully demonstrated useful in low bit-rate video coding, However, one of the practical concerns related to applying the matching pursuit algorithm to application is its massive computation required for finding bases whose weighted sum best approximates the given input image. The main contribution of this paper is that we provide a new method that can drastically reduce the computational load without any degradation of image quality. Its main idea is based on reducing the number of inner product calculation required for finding best bases because the complexity of matching pursuit algorithm is due to the exhaustive local inner product calculation. As the first step, we compute a matrix which is the 1-D inner product of the given motion-compensated error input image with the 1-D vertical Gabor functions using the separable property of Gabor bases. In the second step, we calculate length of each vector in the matrix that corresponds to 1-D horizontal Gabor function, and compare the length with the current maximum absolute inner product value so far. According to the result of this comparison, one can decide whether or not to calculate the inner product. Since most of them do not need to calculate the inner product value, one can significantly reduce the computational load. Experimental results show that proposed method reduces about 70% of inner product calculation compared to the Neff's fast algorithm without any degradation of image quality.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.89-98
• /
• 2016

In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.1
• /
• pp.49-55
• /
• 2013

In this paper, we proposed a good classifier to match different spatial data sets by applying evaluation of classifiers performance in data mining and biometrics. For this, we calculated distances between a pair of candidate features for matching criteria, and normalized the distances by Min-Max method and Tanh (TH) method. We defined classifiers that shape similarity is derived from fusion of these similarities by CRiteria Importance Through Intercriteria correlation (CRITIC) method, Matcher Weighting method and Simple Sum (SS) method. As results of evaluation of classifiers performance by Precision-Recall (PR) curve and area under the PR curve (AUC-PR), we confirmed that value of AUC-PR in a classifier of TH normalization and SS method is 0.893 and the value is the highest. Therefore, to match different spatial data sets, we thought that it is appropriate to a classifier that distances of matching criteria are normalized by TH method and shape similarity is calculated by SS method.

• Journal of Korea Multimedia Society
• /
• v.13 no.9
• /
• pp.1348-1356
• /
• 2010

With the advancement of information and communication technology, the market of Internet-based fashion/coordination shopping malls have been considerably increasing year by year. As the number of these Internet shopping malls increases, the operators of the malls tend to decorate the first page of their websites with a variety of events and samples of the best-fit upper-lower clothing pairs. They try to provide visitors of their web sites with products that can induce fresh impression by modifying the first page on a daily or a few days basis. If pairs of best-fit upper-lower clothes for various products available in online shopping malls can be calculated and marked, it would help not only to make the first page of the malls more appealing but also to enable users to purchase linked products in a more convenient way, replacing the recommendations usually made by offline clerks. In the paper, we present the results of designing and implementing an upper-lower clothes matching system in which expert coordinators register matching-value of upper and lower clothes in the form of attribute-value matrix.

• Geophysics and Geophysical Exploration
• /
• v.21 no.2
• /
• pp.103-111
• /
• 2018

The recent research aim of seismic trace interpolation is to effectively interpolate the data with spatial aliasing. Among various interpolation methods, the Matching Pursuit interpolation, that finds the proper combination of basis functions which can best recover traces, has been developed. However, this method cannot interpolate aliased data. Thus, the multi-component Matching Pursuit interpolation and moveout correction method have been proposed for interpolation of spatially aliased data. It is difficult to apply the multi-component Matching Pursuit interpolation to interpolating the OBC (Ocean Bottom Cable) data which is the multi-component data obtained at the ocean bottom because the isolation of P wave component is required in advance. Thus, in this study, we dealt with an effective single-component matching Pursuit interpolation method in OBC data where P-wave and S-wave are mixed and spatial aliasing is present. To do this, we proposed the Ricker wavelet based single-component Matching Pursuit interpolation workflow with moveoutcorrection and systematically investigated its effectiveness. In this workflow, the spatial aliasing problem is solved by applying constant value moveout correction to the data before the interpolation is performed. After finishing the interpolation, the inverse moveout correction is applied to the interpolated data using the same constant velocity. Through the application of our workflow to the synthetic OBC seismic data, we verified the effectiveness of the proposed workflow. In addition, we showed that the interpolation of field OBC data with severe spatial aliasing was successfully performed using our workflow.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.733-736
• /
• 1998

In this paper, we propose a new method for content-based retrieval system using wavelet transform and correlation, which has were used in signal processing and image compressing. The matching method is used not perfect matching but similar matching. Used feature vector is the lowest frequency(LL) itself, energy value, and edge information of 4-layer, after computng a 4-layer 2-D fast wavelet transform on image. By the proosed algorithm, we got the result that was faste rand more accurate than the traditional algorithm. Because used feature vector was compressed 256:1 over original image, retrieval speed was highly improved. By using correlation, moving object with size variation was reterieved without additional feature information.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.2
• /
• pp.77-87
• /
• 1996

Existing area-based stereo matching algorithms utilize a single rectangular correlation area for computing cross-correlation between corresponding points in stereo images, and compute disparity by finding the peak in the vicinity of depth discontinuity, since, because of inconstnat disparities around discontinuities, the cross-correlation becomes low in such area. Inthis paper, a new area-based matching strategy is proposed exploiting multiple directional correlation masks instead of a single one. The proposed technique computes multiple cross-covariance functions using each oriented mask. Peaks are detected from each covariance function and the disparity is computed by choosing the location with the highest covariance value. Proposed approach can also be applied to compute disparity gradients without obtaining dense depth data. A number of examples are presented using synthetic and natural stereo images.

• Korean Journal of Materials Research
• /
• v.13 no.10
• /
• pp.658-662
• /
• 2003

In this study, we have tried to find the optimized design variables of the matching layer which is important part of thickness mode ultrasonic transducer and finally reach the conclusion that the electrical property of piezo-element must be under consideration when the optimized acoustic impedance is estimated. Proper expression of the effective impedance of front load at free resonant frequency(: $Z_{f}$ $^{(0)}$ /) has been induced by introducing the principle of binomial multilayer transformer and gradient based numerical method is utilized to find the most acceptable value of $Z_{ f}$/$^{(0)}$ . Optimized point of acoustic impedance can be calculated directly from $Z_{f}$ $^{(0)}$ using some simple formula which we propose. We also verify our result by both numerical and experimental method and get a good enhancement especially it concern to the bandwidth of ultrasonic transducer.

• Korean Journal of Optics and Photonics
• /
• v.10 no.2
• /
• pp.174-177
• /
• 1999

The propagation loss of silica slab waveguides were measured by immersing slab waveguides into a index matching liqiud. Index matching liqiud was used for out-coupling the light from arbitrary points of slab waveguide. The measured value of propagation loss are 0.04 dB/cm and 0.09 dB at 1300 nm and 633 nm respectively.