scholarly journals A Matching Algorithm for Underwater Acoustic and Optical Images Based on Image Attribute Transfer and Local Features

Sensors ◽  
2021 ◽  
Vol 21 (21) ◽  
pp. 7043
Author(s):  
Xiaoteng Zhou ◽  
Changli Yu ◽  
Xin Yuan ◽  
Citong Luo
Keyword(s):  
Image Matching ◽  
Local Features ◽  
Matching Task ◽  
Feature Descriptor ◽  
Underwater Acoustic ◽  
Optical Images ◽  
Underwater Vision ◽  
Multisensor Information Fusion ◽  
Multimodal Images ◽  
Accurate Matching

In the field of underwater vision, image matching between the main two sensors (sonar and optical camera) has always been a challenging problem. The independent imaging mechanism of the two determines the modalities of the image, and the local features of the images under various modalities are significantly different, which makes the general matching method based on the optical image invalid. In order to make full use of underwater acoustic and optical images, and promote the development of multisensor information fusion (MSIF) technology, this letter proposes to apply an image attribute transfer algorithm and advanced local feature descriptor to solve the problem of underwater acousto-optic image matching. We utilize real and simulated underwater images for testing; experimental results show that our proposed method could effectively preprocess these multimodal images to obtain an accurate matching result, thus providing a new solution for the underwater multisensor image matching task.

scholarly journals Hybrid Invariant Local Features for Multiple Satellite Image Matching and Registration

2019 ◽  
Vol 9 (2) ◽  
pp. 309-314
Keyword(s):  
Image Matching ◽  
Feature Matching ◽  
Satellite Image ◽  
Remote Sensing Data ◽  
Local Features ◽  
Feature Descriptor ◽  
Matching Method ◽  
Multiple Images ◽  
Feature Sets ◽  
Precise Relationship

Automatic image registration (IR) is very challenging and very important in the field of hyperspectral remote sensing data. Efficient autonomous IR method is needed with high precision, fast, and robust. A key operation of IR is to align the multiple images in single co-ordinate system for extracting and identifying variation between images considered. In this paper, presented a feature descriptor by combining features from both Feature from Accelerated Segment Test (FAST) and Binary Robust Invariant Scalable Key point (BRISK). The proposed hybrid invariant local features (HILF) descriptor extract useful and similar feature sets from reference and source images. The feature matching method allows finding precise relationship or matching among two feature sets. An experimental analysis described the outcome BRISK, FASK and proposed HILF in terms of inliers ratio and repeatability evaluation metrics.

scholarly journals ROBUST MULTIMODAL IMAGE MATCHING BASED ON MAIN STRUCTURE FEATURE REPRESENTATION

2020 ◽  
Vol XLIII-B3-2020 ◽  
pp. 583-589
Author(s):  
Y. Fu ◽  
Y. Ye ◽  
G. Liu ◽  
B. Zhang ◽  
R. Zhang
Keyword(s):  
Image Matching ◽  
Template Matching ◽  
Feature Representation ◽  
Image Feature ◽  
Feature Descriptor ◽  
Phase Congruency ◽  
Main Structure ◽  
Structure Information ◽  
Remote Sensing Image Processing ◽  
Multimodal Images

Abstract. Image matching is a crucial procedure for multimodal remote sensing image processing. However, the performance of conventional methods is often degraded in matching multimodal images due to significant nonlinear intensity differences. To address this problem, this letter proposes a novel image feature representation named Main Structure with Histogram of Orientated Phase Congruency (M-HOPC). M-HOPC is able to precisely capture similar structure properties between multimodal images by reinforcing the main structure information for the construction of the phase congruency feature description. Specifically, each pixel of an image is assigned an independent weight for feature descriptor according to the main structure such as large contours and edges. Then M-HOPC is integrated as the similarity measure for correspondence detection by a template matching scheme. Three pairs of multimodal images including optical, LiDAR, and SAR data have been used to evaluate the proposed method. The results show that M-HOPC is robust to nonlinear intensity differences and achieves the superior matching performance compared with other state-of-the-art methods.

scholarly journals SR-SYBA: A Scale and Rotation Invariant Synthetic Basis Feature Descriptor with Low Memory Usage

