scholarly journals Design of the Second-Order Controller by Time-Domain Objective Functions Using Cuckoo Search

2019 ◽  
Author(s):  
Huey-Yang Horng
Keyword(s):  
Time Domain ◽  
Cuckoo Search ◽  
Second Order ◽  
Objective Functions

scholarly journals Parsimonious truncated Newton method for time-domain full waveform inversion based on Fourier-domain full-scattered-field approximation

Geophysics ◽  
2021 ◽  
pp. 1-147
Author(s):  
Peng Yong ◽  
Romain Brossier ◽  
Ludovic Métivier
Keyword(s):  
Frequency Domain ◽  
Time Domain ◽  
Cross Correlation ◽  
Waveform Inversion ◽  
Field Approximation ◽  
Second Order ◽  
Vector Product ◽  
First Order ◽  
Full Waveform ◽  
Truncated Newton

In order to exploit Hessian information in Full Waveform Inversion (FWI), the matrix-free truncated Newton method can be used. In such a method, Hessian-vector product computation is one of the major concerns due to the huge memory requirements and demanding computational cost. Using the adjoint-state method, the Hessian-vector product can be estimated by zero-lag cross-correlation of the first-order/second-order incident wavefields and the second-order/first-order adjoint wavefields. Different from the implementation in frequency-domain FWI, Hessian-vector product construction in the time domain becomes much more challenging as it is not affordable to store the entire time-dependent wavefields. The widely used wavefield recomputation strategy leads to computationally intensive tasks. We present an efficient alternative approach to computing the Hessian-vector product for time-domain FWI. In our method, discrete Fourier transform is applied to extract frequency-domain components of involved wavefields, which are used to compute wavefield cross-correlation in the frequency domain. This makes it possible to avoid reconstructing the first-order and second-order incident wavefields. In addition, a full-scattered-field approximation is proposed to efficiently simplify the second-order incident and adjoint wavefields computation, which enables us to refrain from repeatedly solving the first-order incident and adjoint equations for the second-order incident and adjoint wavefields (re)computation. With the proposed method, the computational time can be reduced by 70% and 80% in viscous media for Gauss-Newton and full-Newton Hessian-vector product construction, respectively. The effectiveness of our method is also verified in the frame of a 2D multi-parameter inversion, in which the proposed method almost reaches the same iterative convergence of the conventional time-domain implementation.

Elephant Herding Optimization for Multi-Level Image Thresholding

2020 ◽  
Vol 11 (4) ◽  
pp. 64-90
Author(s):  
Falguni Chakraborty ◽  
Provas Kumar Roy ◽  
Debashis Nandi
Keyword(s):  
Image Segmentation ◽  
Signal To Noise Ratio ◽  
Similarity Index ◽  
Cuckoo Search ◽  
Threshold Value ◽  
Objective Functions ◽  
Image Thresholding ◽  
Bee Colony ◽  
Kapur’S Entropy ◽  
Feature Similarity Index

Multilevel thresholding plays a significant role in the arena of image segmentation. The main issue of multilevel image thresholding is to select the optimal combination of threshold value at different level. However, this problem has become challenging with the higher number of levels, because computational complexity is increased exponentially as the increase of number of threshold. To address this problem, this paper has proposed elephant herding optimization (EHO) based multilevel image thresholding technique for image segmentation. The EHO method has been inspired by the herding behaviour of elephant group in nature. Two well-known objective functions such as ‘Kapur's entropy' and ‘between-class variance method' have been used to determine the optimized threshold values for segmentation of different objects from an image. The performance of the proposed algorithm has been verified using a set of different test images taken from a well-known benchmark dataset named Berkeley Segmentation Dataset (BSDS). For comparative analysis, the results have been compared with three popular algorithms, e.g. cuckoo search (CS), artificial bee colony (ABC) and particle swarm optimization (PSO). It has been observed that the performance of the proposed EHO based image segmentation technique is efficient and promising with respect to the others in terms of the values of optimized thresholds, objective functions, peak signal-to-noise ratio (PSNR), structure similarity index (SSIM) and feature similarity index (FSIM). The algorithm also shows better convergence profile than the other methods discussed.

Sign in / Sign up

Export Citation Format

Share Document