• Title/Summary/Keyword: Fast retrieval

Search Result 198, Processing Time 0.031 seconds

Enabling a fast annotation process with the Table2Annotation tool

  • Larmande, Pierre;Jibril, Kazim Muhammed
    • Genomics & Informatics
    • /
    • v.18 no.2
    • /
    • pp.19.1-19.6
    • /
    • 2020
  • In semantic annotation, semantic concepts are linked to natural language. Semantic annotation helps in boosting the ability to search and access resources and can be used in information retrieval systems to augment the queries from the user. In the research described in this paper, we aimed to identify ontological concepts in scientific text contained in spreadsheets. We developed a tool that can handle various types of spreadsheets. Furthermore, we used the NCBO Annotator API provided by BioPortal to enhance the semantic annotation functionality to cover spreadsheet data. Table2Annotation has strengths in certain criteria such as speed, error handling, and complex concept matching.

Web Document Clustering based on Graph using Hyperlinks (하이퍼링크를 이용한 그래프 기반의 웹 문서 클러스터링)

  • Lee, Joon;Kang, Jin-Beom;Choi, Joong-Min
    • 한국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.

  • PDF

Development of a Thesaurus Management System based on the Object-Oriented Technique (객체지향 기법을 이용한 시소러스 관리 시스템의 개발에 관한 연구)

  • 박계숙
    • Journal of the Korean Society for information Management
    • /
    • v.13 no.2
    • /
    • pp.5-18
    • /
    • 1996
  • For the construction of thesaurus, a thesaurus management system is needed which can process dynamic variations fast and exactly such as input. correction and deletion of words, and definition of new relationship between words. In this paper, I developed a thesaurus management system based on the object-oriented technique and GUI(graphic user interface) screen, and to enhance the effectiveness of information retrieval. I put emphasis on the expansion of synonym, English and Korean words containing the same concept.

  • PDF

Fast Face Recognition System for Character Retrieval in TV Programs (방송영상에서의 등장인물 검색을 위한 고속 얼굴 인식 시스템)

  • 정병희;하명환;김희정;박현선;이흔진;김회율
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10b
    • /
    • pp.523-525
    • /
    • 2003
  • 방송 프로그램이나 영화와 같은 동영상을 인터넷에서 검색하는 서비스가 활성화됨에 따라 특정 인물이 등장하는 부분을 검색하는 기능은 일반 사용자나 프로그램을 만드는 제작자 모두에게 필요한 기능이 되었다. 등장인물 중심의 검색을 위해서는 해당 인물의 얼굴 검출 및 인식 기능이 필수적이며, 특히 방송영상의 특성에 적합하고 등장인물 검색 서비스에 적용 가능한 얼굴 검출 및 인식 기술이 요구된다 이를 위해 본 논문에서는 고속 얼굴 인식 시스템을 제안하고, 실시간 수행이 가능한 얼굴 검출 및 인식 알고리즘을 제안하다. 제안한 얼굴 검출 및 인식 알고리즘은 DCT 기법을 전처리 단계로 두어 계산량을 최소화하면서도 특징값의 정보량은 유지하는 방법을 사용한다. 본 논문에서는 제안하는 알고리즘이 기존 방법에 비해 우수한 성능을 보이며, 실제 방송 영상을 구현된 시스템에 적용하여 시간과 검출률/인식률 측면에서 우수한 결과를 나타냄을 보인다.

  • PDF

Robust Music Identification Using Long-Term Dynamic Modulation Spectrum

  • Kim, Hyoung-Gook;Eom, Ki-Wan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.25 no.2E
    • /
    • pp.69-73
    • /
    • 2006
  • In this paper, we propose a robust music audio fingerprinting system for automatic music retrieval. The fingerprint feature is extracted from the long-term dynamic modulation spectrum (LDMS) estimation in the perceptual compressed domain. The major advantage of this feature is its significant robustness against severe background noise from the street and cars. Further the fast searching is performed by looking up hash table with 32-bit hash values. The hash value bits are quantized from the logarithmic scale modulation frequency coefficients. Experiments illustrate that the LDMS fingerprint has advantages of high scalability, robustness and small fingerprint size. Moreover, the performance is improved remarkably under the severe recording-noise conditions compared with other power spectrum-based robust fingerprints.

