Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Higher order levelable mrf energy minimization via graph cuts
Download
index.pdf
Date
2008
Author
Karcı, Mehmet Haydar
Metadata
Show full item record
Item Usage Stats
174
views
53
downloads
Cite This
A feature of minimizing images of a class of binary Markov random field energies is introduced and proved. Using this, the collection of minimizing images of levels of higher order, levelable MRF energies is shown to be a monotone collection. This implies that these images can be combined to give minimizing images of the MRF energy itself. Due to the recent developments, second and third order binary MRF energies of the mentioned class are known to be exactly minimized by maximum flow/minimum cut computations on appropriately constructed graphs. With the aid of these developments an exact and efficient algorithm to minimize levelable second and third order MRF energies, which is composed of a series of maximum flow/minimum cut computations, is proposed and applications of the proposed algorithm to image restoration are given.
Subject Keywords
Electrical engineering.
,
Computer engineering.
URI
http://etd.lib.metu.edu.tr/upload/12609408/index.pdf
https://hdl.handle.net/11511/17620
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Monte Carlo analysis of ridged waveguides with transformation media
Ozgun, Ozlem; Kuzuoğlu, Mustafa (Wiley, 2013-07-01)
A computational model is presented for Monte Carlo simulation of waveguides with ridges, by combining the principles of transformation electromagnetics and the finite methods (such as finite element or finite difference methods). The principle idea is to place a transformation medium around the ridge structure, so that a single and easy-to-generate mesh can be used for each realization of the Monte Carlo simulation. Hence, this approach leads to less computational resources. The technique is validated by me...
CBFEM-MPI: A Parallelized Version of Characteristic Basis Finite Element Method for Extraction of 3-D Interconnect Capacitances
Ozgun, Ozlem; Mittra, Raj; Kuzuoğlu, Mustafa (Institute of Electrical and Electronics Engineers (IEEE), 2009-02-01)
In this paper, we present a novel, non-iterative domain decomposition method, which has been parallelized by using the message passing interface (MPI) library, and used to efficiently extract the capacitance matrixes of 3-D interconnect structures, by employing characteristic basis functions (CBFs) in the context of the finite element method (FEM). In this method, which is Failed CBFEM-MPI, the computational domain is partitioned into a number of nonoverlapping subdomains in which the CBFs are constructed b...
Improvements to neural network based restoration in optical networks
Türk, Fethi; Bilgen, Semih; Department of Electrical and Electronics Engineering (2008)
Performance of neural network based restoration of optical networks is evaluated and a few possible improvements are proposed. Neural network based restoration is simulated with optical link capacities assigned by a new method. Two new improvement methods are developed to reduce the neural network size and the restoration time of severed optical connections. Cycle based restoration is suggested, which reduces the neural network structure by restoring the severed connections for each optical node, iterativel...
Minimization of Monotonically Levelable Higher Order MRF Energies via Graph Cuts
Karci, Mehmet Haydar; Demirekler, Mübeccel (Institute of Electrical and Electronics Engineers (IEEE), 2010-11-01)
A feature of minimizing images of submodular binary Markov random field (MRF) energies is introduced. Using this novel feature, the collection of minimizing images of levels of higher order, monotonically levelable multilabel MRF energies is shown to constitute a monotone collection. This implies that these minimizing binary images can be combined to give minimizing images of the multilabel MRF energies. Thanks to the graph cuts framework, the mentioned class of binary MRF energies is known to be minimized ...
Iterative leap-field domain decomposition method: a domain decomposition finite element algorithm for 3D electromagnetic boundary value problems
Ozgun, O.; Kuzuoğlu, Mustafa (Institution of Engineering and Technology (IET), 2010-04-01)
The authors introduce the iterative leap-field domain decomposition method that is tailored to the finite element method, by combining the concept of domain decomposition and the Huygens' Principle. In this method, a large-scale electromagnetic boundary value problem is partitioned into a number of suitably-defined 'small' and manageable subproblems whose solutions are assembled to obtain the global solution. The main idea of the method is the iterative application of the Huygens' Principle to the fields ra...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. H. Karcı, “Higher order levelable mrf energy minimization via graph cuts,” Ph.D. - Doctoral Program, Middle East Technical University, 2008.
