• Title/Summary/Keyword: Search Query

Search Result 690, Processing Time 0.023 seconds

An Efficient Audio Indexing Scheme based on User Query Patterns (사용자 질의 패턴을 이용한 효율적인 오디오 색인기법)

  • 노승민;박동문;황인준
    • Journal of KIISE:Databases
    • /
    • v.31 no.4
    • /
    • pp.341-351
    • /
    • 2004
  • With the popularity of digital audio contents, querying and retrieving audio contents efficiently from database has become essential. In this paper, we propose a new index scheme for retrieving audio contents efficiently using audio portions that have been queried frequently. This scheme is based on the observation that users have a tendency to memorize and query a small number of audio portions. Detecting and indexing such portions enables fast retrieval and shows better performance than sequential search-based audio retrieval. Moreover, this scheme is independent of underlying retrieval system, which means this scheme can work together with any other audio retrieval system. We have implemented a prototype system and showed its performance gain through experiments.

A Probabilistic Context Sensitive Rewriting Method for Effective Transliteration Variants Generation (효과적인 외래어 이형태 생성을 위한 확률 문맥 의존 치환 방법)

  • Lee, Jae-Sung
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.2
    • /
    • pp.73-83
    • /
    • 2007
  • An information retrieval system, using exact match, needs preprocessing or query expansion to generate transliteration variants in order to search foreign word transliteration variants in the documents. This paper proposes an effective method to generate other transliteration variants from a given transliteration. Because simple rewriting of confused characters produces too many false variants, the proposed method controls the generation priority by learning confusion patterns from real uses and calculating their probability. Especially, the left and right context of a pattern is considered, and local rewriting probability and global rewriting probability are calculated to produce more probable variants in earlier stage. The experimental result showed that the method was very effective by showing more than 80% recall with top 20 generations for a transliteration variants set collected from KT SET 2.0.

Semantics Accumulation-Enabled Relevance Feedback (영상에 대한 Semantics 축적이 가능한 Relevance Feedback)

  • Oh, Sang-Wook;Sull, Sang-Hoon;Chung, Min-Gyo
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.10
    • /
    • pp.1306-1313
    • /
    • 2005
  • Relevance Feedback(RF), a method to use perceptual feedback in image retrieval, refines a query by the relevance information from a user. However, the user's feedback information is thrown away as soon as a search session ends. So, this paper proposes an enhanced version of RF, which is designed to accumulate human perceptual responses over time through relevance feedback and to dynamically combine the accumulated high-level relevance information with low-level features to further improve the retrieval effectiveness. Experimental results are presented to prove the potential of the proposed RF.

  • PDF

A Study on Improved Split Algorithms for Moving Object Trajectories in Limited Storage Space (한정된 저장 공간상에서 이동 객체 궤적들에 대한 개선된 분할 알고리즘에 관한 연구)

  • Park, Ju-Hyun;Cho, Woo-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.2057-2064
    • /
    • 2010
  • With the development of wireless network technology, the location information of a spatiotemporal object which changes their location is used in various application. Each spatiotemporal object has many location information, hence it is inefficient to search all trajectory information of spatiotemporal objects for a range query. In this paper, we propose an efficient method which divides a trajectory and stores its division data on restricted storage space. Using suboptimal split algorithm, an extended split algorithm that minimizes the volume of EMBRs(Extended Minimum Bounding Box) is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy

Development of a system for keyword-based navigation on multiple sites (키워드 기반의 다중 사이트 항해 시스템 개발)

  • Hwang, Chun-Sik;Kim, Hee-Jin;Jung, Hyo-Sook;Yoo, Su-Jin;Park, Seong-Bin
    • The Journal of Korean Association of Computer Education
    • /
    • v.14 no.1
    • /
    • pp.123-135
    • /
    • 2011
  • In this paper, we propose a system that starts with the searching result of user's query and continuously offers new keywords related to the query. The primary purpose of the proposed system is to help users find information that the users cannot explain clearly. The proposed system obtains useful information by connecting different information sources, represents the information under an integrated schema, and offers a cross searching environment. In addition, it presents a visualized diagram that shows relations between keywords so that users can easily find the desired information. Therefore users can find information easily in an envirionment that is not limited to a certain site.

  • PDF

An Efficient Grid Method for Continuous Skyline Computation over Dynamic Data Set

  • Li, He;Jang, Su-Min;Yoo, Kwan-Hee;Yoo, Jae-Soo
    • International Journal of Contents
    • /
    • v.6 no.1
    • /
    • pp.47-52
    • /
    • 2010
  • Skyline queries are an important new search capability for multi-dimensional databases. Most of the previous works have focused on processing skyline queries over static data set. However, most of the real applications deal with the dynamic data set. Since dynamic data set constantly changes as time passes, the continuous skyline computation over dynamic data set becomes ever more complicated. In this paper, we propose a multiple layer grids method for continuous skyline computation (MLGCS) that maintains multiple layer grids to manage the dynamic data set. The proposed method divides the work space into multiple layer grids and creates the skyline influence region in the grid of each layer. In the continuous environment, the continuous skyline queries are only handled when the updating data points are in the skyline influence region of each layer grid. Experiments based on various data distributions show that our proposed method outperforms the existing methods.

