Discrete tomographic reconstruction methods from the theories of optimization and inverse problems : application in VLSI microchip production

Download

index.pdf

Date

2006

Author

Özgür, Osman

Metadata

Show full item record

Item Usage Stats

125
views

43
downloads

Optimization theory is a key technology for inverse problems of reconstruction in science, engineering and economy. Discrete tomography is a modern research field dealing with the reconstruction of finite objects in, e.g., VLSI chip design, where this thesis will focus on. In this work, a framework with its supplementary algorithms and a new problem reformulation are introduced to approximately resolve this NP-hard problem. The framework is modular, so that other reconstruction methods, optimization techniques, optimal experimental design methods can be incorporated within. The problem is being revisited with a new optimization formulation, and interpretations of known methods in accordance with the framework are also given. Supplementary algorithms are combined or incorporated to improve the solution or to reduce the cost in terms of time and space from the computational point of view.

Subject Keywords

General works.

URI

http://etd.lib.metu.edu.tr/upload/12607095/index.pdf
https://hdl.handle.net/11511/15796

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

Robust optimization approach for long-term project pricing Balkan, Kaan; Meral, Fatma Sedef; Oğuzsoy, Cemal Berk; Department of Industrial Engineering (2010) In this study, we address the long-term project pricing problem for a company that operates in the defense industry. The pricing problem is a bid project pricing problem which includes various technical and financial uncertainties, such as estimations of workhour content of the project and exchange & inflation rates. We propose a Robust Optimization (RO) approach that can deal with the uncertainties during the project lifecycle through the identification of several discrete scenarios. The bid project’s perf...
Evaluating public transporation alternatives in the METU Campus with the aid of gis Güllüoğlu, Naim Cem; Işık, Oğuz; Department of Geodetic and Geographical Information Technologies (2005) Geographical Information Systems (GIS) have been rapidly developed in the fields that need spatial data and transportation planning is one of these fields. Since transportation data is spatially distributed and need spatial, statistical and network based analysis; GIS applications have contributions to transportation planning. In this study, it is aimed to determine a new public transportation mode and route in the METU campus with the aid of GIS by considering the stations of Çayyolu metro route. Besides, ...
Assessment of dynamic response FD algorithms by beam and plate FE computations Alaylioglu, H.; Oral, Süha; Alaylıoğlu, Ayşe (Elsevier BV, 1988-10) Improvement in understanding of the process of direct integration of the equations of motion through numerical dissipation parameter interaction is being regarded as one of the significant achievements of structural dynamics research over the past quarter century. The numerical software fraternity has extended one-step integration algorithms, emphasizing controllable approximation characteristics with respect to such factors as period elongation and amplitude decay. These studies have resulted in setting up...
Deep Metric Learning With Alternating Projections Onto Feasible Sets Can, Oğul; Gürbüz, Yeti Z.; Alatan, Abdullah Aydın (2021-01-01) Minimizers of the typical distance metric learning loss functions can be considered as "feasible points" satisfying a set of constraints imposed by the training data. We reformulate distance metric learning problem as finding a feasible point of a constraint set where the embedding vectors of the training data satisfy desired intra-class and inter-class proximity. The feasible set induced by the constraint set is expressed as the intersection of the relaxed feasible sets which enforce the proximity constrai...
A branch and bound algorithm for resource leveling problem Mutlu, Mustafa Çağdaş; Sönmez, Rifat; Department of Civil Engineering (2010) Resource Leveling Problem (RLP) aims to minimize undesired fluctuations in resource distribution curves which cause several practical problems. Many studies conclude that commercial project management software packages can not effectively deal with RLP. In this study a branch and bound algorithm is presented for solving RLP for single and multi resource, small size networks. The algorithm adopts a depth-first strategy and stores start times of non-critical activities in the nodes of the search tree. Optimal...

Citation Formats

O. Özgür, “Discrete tomographic reconstruction methods from the theories of optimization and inverse problems : application in VLSI microchip production,” M.S. - Master of Science, Middle East Technical University, 2006.