• Title/Summary/Keyword: retrieval time

Search Result 841, Processing Time 0.024 seconds

Medical Image Retrieval based on Multi-class SVM and Correlated Categories Vector

  • Park, Ki-Hee;Ko, Byoung-Chul;Nam, Jae-Yeal
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.8C
    • /
    • pp.772-781
    • /
    • 2009
  • This paper proposes a novel algorithm for the efficient classification and retrieval of medical images. After color and edge features are extracted from medical images, these two feature vectors are then applied to a multi-class Support Vector Machine, to give membership vectors. Thereafter, the two membership vectors are combined into an ensemble feature vector. Also, to reduce the search time, Correlated Categories Vector is proposed for similarity matching. The experimental results show that the proposed system improves the retrieval performance when compared to other methods.

Similar Sub-Trajectory Retrieval based on k-warping Algorithm for Moving Objects in Video Databases (비디오 데이타베이스에서 이동 객체를 위한 k-워핑 알고리즘 기반 유사 부분궤적 검색)

  • 심춘보;장재우
    • Journal of KIISE:Databases
    • /
    • v.30 no.1
    • /
    • pp.14-26
    • /
    • 2003
  • Moving objects' trajectories play an important role in indexing video data on their content and semantics for content-based video retrieval. In this paper, we propose new similar sub-trajectory retrieval schemes based on k-warping algorithm for efficient retrieval on moving objects' trajectories in video data. The proposed schemes are fixed-replication similar sub-trajectory retrieval(FRSR) and variable-replication similar sub-trajectory retrieval(VRSR). The former can replicate motions with a fixed number for all motions being composed of the trajectory. The latter can replicate motions with a variable number. Our schemes support multiple properties including direction, distance, and time interval as well as a single property of direction, which is mainly used for modeling moving objects' trajectories. Finally, we show from our experiment that our schemes outperform Li's scheme(no-warping) and Shan's scheme(infinite-warping) in terns of precision and recall measures.

A Study on Travel Time Model of double shuttle AS/RS (이중 셔틀 자동창고 시스템의 주행시간 모델에 관한 연구)

  • Chae-Soo Kim;Seong-Whan Shinn
    • Journal of the Korea Safety Management & Science
    • /
    • v.3 no.3
    • /
    • pp.97-106
    • /
    • 2001
  • This paper considers automated storage and retrieval systems with double shuttle. We developed the expected travel time model based on the first come first served rule. An heuristic procedure by retrieval order sequencing was presented which aimed to improve the operation efficiency laking advantage of "No cost zone". Through sensitivity study, we evaluated the performance of the double shuttle system working on the four command cycle.

  • PDF

Feature-Based Image Retrieval using SOM-Based R*-Tree

  • Shin, Min-Hwa;Kwon, Chang-Hee;Bae, Sang-Hyun
    • Proceedings of the KAIS Fall Conference
    • /
    • 2003.11a
    • /
    • pp.223-230
    • /
    • 2003
  • Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R*-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R*-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R*-tree combines SOM and R*-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R*-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R*-tree with that of an SOM and an R*-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R*-tree outperforms both the SOM and R*-tree due to the reduction of the number of nodes required to build R*-tree and retrieval time cost.

  • PDF

Knowledge-based Video Retrieval System Using Korean Closed-caption (한국어 폐쇄자막을 이용한 지식기반 비디오 검색 시스템)

  • 조정원;정승도;최병욱
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.3
    • /
    • pp.115-124
    • /
    • 2004
  • The content-based retrieval using low-level features can hardly provide the retrieval result that corresponds with conceptual demand of user for intelligent retrieval. Video includes not only moving picture data, but also audio or closed-caption data. Knowledge-based video retrieval is able to provide the retrieval result that corresponds with conceptual demand of user because of performing automatic indexing with such a variety data. In this paper, we present the knowledge-based video retrieval system using Korean closed-caption. The closed-caption is indexed by Korean keyword extraction system including the morphological analysis process. As a result, we are able to retrieve the video by using keyword from the indexing database. In the experiment, we have applied the proposed method to news video with closed-caption generated by Korean stenographic system, and have empirically confirmed that the proposed method provides the retrieval result that corresponds with more meaningful conceptual demand of user.

