• Title/Summary/Keyword: Indexing Function

Search Result 66, Processing Time 0.03 seconds

Content Based Classification of Audio Signal using Discriminant Function (식별함수를 이용한 오디오신호의 내용기반 분류)

  • Kim, Young-Sub;Lee, Kwang-Seok;Koh, Si-Young;Hur, Kang-In
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.201-204
    • /
    • 2007
  • In this paper, we research the content-based analysis and classification according to the composition of the feature parameters pool for the auditory signals to implement the auditory indexing and searching system. Auditory data is classified to the primitive various auditory types. we described the analysis and feature extraction method for the feature parameters available to the auditory data classification. And we compose the feature parameters pool in the indexing group unit, then compare and analysis the auditory data centering around the including level and indexing criterion into the audio categories. Based on this result, we composit feature vectors of audio data according to the classification categories, then experiment the classification using discrimination function.

  • PDF

GC-Tree: A Hierarchical Index Structure for Image Databases (GC-트리 : 이미지 데이타베이스를 위한 계층 색인 구조)

  • 차광호
    • Journal of KIISE:Databases
    • /
    • v.31 no.1
    • /
    • pp.13-22
    • /
    • 2004
  • With the proliferation of multimedia data, there is an increasing need to support the indexing and retrieval of high-dimensional image data. Although there have been many efforts, the performance of existing multidimensional indexing methods is not satisfactory in high dimensions. Thus the dimensionality reduction and the approximate solution methods were tried to deal with the so-called dimensionality curse. But these methods are inevitably accompanied by the loss of precision of query results. Therefore, recently, the vector approximation-based methods such as the VA- file and the LPC-file were developed to preserve the precision of query results. However, the performance of the vector approximation-based methods depend largely on the size of the approximation file and they lose the advantages of the multidimensional indexing methods that prune much search space. In this paper, we propose a new index structure called the GC-tree for efficient similarity search in image databases. The GC-tree is based on a special subspace partitioning strategy which is optimized for clustered high-dimensional images. It adaptively partitions the data space based on a density function and dynamically constructs an index structure. The resultant index structure adapts well to the strongly clustered distribution of high-dimensional images.

Comparison research of the Spatial Indexing Methods for ORDBMS in Embedded Systems (임베디드 시스템의 객체 관계형 DBMS에 적합한 공간 인덱스 방법 비교 연구)

  • Lee, Min-Woo;Park, Soo-Hong
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.8 no.1
    • /
    • pp.63-74
    • /
    • 2005
  • The telematics device, which is a typical embedded system on the transportation or vehicle, requires the embedded spatial DBMS based on RTOS (Real Time Operating System) for processing the huge spatial data in real time. This spatial DBMS can be developed very easily by SQL3 functions of the ORDBMS such as UDT (user-defined type) and UDF (user-defined function). However, developing index suitable for the embedded spatial DBMS is very difficult. This is due to the fact that there is no built-in SQL3 functions to construct spatial indexes. In this study, we compare and analyze both Generalized Search Tree and Relational Indexing methods which are suggested as common ways of developing User-Defined Indexes nowadays. Two implementations of R-Tree based on each method were done and region query performance test results were evaluated for suggesting a suitable indexing method of an embedded spatial DBMS, especially for telematics devices.

  • PDF

TIME DELAYED CONTROLLER를 이용한 유압 시스템의 위치 제어

  • 진성무;현장환;이정오
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2001.10a
    • /
    • pp.204-208
    • /
    • 2001
  • Position control of the electro-hydraulic servo indexing system in a flexible forging machine was investigated Flexible forging machine forges an axial type workpiece in the radial direction as well as in the axial direction. The role of the indexing system is to rotate a workpiece fast and accurately to a desired position for continuous shaping. Since the inertia of a workpiece changes during each forging step, a control technique which is robust to inertia variation should be adopted to the position control of the workpiece. In this study, time delayed control technique is applied to the servo system. Time delayed control method does not depend on estimation of specific parameters. Rather, it depends on the direct estimation of a function representing the effect of uncertainties. Direct estimation is accomplished using time delay and the gathered information is used to cancel the unknown dynamics is accomplished using disturbances simultaneously. Experimental result show that the time delayed controller is robust to inertia variation of the load, and satisfactory performance on the sposition accuracy is obtained compared to the contentional feedback control.

