• Title/Summary/Keyword: 영상 정합

Search Result 1,429, Processing Time 0.029 seconds

Feasibility Study on FSIM Index to Evaluate SAR Image Co-registration Accuracy (SAR 영상 정합 정확도 평가를 위한 FSIM 인자 활용 가능성)

  • Kim, Sang-Wan;Lee, Dongjun
    • Korean Journal of Remote Sensing
    • /
    • v.37 no.5_1
    • /
    • pp.847-859
    • /
    • 2021
  • Recently, as the number of high-resolution satellite SAR images increases, the demand for precise matching of SAR imagesin change detection and image fusion is consistently increasing. RMSE (Root Mean Square Error) values using GCPs (Ground Control Points) selected by analysts have been widely used for quantitative evaluation of image registration results, while it is difficult to find an approach for automatically measuring the registration accuracy. In this study, a feasibility analysis was conducted on using the FSIM (Feature Similarity) index as a measure to evaluate the registration accuracy. TerraSAR-X (TSX) staring spotlight data collected from various incidence angles and orbit directions were used for the analysis. FSIM was almost independent on the spatial resolution of the SAR image. Using a single SAR image, the FSIM with respect to registration errors was analyzed, then use it to compare with the value estimated from TSX data with different imaging geometry. FSIM index slightly decreased due to the differencesin imaging geometry such as different look angles, different orbit tracks. As the result of analyzing the FSIM value by land cover type, the change in the FSIM index according to the co-registration error was most evident in the urban area. Therefore, the FSIM index calculated in the urban was mostsuitable for determining the accuracy of image registration. It islikely that the FSIM index has sufficient potential to be used as an index for the co-registration accuracy of SAR image.

Efficient Feature Point Matching Technique using Unique Match Pairs (유일 정합쌍을 이용한 효율적인 특징점 정합기법)

  • Gwon, Hyeok-Min;Han, Jun-Hui
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.6
    • /
    • pp.791-803
    • /
    • 1999
  • 본 논문은 두 장의 스테레요 영상으로부터 자동적으로 특징점 정합을 수행하도록 하는 새로운 절차의 효율적인 정합방법을 제안한다. 이를 위해 초기정합의 결과로 얻을 수 있는 유일 정합쌍을 이용한다. 즉, 본 논문에서는 초기정합의 결과로 얻어낸 유일 정합쌍의 정보를 이용하여 바로 outlier들을 제거시키므로써 초기정합의 결과가 갖는 애매성까지도 동반하여 상당량을 줄이도록 한다. 결국 애매성 제거에 대한 부담이 줄어들게 되므로 애매성 제거과정에서는 이완화 방법을 사용하지 않고 빠르게 애매성을 제거시킨다. 아울러 정합의 정확도를 높이기 위해 초기정합 후 바로 서브픽셀 정확도의 정합을 수행하며 정합의 마지막 단계에서는 추가정합을 수행하므로써 정합의 성능을 향상시킨다. 실내, 실회 스테레요 영상에 대한 다양한 실험결과는 본 논문에서 제안하는 방법의 특징점 정합기법이 빠르고 효율적임을 보여준다.

Multi-sensor Image Registration Using Normalized Mutual Information and Gradient Orientation (정규 상호정보와 기울기 방향 정보를 이용한 다중센서 영상 정합 알고리즘)

  • Ju, Jae-Yong;Kim, Min-Jae;Ku, Bon-Hwa;Ko, Han-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.6
    • /
    • pp.37-48
    • /
    • 2012
  • Image registration is a process to establish the spatial correspondence between the images of same scene, which are acquired at different view points, at different times, or by different sensors. In this paper, we propose an effective registration method for images acquired by multi-sensors, such as EO (electro-optic) and IR (infrared) sensors. Image registration is achieved by extracting features and finding the correspondence between features in each input images. In the recent research, the multi-sensor image registration method that finds corresponding features by exploiting NMI (Normalized Mutual Information) was proposed. Conventional NMI-based image registration methods assume that the statistical correlation between two images should be global, however images from EO and IR sensors often cannot satisfy this assumption. Therefore the registration performance of conventional method may not be sufficient for some practical applications because of the low accuracy of corresponding feature points. The proposed method improves the accuracy of corresponding feature points by combining the gradient orientation as spatial information along with NMI attributes and provides more accurate and robust registration performance. Representative experimental results prove the effectiveness of the proposed method.

