2009
DOI: 10.1016/j.cam.2009.05.016
|View full text |Cite
|
Sign up to set email alerts
|

A new variant of L-curve for Tikhonov regularization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
23
0
5

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 77 publications
(28 citation statements)
references
References 9 publications
0
23
0
5
Order By: Relevance
“…This approach leads to a constrained optimization problem and its efficiency is dependent on tuning some parameters manually. To overcome these limitations, here, we introduce a geometrical view point to solve this problem based on L-curve method (Hansen, 2001;Rezghi & Hosseini, 2009). This new approach leads to an unconstrained optimization and does not need any manual tuning.…”
Section: L-curve Methods To Adjust Watermark Strength Factormentioning
confidence: 99%
“…This approach leads to a constrained optimization problem and its efficiency is dependent on tuning some parameters manually. To overcome these limitations, here, we introduce a geometrical view point to solve this problem based on L-curve method (Hansen, 2001;Rezghi & Hosseini, 2009). This new approach leads to an unconstrained optimization and does not need any manual tuning.…”
Section: L-curve Methods To Adjust Watermark Strength Factormentioning
confidence: 99%
“…It represents a canonical example of a linear discrete ill-posed problem whose meaningful solution can be obtained by replacing the "original" linear system (18) and (19) by a nearby system that is less sensitive to perturbations of the right-hand side of the system, and considers the solution of this new system as a good approximation of the original one. This operation is known as regularization and can be performed using truncated singular value decomposition (TSVD) [30], Tikhonov regularization [31], maximum entropy principle [32]. TSVD practically consists in decomposing the matrix B with SVD and truncating (putting to zeros) the small singular values, in such a way that they do not dominate the solution leading to spurious oscillations.…”
Section: Generation Ofmentioning
confidence: 99%
“…for a suitable value of the regularization parameter α, which can effectively be found using (for instance) L-curve method [31]. The goal of L-curve is to search for a regularization parameter α for which the solution has an optimal balance between the minimization of residual norm…”
Section: Generation Ofmentioning
confidence: 99%
“…Most researches based on L-curve focus on three aspects: one is some intuitive analysis or theoretical justification for the curve [13][14]; one is how to compute the global corner or its nearby points automatically to select the proper regularization parameter [15][16][17][18][19]; and the last is about some variants of Lcurve to determine a proper regularization parameter in a new angle [20][21].…”
Section: Introductionmentioning
confidence: 99%