• Journal of Information Processing Systems
• /
• v.5 no.2
• /
• pp.105-116
• /
• 2009

To solve the general problems surrounding the application of genetic algorithms in stereo matching, two measures are proposed. Firstly, the strategy of simplified population-based incremental learning (PBIL) is adopted to reduce the problems with memory consumption and search inefficiency, and a scheme for controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities. In addition, an alternative version of the proposed algorithm, without the use of a probability vector, is also presented for simpler set-ups. Secondly, programmable graphics-hardware (GPU) consists of multiple multi-processors and has a powerful parallelism which can perform operations in parallel at low cost. Therefore, in order to decrease the running time further, a model of the proposed algorithm, which can be run on programmable graphics-hardware (GPU), is presented for the first time. The algorithms are implemented on the CPU as well as on the GPU and are evaluated by experiments. The experimental results show that the proposed algorithm offers better performance than traditional BMA methods with a deliberate relaxation and its modified version in terms of both running speed and stability. The comparison of computation times for the algorithm both on the GPU and the CPU shows that the former has more speed-up than the latter, the bigger the image size is.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.6
• /
• pp.545-554
• /
• 2019

This research aims to provide a building area extraction approach over the areas where data acquisition is impossible through field surveying, aerial photography and lidar scanning. Hence, high-resolution satellite images, which have high accessibility over the earth, are utilized for the automated building extraction in this study. 3D point clouds or DSM (Digital Surface Models), derived from the stereo image matching process, provides low quality of building area extraction due to their high level of noises and holes. In this regards, this research proposes a hybrid building area extraction approach which utilizes 3D point clouds (from image matching), and color and linear information (from imagery). First of all, ground and non-ground points are separated from 3D point clouds; then, the initial building hypothesis is extracted from the non-ground points. Secondly, color based building hypothesis is produced by considering the overlapping between the initial building hypothesis and the color segmentation result. Afterwards, line detection and space partitioning results are utilized to acquire the final building areas. The proposed approach shows 98.44% of correctness, 95.05% of completeness, and 1.05m of positional accuracy. Moreover, we see the possibility that the irregular shapes of building areas can be extracted through the proposed approach.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.232-239
• /
• 2009

Emerging social networking services provide a new paradigm for human-to-human communication. However, these services are centralized and managed by single service provider. In this paper, we propose MicroPost, a decentralized event notification service architecture for social applications based on publish/subscribe model. In our design space, event brokers are structured as an overlay network which provides the substrate of distributed peer-to-peer lookup service for storing and retrieving subscriptions with hashed keys. Event clients interact with event brokers to publish or subscribe social messages over the wide-area network. Using XML standards, we present an efficient algorithm to forward events for rendezvous-based matching in this paper. In our design space, the cost of routing is O(${\omega}log_kN$), where N is the number of event brokers, ${\omega}$ is the number of meta-data obtained from event messages, and k is a constant, which is selected by our design, to divide the identifier space and to conquer the lookup of given key. Consequently, what we achieved is an asynchronous social messaging service architecture which is decentralized, efficient, scalable, and flexible.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.19-25
• /
• 2016

This paper is to recognize and play tab chords from guitar musical sheets. The musical chord area of an input image is segmented by changing the image in saturation and applying the Grabcut algorithm. Based on a template matching, our approach detects tab starting sections on a segmented musical area. The virtual block method is introduced to search blanks over chord lines and extract tab fret segments, which doesn't cause the computation loss to remove tab lines. In the experimental tests, the prototype based classification outperforms Bayesian method and the nearest neighbor rule with the whole set of training data and its performance is similar to that of the support vector machine. The experimental result shows that the prediction rate is about 99.0% and the number of selected prototypes is below 3.0%.

• Korean Journal of Remote Sensing
• /
• v.38 no.6_1
• /
• pp.1257-1271
• /
• 2022

