• Title/Summary/Keyword: adaptive algorithm

Search Result 4,678, Processing Time 0.031 seconds

Adaptive Realtime Traffic Allocation Algorithm for Streaming Data (스트리밍 데이터를 위한 적응적 실시간 트래픽 할당 기법)

  • Jin Hyun-Joon;Seo Sang-Jin;Park Nho-Kyung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.3 s.345
    • /
    • pp.111-117
    • /
    • 2006
  • Developing a home network and a ubiquitous infrastructure requires various communication techniques and devices with more advanced hardware. With this development, increasing realtime access to multimedia data results in rapid degradation of qualify for multimedia playback. This paper presents a traffic allocation technique based on MPP(Media Preference for Presentation) that can steadily maintain multimedia playback quality by adaptively allocating streaming traffic requested from clients with different playback performances. Media preference is defined in accordance with content popularity and playback performance of client devices. Through experiments when requested stream data exceeds processing ability of a midea server, the proposed allocation technique shows 10% quality improvement comparing to the system without applying the proposed allocation technique.

FER Performance Evaluation and Enhancement of IEEE 802.11 a/g/p WLAN over Multipath Fading Channels in GNU Radio and USRP N200 Environment

  • Alam, Muhammad Morshed;Islam, Mohammad Rakibul;Arafat, Muhammad Yeasir;Ahmed, Feroz
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.178-203
    • /
    • 2018
  • In this paper, authors have been evaluated the Frame Error Rate (FER) performance of IEEE 802.11 a/g/p standard 5 GHz frequency band WLAN over Rayleigh and Rician distributed fading channels in presence of Additive White Gaussian Noise (AWGN). Orthogonal Frequency Division Multiplexing (OFDM) based transceiver is implemented by using real-time signal processing frameworks (IEEE 802.11 Blocks) in GNU Radio Companion (GRC) and Ettus USRP N200 is used to process the symbol over the wireless radio channel. The FER is calculated for each sub-carrier conventional modulation schemes used by OFDM such as BPSK, QPSK, 16, 64-QAM with different punctuated coding rates. More precise SNR is computed by modifying the SNR calculation process of YANS and NIST error rate model to estimate more accurate FER. Here, real-time signal constellations, OFDM signal spectrums etc. are also observed to find the effect of multipath propagation of signals through flat and frequency selective fading channels. To reduce the error rate due to the multipath fading effect and Doppler shifting, channel estimation (CE) and equalization techniques such as Least Square (LS) and training based adaptive Least Mean Square (LMS) algorithm are applied in the receiver. The simulation work is practically verified at GRC by turning into a pair of Software Define Radio (SDR) as a simultaneous transceiver.

Connection-Degree Based Search and Replication in Mobile Ad Hoc Networks (모바일 애드-혹 네트워크에서 연결차수 기반 탐색 및 복제 기법)

  • Kang, Eun-Young;Im, Yong-Soon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.5
    • /
    • pp.187-195
    • /
    • 2008
  • In MANET, it is important to efficiently manage data objects and traffic to improve network throughput and response time. This paper proposes a connection-degree based data object search and replication scheme in mobile ad-hoc networks. In this method, information about the path data object providers is stored at the cache of a cluster header at which lots of queries arrive, so that, to reduce the load of the cluster header, replicas can be created at its neighboring nodes. The method proposes an algorithm that picks up a cluster header among mobile nodes and makes it possible to search for and utilize adaptive and up-to-date information in MANET. The method is expected to be effective since it enables access to data objects in spite of broken links among mobile nodes with an enhancement in network response time of searching and a decrease in communication costs. The efficiency of this system was verified via simulation.

  • PDF

Research on Speed Estimation Method of Induction Motor based on Improved Fuzzy Kalman Filtering

  • Chen, Dezhi;Bai, Baodong;Du, Ning;Li, Baopeng;Wang, Jiayin
    • Journal of international Conference on Electrical Machines and Systems
    • /
    • v.3 no.3
    • /
    • pp.272-275
    • /
    • 2014
  • An improved fuzzy Kalman filtering speed estimation scheme was proposed by means of measuring stator side voltage and current value based on vector control state equation of induction motor. The designed fuzzy adaptive controller conducted recursive online correction of measurement noise covariance matrix by monitoring the ratio of theory residuals and actual residuals to make it approach real noise level gradually, allowing the filter to perform optimal estimation to improve estimation accuracy of EKF. Meanwhile, co-simulation scheme based on MATLAB and Ansoft was proposed in order to improve simulation accuracy. Field-circuit coupling problems of induction motor under the action of vector control were solved and the parameter optimization accuracy was improved dramatically. The simulation and experimental results show that this algorithm has a strong ability to inhibit the random measurement noise. It is able to estimate motor speed accurately, and has superior static and dynamic characteristics.

Adaptive stochastic gradient method under two mixing heterogenous models (두 이종 혼합 모형에서의 수정된 경사 하강법)

  • Moon, Sang Jun;Jeon, Jong-June
    • Journal of the Korean Data and Information Science Society
    • /
    • v.28 no.6
    • /
    • pp.1245-1255
    • /
    • 2017
  • The online learning is a process of obtaining the solution for a given objective function where the data is accumulated in real time or in batch units. The stochastic gradient descent method is one of the most widely used for the online learning. This method is not only easy to implement, but also has good properties of the solution under the assumption that the generating model of data is homogeneous. However, the stochastic gradient method could severely mislead the online-learning when the homogeneity is actually violated. We assume that there are two heterogeneous generating models in the observation, and propose the a new stochastic gradient method that mitigate the problem of the heterogeneous models. We introduce a robust mini-batch optimization method using statistical tests and investigate the convergence radius of the solution in the proposed method. Moreover, the theoretical results are confirmed by the numerical simulations.