Design and Implementation of Query-by-humming system using MPQF asynchronous search interface (MPQF 비동기 검색 인터페이스를 이용한 허밍 검색 시스템의 설계 및 구현)

  • Lee, Jong-Seol;Jang, Se-Jin;Lee, Seok-Pil
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.07a
    • /
    • pp.215-218
    • /
    • 2012
  • 반도체 기술 및 방송통신기술의 발달에 따라 소비자는 복잡하고 다양한 서비스 환경을 접하고 있으며, 개인당 소비되는 콘텐츠의 양은 기하급수적으로 증가 되고 있다. 스마트폰과 같은 멀티미디어기기의 발전으로 기존의 단순 시청에서 벗어나 멀티미디어 검색과 추천과 같은 다양한 서비스들이 제공되고 있으며, 웹과 인터넷을 기반으로 하는 정보기술은 모바일 전자 기술의 발달에 따라 데스크톱이라는 공간적인 한계를 벗어나 유기적인 유비쿼터스 환경으로 변화하고 있다. 이와 같이 소비자들이 접하는 멀티미디어의 양이 증가됨에 따라, 멀티미디어를 검색하기 위한 다양 서비스들이 사업자들을 통해 제공되고 있다. 그러나 사업자들이 구축한 서버들은 공유되어지지 못하며, 공유되더라도 공유하기 위한 방법이 제각각이다. 이에 MPEG에서는 멀티미디어 콘텐츠를 검색하기 위한 질의 구조를 표준화 하여, 서비스 제공자 및 소비자들에게 유용한 검색 인터페이스를 제공하였다. 이에 본 논문에서는 MPEG Query Format에 기반 하여 임베디드 환경에서 광대한 양의 음악 콘텐츠에서 사용자가 원하는 허밍 질의를 편리하게 검색하기 위한 방법을 성계 및 구현한다.

  • PDF

A New Design Method for Multi-functional Pull-down menu based on Stacking Rules (쌓임 규칙에 기반한 복합기능을 가진 풀다운메뉴 설계 방법)

  • Cho, Han Soo
    • Smart Media Journal
    • /
    • v.5 no.1
    • /
    • pp.104-113
    • /
    • 2016
  • A new design method for multi-functional pull-down menu based on stacking rules is proposed. The importance of a design point of view has been emphasized in many previous studies on web navigation. Taking technical aspects with an emphasis on programming techniques into consideration in this paper, multiple elements, which are used for constructing main menu of the pull-down menu, are capable of performing their unique functions independently in addition to basic classification function by disposing them to separated layers using stacking rules. Furthermore, the improvement of visual effects and efficiency for information navigation can be expected by implementing submenu selection-bar using animation techniques and function to automatically search submenu item. Finally, the effectiveness of the proposed method is identified by implementing multi-functional pull-down menu using CSS and jQuery.

Retrieval of Player Event in Golf Videos Using Spoken Content Analysis (음성정보 내용분석을 통한 골프 동영상에서의 선수별 이벤트 구간 검색)

  • Kim, Hyoung-Gook
    • The Journal of the Acoustical Society of Korea
    • /
    • v.28 no.7
    • /
    • pp.674-679
    • /
    • 2009
  • This paper proposes a method of player event retrieval using combination of two functions: detection of player name in speech information and detection of sound event from audio information in golf videos. The system consists of indexing module and retrieval module. At the indexing time audio segmentation and noise reduction are applied to audio stream demultiplexed from the golf videos. The noise-reduced speech is then fed into speech recognizer, which outputs spoken descriptors. The player name and sound event are indexed by the spoken descriptors. At search time, text query is converted into phoneme sequences. The lists of each query term are retrieved through a description matcher to identify full and partial phrase hits. For the retrieval of the player name, this paper compares the results of word-based, phoneme-based, and hybrid approach.

A Multi-level Inverted Index Technique for Structural Document Search (구조화 문서 검색을 위한 다단계 역색인 기법)

  • Kim, Jong-Ik
    • The KIPS Transactions:PartB
    • /
    • v.15B no.4
    • /
    • pp.355-364
    • /
    • 2008
  • In general, we can use an inverted index for retrieving element lists from structured documents. An inverted index can retrieve a list of elements that have the same tag name. In this approach, however, the cost of query processing is linear to the length of a path query because all the structural relationships (parent-child and ancestor-descendant) should be resolved by structural join operations. In this paper, we propose an inverted index technique and a novel structural join technique for accelerating XML path query evaluation. Our inverted index can retrieve element lists for path segments in a parent-child relationship. Our structural join technique can handle lists of element pairs while the existing techniques handle lists of elements. We show through experiments that these two proposed techniques are integrated to accelerate evaluation of XML path queries.