• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.6
• /
• pp.105-114
• /
• 2011

The snake algorithm is widely adopted to track objects by extracting the active contour of the object from background. However, it fails to track the target converging to the background if there exists background whose gradient is greater than that of the pixels on the contour. Also, the contour may shrink when the target moves fast and the snake algorithm misses the boundary of the object in its searching window. To alleviate these problems, we propose an improved algorithm that can track object contour more robustly. Firstly, we propose two external energy functions, the edge energy and the contrast energy. One is designed to give more weight to the gradient on the boundary and the other to reflect the contrast difference between the object and background. Secondly, by computing the motion vector of the contour from the difference of the two consecutive frames, we can move the snake pointers of the previous frame near the region where the object boundary is probable at the current frame. Computer experiments show that the proposed method is more robust to the complicated background than the previously known methods and can track the object with fast movement.

• The KIPS Transactions:PartB
• /
• v.13B no.5 s.108
• /
• pp.499-506
• /
• 2006

This Paper describes a fast and stable camera pose estimation method for real-time augmented reality systems. From the feature tracking results of a marker on a single frame, we estimate the camera rotation matrix and the translation vector. For the camera pose estimation, we use the shape factorization method based on the scaled orthographic Projection model. In the scaled orthographic factorization method, all feature points of an object are assumed roughly at the same distance from the camera, which means the selected reference point and the object shape affect the accuracy of the estimation. This paper proposes a flexible and stable selection method for the reference point. Based on the proposed method, we implemented a video augmentation system that inserts virtual 3D objects into the input video frames. Experimental results showed that the proposed camera pose estimation method is fast and robust relative to the previous methods and it is applicable to various augmented reality applications.

• Korean Journal of Construction Engineering and Management
• /
• v.10 no.3
• /
• pp.102-110
• /
• 2009

Although several research efforts have been directed to fast-tracking to reduce the total delivery time, few researches have been studied on concurrent engineering in construction projects. The focus of fast-tracking is primarily on overlapping independent activity pairs. In comparison, the focus of concurrent engineering is on overlapping dependent activity pairs. Dependent activities are much harder to overlap successfully. This paper presents a simulation-based Concurrent Engineering methodology to optimize the overall duration of a set of design activities in a project by modelling key factors that determine the duration of individual activities and overlap between dependent activities. This methodology involves determining how much to overlap activities, how to decide which activities to overlap and the corresponding cost and time tradeoffs using a discrete event model solution. This simulation model, therefore, can be used as a reference on decision-making to define optimum point between time and cost.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.24 no.1
• /
• pp.1-8
• /
• 2019

In this study, a maximum power point tracking (MPPT) algorithm based on the perturb and observe (P&O) method with variable step size is proposed to improve the dynamic response characteristic of MPPT, using the existing P&O method. The proposed algorithm, which we verified by simulation and experiment, can track the maximum power point (MPP) through duty control and consisted of three operation modes, namely, constant voltage mode, fast mode, and variable step mode. When the insolation is constant, the voltage variation of the operating point at the MPP is reduced through the step size reduction of the duty in the variable step mode. Consequently, the vibration of the operating point is reduced, and the power generation efficiency is increased. When the insolation changes, the duty and the photovoltaic (PV) voltage are kept constant through the constant voltage mode. The operating point then rapidly tracks the new MPP through the fast-mode operation at the end of the insolation change. When the MPP is reached, the operation is changed to the variable step mode to reduce the duty step size and track the MPP. The validity of the proposed algorithm is verified by simulation and experiment of a PV system composed of a PV panel and a boost converter.

• Journal of Integrative Natural Science
• /
• v.15 no.3
• /
• pp.99-110
• /
• 2022

Solar photovoltaic (PV) system shows a non-linear current (I) -voltage (V) characteristics, which depends on the surrounding environment factors, such as irradiance, temperature, and the wind. Solar PV system, with current (I) - voltage (V) and power (P) - Voltage (V) characteristics, specifies a unique operating point at where the possible maximum power point (MPP) is delivered. At the MPP, the PV array operates at maximum power efficiency. In order to continuously harvest maximum power at any point of time from solar PV modules, a good MPPT algorithms need to be employed. Currently, due to its simplicity and easy implementation, Perturb and Observe (P&O) algorithms are the most commonly used MPPT control method in the PV systems but it has a drawback at suddenly varying environment situations, due to constant step size. In this paper, to overcome the difficulties of the fast changing environment and suddenly changing the power of PV array due to constant step size in the P&O algorithm, least mean Square (LMS) methods is proposed together with P&O MPPT algorithm which is superior to traditional P&O MPPT. PV output power is predicted using LMS method to improve the tracking speed and deduce the possibility of misjudgment of increasing and decreasing the PV output. Simulation results shows that the proposed MPPT technique can track the MPP accurately as well as its dynamic response is very fast in response to the change of environmental parameters in comparison with the conventional P&O MPPT algorithm, and improves system performance.

• Journal of Broadcast Engineering
• /
• v.18 no.3
• /
• pp.349-361
• /
• 2013

