DOI: 10.31274/rtd-180813-9931
|View full text |Cite
|
Sign up to set email alerts
|

Data fusion for NDE signal characterization

Abstract: The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion. Oversize materials (e.g.,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 41 publications
0
5
0
Order By: Relevance
“…The selected member is perturbed according to the Gaussian probabilistic distribution function by a simulated-annealing technique. The perturbation of the i th component of the selected member can be written as (2) where ∆ x i is the amount of perturbation on parameter x i . With the use of the simulated-annealing technique, the amount of perturbation can be expressed as (3) where rand(0, 1) is a Gaussian random number with the zero mean and unit variance, x i max and x i min denote the extreme values of the parameter x i in the search…”
Section: An Improved Genetic Local Search Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The selected member is perturbed according to the Gaussian probabilistic distribution function by a simulated-annealing technique. The perturbation of the i th component of the selected member can be written as (2) where ∆ x i is the amount of perturbation on parameter x i . With the use of the simulated-annealing technique, the amount of perturbation can be expressed as (3) where rand(0, 1) is a Gaussian random number with the zero mean and unit variance, x i max and x i min denote the extreme values of the parameter x i in the search…”
Section: An Improved Genetic Local Search Algorithmmentioning
confidence: 99%
“…However, iterative methods using the numerical-based forward models are computationally expensive. Neural networks are utilized for solving inverse problems in NDE [1][2][3][4] and used to represent the forward process in iterative methods [1]. Huang et al [3] described the use of a wavelet-basis-function neural network to predict three-dimensional defect profiles.…”
Section: Introductionmentioning
confidence: 99%
“…However, iterative methods using the numerical-based forward models are computationally expensive. Neural networks are utilized for solving inverse problems in NDE [1][2][3][4] and used to represent the forward process in iterative methods [1]. In neural networks, the solution of an inverse problem is to estimate unknown weights or parameters from a set of input-output examples during learning.…”
Section: Introductionmentioning
confidence: 99%
“…However, iterative methods using the numerical-based forward models are computationally expensive. Neural networks are utilized for solving inverse problems in NDE [ 1,2,3,4] and used to represent the forward process in the iterative methods [1]. Huang et al [3] described the use of a wavelet basis function (WBF) neural network to predict three-dimensional defect profiles.…”
Section: Introductionmentioning
confidence: 99%
“…The selected member is perturbed according to the Gaussian probabilistic distribution function (GPDF) using a simulated annealing technique. The perturbation of the ith component of the selected member can be written as x =x +Ax (2) where Axi is the amount of perturbation on the parameter xi. Using the simulated annealing technique, the amount of perturbation can be expressed as…”
Section: Introductionmentioning
confidence: 99%