arrow
返回

Segmentation strategies for the alpha-tree data structure

delete2020-01-01
delete2
PRE
AI
G
Georgios K. Ouzounis *
DOI:10.1016/j.patrec.2019.11.027delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The alpha-tree is a versatile algorithm for color image segmentation employing attribute constraints to control the partitioning of the alpha-connected image space. Attribute constraints are enforced using a maximization strategy that returns the set of the largest connected components complying with these constraints assuming no prior violations from nested sub-components. This article presents two new strategies extending the way this set is defined. These are the non-target clustering and attribute maximization strategies, that give access to segments that could not be defined previously. Collectively they enable the handling of texture-rich regions that cannot be clustered into meaningful segments, and compute the unsupervised segmentation of images by seeking for extreme attribute values. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Segmentation
Clustering
Alpha-tree
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition Letters 封面图
Pattern Recognition Letters
IF:
3.3
论文数:
8.0K
被引数:
1.6W

机构

K
Kaunas University of Applied Engineering Sciences
学者数:
14
论文数: 9
被引数: 5
引用论文

引用论文

Algorithmic complexity of quantum capacity
err2018-03-02
err0
errOAAI
errSamad Khabbazi Oskouei; Stefano Mancini
err分享
err收藏
err分享
err收藏
学者 查看更多内容