This paper proposes a fast face tracking method with only depth information. It is basically a template matching method, but it uses a early termination scheme and a sparse search scheme to reduce the execution time to solve the problem of a template matching method, large execution time. Also a refinement process with the neighboring pixels is incorporated to alleviate the tracking error. The depth change of the face being tracked is compensated by predicting the depth of the face and resizing the template. Also the search area is adjusted on the basis of the resized template. With home-made test sequences, the parameters to be used in face tracking are determined empirically. Then the proposed algorithm and the extracted parameters are applied to the other home-made test sequences and a MPEG multi-view test sequence. The experimental results showed that the average tracking error and the execution time for the home-made sequences by Kinect ($640{\times}480$) were about 3% and 2.45ms, while the MPEG test sequence ($1024{\times}768$) showed about 1% of tracking error and 7.46ms of execution time.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.539-548
• /
• 2001

In this paper, we propose that fast tracking algorithm for moving object is separated from background, using partial boundary line information. After detecting boundary line from input image, we track moving object by using the algorithm which takes boundary line information as feature of moving object. we extract moving vector on the imput image which has environmental variation, using high-performance BMA, and we extract moving object on the basis of moving vector. Next, we extract boundary line on the moving object as an initial feature-vector generating step for the moving object. Among those boundary lines, we consider a part of the boundary line in every direction as feature vector. And then, as a step for the moving object, we extract moving vector from feature vector generated under the information of the boundary line of the moving object on the previous frame, and we perform tracking moving object from the current frame. As a result, we show that the proposed algorithm using feature vector generated by each directional boundary line is simple tracking operation cost compared with the previous active contour tracking algorithm that changes processing time by boundary line size of moving object. The simulation for proposed algorithm shows that BMA operation is reduced about 39% in real image and tracking error is less than 2 pixel when the size of feature vector is [$10{\times}5$] using the information of each direction boundary line. Also the proposed algorithm just needs 200 times of search operation bout processing cost is varies by the size of boundary line on the previous algorithm.

• Journal of Broadcast Engineering
• /
• v.19 no.3
• /
• pp.329-341
• /
• 2014

Kernel-based mean-shift object tracking has gained more interests nowadays, with the aid of its feasibility of reliable real-time implementation of object tracking. This algorithm calculates the best mean-shift vector based on the color histogram similarity between target model and target candidate models, where the color histograms are usually produced after uniform color-space quantization for the implementation of real-time tracker. However, when the image of target model has a reduced contrast, such uniform quantization produces the histogram model having large values only for a few histogram bins, resulting in a reduced accuracy of similarity comparison. To solve this problem, a non-uniform quantization algorithm has been proposed, but it is hard to apply to real-time tracking applications due to its high complexity. Therefore, this paper proposes a fast non-uniform color-space quantization method using the histogram equalization, providing an adjusted histogram distribution such that the bins of target model histogram have as many meaningful values as possible. Using the proposed method, the number of bins involved in similarity comparison has been increased, resulting in an enhanced accuracy of the proposed mean-shift tracker. Simulations with various test videos demonstrate the proposed algorithm provides similar or better tracking results to the previous non-uniform quantization scheme with significantly reduced computation complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.271-280
• /
• 2014

In wireless sensor networks, there have been two methods for sensing continuously moving object tracking: user-query based method and periodic report based method. Although the former method requires overhead for user query rather than the latter method, the former one is known as an energy-efficient method without transferring unnecessary information. In the former method, a virtual tree, consisting of sensor nodes, is exploited for the user querying and sensor reporting. The tree stores the information about mobile objects; the stored information is triggered to report by the user query. However, in case of fast moving object, the tracking accuracy reduces due to the time delay of end-to-end repeated query. To solve the problem, we propose a query relaying method reducing the time delay for mobile object tracking. In the proposed method, the nodes in the tree relay the query to the adjacent node according to the movement of mobile object tracking. Relaying the query message reduces the end-to-end querying time delay. Simulation results show that our method is superior to the existing ones in terms of tracking accuracy.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1996.05a
• /
• pp.185-190
• /
• 1996

RFSP is a computer program to do fuel management calculations for CANDU reactors. Its main function is to calculate neutron flux and power distributions using two-energy-group, three dimensional neutron diffusion theory. However, up to now the treatment has not been true two-group but actually "one-and-half groups". In other words, the previous (1.5-group) version of RFSP lumps the fast fission term into the thermal fission term. This is based on the POWDERPUFS-V Westcott convention. Also, there is no up-scattering term or bundle power over cell flux (H1 factor) for the fast group. While POWDERPUFS-V provides only 1.5 group properties, true two-group cross sections for the design and analysis of CAUDU reactors can be obtained from WIMS-AECL. To treat the full two-group properties, the previous RFSP version was modified by adding the fast fission, up-scatter terms, and H1 factor. This two-group version of RFSP is a convenient tool to accept lattice properties from any advanced lattice code (e.g. WIMS-AECL DRAGON, HELIOS...) and to apply to advanced fuel cycles. In this study, the modification to implement the true two-group treatment was performed only in the subroutines of the ＊SIMULATE module of RFSP. This module is the appropriate one to modify first, since it is used for the tracking of reactor operating histories. The modified two-group RFSP was evaluated with true two-group cross sections from WIMS-AECL. Some tests were performed to verify the modified two-group RFSP and to evaluate the effects of fast fission and up-scatter for three core conditions and four cases corresponding to each condition. The comparisons show that the two-group results are quite reasonable and serve as a verification of the modifications made to RFSP. To assess the long-term impact of the full 2-group treatment, it is necessary to simulate a long period (several months) of reactor history. It will also be necessary to implement the full two-group treatment of reactivity devices and assess the reactivity-device worths.ce worths.