A k-partition, graph theoretic approach to perceptual organization

被引：1

作者：

Byrne, J ^{[1
]}

Gandhe, A ^{[1
]}

Prasanth, RK ^{[1
]}

Ravichandan, B ^{[1
]}

Huff, M ^{[1
]}

Mehra, RK ^{[1
]}

Sarkar, S ^{[1
]}

机构：

[1] Sci Syst Co Inc, Woburn, MA USA

来源：

INTERNATIONAL CONFERENCE ON INTEGRATION OF KNOWLEDGE INTENSIVE MULTI-AGENT SYSTEMS: KIMAS'03: MODELING, EXPLORATION, AND ENGINEERING | 2003年

关键词：

D O I：

10.1109/KIMAS.2003.1245067

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper presents an k-partition, graph theoretic approach to perceptual organization. Principal results include a generalization of the bi-partition normalized cut to a k-partition measure, and a derivation of a sub-optimal, polynomial time solution to the NP-hard k-partition problem. The solution is obtained by first relaxing to an eigenvalue problem, followed by a heuristic procedure to enforce feasible solutions. This approach is a departure from the standard k-partitioning graph literature in that the partition measure used is non-quadratic, and is a departure from image segmentation literature in that k-partitioning is used in place of a recursive bi-partition. We apply this approach to image segmentation of infra-red (IR) images, and show representative segmentation results. Initial results show promise for further investigation.

引用

页码：336 / 342

页数：7

共 21 条

[1] INTERIOR-POINT METHODS IN SEMIDEFINITE PROGRAMMING WITH APPLICATIONS TO COMBINATORIAL OPTIMIZATION [J].