• Journal of Korean Society for Geospatial Information Science
• /
• v.15 no.4
• /
• pp.103-109
• /
• 2007

Ortho images and Digital Elevation Model (DEM) have been applied in various fields. It is necessary to acquire Ground Control Points (GCPs) for processing high resolution satellite images. However surveying GCPs require many time and expense. This study was performed to investigate whether GCPs automatically extracted from ortho images and DTED Level 2 can be applied to sensor modeling for high resolution satellite images. We analyzed the performance of the sensor model established by GCPs extracted automatically. We acquired GCPs by matching satellite image against ortho images. We included the height acquired from DTED Level 2 data in these GCPs. The spatial resolution of the DTED Level 2 data is about 30m. Absolution accuracy of this data is below 18m above MSL. The spatial resolution of ortho image is 1m. We established sensor model from IKONOS images using GCPs extracted automatically and generated DEMs from the images. The accuracy of sensor modeling is about $4{\sim}5$ pixel. We also established sensor models using GCPs acquired based on GPS surveying and generated DEMs. Two DEMs were similar. The RMSE of height from the DEM by automatic GCPs and DTED Level 2 is about 9 m. So we think that GCPs by DTED Level 2 and ortho image can use for IKONOS sensor modeling.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.2
• /
• pp.69-80
• /
• 1999

Recently, social requirements of personal identification techniques are rapidly expanding in a number of new application ares. Especially fingerprint recognition is the most important technology. Fingerprint recognition technologies are well established, proven, cost and legally accepted. Therefore, it has more spot lighted among the any other biometrics technologies. In this paper we propose a new on-line fingerprint recognition algorithm for non-inked type live scanner to fit their increasing of security level under the computing environment. Fingerprint recognition system consists of two distinct structural blocks: feature extraction and feature matching. The main topic in this paper focuses on the feature matching using the fingerprint minutiae (ridge ending and bifurcation). Minutiae matching is composed in the alignment stage and matching stage. Success of optimizing the alignment stage is the key of real-time (on-line) fingerprint recognition. Proposed alignment algorithm using clique shows the strength in the search space optimization and partially incomplete image. We make our own database to get the generality. Using the traditional statistical discriminant analysis, 0.05% false acceptance rate (FAR) at 8.83% false rejection rate (FRR) in 1.55 second average matching speed on a Pentium system have been achieved. This makes it possible to construct high performance fingerprint recognition system.

• Journal of Broadcast Engineering
• /
• v.20 no.2
• /
• pp.257-264
• /
• 2015

In this paper, Enhanced binary block matching method for Constrained one-bit transform (C1BT) based motion estimation is proposed. Binary motion estimation exploits the Number of non-matched points (NNMP) as a block matching criterion instead of the Sum of Absolute Differences (SAD) for low complex motion estimation. The motion estimation using SAD could use the smaller block for more accurate motion estimation. In this paper the enhanced binary block matching method using smaller motion estimation block for C1BT is proposed to the more accurate binary matching. Experimental results shows that the proposed algorithm has better Peak Signal to Noise Ration (PSNR) results compared with conventional binary transform algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4A
• /
• pp.364-370
• /
• 2002

In this paper, we propose a VLSI array architecture for high speed processing of FBMA. First of all, the sequential FBMA is transformed into a single assignment code by using the index space expansion, and then the dependance graph is obtained from it. The two dimensional VLSI array is derived by projecting the dependance graph along the optimal direction. Since the candidate blocks in the search range are overlapped with columns as well as rows, the processing elements of the VLSI array are designed to reuse the overlapped data. As the results, the number of data inputs is reduced so that the processing performance is improved. The proposed VLSI array has (N$^2$+1)${\times}$(2p+1) processing elements and (N+2p) input ports where N is the block size and p is the maximum search range. The computation time of the rat reference block is (N$^2$+2(p+1)N+6p), and the block pipeline period is (3N+4p-1).

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.9 no.2
• /
• pp.49-56
• /
• 1991

