scholarly journals A Line Matching Method Based on Multiple Intensity Ordering with Uniformly Spaced Sampling

Sensors ◽  
2020 ◽  
Vol 20 (6) ◽  
pp. 1639 ◽  
Author(s):  
Jing Xing ◽  
Zhenzhong Wei ◽  
Guangjun Zhang
Keyword(s):  
Experimental Results ◽  
Superior Performance ◽  
Feature Descriptor ◽  
Image Pyramid ◽  
Matching Method ◽  
Concentric Ring ◽  
Line Segments ◽  
Illumination Changes ◽  
Public Datasets ◽  
Local Feature Descriptor

This paper presents a line matching method based on multiple intensity ordering with uniformly spaced sampling. Line segments are extracted from the image pyramid, with the aim of adapting scale changes and addressing fragmentation problem. The neighborhood of line segments was divided into sub-regions adaptively according to intensity order to overcome the difficulty brought by various line lengths. An intensity-based local feature descriptor was introduced by constructing multiple concentric ring-shaped structures. The dimension of the descriptor was reduced significantly by uniformly spaced sampling and dividing sample points into several point sets while improving the discriminability. The performance of the proposed method was tested on public datasets which cover various scenarios and compared with another two well-known line matching algorithms. The experimental results show that our method achieves superior performance dealing with various image deformations, especially scale changes and large illumination changes, and provides much more reliable correspondences.

Local feature descriptor invariant to monotonic illumination changes

2016 ◽  
Vol 25 (1) ◽  
pp. 013023 ◽  
Author(s):  
Pu Yan ◽  
Dong Liang ◽  
Jun Tang ◽  
Ming Zhu
Keyword(s):  
Local Feature ◽  
Feature Descriptor ◽  
Illumination Changes ◽  
Local Feature Descriptor

Mining discriminative patches for script identification in natural scene images

2021 ◽  
Vol 40 (1) ◽  
pp. 551-563
Author(s):  
Liqiong Lu ◽  
Dong Wu ◽  
Ziwei Tang ◽  
Yaohua Yi ◽  
Faliang Huang
Keyword(s):  
Neural Networks ◽  
Experimental Results ◽  
The Other ◽  
Natural Scene ◽  
Fixed Size ◽  
Script Identification ◽  
Aspect Ratios ◽  
Novel Approach ◽  
Public Datasets ◽  
Natural Scene Images

This paper focuses on script identification in natural scene images. Traditional CNNs (Convolution Neural Networks) cannot solve this problem perfectly for two reasons: one is the arbitrary aspect ratios of scene images which bring much difficulty to traditional CNNs with a fixed size image as the input. And the other is that some scripts with minor differences are easily confused because they share a subset of characters with the same shapes. We propose a novel approach combing Score CNN, Attention CNN and patches. Attention CNN is utilized to determine whether a patch is a discriminative patch and calculate the contribution weight of the discriminative patch to script identification of the whole image. Score CNN uses a discriminative patch as input and predict the score of each script type. Firstly patches with the same size are extracted from the scene images. Secondly these patches are used as inputs to Score CNN and Attention CNN to train two patch-level classifiers. Finally, the results of multiple discriminative patches extracted from the same image via the above two classifiers are fused to obtain the script type of this image. Using patches with the same size as inputs to CNN can avoid the problems caused by arbitrary aspect ratios of scene images. The trained classifiers can mine discriminative patches to accurately identify some confusing scripts. The experimental results show the good performance of our approach on four public datasets.

scholarly journals PCDRN: Progressive Cascade Deep Residual Network for Pansharpening

2020 ◽  
Vol 12 (4) ◽  
pp. 676 ◽  
Author(s):  
Yong Yang ◽  
Wei Tu ◽  
Shuying Huang ◽  
Hangyuan Lu
Keyword(s):  
High Resolution ◽  
Loss Function ◽  
High Frequency ◽  
Experimental Results ◽  
Superior Performance ◽  
Residual Network ◽  
High Quality ◽  
Convolution Approach ◽  
Visual Assessments ◽  
Coarse To Fine

