scholarly journals A SPEED-UP GEOMETRIC CHANGE DETECTION ALGORITHM FOR VECTOR SURFACE FEATURE SET

2018 ◽  
Vol IV-4 ◽  
pp. 263-266
Author(s):  
L. Zhu ◽  
C. Li ◽  
L. Liu ◽  
J. Shen ◽  
L. Yang ◽  
...  
Keyword(s):  
Change Detection ◽  
Processing Speed ◽  
Processing Time ◽  
Detection Algorithm ◽  
Surface Feature ◽  
Spatial Index ◽  
Vector Data ◽  
Speed Up ◽  
Accuracy Of Results ◽  
Candidate Set

<p><strong>Abstract.</strong> At present, most of the researches on geometric change detection of vector data, they store the change detection results in the database, so they pay more attention to the accuracy of results, but not to the speed of processing. Nowadays, many applications require real-time change detection on vector data and rapid presentation of the result. Although the existing algorithms use spatial index technology to improve the processing speed, the processing time is still beyond the range that people can bear. In order to reduce processing time, this paper takes the vector surface feature set as the research object, trying to reduce the redundancy of the candidate set that seriously affects the efficiency of change detection. Based on the regular use of spatial index created with geometric Minimum Bounding Rectangle, this paper uses geometric shrinkage technique and precise query technique to reduce the size of the candidate set for detection, so as to achieve the goal of speeding up. Finally, using five years of farmland data and resident data from Ezhou City, Hubei Province, China, a change detection experiment was conducted. The experiment proved that the geometric shrinkage and precise query techniques can effectively improve the processing speed.</p>

An online kernel change detection algorithm

2005 ◽  
Vol 53 (8) ◽  
pp. 2961-2974 ◽  
Author(s):  
F. Desobry ◽  
M. Davy ◽  
C. Doncarli
Keyword(s):  
Change Detection ◽  
Detection Algorithm

scholarly journals Multi-temporal Satellite Images Change Detection Algorithm Based on NSCT

2011 ◽  
Vol 24 ◽  
pp. 252-256 ◽  
Author(s):  
Wei Cui ◽  
Zhenhong Jia ◽  
Xizhong Qin ◽  
Jie Yang ◽  
Yingjie Hu
Keyword(s):  
Change Detection ◽  
Satellite Images ◽  
Detection Algorithm ◽  
Multi Temporal

An Image Change Detection Algorithm Based on Multi-Feature Self-Attention Fusion Mechanism UNet Network

2021 ◽  
Author(s):  
Gulnaz Alimjan ◽  
Yiliyaer Jiaermuhamaiti ◽  
Huxidan Jumahong ◽  
Shuangling Zhu ◽  
Pazilat Nurmamat
Keyword(s):  
Change Detection ◽  
Detection Algorithm ◽  
Convolutional Network ◽  
Detection Algorithms ◽  
Multiple Dimensions ◽  
Change Detection Algorithms ◽  
Image Change Detection ◽  
Control Loss ◽  
The Relationship ◽  
Entire Network

Various UNet architecture-based image change detection algorithms promote the development of image change detection, but there are still some defects. First, under the encoder–decoder framework, the low-level features are extracted many times in multiple dimensions, which generates redundant information; second, the relationship between each feature layer is not modeled so sufficiently that it cannot produce the optimal feature differentiation representation. This paper proposes a remote image change detection algorithm based on the multi-feature self-attention fusion mechanism UNet network, abbreviated as MFSAF UNet (multi-feature self-attention fusion UNet). We attempt to add multi-feature self-attention mechanism between the encoder and decoder of UNet to obtain richer context dependence and overcome the two above-mentioned restrictions. Since the capacity of convolution-based UNet network is directly proportional to network depth, and a deeper convolutional network means more training parameters, so the convolution of each layer of UNet is replaced as a separated convolution, which makes the entire network to be lighter and the model’s execution efficiency is slightly better than the traditional convolution operation. In addition to these, another innovation point of this paper is using preference to control loss function and meet the demands for different accuracies and recall rates. The simulation test results verify the validity and robustness of this approach.

An Efficient Approach for Uncertain Event Detection in RFID Complex Event Processing