Registration and Visualization of Medical Image Using Conditional Entropy and 3D Volume Rendering (조건부 엔트로피와 3차원 볼륨 렌더링기법을 이용한 의료영상의 정합과 가시화)

  • Kim, Sun-Worl;Cho, Wan-Hyun
    • Communications for Statistical Applications and Methods
    • /
    • v.16 no.2
    • /
    • pp.277-286
    • /
    • 2009
  • Image registration is a process to establish the spatial correspondence between images of the same scene, which are acquired at different view points, at different times, or by different sensors. In this paper, we introduce a robust brain registration technique for correcting the difference between two temporal images by the different coordinate systems in MR and CT image obtained from the same patient. Two images are registered where this measure is minimized using a modified conditional entropy(MCE: Modified Conditional Entropy) computed from the joint histograms for the intensities of two given images, we conduct the rendering for visualization of 3D volume image.

A Study on the Generation of Three Dimensional Orthophoto Map from Aerial Photograph by Digital Photogrammetry (수치사진측량 기법을 이용한 항공사진의 정사투영사진 지도 생성에 관한 연구)

  • 조재호;윤종성
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.16 no.2
    • /
    • pp.203-211
    • /
    • 1998
  • A traditional method to produce three dimensional orthophoto map has been studied by digital photogrammetry which decides a height by digitally searching conjugate points on the stereo image. Many researches in digital photogrammetric field are still in progress to determine conjugate points automatically. In this study, we analyze the effect of accuracy of area-based image matching with changing eight types of target area size using four types of image pyramid. The result of image matching to each method compared with 1/5,000 digital mapping data. We decided a optimal size of target area on a percentage of image matching. Digital elevation model is generated by matching results and bundle method. As a result, three dimensional orthophoto map is made in terms of digital elevation model and orthophoto.

  • PDF

Non-rigid Registration Method of Lung Parenchyma in Temporal Chest CT Scans using Region Binarization Modeling and Locally Deformable Model (영역 이진화 모델링과 지역적 변형 모델을 이용한 시간차 흉부 CT 영상의 폐 실질 비강체 정합 기법)

  • Kye, Hee-Won;Lee, Jeongjin
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.6
    • /
    • pp.700-707
    • /
    • 2013
  • In this paper, we propose a non-rigid registration method of lung parenchyma in temporal chest CT scans using region binarization modeling and locally deformable model. To cope with intensity differences between CT scans, we segment the lung vessel and parenchyma in each scan and perform binarization modeling. Then, we match them without referring any intensity information. We globally align two lung surfaces. Then, locally deformable transformation model is developed for the subsequent non-rigid registration. Subtracted quantification results after non-rigid registration are visualized by pre-defined color map. Experimental results showed that proposed registration method correctly aligned lung parenchyma in the full inspiration and expiration CT images for ten patients. Our non-rigid lung registration method may be useful for the assessment of various lung diseases by providing intuitive color-coded information of quantification results about lung parenchyma.

Real-Time Feature Point Matching Using Local Descriptor Derived by Zernike Moments (저니키 모멘트 기반 지역 서술자를 이용한 실시간 특징점 정합)

  • Hwang, Sun-Kyoo;Kim, Whoi-Yul
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.4
    • /
    • pp.116-123
    • /
    • 2009
  • Feature point matching, which is finding the corresponding points from two images with different viewpoint, has been used in various vision-based applications and the demand for the real-time operation of the matching is increasing these days. This paper presents a real-time feature point matching method by using a local descriptor derived by Zernike moments. From an input image, we find a set of feature points by using an existing fast corner detection algorithm and compute a local descriptor derived by Zernike moments at each feature point. The local descriptor based on Zernike moments represents the properties of the image patch around the feature points efficiently and is robust to rotation and illumination changes. In order to speed up the computation of Zernike moments, we compute the Zernike basis functions with fixed size in advance and store them in lookup tables. The initial matching results are acquired by an Approximate Nearest Neighbor (ANN) method and false matchings are eliminated by a RANSAC algorithm. In the experiments we confirmed that the proposed method matches the feature points in images with various transformations in real-time and outperforms existing methods.

