Recursive shortest spaning tree algorithms for image segmentation

Download
2005
Bayramoğlu, Neslihan Yalçın
Image segmentation has an important role in image processing because it is a tool to obtain higher level object descriptions for further processing. In some applications such as large image databases or video image sequence segmentations, the speed of the segmentation algorithm may become a drawback of the application. This thesis work is a study to improve the run-time performance of a well-known segmentation algorithm, namely the Recursive Shortest Spanning Tree (RSST). Both the original and the fast RSST found in the literature are analyzed and a comparison is made between these techniques. Simple modifications and an alternative link cost structure are proposed and evaluated. Finally, a distributed implementation based on a simple image partitioning strategy is attempted. The thesis presents the results of an extensive computational study with respect to both run-time performance and image segmentation quality.

Suggestions

Comparison of rough multi layer perceptron and rough radial basis function networks using fuzzy attributes
Vural, Hülya; Alpaslan, Ferda Nur; Department of Computer Engineering (2004)
The hybridization of soft computing methods of Radial Basis Function (RBF) neural networks, Multi Layer Perceptron (MLP) neural networks with back-propagation learning, fuzzy sets and rough sets are studied in the scope of this thesis. Conventional MLP, conventional RBF, fuzzy MLP, fuzzy RBF, rough fuzzy MLP, and rough fuzzy RBF networks are compared. In the fuzzy neural networks implemented in this thesis, the input data and the desired outputs are given fuzzy membership values as the fuzzy properties أlow...
3D object recognition from range images using transform invariant object representation
AKAGÜNDÜZ, erdem; Ulusoy, İlkay (Institution of Engineering and Technology (IET), 2010-10-28)
3D object recognition is performed using a scale and orientation invariant feature extraction method and a scale and orientation invariant topological representation. 3D surfaces are represented by sparse, repeatable, informative and semantically meaningful 3D surface structures, which are called multiscale features. These features are extracted with their scale (metric size and resolution) using the classified scale-space of 3D surface curvatures. Triplets of these features are used to represent the surfac...
Category knowledge, skeleton-based shape matching and shape classification
Erdem, İbrahim Aykut; Tarı, Zehra Sibel; Department of Computer Engineering (2008)
Skeletal shape representations, in spite of their structural instabilities, have proven themselves as effective representation schemes for recognition and classification of visual shapes. They capture part structure in a compact and natural way and provide insensitivity to visual transformations such as occlusion and articulation of parts. In this thesis, we explore the potential use of disconnected skeleton representation for shape recognition and shape classification. Specifically, we first investigate th...
3D face reconstruction using stereo images and structured light
Öztürk, Ahmet Oğuz; Halıcı, Uğur; Department of Electrical and Electronics Engineering (2007)
Nowadays, 3D modelling of objects from multiple images is a topic that has gained great recognition and is widely used in various fields. Recently, lots of progress has been made in identification of people using 3D face models, which are usually reconstructed from multiple face images. In this thesis, a system including stereo cameras and structured light is built for the purpose of 3D modelling. The system outputs are 3D shapes of the face and also the texture information registered to this shape. Althoug...
Part embedding for shape grammars
Yalım Keleş, Hacer; Özkâr, Mine; Department of Computer Engineering (2010)
Computational modeling of part relations of shapes is a challenging problem that has been addressed by many researchers since sixties. The most important source of the difficulty is the continuous nature of shapes, which makes the expression of shape very difficult in terms of discrete parts. When discrete parts are combined, they fuse and yield new parts, i.e. parts emerge. There is a number of methods that support emergent part detection. However all of these methods are based on strong assumptions in ter...
Citation Formats
N. Y. Bayramoğlu, “Recursive shortest spaning tree algorithms for image segmentation,” M.S. - Master of Science, Middle East Technical University, 2005.