• 반도체디스플레이기술학회지
• /
• 제17권3호
• /
• pp.90-94
• /
• 2018

In this paper, we applied a three-level T-type inverter with the one more voltage level than two-level inverter. However, the three-level T-type inverter has a systematic problem with voltage unbalances. So neutral point control is essential. Therefore, the voltage unbalance problem of the three - phase inverter was confirmed to be controlled within 5V using the neutral point control algorithm in charge and discharge mode. In addition, total harmonic distortion was reduced in three phases (u phase, v phase, w phase) when neutral point control was performed in charging mode and also in three phases (u phase, v phase, w phase) in discharge mode. In this paper suggests a neutral point control algorithm to solve the voltage unbalance of a three-level T-type inverter, and shows the improvement of the performance of the proposed algorithm through experiment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권10호
• /
• pp.2567-2586
• /
• 2012

Localization of sensor nodes is a key technology in Wireless Sensor Networks(WSNs). Trilateration is an important position determination strategy. To further improve the localization accuracy, a novel Trilateration based on Point In Triangle testing Localization (TPITL)algorithm is proposed in the paper. Unlike the traditional trilateration localization algorithm which randomly selects three neighbor anchors, the proposed TPITL algorithm selects three special neighbor anchors of the unknown node for trilateration. The three anchors construct the smallest anchor triangle which encloses the unknown node. To choose the optimized anchors, we propose Point In Triangle testing based on Distance(PITD) method, which applies the estimated distances for trilateration to reduce the PIT testing errors. Simulation results show that the PIT testing errors of PITD are much lower than Approximation PIT(APIT) method and the proposed TPITL algorithm significantly improves the localization accuracy.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제27권1호
• /
• pp.61-70
• /
• 2020

In this paper, we introduce a new concept of stability of coincidence iterative algorithm for three mappings and derive a new three-step Jungck-type iterative algorithm. And, we prove a stability result and a strong convergence result for the Jungck-type algorithm using the M_J-contractive condition. Our results extend and unify the corresponding ones in [3, 6, 7, 13].

• Journal of Power Electronics
• /
• 제14권5호
• /
• pp.926-936
• /
• 2014

A simplified and effective space vector pulse-width modulation (SVPWM) algorithm with two and three levels for three-phase voltage-source converters is proposed in this study. The proposed SVPWM algorithm only uses several linear calculations on three-phase modulated voltages without any complicated trigonometric calculations adopted by conventional SVPWM. This simplified SVPWM also avoids choosing the vector sector required by conventional SVPWM. A two-level overmodulation scheme is integrated into the proposed two-level SVPMW to generate the output voltage that increases from a linear region to a six-step state with a smoothly linear transition characteristic and a simple overmodulation process without a lookup table and complicated nonlinear functions. The three-level SVPWM with a proportional-integral controller effectively balances the neutral point potential of the neutral point clamped converter. Results from the simulation in MATLAB/Simulink and the experiment based on a digital signal processor are provided to clearly demonstrate the validity and effectiveness of the proposed strategies.

• Journal of Power Electronics
• /
• 제19권2호
• /
• pp.560-568
• /
• 2019

This paper studies the inherent relationship between currents and zero-sequence components. Then a precise algorithm is proposed to calculate the injected zero-sequence component to control the DC-Link neutral-point voltage balance, which can result in a more efficient and flexible neutral point voltage balance with a desirable performance. In addition, it is shown that carried-based PWM with the calculated zero-sequence component scheme can be equivalent to space-vector pulse-width modulation (SVPWM). Based on the proposed method, the optimal zero-sequence component of the feasible modulation indices is analyzed. In addition, the unbalanced load limitation of the DC-Link neutral-point voltage balance control is also revealed. Simulation and experimental results are shown to verify the validity and practicality of the proposed algorithm.

• 한국컴퓨터정보학회논문지
• /
• 제12권2호
• /
• pp.131-139
• /
• 2007

