Dynamic Threshold for Morphological Change Detection Algorithm

2009 ◽  
Vol 4 (3) ◽  
pp. 53-58 ◽  
Author(s):  
A.N.M. Rezaul Karim ◽  
M. G. R Alam
Keyword(s):  
Change Detection ◽  
Morphological Change ◽  
Detection Algorithm ◽  
Dynamic Threshold

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 automatic phase picker for local and teleseismic events

1987 ◽  
Vol 77 (4) ◽  
pp. 1437-1445
Author(s):  
M. Baer ◽  
U. Kradolfer
Keyword(s):  
Arrival Time ◽  
Detection Algorithm ◽  
Dynamic Threshold ◽  
Data Set ◽  
Automatic Phase ◽  
Nonlinear Amplifier ◽  
First Motion ◽  
Transient Events ◽  
Teleseismic Events ◽  
Automatic Detection Algorithm

Abstract An automatic detection algorithm has been developed which is capable of time P-phase arrivals of both local and teleseismic earthquakes, but rejects noise bursts and transient events. For each signal trace, the envelope function is calculated and passed through a nonlinear amplifier. The resulting signal is then subjected to a statistical analysis to yield arrival time, first motion, and a measure of reliability to be placed on the P-arrival pick. An incorporated dynamic threshold lets the algorithm become very sensitive; thus, even weak signals are timed precisely. During an extended performance evaluation on a data set comprising 789 P phases of local events and 1857 P phases of teleseismic events picked by an analyst, the automatic picker selected 66 per cent of the local phases and 90 per cent of the teleseismic phases. The accuracy of the automatic picks was “ideal” (i.e., could not be improved by the analyst) for 60 per cent of the local events and 63 per cent of the teleseismic events.

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.

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