scholarly journals Superpixel-Based Feature Tracking for Structure from Motion

2019 ◽  
Vol 9 (15) ◽  
pp. 2961
Author(s):  
Mingwei Cao ◽  
Wei Jia ◽  
Zhihan Lv ◽  
Liping Zheng ◽  
Xiaoping Liu
Keyword(s):  
Structure From Motion ◽  
Feature Tracking ◽  
State Of The Art ◽  
Input Image ◽  
Ratio Test ◽  
Feature Correspondences ◽  
Speed Up ◽  
Joint Approach ◽  
Speed Up Robust Feature ◽  
Locality Sensitive Hash

Feature tracking in image collections significantly affects the efficiency and accuracy of Structure from Motion (SFM). Insufficient correspondences may result in disconnected structures and incomplete components, while the redundant correspondences containing incorrect ones may yield to folded and superimposed structures. In this paper, we present a Superpixel-based feature tracking method for structure from motion. In the proposed method, we first propose to use a joint approach to detect local keypoints and compute descriptors. Second, the superpixel-based approach is used to generate labels for the input image. Third, we combine the Speed Up Robust Feature and binary test in the generated label regions to produce a set of combined descriptors for the detected keypoints. Fourth, the locality-sensitive hash (LSH)-based k nearest neighboring matching (KNN) is utilized to produce feature correspondences, and then the ratio test approach is used to remove outliers from the previous matching collection. Finally, we conduct comprehensive experiments on several challenging benchmarking datasets including highly ambiguous and duplicated scenes. Experimental results show that the proposed method gets better performances with respect to the state of the art methods.

scholarly journals A method for real-time memory efficient implementation of blob detection in large images

2017 ◽  
Vol 14 (1) ◽  
pp. 67-84
Author(s):  
Vladimir Petrovic ◽  
Jelena Popovic-Bozovic
Keyword(s):  
Real Time ◽  
Hardware Implementation ◽  
State Of The Art ◽  
Input Image ◽  
Text Recognition ◽  
Blob Detection ◽  
Motion Imagery ◽  
Speed Up ◽  
Feature Based ◽  
Memory Efficient

In this paper we propose a method for real-time blob detection in large images with low memory cost. The method is suitable for implementation on the specialized parallel hardware such as multi-core platforms, FPGA and ASIC. It uses parallelism to speed-up the blob detection. The input image is divided into blocks of equal sizes to which the maximally stable extremal regions (MSER) blob detector is applied in parallel. We propose the usage of multiresolution analysis for detection of large blobs which are not detected by processing the small blocks. This method can find its place in many applications such as medical imaging, text recognition, as well as video surveillance or wide area motion imagery (WAMI). We explored the possibilities of usage of detected blobs in the feature-based image alignment as well. When large images are processed, our approach is 10 to over 20 times more memory efficient than the state of the art hardware implementation of the MSER.

scholarly journals CoCoX: Generating Conceptual and Counterfactual Explanations via Fault-Lines

2020 ◽  
Vol 34 (03) ◽  
pp. 2594-2601
Author(s):  
Arjun Akula ◽  
Shuai Wang ◽  
Song-Chun Zhu
Keyword(s):  
Neural Network ◽  
State Of The Art ◽  
Input Image ◽  
Classification Model ◽  
Learning Models ◽  
Fault Line ◽  
Semantic Level ◽  
Explainable Ai ◽  
Fault Lines ◽  
Classification Category

We present CoCoX (short for Conceptual and Counterfactual Explanations), a model for explaining decisions made by a deep convolutional neural network (CNN). In Cognitive Psychology, the factors (or semantic-level features) that humans zoom in on when they imagine an alternative to a model prediction are often referred to as fault-lines. Motivated by this, our CoCoX model explains decisions made by a CNN using fault-lines. Specifically, given an input image I for which a CNN classification model M predicts class cpred, our fault-line based explanation identifies the minimal semantic-level features (e.g., stripes on zebra, pointed ears of dog), referred to as explainable concepts, that need to be added to or deleted from I in order to alter the classification category of I by M to another specified class calt. We argue that, due to the conceptual and counterfactual nature of fault-lines, our CoCoX explanations are practical and more natural for both expert and non-expert users to understand the internal workings of complex deep learning models. Extensive quantitative and qualitative experiments verify our hypotheses, showing that CoCoX significantly outperforms the state-of-the-art explainable AI models. Our implementation is available at https://github.com/arjunakula/CoCoX

