• Title/Summary/Keyword: Fixed Point Algorithm

Search Result 362, Processing Time 0.114 seconds

An analysis of hardware design conditions of EGML-based moving object detection algorithm (EGML 기반 이동 객체 검출 알고리듬의 하드웨어 설계조건 분석)

  • An, Hyo-sik;Kim, Keoung-hun;Shin, Kyung-wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.371-373
    • /
    • 2015
  • This paper describes an analysis of hardware design conditions of moving object detection algorithm which is based on effective Gaussian mixture learning (EGML). The simulation model of EGML algorithm is implemented using OpenCV, and it is analyzed that the effects of parameter values on background learning time and moving object detection sensitivity for various images. In addition, optimal design conditions for hardware implementation of EGML-based MOD algorithm are extracted from fixed-point simulations for various bit-width parameters.

  • PDF

Development of Control Method for Air-Conditioner as the Resources of DLC (직접부하제어자원으로서 에어컨 주기제어 방법론 개발)

  • Doo, Seog-Bae;Kim, Jeoung-Uk;Kim, Hyeong-Jung;Kim, Hoi-Cheol;Park, Jong-Bae;Shin, Joong-Rin
    • Proceedings of the KIEE Conference
    • /
    • 2005.11b
    • /
    • pp.145-147
    • /
    • 2005
  • This paper presents a methodology for satisfying the thermal comfort of Indoor environment and reducing the summer peak demand power by minimizing the power consumption for an Air-conditioner within a space. KEPCO(Korea Electric Power Corporation) use the fixed duty cycle control method regardless of the indoor thermal environment. This method has disadvantages that energy saying depends on the set-point value of the Air-Conditioner and DLC has no net effects on Air-conditioners if the appliance has a lower operating cycle than the fixed duty cycle. A variable duty cycle estimates the PMV(Predict Mean Vote) at the next step with a predicted temperature and humidity coming from the back propagation neural network model. It is possible to reduce the energy consumption by maintaining the Air-conditioner's OFF state when the PMV lies in the thermal comfort range. The proposed methodology uses the historical real data of Sep. 7th, 2001 from a classroom in seoul to verify the effectiveness of the variable duty cycle method comparing with fixed duty cycle. The result shows that the variable duty cycle reduces the peak demand to 2.6times more than fixed duty cycle and increases the load control ratio by 8% more. Based on the variable duty cycle control algorithm, the effectiveness of DLC is much more improved as compared with the fixed duty cycle.

  • PDF

Autonomic Period Determination for Variable Rate Limiter of Virus Throttling (바이러스 감속기의 가변 비율 제한기를 위한 자율적 주기 결정)

  • Shim, Jae-Hong;Sohn, Jang-Wan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1C
    • /
    • pp.67-77
    • /
    • 2007
  • Virus throttling technique, one of many early worm detection techniques, detects Internet worm propagation by limiting connect requests within a certain ratio. The typical virus throttling controls the period of rate limiter autonomically by utilizing weighted average delay queue length to reduce connection delay time without hanving a large effect on worm detection time. In the existing virus throttling research, a minimum period of variable rate limiter is fired and a turning point which is a point that the period of rate limiter has been being decreased and starts to be increased is also fixed. However, these two performance factors have different effects on worm detection time and connection delay. In this paper, we analyze the effect of minimum period and turning point of variable rate limiter, and then propose an algorithm which determines values of performance factors by referencing current traffic pattern. Through deep experiments, it is verified that the proposed technique is more efficient in respect of reducing worm detection time and connection delay than the existing virus throttling which fixed the performance factors.

