• Title/Summary/Keyword: 알고리즘 평가

Search Result 5,665, Processing Time 0.027 seconds

Performance Evaluation focused on Burst of Smoothing Algorithms (스무딩 알고리즘들의 버스트 성능 평가)

  • Lee, Myoun-Jae
    • Journal of Digital Contents Society
    • /
    • v.13 no.1
    • /
    • pp.111-118
    • /
    • 2012
  • The burst is to require abruptly high transmission rate in case of transmitting pre-stored variable bit rate video data, and it causes to be inefficient use of network resource, resource reservation. To avoid these problems, smoothing is transmission plan where variable rate video data is converted to a constant bit rate stream. These smoothing algorithms include CBA, MCBA, MVBA and others. To evaluate amount of burst reduction in the existing CBA, MCBA, MVBA algorithm, this paper compares the burst-related-factors of transmission plan in smoothing algorithms with original video sources which were stored Variable Bit Rate. There are maximum frame bytes, maximum GOP bytes, transmission rate variability per frame, transmission rate variability per GOP in burst-related evaluation factors. Experimental result shows burst-related factors of smoothing algorithms which were used for experiment lower than that of pre-stored video data, except special case.

A Numerical Algorithm for Evaluating Progression Efficiency along Coordinated Arterials Using Shock Wave Theory (충격파이론을 응용한 간선도로 신호연동화의 효율 평가를 위한 알고리즘의 개발)

  • Kim, Young-Chan;Baek, Hyon-Su
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.2
    • /
    • pp.83-90
    • /
    • 1999
  • A computer algorithm is presented that evaluate the performance of coordinated signal timing plans for the signalized arterials. The procedures calculating delay and stops are based on Michalopoulos's analytical model derived from shock wave theory. The delay-offset relationship predicted from the algorithm produced consistent results with the delays venerated by TRANSYT-7F. From performance test, the delays estimated using the proposed a1gorithm are shown to be sensitive to the quality of progression as well as to traffic demand, link length, and turning flow ratio from upstream signal.

  • PDF

Adaptive Face Region Detection and Real-Time Face Identification Algorithm Based on Face Feature Evaluation Function (적응적 얼굴검출 및 얼굴 특징자 평가함수를 사용한 실시간 얼굴인식 알고리즘)

  • 이응주;김정훈;김지홍
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.2
    • /
    • pp.156-163
    • /
    • 2004
  • In this paper, we propose an adaptive face region detection and real-time face identification algorithm using face feature evaluation function. The proposed algorithm can detect exact face region adaptively by using skin color information for races as well as intensity and elliptical masking method. And also, it improves face recognition efficiency using geometrical face feature and geometric evaluation function between features. The proposed algorithm can be used for the development of biometric and security system areas. In the experiment, the superiority of the proposed method has been tested using real image, the proposed algorithm shows more improved recognition efficiency as well as face region detection efficiency than conventional method.

  • PDF

Performance Test of APIS, DELOS Algorithm using Paramics (Paramics를 이용한 APID, DELOS평가)

  • Nam, Doohee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.4
    • /
    • pp.61-66
    • /
    • 2013
  • The central core of the Traffic Management System is an Incident Management System. Whole approach has been component-orientated, with a secondary emphasis being placed on the traffic characteristics at the sites. The first action taken during the development process was the selection of the required data for each components within the existing infrastructure of Algeria freeway system. After review and analysis of existing incident detection methodologies, Paramics was utilized to test the performance of APID, DELOS algorithms. The existing system of Algeria freeway was tested in a different configuration at different sections of freeway, thereby increasing the validity and scope of the overall findings. The incident detection module has been performed according to predefined system validation specifications. The Paramics simulation was done with the use of synchronous analysis, thereby providing a means for testing the incident detection module.

An Automatic Rhythm and Melody Composition System Considering User Parameters and Chord Progression Based on a Genetic Algorithm (유전알고리즘 기반의 사용자 파라미터 설정과 코드 진행을 고려한 리듬과 멜로디 자동 작곡 시스템)

  • Jeong, Jaehun;Ahn, Chang Wook
    • Journal of KIISE
    • /
    • v.43 no.2
    • /
    • pp.204-211
    • /
    • 2016
  • In this paper, we propose an automatic melody composition system that can generate a sophisticated melody by adding non-harmony tone in the given chord progression. An overall procedure consists of two steps, which are the rhythm generation and melody generation parts. In the rhythm generation part, we designed new fitness functions for rhythm that can be controlled by a user setting parameters. In the melody generation part, we designed new fitness functions for melody based on harmony theory. We also designed evolutionary operators that are conducted by considering a musical context to improve computational efficiency. In the experiments, we compared four metaheuristics to optimize the rhythm fitness functions: Simple Genetic Algorithm (SGA), Elitism Genetic Algorithm (EGA), Differential Evolution (DE), and Particle Swarm Optimization (PSO). Furthermore, we compared proposed genetic algorithm for melody with the four algorithms for verifying performance. In addition, composition results are introduced and analyzed with respect to musical correctness.

