2019
DOI: 10.1016/j.sigpro.2019.05.018
|View full text |Cite
|
Sign up to set email alerts
|

Self-regularized nonlinear diffusion algorithm based on levenberg gradient descent

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(1 citation statement)
references
References 23 publications
0
1
0
Order By: Relevance
“…There is no doubt that this complex Hessian places a great computation burden on the iteration because it needs to be calculated repeatedly. Moreover, LM generally has a poor convergence performance [23] [24], especially when the cost function is significantly not zero at the solution we are looking for [25]. This slow and poor convergence may lead to more iteration counts and poor precision of the solution.…”
mentioning
confidence: 99%
“…There is no doubt that this complex Hessian places a great computation burden on the iteration because it needs to be calculated repeatedly. Moreover, LM generally has a poor convergence performance [23] [24], especially when the cost function is significantly not zero at the solution we are looking for [25]. This slow and poor convergence may lead to more iteration counts and poor precision of the solution.…”
mentioning
confidence: 99%