Large-Scale Optimization Methods with Application to Design of Filter Networks
2014 (English)Doctoral thesis, comprehensive summary (Other academic)
Nowadays, large-scale optimization problems are among those most challenging. Any progress in developing methods for large-scale optimization results in solving important applied problems more effectively. Limited memory methods and trust-region methods represent two ecient approaches used for solving unconstrained optimization problems. A straightforward combination of them deteriorates the efficiency of the former approach, especially in the case of large-scale problems. For this reason, the limited memory methods are usually combined with a line search. We develop new limited memory trust-region algorithms for large-scale unconstrained optimization. They are competitive with the traditional limited memory line-search algorithms.
In this thesis, we consider applied optimization problems originating from the design of lter networks. Filter networks represent an ecient tool in medical image processing. It is based on replacing a set of dense multidimensional lters by a network of smaller sparse lters called sub-filters. This allows for improving image processing time, while maintaining image quality and the robustness of image processing.
Design of lter networks is a nontrivial procedure that involves three steps: 1) choosing the network structure, 2) choosing the sparsity pattern of each sub-filter and 3) optimizing the nonzero coecient values. So far, steps 1 and 2 were mainly based on the individual expertise of network designers and their intuition. Given a sparsity pattern, the choice of the coecients at stage 3 is related to solving a weighted nonlinear least-squares problem. Even in the case of sequentially connected lters, the resulting problem is of a multilinear least-squares (MLLS) type, which is a non-convex large-scale optimization problem. This is a very dicult global optimization problem that may have a large number of local minima, and each of them is singular and non-isolated. It is characterized by a large number of decision variables, especially for 3D and 4D lters.
We develop an effective global optimization approach to solving the MLLS problem that reduces signicantly the computational time. Furthermore, we develop efficient methods for optimizing sparsity of individual sub-filters in lter networks of a more general structure. This approach offers practitioners a means of nding a proper trade-o between the image processing quality and time. It allows also for improving the network structure, which makes automated some stages of designing lter networks.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2014. , 52 p.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1561
IdentifiersURN: urn:nbn:se:liu:diva-103646DOI: 10.3384/diss.diva-103646ISBN: 978-91-7519-456-1 (print)OAI: oai:DiVA.org:liu-103646DiVA: diva2:692950
2014-02-26, Nobel (BL32), B-huset, Campus Valla, Linköping University, Linköping, 13:15 (English)
Júdice, Joaquim João, Professor
Burdakov, Oleg, Dr.Knutsson, Hans, ProfessorAndersson, Mats, Dr.
List of papers