Electronics ◽  
2020 ◽  
Vol 9 (5) ◽  
pp. 810
Author(s):  
Meng Yu ◽  
Dong Zhang ◽  
Dah-Jye Lee ◽  
Alok Desai
Keyword(s):  
Image Matching ◽  
Rotation Invariance ◽  
Polar Coordinate System ◽  
Feature Descriptor ◽  
Feature Points ◽  
Rotation Invariant ◽  
Image Scaling ◽  
Polar Coordinate ◽  
Computer Vision Applications ◽  
Accurate Matching

Feature description has an important role in image matching and is widely used for a variety of computer vision applications. As an efficient synthetic basis feature descriptor, SYnthetic BAsis (SYBA) requires low computational complexity and provides accurate matching results. However, the number of matched feature points generated by SYBA suffers from large image scaling and rotation variations. In this paper, we improve SYBA’s scale and rotation invariance by adding an efficient pre-processing operation. The proposed algorithm, SR-SYBA, represents the scale of the feature region with the location of maximum gradient response along the radial direction in Log-polar coordinate system. Based on this scale representation, it normalizes all feature regions to the same reference scale to provide scale invariance. The orientation of the feature region is represented as the orientation of the vector from the center of the feature region to its intensity centroid. Based on this orientation representation, all feature regions are rotated to the same reference orientation to provide rotation invariance. The original SYBA descriptor is then applied to the scale and orientation normalized feature regions for description and matching. Experiment results show that SR-SYBA greatly improves SYBA for image matching applications with scaling and rotation variations. SR-SYBA obtains comparable or better performance in terms of matching rate compared to the mainstream algorithms while still maintains its advantages of using much less storage and simpler computations. SR-SYBA is applied to a vision-based measurement application to demonstrate its performance for image matching.

An Image Matching Algorithm Based on SCCH Feature Descriptor

2011 ◽  
Vol 33 (9) ◽  
pp. 2152-2157 ◽  
Author(s):  
Yong-he Tang ◽  
Huan-zhang Lu ◽  
Mou-fa Hu
Keyword(s):  
Image Matching ◽  
Feature Descriptor ◽  
Matching Algorithm

Within-person variability can improve the identification of unfamiliar faces across changes in viewpoint

2021 ◽  
pp. 174702182110097
Author(s):  
Niamh Hunnisett ◽  
Simone Favelle
Keyword(s):  
Image Matching ◽  
Matching Task ◽  
Target Image ◽  
Front View ◽  
Multiple Image ◽  
Profile View ◽  
Unfamiliar Face ◽  
Matching Performance ◽  
Sequential Matching ◽  
Unfamiliar Faces

Unfamiliar face identification is concerningly error prone, especially across changes in viewing conditions. Within-person variability has been shown to improve matching performance for unfamiliar faces, but this has only been demonstrated using images of a front view. In this study, we test whether the advantage of within-person variability from front views extends to matching to target images of a face rotated in view. Participants completed either a simultaneous matching task (Experiment 1) or a sequential matching task (Experiment 2) in which they were tested on their ability to match the identity of a face shown in an array of either one or three ambient front-view images, with a target image shown in front, three-quarter, or profile view. While the effect was stronger in Experiment 2, we found a consistent pattern in match trials across both experiments in that there was a multiple image matching benefit for front, three-quarter, and profile-view targets. We found multiple image effects for match trials only, indicating that providing observers with multiple ambient images confers an advantage for recognising different images of the same identity but not for discriminating between images of different identities. Signal detection measures also indicate a multiple image advantage despite a more liberal response bias for multiple image trials. Our results show that within-person variability information for unfamiliar faces can be generalised across views and can provide insights into the initial processes involved in the representation of familiar faces.

scholarly journals MBR-SIFT: A mirror reflected invariant feature descriptor using a binary representation for image matching

PLoS ONE ◽  
2017 ◽  
Vol 12 (5) ◽  
pp. e0178090 ◽  
Author(s):  
Mingzhe Su ◽  
Yan Ma ◽  
Xiangfen Zhang ◽  
Yan Wang ◽  
Yuping Zhang
Keyword(s):  
Image Matching ◽  
Feature Descriptor ◽  
Binary Representation ◽  
Invariant Feature

