• 제목/요약/키워드: Adaptive K-best

검색결과 176건 처리시간 0.023초

화면 간 차이신호에 대한 적응적 그레이코드를 이용한 분산 비디오 부호화 기법의 성능 분석 (Performance Analysis of DVC Scheme with Adaptive Gray Code for Frame Difference Signal)

  • 김진수;김재곤;최해철
    • 방송공학회논문지
    • /
    • 제17권5호
    • /
    • pp.876-890
    • /
    • 2012
  • 본 논문에서는 화면 간 차이 신호에 적용하기 위한 적응적인 그레이코드 할당을 갖는 분산 비디오 코덱의 성능 분석을 수행하였다. 즉, 화면 간 차이 신호가 갖는 통계특성에 기초하여 양자화된 값에 대해 최고의 성능을 갖는 그레이코드 할당 방법과 최저의 성능을 갖는 그레이코드 할당 방법에 대해 성능을 비교 분석하였다. 모의실험을 통해 8비트 밝기 해상도를 갖는 영상에서 화면 간 차이 신호는 9비트의 데이터를 발생시키고, 양자화해서 전송되는 비트가 n비트이면, 화면 간 차이 신호에 $256+2^{9-n-1}$를 더함으로써 가상채널잡음의 효과를 최소화할 수 있음을 확인하였다. 영상시퀀스를 이용한 모의실험에서 최고의 성능과 최저의 성능을 갖는 방식간에 동일 비트율에서 약 1.5dB이상의 화질 차이가 발생함을 확인하였다. 본 논문에서 분석된 결과는 화소영역 또는 변환영역의 위너-지브 부호화기법으로 확장하여 적용될 수 있을 것으로 기대된다.

적응 PID 제어기를 이용한 이동로봇의 군집제어 (Formation Control of Mobile Robots using Adaptive PID Controller)

  • 박진현;최영규
    • 한국정보통신학회논문지
    • /
    • 제19권11호
    • /
    • pp.2554-2561
    • /
    • 2015
  • 본 연구에서는 이동 로봇의 군집제어기에 관한 연구로써 구조가 단순한 PID 제어기의 장점을 살리고, 추종 로봇의 동역학 특성에 강인한 성능을 내는 적응 PID 제어기를 제안하고자 한다. 모의실험을 통하여 제안된 적응 PID 제어기가 일반적인 PID 제어기에 비하여 군집 제어에서 추종 로봇의 추종 성능인 일정 거리 와 일정 각도를 잘 유지하며, 추종 로봇의 무게가 변화될 경우에도 잘 추종함을 알 수 있다. 이는 제안된 적응 PID 제어기가 이득을 변화시켜 최적의 성능을 나타냄을 알 수 있다. 이를 통해 제안된 적응 PID 제어기의 성능이 우수함을 검증할 수 있다.

Adaptive Control of Strong Mutation Rate and Probability for Queen-bee Genetic Algorithms

  • Jung, Sung-Hoon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제12권1호
    • /
    • pp.29-35
    • /
    • 2012
  • This paper introduces an adaptive control method of strong mutation rate and probability for queen-bee genetic algorithms. Although the queen-bee genetic algorithms have shown good performances, it had a critical problem that the strong mutation rate and probability should be selected by a trial and error method empirically. In order to solve this problem, we employed the measure of convergence and used it as a control parameter of those. Experimental results with four function optimization problems showed that our method was similar to or sometimes superior to the best result of empirical selections. This indicates that our method is very useful to practical optimization problems because it does not need time consuming trials.

An Adaptive Mobility Estimator for the Estimation of Time-Variant OFDM Channels

  • Kim, Dae-jin;Kim, Cheol-Min;Park, Sung-Woo
    • 방송공학회논문지
    • /
    • 제6권1호
    • /
    • pp.72-81
    • /
    • 2001
  • An adaptive channel estimation technique for OFDM-based DTV receivers is proposed using a new mobility estimator. Sample mean techniques for channel estimation have displayed good performance in slow fading channels, because averaging reduces noise In channel estimation operation. This paper suggests an algorithm which selects the optimal number of symbols within which the sample mean of consecutive pilot data can be obtained. The designed mobility estimator determines the optimal number by comparing mobility variance and estimated noise valiance. The algorithm using the mobility estimator obtains an optimal channel function under time-invariant or time-variant multipath fading channels, thereby making the best BER performance.

  • PDF

Optimizing Speed For Adaptive Local Thresholding Algorithm U sing Dynamic Programing

  • Due Duong Anh;Hong Du Tran Le;Duan Tran Duc
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
    • /
    • pp.438-441
    • /
    • 2004
  • Image binarization using a global threshold value [3] performs at high speed, but usually results in undesired binary images when the source images are of poor quality. In such cases, adaptive local thresholding algorithms [1][2][3] are used to obtain better results, and the algorithm proposed by A.E.Savekis which chooses local threshold using fore­ground and background clustering [1] is one of the best thresholding algorithms. However, this algorithm runs slowly due to its re-computing threshold value of each central pixel in a local window MxM. In this paper, we present a dynamic programming approach for the step of calculating local threshold value that reduces many redundant computations and improves the execution speed significantly. Experiments show that our proposal improvement runs more ten times faster than the original algorithm.

  • PDF

