• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2015년도 춘계학술대회
• /
• pp.371-373
• /
• 2015

본 논문에서는 EGML (Effective Gaussian Mixture Learning) 기반 이동 객체 검출 알고리듬의 하드웨어 구현을 위한 설계조건을 분석하였다. EGML 알고리듬을 OpenCV 소프트웨어로 구현하였으며, 다양한 영상들에 대한 시뮬레이션을 통해 배경학습 시간과 이동 객체 검출에 영향을 미치는 파라미터 조건을 분석하였다. 또한, 고정소수점 시뮬레이션을 통해 파라미터들의 비트 폭이 이동 객체검출 성능에 미치는 영향을 평가하고, 최적 하드웨어 설계 조건을 도출하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 추계학술대회 논문집 전력기술부문
• /
• 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.

• 한국통신학회논문지
• /
• 제32권1C호
• /
• pp.67-77
• /
• 2007

바이러스 감속기(virus throttling)은 연결요청 패킷의 전송비율을 일정 비율 이하로 제한함으로써 웜을 탐지하는 대표적인 조기 웜 탐지 기술 중의 하나이다. 기존 바이러스 감속기 연구에서는 웜 탐지시간에는 크게 영향을 미치지 않으면서도 연결설정 지연시간을 단축시키기 위해 가중치 평균 지연 큐 길이를 적용하여 비율 제한기의 주기를 자율적으로 조절하였다. 기존 연구에서는 비율 제한기의 최소주기를 고정하고 또한 주기 값을 감소시키다가 다시 증가시키기 시작하는 반환점도 미리 고정하였다. 그러나 이러한 두 성능결정 요소는 웜 탐지시간과 연결 설정 지연에 서로 다른 영향을 미친다. 따라서 본 논문에서는 가변 비율 제한기의 최소주기와 반환점이 어떤 영향을 미치는지 실험을 통해 분석하고, 상황에 따라 이들 성능결정 요소들의 값을 결정할 수 있는 방안을 제시하고자 한다. 제안된 방법은 성능결정 요소를 고정시킨 기존 방법보다는 웜 탐지시간이나 연결설정 지연시간 단축에 더 효율적이라는 사실을 실험을 통해 확인하였다.

• 한국정보처리학회논문지
• /
• 제7권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.

• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2008년 영문 학술대회
• /
• 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.

• 제어로봇시스템학회논문지
• /
• 제9권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.

• Journal of Communications and Networks
• /
• 제12권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.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• 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.

• 융합신호처리학회논문지
• /
• 제2권4호
• /
• pp.46-52
• /
• 2001

방사광을 이용한 형강 X선 CT 이미징의 고속화를 위한 촬상 시스템과 처리 알고리즘을 검토하였다. 본 논문에서 사용된 촬상시스템은 고계수율 영역에서 안정된 동작을 한 전자 시스템으로 불감시간이 약 6%로 감소되고 계측시간의 경우도 1 점 당 3초로 단축되었다. 또한 재구성 알고리즘의 효율화를 증명하였고, 메모리와 계산량을 약 1/100로 감소시켰다. 물리적 phantom으로 그 정량성을 확인하였고, 시험관내의 갑상선의 화상으로부터 요드 분포를 추정하였다. 이러한 결과는 생체내에서 형광 X선 CT 계측의 실현 가능성을 보여준 것이다.

• 전기학회논문지
• /
• 제59권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.