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
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
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
Edge strength functions as shape priors in image segmentation
Date
2005-12-01
Author
Erdem, Erkut
Erdem, Aykut
Tarı, Zehra Sibel
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
220
views
0
downloads
Cite This
Many applications of computer vision requires segmenting out of an object of interest from a given image. Motivated by unlevel-sets formulation of Raviv, Kiryati and Sochen [8] and statistical formulation of Leventon, Grimson and Faugeras [6], we present a new image segmentation method which accounts for prior shape information. Our method depends on Ambrosio-Tortorelli approximation of Mumford-Shah functional. The prior shape is represented by a by-product of this functional, a smooth edge indicator function, known as the "edge strength function", which provides a distance-like surface for the shape boundary. Our method can handle arbitrary deformations due to shape variability as well as plane Euclidean transformations. The method is also robust with respect to noise and missing parts. Furthermore, this formulation does not require simple closed curves as in a typical level set formulation. © Springer-Verlag Berlin Heidelberg 2005.
Subject Keywords
Image segmentation
,
Segmentation result
,
Active contour
,
Shape boundary
,
Simple closed curf
URI
https://hdl.handle.net/11511/55831
DOI
https://doi.org/10.1007/11585978_32
Collections
Department of Computer Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Edge strength functions as shape priors in image segmentation
Erdem, E; Erdem, A; Tari, S (2005-01-01)
Many applications of computer vision requires segmenting out of an object of interest from a given image. Motivated by unlevel-sets formulation of Raviv, Kiryati and Sochen [8] and statistical formulation of Leventon, Crimson and Faugeras [6], we present a new image segmentation method which accounts for prior shape information. Our method depends on Ambrosio-Tortorelli approximation of Mumford-Shah functional. The prior shape is represented by a by-product of this functional, a smooth edge indicator functi...
Object recognition and segmentation via shape models
Altınoklu, Metin Burak; Ulusoy, İlkay; Tarı, Zehra Sibel; Department of Electrical and Electronics Engineering (2016)
In this thesis, the problem of object detection, recognition and segmentation in computer vision is addressed with shape based methods. An efficient object detection method based on a sparse skeleton has been proposed. The proposed method is an improved chamfer template matching method for recognition of articulated objects. Using a probabilistic graphical model structure, shape variation is represented in a skeletal shape model, where nodes correspond to parts consisting of lines and edges correspond to pa...
Recursive shortest spanning tree algorithms for image segmentation
Bayramoglu, NY; Bazlamaçcı, Cüneyt Fehmi (2005-11-24)
Image segmentation has an important role in image processing and the speed of the segmentation algorithm may become a drawback for some applications. This study analyzes the run time performances of some variations of the Recursive Shortest Spanning Tree Algorithm (RSST) and proposes simple but effective modifications on these algorithms to improve their speeds. In addition, the effect of link weight cost function on the run time performance and the segmentation quality is examined. For further improvement ...
Image segmentation with unified region and boundary characteristics within recursive shortest spanning tree
Esen, E.; Alp, Y. K. (2007-06-13)
The lack of boundary information in region based image segmentation algorithms resulted in many hybrid methods that integrate the complementary information sources of region and boundary, in order to increase the segmentation performance. In compliance with this trend, we propose a novel method to unify the region and boundary characteristics within the canonical Recursive Shortest Spanning Tree algorithm. The main idea is to incorporate the boundary information in the distance metric of RSST with minor cha...
Supervised mesh segmentation for 3D objects with graph Convolutional neural networks
Perek, Emir Kaan; Sahillioğlu, Yusuf; Department of Computer Engineering (2019)
Mesh segmentation is a fundamental application that is primarily used for understanding and analyzing 3D shapes in a broad range of areas in Computer Science. With the increasing trend of deep learning, there have been many learning-based solutions to the mesh segmentation problem based on the classification of the individual mesh polygons. In this thesis, we cast mesh segmentation as a supervised graph labeling problem by using Graph Convolutional Neural Networks (GCNN). We treat a mesh object as a graph t...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Erdem, A. Erdem, and Z. S. Tarı, “Edge strength functions as shape priors in image segmentation,” 2005, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55831.