• Title/Summary/Keyword: Similar Search

Search Result 811, Processing Time 0.024 seconds

A Preliminary Examination on the Multimedia Information Needs and Web Searches of College Students in Korea

  • Chung, Eun-Kyung
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.44 no.4
    • /
    • pp.95-114
    • /
    • 2010
  • Multimedia searching is an important activity on the Web, especially among the younger generation. The purpose of this study aims to examine college students’ multimedia information needs and searching on the Internet. While there is a clear pattern among students with respect to their multimedia uses, searching sources, relevance criteria and searching barriers, some differences exist especially according to searching of different multimedia types such as image, audio and video. For multimedia uses, information/data-focused uses are frequently found in image and video, while the use of audio is mainly for object-focused searches. As multimedia searching sources, audio and video files present a similar pattern of being high in media specific searching sources and low in generic search engines. Browsing through related blogs and homepages is an important part of searching for media files accounting for approximately 20% of total search for each media. The relevance criteria used by study participants when search for image files was primarily concerned with topicality while the contextual and media quality in the audio and video types are also considered important. Searching barriers for audio and video files are categorized into three broad aspects, including access and search quality, preview limitations and collection limitations, while obstacles for image files searching include access difficulties and low qualities of various collection.

A Codebook Generation and Search Scheme for FDD Downlink Massive MIMO Systems (주파수 분할 하향링크 거대 다중 안테나 시스템을 위한 코드북 형성 및 검색 기법)

  • Choi, Il-Gyu;Nho, Hoon-Dong;Lee, Chung-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.8
    • /
    • pp.704-711
    • /
    • 2013
  • Applying channel state information feedback scheme based on codebook for FDD downlink MIMO system to massive MIMO system directly causes following two problems. First, codebook generation becomes hard because resources needed for codebook generation increases exponentially in the number of antennas. In addition, long time is needed for channel state information feedback because users's codebook search time increases linearly in the number of antennas. This paper proposes a codebook generation scheme and a codebook search scheme which can reduce resource for codebook generation and codebook search time drastically though they have similar performance as conventional approaches.

A Semantic Service Discovery Network for Large-Scale Ubiquitous Computing Environments

  • Kang, Sae-Hoon;Kim, Dae-Woong;Lee, Young-Hee;Hyun, Soon-J.;Lee, Dong-Man;Lee, Ben
    • ETRI Journal
    • /
    • v.29 no.5
    • /
    • pp.545-558
    • /
    • 2007
  • This paper presents an efficient semantic service discovery scheme called UbiSearch for a large-scale ubiquitous computing environment. A semantic service discovery network in the semantic vector space is proposed where services that are semantically close to each other are mapped to nearby positions so that the similar services are registered in a cluster of resolvers. Using this mapping technique, the search space for a query is efficiently confined within a minimized cluster region while maintaining high accuracy in comparison to the centralized scheme. The proposed semantic service discovery network provides a number of novel features to evenly distribute service indexes to the resolvers and reduce the number of resolvers to visit. Our simulation study shows that UbiSearch provides good semantic searchability as compared to the centralized indexing system. At the same time, it supports scalable semantic queries with low communication overhead, balanced load distribution among resolvers for service registration and query processing, and personalized semantic matching.

  • PDF

The Suggestion of Particular Area Image Search Method (부분 영역 이미지 검색 방법의 제안)

  • Kim, Sungkon
    • The Journal of the Convergence on Culture Technology
    • /
    • v.4 no.4
    • /
    • pp.355-360
    • /
    • 2018
  • We propose a method to connect partial image in whole image to partial image in whole image of other internet site. For this study, we have developed four partial image generation methods and retrieval methods. A method of 'image segmentation' that cuts out only partial images that want to provide information from the whole image, a method of 'creating an image block' that finds outermost points of a cut-out partial image, a method of 'Stamp transformation of outer points', which connects outer points and registers them as the most similar image stamp, and a retrieval method that connects image stamps with other image stamps are developed. We suggested a image search UI that can use image stamps in various ways.

Sequence Stream Indexing Method using DFT and Bitmap in Sequence Data Warehouse (시퀀스 데이터웨어하우스에서 이산푸리에변환과 비트맵을 이용한 시퀀스 스트림 색인 기법)

  • Son, Dong-Won;Hong, Dong-Kweon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.2
    • /
    • pp.181-186
    • /
    • 2012
  • Recently there has been many active researches on searching similar sequences from data generated with the passage of time. Those data are classified as time series data or sequence data and have different semantics from scalar data of traditional databases. In this paper similar sequence search retrieves sequences that have a similar trend of value changes. At first we have transformed the original sequences by applying DFT. The converted data are more suitable for trend analysis and they require less number of attributes for sequence comparisons. In addition we have developed a region-based query and we applied bitmap indexes which could show better performance in data warehouse. We have built bitmap indexes with varying number of attributes and we have found the least cost query plans for efficient similar sequence searches.

