• Title/Summary/Keyword: matching points

Search Result 710, Processing Time 0.028 seconds

SHIP BLOCK ARRANGEMENT SYSTEM BASED ON IMAGE PROCESSING

  • Park, Jeong-Ho;Choi, Wan-Sik
    • Proceedings of the KSRS Conference
    • /
    • 2008.10a
    • /
    • pp.104-106
    • /
    • 2008
  • This paper proposes an image based method for arranging ship blocks in a dockyard. The problem of appropriately arranging numerous blocks has to be carefully planned because it has close relation to the effectiveness of the whole working process. To implement the system, the block shape and feature points have to be obtained from block image. The block arrangement system can be implemented by the fusion of the block shape extraction and image matching technology.

  • PDF

Motion Estimation Using Feature Matching and Strongly Coupled Recurrent Module Fusion (특징정합과 순환적 모듈융합에 의한 움직임 추정)

  • 심동규;박래홍
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.12
    • /
    • pp.59-71
    • /
    • 1994
  • This paper proposes a motion estimation method in video sequences based on the feature based matching and anistropic propagation. It measures translation and rotation parameters using a relaxation scheme at feature points and object orinted anistropic propagation in continuous and discontinuous regions. Also an iterative improvement motion extimation based on the strongly coupled module fusion and adaptive smoothing is proposed. Computer simulation results show the effectiveness of the proposed algorithm.

  • PDF

Terrain Matching Technique Using 3-D Terrain Maps (3차원 지형정보를 이용한 지형영상의 정합기법)

  • 김준식;강민석;박래홍;이쾌희
    • Korean Journal of Remote Sensing
    • /
    • v.7 no.1
    • /
    • pp.13-27
    • /
    • 1991
  • DEM(digital elevation map) is a very useful information in various applications. In this paper, we have studied on the terrain matching algorithm using the DEM, which was proposed by Rodriguez and Aggarwal(1990) for an aircraft navigation system. We evaluated its performance using syntactic images. Cliff maps and critical points are used for the reduction of computation time and information size to be processed. The computer simulation shows that though the computational complexity is high, the technique is efficient even to noisy images.

Automatic Global Registration for Terrestrial Laser Scanner Data (지상레이저스캐너 데이터의 자동 글로벌 보정)

  • Kim, Chang-Jae;Eo, Yang-Dam;Han, Dong-Yeob
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.28 no.2
    • /
    • pp.281-287
    • /
    • 2010
  • This study compares transformation algorithms for co-registration of terrestrial laser scan data. Pair-wise transformation which is used for transformation of scan data from more than two different view accumulates errors. ICP algorithm commonly used for co-registration between scan data needs initial geometry information. And it is difficult to co-register simultaneously because of too many control points when managing scan at the same time. Therefore, this study perform global registration technique using matching points. Matching points are extracted automatically from intensity image by SIFT and global registration is performed using GP analysis. There are advantages for operation speed, accuracy, automation in suggested global registration algorithm. Through the result from it, registration algorithms can be developed by considering accuracy and speed.

An Efficient Search Method for Binary-based Block Motion Estimation (이진 블록 매칭 움직임 예측을 위한 효율적인 탐색 알고리듬)

  • Lim, Jin-Ho;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.16 no.4
    • /
    • pp.647-656
    • /
    • 2011
  • Motion estimation using one-bit transform and two-bit transform reduces the complexity for computation of matching error; however, the peak signal-to-noise ratio (PSNR) is degraded. Modified 1BT (M1BT) and modified 2BT (M2BT) have been proposed to compensate degraded PSNR by adding conditional local search. However, these algorithms require many additional search points in fast moving sequences with a block size of $16{\times}16$. This paper provides more efficient search method by preparing candidate blocks using the number of non-matching points (NNMP) than the conditional local search. With this NNMP-based search, we can easily obtain candidate blocks with small NNMP and efficiently search final motion vector. Experimental results show that the proposed algorithm not only reduces computational complexity, but also improves PSNR on average compared with conventional search algorithm used in M1BT, M2BT and AM2BT.

Fast Image Stitching Based on Improved SURF Algorithm Using Meaningful Features (의미 있는 특징점을 이용한 향상된 SURF 알고리즘 기반의 고속 이미지 스티칭 기법)

  • Ahn, Hyo-Chang;Rhee, Sang-Burm
    • The KIPS Transactions:PartB
    • /
    • v.19B no.2
    • /
    • pp.93-98
    • /
    • 2012
  • Recently, we can easily create high resolution images with digital cameras for high-performance and make use them at variety fields. Especially, the image stitching method which adjusts couple of images has been researched. Image stitching can be used for military purposes such as satellites and reconnaissance aircraft, and computer vision such as medical image and the map. In this paper, we have proposed fast image stitching based on improved SURF algorithm using meaningful features in the process of images matching after extracting features from scenery image. The features are extracted in each image to find out corresponding points. At this time, the meaningful features can be searched by removing the error, such as noise, in extracted features. And these features are used for corresponding points on image matching. The total processing time of image stitching is improved due to the reduced time in searching out corresponding points. In our results, the processing time of feature matching and image stitching is faster than previous algorithms, and also that method can make natural-looking stitched image.

