scholarly journals Range Image Matching for Object Recognition in Real Scene

2004 ◽  
Vol 40 (1) ◽  
pp. 10-17 ◽  
Author(s):  
Kagehiro NAGAO ◽  
Takayuki OKATANI ◽  
Koichiro DEGUCHI
Keyword(s):  
Object Recognition ◽  
Image Matching ◽  
Range Image ◽  
Real Scene

Multi‐image matching for object recognition

2018 ◽  
Vol 12 (3) ◽  
pp. 350-356 ◽  
Author(s):  
Jie Zhu ◽  
Shufang Wu ◽  
Xizhao Wang ◽  
Guoqing Yang ◽  
Liyan Ma
Keyword(s):  
Object Recognition ◽  
Image Matching

scholarly journals A CASE STUDY ON THROUGH-WATER DENSE IMAGE MATCHING

2018 ◽  
Vol XLII-2 ◽  
pp. 659-666 ◽  
Author(s):  
G. Mandlburger
Keyword(s):  
Image Matching ◽  
Water Surface ◽  
Point Clouds ◽  
Water Clarity ◽  
Aerial Images ◽  
Mean Deviation ◽  
Range Image ◽  
Surface Mapping ◽  
Dense Image

In the last years, the tremendous progress in image processing and camera technology has reactivated the interest in photogrammetrybased surface mapping. With the advent of Dense Image Matching (DIM), the derivation of height values on a per-pixel basis became feasible, allowing the derivation of Digital Elevation Models (DEM) with a spatial resolution in the range of the ground sampling distance of the aerial images, which is often below 10 cm today. While mapping topography and vegetation constitutes the primary field of application for image based surface reconstruction, multi-spectral images also allow to see through the water surface to the bottom underneath provided sufficient water clarity. In this contribution, the feasibility of through-water dense image matching for mapping shallow water bathymetry using off-the-shelf software is evaluated. In a case study, the SURE software is applied to three different coastal and inland water bodies. After refraction correction, the DIM point clouds and the DEMs derived thereof are compared to concurrently acquired laser bathymetry data. The results confirm the general suitability of through-water dense image matching, but sufficient bottom texture and favorable environmental conditions (clear water, calm water surface) are a preconditions for achieving accurate results. Water depths of up to 5 m could be mapped with a mean deviation between laser and trough-water DIM in the dm-range. Image based water depth estimates, however, become unreliable in case of turbid or wavy water and poor bottom texture.

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.

scholarly journals Anti-Shake HDR Imaging Using RAW Image Data

Information ◽  
2020 ◽  
Vol 11 (4) ◽  
pp. 213 ◽  
Author(s):  
Yan Liu ◽  
Bingxue Lv ◽  
Wei Huang ◽  
Baohua Jin ◽  
Canlin Li
Keyword(s):  
Dynamic Range ◽  
High Dynamic Range ◽  
Image Sensor ◽  
Image Sequences ◽  
Reference Image ◽  
Imaging Method ◽  
Camera Motion ◽  
Range Image ◽  
Real Scene ◽  
High Dynamic

Camera shaking and object movement can cause the output images to suffer from blurring, noise, and other artifacts, leading to poor image quality and low dynamic range. Raw images contain minimally processed data from the image sensor compared with JPEG images. In this paper, an anti-shake high-dynamic-range imaging method is presented. This method is more robust to camera motion than previous techniques. An algorithm based on information entropy is employed to choose a reference image from the raw image sequence. To further improve the robustness of the proposed method, the Oriented FAST and Rotated BRIEF (ORB) algorithm is adopted to register the inputs, and a simple Laplacian pyramid fusion method is implanted to generate the high-dynamic-range image. Additionally, a large dataset with 435 various exposure image sequences is collected, which includes the corresponding JPEG image sequences to test the effectiveness of the proposed method. The experimental results illustrate that the proposed method achieves better performance in terms of anti-shake ability and preserves more details for real scene images than traditional algorithms. Furthermore, the proposed method is suitable for extreme-exposure image pairs, which can be applied to binocular vision systems to acquire high-quality real scene images, and has a lower algorithm complexity than deep learning-based fusion methods.

scholarly journals Task-Agnostic Object Recognition for Mobile Robots through Few-Shot Image Matching

Electronics ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 380 ◽  
Author(s):  
Agnese Chiatti ◽  
Gianluca Bardaro ◽  
Emanuele Bastianelli ◽  
Ilaria Tiddi ◽  
Prasenjit Mitra ◽  
...  
Keyword(s):  
Object Recognition ◽  
Mobile Robots ◽  
Image Matching ◽  
Scale Up ◽  
Target Object ◽  
Data Set ◽  
Vast Number ◽  
Training Time ◽  
Novel Objects ◽  
Object Classes

To assist humans with their daily tasks, mobile robots are expected to navigate complex and dynamic environments, presenting unpredictable combinations of known and unknown objects. Most state-of-the-art object recognition methods are unsuitable for this scenario because they require that: (i) all target object classes are known beforehand, and (ii) a vast number of training examples is provided for each class. This evidence calls for novel methods to handle unknown object classes, for which fewer images are initially available (few-shot recognition). One way of tackling the problem is learning how to match novel objects to their most similar supporting example. Here, we compare different (shallow and deep) approaches to few-shot image matching on a novel data set, consisting of 2D views of common object types drawn from a combination of ShapeNet and Google. First, we assess if the similarity of objects learned from a combination of ShapeNet and Google can scale up to new object classes, i.e., categories unseen at training time. Furthermore, we show how normalising the learned embeddings can impact the generalisation abilities of the tested methods, in the context of two novel configurations: (i) where the weights of a Convolutional two-branch Network are imprinted and (ii) where the embeddings of a Convolutional Siamese Network are L2-normalised.

scholarly journals Selecting Discriminative Binary Patterns for a Local Feature

2015 ◽  
Vol 15 (3) ◽  
pp. 104-113
Author(s):  
Yingying Li ◽  
Jieqing Tan ◽  
Jinqin Zhong
Keyword(s):  
Object Recognition ◽  
Image Matching ◽  
State Of The Art ◽  
Local Feature ◽  
High Dimensionality ◽  
Learning Method ◽  
Local Descriptor ◽  
Local Descriptors

Abstract The local descriptors based on a binary pattern feature have state-of-the-art distinctiveness. However, their high dimensionality resists them from matching faster and being used in a low-end device. In this paper we propose an efficient and feasible learning method to select discriminative binary patterns for constructing a compact local descriptor. In the selection, a searching tree with Branch&Bound is used instead of the exhaustive enumeration, in order to avoid tremendous computation in training. New local descriptors are constructed based on the selected patterns. The efficiency of selecting binary patterns has been confirmed by the evaluation of these new local descriptors’ performance in experiments of image matching and object recognition.

Sign in / Sign up

Export Citation Format

Share Document