• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.6
• /
• pp.667-675
• /
• 2011

In this paper, we propose an automatic image-to-image registration between high resolution multi-sensor images. To do this, TerraSAR-X image was shifted according to the initial translation differences of the x and y directions between images estimated using Mutual Information method. After that, the Canny edge operator was applied to both images to extract linear features. These features were used to design a cost function that finds matching points based on the similarities of their locations and gradient orientations. For extracting large number of evenly distributed matching points, only one point within each regular grid constructed throughout the image was extracted to the final matching point pair. The model, which combined the piecewise linear function with the global affine transformation, was applied to increase the accuracy of the geometric correction, and the proposed method showed RMSE lower than 5m in all study sites.

• Korean Journal of Remote Sensing
• /
• v.27 no.2
• /
• pp.141-150
• /
• 2011

Precise image-to-image registration is required to process multi-sensor data together. The purpose of this paper is to develop an algorithm that register between high-resolution optical and SAR images using linear features. As a pre-processing step, initial alignment was fulfilled using manually selected tie points to remove any dislocations caused by scale difference, rotation, and translation of images. Canny edge operator was applied to both images to extract linear features. These features were used to design a cost function that finds matching points based on their similarity. Outliers having larger geometric differences than general matching points were eliminated. The remaining points were used to construct a new transformation model, which was combined the piecewise linear function with the global affine transformation, and applied to increase the accuracy of geometric correction.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.9
• /
• pp.53-62
• /
• 1998

In this paper, a genetic algorithm-based optimization technique for stereo matching is proposed. Stereo matching is an essential process to recover three-dimensional structure of objects. The proposed two-dimensional chromosomes consist fo disparity values. The cost function of each chromosome is composed of the intensity-difference between two images and smoothness of disparity. The crossover and mutation operators in the two-dimensional chromosomes are described. The operations are affected by the disparities of neighbor pixels. The knowledge-augmented operators are shown to result in rapid convergence and stable result. The genetic algorithm for stereo matching is tested on synthetic and natural images. Experimental results of various images show that the proposed algorithm has good performance even if the images have too dense or sparse feature points. severe noise, and repeating pattern.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1872-1879
• /
• 2001

As multiview video applications become more popular, correspondence problem for stereo image matching plays an important role in expanding view points. Thus, we propose an efficient dense disparity estimation algorithm considering features of each image pair of multiview image sets. Main concepts of the proposed algorithm are based on the region-dividing-bidirectional-pixel-matching method. This algorithm makes matching process efficient and keeps the reliability of the estimated disparities. Other improvement have obtained by proposed cost function, matching window expanding technique, disparity regularization, and disparity assignment in ambiguous region. These techniques make disparities more stable by removing false disparities and ambiguous regions. The estimated disparities are used to synthesize intermediate views of multiview images. Computer simulation demonstrates the excellence of the proposed algorithm in both subjective and objective evaluations. In addition, processing time is reduced as well.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.5
• /
• pp.53-63
• /
• 2008

In this paper, we propose the regional travel time measurement algorithm using the sequence pattern matching to the type of vehicles between the origin of the region and the end of the region, that could be able to overcome the limit of conventional method such as Probe Car Method or AVI Method by License Plate Recognition. This algorithm recognizes the vehicles as a sequence group with a definite length, and measures the regional travel time by searching the sequence of the origin which is the most highly similar to the sequence of the end. According to the assumption of similarity cost function, there are proposed three types of algorithm, and it will be able to estimate the average travel time that is the most adequate to the information providing period by eliminating the abnormal value caused by inflow and outflow of vehicles. In the result of computer simulation by the length of region, the number of passing cars, the length of sequence, and the average maximum error rate are measured within 3.46%, which means that this algorithm is verified for its superior performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1070-1075
• /
• 2009

In this paper, we propose new depth estimation and intermediate view synthesis algorithms for three-dimensional video generation. In order to improve temporal consistency of the depth map sequence, we add a temporal weighting function to the conventional matching function when we compute the matching cost for estimating the depth information. In addition, we propose a boundary noise removal method in the view synthesis operation. after finding boundary noise areas using the depth map, we replace them with corresponding texture information from the other reference image. Experimental results showed that the proposed algorithm improved temporal consistency of the depth sequence and reduced flickering artifacts in the virtual view. It also improved visual quality of the synthesized virtual views by removing the boundary noise.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.16 no.2
• /
• pp.177-185
• /
• 1998

