• 제목/요약/키워드: Search Speed

검색결과 793건 처리시간 0.028초

개선된 크로스-납작한 육각 탐색 패턴을 이용한 고속 블록 정합 움직임 예측 알고리즘 (A Fast Block Matching Motion Estimation Algorithm by using an Enhanced Cross-Flat Hexagon Search Pattern)

  • 남현우
    • 한국컴퓨터정보학회논문지
    • /
    • 제13권7호
    • /
    • pp.99-108
    • /
    • 2008
  • 동영상 압축을 위해서, 탐색 속도와 부호화된 비디오 화질이라는 두 가지 성능이 고려되어야 한다. 본 논문에서는, 동영상의 공간적 상관성과움직임 벡터(MV)의 중심지향적인 특성을 이용하여 개선된 고속블록정합 알고리즘을 제안한다. 제안된 알고리즘은 현재 프레임의 인접 매크로 블록으로부터 초기 움직임 벡터를 예측하고 크로스 패턴과 납작한 육각 탐색 패턴을 이용하여 정확한 움직임 벡터를 결정한다. 성능 평가를 통해, 제안된 알고리즘은 탐색 속도와 부호화된 비디오 화질 측면 모두에서 비교대상인 육각 패턴 탐색 알고리즘(HEXBS)과 크로스-육각 패턴 탐색 알고리즘(CHS)에 비해 뛰어난 성능을 나타냄을 알 수 있었다. 제안된 알고리즘을 이용하여 탐색 속도 측면에서는 약 31%의 성능 향상을 보였고, PSNR 측면에서도 약 0.5dB 향상되어 비디오 화질의 성능 향상을 나타내었다.

  • PDF

개선된 타부 탐색을 이용한 PID 제어기 설계 (Design of PID Controller using an Improved Tabu Search)

  • 이양우;박경훈;김동욱
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제53권5호
    • /
    • pp.323-330
    • /
    • 2004
  • In this paper, we propose a design method of PID controller using an improved Tabu Search. Tabu Search is improved by neighbor solution creation using Gaussian random distribution and generalized Hermite Biehler Theorem for stable bounds. The range of admissible proportional gains are determined first in closed form. Next the optimal PID gains are selected by improved Tabu Search. The results of Computer simulations represent that the proposed Tabu Search algorithm shows a fast convergence speed and a good control performance.

지표면 모델링 및 폴리건 검색기법에 관한 연구 (A Study on Terrain Surface Modeling and Polygon-Searching Algorithms)

  • 공지영;강현주;윤석준
    • 한국시뮬레이션학회:학술대회논문집
    • /
    • 한국시뮬레이션학회 2002년도 추계학술대회 논문집
    • /
    • pp.163-170
    • /
    • 2002
  • Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces for realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. In order to accelerate the searching speed of T-search, a terrain database of triangular polygons is modeled in multi-levels by adopting the LOD (Level of Detail) method used in realtime computer graphics. Simulation results show that the new LOD search is effective in shortening the required computing time. The LOD search can be even further accelerated by introducing an NN (Neural Network) algorithm, in the cases where a appropriate range of moving paths can be predicted by cultual information of the simulated terrain, such as lakes, houses, etc.. Numerical tests show that LOD-NN search almost double the speed of the original T-search.

  • PDF

Effect of Caching and Prefetching Techniques to Accelerate Channel Search Latency in IPTVs

  • Bahn, Hyokyung
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제14권2호
    • /
    • pp.17-22
    • /
    • 2022
  • Due to the recent advances in high-speed communication technologies as well as the easy production of high-quality video contents, IPTV is becoming increasingly popular. Meanwhile, as the number of IPTV channels increases, channel search time to find the desired channel keeps increasing. In this paper, we discuss how to improve the channel search latency in IPTV, and introduce caching and prefetching techniques that are widely used in memory management systems. Specifically, we adopt memory replacement, prefetching, and caching techniques in IPTV channel search interfaces and show the effectiveness of these techniques as the number of channels are varied.

VDT 화면에서 한글의 글자크기와 서체에 따른 탐색속도와 오류율에 관한 실험적 연구 (An experimental study on search speed and error rate according to Korean letter size and font on search task with VDT)

  • 황우상;이동춘;이상도;이진호
    • 대한인간공학회지
    • /
    • 제16권2호
    • /
    • pp.29-38
    • /
    • 1997
  • The research on the factors which effect on legibility is mainly utilized as the basic data of selecting the standard guideline of VDT screen. But the research on Korean is scarcer than that of English. Furthermore, it is unreasonable to apply the results of the foreign language to Korean, beause of the difference between the typography of English and that of Korean. Therefore, more systematic and ergonomic research of the Korean typography on VDT screen is needed. In this paper, an experimental study on search speed and error rate is designed and performed according to different Korean letter size and font on search task with VDT. The experimental screen based on popular Ming and Gothic style is made up of total 12 artificial screens, each 6 different font size. As the criteria of the performance, searching speed(s.s.) and error rate (e) are selected, and CFF value is measured to evaluate user's visual fatigue. The results of experiment in font show that the Korean Gothic style is superior to the Korean Ming style in user's visual performance. The letter size that gives user the optimal performance ranges from the visual angle 39.8' to 55.5' in Ming style, from the visual angle 39.8' to 52.6' in Gothic systle. In visual fatigue experiment, the better performance of letter size is, the less tired user feels. And the smaller letter size is, the more tired user feels. There is no relationship between font and user's visual fatigue.

  • PDF