A Review on Air Quality Indexing System

  • Kanchan, Kanchan;Gorai, Amit Kumar;Goyal, Pramila
    • Asian Journal of Atmospheric Environment
    • /
    • v.9 no.2
    • /
    • pp.101-113
    • /
    • 2015
  • Air quality index (AQI) or air pollution index (API) is commonly used to report the level of severity of air pollution to public. A number of methods were developed in the past by various researchers/environmental agencies for determination of AQI or API but there is no universally accepted method exists, which is appropriate for all situations. Different method uses different aggregation function in calculating AQI or API and also considers different types and numbers of pollutants. The intended uses of AQI or API are to identify the poor air quality zones and public reporting for severity of exposure of poor air quality. Most of the AQI or API indices can be broadly classify as single pollutant index or multi-pollutant index with different aggregation method. Every indexing method has its own characteristic strengths and weaknesses that affect its suitability for particular applications. This paper attempt to present a review of all the major air quality indices developed worldwide.

Content similarity matching for video sequence identification

  • Kim, Sang-Hyun
    • International Journal of Contents
    • /
    • v.6 no.3
    • /
    • pp.5-9
    • /
    • 2010
  • To manage large database system with video, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for frame-wise user query or video content query, whereas a few video identification algorithms have been proposed for video sequence query. In this paper, we propose an effective video identification algorithm for video sequence query that employs the Cauchy function of histograms between successive frames and the modified Hausdorff distance. To effectively match the video sequences with a low computational load, we make use of the key frames extracted by the cumulative Cauchy function and compare the set of key frames using the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed algorithm for video identification yields remarkably higher performance than conventional algorithms such as Euclidean metric, and directed divergence methods.

A Study on the Image DB Construction for the Multi-function Front Looking Camera System Development (다기능 전방 카메라 개발을 위한 영상 DB 구축 방법에 관한 연구)

  • Kee, Seok-Cheol
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.25 no.2
    • /
    • pp.219-226
    • /
    • 2017
  • This paper addresses the effective and quantitative image DB construction for the development of front looking camera systems. The automotive industry has expanded the capability of front camera solutions that will help ADAS(Advanced Driver Assistance System) applications targeting Euro NCAP function requirements. These safety functions include AEB(Autonomous Emergency Braking), TSR(Traffic Signal Recognition), LDW(Lane Departure Warning) and FCW(Forward Collision Warning). In order to guarantee real road safety performance, the driving image DB logged under various real road conditions should be used to train core object classifiers and verify the function performance of the camera system. However, the driving image DB would entail an invalid and time consuming task without proper guidelines. The standard working procedures and design factors required for each step to build an effective image DB for reliable automotive front looking camera systems are proposed.

Shape-Based Subsequence Retrieval Supporting Multiple Models in Time-Series Databases (시계열 데이터베이스에서 복수의 모델을 지원하는 모양 기반 서브시퀀스 검색)

  • Won, Jung-Im;Yoon, Jee-Hee;Kim, Sang-Wook;Park, Sang-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.10D no.4
    • /
    • pp.577-590
    • /
    • 2003
  • The shape-based retrieval is defined as the operation that searches for the (sub) sequences whose shapes are similar to that of a query sequence regardless of their actual element values. In this paper, we propose a similarity model suitable for shape-based retrieval and present an indexing method for supporting the similarity model. The proposed similarity model enables to retrieve similar shapes accurately by providing the combination of various shape-preserving transformations such as normalization, moving average, and time warping. Our indexing method stores every distinct subsequence concisely into the disk-based suffix tree for efficient and adaptive query processing. We allow the user to dynamically choose a similarity model suitable for a given application. More specifically, we allow the user to determine the parameter p of the distance function $L_p$ when submitting a query. The result of extensive experiments revealed that our approach not only successfully finds the subsequences whose shapes are similar to a query shape but also significantly outperforms the sequence search.

