• Title/Summary/Keyword: 유사도 질의

Search Result 1,858, Processing Time 0.059 seconds

Relevance Feedback using Region-of-interest in Retrieval of Satellite Images (위성영상 검색에서 사용자 관심영역을 이용한 적합성 피드백)

  • Kim, Sung-Jin;Chung, Chin-Wan;Lee, Seok-Lyong;Kim, Deok-Hwan
    • Journal of KIISE:Databases
    • /
    • v.36 no.6
    • /
    • pp.434-445
    • /
    • 2009
  • Content-based image retrieval(CBIR) is the retrieval technique which uses the contents of images. However, in contrast to text data, multimedia data are ambiguous and there is a big difference between system's low-level representation and human's high-level concept. So it doesn't always mean that near points in the vector space are similar to user. We call this the semantic-gap problem. Due to this problem, performance of image retrieval is not good. To solve this problem, the relevance feedback(RF) which uses user's feedback information is used. But existing RF doesn't consider user's region-of-interest(ROI), and therefore, irrelevant regions are used in computing new query points. Because the system doesn't know user's ROI, RF is proceeded in the image-level. We propose a new ROI RF method which guides a user to select ROI from relevant images for the retrieval of complex satellite image, and this improves the accuracy of the image retrieval by computing more accurate query points in this paper. Also we propose a pruning technique which improves the accuracy of the image retrieval by using images not selected by the user in this paper. Experiments show the efficiency of the proposed ROI RF and the pruning technique.

Query-based Answer Extraction using Korean Dependency Parsing (의존 구문 분석을 이용한 질의 기반 정답 추출)

  • Lee, Dokyoung;Kim, Mintae;Kim, Wooju
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.3
    • /
    • pp.161-177
    • /
    • 2019
  • In this paper, we study the performance improvement of the answer extraction in Question-Answering system by using sentence dependency parsing result. The Question-Answering (QA) system consists of query analysis, which is a method of analyzing the user's query, and answer extraction, which is a method to extract appropriate answers in the document. And various studies have been conducted on two methods. In order to improve the performance of answer extraction, it is necessary to accurately reflect the grammatical information of sentences. In Korean, because word order structure is free and omission of sentence components is frequent, dependency parsing is a good way to analyze Korean syntax. Therefore, in this study, we improved the performance of the answer extraction by adding the features generated by dependency parsing analysis to the inputs of the answer extraction model (Bidirectional LSTM-CRF). The process of generating the dependency graph embedding consists of the steps of generating the dependency graph from the dependency parsing result and learning the embedding of the graph. In this study, we compared the performance of the answer extraction model when inputting basic word features generated without the dependency parsing and the performance of the model when inputting the addition of the Eojeol tag feature and dependency graph embedding feature. Since dependency parsing is performed on a basic unit of an Eojeol, which is a component of sentences separated by a space, the tag information of the Eojeol can be obtained as a result of the dependency parsing. The Eojeol tag feature means the tag information of the Eojeol. The process of generating the dependency graph embedding consists of the steps of generating the dependency graph from the dependency parsing result and learning the embedding of the graph. From the dependency parsing result, a graph is generated from the Eojeol to the node, the dependency between the Eojeol to the edge, and the Eojeol tag to the node label. In this process, an undirected graph is generated or a directed graph is generated according to whether or not the dependency relation direction is considered. To obtain the embedding of the graph, we used Graph2Vec, which is a method of finding the embedding of the graph by the subgraphs constituting a graph. We can specify the maximum path length between nodes in the process of finding subgraphs of a graph. If the maximum path length between nodes is 1, graph embedding is generated only by direct dependency between Eojeol, and graph embedding is generated including indirect dependencies as the maximum path length between nodes becomes larger. In the experiment, the maximum path length between nodes is adjusted differently from 1 to 3 depending on whether direction of dependency is considered or not, and the performance of answer extraction is measured. Experimental results show that both Eojeol tag feature and dependency graph embedding feature improve the performance of answer extraction. In particular, considering the direction of the dependency relation and extracting the dependency graph generated with the maximum path length of 1 in the subgraph extraction process in Graph2Vec as the input of the model, the highest answer extraction performance was shown. As a result of these experiments, we concluded that it is better to take into account the direction of dependence and to consider only the direct connection rather than the indirect dependence between the words. The significance of this study is as follows. First, we improved the performance of answer extraction by adding features using dependency parsing results, taking into account the characteristics of Korean, which is free of word order structure and omission of sentence components. Second, we generated feature of dependency parsing result by learning - based graph embedding method without defining the pattern of dependency between Eojeol. Future research directions are as follows. In this study, the features generated as a result of the dependency parsing are applied only to the answer extraction model in order to grasp the meaning. However, in the future, if the performance is confirmed by applying the features to various natural language processing models such as sentiment analysis or name entity recognition, the validity of the features can be verified more accurately.

