Higher-dimensional segmentation by minimum-cut algorithm

Hiroshi Ishikawa, Davi Geiger

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

It is important in many applications of 3D and higher dimensional segmentation that the resulting segments of voxels are not required to have only one connected component, as in some of extant methods. Indeed, it is generally necessary to be able to automatically determine the appropriate number of connected components. More generally, for a larger class of applications, the segments should have no topological restrictions at all. For instance, each connected component should be allowed to have as many holes as appropriate to fit the data. We propose a method based on a graph algorithm to automatically segment 3D and higher-dimensional images into two segments without user intervention, with no topological restriction on the solution, and in such a way that the solution is optimal under a precisely defined optimization criterion.

本文言語English
ホスト出版物のタイトルProceedings of the 9th IAPR Conference on Machine Vision Applications, MVA 2005
ページ488-491
ページ数4
出版ステータスPublished - 2005 12 1
外部発表はい
イベント9th IAPR Conference on Machine Vision Applications, MVA 2005 - Tsukuba Science City, Japan
継続期間: 2005 5 162005 5 18

出版物シリーズ

名前Proceedings of the 9th IAPR Conference on Machine Vision Applications, MVA 2005

Conference

Conference9th IAPR Conference on Machine Vision Applications, MVA 2005
CountryJapan
CityTsukuba Science City
Period05/5/1605/5/18

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

引用スタイル