A Concurrent Incremental Evaluation Technique Using Multitasking (멀티태스킹에 의한 병행 점진 평가 방법)

  • Han, Jung-Lan
    • The KIPS Transactions:PartA
    • /
    • v.17A no.2
    • /
    • pp.73-80
    • /
    • 2010
  • As the power of hardware has improved, there have been numerous researches in processing concurrently using multitasking method. The incremental evaluation is the evaluation method of reevaluating only affected parts instead of reevaluating overall program when the program has been changed. It is necessary to do more studies that improve the efficiency of concurrent incremental evaluation to do multitasking using multi-threading of Java not to do in parallel using multiprocessor. In this paper, the dependency in the dependency chart is based on the attribute that describes the real value of the variable that directly affects the semantics, thereby doing efficient evaluation. So using the dependency, this paper presents the concurrent incremental evaluation algorithm for Java Languages and proves its correctness, analyzing the efficiency of concurrent incremental evaluation by the simulation.

Least mean absolute third (LMAT) adaptive algorithm:part II. performance evaluation of the algorithm (최소평균절대값삼승 (LMAT) 적응 알고리즘: Part II. 알고리즘의 성능 평가)

  • 김상덕;김성수;조성호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.10
    • /
    • pp.2310-2316
    • /
    • 1997
  • This paper presents a comparative performance analysis of the stochastic gradient adaptive algorithm based on the least mean absolute third (LMAT) error criterion with other widely-used competing adaptive algorithms. Under the assumption that the signals involved are zero-mean, wide-sense stationary and Gaussian, approximate expressions that characterize the steady-state mean-squared estimation error of the algorithm is dervied. The validity of our derivation is then confirement by computer simulations. The convergence speed is compared under the condition that the LMAT and other competing algorithms converge to the same value for the mean-squared estimation error in the stead-state, and superior convergence property of the LMAT algorithm is observed. In particular, it is shown that the LMAT algorithm converges faster than other algorithms even through the eignevalue spread ratio of the input signal and measurement noise power change.

  • PDF

Performance Improvement of LSU Algorithms in QoS Routing (QoS 라우팅의 LSU 알고리즘 성능 향상 기법)

  • Cho, Kang-Hong
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.3
    • /
    • pp.49-57
    • /
    • 2009
  • This paper has proposed Flow Holding Time based Link State Update(LSU) Algorithm that can improve the performance of the existing LSU algorithms. As the existing LSU algorithms are based on the network traffic information, the proposed algorithm is based on flow holding time so we can minimize the LSU message overhead and has not had a strong influence on the depreciation of QoS routing performance. We apply a flow holding time in order to decrease the number of LSU message. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

Development of Web Accessibility Evaluation Algorithm-Based upon Table Element (웹 접근성 평가 알고리즘 개발-Table 요소 중심으로)

  • Park, Seong-Je;Kim, Jong-Weon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.18 no.4
    • /
    • pp.81-87
    • /
    • 2013
  • Due to the development of IT technologies and the Internet penetration, the importance of Web accessibility has greatly increased and accordingly been studied a lot. This study noticed that the current evaluation algorithm for "Table Elements," which are used for data and layout tables, has many problems. Based on the Web Accessibility Guidelines, this study presents an improved evaluation algorithm for "Table Elements" and verifies its validity.

Objective Evaluation of Background Subtraction Algorithms for Soccer Video Analysis: An Experimental Comparative Study (축구 동영상 분석을 위한 배경 분리 알고리즘들의 정량적 비교 평가에 관한 연구)

  • Jung, Chanho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.1
    • /
    • pp.42-45
    • /
    • 2017
  • In this letter, we present an experimental comparative study of background subtraction algorithms for soccer video analysis. We investigated five different background subtraction algorithms under the same experimental setup. For the quantitative comparison, we employed the precision, recall, and F-measure. We believe that this comprehensive comparative study serves as a reference point and guide for developers and practitioners in choosing an appropriate background subtraction algorithm adopted for building intelligent soccer video analysis systems.