2021 ◽  
Vol 5 (4) ◽  
pp. 438
Author(s):  
Siti Salwani Binti Yaacob ◽  
Hairulnizam Bin Mahdin ◽  
Mohammed Saeed Jawad ◽  
Nayef Abdulwahab Mohammed Alduais ◽  
Akhilesh Kumar Sharma ◽  
...  
Keyword(s):  
Processing Time ◽  
Detection Algorithm ◽  
Manufacturing Processes ◽  
Memory Consumption ◽  
Production Flow ◽  
Manufacturing Environment ◽  
Thread Pool ◽  
Missing Items ◽  
Defensive Measures ◽  
Current Detection

The globalization of manufacturing has increased the risk of counterfeiting as the demand grows, the production flow increases, and the availability expands. The intensifying counterfeit issues causing a worriment to companies and putting lives at risk. Companies have ploughed a large amount of money into defensive measures, but their efforts have not slowed counterfeiters. In such complex manufacturing processes, decision-making and real-time reactions to uncertain situations throughout the production process are one way to exploit the challenges. Detecting uncertain conditions such as counterfeit and missing items in the manufacturing environment requires a specialized set of technologies to deal with a flow of continuously created data. In this paper, we propose an uncertain detection algorithm (UDA), an approach to detect uncertain events such as counterfeit and missing items in the RFID distributed system for a manufacturing environment. The proposed method is based on the hashing and thread pool technique to solve high memory consumption, long processing time and low event throughput in the current detection approaches. The experimental results show that the execution time of the proposed method is averagely reduced 22% in different tests, and our proposed method has better performance in processing time based on RFID event streams.

scholarly journals Natural Feature Detection on Mobile Phones with 3D FAST

2010 ◽  
Vol 9 (4) ◽  
pp. 29-34 ◽  
Author(s):  
Achim Weimert ◽  
Xueting Tan ◽  
Xubo Yang
Keyword(s):  
Feature Detection ◽  
Feature Matching ◽  
Hessian Matrix ◽  
Detection Algorithm ◽  
Scale Invariant ◽  
Natural Feature ◽  
Detection Approach ◽  
Scale Levels ◽  
Speed Up ◽  
Low Performance

In this paper, we present a novel feature detection approach designed for mobile devices, showing optimized solutions for both detection and description. It is based on FAST (Features from Accelerated Segment Test) and named 3D FAST. Being robust, scale-invariant and easy to compute, it is a candidate for augmented reality (AR) applications running on low performance platforms. Using simple calculations and machine learning, FAST is a feature detection algorithm known to be efficient but not very robust in addition to its lack of scale information. Our approach relies on gradient images calculated for different scale levels on which a modified9 FAST algorithm operates to obtain the values of the corner response function. We combine the detection with an adapted version of SURF (Speed Up Robust Features) descriptors, providing a system with all means to implement feature matching and object detection. Experimental evaluation on a Symbian OS device using a standard image set and comparison with SURF using Hessian matrix-based detector is included in this paper, showing improvements in speed (compared to SURF) and robustness (compared to FAST)

scholarly journals VEHICLE LOCALIZATION BY LIDAR POINT CORRELATION IMPROVED BY CHANGE DETECTION

2016 ◽  
Vol XLI-B1 ◽  
pp. 703-710 ◽  
Author(s):  
A. Schlichting ◽  
C. Brenner
Keyword(s):  
Change Detection ◽  
Reference Data ◽  
Correlation Method ◽  
Simulated Data ◽  
Detection Algorithm ◽  
Training Data ◽  
Image Correlation ◽  
Data Generation ◽  
Vehicle Localization ◽  
Dynamic Objects

LiDAR sensors are proven sensors for accurate vehicle localization. Instead of detecting and matching features in the LiDAR data, we want to use the entire information provided by the scanners. As dynamic objects, like cars, pedestrians or even construction sites could lead to wrong localization results, we use a change detection algorithm to detect these objects in the reference data. If an object occurs in a certain number of measurements at the same position, we mark it and every containing point as static. In the next step, we merge the data of the single measurement epochs to one reference dataset, whereby we only use static points. Further, we also use a classification algorithm to detect trees. <br><br> For the online localization of the vehicle, we use simulated data of a vertical aligned automotive LiDAR sensor. As we only want to use static objects in this case as well, we use a random forest classifier to detect dynamic scan points online. Since the automotive data is derived from the LiDAR Mobile Mapping System, we are able to use the labelled objects from the reference data generation step to create the training data and further to detect dynamic objects online. The localization then can be done by a point to image correlation method using only static objects. We achieved a localization standard deviation of about 5 cm (position) and 0.06° (heading), and were able to successfully localize the vehicle in about 93 % of the cases along a trajectory of 13 km in Hannover, Germany.

Sign in / Sign up

Export Citation Format

Share Document