Unsupervised Non-rigid Registration Network for 3D Brain MR images (3차원 뇌 자기공명 영상의 비지도 학습 기반 비강체 정합 네트워크)

  • Oh, Donggeon;Kim, Bohyoung;Lee, Jeongjin;Shin, Yeong-Gil
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.15 no.5
    • /
    • pp.64-74
    • /
    • 2019
  • Although a non-rigid registration has high demands in clinical practice, it has a high computational complexity and it is very difficult for ensuring the accuracy and robustness of registration. This study proposes a method of applying a non-rigid registration to 3D magnetic resonance images of brain in an unsupervised learning environment by using a deep-learning network. A feature vector between two images is produced through the network by receiving both images from two different patients as inputs and it transforms the target image to match the source image by creating a displacement vector field. The network is designed based on a U-Net shape so that feature vectors that consider all global and local differences between two images can be constructed when performing the registration. As a regularization term is added to a loss function, a transformation result similar to that of a real brain movement can be obtained after the application of trilinear interpolation. This method enables a non-rigid registration with a single-pass deformation by only receiving two arbitrary images as inputs through an unsupervised learning. Therefore, it can perform faster than other non-learning-based registration methods that require iterative optimization processes. Our experiment was performed with 3D magnetic resonance images of 50 human brains, and the measurement result of the dice similarity coefficient confirmed an approximately 16% similarity improvement by using our method after the registration. It also showed a similar performance compared with the non-learning-based method, with about 10,000 times speed increase. The proposed method can be used for non-rigid registration of various kinds of medical image data.

Image Disparity Estimation through Type-based Stereo Matching (유형기반 스테레오 정합을 통한 영상변이 측정)

  • Kim Gye-Young;Jang Seok-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.2 s.40
    • /
    • pp.83-92
    • /
    • 2006
  • This paper describes an image disparity estimation method using region-based stereo matching. Region-based disparity estimation yields a disparity map as the unit of segmented region. However it estimates disparity imprecisely because it not only has matching errors but also applies an identical way to disparity estimation, which does not consider each type of matched regions. To solve this problem, we proposes a disparity estimation method which considers the type of matched regions. That is, the proposed method classifies whole matched regions into a similar-matched region, a dissimilar-matched region, a false-matched region and a miss-matched region. We then performs proper disparity estimation for each type of matched regions. This method minimizes the error in estimating disparity which is caused by inaccurate matching and also improves the accuracy of disparity of the well-matched regions. The experimental results show the improved accuracy of the proposed method.

  • PDF

Time-based Stereo Matching Algorithm for Ground-truth (Ground truth를 위한 시간 누적형 스테레오 정합 알고리즘)

  • Jeong, Jae-chan;Shin, Ho-chul;Cho, Jae-il
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.11a
    • /
    • pp.1416-1417
    • /
    • 2013
  • 깊이 정보를 획득하기 위해서 가장 많이 시도되는 방법이 스테레오 정합이다. 스테레오 정합 알고리즘은 다양한 알고리즘의 조합으로 구성되며, 파라메터 또한 다양하다. 일반적으로는 middlebury에서 제공하는 영상과 ground truth를 이용해서 스테레오 정합 알고리즘을 연구하고, 파라메터 최적화 과정을 거친다. 실제 시스템에 알고리즘 및 파라메터를 적용할 때 middlebury 영상으로 선택된 알고리즘과 파라메터가 상이할 수 있다. 본 논문에서는 실제 시스템의 스테레오 카메라를 이용해서 ground truth를 만들 수 있는 방법을 제안하다. 프로젝트를 이용해서 패턴을 투사하고, 스테레오 카메라로 영상을 획득한다. 한 장면에 대해서 다양한 영상으로 스테레오 정합을 수행하여 만들어진 disparity map은 높은 정확성을 가지고 있음으로, 스테레오 정합 알고리즘 검증용 ground truth로 사용이 가능하다.