• Title/Summary/Keyword: Shift algorithm

Search Result 683, Processing Time 0.029 seconds

Fast Contingency Ranking Algorithm of Power Equipment (전력설비의 신속한 상정사고 선택 앨고리즘)

  • 박규홍;정재길
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.12 no.1
    • /
    • pp.20-25
    • /
    • 1998
  • This paper presents an algorithm for contingency ranking using line outage distribution factors(LODF) which are established by generation shift distribution factors(GSDF) from DC load flow solutions. By using the LODF, the line flow can be calculated according to the modification of base load flow if the contingency occur. To obtain faster contingency ranking, only the loading line more than 35[%](60[%] at 154[kV]) is included in the computation of Performance Index(PI). The proposed algorithm has been validated in tests on a 6-bus test system.system.

  • PDF

A Region Search Algorithm and Improved Environment Map Building for Mobile Robot Navigation

  • Jin, Kwang-Sik;Jung, Suk-Yoon;Son, Jung-Su;Yoon, Tae-Sung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.71.1-71
    • /
    • 2001
  • In this paper, an improved method of environment map building and a region search algorithm for mobile robot are presented. For the environment map building of mobile robot, measurement data of ultrasonic sensors and certainty grid representation is usually used. In this case, inaccuracies due to the uncertainty of ultrasonic data are included in the map. In order to solve this problem, an environment map building method using a Bayesian model was proposed previously[5]. In this study, we present an improved method of probability map building that uses infrared sensors and shift division Gaussian probability distribution with the existing Bayesian update method using ultrasonic sensors. Also, a region search algorithm for ...

  • PDF

A Tone Compression Model for the Compensation of White Point Shift Generated from HDR Rendering (HDR 렌더링으로 인한 화이트 포인트 이동의 보상을 위한 톤 압축 모델)

  • Chae, Seok-Min;Lee, Sung-Hak;Kwon, Hyuk-Ju;Sohng, Kyu-Ik
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.1
    • /
    • pp.9-17
    • /
    • 2012
  • Recently, a new image appearance model, named iCAM06, was developed for High-Dynamic-Range (HDR) image rendering. The dynamic range of a HDR image needs to be mapped on the range of output devices, which is called the tone reproduction or tone mapping. The iCAM06, the representative HDR rendering algorithm also uses the tone compression using a S-curve mapping function for image reproduction on the dynamic range of output devices. However the iCAM06 occurs white point shift during its tone compression process. Therefore, we propose a compensation method for white point shift problem using the corrected channel gain function. Experiment results show that the proposed method has better performance than the iCAM06.

A Road Extraction Algorithm using Mean-Shift Segmentation and Connected-Component (평균이동분할과 연결요소를 이용한 도로추출 알고리즘)

  • Lee, Tae-Hee;Hwang, Bo-Hyun;Yun, Jong-Ho;Park, Byoung-Soo;Choi, Myung-Ryul
    • Journal of Digital Convergence
    • /
    • v.12 no.1
    • /
    • pp.359-364
    • /
    • 2014
  • In this paper, we propose a method for extracting a road area by using the mean-shift method and connected-component method. Mean-shift method is very effective to divide the color image by the method of non-parametric statistics to find the center mode. Generally, the feature points of road are extracted by using the information located in the middle and bottom of the road image. And it is possible to extract a road region by using this feature-point and the partitioned color image. However, if a road region is extracted with only the color information and the position information of a road image, it is possible to detect not only noise but also off-road regions. This paper proposes the method to determine the road region by eliminating the noise with the closing / opening operation of the morphology, and by extracting only the portion of the largest area using a connected-components method. The proposed method is simulated and verified by applying the captured road images.

Merge and Split of Players under MeanShift Tracking in Baseball Videos (야구 비디오에 대한 민시프트 추적 하에서 선수 병합 분리)

  • Choi, Hyeon-yeong;Hong, Sung-hwa;Ko, Jae-pil
    • Journal of Advanced Navigation Technology
    • /
    • v.21 no.1
    • /
    • pp.119-125
    • /
    • 2017
  • In this paper, we propose a method that merges and splits players in the MeanShift tracking framework. The MeanShift tracking moves the center of tracking window to the maximum probability location given the target probability distribution. This tracking method has been widely used for real-time tracking problems because of its fast processing speed. However, it hardly handles occlusions in multiple object tracking systems. Occlusions can be usually solved by applying data association methods. In this paper, we propose a method that can be applied before data association methods. The proposed method automatically merges and splits the overlapped players by adjusting the each player's tracking map. We have compared the tracking performance of the MeanSfhit tracking algorithm and the proposed method.