A Study on the Effectiveness of Information Retrieval (정보검색효율에 관한 연구)

  • Yoon Koo-ho
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.8
    • /
    • pp.73-101
    • /
    • 1981
  • Retrieval effectiveness is the principal criterion for measuring the performance of an information retrieval system. The effectiveness of a retrieval system depends primarily on the extent to which it can retrieve wanted documents without retrieving unwanted ones. So, ultimately, effectiveness is a function of the relevant and nonrelevant documents retrieved. Consequently, 'relevance' of information to the user's request has become one of the most fundamental concept encountered in the theory of information retrieval. Although there is at present no consensus as to how this notion should be defined, relevance has been widely used as a meaningful quantity and an adequate criterion for measures of the evaluation of retrieval effectiveness. The recall and precision among various parameters based on the 'two-by-two' table (or, contingency table) were major considerations in this paper, because it is assumed that recall and precision are sufficient for the measurement of effectiveness. Accordingly, different concepts of 'relevance' and 'pertinence' of documents to user requests and their proper usages were investigated even though the two terms have unfortunately been used rather loosely in the literature. In addition, a number of variables affecting the recall and precision values were discussed. Some conclusions derived from this study are as follows: Any notion of retrieval effectiveness is based on 'relevance' which itself is extremely difficult to define. Recall and precision are valuable concepts in the study of any information retrieval system. They are, however, not the only criteria by which a system may be judged. The recall-precision curve represents the average performance of any given system, and this may vary quite considerably in particular situations. Therefore, it is possible to some extent to vary the indexing policy, the indexing policy, the indexing language, or the search methodology to improve the performance of the system in terms of recall and precision. The 'inverse relationship' between average recall and precision could be accepted as the 'fundamental law of retrieval', and it should certainly be used as an aid to evaluation. Finally, there is a limit to the performance(in terms of effectiveness) achievable by an information retrieval system. That is : "Perfect retrieval is impossible."

  • PDF

Function of the Korean String Indexing System for the Subject Catalog (주제목록을 위한 한국용어열색인 시스템의 기능)

  • Yoon Kooho
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.15
    • /
    • pp.225-266
    • /
    • 1988
  • Various theories and techniques for the subject catalog have been developed since Charles Ammi Cutter first tried to formulate rules for the construction of subject headings in 1876. However, they do not seem to be appropriate to Korean language because the syntax and semantics of Korean language are different from those of English and other European languages. This study therefore attempts to develop a new Korean subject indexing system, namely Korean String Indexing System(KOSIS), in order to increase the use of subject catalogs. For this purpose, advantages and disadvantages between the classed subject catalog nd the alphabetical subject catalog, which are typical subject ca-alogs in libraries, are investigated, and most of remarkable subject indexing systems, in particular the PRECIS developed by the British National Bibliography, are reviewed and analysed. KOSIS is a string indexing based on purely the syntax and semantics of Korean language, even though considerable principles of PRECIS are applied to it. The outlines of KOSIS are as follows: 1) KOSIS is based on the fundamentals of natural language and an ingenious conjunction of human indexing skills and computer capabilities. 2) KOSIS is. 3 string indexing based on the 'principle of context-dependency.' A string of terms organized accoding to his principle shows remarkable affinity with certain patterns of words in ordinary discourse. From that point onward, natural language rather than classificatory terms become the basic model for indexing schemes. 3) KOSIS uses 24 role operators. One or more operators should be allocated to the index string, which is organized manually by the indexer's intellectual work, in order to establish the most explicit syntactic relationship of index terms. 4) Traditionally, a single -line entry format is used in which a subject heading or index entry is presented as a single sequence of words, consisting of the entry terms, plus, in some cases, an extra qualifying term or phrase. But KOSIS employs a two-line entry format which contains three basic positions for the production of index entries. The 'lead' serves as the user's access point, the 'display' contains those terms which are themselves context dependent on the lead, 'qualifier' sets the lead term into its wider context. 5) Each of the KOSIS entries is co-extensive with the initial subject statement prepared by the indexer, since it displays all the subject specificities. Compound terms are always presented in their natural language order. Inverted headings are not produced in KOSIS. Consequently, the precision ratio of information retrieval can be increased. 6) KOSIS uses 5 relational codes for the system of references among semantically related terms. Semantically related terms are handled by a different set of routines, leading to the production of 'See' and 'See also' references. 7) KOSIS was riginally developed for a classified catalog system which requires a subject index, that is an index -which 'trans-lates' subject index, that is, an index which 'translates' subjects expressed in natural language into the appropriate classification numbers. However, KOSIS can also be us d for a dictionary catalog system. Accordingly, KOSIS strings can be manipulated to produce either appropriate subject indexes for a classified catalog system, or acceptable subject headings for a dictionary catalog system. 8) KOSIS is able to maintain a constistency of index entries and cross references by means of a routine identification of the established index strings and reference system. For this purpose, an individual Subject Indicator Number and Reference Indicator Number is allocated to each new index strings and new index terms, respectively. can produce all the index entries, cross references, and authority cards by means of either manual or mechanical methods. Thus, detailed algorithms for the machine-production of various outputs are provided for the institutions which can use computer facilities.

  • PDF