scholarly journals AN INTEGRATED RANSAC AND GRAPH BASED MISMATCH ELIMINATION APPROACH FOR WIDE-BASELINE IMAGE MATCHING

2015 ◽  
Vol XL-1-W5 ◽  
pp. 297-300 ◽  
Author(s):  
M. Hasheminasab ◽  
H. Ebadi ◽  
A. Sedaghat
Keyword(s):  
Image Matching ◽  
Graph Transformation ◽  
Feature Point ◽  
Consensus Method ◽  
Feature Descriptor ◽  
Range Image ◽  
Point Sets ◽  
Short Baseline ◽  
Epipolar Constraint ◽  
Baseline Image

In this paper we propose an integrated approach in order to increase the precision of feature point matching. Many different algorithms have been developed as to optimizing the short-baseline image matching while because of illumination differences and viewpoints changes, wide-baseline image matching is so difficult to handle. Fortunately, the recent developments in the automatic extraction of local invariant features make wide-baseline image matching possible. The matching algorithms which are based on local feature similarity principle, using feature descriptor as to establish correspondence between feature point sets. To date, the most remarkable descriptor is the scale-invariant feature transform (SIFT) descriptor , which is invariant to image rotation and scale, and it remains robust across a substantial range of affine distortion, presence of noise, and changes in illumination. The epipolar constraint based on RANSAC (random sample consensus) method is a conventional model for mismatch elimination, particularly in computer vision. Because only the distance from the epipolar line is considered, there are a few false matches in the selected matching results based on epipolar geometry and RANSAC. Aguilariu et al. proposed Graph Transformation Matching (GTM) algorithm to remove outliers which has some difficulties when the mismatched points surrounded by the same local neighbor structure. In this study to overcome these limitations, which mentioned above, a new three step matching scheme is presented where the SIFT algorithm is used to obtain initial corresponding point sets. In the second step, in order to reduce the outliers, RANSAC algorithm is applied. Finally, to remove the remained mismatches, based on the adjacent K-NN graph, the GTM is implemented. Four different close range image datasets with changes in viewpoint are utilized to evaluate the performance of the proposed method and the experimental results indicate its robustness and capability.

Image Matching with Large Viewing Angle Based on Local Features

2019 ◽  
Vol 39 (5) ◽  
pp. 0510002
Author(s):  
赵鹏图 Zhao Pengtu ◽  
达飞鹏 Da Feipeng
Keyword(s):  
Image Matching ◽  
Local Features ◽  
Viewing Angle

scholarly journals EMCM: A Novel Binary Edge-Feature-Based Maximum Clique Framework for Multispectral Image Matching

2019 ◽  
Vol 11 (24) ◽  
pp. 3026
Author(s):  
Bin Fang ◽  
Kun Yu ◽  
Jie Ma ◽  
Pei An
Keyword(s):  
Image Matching ◽  
Nearest Neighbor ◽  
Feature Matching ◽  
Maximum Clique ◽  
Feature Space ◽  
Multispectral Image ◽  
Feature Descriptor ◽  
Ranking Algorithm ◽  
Feature Based ◽  
Edge Feature

Seeking reliable correspondence between multispectral images is a fundamental and important task in computer vision. To overcome the nonlinearity problem occurring in multispectral image matching, a novel, edge-feature-based maximum clique-matching frame (EMCM) is proposed, which contains three main parts: (1) a novel strong edge binary feature descriptor, (2) a new correspondence-ranking algorithm based on keypoint distinctiveness analysis algorithms in the feature space of the graph, and (3) a false match removal algorithm based on maximum clique searching in the correspondence space of the graph considering both position and angle consistency. Extensive experiments are conducted on two standard multispectral image datasets with respect to the three parts. The feature-matching experiments suggest that the proposed feature descriptor is of high descriptiveness, robustness, and efficiency. The correspondence-ranking experiments validate the superiority of our correspondences-ranking algorithm over the nearest neighbor algorithm, and the coarse registration experiments show the robustness of EMCM with varied interferences.

Sign in / Sign up

Export Citation Format

Share Document