Face Detection Using Skin Color and Geometrical Constraints of Facial Features (살색과 얼굴 특징들의 기하학적 제한을 이용한 얼굴 위치 찾기)

  • Cho, Kyung-Min;Hong, Ki-Sang
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.12
    • /
    • pp.107-119
    • /
    • 1999
  • There is no authentic solution in a face detection problem though it is an important part of pattern recognition and has many diverse application fields. The reason is that there are many unpredictable deformations due to facial expressions, view point, rotation, scale, gender, age, etc. To overcome these problems, we propose an algorithm based on feature-based method, which is well known to be robust to these deformations. We detect a face by calculating a similarity between the formation of real face feature and candidate feature formation which consists of eyebrow, eye, nose, and mouth. In this paper, we use a steerable filter instead of general derivative edge detector in order to get more accurate feature components. We applied deformable template to verify the detected face, which overcome the weak point of feature-based method. Considering the low detection rate because of face detection method using whole input images, we design an adaptive skin-color filter which can be applicable to a diverse skin color, minimizing target area and processing time.

  • PDF

Efficient VLSI Architecture for Disparity Calculation based on Geodesic Support-weight (Geodesic Support-weight 기반 깊이정보 추출 알고리즘의 효율적인 VLSI 구조)

  • Ryu, Donghoon;Park, Taegeun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.9
    • /
    • pp.45-53
    • /
    • 2015
  • Adaptive support-weight based algorithm can produce better disparity map compared to generic area-based algorithms and also can be implemented as a realtime system. In this paper, we propose a realtime system based on geodesic support-weight which performs better segmentation of objects in the window. The data scheduling is analyzed for efficient hardware design and better performance and the parallel architecture for weight update which takes the longest delay is proposed. The exponential function is efficiently designed using a simple step function by careful error analysis. The proposed architecture is designed with verilogHDL and synthesized using Donbu Hitek 0.18um standard cell library. The proposed system shows 2.22% of error rate and can run up to 260Mhz (25fps) operation frequency with 182K gates.

Improved 3D Shape Measurement Scheme for White Light Phase Shifting Interferometry (백색광 위상천이 간섭계를 위한 개선된 삼차원 형상 측정 방법)

  • Kim, Kyoung-Il;Lee, Dong-Yeol;Ko, Yun-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.2
    • /
    • pp.51-60
    • /
    • 2010
  • This paper proposes a new scheme to obtain enhanced 3D shape information rapidly for WLPSI(White Light Phase Shifting Interferometry). WLPSI is a convenient method to measure the height of the micro products. First we propose an effective method of limiting search interval for detecting the peak of the visibility function in order to obtain 3D shpae information rapidly. Second we propose an automatic base level decision method basad on image processing and a correction algorithm using the least square approximation method to overcome the global tilt problem of the conventional WLPSI algorithms. Third we propose an adaptive filtering method to remove the distortion known as bat-wing effect which appears near the step discontinuity. Experimental results show that the proposed overall technique is fast and provides more enhanced 3D shape information compared with the conventional WLPSI algorithms.

Beam Scheduling Algorithm of Multi-Function AESA Radar Based on Dispatching Rules (Dispatching Rule에 기반한 능동 위상 배열 다기능 레이더의 빔 스케줄링 기법)

  • Roh, Ji-Eun;Ahn, Chang-Soo;Kim, Seon-Joo
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.1
    • /
    • pp.1-13
    • /
    • 2012
  • AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability, compared with mechanically scanned array radar. AESA radar brings a new challenges, radar resource management(RRM), which is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed the several dispatching rules for radar beam scheduling, and compared the performance on the multi-function radar scenario. We also showed that the dispatching rule which differently applying SPF(Shortest Processing time First) and ERF(Earliest Request time First) according to beam processing latency is the most efficient.

Monte Carlo Photon and Electron Dose Calculation Time Reduction Using Local Least Square Denoising Filters (국소 최소자승 잡음 감소 필터를 이용한 광자선 및 전자선 몬테칼로 선량 계산 시간 단축)

  • Cheong Kwang-Ho;Suh Tae-Suk;Cho Byung-Chul;Jin Hosang
    • Progress in Medical Physics
    • /
    • v.16 no.3
    • /
    • pp.138-147
    • /
    • 2005
  • The Monte Carlo method cannot have been used for routine treatment planning because of heavy time consumption for the acceptable accuracy. Since calculation time is proportional to particle histories, we can save time by decreasing the number of histories. However, a small number of histories can cause serious uncertainties. In this study, we proposed Monte Carlo dose computation time and uncertainty reduction method using specially designed filters and adaptive denoising process. Proposed algorithm was applied to 6 MV photon and 21 MeV electron dose calculations in homogeneous and heterogeneous phantoms. Filtering time was negligible comparing to Monte Carlo simulation time. The accuracy was improved dramatically in all situations and the simulation of 1 $\%$ to 10$\%$ number of histories of benchmark in photon and electron dose calculation showed the most beneficial result. The empirical reduction of necessary histories was about a factor of ten to fifty from the result.

  • PDF