• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.295-299
• /
• 2002

This paper presents an image contrast enhancement technique for improving low contrast images. We applied fuzzy logic to develop an image contrast enhancement technique in the viewpoint of considering that the low pictorial information of a low contrast image is due to the vaguness or fuzziness of the multivalued levels of brightness rather than randomness. The fuzzy image contrast enhancement technique consists of three main stages, namely, image fuzzification, modification of membership values, and image defuzzification. In the stage of image fuzzification, we need to select a crossover point. To select the crossover point automatically the K-means algorithm is used. The problem of crossover point selection can be considered as the two-category, object and background, classification problem. The proposed method is applied to an experimental image with 256 gray levels and the result of the proposed method is compared with that of the histogram equalization technique. We used the index of fuzziness as a measure of image quality. The result shows that the proposed method is better than the histogram equalization technique.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.2
• /
• pp.111-119
• /
• 2013

It is essential and fundamental to extract boundary information of target object via massive three-dimensional point data acquired from laser scanner. Especially extracting boundary information of manmade features such as buildings is quite important because building is one of the major components consisting complex contemporary urban area, and has artificially defined shape. In this research, extended ${\chi}$-algorithm using geometry information of point data was proposed to extract boundary information of building from three-dimensional point data consisting building. The proposed algorithm begins with composing Delaunay triangulation process for given points and removes edges satisfying specific conditions process. Additionally, to make whole boundary extraction process efficient, we used Sweep-hull algorithm for constructing Delaunay triangulation. To verify the performance of the proposed extended ${\chi}$-algorithm, we compared the proposed algorithm with Encasing Polygon Generating Algorithm and ${\alpha}$-Shape Algorithm, which had been researched in the area of feature extraction. Further, the extracted boundary information from the proposed algorithm was analysed against manually digitized building boundary in order to test accuracy of the result of extracting boundary. The experimental results showed that extended ${\chi}$-algorithm proposed in this research proved to improve the speed of extracting boundary information compared to the existing algorithm with a higher accuracy for detecting boundary information.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.648-649
• /
• 2011

This Paper presents an efficient approach for solving the economic dispatch (ED) problems with valve-point effects using an combination of particle swarm optimization and harmony search. To reduce a premature convergence effect of PSO algorithm, We proposed PSO-HS algorithm considering evolutionary using harmony search algorithm. To prove the ability of the PSO-HS in solving nonlinear optimization problems, ED problems with non-convex solution spaces are solved with three different approach(PSO, HS, combination of PSO and HS)

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.19 no.4
• /
• pp.365-372
• /
• 2001

The general rule of boundary delimitation is a the principle of equidistant. The principle of equidistant is a method that determine boundary delimitation from fixed distant of baseline or basepoint. In this paper, study Two-Point Algorithm and Three-Point Algorithm that are widely used. and developed the Boundary Delimitation Program to verify the result and error. This program is specially useful for maritime boundary delimitation problem because there is no artificial and natural object in sea to determine boundary. As a result The mid-points computed on Ellipsoid have small error rather than mid-points on plane or sphere without any distortion by map projection. Through developing boundary delimitation program, can eliminate the various manipulation error using paper map, and quickly cope with maritime boundary delimitation negotiation. Also, verify that the error of basepoint in baseline is propagate the mid-point in mid-line, and determine suitable reference plane.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.210-213
• /
• 2000

In the closed range space, the parallel two CCD cameras are used to acquire a pair of stereo image. The acquired stereo image are computed with Wavelet Transform repeatedly and including the low frequency component, the image size of those are reduced. It is the pyramid structure. The optimum matching point is searched to the pixel. Then appling the optimum matching point to DLT, it extract the three - dimensional surface coordinate from a stereo image. The direct linear transformation(DLT) method is used to calibrate the stereo camera compute the coordinate on a three dimensional space. To find the parameters for the DLT method, 30 control points which marked on the cylinder type object are used. To improve the matching algorithm, the paper select the pyramid structure for Wavelet Transform. The acquired disparity information is used to represent the really three-dimensional surface coordinate.

• Journal of Power Electronics
• /
• v.18 no.5
• /
• pp.1448-1457
• /
• 2018

Many researchers devote themselves to develop model-predictive direct power control (MPDPC) so as to accelerate the response speed of the grid-connected systems, but they are troubled its large computing amount. On the basis of MPDPC, dual MPDPC (DMPDPC) is presented in this paper. The proposed algorithm divides the conventional MPDPC into two steps. In the first step, the optimal sector is obtained, which contains the optimal switching state in three-level converters. In the second step, the optimal switching state in the selected sector is searched to trace reference active and reactive power and balance neutral point voltage. Simulation and experiment results show that the proposed algorithm not only decreases the computational amount remarkably but also improves the steady-state performance. The dynamic response of the DMPDPC is as fast as that of the MPDPC.

• Nuclear Engineering and Technology
• /
• v.39 no.4
• /
• pp.313-326
• /
• 2007

In this paper, an algorithm to reconstruct two orthogonal images into a three-dimensional image is developed in order to measure the bubble size and volume in a two-phase boiling flow. The central-active contour model originally proposed by P. $Szczypi\'{n}ski$ and P. Strumillo is modified to reduce the dependence on the initial reference point and to increase the contour stability. The modified model is then applied to the algorithm to extract the object boundary. This improved central contour model could be applied to obscure objects using a variable threshold value. The extracted boundaries from each image are merged into a three-dimensional image through the developed algorithm. It is shown that the object reconstructed using the developed algorithm is very similar or identical to the real object. Various values such as volume and surface area are calculated for the reconstructed images and the developed algorithm is qualitatively verified using real images from rubber clay experiments and quantitatively verified by simulation using imaginary images. Finally, the developed algorithm is applied to measure the size and volume of vapor bubbles condensing in a subcooled boiling flow.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2004.09a
• /
• pp.97-100
• /
• 2004

Multivariate Newton Raphson method is developed to perform the particle tracking in the three dimensional area using four objective functions. In this method, three variables are solved to compute target point and actual and real tracking time. The simulated pathlines in various types of three dimensional elements are well matched with exact pathline.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.169-172
• /
• 2002

This paper is concerned with walking trajectory generation by applying the genetic algorithm. The walking trajectory is generated though three via-points and genetic algorithm is employed to find velocity and acceleration at each via-point. Also genetic algorithm is applied for balancing joint trajectory. Fitness function is used for minimizing the trajectory. As a result, new algorithm generated the smooth trajectory. The proposed algorithm is verified by the experiment of biped walking robot developed in our Control laboratory, and we compared the result with the previous walking algorithm. It showed that the new proposed algorithm generated the better walking trajectory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5344-5356
• /
• 2018

Nowadays with the help of Location-Based Social Networks (LBSNs), users of Point-of-Interest (POI) recommendation service in LBSNs are able to publish their geo-tagged information and physical locations in the form of sign-ups and share their experiences with friends on POI, which can help users to explore new areas and discover new points-of-interest, and promote advertisers to push mobile ads to target users. POI recommendation service in LBSNs is attracting more and more attention from all over the world. Due to the sparsity of users' activity history data set and the aggregation characteristics of sign-in area, conventional recommendation algorithms usually suffer from low accuracy. To address this problem, this paper proposes a new recommendation algorithm based on a novel Preference-Content-Region Model (PCRM). In this new algorithm, three kinds of information, that is, user's preferences, content of the Point-of-Interest and region of the user's activity are considered, helping users obtain ideal recommendation service everywhere. We demonstrate that our algorithm is more effective than existing algorithms through extensive experiments based on an open Eventbrite data set.