Image Retrieval Using the Fusion of Spatial Histogram and Wavelet Moments (공간 히스토그램과 웨이브렛 모멘트의 융합에 의한 영상검색)

  • Seo, Sang-Yong;Kim, Nam-Cheol
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.4
    • /
    • pp.434-441
    • /
    • 2001
  • We present an image retrieval method for improving retrieval performance by the effective fusion of spatial histogram and wavelet moments. In this method, the similarity for spatial histograms and the similarity for wavelet moment are effectively fused in the computation of the similarity between a query image and DB image. That is, the wavelet moments feature represented in multi-resolution and the spatial histogram feature robust to translation and rotation are used to improve retrieval performance. In order to evaluate the performance of the proposed method, we use Brodatz texture DB, MPEG-7 T1 DB, and Corel Draw Photo DB. Experimental results show that the proposed method yields 5.3% and 13.8% better Performances for Brodatz DB, and 15.5% and 3.2% better Performances for Corel Draw Photo DB over the histogram method and the wavelet moment method, respectively.

  • PDF

The Effect of an Integrated Rating Prediction Method on Performance Improvement of Collaborative Filtering (통합 평가치 예측 방안의 협력 필터링 성능 개선 효과)

  • Lee, Soojung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.5
    • /
    • pp.221-226
    • /
    • 2021
  • Collaborative filtering based recommender systems recommend user-preferrable items based on rating history and are essential function for the current various commercial purposes. In order to determine items to recommend, prediction of preference score for unrated items is estimated based on similar rating history. Previous studies usually employ two methods individually, i.e., similar user based or similar item based ones. These methods have drawbacks of degrading prediction accuracy in case of sparse user ratings data or when having difficulty with finding similar users or items. This study suggests a new rating prediction method by integrating the two previous methods. The proposed method has the advantage of consulting more similar ratings, thus improving the recommendation quality. The experimental results reveal that our method significantly improve the performance of previous methods, in terms of prediction accuracy, relevance level of recommended items, and that of recommended item ranks with a sparse dataset. With a rather dense dataset, it outperforms the previous methods in terms of prediction accuracy and shows comparable results in other metrics.

ECoMOT : An Efficient Content-based Multimedia Information Retrieval System Using Moving Objects' Trajectories in Video Data (ECoMOT : 비디오 데이터내의 이동체의 제적을 이용한 효율적인 내용 기반 멀티미디어 정보검색 시스템)

  • Shim Choon-Bo;Chang Jae-Woo;Shin Yong-Won;Park Byung-Rae
    • The KIPS Transactions:PartB
    • /
    • v.12B no.1 s.97
    • /
    • pp.47-56
    • /
    • 2005
  • A moving object has a various features that its spatial location, shape, and size are changed as time goes. In addition, the moving object has both temporal feature and spatial feature. It is one of the highly interested feature information in video data. In this paper, we propose an efficient content-based multimedia information retrieval system, so tailed ECoMOT which enables user to retrieve video data by using a trajectory information of moving objects in video data. The ECoMOT includes several novel techniques to achieve content-based retrieval using moving objects' trajectories : (1) Muitiple trajectory modeling technique to model the multiple trajectories composed of several moving objects; (2) Multiple similar trajectory retrieval technique to retrieve more similar trajectories by measuring similarity between a given two trajectories composed of several moving objects; (3) Superimposed signature-based trajectory indexing technique to effectively search corresponding trajectories from a large trajectory databases; (4) convenient trajectory extraction, query generation, and retrieval interface based on graphic user interface