There is an increasing request for 3D data and outlines on building for urban planning and design. This paper describes an approach to extract building using Digital Surface Models(DSM) and stereo pairs of aerial images. DSM contain informations not only about the topographic surface like Digital Elevation Models(DEM), but also about buildings and other objects higher than the surrounding topographic surface, e.g. tees. We therefore describe our approach consisting of two step procedures. The first step of the approach is to generate DSM by stereo matching using Maximum Likelihood Estimation and Dynamic Programming. The proposed stereo matching is using the cost function for finding the disparity between the left and right image, and the Dynamic Programming for solving the stereo matching problem. The second step is to detect building outlines using the DSM and the edge informations extracted from a digital aerial image by Sobel Operator. The overlay analysis of the DSM and the edge information by Sobel Operator was efficient to detect building outlines.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.1199-1205
• /
• 1993

It has been well known that the assumption of full state availability is one of the most important restrictions to the practical realization of VSCS. And several attempts to alleviate the assumption had been made. However, it is not easy to find a positive scheme among them. Recently, an output feedback variable structure control system(OFVSCS) was proposed and the effectiveness of the scheme was validated for the disturbance free systems. The purpose of this study is to propose a robust OFVSCS that have the robust properties against process parameter variations and external distrubances by extending the basic OFVSCS and to evaluate its control performances through power system stabilizer design example. The ROFVSCS is composed of dynamic switching function and output feedback switching control inputs that are constructed by the use of the unknown vector modeling technique. With the proposed scheme, existence of sliding mode is guaranteed and any nonzero bias can be suppressed in the face of disturbances and process parameter variations as far as well-known matching condition is satisfied. Due to the fact that the ROFVSCS is driven by small number of measured informations, the practical application of VSCS for the systems with unmeasurable states and for high order systems that conventional schemes cannot be applied, is possible with the proposed scheme. It is noticeable that the implementation cost of VSCS can be considerably reduced without sacrifice of control performances by adopting ROFVSCS since there is no need measure the states with high measurement cost.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.04a
• /
• pp.275-278
• /
• 2004

The geo-referencing of satellite imagery is a key task in remote sensing. GCPs are points the position of which is known both in the image and in the supporting maps. Mapping function makes the determination of map coordinates of all image pixels possible. Generally manual operations are done to identify image points corresponding to the points on a digital topographic map. In order to accurately measure ground coordinates of GCPs, differential global positioning system (DGPS) surveying are used. To acquire the sufficient number of well distributed GCPs is one of the most time-consuming and cost-consuming tasks. This paper describes the procedure of automatically extracting GCOs using GCP database. GCP image chips and image matching technique are used for automatic extraction of GCPs. We developed image processing tool for making image chip GCPs and Web Server for management of GCPs.

• Journal of the Society of Naval Architects of Korea
• /
• v.55 no.1
• /
• pp.66-74
• /
• 2018

In order to evaluate the precision degree of the blocks on the dock, the shipyards recently started to use the point cloud approaches using the 3D scanners. However, they hesitate to use it due to the limited time, cost, and elaborative effects for the post-works. Although it is somewhat traditional instead, they have still used the electro-optical wave devices which have a characteristic of having less dense point set (usually 1 point per meter) around the contact section of two blocks. This paper tried to expand the usage of point sets. Our approach can estimate the rework time to weld between the Pre-Erected(PE) Block and Erected(ER) block as well as the precision of block construction. In detail, two algorithms were applied to increase the efficiency of estimation process. The first one is K-mean clustering algorithm which is used to separate only the related contact point set from others not related with welding sections. The second one is the Concave hull algorithm which also separates the inner point of the contact section used for the delayed outfitting and stiffeners section, and constructs the concave outline of contact section as the primary objects to estimate the rework time of welding. The main purpose of this paper is that the rework cost for welding is able to be obtained easily and precisely with the defective point set. The point set on the blocks' outline are challenging to get the approximated mathematical curves, owing to the lots of orthogonal parts and lack of number of point. To solve this problems we compared the Radial based function-Multi-Layer(RBF-ML) and Akima interpolation method. Collecting the proposed methods, the paper suggested the noble point matching method for minimizing the rework time of block-welding on the dock, differently the previous approach which had paid the attention of only the degree of accuracy.