• International Journal of Contents
• /
• v.6 no.3
• /
• pp.5-9
• /
• 2010

To manage large database system with video, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for frame-wise user query or video content query, whereas a few video identification algorithms have been proposed for video sequence query. In this paper, we propose an effective video identification algorithm for video sequence query that employs the Cauchy function of histograms between successive frames and the modified Hausdorff distance. To effectively match the video sequences with a low computational load, we make use of the key frames extracted by the cumulative Cauchy function and compare the set of key frames using the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed algorithm for video identification yields remarkably higher performance than conventional algorithms such as Euclidean metric, and directed divergence methods.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.22 no.4
• /
• pp.422-429
• /
• 2002

The identification of ultrasonic flaw signals is a truly difficult task in the angle beam testing of welded joints due to non-relevant signals from the geometric reflectors such as weld roots and counter bores. This paper describes a new approach called "technique for identification of flaw signal using deconvolution(TIFD)" in order to identify the flaw signals in such a problematic situation. The concept of similarity function based on the deconvolution is introduced in the proposed approach. The "reference" signals from both flaws and geometric reflectors and test signals are acquired and normalized. The similarity functions are obtained by deconvolution of test signals with reference signals. The flaw signals could be identified by the patterns of similarity function. The initiative results show great potential of TIFD to distinguish notch comer signals from the geometric reflections.

• International Journal of Internet, Broadcasting and Communication
• /
• v.5 no.2
• /
• pp.5-10
• /
• 2013

We proposed a novel similarity measure using weighted difference entropy (WDE) to improve the performance of the CF system. The proposed similarity metric evaluates the entropy with a preference score difference between the common rated items of two users, and normalizes it based on the Gaussian, tanh and sigmoid function. We showed significant improvement of experimental results and environments. These experiments involved changing the number of nearest neighborhoods, and we presented experimental results for two data sets with different characteristics, and results for the quality of recommendation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.1
• /
• pp.1-6
• /
• 2007

The similarity measure is derived with distance measure, and the proposed similarity measure is proved to verily the usefulness. Conventional similarity measure which is constructed through fuzzy number and Center of Gravity(COG) is introduced, furthermore two similarity measures are compared through various types of membership function.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.2E
• /
• pp.51-55
• /
• 2004

In this paper, we propose a style-specific language model adaptation scheme using n-gram based tf*idf similarity for Korean spontaneous speech recognition. Korean spontaneous speech shows especially different style-specific characteristics such as filled pauses, word omission, and contraction, which are related to function words and depend on preceding or following words. To reflect these style-specific characteristics and overcome insufficient data for training language model, we estimate in-domain dependent n-gram model by relevance weighting of out-of-domain text data according to their n-. gram based tf*idf similarity, in which in-domain language model include disfluency model. Recognition results show that n-gram based tf*idf similarity weighting effectively reflects style difference.

• Journal of Mechanical Science and Technology
• /
• v.15 no.9
• /
• pp.1339-1345
• /
• 2001

Laminar film condensation of a saturated pure vapor in forced flow over a flat plate is analyzed as boundary layer solutions. Similarity solutions for some real fluids are presented as a function of modified Jakob number (C$\_$pι/ ΔΤ/Prh$\_$fg/) with property ratio (No Abstract.see full/text) and Pγ as parameters and compared with approximate solutions which were obtained from energy and momentum equations without convection and inertia terms in liquid flow. Approximate solutions agree well with the similarity solutions when the values of modified Jakob number are less then 0.1 near 1 atmospheric pressure.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.546-553
• /
• 2007

As ontologies are used widely, interest for semantic similarity search is also increasing. In this paper, we suggest a query evaluation scheme for k-nearest neighbor query, which retrieves k most similar objects to the query object. We use the best match method to calculate the semantic similarity between objects and use the signature tree to index annotation information of objects in database. The signature tree is usually used for the set similarity search. When we use the signature tree in similarity search, we are required to predict the upper-bound of similarity for a node; the highest similarity value which can be found when we traverse into the node. So we suggest a prediction function for the best match similarity function and prove the correctness of the prediction. And we modify the original signature tree structure for same signatures not to be stored redundantly. This improved structure of signature tree not only reduces the size of signature tree but also increases the efficiency of query evaluation. We use the Gene Ontology(GO) for our experiments, which provides large ontologies and large amount of annotation data. Using GO, we show that proposed method improves query efficiency and present several experimental results varying the page size and using several node-splitting methods.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.3
• /
• pp.557-569
• /
• 2013

In this paper we shall introduce the $f$-function in a set, and give some properties of $f$-function of a set. In particular, we establish a relation between $f$-function of a set and fuzzy equivalence relation. We also introduce the notion of $f$-homomorphism on a semigroup S, and prove the generalized fundamental homomorphism theorem of semigroup.

• Journal of KIISE:Software and Applications
• /
• v.37 no.11
• /
• pp.803-811
• /
• 2010

Since protein subcellular location and biological function are highly correlated, the prediction of protein subcellular localization can provide information about the function of a protein. In order to enhance the prediction performance, external information other than amino acids sequence information is actively exploited in many researches. This paper compares the prediction capabilities resided in amino acid sequence similarity, protein profile, gene ontology, motif, and textual information. In the experiments using PLOC dataset which has proteins less than 80% sequence similarity, sequence similarity information and gene ontology are effective information, achieving a classification accuracy of 94.8%. In the experiments using BaCelLo IDS dataset with low sequence similarity less than 30%, using gene ontology gives the best prediction accuracies, 93.2% for animals and 86.6% for fungi.

• Journal of Korea Multimedia Society
• /
• v.16 no.7
• /
• pp.802-809
• /
• 2013

In this paper, we propose the similarity measurement method between two program codes by counting the frequency and length of continuous patterns of specifiers and keywords, which exist in two program codes. In addition, we propose the visualization method of this analysis result by formal concept analysis. Proposed method considers adjacencies of specifiers or keywords, which have not been considered in the previous similarity measurements. Proposed method can detect the plagiarism by analyzing the pattern in each function regardless of the order of function call and execution. In addition, the result of the similarity measurement is visualized by the lattice of formal concept analysis to increase the user understanding about the relations between program codes. Experimental results showed that proposed method succeeded in 96% plagiarism detections. Our method could be applied into the analysis of general documents.