• Journal of KIISE
• /
• v.42 no.6
• /
• pp.713-722
• /
• 2015

As open-source software (OSS) becomes more widely used, many users breach the terms in the license agreement of OSS, or reuse a vulnerable OSS module. Therefore, a technique needs to be developed for investigating if a binary program includes an OSS module. In this paper, we propose an efficient technique to detect a particular OSS module in an executable program using its function-level features. The conventional methods are inappropriate for determining whether a module is contained in a specific program because they usually measure the similarity between whole programs. Our technique determines whether an executable program contains a certain OSS module by extracting features such as its function-level instructions, control flow graph, and the structural attributes of a function from both the program and the module, and comparing the similarity of features. In order to demonstrate the efficiency of the proposed technique, we evaluate it in terms of the size of features, detection accuracy, execution overhead, and resilience to compiler optimizations.

• Journal of KIISE:Software and Applications
• /
• v.36 no.1
• /
• pp.62-69
• /
• 2009

The purpose of document summarization is to provide easy and quick understanding of documents by extracting summarized information from the documents produced by various application programs. In this paper, we propose a document summarization method that creates and analyzes a connection graph representing the similarity of keyword lists of sentences in a document taking into account the mean length(the number of keywords) of sentences of the document. We implemented a system that automatically generate a summary from a document using the proposed method. To evaluate the performance of the method, we used a set of 20 documents associated with their correct summaries and measured the precision, the recall and the F-measure. The experiment results show that the proposed method is more efficient compared with the existing methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.5
• /
• pp.656-662
• /
• 2012

In this paper, we describe a new summarizing method based on a graph-based and a sense-based analysis. In the graph-based analysis, we convert sentences in a document into word vectors and calculate the similarity between each sentence using LSA. We reflect this similarity of sentences and the rarity scores of words in sentences to define weights of edges in the graph. Meanwhile, in the sense-based analysis, in order to determine the sense of words, subjectivity or objectivity, we built a database which is extended from the golden standards using Wordnet. We calculate the subjectivity of sentences from the sense of words, and select more subjective sentences. Lastly, we combine the results of these two methods. We evaluate the performance of the proposed method using classification games, which are usually used to measure the performances of summarization methods. We compare our method with the MS-Word auto-summarization, and verify the effectiveness of ours.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.59-66
• /
• 2005

The organization of the web is progressively more being used to improve search and analysis of information on the web as a large collection of heterogeneous documents. Most people begin at a Web search engine to find information. but the user's pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is a intentionally biased web page like Google bombing that is based on the PageRank algorithm. one of many Web structuring techniques. In this thesis, we regard the World Wide Web as a directed labeled graph that Web pages represent nodes and link edges. In the Present work, we define the label of an edge as having a link context and a similarity measure between link context and target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. By suggesting a motivating example, it is explained how our proposed algorithm can filter the Web intentionally biased web Pages effective about $60\%% rather than the conventional PageRank.

• The Journal of Korean Institute of Information Technology
• /
• v.16 no.12
• /
• pp.109-114
• /
• 2018

Collaborative filtering has been widely utilized in recommender systems as typical algorithm for outstanding performance. Since it depends on item rating history structurally, The more sparse rating matrix is, the lower its recommendation accuracy is, and sometimes it is totally useless. Variety of hybrid approaches have tried to combine collaborative filtering and content-based method for improving the sparsity issue in rating matrix. In this study, a new method is suggested for the same purpose, but with different perspective, it deals with no-match situation in person-person similarity evaluation. This method is called the transitive similarity model because it is based on relation graph of people, and it compares recommendation accuracy by applying to Movielens open dataset.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.6
• /
• pp.57-65
• /
• 2019

In this paper, we study on finding the rail space in elevators by analyzing each image captured with CCD camera. We propose a method that applies one-dimensional matched filter to the pixels of a selected search space in the vertical line at a horizontal position and decides the position with the thickness of the space being represented by a black thick line in captured images. The pattern similarity representing how strongly the associated image pixels resemble with the thick line is defined and calculated with respect to each position along the vertical line of pixels. The position and thickness of the line are decided from the point having the maximum in pattern similarity graph. In the experiments of the proposed method under different illuminational conditions, it is observed that all the pattern similarity graphs show similar shape around door area independent of the conditions and the method can effectively detect the rail space if the rails are illuminated with even weak light. The method can be used for real-time embedded systems because of its simple algorithm, in which it is implemented in simple structure of program with small amount of operations in comparison with the conventional approaches using Canny edge detection and Hough transform.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.590-595
• /
• 2009

With respect to the exponential increment of web documents on the internet, it is important how to improve performance of clustering method for web documents. Web document clustering techniques can offer accurate information and fast information retrieval by clustering web documents through semantic relationship. The clustering method based on mesh-graph provides high recall by calculating similarity for documents, but it requires high computation cost. This paper proposes a clustering method using hyperlinks which is structural feature of web documents in order to keep effectiveness and reduce computation cost.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1222-1230
• /
• 2015

Segmentation of the anterior cruciate ligament (ACL) in knee MRI remains a challenging task due to its inhomogeneous signal intensity and low contrast with surrounding soft tissues. In this paper, we propose a multi-atlas-based segmentation of the ACL in knee MRI with locally-aligned probabilistic atlas (PA) in an iterative graph cuts framework. First, a novel PA generation method is proposed with global and local multi-atlas alignment by means of rigid registration. Second, with the generated PA, segmentation of the ACL is performed by maximum-aposteriori (MAP) estimation and then by graph cuts. Third, refinement of ACL segmentation is performed by improving shape prior through mask-based PA generation and iterative graph cuts. Experiments were performed with a Dice similarity coefficients of 75.0%, an average surface distance of 1.7 pixels, and a root mean squared distance of 2.7 pixels, which increased accuracy by 12.8%, 22.7%, and 22.9%, respectively, from the graph cuts with patient-specific shape constraints.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.498-508
• /
• 2005

A shape data is used one oi most important feature for image retrieval as data to reflect meaning of image. Especially, structural feature of shape is widely studied because it represents primitive properties of shape and relation information between basic units well. However, most structural features of shape have the problem that it is not able to guarantee an efficient search time because the features are expressed as graph or tree. In order to solve this problem, we generate curvature-based morphological graph, End design key to cluster shapes from this graph. Proposed this graph have contour features and morphological features of a shape. Shape retrieval is accomplished by stages. We reduce a search space through clustering, and determine total similarity value through pattern matching of external curvature. Various experiments show that our approach reduces computational complexity and retrieval cost.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.5
• /
• pp.892-898
• /
• 2012

Rough classification methods are used to improving the recognition speed in many character recognition problems. In this case, some irreversible result can occur by an error in rough classification. Methods for duplicating each model in several classes are used in order to reduce this risk. But the errors by rough classfication can not be completely ruled out by these methods. In this paper, an recognition method is proposed to increase speed that matches models selectively without any increase in error. This method constructs a model graph using similarity between models. Then a search process begins from a particular point in the model graph. In this process, matching of unnecessary models are reduced that are not similar to the input pattern. In this paper, the proposed method is applied to the recognition problem of handwriting numbers and upper/lower cases of English alphabets. In the experiments, the proposed method was compared with the basic method that matches all models with input pattern. As a result, the same recognition rate, which has shown as the basic method, was obtained by controlling the out-degree of the model graph and the number of maintaining candidates during the search process thereby being increased the recognition speed to 2.45 times.