• Title/Summary/Keyword: searching method

Search Result 1,969, Processing Time 0.024 seconds

CST-Tree with improved Mint system multimedia content using the refine (CST-트리를 채택한 Mint 시스템을 이용한 멀티미디어 콘텐츠 검색 개선)

  • Jung, Myoung Jin;Cho, Sung Je
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.3
    • /
    • pp.145-153
    • /
    • 2013
  • Multimedia contents' searching methods in existing mobile computer environment tend to be brought with many over heads when attempting to search data in large bulks. The MINT system has been studied to resolve such problem. However, MINT system delivers many over heads by searching multimedia contents through applying B-Tree. The suggested method is said to be CST-MCR searching system based on CST-Tree. The specific characteristic of this method is improved MINT system by applying CST-Tree's index. The result of capacity evaluation came out with improved capacity of 4.27% from MINT system and CST-MCR methods in average. Conclusively, it has been proven that the suggested method is superior.

AN ALGORITHM TO REDUCE THE PITCH SEARCHING TIME USING MODIFIED DELTA SEARCH IN CELP VOCODER (개선된 델타검색기법을 이용한 피치검색시간의 단축)

  • 이주헌
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1994.06c
    • /
    • pp.214-217
    • /
    • 1994
  • The major drawback in the Code Excited Linear Prediction type vocoders is their large computational requirements. In this paper, a simple method is proposed to reduce the pitch searching time in the pitch filter almost without degradation of quality. On the basis of the observational regularity of the correlation function of speech, only the limited numbers of pitch lags are considered to be an optimum pitch. This is done by skipping the negative envelope side of the correlation function and limiting the maximum number of lags to be considered preliminarily. By doing so, we can reduce the computational time of pitch searching more than 51% with negligible quality degradation. In addition to that, by combining that method with the conventional delta search technique, we can reduce the computational time requirements more than 60% without serious lowering the speech quality in segmental SNR measure compared to the conventional full search method.

  • PDF

Fast Algorithms to Generate the Codebook for Vector Quantization in Image Coding (화상 벡터 양자화의 코드북 구성을 위한 고속 알고리즘)

  • 이주희;정해묵;이충웅
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.1
    • /
    • pp.105-111
    • /
    • 1990
  • In this paper, fast algorithms to generate the codebook of vector quantization in image coding, are proposed. And an efficient algorithm to guess a initial codebook, namely, binary splitting method, is proposed. We generated the initial codebook by binary splitting method and then reduced the searching time using Iterative Optimization algorithm as an alternate to the generalized Lloyd algorithm and several information from binary splitting method. And the searching time and performance can be traded off by varying the searching range. With this proposed algorithm, the computation time can be reduced by a factor of 60 Without any degradation of image quality.

  • PDF

The Study on Searching Algorithm of the center of Pupil for the Iris Recognition (홍채 인식을 위한 동공 중심점 탐색 알고리즘에 관한 연구)

  • Cho, Meen-Hwan;Hur, Jung-Youn
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.1 s.39
    • /
    • pp.19-25
    • /
    • 2006
  • Iris recognition is a bio metric personal identification which uses iris pattern of the pupil, and it is recognized as one of the best technology in personal identification and information security field. Before iris recognition, it is very important to search center of pupil. In recent years, there was developed many searching algorithms of center of pupil, but all most method are too many processing time. In this paper, we proposed a new method for searching center of pupil. This method is greatly reduced processing time about 30% compared with other algorithm using Hough transformation.

  • PDF

A Reduction Algorithm of Computational Amount using Adjustment the Not Uniform Interval and Distribution Characteristic of LSP (불균등 간격조절과 선형 스펙트럼 쌍 분포특성을 이용한 계산량 단축 알고리즘)

  • Ju, Sang-Gyu
    • Proceedings of the KAIS Fall Conference
    • /
    • 2010.05a
    • /
    • pp.261-264
    • /
    • 2010
  • Fast algorithm is proposed by using mel scale and the distribution characteristic of LSP parameters, and is to reduce the computational amount. Computational amount means the calculating times of transformation from LPC coefficients to LSP parameters. Among conventional methods, the real root method is considerably simpler than other, but neverthless, it still suffer from its indeterministic computational time. Because the root searching is processed sequentially in frequency region. In this paper, the searching interval is arranged by using mel scale but not it is uniform and searching order is arranged by the distribution characteristic of LSP parameters that is most LSP papameters are occured in specific frequency region. In experimental results, computational amount of the proposed algorithm is reduced about 48.95% in average, but the transformed LSP parameters of the proposed method were the same as those of real root method.

  • PDF