IP 주소 검색을 위한 Priority Trie (An Efficient IP address Lookup Algorithm Using a Priority-Trie)

  • 임혜숙;문주형
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2006년도 하계종합학술대회
    • /
    • pp.3-4
    • /
    • 2006
  • Fast IP address lookup in routers is essential to achieve packet forwarding in wire-speed. The longest prefix matching for IP address lookup is more complex than exact matching because of its dual dimensions, length and value. By thoroughly studying the current proposals for IP address lookup, we find out that the binary search could be a low-cost solution while providing high performance. Most of the existing binary search algorithms based on trie have simple data structures which can be easily implemented, but they have some problems because of empty internal nodes. The proposed algorithm is based on trie structure, but empty internal nodes are replaced by priority prefixes. The best-matching-prefix search in the proposed algorithm is more efficiently performed since search can be finished earlier when input is matched with a priority prefix. The performance evaluation results show that the constructed priority-trie has very good performance in the lookup speed and the scalability.

  • PDF

A Study on a Compensation of Decoded Video Quality and an Enhancement of Encoding Speed

  • Sir, Jaechul;Yoon, Sungkyu;Lim, Younghwan
    • 한국컴퓨터그래픽스학회논문지
    • /
    • 제6권3호
    • /
    • pp.35-40
    • /
    • 2000
  • There are two problems in H.26X compression technique. One is compressing time in encoding process and the other is degradation of the decoded video quality due to high compression rate. For transferring moving pictures in real-time, it is required to adopt massively high compression. In this case, there are a lot of losses of an original video data and that results in degradation of quality. Especially degradation called by blocking artifact may be produced. The blocking artifact effect is produced by DCT-based coding techniques because they operate without considering correlation between pixels in block boundaries. So it represents discontinuity between adjacent blocks. This paper describes methods of quality compensation for H.26x decoded data and enhancing encoding speed for real-time operation. Our goal of the quality compensation is not to make the decoded video identical to a original video but to make it perceived better through human eyes. We suggest an algorithm that reduces block artifact and clears decoded video in decoder. To enhance encoding speed, we adopt new four-step search algorithm. As shown in the experimental result, the quality compensation provides better video quality because of reducing blocking artifact. And then new four-step search algorithm with $MMX^{TM}$ implementation improves encoding speed from 2.5 fps to 17 fps.

  • PDF

Optimal PID Controller Design for DC Motor Speed Control System with Tracking and Regulating Constrained Optimization via Cuckoo Search

  • Puangdownreong, Deacha
    • Journal of Electrical Engineering and Technology
    • /
    • 제13권1호
    • /
    • pp.460-467
    • /
    • 2018
  • Metaheuristic optimization approach has become the new framework for control synthesis. The main purposes of the control design are command (input) tracking and load (disturbance) regulating. This article proposes an optimal proportional-integral-derivative (PID) controller design for the DC motor speed control system with tracking and regulating constrained optimization by using the cuckoo search (CS), one of the most efficient population-based metaheuristic optimization techniques. The sum-squared error between the referent input and the controlled output is set as the objective function to be minimized. The rise time, the maximum overshoot, settling time and steady-state error are set as inequality constraints for tracking purpose, while the regulating time and the maximum overshoot of load regulation are set as inequality constraints for regulating purpose. Results obtained by the CS will be compared with those obtained by the conventional design method named Ziegler-Nichols (Z-N) tuning rules. From simulation results, it was found that the Z-N provides an impractical PID controller with very high gains, whereas the CS gives an optimal PID controller for DC motor speed control system satisfying the preset tracking and regulating constraints. In addition, the simulation results are confirmed by the experimental ones from the DC motor speed control system developed by analog technology.

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

  • 함도용;김종구;김하진;위영철
    • 한국컴퓨터그래픽스학회논문지
    • /
    • 제7권1호
    • /
    • pp.11-17
    • /
    • 2001
  • 프랙탈 이미지 코딩은 높은 압축율을 비롯하여 많은 장점을 가지고 있다. 그러나 압축 과정은 일반적으로 domain 블록 pool에 대한 긴 탐색시간으로 효율이 나빠진다. 본 논문에서는 블록 분류와 분산 기반의 탐색을 병용한 domain 블록 pool 탐색 방법을 소개한다. 이 방법은 블록 분류에 대하여 분류 블록의 분산 값은 독립적이라는 사실을 이용한다. 따라서 이 방법은 단순한 분산 기반의 탐색 방법보다 O(number of classes)에 비례하는 탐색 속도향상이 된다. 실험의 결과는 본 방법이 단순히 분산 값을 적용한 탐색 방법과 비교하여 이미지 품질은 거의 그대로 유지하면서 17배 이상의 속도 향상을 이루었음을 보인다. 또한 이미지 품질의 가시적인 손실 없이 탐색 속도를 더욱 향상시키는 분산 기반의 탐색 방법을 제안한다.

  • PDF

유전알고리즘과 Tabu탐색법에 의한 제진판의 최적설계 (Ooptimum Design Damping Plate by Combined Method of Genetic Algorithm and Random Tabu Search Method)

  • 양보석;전상범;유영훈;최병근
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 1997년도 추계학술대회논문집; 한국과학기술회관; 6 Nov. 1997
    • /
    • pp.184-189
    • /
    • 1997
  • This paper introduces a new combined method by genetic algorithm and random tabu search method as optimization algorithm. Genetic algorithm can search the global optimum and tabu search method is very fast in speed. The optimizing ability of new combined method is identified by comparing other optimizing algorithm and used for optimum design of damping plate.

  • PDF