Phase-Shift Full-Bridge DC-DC Converter using the One-Chip Micom (단일칩 마이컴을 이용한 위상변위 방식 풀브리지 직류-직류 전력변환기)

  • Jeong, Gang-Youl
    • Journal of IKEEE
    • /
    • v.25 no.3
    • /
    • pp.517-527
    • /
    • 2021
  • This paper presents the phase-shift full-bridge DC-DC converter using the one-chip micom. The proposed converter primary is the full-bridge power topology that operates with the unipolar pulse-width modulation (PWM) by the phase-shift method, and the secondary is the full-bridge full-wave rectifier composed of four diodes. The control of proposed converter is performed by the one-chip micom and its MOSFET switches are driven by the bootstrap circuit. Thus the total system of proposed converter is simple. The proposed converter achieves high-efficiency using the resonant circuit and blocking capacitor. In this paper, first, the power-circuit operation of proposed converter is explained according to each operation mode. And the power-circuit design method of proposed converter is shown, and the software control algorithm on the micom and the feedback and switch drive circuits operating the proposed converter are described, briefly. Then, the operation characteristics of proposed converter are validated through the experimental results of a designed and implemented prototype converter by the shown design and implementation method in this paper. The highest efficiency in the results was about 92%.

Powerflow Simulation Software of the Automotive Powertrain through the Combination of the Components (I): Development of the Automatic Powerflow Generation Module (요소결합을 통한 파워트레인 시뮬레이션 소프트웨어 (I): 동력흐름 자동생성 모듈 개발)

  • 이승종;서정민
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.2
    • /
    • pp.43-51
    • /
    • 2004
  • In this paper, the element combination algorithm for designing an arbitrary type of the automatic transmissions is proposed. The powertrain simulation software using this algorithm is then developed. The deliveries of the angular velocities and torques are only considered for the motion characteristics of the automatic transmissions. The effects of the vibration and noise are not considered. The automatic transmission is defined by the basic elements, i.e., planetary gear set, clutch, brake, shaft, general gear, and inertia. The transmission system is defined by the combination of these elements. The element combination matrices automatically generate the equations of motion for each shift. The self error-correcting algorithm is also developed to verify the element combination algorithm. This automotive powertrain simulation/design software with user-friendly graphic user interface has two main modules. The first module, the automatic powerflow generation module, mainly consists of the automatic powerflow and component generation algorithms. This paper covers the theory and application for the first module. The second module deals with the automatic system generation algorithm and will be discussed in the second paper.

Autonomous-flight Drone Algorithm use Computer vision and GPS (컴퓨터 비전과 GPS를 이용한 드론 자율 비행 알고리즘)

  • Kim, Junghwan;Kim, Shik
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.11 no.3
    • /
    • pp.193-200
    • /
    • 2016
  • This paper introduces an algorithm to middle-low price drone's autonomous navigation flight system using computer vision and GPS. Existing drone operative system mainly contains using methods such as, by inputting course of the path to the installed software of the particular drone in advance of the flight or following the signal that is transmitted from the controller. However, this paper introduces new algorithm that allows autonomous navigation flight system to locate specific place, specific shape of the place and specific space in an area that the user wishes to discover. Technology developed for military industry purpose was implemented on a lower-quality hobby drones without changing its hardware, and used this paper's algorithm to maximize the performance. Camera mounted on middle-low price drone will process the image which meets user's needs will look through and search for specific area of interest when the user inputs certain image of places it wishes to find. By using this algorithm, middle-low price drone's autonomous navigation flight system expect to be apply to a variety of industries.

Novel Adaptive Distributed Compressed Sensing Algorithm for Estimating Channels in Doubly-Selective Fading OFDM Systems

  • Song, Yuming;He, Xueyun;Gui, Guan;Liang, Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2400-2413
    • /
    • 2019
  • Doubly-selective (DS) fading channel is often occurred in many orthogonal frequency division multiplexing (OFDM) communication systems, such as high-speed rail communication systems and underwater acoustic (UWA) wireless networks. It is challenging to provide an accurate and fast estimation over the doubly-selective channel, due to the strong Doppler shift. This paper addresses the doubly selective channel estimation problem based on complex exponential basis expansion model (CE-BEM) in OFDM systems from the perspective of distributed compressive sensing (DCS). We propose a novel DCS-based improved sparsity adaptive matching pursuit (DCS-IMSAMP) algorithm. The advantage of the proposed algorithm is that it can exploit the joint channel sparsity information using dynamic threshold, variable step size and tailoring mechanism. Simulation results show that the proposed algorithm achieves 5dB performance gain with faster operation speed, in comparison with traditional DCS-based sparsity adaptive matching pursuit (DCS-SAMP) algorithm.

Branch and Bound Algorithm for Single Machine Scheduling with Step-Improving Jobs (계단형 향상 작업을 갖는 단일설비 스케줄링을 위한 분기한정 알고리즘)

  • Jun-Ho Lee
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.47 no.2
    • /
    • pp.48-56
    • /
    • 2024
  • We examine a single machine scheduling problem with step-improving jobs in which job processing times decrease step-wisely over time according to their starting times. The objective is to minimize total completion time which is defined as the sum of completion times of jobs. The total completion time is frequently considered as an objective because it is highly related to the total time spent by jobs in the system as well as work-in-progress. Many applications of this problem can be observed in the real world such as data gathering networks, system upgrades or technological shock, and production lines operated with part-time workers in each shift. Our goal is to develop a scheduling algorithm that can provide an optimal solution. For this, we present an efficient branch and bound algorithm with an assignment-based node design and tight lower bounds that can prune branch and bound nodes at early stages and accordingly reduce the computation time. In numerical experiments well designed to consider various scenarios, it is shown that the proposed algorithm outperforms the existing method and can solve practical problems within reasonable computation time.