본 논문에서는 다중해상도 알고리즘을 제안하여 탐색점과 복잡도를 블록정합 알고리즘과 비교하여 나타내었다. 또한 스피드 업을블록정합 알고리즘과 비교 하였다. 제안한 다중해상도 NTSS-3 Level 알고리즘을 비교대상인 TSS-3 Level 알고리즘과 NTSS 알고리즘에 비교하였다. 비교 결과 탐색점과 스피드업에서 제안한 NTSS-3 Level 알고리즘이 우수함을 나타내었다. 따라서 제안한 NTSS-3 Level 알고리즘이 비교 대상인 블록정합 알고리즘에 비해 탐색점에서 $2{\sim}3$배 우수한 성능을 나타내었고 복잡도 계산에서도 $2{\sim}4$배의 우수함을 나타내었다. 스피트업에서도 제안한 NTSS-3 Level 알고리즘이 2배 이상의 성능을 나타내었다. 따라서 제안한 다중해상도 NTSS-3 Level 알고리즘이 탐색점과 스피드 업 대비 PSNR 우수함을 나타내었다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.26-28
• /
• 2007

The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.

• Journal of Power Electronics
• /
• 제18권2호
• /
• pp.445-455
• /
• 2018

A novel algorithm is proposed to regulate the neutral point potential in neutral point clamped three-level inverters. Oscillations of the neutral point potential and an unbalanced dc-link voltage cause distortions of the output voltage. Large capacitors, which make the application costly and bulky, are needed to eliminate oscillations. Thus, the algorithm proposed in this paper utilizes the finite-control-set model predictive control and the multistage medium vector to solve these issues. The proposed strategy consists of a two-step prediction and a cost function to evaluate the selected multistage medium vector. Unlike the virtual vector method, the multistage medium vector is a mixture of the virtual vector and the original vector. In addition, its amplitude is variable. The neutral point current generated by it can be used to adjust the neutral point potential. When compared with the virtual vector method, the multistage medium vector contributes to decreasing the regulation time when the modulation index is high. The vectors are rearranged to cope with the variable switching frequency of the model predictive control. Simulation and experimental results verify the validity of the proposed strategy.

• 한국정밀공학회지
• /
• 제29권4호
• /
• pp.469-478
• /
• 2012

This study aims to discover the optimal pipe layout for a ship, which generally needs a lot of time, efforts and experiences. Genetic algorithm was utilized to search for the optimum. Here the optimum stands for the minimum pipe length between two given points. Genetic algorithm is applied to planar pipe layout problems to confirm plausible and efficiency. Sub-programs are written to find optimal layout for the problems. Obstacles are laid in between the starting point and the terminal point. Pipe is supposed to bypass those obstacles. Optimal layout between the specified two points can be found using the genetic algorithm. Each route was searched for three case models in two-dimensional plane. In consequence of this, it discovered the optimum route with the minimized distance in three case models. Through this study, it is possible to apply optimization of ship pipe route to an actual ship using genetic algorithm.

• 대한의용생체공학회:의공학회지
• /
• 제44권5호
• /
• pp.346-353
• /
• 2023

In this paper, we propose an innovative approach that leverages deep learning to find optimal reference points for achieving precise tooth segmentation in three-dimensional tooth point cloud data. A dataset consisting of 350 aligned maxillary and mandibular cloud data was used as input, and both end coordinates of individual teeth were used as correct answers. A two-dimensional image was created by projecting the rendered point cloud data along the Z-axis, where an image of individual teeth was created using an object detection algorithm. The proposed algorithm is designed by adding various modules to the Unet model that allow effective learning of a narrow range, and detects both end points of the tooth using the generated tooth image. In the evaluation using DSC, Euclid distance, and MAE as indicators, we achieved superior performance compared to other Unet-based models. In future research, we will develop an algorithm to find the reference point of the point cloud by back-projecting the reference point detected in the image in three dimensions, and based on this, we will develop an algorithm to divide the teeth individually in the point cloud through image processing techniques.