Integrated Automatic Pre-Processing for Change Detection Based on SURF Algorithm and Mask Filter (변화탐지를 위한 SURF 알고리즘과 마스크필터 기반 통합 자동 전처리)

  • Kim, Taeheon;Lee, Won Hee;Yeom, Junho;Han, Youkyung
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.3
    • /
    • pp.209-219
    • /
    • 2019
  • Satellite imagery occurs geometric and radiometric errors due to external environmental factors at the acquired time, which in turn causes false-alarm in change detection. These errors should be eliminated by geometric and radiometric corrections. In this study, we propose a methodology that automatically and simultaneously performs geometric and radiometric corrections by using the SURF (Speeded-Up Robust Feature) algorithm and the mask filter. The MPs (Matching Points), which show invariant properties between multi-temporal imagery, extracted through the SURF algorithm are used for automatic geometric correction. Using the properties of the extracted MPs, PIFs (Pseudo Invariant Features) used for relative radiometric correction are selected. Subsequently, secondary PIFs are extracted by generated mask filters around the selected PIFs. After performing automatic using the extracted MPs, we could confirm that geometric and radiometric errors are eliminated as the result of performing the relative radiometric correction using PIFs in geo-rectified images.

Automated Satellite Image Co-Registration using Pre-Qualified Area Matching and Studentized Outlier Detection (사전검수영역기반정합법과 't-분포 과대오차검출법'을 이용한 위성영상의 '자동 영상좌표 상호등록')

  • Kim, Jong Hong;Heo, Joon;Sohn, Hong Gyoo
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.4D
    • /
    • pp.687-693
    • /
    • 2006
  • Image co-registration is the process of overlaying two images of the same scene, one of which represents a reference image, while the other is geometrically transformed to the one. In order to improve efficiency and effectiveness of the co-registration approach, the author proposed a pre-qualified area matching algorithm which is composed of feature extraction with canny operator and area matching algorithm with cross correlation coefficient. For refining matching points, outlier detection using studentized residual was used and iteratively removes outliers at the level of three standard deviation. Throughout the pre-qualification and the refining processes, the computation time was significantly improved and the registration accuracy is enhanced. A prototype of the proposed algorithm was implemented and the performance test of 3 Landsat images of Korea. showed: (1) average RMSE error of the approach was 0.435 pixel; (2) the average number of matching points was over 25,573; (3) the average processing time was 4.2 min per image with a regular workstation equipped with a 3 GHz Intel Pentium 4 CPU and 1 Gbytes Ram. The proposed approach achieved robustness, full automation, and time efficiency.

Impact Analysis of Buildings for KOMPSAT-3 Image Co-registration (KOMPSAT-3 위성영상의 상대기하보정에 대한 건물의 영향 분석)

  • Park, Jueon;Kim, Taeheon;Yun, Yerin;Lee, Chabin;Lee, Jinmin;Lee, Changno;Han, Youkyung
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.40 no.4
    • /
    • pp.293-304
    • /
    • 2022
  • In this study, to analyze the effect of buildings on the image co-registration performance, co-registration results are compared according to the presence or absence of matching points extracted from buildings. To remove the matching points extracted from buildings, a building mask generated by extracting building objects from the digital topographic map was used. In addition, matching points extraction performance and image co-registration accuracy were analyzed according to the magnitude of the convergence angle. Image co-registration results were compared by applying the affine and piecewise linear transformation models, respectively. According to the experimental results, the affine transformation model showed an overall improvement in accuracy after removing the matching points extracted from buildings. On the other hand, the piecewise linear transformation model improved the accuracy at the checkpoints including the surrounding buildings, but the accuracy improvement was not significant at checkpoints in the flat area without the existence of buildings. In addition, when the piecewise linear transformation model was applied, stable accuracy of less than 2 pixels was derived from images with a convergence angle of 20° or less.

Automation of Aerial Triangulation by Auto Dectection of Pass Points (접합점 자동선정에 의한 항공삼각측량의 자동화)

  • Yeu, Bock-Mo;Kim, Won-Dae
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.7 no.2 s.14
    • /
    • pp.47-56
    • /
    • 1999
  • In this study, tie point observation in aerial triangulation was automated by the image processing methods. The technique includes boundary extraction and We matching processes. The procedures were applied to extract points of Interest and to find their conjugate points in the other images. The image coordinates of the identified points were then used to compute their absolute coordinates. An algorithm was developed in this study for the automation of observation in aerial triangulation, which is a manual process of selecting a tie point and recording the image coordinate of the selected point. The developed algorithm automates this process through the application of a mathematical operator to extract points of interest from an arbitrary image. The root m square error of image coordinates of the developed algorithm is $6.8{\mu}m$, which is close to that of the present analytical method. In a manual environment, the accuracy of the result of a photogrammetric process is heavily dependant on the level of skill and experience of the human operator. No such problem exists in an automated system. Also, as a result of the automated system, the time spent in the observation process could be reduced by a factor of 61.2%, thereby reducing the overall cost.

  • PDF