國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Global Optimization Algorithms for I...

New Jersey Institute of Technology.

Global Optimization Algorithms for Image Registration and Clustering.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Global Optimization Algorithms for Image Registration and Clustering.
作者:	Zheng, Cuicui.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, 2020
面頁冊數:	94 p.
附註:	Source: Dissertations Abstracts International, Volume: 82-04, Section: B.
附註:	Advisor: Calvin, James.
Contained By:	Dissertations Abstracts International82-04B.
標題:	Computer science.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=27742338
ISBN:	9798678159816

Global Optimization Algorithms for Image Registration and Clustering.
Zheng, Cuicui.

Global Optimization Algorithms for Image Registration and Clustering. - Ann Arbor : ProQuest Dissertations & Theses, 2020 - 94 p.

Source: Dissertations Abstracts International, Volume: 82-04, Section: B.

Thesis (Ph.D.)--New Jersey Institute of Technology, 2020.

This item must not be sold to any third party vendors.

Global optimization is a classical problem of finding the minimum or maximum value of an objective function. It has applications in many areas, such as biological image analysis, chemistry, mechanical engineering, financial analysis, deep learning and image processing. For practical applications, it is important to understand the efficiency of global optimization algorithms. This dissertation develops and analyzes some new global optimization algorithms and applies them to practical problems, mainly for image registration and data clustering.First, the dissertation presents a new global optimization algorithm which approximates the optimum using only function values. The basic idea is to use the points at which the function has been evaluated to decompose the domain into a collection of hyper-rectangles. At each step of the algorithm, it chooses a hyper-rectangle according to a certain criterion and the next function evaluation is at the center of the hyper-rectangle. The dissertation includes a proof that the algorithm converges to the global optimum as the number of function evaluations goes to infinity, and also establishes the convergence rate. Standard test functions are used to experimentally evaluate the algorithm. The second part focuses on applying algorithms from the first part to solve some practical problems. Image processing tasks often require optimizing over some set of parameters. In the image registration problem, one attempts to determine the best transformation for aligning similar images. Such problems typically require minimizing a dissimilarity measure with multiple local minima. The dissertation describes a global optimization algorithm and applies it to the problem of identifying the best transformation for aligning two images. Global optimization algorithms can also be applied to the data clustering problem. The basic purpose of clustering is to categorize data into different groups by their similarity. The objective cost functions for clustering usually are non-convex.

ISBN: 9798678159816Subjects--Topical Terms:

199325
Computer science.
Subjects--Index Terms:

Clustering

Global Optimization Algorithms for Image Registration and Clustering.
LDR:03686nmm a2200373 4500 001 594535
005 20210521101648.5
008 210917s2020 ||||||||||||||||| ||eng d
020 $a 9798678159816
035 $a (MiAaPQ)AAI27742338
035 $a AAI27742338
040 $a MiAaPQ $c MiAaPQ
100 1 $a Zheng, Cuicui. $3 886528
245 1 0 $a Global Optimization Algorithms for Image Registration and Clustering.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2020
300 $a 94 p.
500 $a Source: Dissertations Abstracts International, Volume: 82-04, Section: B.
500 $a Advisor: Calvin, James.
502 $a Thesis (Ph.D.)--New Jersey Institute of Technology, 2020.
506 $a This item must not be sold to any third party vendors.
520 $a Global optimization is a classical problem of finding the minimum or maximum value of an objective function. It has applications in many areas, such as biological image analysis, chemistry, mechanical engineering, financial analysis, deep learning and image processing. For practical applications, it is important to understand the efficiency of global optimization algorithms. This dissertation develops and analyzes some new global optimization algorithms and applies them to practical problems, mainly for image registration and data clustering.First, the dissertation presents a new global optimization algorithm which approximates the optimum using only function values. The basic idea is to use the points at which the function has been evaluated to decompose the domain into a collection of hyper-rectangles. At each step of the algorithm, it chooses a hyper-rectangle according to a certain criterion and the next function evaluation is at the center of the hyper-rectangle. The dissertation includes a proof that the algorithm converges to the global optimum as the number of function evaluations goes to infinity, and also establishes the convergence rate. Standard test functions are used to experimentally evaluate the algorithm. The second part focuses on applying algorithms from the first part to solve some practical problems. Image processing tasks often require optimizing over some set of parameters. In the image registration problem, one attempts to determine the best transformation for aligning similar images. Such problems typically require minimizing a dissimilarity measure with multiple local minima. The dissertation describes a global optimization algorithm and applies it to the problem of identifying the best transformation for aligning two images. Global optimization algorithms can also be applied to the data clustering problem. The basic purpose of clustering is to categorize data into different groups by their similarity. The objective cost functions for clustering usually are non-convex. $k $- means is a popular algorithm which can find local optima quickly but may not obtain global optima. The different starting points for $k $- means can output different local optima. This dissertation describes a global optimization algorithm for approximating the global minimum of the clustering problem. The third part of the dissertation presents variations of the proposed algorithm that work with different assumptions on the available information, including a version that uses derivatives.
590 $a School code: 0152.
650 4 $a Computer science. $3 199325
650 4 $a Applied mathematics. $3 377601
650 4 $a Information technology. $3 184390
653 $a Clustering
653 $a Convergence rate
653 $a Global optimization
653 $a Image registration
653 $a Simulation
690 $a 0984
690 $a 0364
690 $a 0489
710 2 $a New Jersey Institute of Technology. $b Department of Computer Science. $3 886529
773 0 $t Dissertations Abstracts International $g 82-04B.
790 $a 0152
791 $a Ph.D.
792 $a 2020
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=27742338