In this study, 3D positioning of CCT digital imagery was done by using a personal computer image processing method to increase the economic and time efficiency of SPOT satellite imagery. Image matching technique which applies statistical theories, was applied to acqusition of satellite imagery. The reliability of these coordinates was anlysed to presente a new algorithm for three dimensional positioning necessary in digital elevation modelling and orthophoto production. In acquiring image coordinates from CCT digital satellite imagery, accuracy of planimetric and height coordinates was improved by applying the image matching technique and it was found through analysis of correlation factors between sizes of target window that 19$\times$19 pixels was the most suitable size for image coordinate acquisition. From these results, it was able to present an algorithm about utility of digital imagery in the analysis of SPOT satellite data.

• 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.

• Proceedings of the KSRS Conference
• /
• 2008.03a
• /
• pp.80-85
• /
• 2008

최근 도심지역이 급변하고 고해상도 위성영상의 보급이 증가함에 따라 고해상도 위성영상을 이용한 수치표고모델과 정사영상 생성에 관한 연구가 활발해 지고 있다. 본 연구에서는 IKONOS, SPOT5, QUICKBIRD, KOMPSAT2 위성영상을 이용하여 DEM 과 정사영상을 생성하였으며 USGS DTED 와 기준점을 이용하여 결과의 정확도를 비교 분석하였다. 보다 정확한 DEM 생성을 위해 자동 피라미드 알고리즘을 적용하고 영상 정합시 에피폴라 기하학을 적용하였다. 정사 영상 생성시 DTED 높이값을 이용하여 보정을 수행하였으며 생성 속도를 높이기 위하여 리샘플링 그리드를 적용하였다. 본 연구에서 DEM 과 정사영상 생성시 QUICKBIRD 와 SPOT5 의 경우 영상의 용량이 매우 커 메모리 부족문제와 알고리즘 수행 속도 저하가 발생함을 확인하였다. 이를 개선하기 위하여 DEM 생성시 정합 후보점의 개수를 줄이는 알고리즘을 고안하여 기존에 메모리 문제로 생성하지 못했던 QUICKBIRD와 SPOT5 의 DEM 을 생성하였으며 정사 영상 생성시 리샘플링 그리드를 적용하여 고해상도 정상영상 생성 속도 개선에 상당한 효과를 가져왔다. 그러나 고해상도 위성 영상의 용량이 점점 커져감에 따라 이러한 메모리 문제와 처리 속도 저하에 관한 문제는 추후 계속적으로 연구되어야 할 부분이라고 할 수 있다. 본 연구에서 생성한 IKONOS, SPOT5, QUICKBIRD DEM 의 정확도를 USGS DTED 와 비교한 결과 13${\sim}$15 m 정도의 RMS 높이 오차가 산출되었으며 생성된 IKONOS, QUICKBIRD, KOMPSAT2 정사영상을 기준점과 비교한 결과 3 m 정도의 거리오차가 산출되었음을 확인하였다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.24 no.3
• /
• pp.270-277
• /
• 2013

In this paper, we propose a wideband ridge SIW(Ridge Substrate Integrated Waveguide)-to-SIW(Substrate Integrated Waveguide) transition. The proposed transition structure is designed to acquire a wide bandwidth by inserting through via holes at the regular interval for an impedance matching and an E-field mode matching method. The measurement results show a fractional bandwidth is 29.1 % at 20 dB return loss from the center frequency(11 GHz). The maximum insertion loss is 0.49 dB from 9.21 GHz to 12.41 GHz.

• Smart Media Journal
• /
• v.3 no.3
• /
• pp.15-19
• /
• 2014

Fingerprint Recognition System is made up of Off-line treatment and On-line treatment; the one is registering all the information of there trier features which are retrieved in the digitalized fingerprint getting out of the analog fingerprint through the fingerprint acquisition device and the other is the treatment making the decision whether the users are approved to be accessed to the system or not with matching them with the fingerprint features which are retrieved and database from the input fingerprint when the users are approaching the system to use. In this paper, Among various biometrics recognition systems, statistical fingerprint recognition matching methods are considered using minutiae on fingerprints. We define similarity distance measures based on the coordinate and angle of the minutiae, and suggest a fingerprint recognition model following statistical distributions.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.953-964
• /
• 2003

In the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the cross pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the cross pattern, and then lastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed cross pattern and flat-hexagonal pattern search algorithm(CFHPS ) improves about 0.2-6.2% in terms of average number of search point per motion vector estimation and improves about 0.02-0.31dB in terms of PSNR(Peak Signal to Noise Ratio).