• Korean Journal of Remote Sensing
• /
• v.25 no.6
• /
• pp.507-515
• /
• 2009

Land surface temperature (LST) is a key environmental variable in a wide range of applications, such as weather, climate, hydrology, and ecology. However, LST is one of the most difficult surface variables to observe regularly due to the strong spatio-temporal variations. So, we have developed the LST retrieval algorithm from COMS (Communication, Ocean and Meteorological Satellite) data through the radiative transfer simulations under various atmospheric profiles (TIGR data), satellite zenith angle (SZA), spectral emissivity, and surface lapse rate conditions using MODTRAN 4. However, the LST retrieval algorithm has a tendency to overestimate and underestimate the LST for surface inversion and superadiabatic conditions, respectively. To minimize the overestimation and underestimation of LST, we also developed day/night LST algorithms separately based on the surface lapse rate (local time) and recalculated the final LST by using the weighted sum of day/night LST. The analysis results showed that the quality of weighted LST of day/night algorithms is greatly improved compared to that of LST estimated by original algorithm regardless of the surface lapse rate, spectral emissivity difference (${\Delta}{\varepsilon}$) SZA, and atmospheric conditions. In general, the improvements are greatest when the surface lapse rate and ${\Delta}{\varepsilon}$ are negatively large (strong inversion conditions and less vegetated surface).

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.489-496
• /
• 2015

In this paper, a new weighted prediction scheme is proposed to improve the coding efficiency for video scenes containing brightness variations. Conventional weighted prediction is applied by the reference picture and use only one weighted parameter set. Thus, it is only useful for GBV(Glabal Brightness Variation). In order to solve this problem, the proposed algorithm use three kind of schemes depending on situation. Experimental results show that maximum coding efficiency gain of the proposed method is up to 10.2% in luminance. Average computional time complexity is increased about 163% in encoder and about 101% in decoder.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5A
• /
• pp.417-425
• /
• 2005

KOINONIA is high-rate Wireless Personal Area Network (WPAN) technology, and is developed for multimedia traffic transmission in personal area. A KOINONIA piconet is a collection of one or more associated slaves under a single master. Efficient scheduling of a master for the traffic of slaves is essential to use channel effectively and to guarantee QoS of multimedia traffic. We propose a new scheduling algorithm to allocate channel time at desired intervals regardless of superframe length, and a Connection Admission Control(CAC) algorithm to regulate the number of traffics in a piconet. Our proposed algorithms have been shown to save channel time and to meet QoS requirements compared to the conventional weighted round-robin algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.3
• /
• pp.52-60
• /
• 2019

This paper presents a numerically robust algorithm to construct a Voronoi diagram of circles in the plane. The circles are allowed to have intersections among them, but one circle cannot fully contain another circle. The Voronoi diagram is a tessellation of the plane into Voronoi regions of given circles. Each circle has its Voronoi region which is defined by a set of points in the plane closer to the circle than any other circles. The distance from a point p to a circle $c_i$ of center $p_i$ and radius $r_i$ is ${\parallel}p-p_i{\parallel}-r_i$, which is the closest Euclidean distance from p to the circle boundary. The proposed algorithm first constructs the point Voronoi diagram of centers of given circles, then it enlarges each point to the circle and expands its Voronoi region accordingly. This region-expansion process is done by local modifications and after completing this process for the whole circles the desired circle Voronoi diagram can be obtained. The proposed algorithm is numerically robust and we provide with a few examples to show its robustness. The algorithm runs in $O(n^2)$ time in the worst case and O(n) time on average where n is the number of the circles. The experiment shows that the region-expansion algorithm is robust and runs fast with strong linear time behavior.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1092-1097
• /
• 2005

In this paper, design approach of PID controller with rejection function against external disturbance in motor control system is proposed using bacterial foraging based optimal algorithm. Up to the present time, PID Controller has been used to operate for AC motor drive because of its implementational advantages in practice and simple structure. However, it is not easy to achieve an optimal PID gain with no experience, since the gain of the PID controller has to be manually tuned by trial and error in the industrial system with disturbance. To design disturbance rejection tuning, disturbance rejection conditions based on $H_{\infty}$ are illustrated and the performance of response based on the bacterial foraging is computed for the designed PID controller as ITSE (Integral of time weighted squared error). Hence, parameters of PID controller are selected by bacterial foraging based optimal algorithm to obtain the required response

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.10a
• /
• pp.15-20
• /
• 2004

In this paper, design approach of PID controller with rejection function against external disturbance in motor control system is proposed using bacterial foraging based optimal algorithm. Up to the present time, PID Controller has been used to operate for AC motor drive because of its implementational advantages in practice and simple structure. However, it is not easy to achieve an optimal PID gain with no experience, since the gain of the PID controller has to be manually tuned by trial and error in the industrial system with disturbance. To design disturbance rejection tuning, disturbance rejection conditions based on H$\_$$\infty$/ are illustrated and the performance of response based on the bacterial foraging is computed for the designed PID controller as ITSE (Integral of time weighted squared error). Hence, parameters of PID controller are selected by bacterial foraging based optimal algorithm to obtain the required response.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.61-64
• /
• 1999

The turbo code appropriate to IMT-2000 is known to have a good performance whenever the size of frame increases. But it is not appropriate to a sort of video service to need real time because of decoding complexity and long delay time by the size of frame. Therefore this paper proposes decoding decision algorithm of short frame in which soft output is weighted according to iteration number in turbo decoder. Performance of the proposed algorithm is analysed in the AWGN channel when short length of frame is 100, 256, 640. As the result. it is appeared that the proposed decoding decision algorithm has improved in BER other than in the existing MAP decoding algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.4
• /
• pp.377-385
• /
• 2015

This paper proposes a novel forward vehicle tracking algorithm based on the WMIL(Weighted Multiple Instance Learning) equipped with a particle filter. In the proposed algorithm Haar-like features are used to train a vehicle object detector to be tracked and the location of the object are obtained from the recognition result. In order to combine both the WMIL to construct the vehicle detector and the particle filter, the proposed algorithm updates the object location by executing the propagation, observation, estimation, and selection processes involved in particle filter instead of finding the credence map in the search area for every frame. The proposed algorithm inevitably increases the computation time because of the particle filter, but the tracking accuracy was highly improved compared to Ababoost, MIL(Multiple Instance Learning) and MIL-based ones so that the position error was 4.5 pixels in average for the videos of national high-way, express high-way, tunnel and urban paved road scene.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.113-115
• /
• 2015

In this paper, we proposed an algorithm based on movement prediction using rate of change of the attribute information of nodes what is called WRC(Weighted Rate Control) in delay tolerant networks(DTNs). Existing DTN routing algorithms based on movement prediction communicate by selecting relay nodes increasing connectivity with destination node. Thus, because the mobile nodes are in flux, the prediction algorithms that do not reflect the newest attribute information of node decrease reliability. In this paper, proposed algorithm approximate speed and direction of attribute information of node and analysis rate of change of attribute information of node. Then, it predict movement path of node using proposed weight. As the result, proposed algorithm show that network overhead and transmission delay time decreased by predicting movement path of node.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3B
• /
• pp.171-182
• /
• 2003

In this paper, we propose an efficient and simple fair queueing algorithm, called Minimum Possible Virtual Start Time Fair Queueing (MPSFQ), which has O(1) complexity for the virtual time computation while it has good delay and fairness properties. The key idea of MPSFQ is that it has an easy system virtual time recalibration method while it follows a rate-proportional property. MPSFQ algorithm recalibrates system virtual time to the minimum possible virtual start time of all backlogged sessions. We will show our algorithm has good delay and fairness properties by analysis.