• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.868-876
• /
• 1999

In this paper, an efficient automatic video parsing technique on MPEG-compressed video that is fundamental for content-based indexing is described. The proposed method detects scene changes, regardless of IPB picture composition. To detect abrupt changes, the difference measure based on the dc coefficient in I picture and the macroblock reference feature in P and B pictures are utilized. For gradual scene changes, we use the macroblock reference information in P and B pictures. the process of scene change detection can be efficiently handled by extracting necessary data without full decoding of MPEG sequence. The performance of the proposed algorithm is analyzed based on precision and recall. the experimental results verified the effectiveness of the method for detecting scene changes of various MPEG sequences.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.87-94
• /
• 2008

In this paper, an extraction method of objects of interest in the color images is proposed. It is possible to extract objects of interest from a complex background without any prior-knowledge based on the proposed method. For object extraction, Gator images that contain information of object location, are created by using Gator filter. Based on the images the initial location of attention windows is determined, from which image features are selected to extract objects. To extract object, I modify the previous method partially and apply the modified method. To evaluate the performance of propsed method, precision, recall and F-measure are calculated between the extraction results from propsed method and manually extracted results. I verify the performance of the proposed methods based on these accuracies. Also through comparison of the results with the existing method, I verily the superiority of the proposed method over the existing method.

• Journal of the Korean Society for Library and Information Science
• /
• v.21
• /
• pp.249-290
• /
• 1991

Theoretical developments in the information retrieval have offered a number of alternatives to traditional Boolean retrieval. Probability theory and fuzzy set theory have played prominent roles here. Fuzzy set theory is an attempt to generalize traditional set theory by permitting partial membership in a set and this means recognizing different degrees to which a document can match a request. In this study, an experimentation of a document retrieval system using the fuzzy relation matrix of the keywords is described and the results are offered. The queries composed of keywords and Boolean operaters AND, OR, NOT were processed in the retrieval method, and the method was implemented on the PC of 32bit level (30 MHz) in an experimental system. The measurement of the recall ratio and precision ratio verified the effectiveness of the proposed fuzzy relation matrix of keywords and retrieval method. Compared to traditional crisp method in the same document database, the recall ratio increased $10\%$ high although the precision ratio decreased slightly. The problems, in this experiment, to be resolved are first, the design of the automatic data input and fuzzy indexing modules, through which the system . can have the ability of competition and usefulness. Second, devising a systematic procedure for assigning fuzzy weights to keywords in documents and in queries.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.1
• /
• pp.1-7
• /
• 2002

In this paper, when users choose a query image, we implemented a content-based image retrieval system that users can simply choose and extract a object region of query wanted with not only a whole image but various objects in it. Histogram is obtained by improved HSV transformations from query image and then candidate images are retrieved rapidly by a 1st similarity measure with histogram intersection using representative colors of query image. And finally retrieved images are extracted since 2nd similarity measure with banded autocorrelogram is performed so that recall and precision are improved by combining two retrieval methods that can make up for respective weak points. Moreover images in the database are indexed automatically within feature library that makes possible to retrieve images rapidly.

• Journal of Internet Computing and Services
• /
• v.11 no.1
• /
• pp.59-69
• /
• 2010

With the growing number of web services, there arise issues of finding suitable services. But, the traditional keyword search method is insufficient for two reasons: (1) this does not capture the underlying semantics of web services. (2) this does not suffice for accurately specifying users' information needs. In order to overcome limitations of this keyword search method, we propose a novel syntactic analysis and ontology learning method. The syntactic analysis method gives us a breadth of coverage for common terms, while the ontology learning method gives a depth of coverage by providing relationships. By combining these two methods, we hope to improve both the recall and the precision. We describe an experimental study on a collection of 508 web services that shows the high recall and precision of our method.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.1
• /
• pp.49-55
• /
• 2019

