2009 2nd International Conference on Biomedical Engineering and Informatics 2009
DOI: 10.1109/bmei.2009.5304779
|View full text |Cite
|
Sign up to set email alerts
|

N-Dimension Golden Section Search: Its Variants and Limitations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
38
0
1

Year Published

2012
2012
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 86 publications
(42 citation statements)
references
References 11 publications
1
38
0
1
Order By: Relevance
“…Golden section search is a very efficient algorithm for finding out the extreme of an objective function with unimodal [11]. Figure 4 shows the procedure of the 1-D GSS by entropy evaluation.…”
Section: -D Golden Section Search By Entropy Evaluationmentioning
confidence: 99%
See 1 more Smart Citation
“…Golden section search is a very efficient algorithm for finding out the extreme of an objective function with unimodal [11]. Figure 4 shows the procedure of the 1-D GSS by entropy evaluation.…”
Section: -D Golden Section Search By Entropy Evaluationmentioning
confidence: 99%
“…To be specific, the golden section search (GSS) method [10,11] is used iteratively to estimate the rotation angle and center. The optimal parameters can be obtained when the entropy of the compensated ISAR image is minimized.…”
Section: Introductionmentioning
confidence: 99%
“…Since the objective function in Eq. (39) is non-smooth, a section search method (Chang, 2009) is employed for minimization over the unit hemispherical surface spanned by m ⁄ . Predicted domain boundaries need not coincide with {111} planes.…”
Section: Domain Boundary Orientationmentioning
confidence: 99%
“…Finally, the MTRC of the ISAR image is compensated by using the optimized parameters and the ISAR image can be best focused. Note that, to reduce the computational load of the proposed method, the golden section search (GSS) method is used in the iteratively processing [11,12]. The major contribution of the proposed algorithm is the iterative search for rotation angle  and center 0 y .The effectiveness and robustness of the proposed algorithm are demonstrated by synthetic and real data.…”
Section: Introductionmentioning
confidence: 99%