Review on biomass feedstocks, pyrolysis mechanism and physicochemical properties of biochar: State-of-the-art framework to speed up vision of circular bioeconomy

2021 ◽  
Vol 297 ◽  
pp. 126645
Author(s):  
Gajanan Sampatrao Ghodake ◽  
Surendra Krushna Shinde ◽  
Avinash Ashok Kadam ◽  
Rijuta Ganesh Saratale ◽  
Ganesh Dattatraya Saratale ◽  
...  
Keyword(s):  
Physicochemical Properties ◽  
State Of The Art ◽  
Pyrolysis Mechanism ◽  
Biomass Feedstocks ◽  
Speed Up

scholarly journals PDANet: Self-Supervised Monocular Depth Estimation Using Perceptual and Data Augmentation Consistency

2021 ◽  
Vol 11 (12) ◽  
pp. 5383
Author(s):  
Huachen Gao ◽  
Xiaoyu Liu ◽  
Meixia Qu ◽  
Shijie Huang
Keyword(s):  
Data Augmentation ◽  
State Of The Art ◽  
Depth Estimation ◽  
Input Image ◽  
Depth Information ◽  
Disparity Map ◽  
Estimation Model ◽  
Absolute Relative Error ◽  
Texture Region ◽  
Monocular Depth

In recent studies, self-supervised learning methods have been explored for monocular depth estimation. They minimize the reconstruction loss of images instead of depth information as a supervised signal. However, existing methods usually assume that the corresponding points in different views should have the same color, which leads to unreliable unsupervised signals and ultimately damages the reconstruction loss during the training. Meanwhile, in the low texture region, it is unable to predict the disparity value of pixels correctly because of the small number of extracted features. To solve the above issues, we propose a network—PDANet—that integrates perceptual consistency and data augmentation consistency, which are more reliable unsupervised signals, into a regular unsupervised depth estimation model. Specifically, we apply a reliable data augmentation mechanism to minimize the loss of the disparity map generated by the original image and the augmented image, respectively, which will enhance the robustness of the image in the prediction of color fluctuation. At the same time, we aggregate the features of different layers extracted by a pre-trained VGG16 network to explore the higher-level perceptual differences between the input image and the generated one. Ablation studies demonstrate the effectiveness of each components, and PDANet shows high-quality depth estimation results on the KITTI benchmark, which optimizes the state-of-the-art method from 0.114 to 0.084, measured by absolute relative error for depth estimation.

scholarly journals A Benchmark and Evaluation of Non-Rigid Structure from Motion

2020 ◽  
Author(s):  
Sebastian Hoppe Nesgaard Jensen ◽  
Mads Emil Brix Doest ◽  
Henrik Aanæs ◽  
Alessio Del Bue
Keyword(s):  
Computer Vision ◽  
Structure From Motion ◽  
State Of The Art ◽  
The State ◽  
Quality Data ◽  
Data Set ◽  
Rigid Structure ◽  
Public Data ◽  
3D Information ◽  
Further Development

AbstractNon-rigid structure from motion (nrsfm), is a long standing and central problem in computer vision and its solution is necessary for obtaining 3D information from multiple images when the scene is dynamic. A main issue regarding the further development of this important computer vision topic, is the lack of high quality data sets. We here address this issue by presenting a data set created for this purpose, which is made publicly available, and considerably larger than the previous state of the art. To validate the applicability of this data set, and provide an investigation into the state of the art of nrsfm, including potential directions forward, we here present a benchmark and a scrupulous evaluation using this data set. This benchmark evaluates 18 different methods with available code that reasonably spans the state of the art in sparse nrsfm. This new public data set and evaluation protocol will provide benchmark tools for further development in this challenging field.

