| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 概要 |
The article presents applications of graph cuts in the image processing. We describe the original Ford–Fulkerson algorithm and its modification -Edmonds-Karp algorithm. We also present our modificatio...ns of this algorithm. These modifications lead to a major acceleration of the segmentation process, which is demonstrated using real images of a left ventricle. Although the results are not equivalent to the non-modified algorithm, this modification is suitable for our application.続きを見る
|
| 目次 |
1.Introduction 2.Graph cuts in image segmentation 3.Construction of the graph 4.Finding the minimum s–t cut 5.Modifications of the algorithm 6.Results 7.Conclusion
|
Mendeley出力
