Illumination-insensitive Binary Descriptor for Visual Measurement Based on Local Inter-patch Invariance
TL;DR: In this paper , an illumination-insensitive binary (IIB) descriptor was proposed by leveraging the local inter-patch invariance exhibited in multiple spatial granularities to deal with unfavorable illumination variations.
read more
Abstract: Binary feature descriptors have been widely used in various visual measurement tasks, particularly those with limited computing resources and storage capacities. Existing binary descriptors may not perform well for long-term visual measurement tasks due to their sensitivity to illumination variations. It can be observed that when image illumination changes dramatically, the relative relationship among local patches mostly remains intact. Based on the observation, consequently, this study presents an illumination-insensitive binary (IIB) descriptor by leveraging the local inter-patch invariance exhibited in multiple spatial granularities to deal with unfavorable illumination variations. By taking advantage of integral images for local patch feature computation, a highly efficient IIB descriptor is achieved. It can encode scalable features in multiple spatial granularities, thus facilitating a computationally efficient hierarchical matching from coarse to fine. Moreover, the IIB descriptor can also apply to other types of image data, such as depth maps and semantic segmentation results, when available in some applications. Numerical experiments on both natural and synthetic datasets reveal that the proposed IIB descriptor outperforms state-of-the-art binary descriptors and some testing float descriptors. The proposed IIB descriptor has also been successfully employed in a demo system for long-term visual localization. The code <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> of the IIB descriptor will be publicly available.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Effective and Efficient Line Segment Detection for Visual Measurement Guided by Level Lines
TL;DR: Numerical experiments showed that the E2LSD algorithm outperforms existing state-of-the-art (SOTA) methods regarding both effectiveness and computational efficiency.
22
QIS-GAN: A Lightweight Adversarial Network with Quadtree Implicit Sampling for Multispectral and Hyperspectral Image Fusion
Chunyu Zhu,Shang-Qi Deng,Yingjie Zhou,Liang-jian Deng,Qiong Wu +4 more
TL;DR: The quadtree implicit sampling (QIS) is presented, which employs a hierarchical sampling from the perspective of the quadtree, to enhance the capacity of the overall network and adopt a lightweight structure as the shallow encoder, greatly alleviating the network burden and achieving lightweight.
14
DSAP: Dynamic Sparse Attention Perception Matcher for Accurate Local Feature Matching
Kun Dai,Ke Wang,Tao Xie,Tao Sun,Jinhang Zhang,Qingjia Kong,Zhiqiang Jiang,Ruifeng Li,Lijun Zhao,Mohamed Omar +9 more
TL;DR: DSAP is a novel local feature matching method that dynamically enhances visual descriptors and integrates global context by employing sparse attention mechanisms.
3
KNLConv: Kernel-space Non-local Convolution for Hyperspectral Image Super-resolution
Ran Ran,Liang-Jian Deng,Tian-Jing Zhang,Jianlong Chang,Xiao Wu,Qi Tian +5 more
TL;DR: KNLConv explores non-local dependencies in the generated kernel space to extract image features more flexibly for hyperspectral image super-resolution.
3
SSCAConv: Self-guided Spatial-Channel Adaptive Convolution for Image Fusion
Xiaoya Lu,Yu-Wei Zhuo,Hongming Chen,Liang-jian Deng,Junming Hou +4 more
TL;DR: Experimental results show that SSCANet outperforms state-of-the-art (SOTA) pansharpening algorithms and achieves better generalization ability with fewer parameters when extended to the hyperspectral image super-resolution (HISR) problem.
2
References
Distinctive Image Features from Scale-Invariant Keypoints
TL;DR: This paper presents a method for extracting distinctive invariant features from images that can be used to perform reliable matching between different views of an object or scene and can robustly identify objects among clutter and occlusion while achieving near real-time performance.
Rapid object detection using a boosted cascade of simple features
Paul A. Viola,Michael Jones +1 more
- 01 Dec 2001
TL;DR: A machine learning approach for visual object detection which is capable of processing images extremely rapidly and achieving high detection rates and the introduction of a new image representation called the "integral image" which allows the features used by the detector to be computed very quickly.
A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
Yoav Freund,Robert E. Schapire +1 more
- 01 Aug 1997
TL;DR: The model studied can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting, and it is shown that the multiplicative weight-update Littlestone?Warmuth rule can be adapted to this model, yielding bounds that are slightly weaker in some cases, but applicable to a considerably more general class of learning problems.
Multiresolution gray-scale and rotation invariant texture classification with local binary patterns
TL;DR: A generalized gray-scale and rotation invariant operator presentation that allows for detecting the "uniform" patterns for any quantization of the angular space and for any spatial resolution and presents a method for combining multiple operators for multiresolution analysis.
Speeded-Up Robust Features (SURF)
TL;DR: A novel scale- and rotation-invariant detector and descriptor, coined SURF (Speeded-Up Robust Features), which approximates or even outperforms previously proposed schemes with respect to repeatability, distinctiveness, and robustness, yet can be computed and compared much faster.
14.9K