A New Block Matching Motion Estimation using Predicted Direction Search Algorithm (예측 방향성 탐색 알고리즘을 이용한 새로운 블록 정합 움직임 추정 방식)

  • Seo, Jae-Su;Nam, Jae-Yeol;Gwak, Jin-Seok;Lee, Myeong-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2S
    • /
    • pp.638-648
    • /
    • 2000
  • This paper introduces a new technique for block is matching motion estimation. Since the temporal correlation of the image sequence, the motion vector of a block is highly related to the motion vector of the same coordinate block in the previous image frame. If we can obtain useful and enough information from the motion vector of the same coordinate block of the previous frame, the total number of search points used to find the motion vector of the current block may be reduced significantly. Using that idea, an efficient predicted direction search algorithm (PDSA) for block matching algorithm is proposed. Based on the direction of the blocks of the two successive previous frames, if the direction of the to successive blocks is same, the first search point of the proposed PDSA is moved two pixels to the direction of the block. The searching process after moving the first search point is processed according to the fixed search patterns. Otherwise, full search is performed with search area $\pm$2. Simulation results show that PSNR values are improved up to the 3.4dB as depend on the image sequences and improved about 1.5dB on an average. Search times are reduced about 20% than the other fast search algorithms. Simulation results also show that the performance of the PDSA scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS(Full Search) algorithm.

  • PDF

Propulsion System Design and Optimization for Ground Based Interceptor using Genetic Algorithm

  • Qasim, Zeeshan;Dong, Yunfeng;Nisar, Khurram
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2008.03a
    • /
    • pp.330-339
    • /
    • 2008
  • Ground-based interceptors(GBI) comprise a major element of the strategic defense against hostile targets like Intercontinental Ballistic Missiles(ICBM) and reentry vehicles(RV) dispersed from them. An optimum design of the subsystems is required to increase the performance and reliability of these GBI. Propulsion subsystem design and optimization is the motivation for this effort. This paper describes an effort in which an entire GBI missile system, including a multi-stage solid rocket booster, is considered simultaneously in a Genetic Algorithm(GA) performance optimization process. Single goal, constrained optimization is performed. For specified payload and miss distance, time of flight, the most important component in the optimization process is the booster, for its takeoff weight, time of flight, or a combination of the two. The GBI is assumed to be a multistage missile that uses target location data provided by two ground based RF radar sensors and two low earth orbit(LEO) IR sensors. 3Dimensional model is developed for a multistage target with a boost phase acceleration profile that depends on total mass, propellant mass and the specific impulse in the gravity field. The monostatic radar cross section (RCS) data of a three stage ICBM is used. For preliminary design, GBI is assumed to have a fixed initial position from the target launch point and zero launch delay. GBI carries the Kill Vehicle(KV) to an optimal position in space to allow it to complete the intercept. The objective is to design and optimize the propulsion system for the GBI that will fulfill mission requirements and objectives. The KV weight and volume requirements are specified in the problem definition before the optimization is computed. We have considered only continuous design variables, while considering discrete variables as input. Though the number of stages should also be one of the design variables, however, in this paper it is fixed as three. The elite solution from GA is passed on to(Sequential Quadratic Programming) SQP as near optimal guess. The SQP then performs local convergence to identify the minimum mass of the GBI. The performance of the three staged GBI is validated using a ballistic missile intercept scenario modeled in Matlab/SIMULINK.

  • PDF

Loadability Analysis of Modular Fixtures based on a Configuration Space Approach (형상공간 접근 방식에 기반한 모듈식 고정쇠의 적재가능성 분석)

  • 유견아
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.5
    • /
    • pp.398-406
    • /
    • 2003
  • In modular fixturing systems, a given part or a subassembly is fixed by placing fixture elements such as locators and clamps adequately on a plate with a lattice of holes. It is known that the minimal number of point contacts to restrict translational and rotational motions on a plane is four and the type of three locators and a clamp(3L/1C) is the minimal future. Brost and Goldberg developed the complete algorithm to automatically synthesize 3L/1C types of fixtures which satisfy the condition of form closure. Due to the nature of the fixture, the clearance between the fixture and the part is extremely small. It is hard to load the part repeatedly and accurately for human as well as for robot. However the condition of loadability has not been taken into account in the B&G algorithm. In this paper, a new method to decide a given fixture to be loadable by using configuration space is proposed. A method to plan for a part to be loaded by using compliance safely even in the presence of control and sensing uncertainty is proposed is well.