Signature-based Indexing Scheme for Similar Sub-Trajectory Retrieval of Moving Objects (이동 객체의 유사 부분궤적 검색을 위한 시그니쳐-기반 색인 기법)

  • Shim, Choon-Bo;Chang, Jae-Woo
    • The KIPS Transactions:PartD
    • /
    • v.11D no.2
    • /
    • pp.247-258
    • /
    • 2004
  • Recently, there have been researches on storage and retrieval technique of moving objects, which are highly concerned by user in database application area such as video databases, spatio-temporal databases, and mobile databases. In this paper, we propose a new signature-based indexing scheme which supports similar sub-trajectory retrieval at well as good retrieval performance on moving objects trajectories. Our signature-based indexing scheme is classified into concatenated signature-based indexing scheme for similar sub-trajectory retrieval, entitled CISR scheme and superimposed signature-based indexing scheme for similar sub-trajectory retrieval, entitled SISR scheme according to generation method of trajectory signature based on trajectory data of moving object. Our indexing scheme can improve retrieval performance by reducing a large number of disk access on data file because it first scans all signatures and does filtering before accessing the data file. In addition, we can encourage retrieval efficiency by appling k-warping algorithm to measure the similarity between query trajectory and data trajectory. Final]y, we evaluate the performance on sequential scan method(SeqScan), CISR scheme, and SISR scheme in terms of data insertion time, retrieval time, and storage overhead. We show from our experimental results that both CISR scheme and SISR scheme are better than sequential scan in terms of retrieval performance and SISR scheme is especially superior to the CISR scheme.

An Efficient Frequent Melody Indexing Method to Improve Performance of Query-By-Humming System (허밍 질의 처리 시스템의 성능 향상을 위한 효율적인 빈번 멜로디 인덱싱 방법)

  • You, Jin-Hee;Park, Sang-Hyun
    • Journal of KIISE:Databases
    • /
    • v.34 no.4
    • /
    • pp.283-303
    • /
    • 2007
  • Recently, the study of efficient way to store and retrieve enormous music data is becoming the one of important issues in the multimedia database. Most general method of MIR (Music Information Retrieval) includes a text-based approach using text information to search a desired music. However, if users did not remember the keyword about the music, it can not give them correct answers. Moreover, since these types of systems are implemented only for exact matching between the query and music data, it can not mine any information on similar music data. Thus, these systems are inappropriate to achieve similarity matching of music data. In order to solve the problem, we propose an Efficient Query-By-Humming System (EQBHS) with a content-based indexing method that efficiently retrieve and store music when a user inquires with his incorrect humming. For the purpose of accelerating query processing in EQBHS, we design indices for significant melodies, which are 1) frequent melodies occurring many times in a single music, on the assumption that users are to hum what they can easily remember and 2) melodies partitioned by rests. In addition, we propose an error tolerated mapping method from a note to a character to make searching efficient, and the frequent melody extraction algorithm. We verified the assumption for frequent melodies by making up questions and compared the performance of the proposed EQBHS with N-gram by executing various experiments with a number of music data.

Efficient Multi-Step k-NN Search Methods Using Multidimensional Indexes in Large Databases (대용량 데이터베이스에서 다차원 인덱스를 사용한 효율적인 다단계 k-NN 검색)

  • Lee, Sanghun;Kim, Bum-Soo;Choi, Mi-Jung;Moon, Yang-Sae
    • Journal of KIISE
    • /
    • v.42 no.2
    • /
    • pp.242-254
    • /
    • 2015
  • In this paper, we address the problem of improving the performance of multi-step k-NN search using multi-dimensional indexes. Due to information loss by lower-dimensional transformations, existing multi-step k-NN search solutions produce a large tolerance (i.e., a large search range), and thus, incur a large number of candidates, which are retrieved by a range query. Those many candidates lead to overwhelming I/O and CPU overheads in the postprocessing step. To overcome this problem, we propose two efficient solutions that improve the search performance by reducing the tolerance of a range query, and accordingly, reducing the number of candidates. First, we propose a tolerance reduction-based (approximate) solution that forcibly decreases the tolerance, which is determined by a k-NN query on the index, by the average ratio of high- and low-dimensional distances. Second, we propose a coefficient control-based (exact) solution that uses c k instead of k in a k-NN query to obtain a tigher tolerance and performs a range query using this tigher tolerance. Experimental results show that the proposed solutions significantly reduce the number of candidates, and accordingly, improve the search performance in comparison with the existing multi-step k-NN solution.