Pansharpening is the process of fusing a low-resolution multispectral (LRMS) image with a high-resolution panchromatic (PAN) image. In the process of pansharpening, the LRMS image is often directly upsampled by a scale of 4, which may result in the loss of high-frequency details in the fused high-resolution multispectral (HRMS) image. To solve this problem, we put forward a novel progressive cascade deep residual network (PCDRN) with two residual subnetworks for pansharpening. The network adjusts the size of an MS image to the size of a PAN image twice and gradually fuses the LRMS image with the PAN image in a coarse-to-fine manner. To prevent an overly-smooth phenomenon and achieve high-quality fusion results, a multitask loss function is defined to train our network. Furthermore, to eliminate checkerboard artifacts in the fusion results, we employ a resize-convolution approach instead of transposed convolution for upsampling LRMS images. Experimental results on the Pléiades and WorldView-3 datasets prove that PCDRN exhibits superior performance compared to other popular pansharpening methods in terms of quantitative and visual assessments.

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 Handwritten tifinagh character recognition using simple geometric shapes and graphs

2019 ◽  
Vol 13 (2) ◽  
pp. 598
Author(s):  
Youssef Ouadid ◽  
Abderrahmane Elbalaoui ◽  
Mehdi Boutaounte ◽  
Mohamed Fakir ◽  
Brahim Minaoui
Keyword(s):  
Character Recognition ◽  
Graph Matching ◽  
Recognition Rate ◽  
Recognition System ◽  
Features Extraction ◽  
Experimental Results ◽  
Feature Points ◽  
Matching Method ◽  
Extraction Algorithm ◽  
Novel Algorithm

<p>In this paper, a graph based handwritten Tifinagh character recognition system is presented. In preprocessing Zhang Suen algorithm is enhanced. In features extraction, a novel key point extraction algorithm is presented. Images are then represented by adjacency matrices defining graphs where nodes represent feature points extracted by a novel algorithm. These graphs are classified using a graph matching method. Experimental results are obtained using two databases to test the effectiveness. The system shows good results in terms of recognition rate.</p>

scholarly journals Consistency-Check Edge Refinement for Deep Stereo Matching

2020 ◽  
Author(s):  
Fangrui Wu ◽  
Menglong Yang
Keyword(s):  
Computational Efficiency ◽  
Stereo Matching ◽  
Information Aggregation ◽  
Experimental Results ◽  
Global Information ◽  
Consistency Check ◽  
Filtering Method ◽  
Tightly Coupled ◽  
End To End ◽  
Public Datasets

Recent end-to-end CNN-based stereo matching algorithms obtain disparities through regression from a cost volume, which is formed by concatenating the features of stereo pairs. Some downsampling steps are often embedded in constructing cost volume for global information aggregation and computational efficiency. However, many edge details are hard to recover due to the imprudent upsampling process and ambiguous boundary predictions. To tackle this problem without training another edge prediction sub-network, we developed a novel tightly-coupled edge refinement pipeline composed of two modules. The first module implements a gentle upsampling process by a cascaded cost volume filtering method, aggregating global information without losing many details. On this basis, the second module concentrates on generating a disparity residual map for boundary pixels by sub-pixel disparity consistency check, to further recover the edge details. The experimental results on public datasets demonstrate the effectiveness of the proposed method.

An Efficient Image-Based Method for Detection of Fastener on Railway

2011 ◽  
Vol 346 ◽  
pp. 731-737 ◽  
Author(s):  
Jin Feng Yang ◽  
Man Hua Liu ◽  
Hui Zhao ◽  
Wei Tao
Keyword(s):  
Image Processing ◽  
Efficient Method ◽  
Template Matching ◽  
Detection Method ◽  
Experimental Results ◽  
Feature Descriptor ◽  
Complex Environment ◽  
Computation Efficiency ◽  
The Status ◽  
Direction Field

This paper presents an efficient method to detect the fastener based on the technologies of image processing and optical detection. As feature descriptor, the Direction Field of fastener image is computed for template matching. This fastener detection method can be used to determine the status of fastener on the corresponding track, i.e., whether the fastener is on the track or missing. Experimental results are presented to show that the proposed method is computation efficiency and is robust for fastener detection in complex environment.

Sign in / Sign up

Export Citation Format

Share Document