Recently, many Earth observation optical satellites have been developed, as their demands were increasing. Therefore, a rapid preprocessing of satellites became one of the most important problem for an active utilization of satellite images. Satellite image matching is a technique in which two images are transformed and represented in one specific coordinate system. This technique is used for aligning different bands or correcting of relative positions error between two satellite images. In this paper, we propose an automatic image matching method among satellite images with different ground sampling distances (GSDs). Our method is based on improved feature matching and robust estimation of transformation between satellite images. The proposed method consists of five processes: calculation of overlapping area, improved feature detection, feature matching, robust estimation of transformation, and image resampling. For feature detection, we extract overlapping areas and resample them to equalize their GSDs. For feature matching, we used Oriented FAST and rotated BRIEF (ORB) to improve matching performance. We performed image registration experiments with images KOMPSAT-3A and RapidEye. The performance verification of the proposed method was checked in qualitative and quantitative methods. The reprojection errors of image matching were in the range of 1.277 to 1.608 pixels accuracy with respect to the GSD of RapidEye images. Finally, we confirmed the possibility of satellite image matching with heterogeneous GSDs through the proposed method.

• The KIPS Transactions:PartB
• /
• v.18B no.5
• /
• pp.265-270
• /
• 2011

In this paper, we propose a method for intensity correction using binarization-based region segmentation in 3D stereoscopic images. In the proposed method, 3D stereoscopic right image is segmented using binarizarion. Small regions in the segmented image are eliminated. For each region in right image, a corresponding region in left image is decided through region matching using correlation coefficient. When region-based matching, in order to prevent overlap between regions, we remove a portion of the area closed to the region boundary using morphological filter. The intensity correction in left and right image can be performed through histogram specification between the corresponding regions. Simulation results show the proposed method has the smallest matching error than the conventional method when we generate the right image from the left image using block based motion compensation.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.6
• /
• pp.413-422
• /
• 2013

In this paper, we propose a novel method for real-time lane detection that is robust for inclined roads and not require a camera parameter, the Inverse Perspective Transform of the image, and the proposed lane filter. After finding the vanishing point from the start frame of the image and storing the region surrounding the vanishing point as the Template Area(TA), our method predict the lanes by scanning toward the lower part from the vanishing point of the image and obtain the image removed the perspective effect using the Inverse Perspective Transform coefficients extracted based on the predicted lanes. To robustly determine lanes on inclined roads, the region surrounding the vanishing point is set up as the template area (TA), and, by recalculating the vanishing point by tracing the area similar to the TA (SA) in the input image through template matching, it responds to the changes on the road conditions. The proposed method for a more robust lane detection method for inclined roads is a lane detection method by applying a lane detection filter on an image removed of the perspective effect. Through this method, the processing region is reduced and the processing procedure is simplified to produce a satisfactory lane detection result of about 40 frames per second.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.766-771
• /
• 2002

Automatic change detection based on the vector-to-raster comparison is hard especially in high-resolution image. This paper proposes a method to designate roads in high-resolution image in sequential manner using the information from vector map in which Hough transform is used for reliability. By its linearity, the road of urban areas in a vector map can be easily parameterized. Following some pre-processing to remove undesirable objects, we obtain the edge map of raster image. Then the edge map is transformed to a parameter space to find the selected road from vector map. The comparison is done in the parameter space to find the best matching. The set of parameters of a road from vector map is treated as the constraints to do matching. After designating the road, we may overlay it on the raster image for precise monitoring. The results can be used for detection of changes in road object in a semi-automatic fashion.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.10
• /
• pp.1829-1834
• /
• 2006

In this raper in order to recover sharp object boundaries we propose a new efficient stereo matching algorithm in which window size is varied to the distance from the boundaries of object. To this end, the processing region is divided into small subregions with a same area and the disparities of the center pixels in the subregions are calculated using a area-based algorithm with multiple windows. From the this disparity map we can find the edges of the contracted objects. The disparities of original image are obtained using the gradient constraint that means the disparity of the center pixel is similar to the ones of the remaining pixels in the subregion. from the experimental results it is found that the proposed algorithm is very good for recovering sharp object boundaries compared to the similar different algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.6
• /
• pp.726-731
• /
• 2004

This paper proposes a pulse-width-modulation (PWM) controller design technique using intelligent digital redesign. Intelligent digital redesign is to convert a well-designed analog fuzzy-model-based controller into an equivalent pulse-amplitude-modulation (PAM) digital controller maintaining the original analog control system in the sense of state-matching. In similar line of conversion concept, the redesigned PAM intelligent digital controller is converted into a PWM controller using the equivalent area principle. To convincingly visualize the proposed technique, an computer simulation example-attitude control of nonlinear artificial satellite system is included.