The Comparison Study of Quality of Life between Hemodialysis Patients and Depressive or Anxious Psychiatric Patients (혈액투석 환자와 우울 또는 불안장애 환자의 삶의 질 비교연구)

  • Kim, Ji-Woong;Shin, Sang-Eun;Kim, Hyung-Ki;Jang, Eun-Young;Jung, Gun;Lee, Kye-Seong
    • Korean Journal of Psychosomatic Medicine
    • /
    • v.11 no.2
    • /
    • pp.170-181
    • /
    • 2003
  • Objectives: The purpose of this study was to evaluate the quality of life in hemodialysis patients and compare it with those of depression or anxiety patients. Methods: Quality of life in hemodialysis patients(n=33) and depression or anxiety patients(n=34) was evaluated. we performed Korean Version of WHO Quality of Life Scale Abbreviated Version(WHOQOL-BREF), Beck Depression Inventory(BDI), State-Trait Anxiety inventory(STAI) to both hemodialysis patients and depression or anxiety patients. Results: The WHOQOL mean scores showed no differences between hemodialysis patients and depression or anxiety patients. Among WHOQOL domains, psychological domain score of WHOQOL was significantly higher in hemodialysis patients than in depression or anxiety patients. Anxiety score of hemodialysis patients was significantly lower than that of depression or anxiety patients, while depression score showed no difference. Conclusion: These results show that psychological domain score of WHOQOL was higher and anxiety score was lower in hemodialysis patients than in depression or anxiety patients. However, there were no significant differences in total QOL and depression between hemodialysis patients and depression or anxiety patients, and the prevalences of depression and anxiety were higher in hemodialysis patients than those of general population. This suggest that hemodialysis patients need more specialized help for psychiatric problems.

  • PDF

Application Study of $CO_2$ Snow Cleaning for Cleaning of Foreign Matter and Corrosion Products on Iron Artifacts ($CO_2$ Snow Cleaning 적용 철제유물 표면 이물질 제거 연구)

  • Lee, Eun-Ji;Cho, Nam-Chul;Lee, Jong-Myong;Yu, Jae-Eun
    • Journal of Conservation Science
    • /
    • v.27 no.3
    • /
    • pp.333-344
    • /
    • 2011
  • Cleaning of foreign matter and corrosion products on surface among conservation treatment of iron artifacts is an important part for looking up a original form. The sand blaster is the most popular equipment when it removes the foreign matter and corrosion products on iron artifacts surface. Current foreign matter and corrosion products equipment, which mostly uses, is sand blaster. Glass dust which sprayed from sand blaster is harmful and causing environmental pollution. In order to solve these problems, we investigated the $CO_2$ snow cleaning that use a eco-friendly equipment to apply for cleaning foreign matter and corrosion products on surface of iron artifacts. It examined by using sand blaster and $CO_2$ snow cleaning to aged steel coupon and iron artifacts. In case of aged steel coupon, the result showed that the sand blaster and $CO_2$ snow cleaning methods were similar to the degrees of cleaning foreign matter and corrosion products, through surface roughness, color measurement and SEM. $CO_2$ snow cleaning applied to aged steel coupons weren't worn out the surface in comparison with sand blaster by SEM. When applied to the iron artifacts, power nozzle of the $CO_2$ snow cleaning was an excellent cleaning effect that surface wern't worn out in comparison with sand blaster. And, it showed that internal structure change of metal was no found before and after cleaning by X-ray radiography. Consequently, we confirmed that cleaning of the sand blaster and power nozzle of $CO_2$ snow cleaning were similar to the effect. But, it's very careful to use this method because of high outlet pressure of power nozzle for applying to the iron artifacts. As a result of experiments, it could be found that the cleaning methods should be selected depending on internal state of the artifacts.