Lunar Laser Ranging has extremely high requirements for the pointing accuracy of the telescopes used.To improve its pointing accuracy and solve the problem of insufficiently accurate telescope pointing correction achi...Lunar Laser Ranging has extremely high requirements for the pointing accuracy of the telescopes used.To improve its pointing accuracy and solve the problem of insufficiently accurate telescope pointing correction achieved by tracking stars in the all-sky region,we propose a processing scheme to select larger-sized lunar craters near the Lunar Corner Cube Retroreflector as reference features for telescope pointing bias computation.Accurately determining the position of the craters in the images is crucial for calculating the pointing bias;therefore,we propose a method for accurately calculating the crater position based on lunar surface feature matching.This method uses matched feature points obtained from image feature matching,using a deep learning method to solve the image transformation matrix.The known position of a crater in a reference image is mapped using this matrix to calculate the crater position in the target image.We validate this method using craters near the Lunar Corner Cube Retroreflectors of Apollo 15 and Luna 17 and find that the calculated position of a crater on the target image falls on the center of the crater,even for image features with large distortion near the lunar limb.The maximum image matching error is approximately 1″,and the minimum is only 0.47″,which meets the pointing requirements of Lunar Laser Ranging.This method provides a new technical means for the high-precision pointing bias calculation of the Lunar Laser Ranging system.展开更多
Based on the inertial navigation system, the influences of the excursion of the inertial navigation system and the measurement error of the wireless pressure altimeter on the rotation and scale of the real image are q...Based on the inertial navigation system, the influences of the excursion of the inertial navigation system and the measurement error of the wireless pressure altimeter on the rotation and scale of the real image are quantitatively analyzed in scene matching. The log-polar transform （LPT） is utilized and an anti-rotation and anti- scale image matching algorithm is proposed based on the image edge feature point extraction. In the algorithm, the center point is combined with its four-neighbor points, and the corresponding computing process is put forward. Simulation results show that in the image rotation and scale variation range resulted from the navigation system error and the measurement error of the wireless pressure altimeter, the proposed image matching algo- rithm can satisfy the accuracy demands of the scene aided navigation system and provide the location error-correcting information of the system.展开更多
In feature based image matching,distinctive features in images are detected and represented by feature descriptors.Matching is then carried out by assessing the similarity of the descriptors of potentially conjugate p...In feature based image matching,distinctive features in images are detected and represented by feature descriptors.Matching is then carried out by assessing the similarity of the descriptors of potentially conjugate points.In this paper,we first shortly discuss the general frame-work.Then,we review feature detection as well as the determination of affine shape and orientation of local features,before analyzing feature description in more detail.In the feature description review,the general framework of local feature description is presented first.Then,the review discusses the evolution from hand-crafted feature descriptors,e.g.SIFT(Scale Invariant Feature Transform),to machine learning and deep learning based descriptors.The machine learning models,the training loss and the respective training data of learning-based algorithms are looked at in more detail;subsequently the various advantages and challenges of the different approaches are discussed.Finally,we present and assess some current research directions before concluding the paper.展开更多
Fusion methods based on multi-scale transforms have become the mainstream of the pixel-level image fusion. However,most of these methods cannot fully exploit spatial domain information of source images, which lead to ...Fusion methods based on multi-scale transforms have become the mainstream of the pixel-level image fusion. However,most of these methods cannot fully exploit spatial domain information of source images, which lead to the degradation of image.This paper presents a fusion framework based on block-matching and 3D(BM3D) multi-scale transform. The algorithm first divides the image into different blocks and groups these 2D image blocks into 3D arrays by their similarity. Then it uses a 3D transform which consists of a 2D multi-scale and a 1D transform to transfer the arrays into transform coefficients, and then the obtained low-and high-coefficients are fused by different fusion rules. The final fused image is obtained from a series of fused 3D image block groups after the inverse transform by using an aggregation process. In the experimental part, we comparatively analyze some existing algorithms and the using of different transforms, e.g. non-subsampled Contourlet transform(NSCT), non-subsampled Shearlet transform(NSST), in the 3D transform step. Experimental results show that the proposed fusion framework can not only improve subjective visual effect, but also obtain better objective evaluation criteria than state-of-the-art methods.展开更多
A novel algorithm is presented to make the results of image matching more reliable and accurate based on SIFT (Scale Invariant Feature Transform). SIFT algorithm has been identified as the most resistant matching algo...A novel algorithm is presented to make the results of image matching more reliable and accurate based on SIFT (Scale Invariant Feature Transform). SIFT algorithm has been identified as the most resistant matching algorithm to common image deformations; however, if there are similar regions in images, SIFT algorithm still generates some analogical descriptors and provides many mismatches. This paper examines the local image descriptor used by SIFT and presents a new algorithm by integrating SIFT with two-dimensional moment invariants and disparity gradient to improve the matching results. In the new algorithm, decision tree is used, and the whole matching process is divided into three levels with different primitives. Matching points are considered as correct ones only when they satisfy all the three similarity measurements. Experiment results demonstrate that the new approach is more reliable and accurate.展开更多
Image matching technology is theoretically significant and practically promising in the field of autonomous navigation.Addressing shortcomings of existing image matching navigation technologies,the concept of high-dim...Image matching technology is theoretically significant and practically promising in the field of autonomous navigation.Addressing shortcomings of existing image matching navigation technologies,the concept of high-dimensional combined feature is presented based on sequence image matching navigation.To balance between the distribution of high-dimensional combined features and the shortcomings of the only use of geometric relations,we propose a method based on Delaunay triangulation to improve the feature,and add the regional characteristics of the features together with their geometric characteristics.Finally,k-nearest neighbor(KNN)algorithm is adopted to optimize searching process.Simulation results show that the matching can be realized at the rotation angle of-8°to 8°and the scale factor of 0.9 to 1.1,and when the image size is 160 pixel×160 pixel,the matching time is less than 0.5 s.Therefore,the proposed algorithm can substantially reduce computational complexity,improve the matching speed,and exhibit robustness to the rotation and scale changes.展开更多
In view of the fact that the traditional Hausdorff image matching algorithm is very sensitive to the image size as well as the unsatisfactory real-time performance in practical applications,an image matching algorithm...In view of the fact that the traditional Hausdorff image matching algorithm is very sensitive to the image size as well as the unsatisfactory real-time performance in practical applications,an image matching algorithm is proposed based on the combination of Yolov3.Firstly,the features of the reference image are selected for pretraining,and then the training results are used to extract the features of the real images before the coordinates of the center points of the feature area are used to complete the coarse matching.Finally,the Hausdorff algorithm is used to complete the fine image matching.Experiments show that the proposed algorithm significantly improves the speed and accuracy of image matching.Also,it is robust to rotation changes.展开更多
For the purpose of identifying the stern of the SWATH （Small Waterplane Area Twin Hull） availably and perfecting the detection technique of the SWATH ship＇s performance, this paper presents a novel bidirectional im...For the purpose of identifying the stern of the SWATH （Small Waterplane Area Twin Hull） availably and perfecting the detection technique of the SWATH ship＇s performance, this paper presents a novel bidirectional image registration strategy and mosaicing technique based on the scale invariant feature transform （SIFT） algorithm. The proposed method can help us observe the stern with a great visual angle for analyzing the performance of the control fins of the SWATH. SIFT is one of the most effective local features of the scale, rotation and illumination invariant. However, there are a few false match rates in this algorithm. In terms of underwater machine vision, only by acquiring an accurate match rate can we find an underwater robot rapidly and identify the location of the object. Therefore, firstly, the selection of the match ratio principle is put forward in this paper; secondly, some advantages of the bidirectional registration algorithm are concluded by analyzing the characteristics of the unidirectional matching method. Finally, an automatic underwater image splicing method is proposed on the basis of fixed dimension, and then the edge of the image＇s overlapping section is merged by the principal components analysis algorithm. The experimental results achieve a better registration and smooth mosaicing effect, demonstrating that the proposed method is effective.展开更多
Histogram of collinear gradient-enhanced coding （HCGEC）, a robust key point descriptor for multi-spectral image matching, is proposed. The HCGEC mainly encodes rough structures within an image and suppresses detaile...Histogram of collinear gradient-enhanced coding （HCGEC）, a robust key point descriptor for multi-spectral image matching, is proposed. The HCGEC mainly encodes rough structures within an image and suppresses detailed textural information, which is desirable in multi-spectral image matching. Experiments on two multi-spectral data sets demonstrate that the proposed descriptor can yield significantly better results than some state-of- the-art descriptors.展开更多
Automatic and robust matching of multi-modal images can be challenging owing to the nonlinear intensity differences caused by radiometric variations among these images.To address this problem,a novel dense feature des...Automatic and robust matching of multi-modal images can be challenging owing to the nonlinear intensity differences caused by radiometric variations among these images.To address this problem,a novel dense feature descriptor and improved similarity measure are proposed for enhancing the matching performance.The proposed descriptor is built on a voting scheme of structure tensor that can effectively capture the geometric structural properties of images.It is not only illumination and contrast invariant but also robust against the degradation caused by significant noise.Further,the similarity measure is improved to adapt to the reversal of orientation caused by the intensity inversion between multi-modal images.The proposed dense feature descriptor and improved similarity measure enable the development of a robust and practical templatematching algorithm for multi-modal images.We verify the proposed algorithm with a broad range of multi-modal images including optical,infrared,Synthetic Aperture Radar(SAR),digital surface model,and map data.The experimental results confirm its superiority to the state-of-the-art methods.展开更多
Targeting at a reliable image matching of multiple remote sensing images for the generation of digital surface models,this paper presents a geometric-constrained multi-view image matching method,based on an energy min...Targeting at a reliable image matching of multiple remote sensing images for the generation of digital surface models,this paper presents a geometric-constrained multi-view image matching method,based on an energy minimization framework.By employing a geometrical constraint,the cost value of the energy function was calculated from multiple images,and the cost value was aggregated in an image space using a semi-global optimization approach.A homography transform parameter calculation method is proposed for fast calculation of projection pixel on each image when calculation cost values.It is based on the known interior orientation parameters,exterior orientation parameters,and a given elevation value.For an efficient and reliable processing of multiple remote sensing images,the proposed matching method was performed via a coarse-to-fine strategy through image pyramid.Three sets of airborne remote sensing images were used to evaluate the performance of the proposed method.Results reveal that the multi-view image matching can improve matching reliability.Moreover,the experimental results show that the proposed method performs better than traditional methods.展开更多
Due to requirements and necessities in digital image research, image matching is considered as a key, essential and complicating point especially for machine learning. According to its convenience and facility, the mo...Due to requirements and necessities in digital image research, image matching is considered as a key, essential and complicating point especially for machine learning. According to its convenience and facility, the most applied algorithm for image feature point extraction and matching is Speeded-Up Robust Feature (SURF). The enhancement for scale invariant feature transform (SIFT) algorithm promotes the effectiveness of the algorithm as well as facilitates the possibility, while the application of the algorithm is being applied in a present time computer vision system. In this research work, the aim of SURF algorithm is to extract image features, and we have incorporated RANSAC algorithm to filter matching points. The images were juxtaposed and asserted experiments utilizing pertinent image improvement methods. The idea based on merging improvement technology through SURF algorithm is put forward to get better quality of feature points matching the efficiency and appropriate image improvement methods are adopted for different feature images which are compared and verified by experiments. Some results have been explained there which are the effects of lighting on the underexposed and overexposed images.展开更多
Image matching based on scale invariant feature transform（SIFT） is one of the most popular image matching algorithms, which exhibits high robustness and accuracy. Grayscale images rather than color images are genera...Image matching based on scale invariant feature transform（SIFT） is one of the most popular image matching algorithms, which exhibits high robustness and accuracy. Grayscale images rather than color images are generally used to get SIFT descriptors in order to reduce the complexity. The regions which have a similar grayscale level but different hues tend to produce wrong matching results in this case. Therefore, the loss of color information may result in decreasing of matching ratio. An image matching algorithm based on SIFT is proposed, which adds a color offset and an exposure offset when converting color images to grayscale images in order to enhance the matching ratio. Experimental results show that the proposed algorithm can effectively differentiate the regions with different colors but the similar grayscale level, and increase the matching ratio of image matching based on SIFT. Furthermore, it does not introduce much complexity than the traditional SIFT.展开更多
To improve the performance of the scale invariant feature transform （ SIFT）, a modified SIFT （M-SIFT） descriptor is proposed to realize fast and robust key-point extraction and matching. In descriptor generation, ...To improve the performance of the scale invariant feature transform （ SIFT）, a modified SIFT （M-SIFT） descriptor is proposed to realize fast and robust key-point extraction and matching. In descriptor generation, 3 rotation-invariant concentric-ring grids around the key-point location are used instead of 16 square grids used in the original SIFT. Then, 10 orientations are accumulated for each grid, which results in a 30-dimension descriptor. In descriptor matching, rough rejection mismatches is proposed based on the difference of grey information between matching points. The per- formance of the proposed method is tested for image mosaic on simulated and real-worid images. Experimental results show that the M-SIFT descriptor inherits the SIFT＇ s ability of being invariant to image scale and rotation, illumination change and affine distortion. Besides the time cost of feature extraction is reduced by 50% compared with the original SIFT. And the rough rejection mismatches can reject at least 70% of mismatches. The results also demonstrate that the performance of the pro- posed M-SIFT method is superior to other improved SIFT methods in speed and robustness.展开更多
A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. F...A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. First, it iteratively finds an approximation by selecting M atoms instead of one at a time. Second, the inner product computations are confined within only a fraction of dictionary atoms at each iteration. The modifications are implemented very efficiently due to the spatial incoherence of the dictionary. Experimental results show that compared with full search matching pursuit, the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality.展开更多
To obtain the sparse decomposition and flexible representation of traffic images,this paper proposes a fast matching pursuit for traffic images using differential evolution. According to the structural features of tra...To obtain the sparse decomposition and flexible representation of traffic images,this paper proposes a fast matching pursuit for traffic images using differential evolution. According to the structural features of traffic images,the introduced algorithm selects the image atoms in a fast and flexible way from an over-complete image dictionary to adaptively match the local structures of traffic images and therefore to implement the sparse decomposition. As compared with the traditional method and a genetic algorithm of matching pursuit by using extensive experiments,the differential evolution achieves much higher quality of traffic images with much less computational time,which indicates the effectiveness of the proposed algorithm.展开更多
Three-dimensional(3D)reconstruction based on aerial images has broad prospects,and feature matching is an important step of it.However,for high-resolution aerial images,there are usually problems such as long time,mis...Three-dimensional(3D)reconstruction based on aerial images has broad prospects,and feature matching is an important step of it.However,for high-resolution aerial images,there are usually problems such as long time,mismatching and sparse feature pairs using traditional algorithms.Therefore,an algorithm is proposed to realize fast,accurate and dense feature matching.The algorithm consists of four steps.Firstly,we achieve a balance between the feature matching time and the number of matching pairs by appropriately reducing the image resolution.Secondly,to realize further screening of the mismatches,a feature screening algorithm based on similarity judgment or local optimization is proposed.Thirdly,to make the algorithm more widely applicable,we combine the results of different algorithms to get dense results.Finally,all matching feature pairs in the low-resolution images are restored to the original images.Comparisons between the original algorithms and our algorithm show that the proposed algorithm can effectively reduce the matching time,screen out the mismatches,and improve the number of matches.展开更多
Multi-modal image matching is crucial in aerospace applications because it can fully exploit the complementary and valuable information contained in the amount and diversity of remote sensing images.However,it remains...Multi-modal image matching is crucial in aerospace applications because it can fully exploit the complementary and valuable information contained in the amount and diversity of remote sensing images.However,it remains a challenging task due to significant non-linear radiometric,geometric differences,and noise across different sensors.To improve the performance of heterologous image matching,this paper proposes a normalized self-similarity region descriptor to extract consistent structural information.We first construct the pointwise self-similarity region descriptor based on the Euclidean distance between adjacent image blocks to reflect the structural properties of multi-modal images.Then,a linear normalization approach is used to form Modality Independent Region Descriptor(MIRD),which can effectively distinguish structural features such as points,lines,corners,and flat between multi-modal images.To further improve the matching accuracy,the included angle cosine similarity metric is adopted to exploit the directional vector information of multi-dimensional feature descriptors.The experimental results show that the proposed MIRD has better matching accuracy and robustness for various multi-modal image matching than the state-of-the-art methods.MIRD can effectively extract consistent geometric structure features and suppress the influence of SAR speckle noise using non-local neighboring image blocks operation,effectively applied to various multi-modal image matching.展开更多
Augmented solar images were used to research the adaptability of four representative image extraction and matching algorithms in space weather domain.These include the scale-invariant feature transform algorithm,speed...Augmented solar images were used to research the adaptability of four representative image extraction and matching algorithms in space weather domain.These include the scale-invariant feature transform algorithm,speeded-up robust features algorithm,binary robust invariant scalable keypoints algorithm,and oriented fast and rotated brief algorithm.The performance of these algorithms was estimated in terms of matching accuracy,feature point richness,and running time.The experiment result showed that no algorithm achieved high accuracy while keeping low running time,and all algorithms are not suitable for image feature extraction and matching of augmented solar images.To solve this problem,an improved method was proposed by using two-frame matching to utilize the accuracy advantage of the scale-invariant feature transform algorithm and the speed advantage of the oriented fast and rotated brief algorithm.Furthermore,our method and the four representative algorithms were applied to augmented solar images.Our application experiments proved that our method achieved a similar high recognition rate to the scale-invariant feature transform algorithm which is significantly higher than other algorithms.Our method also obtained a similar low running time to the oriented fast and rotated brief algorithm,which is significantly lower than other algorithms.展开更多
In photogrammetry and remote sensing,image matching is a basic and crucial process for automatic DEM generation.In this paper we presented a image relaxation matching method based on feature points.This method can be ...In photogrammetry and remote sensing,image matching is a basic and crucial process for automatic DEM generation.In this paper we presented a image relaxation matching method based on feature points.This method can be considered as an extention of regular grid point based matching.It avoids the shortcome of grid point based matching.For example,with this method,we can avoid low or even no texture area where errors frequently appear in cross correlaton matching.In the mean while,it makes full use of some mature techniques such as probability relaxation,image pyramid and the like which have already been successfully used in grid point matching process.Application of the technique to DEM generaton in different regions proved that it is more reasonable and reliable.展开更多
基金funded by Natural Science Foundation of Jilin Province(20220101125JC)the National Natural Science Foundation of China(12273079).
文摘Lunar Laser Ranging has extremely high requirements for the pointing accuracy of the telescopes used.To improve its pointing accuracy and solve the problem of insufficiently accurate telescope pointing correction achieved by tracking stars in the all-sky region,we propose a processing scheme to select larger-sized lunar craters near the Lunar Corner Cube Retroreflector as reference features for telescope pointing bias computation.Accurately determining the position of the craters in the images is crucial for calculating the pointing bias;therefore,we propose a method for accurately calculating the crater position based on lunar surface feature matching.This method uses matched feature points obtained from image feature matching,using a deep learning method to solve the image transformation matrix.The known position of a crater in a reference image is mapped using this matrix to calculate the crater position in the target image.We validate this method using craters near the Lunar Corner Cube Retroreflectors of Apollo 15 and Luna 17 and find that the calculated position of a crater on the target image falls on the center of the crater,even for image features with large distortion near the lunar limb.The maximum image matching error is approximately 1″,and the minimum is only 0.47″,which meets the pointing requirements of Lunar Laser Ranging.This method provides a new technical means for the high-precision pointing bias calculation of the Lunar Laser Ranging system.
文摘Based on the inertial navigation system, the influences of the excursion of the inertial navigation system and the measurement error of the wireless pressure altimeter on the rotation and scale of the real image are quantitatively analyzed in scene matching. The log-polar transform （LPT） is utilized and an anti-rotation and anti- scale image matching algorithm is proposed based on the image edge feature point extraction. In the algorithm, the center point is combined with its four-neighbor points, and the corresponding computing process is put forward. Simulation results show that in the image rotation and scale variation range resulted from the navigation system error and the measurement error of the wireless pressure altimeter, the proposed image matching algo- rithm can satisfy the accuracy demands of the scene aided navigation system and provide the location error-correcting information of the system.
基金The authors would like to thank NVIDIA Corp.for donating the GPU used in this research through its GPU grant program.The first author Lin Chen would also like to thank the China Scholarship Council(CSC)for financially supporting his PhD study.
文摘In feature based image matching,distinctive features in images are detected and represented by feature descriptors.Matching is then carried out by assessing the similarity of the descriptors of potentially conjugate points.In this paper,we first shortly discuss the general frame-work.Then,we review feature detection as well as the determination of affine shape and orientation of local features,before analyzing feature description in more detail.In the feature description review,the general framework of local feature description is presented first.Then,the review discusses the evolution from hand-crafted feature descriptors,e.g.SIFT(Scale Invariant Feature Transform),to machine learning and deep learning based descriptors.The machine learning models,the training loss and the respective training data of learning-based algorithms are looked at in more detail;subsequently the various advantages and challenges of the different approaches are discussed.Finally,we present and assess some current research directions before concluding the paper.
基金supported by the National Natural Science Foundation of China(6157206361401308)+6 种基金the Fundamental Research Funds for the Central Universities(2016YJS039)the Natural Science Foundation of Hebei Province(F2016201142F2016201187)the Natural Social Foundation of Hebei Province(HB15TQ015)the Science Research Project of Hebei Province(QN2016085ZC2016040)the Natural Science Foundation of Hebei University(2014-303)
文摘Fusion methods based on multi-scale transforms have become the mainstream of the pixel-level image fusion. However,most of these methods cannot fully exploit spatial domain information of source images, which lead to the degradation of image.This paper presents a fusion framework based on block-matching and 3D(BM3D) multi-scale transform. The algorithm first divides the image into different blocks and groups these 2D image blocks into 3D arrays by their similarity. Then it uses a 3D transform which consists of a 2D multi-scale and a 1D transform to transfer the arrays into transform coefficients, and then the obtained low-and high-coefficients are fused by different fusion rules. The final fused image is obtained from a series of fused 3D image block groups after the inverse transform by using an aggregation process. In the experimental part, we comparatively analyze some existing algorithms and the using of different transforms, e.g. non-subsampled Contourlet transform(NSCT), non-subsampled Shearlet transform(NSST), in the 3D transform step. Experimental results show that the proposed fusion framework can not only improve subjective visual effect, but also obtain better objective evaluation criteria than state-of-the-art methods.
文摘A novel algorithm is presented to make the results of image matching more reliable and accurate based on SIFT (Scale Invariant Feature Transform). SIFT algorithm has been identified as the most resistant matching algorithm to common image deformations; however, if there are similar regions in images, SIFT algorithm still generates some analogical descriptors and provides many mismatches. This paper examines the local image descriptor used by SIFT and presents a new algorithm by integrating SIFT with two-dimensional moment invariants and disparity gradient to improve the matching results. In the new algorithm, decision tree is used, and the whole matching process is divided into three levels with different primitives. Matching points are considered as correct ones only when they satisfy all the three similarity measurements. Experiment results demonstrate that the new approach is more reliable and accurate.
基金supported by the National Natural Science Foundations of China(Nos.51205193,51475221)
文摘Image matching technology is theoretically significant and practically promising in the field of autonomous navigation.Addressing shortcomings of existing image matching navigation technologies,the concept of high-dimensional combined feature is presented based on sequence image matching navigation.To balance between the distribution of high-dimensional combined features and the shortcomings of the only use of geometric relations,we propose a method based on Delaunay triangulation to improve the feature,and add the regional characteristics of the features together with their geometric characteristics.Finally,k-nearest neighbor(KNN)algorithm is adopted to optimize searching process.Simulation results show that the matching can be realized at the rotation angle of-8°to 8°and the scale factor of 0.9 to 1.1,and when the image size is 160 pixel×160 pixel,the matching time is less than 0.5 s.Therefore,the proposed algorithm can substantially reduce computational complexity,improve the matching speed,and exhibit robustness to the rotation and scale changes.
基金supported by the Foundation of Graduate Innovation Center in Nanjing University of Aeronautics and Astronautics(No.kfjj20191506)。
文摘In view of the fact that the traditional Hausdorff image matching algorithm is very sensitive to the image size as well as the unsatisfactory real-time performance in practical applications,an image matching algorithm is proposed based on the combination of Yolov3.Firstly,the features of the reference image are selected for pretraining,and then the training results are used to extract the features of the real images before the coordinates of the center points of the feature area are used to complete the coarse matching.Finally,the Hausdorff algorithm is used to complete the fine image matching.Experiments show that the proposed algorithm significantly improves the speed and accuracy of image matching.Also,it is robust to rotation changes.
基金Supported by the "Liaoning Baiqianwan" Talents Program(No.200718625)the Program of Scientific Research Project of Liao Ning Province Education Commission(No.LS2010046)the National Commonweal Industry Scientific Research Project(No.201003024)
文摘For the purpose of identifying the stern of the SWATH （Small Waterplane Area Twin Hull） availably and perfecting the detection technique of the SWATH ship＇s performance, this paper presents a novel bidirectional image registration strategy and mosaicing technique based on the scale invariant feature transform （SIFT） algorithm. The proposed method can help us observe the stern with a great visual angle for analyzing the performance of the control fins of the SWATH. SIFT is one of the most effective local features of the scale, rotation and illumination invariant. However, there are a few false match rates in this algorithm. In terms of underwater machine vision, only by acquiring an accurate match rate can we find an underwater robot rapidly and identify the location of the object. Therefore, firstly, the selection of the match ratio principle is put forward in this paper; secondly, some advantages of the bidirectional registration algorithm are concluded by analyzing the characteristics of the unidirectional matching method. Finally, an automatic underwater image splicing method is proposed on the basis of fixed dimension, and then the edge of the image＇s overlapping section is merged by the principal components analysis algorithm. The experimental results achieve a better registration and smooth mosaicing effect, demonstrating that the proposed method is effective.
文摘Histogram of collinear gradient-enhanced coding （HCGEC）, a robust key point descriptor for multi-spectral image matching, is proposed. The HCGEC mainly encodes rough structures within an image and suppresses detailed textural information, which is desirable in multi-spectral image matching. Experiments on two multi-spectral data sets demonstrate that the proposed descriptor can yield significantly better results than some state-of- the-art descriptors.
基金supported by the National Natural Science Foundations of China(No.61802423)the Natural Science Foundation of Hunan Province,China(No.2019JJ50739)。
文摘Automatic and robust matching of multi-modal images can be challenging owing to the nonlinear intensity differences caused by radiometric variations among these images.To address this problem,a novel dense feature descriptor and improved similarity measure are proposed for enhancing the matching performance.The proposed descriptor is built on a voting scheme of structure tensor that can effectively capture the geometric structural properties of images.It is not only illumination and contrast invariant but also robust against the degradation caused by significant noise.Further,the similarity measure is improved to adapt to the reversal of orientation caused by the intensity inversion between multi-modal images.The proposed dense feature descriptor and improved similarity measure enable the development of a robust and practical templatematching algorithm for multi-modal images.We verify the proposed algorithm with a broad range of multi-modal images including optical,infrared,Synthetic Aperture Radar(SAR),digital surface model,and map data.The experimental results confirm its superiority to the state-of-the-art methods.
基金This work was supported by the National Key Research and Development Program of China[grant number 2017YFC0803802]and the National Natural Science Foundation of China[grant number 41771486].
文摘Targeting at a reliable image matching of multiple remote sensing images for the generation of digital surface models,this paper presents a geometric-constrained multi-view image matching method,based on an energy minimization framework.By employing a geometrical constraint,the cost value of the energy function was calculated from multiple images,and the cost value was aggregated in an image space using a semi-global optimization approach.A homography transform parameter calculation method is proposed for fast calculation of projection pixel on each image when calculation cost values.It is based on the known interior orientation parameters,exterior orientation parameters,and a given elevation value.For an efficient and reliable processing of multiple remote sensing images,the proposed matching method was performed via a coarse-to-fine strategy through image pyramid.Three sets of airborne remote sensing images were used to evaluate the performance of the proposed method.Results reveal that the multi-view image matching can improve matching reliability.Moreover,the experimental results show that the proposed method performs better than traditional methods.
文摘Due to requirements and necessities in digital image research, image matching is considered as a key, essential and complicating point especially for machine learning. According to its convenience and facility, the most applied algorithm for image feature point extraction and matching is Speeded-Up Robust Feature (SURF). The enhancement for scale invariant feature transform (SIFT) algorithm promotes the effectiveness of the algorithm as well as facilitates the possibility, while the application of the algorithm is being applied in a present time computer vision system. In this research work, the aim of SURF algorithm is to extract image features, and we have incorporated RANSAC algorithm to filter matching points. The images were juxtaposed and asserted experiments utilizing pertinent image improvement methods. The idea based on merging improvement technology through SURF algorithm is put forward to get better quality of feature points matching the efficiency and appropriate image improvement methods are adopted for different feature images which are compared and verified by experiments. Some results have been explained there which are the effects of lighting on the underexposed and overexposed images.
基金supported by the National Natural Science Foundation of China(61271315)the State Scholarship Fund of China
文摘Image matching based on scale invariant feature transform（SIFT） is one of the most popular image matching algorithms, which exhibits high robustness and accuracy. Grayscale images rather than color images are generally used to get SIFT descriptors in order to reduce the complexity. The regions which have a similar grayscale level but different hues tend to produce wrong matching results in this case. Therefore, the loss of color information may result in decreasing of matching ratio. An image matching algorithm based on SIFT is proposed, which adds a color offset and an exposure offset when converting color images to grayscale images in order to enhance the matching ratio. Experimental results show that the proposed algorithm can effectively differentiate the regions with different colors but the similar grayscale level, and increase the matching ratio of image matching based on SIFT. Furthermore, it does not introduce much complexity than the traditional SIFT.
基金Supported by the National Natural Science Foundation of China(60905012)
文摘To improve the performance of the scale invariant feature transform （ SIFT）, a modified SIFT （M-SIFT） descriptor is proposed to realize fast and robust key-point extraction and matching. In descriptor generation, 3 rotation-invariant concentric-ring grids around the key-point location are used instead of 16 square grids used in the original SIFT. Then, 10 orientations are accumulated for each grid, which results in a 30-dimension descriptor. In descriptor matching, rough rejection mismatches is proposed based on the difference of grey information between matching points. The per- formance of the proposed method is tested for image mosaic on simulated and real-worid images. Experimental results show that the M-SIFT descriptor inherits the SIFT＇ s ability of being invariant to image scale and rotation, illumination change and affine distortion. Besides the time cost of feature extraction is reduced by 50% compared with the original SIFT. And the rough rejection mismatches can reject at least 70% of mismatches. The results also demonstrate that the performance of the pro- posed M-SIFT method is superior to other improved SIFT methods in speed and robustness.
文摘A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. First, it iteratively finds an approximation by selecting M atoms instead of one at a time. Second, the inner product computations are confined within only a fraction of dictionary atoms at each iteration. The modifications are implemented very efficiently due to the spatial incoherence of the dictionary. Experimental results show that compared with full search matching pursuit, the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality.
文摘To obtain the sparse decomposition and flexible representation of traffic images,this paper proposes a fast matching pursuit for traffic images using differential evolution. According to the structural features of traffic images,the introduced algorithm selects the image atoms in a fast and flexible way from an over-complete image dictionary to adaptively match the local structures of traffic images and therefore to implement the sparse decomposition. As compared with the traditional method and a genetic algorithm of matching pursuit by using extensive experiments,the differential evolution achieves much higher quality of traffic images with much less computational time,which indicates the effectiveness of the proposed algorithm.
基金This work was supported by the Equipment Pre-Research Foundation of China(6140001020310).
文摘Three-dimensional(3D)reconstruction based on aerial images has broad prospects,and feature matching is an important step of it.However,for high-resolution aerial images,there are usually problems such as long time,mismatching and sparse feature pairs using traditional algorithms.Therefore,an algorithm is proposed to realize fast,accurate and dense feature matching.The algorithm consists of four steps.Firstly,we achieve a balance between the feature matching time and the number of matching pairs by appropriately reducing the image resolution.Secondly,to realize further screening of the mismatches,a feature screening algorithm based on similarity judgment or local optimization is proposed.Thirdly,to make the algorithm more widely applicable,we combine the results of different algorithms to get dense results.Finally,all matching feature pairs in the low-resolution images are restored to the original images.Comparisons between the original algorithms and our algorithm show that the proposed algorithm can effectively reduce the matching time,screen out the mismatches,and improve the number of matches.
基金supported by the National Natural Science Foundation of China,China(No.61801491)。
文摘Multi-modal image matching is crucial in aerospace applications because it can fully exploit the complementary and valuable information contained in the amount and diversity of remote sensing images.However,it remains a challenging task due to significant non-linear radiometric,geometric differences,and noise across different sensors.To improve the performance of heterologous image matching,this paper proposes a normalized self-similarity region descriptor to extract consistent structural information.We first construct the pointwise self-similarity region descriptor based on the Euclidean distance between adjacent image blocks to reflect the structural properties of multi-modal images.Then,a linear normalization approach is used to form Modality Independent Region Descriptor(MIRD),which can effectively distinguish structural features such as points,lines,corners,and flat between multi-modal images.To further improve the matching accuracy,the included angle cosine similarity metric is adopted to exploit the directional vector information of multi-dimensional feature descriptors.The experimental results show that the proposed MIRD has better matching accuracy and robustness for various multi-modal image matching than the state-of-the-art methods.MIRD can effectively extract consistent geometric structure features and suppress the influence of SAR speckle noise using non-local neighboring image blocks operation,effectively applied to various multi-modal image matching.
基金Supported by the Key Research Program of the Chinese Academy of Sciences(ZDRE-KT-2021-3)。
文摘Augmented solar images were used to research the adaptability of four representative image extraction and matching algorithms in space weather domain.These include the scale-invariant feature transform algorithm,speeded-up robust features algorithm,binary robust invariant scalable keypoints algorithm,and oriented fast and rotated brief algorithm.The performance of these algorithms was estimated in terms of matching accuracy,feature point richness,and running time.The experiment result showed that no algorithm achieved high accuracy while keeping low running time,and all algorithms are not suitable for image feature extraction and matching of augmented solar images.To solve this problem,an improved method was proposed by using two-frame matching to utilize the accuracy advantage of the scale-invariant feature transform algorithm and the speed advantage of the oriented fast and rotated brief algorithm.Furthermore,our method and the four representative algorithms were applied to augmented solar images.Our application experiments proved that our method achieved a similar high recognition rate to the scale-invariant feature transform algorithm which is significantly higher than other algorithms.Our method also obtained a similar low running time to the oriented fast and rotated brief algorithm,which is significantly lower than other algorithms.
基金Funded by the Open Researeh Fund Program of the Geomatics and Applications Laboratory,Liaoning Technical University(No.2004010).
文摘In photogrammetry and remote sensing,image matching is a basic and crucial process for automatic DEM generation.In this paper we presented a image relaxation matching method based on feature points.This method can be considered as an extention of regular grid point based matching.It avoids the shortcome of grid point based matching.For example,with this method,we can avoid low or even no texture area where errors frequently appear in cross correlaton matching.In the mean while,it makes full use of some mature techniques such as probability relaxation,image pyramid and the like which have already been successfully used in grid point matching process.Application of the technique to DEM generaton in different regions proved that it is more reasonable and reliable.