Target searching method in the UAV

  • Bae, Young-Chul;Kim, Chun-Suk;Kim, Yi-Gon
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2004.10a
    • /
    • pp.11-14
    • /
    • 2004
  • In this paper, we propose a method to target searching method that have unstable limit cycles in a chaos trajectory surface. We assume all targets in the chaos trajectory surface have a Van der Pol equation with an unstable limit cycle When a chaos UAV meet the target in the Arnold equation, Chua's equation trajectory, the target absorptive the UAV

  • PDF

Realtime Processing for Marker Tracking in Smart-Phone Environment Using Deformable Searching Area (스마트폰 환경하의 실시간 처리를 위한 가변 탐색영역을 이용한 마커 추적 방법)

  • Kim, Se-Hoon;Lim, Sung-Jun;Lee, Min-Ho;Kim, Gye-Yuong;Choi, Hyung-Il
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.542-546
    • /
    • 2009
  • This paper introduces a Mixed-Reality based Software technology in Smart-Phone Environment. The field of Mixed-Reality in mobile environment is relatively young. but Cause to develop Mobile infra and improvement of mobile device, open-platform mobile OS, the request extended This paper suggest the method for Marker Detection and Marker Tracking method. This method is the one of some kind of a base-technology in Mixed Reality. this method is to effect to location and registration. This paper suggest the method in low CPU computing power. Using a deformable searching area, the method improve computing power. and Using a Cam-shift algorithm, we suggest a calibration free method.

  • PDF

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

An Improved Route Recovery using Bidirectional Searching Method for Ad hoc Networks (Ad hoc 네트워크에서의 양방향 경로탐색을 이용한 경로복구 개선 방안)

  • Han, Ho-Yeon;Nam, Doo-Hee;Kim, Seung-Cheon
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.1
    • /
    • pp.35-41
    • /
    • 2010
  • Since the ad-hoc network allow nodes to communicate each other without infrastructure system and predefined configuration, it comes into the spotlight that is suitable to ubiquitous society. In ad-hoc network, route recovery mechanism is considered important. Normally route recovery is needed to solve the link failure problem because there is no route maintaining system like a router in ad-hoc networks. In this paper we propose BS-AODV(Bidirectional Searching-AODV) route recovery method. The proposed method is a local repair method that can be applied in all of the network area. Unlike a limited local repair method in AODV. the proposed method adopts the bidirectional searching method where the upstream/downstream nodes can send the route maintenance messages. Restricting the flooding of route request messages, the proposed scheme attempts to minimize the costs of local repair, the performance of the proposed scheme is evaluated through the simulations. In two scenarios which variate the node numbers and node speed, the comparison among the proposed scheme, AODV and AOMDV is shown in terms of the control traffic and data delivery ratio.

Searching Methods of Corresponding Points Robust to Rotational Error for LRF-based Scan-matching (LRF 기반의 스캔매칭을 위한 회전오차에 강인한 대응점 탐색 기법)

  • Jang, Eunseok;Cho, Hyunhak;Kim, Eun Kyeong;Kim, Sungshin
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.26 no.6
    • /
    • pp.505-510
    • /
    • 2016
  • This paper presents a searching method of corresponding points robust to rotational error for scan-matching used for SLAM(Simultaneous Localization and Mapping) in mobile robot. A differential driving mechanism is one of the most popular type for mobile robot. For driving curved path, this type controls the velocities of each two wheels independently. This case increases a wheel slip of the mobile robot more than the case of straight path driving. And this is the reason of a drifting problem. To handle this problem and improves the performance of scan-matching, this paper proposes a searching method of corresponding points using extraction of a closest point based on rotational radius of the mobile robot. To verify the proposed method, the experiment was conducted using LRF(Laser Range Finder). Then the proposed method is compared with an existing method, which is an existing method based on euclidian closest point. The result of our study reflects that the proposed method can improve the performance of searching corresponding points.