This paper proposes an approach to image segmentation using Iterated Graph Cuts based on local texture features of wavelet coefficients. Using Haar Wavelet based Multiresolution Analysis, the lowfrequency range (smoothed image) is used for the n-link and the highfrequency range (local texture features) is used for the t-link along with the color histogram. The proposed method can segment an obj...

Introduction Osteoarthritis (OA), which is a common cause of disability, is associated with degradation of articular cartilage. Quantitative evaluation of knee cartilage requires segmentation of the cartilage which is challenging and laborious. For instance, manual delineation of cartilage boundaries by an expert often results in several hours per case and is subject to analyst bias and error. ...

In this appendix, we will show how the higher order energy potentials can be minimized using graph cuts. Since, graph cuts can efficiently minimize submodular functions, we will transform our higher order energy function (Eq. 9) to a submodular second order energy function. For the case of both αβ-swap and αexpansion move making algorithms, we will explain this transformation and the process of...

Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state in a finite number of rounds. Allowing two different states for each node induces a cut in the network graph. In each round, every node decides whether it is (locally) satisfied with the current cut. Afterwards all un...

This paper presents a new algorithm for reducing the minimal surface bias associated with volumetric graph cuts for 3D reconstruction from multiple calibrated images. The algorithm is based on an iterative graph-cut over narrow bands combined with an accurate surface normal estimation. At each iteration, we first optimize the normal to each surface patch in order to obtain a precise value for t...

The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptable amount of storage and computation time is required for the large images/volumes common in medical applications. The Banded Graph Cut (BGC) algorithm was proposed to drastically increase the computational speed of Gr...

Cone beam computed tomography (CBCT) can provide dentists with accurate 3D diagnostic images of the maxillofacial region at a lower irradiation dose compare to conventional medical CT. Due to low image contrast, higher image noise and missing image boundaries, tooth segmentation in CBCT is difficult even with experienced radiographic interpreters. In this paper, we proposed a graph cuts segment...

This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contribution of our method is the formulation of landmarks in the graph cut minimization framework. In the graph cut method, we add a penalty cost based on landmarks to the data energy. In the presence of a landmark, we adjust the T-link...