The character dialogue created by AI is unnatural when compared with human-made dialogue, and it can not reveal the character's personality properly in spite of remarkable development of AI. The purpose of this paper is to classify characters through the linguistic style and to investigate the relation of the specific linguistic style with the personality. We analyzed the dialogues of 92 characters selected from total 60 movies categorized four movie genres, such as romantic comedy, action, comedy and horror/thriller, using Linguistic Inquiry and Word Count (LIWC), a text analysis software. As a result, we confirmed that there is a unique language style according to genre. Especially, we could find that the emotional tone than analytical thinking are two important features to classify. They were analyzed as very important features for classification as the precision and recall is over 78% for romantic comedy and action. However, the precision and recall were 66% and 50% for comedy and horror/thriller. Their impact on classification was less than romantic comedy and action genre. The characters of romantic comedy deal with the affection between men and women using a very high value of emotional tone than analytical thinking. The characters of action genre who need rational judgment to perform mission have much greater analytical thinking than emotional tone. Additionally, in the case of comedy and horror/thriller, we analyzed that they have many kinds of characters and that characters often change their personalities in the story.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.4
• /
• pp.151-160
• /
• 2014

In this paper, a comparison of superpixel characteristics based on SLIC(simple linear iterative clustering) for several color feature spaces is presented. Computer vision applications have come to rely increasingly on superpixels in recent years. Superpixel algorithms group pixels into perceptually meaningful atomic regions, which can be used to replace the rigid structure of the pixel grid. A superpixel is consist of pixels with similar features such as luminance, color, textures etc. Thus superpixels are more efficient than pixels in case of large scale image processing. Generally superpixel characteristics are described by uniformity, boundary precision and recall, compactness. However previous methods only generate superpixels a special color space but lack researches on superpixel characteristics. Therefore we present superpixel characteristics based on SLIC as known popular. In this paper, Lab, Luv, LCH, HSV, YIQ and RGB color feature spaces are used. Uniformity, compactness, boundary precision and recall are measured for comparing characteristics of superpixel. For computer simulation, Berkeley image database(BSD300) is used and Lab color space is superior to the others by the experimental results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.6
• /
• pp.1778-1799
• /
• 2022

Automatic text summarization is a procedure that packs enormous content into a more limited book that incorporates significant data. Malayalam is one of the toughest languages utilized in certain areas of India, most normally in Kerala and in Lakshadweep. Natural language processing in the Malayalam language is relatively low due to the complexity of the language as well as the scarcity of available resources. In this paper, a way is proposed to deal with the text summarization process in Malayalam documents by training a model based on the Support Vector Machine classification algorithm. Different features of the text are taken into account for training the machine so that the system can output the most important data from the input text. The classifier can classify the most important, important, average, and least significant sentences into separate classes and based on this, the machine will be able to create a summary of the input document. The user can select a compression ratio so that the system will output that much fraction of the summary. The model performance is measured by using different genres of Malayalam documents as well as documents from the same domain. The model is evaluated by considering content evaluation measures precision, recall, F score, and relative utility. Obtained precision and recall value shows that the model is trustable and found to be more relevant compared to the other summarizers.

• Structural Engineering and Mechanics
• /
• v.84 no.1
• /
• pp.1-16
• /
• 2022

An efficient and accurate classification method for failure modes of reinforced concrete (RC) columns was proposed based on key characteristic parameters. The weight coefficients of seven characteristic parameters for failure modes of RC columns were determined first based on the support vector machine-recursive feature elimination. Then key characteristic parameters for classifying flexure, flexure-shear and shear failure modes of RC columns were selected respectively. Subsequently, a support vector machine with key characteristic parameters (SVM-K) was proposed to classify three types of failure modes of RC columns. The optimal parameters of SVM-K were determined by using the ten-fold cross-validation and the grid-search algorithm based on 270 sets of available experimental data. Results indicate that the proposed SVM-K has high overall accuracy, recall and precision (e.g., accuracy>95%, recall>90%, precision>90%), which means that the proposed SVM-K has superior performance for classification of failure modes of RC columns. Based on the selected key characteristic parameters for different types of failure modes of RC columns, the accuracy of SVM-K is improved and the decision function of SVM-K is simplified by reducing the dimensions and number of support vectors.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.410-412
• /
• 2021

This paper proposes an improved pedestrian detection method using object and background histograms. Objects detected through the HOG & SVM algorithm are detected in a square shape. Inside the square area, the background and the object area are mixed. If only the area of the object excluding the background is detected, various object-related information may be easily obtained. The size of the detected rectangle is readjusted using an xy-axis projection algorithm to fit the size of the object. And then, the improved object is detected by dividing the background and the object based on the histogram of the object in the readjusted square. The average values of precision and recall, which are reliability evaluations comparing the detected object with the original object, are 97.9% and 90%, respectively.