Distributed Uplink Resource Allocation in Multi-Cell Wireless Data Networks

  • Ko, Soo-Min;Kwon, Ho-Joong;Lee, Byeong-Gi
    • Journal of Communications and Networks
    • /
    • v.12 no.5
    • /
    • pp.449-458
    • /
    • 2010
  • In this paper, we present a distributed resource allocation algorithm for multi-cell uplink systems that increases the weighted sum of the average data rates over the entire network under the average transmit power constraint of each mobile station. For the distributed operation, we arrange each base station (BS) to allocate the resource such that its own utility gets maximized in a noncooperative way. We define the utility such that it incorporates both the weighted sum of the average rates in each cell and the induced interference to other cells, which helps to instigate implicit cooperation among the cells. Since the data rates of different cells are coupled through inter-cell interferences, the resource allocation taken by each BS evolves over iterations. We establish that the resource allocation converges to a unique fixed point under reasonable assumptions. We demonstrate through computer simulations that the proposed algorithm can improve the weighted sum of the average rates substantially without requiring any coordination among the base stations.

Investment Scheduling of Maximizing Net Present Value of Dividend with Reinvestment Allowed

  • Sung, Chang-Sup;Song, Joo-Hyung;Yang, Woo-Suk
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.506-516
    • /
    • 2005
  • This paper deals with an investment scheduling problem of maximizing net present value of dividend with reinvestment allowed, where each investment has certain capital requirement and generates deterministic profit. Such deterministic profit is calculated at completion of each investment and then allocated into two parts, including dividend and reinvestment, at each predetermined reinvestment time point. The objective is to make optimal scheduling of investments over a fixed planning horizon which maximizes total sum of the net present values of dividends subject to investment precedence relations and capital limit but with reinvestment allowed. In the analysis, the scheduling problem is transformed to a kind of parallel machine scheduling problem and formulated as an integer programming which is proven to be NP-complete. Thereupon, a depth-first branch-and-bound algorithm is derived. To test the effectiveness and efficiency of the derived algorithm, computational experiments are performed with some numerical instances. The experimental results show that the algorithm solves the problem relatively faster than the commercial software package (CPLEX 8.1), and optimally solves the instances with up to 30 investments within a reasonable time limit.

  • PDF

Algorithm to Shorten Imaging Time in Fluorescent X-ray Computed Tomogrpahy (형광 X선 CT에서 촬상 시간의 단축화 알고리즘)

  • 정남채
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.2 no.4
    • /
    • pp.46-52
    • /
    • 2001
  • In this paper it was examined both imaging system and processing algorithm for imaging's high speedization of fluorescent X-ray computed tomography using synchrotron radiation, The electronic system was used for dead time by about 6% but shortening of measure time was achieved by 2 seconds per 1 point. Also efficiency of reconstruction algorithm was proved, and memory and calculation amount was decreased by about 1/100 The fixed quantity was confirmed by physical phantom, and iodine distribution was presumed from image of thyroid gland in vitro These result shows realization possibility of fluorescent X-ray computed tomography measure in vivo.

  • PDF

Estimation of the Sensor Location and the Step for Personal Navigation System (개인 항법 시스템을 위한 센서 위치와 보폭 추정 알고리즘)

  • Kim, Tae-Un;Lee, Ho-Won;Chwa, Dong-Kyoung;Hong, Suk-Kyo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.11
    • /
    • pp.2058-2065
    • /
    • 2010
  • This paper presents the sensor location and step estimation algorithm for personal navigation system (PNS). PNS has the disadvantage in that the position of the sensor must be fixed on a human body. Three-axis acceleration sensor is used to solve the disadvantage and to consider the real situation. We simplify the measurement data by using the band pass filter, witch It has the advantage in the detection of characteristic point. Through the detected characteristic points, it is possible to setup the parameter for the pattern detection. Depending on the sensor location, the parameters have the different type of noise covariance. Particularly, when the position of the sensor is changed, the impulse noise shows up. Considering the noise, we apply the recursive least square algorithm using the variable forgetting factors, which can classify the sensor location based on the estimated parameters. We performed the experiment for the verification of the proposed algorithm in the various environments. Through the experimental results, the effectiveness of the proposed method is verified.