• 제목/요약/키워드: Searching

Search Result 5,578, Processing Time 0.032 seconds

Selecting a Composite of MPEG-7 Visual Descriptor by KLT Algorithm (KLT 알고리즘을 사용한 MPEG-7의 최적Descriptor 조합선택에 관한 연구)

  • 김현민;권기상;권혁민;최윤식
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.1831-1834
    • /
    • 2003
  • Due to the increasing of multimedia data quantity, database searching based on image becomes important. For this scheme, MPEG-7 gives a good solution to efficient data searching. MPEG-7 uses Descriptors which are color, texture, and shape to extract features from images. It is obvious that using more than one Descriptor causes more accurate data searching result than using just one. In this paper, selecting a composite of MPEG-7 visual Descriptor using KL-Expansion is proposed.

  • PDF

An Algorithm to Reduce the Pitch Computational amount using Modified Delta Searching in CELP Vocoders (CELP 보코더에서 델타 피치 검색 방법 개선에 대한 연구)

  • Ju, Sang-Gyu
    • Proceedings of the KAIS Fall Conference
    • /
    • 2010.05a
    • /
    • pp.269-272
    • /
    • 2010
  • In this paper, we propose the computation reduction methods of delta pitch search that is used in G.723.1 vocoder. In order to decrease the computational amount in delta pitch search the characteristic of proposed algorithms is as the following. First, scheme to reduce the computation amount in delta pitch search uses NAMDF. Developed the second scheme is the skipping technique of lags in pitch searching by using the threshold value. By doing so, we can reduce the computational amount of pitch searching more than 64% with negligible quality degradation.

  • PDF

A High-Speed LSF Transformation Algorithm for CELP Vocoders

  • Min, So-Yeon;Bae, Myung-Jin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.1E
    • /
    • pp.20-24
    • /
    • 2001
  • We propose the computation reduction method of real root method that is mainly used in the CELP(Code Excited Linear Prediction) vocoder. The real root method is that if polynomial equations have the real roots, we are able to find those and transform them into LSF[1]. However, this method takes much time to compute, because the root searching is processed sequentially in frequency region. But, the important characteristic of LSF is that most of coefficients are occurred in specific frequency region. So, the searching frequency region is ordered by each coefficient's distribution. And coefficients are searched in ordered frequency region. Transformation time can be reduced by this method than the sequential searching method in frequency region. When we compare this proposed method with the conventional real root method, the experimental result is that the searching time was reduced about 46% in average.

  • PDF

Nonlinear control system using universal learning network with random search method of variable search length

  • Shao, Ning;Hirasawa, Kotaro;Ohbayashi, Masanao;Togo, Kazuyuki
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10a
    • /
    • pp.235-238
    • /
    • 1996
  • In this paper, a new optimization method which is a kind of random searching is presented. The proposed method is called RasVal which is an abbreviation of Random Search Method with Variable Seaxch Length and it can search for a global minimum based on the probability density functions of searching, which can be modified using informations on success or failure of the past searching in order to execute intensified and diversified searching. By applying the proposed method to a nonlinear crane control system which can be controlled by the Universal Learning Network with radial basis function(R.B.P.), it has been proved that RasVal is superior in performance to the commonly used back propagation learning algorithm.

  • PDF

On a Performance Comparison of Pitch Search Algorithms by using a Correlation Properties for the CELP Vocoder (CELP 보코더의 피치 검색시간 단축법의 비교)

  • 배명진
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1993.06a
    • /
    • pp.280-287
    • /
    • 1993
  • Code Excited Linear Prediction(CELP) speech coders exhibit good performance at data rates as low as 4800bps. The major drawback to CELP type paper, a comparative performance study of three pitch searching algorithms for the CELP vocoder was conducted. For each of the algorithms, a standard pitch searching algorithm was used by the sequential pitch searching algorithm that was implimented in the QCELP vocoder. The algorithms used in this study were 1) using the skip table(TABLE), 2) using the symmetrical property of the autocorrelation(SYMMT), and 3) using the preprocessing autocorrelation(PREPC). Performance scores are presented for each of the three pitch searching algorithms based on computation speed and on pitch prediction error.

  • PDF

WinBioDBs: A Windows-based Integrated Program for Manipulating Major Biological Databases

  • Nam, Hye-Weon;Lee, Jin-Ho;Park, Kie-Jung
    • Genomics & Informatics
    • /
    • v.7 no.3
    • /
    • pp.175-177
    • /
    • 2009
  • We have developed WinBioDBs with Windows interfaces, which include importing modules and searching interfaces for 10 major public databases such as GenBank, PIR, SwissProt, Pathway, EPD, ENZYME, REBASE, Prosite, Blocks, and Pfam. User databases can be constructed with searching results of queries and their entries can be edited. The program is a stand-alone database searching program on Windows PC. Database update features are supported by importing raw database files and indexing after downloading them. Users can adjust their own searching environments and report format and construct their own projects consisting of a combination of a local databases. WinBioDBs are implemented with VC++ and its database is based on MySQL.

A Study on the Optimized Architectural Space Planning by Searching Algorithm Method (탐색적 방법에 의한 건축공간 배치계획 최적화에 대한 고찰)

  • Lim, Myung-Gu;Kim, Su-Young
    • Journal of The Korean Digital Architecture Interior Association
    • /
    • v.1 no.1
    • /
    • pp.51-58
    • /
    • 2001
  • The purpose of this study is to improve productivity of architectural space planning(A.S.P,) by computer system and to optimize ASP. A searching algorithm is the best way to slave optimized A.S.P. Because architectural design is too many various site situations and client's demands to specify the general solving methods. This method seek the best design case in all possibility and to be modeled as this; $\rightarrow$[$\rightarrow$$\rightarrow$