scholarly journals Adaptive Image Enhancement Using Entropy-Based Subhistogram Equalization

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Liyun Zhuang ◽  
Yepeng Guan
Keyword(s):  
Image Enhancement ◽  
Dynamic Range ◽  
State Of The Art ◽  
Image Database ◽  
Input Image ◽  
Public Image ◽  
Contrast Enhanced ◽  
Quantitative Results ◽  
The Mean ◽  
Visual Assessments

A novel image enhancement approach called entropy-based adaptive subhistogram equalization (EASHE) is put forward in this paper. The proposed algorithm divides the histogram of input image into four segments based on the entropy value of the histogram, and the dynamic range of each subhistogram is adjusted. A novel algorithm to adjust the probability density function of the gray level is proposed, which can adaptively control the degree of image enhancement. Furthermore, the final contrast-enhanced image is obtained by equalizing each subhistogram independently. The proposed algorithm is compared with some state-of-the-art HE-based algorithms. The quantitative results for a public image database named CVG-UGR-Database are statistically analyzed. The quantitative and visual assessments show that the proposed algorithm outperforms most of the existing contrast-enhancement algorithms. The proposed method can make the contrast of image more effectively enhanced as well as the mean brightness and details well preserved.

scholarly journals Particle Size Estimation in Mixed Commercial Waste Images Using Deep Learning

2021 ◽  
Author(s):  
Phongsathorn Kittiworapanya ◽  
Kitsuchart Pasupa ◽  
Peter Auer
Keyword(s):  
Computer Vision ◽  
Particle Size ◽  
Deep Learning ◽  
Waste Management ◽  
State Of The Art ◽  
Learning Algorithms ◽  
Input Image ◽  
Size Estimation ◽  
Waste Particles ◽  
Set Up

<div>We assessed several state-of-the-art deep learning algorithms and computer vision techniques for estimating the particle size of mixed commercial waste from images. In waste management, the first step is often coarse shredding, using the particle size to set up the shredder machine. The difficulty is separating the waste particles in an image, which can not be performed well. This work focused on estimating size by using the texture from the input image, captured at a fixed height from the camera lens to the ground. We found that EfficientNet achieved the best performance of 0.72 on F1-Score and 75.89% on accuracy.<br></div>

scholarly journals ConnectIt

2020 ◽  
Vol 14 (4) ◽  
pp. 653-667
Author(s):  
Laxman Dhulipala ◽  
Changwan Hong ◽  
Julian Shun
Keyword(s):  
Experimental Evaluation ◽  
Comprehensive Evaluation ◽  
State Of The Art ◽  
Graph Connectivity ◽  
Connected Components ◽  
Sampling Strategies ◽  
Spanning Forest ◽  
Speed Up ◽  
Minimum Spanning Forest ◽  
Edge Sampling

Connected components is a fundamental kernel in graph applications. The fastest existing multicore algorithms for solving graph connectivity are based on some form of edge sampling and/or linking and compressing trees. However, many combinations of these design choices have been left unexplored. In this paper, we design the ConnectIt framework, which provides different sampling strategies as well as various tree linking and compression schemes. ConnectIt enables us to obtain several hundred new variants of connectivity algorithms, most of which extend to computing spanning forest. In addition to static graphs, we also extend ConnectIt to support mixes of insertions and connectivity queries in the concurrent setting. We present an experimental evaluation of ConnectIt on a 72-core machine, which we believe is the most comprehensive evaluation of parallel connectivity algorithms to date. Compared to a collection of state-of-the-art static multicore algorithms, we obtain an average speedup of 12.4x (2.36x average speedup over the fastest existing implementation for each graph). Using ConnectIt, we are able to compute connectivity on the largest publicly-available graph (with over 3.5 billion vertices and 128 billion edges) in under 10 seconds using a 72-core machine, providing a 3.1x speedup over the fastest existing connectivity result for this graph, in any computational setting. For our incremental algorithms, we show that our algorithms can ingest graph updates at up to several billion edges per second. To guide the user in selecting the best variants in ConnectIt for different situations, we provide a detailed analysis of the different strategies. Finally, we show how the techniques in ConnectIt can be used to speed up two important graph applications: approximate minimum spanning forest and SCAN clustering.

Sign in / Sign up

Export Citation Format

Share Document