A Comparative Analysis of Music Similarity Measures in Music Information Retrieval Systems

  • Gurjar, Kuldeep;Moon, Yang-Sae
    • Journal of Information Processing Systems
    • /
    • v.14 no.1
    • /
    • pp.32-55
    • /
    • 2018
  • The digitization of music has seen a considerable increase in audience size from a few localized listeners to a wider range of global listeners. At the same time, the digitization brings the challenge of smoothly retrieving music from large databases. To deal with this challenge, many systems which support the smooth retrieval of musical data have been developed. At the computational level, a query music piece is compared with the rest of the music pieces in the database. These systems, music information retrieval (MIR systems), work for various applications such as general music retrieval, plagiarism detection, music recommendation, and musicology. This paper mainly addresses two parts of the MIR research area. First, it presents a general overview of MIR, which will examine the history of MIR, the functionality of MIR, application areas of MIR, and the components of MIR. Second, we will investigate music similarity measurement methods, where we provide a comparative analysis of state of the art methods. The scope of this paper focuses on comparative analysis of the accuracy and efficiency of a few key MIR systems. These analyses help in understanding the current and future challenges associated with the field of MIR systems and music similarity measures.

An Extracting and Indexing Schema of Compressed Medical Images (축소변환된 의료 이미지의 질감 특징 추출과 인덱싱)

  • 위희정;엄기현
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2000.04a
    • /
    • pp.328-331
    • /
    • 2000
  • In this paper , we propose a texture feature extraction method of reduce the massive computational time on extracting texture, features of large sized medical such as MRI, CT-scan , and an index structure, called GLTFT, to speed up the retrieval performance. For these, the original image is transformed into a compressed image by Wavelet transform , and textural features such as contrast, energy, entropy, and homogeneity of the compressed image is extracted by using GLCM(Gray Level Co-occurrence Metrix) . The proposed index structure is organized by using the textural features. The processing in compressed domain can give the solution of storage space and the reduction of computational time of feature extracting . And , by GLTFT index structure, image retrieval performance can be expected to be improved by reducing the retrieval range . Our experiment on 270 MRIs as image database shows that shows that such expectation can be got.

  • PDF

3D Knowledge Retrieval for e-Learning Construction (이러닝 구축을 위한 3D 지식 검색)

  • Kim, Gui-Jung;Han, Jung-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.7
    • /
    • pp.63-69
    • /
    • 2010
  • This research does focus on supporting all of formal, or informal learning at real time. From industry or education field, learning training is according to worker's current situation or business context. And according to worker's current situation, or business flow, 3D immersion knowledge visualization is effective in the individual ability and the learning progress For this, workers listen to compound knowledge coaching advices at real time. Therefore we developed the realistic 3D based knowledge retrieval method to identify and retrieve multidimensional relation easily.

Travel Time Models of a Hybrid Automated Storage/Retrieval Module for Small and Medium-Sized Enterprises (중소기업용 혼합형 자동창고에 대한 주행시간 모형)

  • Lee, Moon-Kyu
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.52-61
    • /
    • 2004
  • During the past decades automated storage/retrieval (AS/R) systems have been dominantly implemented in most industrial fields due to their handling efficiency and high utilization of storage space. Such AS/R systems consist of several modules each of which contains two racks and a S/R machine. This paper proposes a design of the hybrid AS/R module which can be adopted without too much initial expenditure by most of small-and-medium sized companies. The hybrid module consists of an AS/R module on the upper floor and a traditional warehouse module on the lower floor. For the AS/R module, analytical expressions of the expected travel times for the S/R machine and the elevator per operation are derived. The expected travel times represent the performance of the module and thus can be used for its economic design.

A Prototyping Framework of the Documentation Retrieval System for Enhancing Software Development Quality

  • Chang, Wen-Kui;Wang, Tzu-Po
    • International Journal of Quality Innovation
    • /
    • v.2 no.2
    • /
    • pp.93-100
    • /
    • 2001
  • This paper illustrates a prototyping framework of the documentation-standards retrieval system via the data mining approach for enhancing software development quality. We first present an approach for designing a retrieval algorithm based on data mining, with the three basic technologies of machine learning, statistics and database management, applied to this system to speed up the searching time and increase the fitness. This approach derives from the observation that data mining can discover unsuspected relationships among elements in large databases. This observation suggests that data mining can be used to elicit new knowledge about the design of a subject system and that it can be applied to large legacy systems for efficiency. Finally, software development quality will be improved at the same time when the project managers retrieving for the documentation standards.

  • PDF