Study on MPI-based parallel sequence similarity search in the LINUX cluster (클러스터 환경에서의 MPI 기반 병렬 서열 유사성 검색에 관한 연구)

  • Hong, Chang-Bum;Cha, Jeoung-Ho;Lee, Sung-Hoon;Shin, Seung-Woo;Park, Keun-Joon;Park, Keun-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.6 s.44
    • /
    • pp.69-78
    • /
    • 2006
  • In the field of the bioinformatics, it plays an important role in predicting functional information or structure information to search similar sequence in biological DB. Biolrgical sequences have been increased dramatically since Human Genome Project. At this point, because the searching speed for the similar sequence is highly regarded as the important factor for predicting function or structure, the SMP(Sysmmetric Multi-Processors) computer or cluster is being used in order to improve the performance of searching time. As the method to improve the searching time of BLAST(Basic Local Alighment Search Tool) being used for the similarity sequence search, We suggest the nBLAST algorithm performing on the cluster environment in this paper. As the nBLAST uses the MPI(Message Passing Interface), the parallel library without modifying the existing BLAST source code, to distribute the query to each node and make it performed in parallel, it is possible to easily make BLAST parallel without complicated procedures such as the configuration. In addition, with the experiment performing the nBLAST in the 28 nodes of LINUX cluster, the enhanced performance according to the increase in the number of the nodes has been confirmed.

  • PDF

A Route Search of Urban Traffic Network using Fuzzy Non-Additive Control (퍼지 비가법 제어를 이용한 도시 교통망의 경로 탐색)

  • 이상훈;김성환
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.1
    • /
    • pp.103-113
    • /
    • 2003
  • This paper shows alternative route search and preference route search for the traffic route search, and proposes the use of the fuzzy non-additive controller by the application of AHP(analytic hierarchy process). It is different from classical route search and notices thinking method of human. Appraisal element, weight of route is extracted from basic of the opinion gathering for the driving expert and example of route model was used for the finding of practice utility. Model evaluation was performed attribute membership function making of estimate element, estimate value setting, weight define by the AHP, non additive presentation of weight according to $\lambda$-fuzzy measure and Choquet fuzzy integral. Finally, alternative route search was possible to real time traffic route search for the well variable traffic environment, and preference route search showed reflection of traffic route search disposition for the driver individual. This paper has five important meaning. (1)The approach is similar to the driver's route selection decision process. (2)The approach is able to control of route appraisal criteria for the multiple attribute. (3)The approach makes subjective judgement objective by a non additive. (4)The approach shows dynamic route search for the alternative route search. (5)The approach is able to consider characteristics of individual drivers attributed for the preference route search.

Hexagon-shape Line Search Algorithm for Fast Motion Estimation on Media Processor (미디어프로세서 상의 고속 움직임 탐색을 위한 Hexagon 모양 라인 탐색 알고리즘)

  • Jung Bong-Soo;Jeon Byeung-Woo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.4 s.310
    • /
    • pp.55-65
    • /
    • 2006
  • Most of fast block motion estimation algorithms reported so far in literatures aim to reduce the computation in terms of the number of search points, thus do not fit well with multimedia processors due to their irregular data flow. For multimedia processors, proper reuse of data is more important than reducing number of absolute difference operations because the execution cycle performance strongly depends on the number of off-chip memory access. Therefore, in this paper, we propose a Hexagon-shape line search (HEXSLS) algorithm using line search pattern which can increase data reuse from on-chip local buffer, and check sub-sampling points in line search pattern to reduce unnecessary SAD operation. Our experimental results show that the prediction error (MAE) performance of the proposed HEXSLS is similar to that of the full search block matching algorithm (FSBMA), while compared with the hexagon-based search (HEXBS), the HEXSLS outperforms. Also the proposed HEXSLS requires much lesser off-chip memory access than the conventional fast motion estimation algorithm such as the hexagon-based search (HEXBS) and the predictive line search (PLS). As a result, the proposed HEXSLS algorithm requires smaller number of execution cycles on media processor.

HummingBird: A Similar Music Retrieval System using Improved Scaled and Warped Matching (HummingBird: 향상된 스케일드앤워프트 매칭을 이용한 유사 음악 검색 시스템)

  • Lee, Hye-Hwan;Shim, Kyu-Seok;Park, Hyoung-Min
    • Journal of KIISE:Databases
    • /
    • v.34 no.5
    • /
    • pp.409-419
    • /
    • 2007
  • Database community focuses on the similar music retrieval systems for music database when a humming query is given. One of the approaches is converting the midi data to time series, building their indices and performing the similarity search on them. Queries based on humming can be transformed to time series by using the known pitch detection algorithms. The recently suggested algorithm, scaled and warped matching, is based on dynamic time warping and uniform scaling. This paper proposes Humming BIRD(Humming Based sImilaR mini music retrieval system) using sliding window and center-aligned scaled and warped matching. Center-aligned scaled and warped matching is a mixed distance measure of center-aligned uniform scaling and time warping. The newly proposed measure gives tighter lower bound than previous ones which results in reduced search space. The empirical results show the superiority of this algorithm comparing the pruning power while it returns the same results.

A Study on the Variance Based Self-similar Block Search for Fractal Image Compression (프랙탈 이미지 압축을 위한 분산 기반 유사 블록 탐색 연구)

  • Ham, Do-Yong;Kim, Jong-Gu;Kim, Ha-Jin;Wi, Yeong-Cheol
    • Journal of the Korea Computer Graphics Society
    • /
    • v.7 no.1
    • /
    • pp.11-17
    • /
    • 2001
  • Fractal image coding provides many promising qualities including the high compression ratio. The coding process however suffers from the long search time of domain block pool because the size of the domain block pool is often very large. In this paper, we introduce a hybrid domain block pool search method that combines the block classification and the variance based searching. This hybrid method makes use of the fact that the variance of a block is independent of the block classification. Thus, this hybrid method enhances the search speed by up to an O(number of classes) factor over the purely variance based searching method. An experimental result shows that our method enhances the search speed by up to 17 times over the purely variance based searching method. We also propose an adjustable variance based searching method that further enhances the search speed without noticeable loss of image quality.

  • PDF