• Journal of Korean Society for Geospatial Information Science
• /
• v.22 no.2
• /
• pp.17-24
• /
• 2014

This paper proposes an automatic extraction method of control point based on Geospatial Web Service. The proposed method consists of 3 steps. 1) The first step is to acquires reference data using the Geospatial Web Service. 2) The second step is to finds candidate control points in reference data and the target image by SURF algorithm. 3) By using RANSAC algorithm, the final step is to filters the correct matching points of candidate control points as final control points. By using the Geospatial Web Service, the proposed method increases operation convenience, and has the more extensible because of following the OGC Standard. The proposed method has been tested for SPOT-1, SPOT-5, IKONOS satellite images and has been used military standard data as reference data. The proposed method yielded a uniform accuracy under RMSE 5 pixel. The experimental results proved the capabilities of continuous improvement in accuracy depending on the resolution of target image, and showed the full potential of the proposed method for military purpose.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.5
• /
• pp.708-716
• /
• 2017

We deal with the target selection in seeker-detection image through network, using the detection information from aerial vehicle and the target information from surveillance and reconnaissance system. Especially, we constrain the sea battle environment, where it is difficult to perform scene-matching rather than land. In this paper, we suggest the target selection algorithm based on the confidence estimation with respect to distance and size. In detail, we propose the generation method of reference point for distance evaluation, and we investigate the effect of pixel margin and target course for size evaluation. Finally, the proposed algorithm is simulated and analyzed through several scenarios.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.783-784
• /
• 2008

Block-matching motion estimation plays an important role in video coding. In this paper, we propose fast motion estimation algorithm using octagon pattern for low complexity. Proposed algorithm carries out minimum SAD point among nine regions divided by octagon pattern and center point. Experimental results show that proposed algorithm has better performance than conventional method through quantitative analysis.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.11-13
• /
• 2008

This study proposes the method to use existing digital maps as one of the technologies to exclude individual differences that occur in the process of manually determining GCP for the geometric correction of KOMPSAT images and applying it to the images and to automate the generation of ortho-images. It is known that, in case high-resolution satellite images are corrected geometrically by using RPC, first order polynomials are generally applied as the correction formula in order to obtain good results. In this study, we matched the corresponding objects between 1:25,000 digital map and a KOMPSAT image to obtain the coefficients of the zero order polynomial and showed the differences in the pixel locations obtained through the matching. We performed proximity corrections using the Boolean operation between the point data of the surface linear objects and the point data of the edge objects of the image. The surface linear objects are road, water, building from topographic map.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.5
• /
• pp.1439-1446
• /
• 2016

The execution complexities of the major time memory data tradeoff methods are analyzed in this paper. The multi-target tradeoffs covered are the classical Hellman, distinguished point, and fuzzy rainbow methods, both in their non-perfect and perfect table versions for the latter two methods. We show that their computational complexities are identical to those of the corresponding single-target methods executed under certain matching parameters and conclude that the perfect table fuzzy rainbow tradeoff method is most preferable.

• Proceedings of the KSRS Conference
• /
• 2009.03a
• /
• pp.250-253
• /
• 2009

고해상도 컬러 위성 영상 촬영을 위한 다중분광 센서를 탑재한 위성의 영상은, 탑재체에 장착된 센서의 위치에 따라, 동일 지역에 대해 센서 간의 촬영시각의 차이가 발생한다. 만약 이동하는 구름이 촬영될 경우, 센서별 촬영 영상간에는 구름과 지상과의 상대적 위치가 달라진다. 고해상도 컬러 위성 영상을 생성하기 위해, 영상 정합(image registration) 기법이 사용되는 데, 일반적인 영상 정합 알고리즘은 촬영 영상에서의 특징점(feature point)이 움직이지 않는 것을 전제로 수행한다. 그 결과 이동하는 구름 경계부에서 정합점(matching point)이 추출될 경우, 지상 영역에서의 정합품질이 좋지 않다. 따라서, 본 연구에서는 구름 경계부에서 정합점이 추출되지 않는 알고리즘을 제안하였다. 실험 영상으로 구름이 존재하는 아리랑2호 영상을 사용하였고, 제안된 영상 정합 알고리즘은 지상 영역에서의 정합 품질이 높였음을 보였다.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.11
• /
• pp.19-24
• /
• 1992

In this paper, a high frequency method is developed which combines the uniform Geometrical Theory of Diffraction(GTD) and the Aperture Integration(AI) to analyze electromagnetic plane wave scattering by a perfectly-conducting, open-ended, semi-infinite parallel plate waveguide with a uniform layer of absorbing material on its inner wall, and with a slanted planar termination inside. In this method, first, the field of an arbitary point inside the paraller plate waveguide is computed by the GTD. Second, the field scattered into exterior region by the waveguide is found using the equivalent current, which can be obtaind from the aperture field of the waveguide and using the AI. Numerical results based on this GTD method are presented and compared with those based on the mode matching method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.3
• /
• pp.275-279
• /
• 2013

Recently, as multimedia information becomes popular, there are many studies to retrieve images based on images in the web. However, it is hard to find the matching images which users want to find because of various patterns in images. In this paper, we suggest an efficient images retrieval system based on images for finding products in internet shopping malls. We extract features for image retrieval by using SIFT (Scale Invariant Feature Transform) algorithm, repeat keypoint matching in various dimension by using PCA-SIFT, and find the image which users search for by combining them. To verify efficiency of the proposed method, we compare the performance of our approach with that of SIFT and PCA-SIFT by using images with various patterns. We verify that the proposed method shows the best distinction in the case that product labels are not included in images.

• Journal of the Korea Convergence Society
• /
• v.11 no.10
• /
• pp.97-106
• /
• 2020

The factory information provided by the Industrial Location Information System (ILIS) is provided as raw data by the Korea Industrial Complex Corporation and registered after a filtering process, so the new factory information update is slow. In this study, to solve the problem of updating factory information of industrial location information system, using building data of road name address with relatively fast renewal cycle and building data of real estate, we compared the factory information of existing ILIS and extracted new factory information. In the process of comparison, a method was proposed to compare spatial objects of different types with point data and polygon data. Attribute information matching and object matching were performed, and attribute values of new factory information were extracted. The accuracy evaluation of the proposed spatial analysis method showed 79% accuracy, and the above matching technique was used to confirm the possibility of convergence of road name address data, real estate data and factory information of ILIS.

• Spatial Information Research
• /
• v.19 no.2
• /
• pp.37-46
• /
• 2011

Recently in the field of GIS(Geographic Information System), data integration from various sources has become an important topic in order to use spatial data effectively. In general, the integration of spatial data is accomplished by navigating corresponding space object and combining the information interacting with each object. But it is very difficult to navigate an object which has correspondence with one in another dataset. Many matching methods have been studied for navigating spatial object. The purpose of this paper is development of method for searching correspondent spatial object considering local position error which is remained even after coordinate transform ation when two different building data sets integrated. To achieve this goal, we performed coordinate transformation and overlapped two data sets and generated blocks which have similar position error. We matched building objects within each block using similarity and ICP algorithm. Finally, we tested this method in the aspect of applicability.