Color Image Segmentation by statistical approach (확률적 방법을 통한 컬러 영상 분할)

  • Gang Seon-Do;Yu Heon-U;Jang Dong-Sik
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.1677-1683
    • /
    • 2006
  • Color image segmentation is useful for fast retrieval in large image database. For that purpose, new image segmentation technique based on the probability of pixel distribution in the image is proposed. Color image is first divided into R, G, and B channel images. Then, pixel distribution from each of channel image is extracted to select to which it is similar among the well known probabilistic distribution function-Weibull, Exponential, Beta, Gamma, Normal, and Uniform. We use sum of least square error to measure of the quality how well an image is fitted to distribution. That P.d.f has minimum score in relation to sum of square error is chosen. Next, each image is quantized into 4 gray levels by applying thresholds to the c.d.f of the selected distribution of each channel. Finally, three quantized images are combined into one color image to obtain final segmentation result. To show the validity of the proposed method, experiments on some images are performed.

  • PDF

Semantic Interference Effect;Contrasting the Lexical Competition with the Concept Competition Hypothesis (의미간섭효과;어휘경쟁가설 대 개념경쟁가설의 비교)

  • Koo, Min-Mo;Nam, Ki-Chun
    • Proceedings of the KSPS conference
    • /
    • 2007.05a
    • /
    • pp.74-77
    • /
    • 2007
  • In order to compare two hypotheses on the origin of semantic interference effect that has been offered in the psycholinguistic literature, we conducted two experiments using the picture-word interference paradigm. When participants named the pictures of the objects simultaneously presented with distractor words, they were required to use either native words (Experiment 1) or loanwords (Experiment 2). The pictures were paired with three kinds of distractor words that were identical, semantically related and neutral to the picture. Two observations were obtained from two experiments. Firstly, the naming times of the pictures were more fast in context of the identical distractors than in context of the neutral ones. Secondly, naming times were more slow in the presence of the semantically related distractors relative to the neutral ones. These findings support the claim that semantic interference is based on a lexical retrieval conflict.

  • PDF

An Adaptive Line Enhancer Using Lattice Notch Filters (격자형 노치 필터를 이용한 정현파 검출기)

  • 조남익;최종호;이상욱
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.4
    • /
    • pp.719-726
    • /
    • 1987
  • In this paper, an adaptive IIR (infinite impulse response) notch filter of lattice type is constructed and its adaptation algorithm is proposed for the detection and retrieval of a sine wave signal embedded in noise. A modified method which adapts only one coefficient of the filter is also suggested. All these methods adapt the coefficients while keepting the poles of the filter inside the unit circle on z-plane, and thus they satisfy the condition on the stability of the IIR filter after it has converged. To investigate the convergence characteristics of these methods such as convergence speed and output S/N ratio, intensive computer simulation has been performed by varying the frequency of the sine wave and the input S/N ratio. And the results of the simulation have been compared to those of Rao and Kung's which shows relatively fast convergence speed. The methods proposed here, especially the second one. shows faster convergence speed and higher output S/N ratio than the Rao and Kung's.

  • PDF

Bianry Searching Algorithm for HIgh Sped Scene Change Indexing of Moving Pictures (동영상의 고속 장면분할을 위한 이진검색 알고리즘)

  • Kim, Seong-Cheol;O, Il-Gyun;Jang, Jong-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.4
    • /
    • pp.1044-1049
    • /
    • 2000
  • In detection of a scene change of the moving pictures which has massive information capacity, the temporal sampling method has faster searching speed than the sequential searching method for the whole moving pictures, yet employed searching algorithm and detection interval greatly affect searching time and searching precision. In this study, the whole moving pictures were primarily retrieved by the temporal sampling method. When there exist a scene change within the sampling interval, we suggested a fast searching algorithm using binary searching and derived an equation formula to determine optimal primary retrieval which can minimize computation, and showed the result of the experiment on MPEG moving pictures. The result of the experiment shows that the searching speed of the suggested algorithm is maximum 13 times faster than the one of he sequential searching method.

  • PDF

A Study about Fast Keyword Retrieval using AC DER table (DER 테이블을 이용한 고속 키워드 탐색)

  • Jung, Kyu-Cheol;Jang, Hae-Suk;Lee, Jin-Kwan;Park, Ki-Hong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11b
    • /
    • pp.761-764
    • /
    • 2003
  • 효율적인 키워드 추출이 정보검색 시스템에서 매우 중요한 일임에도 불구하고 원하는 목적의 적당한 키워드를 결정하는 것은 매우 어렵다. 왜냐하면 많은 복합어를 가지고 있기 때문이다. 기존 방법에서는 AC 머신의 경우 단일 키워드를 가지고 복합 키워드를 검색하지 못한다. 이러한 문제를 해결한 DER 구조의 경우에는 많은 검색시간이 걸리는 문제점을 가지고 있다. 따라서 본 논문에서는 이러한 문제점들을 해결하기 위해 이들을 기반으로 한 DERtable (DER 구조의 검색방법을 가지고 테이블로 구성)구조를 제안한다.

  • PDF