Dempster-Shafer 증거 이론을 이용한 배전계통 보호도 평가 (Protection Level Evaluation of Distribution Systems Based on Dempster-Shafer Theory of Evidence)

  • 김희철;이승재;강상희;안복신;박종국
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 하계학술대회 논문집 C
    • /
    • pp.896-898
    • /
    • 1998
  • Recent development of the digital computer and communication technology has made the concept of the adaptive protection possible, which is to adapt the operating parameters of the protective devices to the system changes, so that the best protection function can be maintained all the time. In order to achieve the adaptive protection, it is necessary to have the way to determine whether the change of the settings is needed under the certain system change or how good the current protection level is. This paper proposed the protectability index, which is a way to evaluate the protection level of the system under arbitary conditions and the operating strategy of the adaptive protection utilizing this index. It is based on an hierachical evaluation model and the evidence combination rule of the Dempster-Shafer theory.

  • PDF

Dynamic Service Assignment based on Proportional Ordering for the Adaptive Resource Management of Cloud Systems

  • Mateo, Romeo Mark A.;Lee, Jae-Wan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권12호
    • /
    • pp.2294-2314
    • /
    • 2011
  • The key issue in providing fast and reliable access on cloud services is the effective management of resources in a cloud system. However, the high variation in cloud service access rates affects the system performance considerably when there are no default routines to handle this type of occurrence. Adaptive techniques are used in resource management to support robust systems and maintain well-balanced loads within the servers. This paper presents an adaptive resource management for cloud systems which supports the integration of intelligent methods to promote quality of service (QoS) in provisioning of cloud services. A technique of dynamically assigning cloud services to a group of cloud servers is proposed for the adaptive resource management. Initially, cloud services are collected based on the excess cloud services load and then these are deployed to the assigned cloud servers. The assignment function uses the proposed proportional ordering which efficiently assigns cloud services based on its resource consumption. The difference in resource consumption rate in all nodes is analyzed periodically which decides the execution of service assignment. Performance evaluation showed that the proposed dynamic service assignment (DSA) performed best in throughput performance compared to other resource allocation algorithms.

Distributed estimation over complex adaptive networks with noisy links

  • Farhid, Morteza;Sedaaghi, Mohammad H.;Shamsi, Mousa
    • Smart Structures and Systems
    • /
    • 제19권4호
    • /
    • pp.383-391
    • /
    • 2017
  • In this paper, we investigate the impacts of network topology on the performance of a distributed estimation algorithm, namely combine-then-adaptive (CTA) diffusion LMS, based on the data with or without the assumptions of temporal and spatial independence with noisy links. The study covers different network models, including the regular, small-world, random and scale-free whose the performance is analyzed according to the mean stability, mean-square errors, communication cost (link density) and robustness. Simulation results show that the noisy links do not cause divergence in the networks. Also, among the networks, the scale free network (heterogeneous) has the best performance in the steady state of the mean square deviation (MSD) while the regular is the worst case. The robustness of the networks against the issues like node failure and noisier node conditions is discussed as well as providing some guidelines on the design of a network in real condition such that the qualities of estimations are optimized.

ATM LAN에서 적응적 폭주제어 방식에 관한 연구 (A Study on the Adaptive Congestion Control Schemes in ATM LANs)

  • 이우승;문규춘;김훈;박광채
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1999년도 추계종합학술대회 논문집
    • /
    • pp.129-132
    • /
    • 1999
  • In this Paper, new congention control schemes using the adaptive rate control for ATM LANs are presented. If is preferable for hosts in LANs to be able to send bursts at the same speed as the interface link speed in a lightly loaded condition, and as the network load increases, to reduce their traffic rate adaptively in order to avaid network congestion. We propose to apply such a rate control concept for two different traffic classed in the ATM LANs. For the first traffic class requiring no bandwidth reservation, i.e, a best effort service class, a combination of the end-to-end adaptive peak rate control with the link-by-link backpressure control is proposed. For the second traffic class, requiring the bandwidth reservation for the burst transmission, i.e. guaranteed burst service class, a combination of he adaptive peak rate control with the fast bandwidth reservation is proposed.

  • PDF

무선 단말의 처리능력과 동적 네트워크 환경을 고려한 에이전트 기반의 적응적 멀티미디어 스트리밍 기법 (Agent-based Adaptive Multimedia Streaming Considering Device Capabilities and Dynamic Network Conditions)

  • 장민수;성채민;김진구;임경식
    • 대한임베디드공학회논문지
    • /
    • 제10권6호
    • /
    • pp.353-362
    • /
    • 2015
  • In order to provide smart devices with high quality multimedia streaming services, an adaptive streaming technique over HTTP has been received much attention recently and the Dynamic Adaptive Streaming over HTTP (DASH) standard has been established. In DASH, however, the technique to select an appropriate quality of multimedia based on the performance metrics measured in a smart device might have some difficulties to reflect the capabilities of other neighboring smart devices and dynamic network conditions in real time. To solve the problem, this paper proposes a novel software agent approach, called DASH agent (DA), which gathers and analyzes the device capabilities and dynamic network conditions in real time and finally determines the highest achievable quality of segment to meet the best Quality of Experience (QoE) in current situations. The simulation results show that our approach provides higher quality of multimedia segments with less frequency of quality changes to lower quality of multimedia segments.