Supervised learning of large perceptual organization: Graph spectral partitioning and learning automata

被引:126
|
作者
Sarkar, S [1 ]
Soundararajan, P [1 ]
机构
[1] Univ S Florida, Dept Comp Sci & Engn, Tampa, FL 33620 USA
基金
美国国家科学基金会;
关键词
perceptual organization; learning in vision; learning automata; Bayesian networks; feature grouping; object recognition; figure ground segmentation;
D O I
10.1109/34.857006
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Perceptual organization offers an elegant framework to group low-level features that are likely to come from a single object. We offer a novel strategy to adapt this grouping process to objects in a domain. Given a set of training images of objects in context, the associated learning process decides on the relative importance of the basic salient relationships such as proximity, parallelness, continuity, junctions, and common region toward segregating the objects from the background. The parameters of the grouping process are cast as probabilistic specifications of Bayesian networks that need to be learned. This learning is accomplished using a team of stochastic automata in an N-player cooperative game framework. The grouping process, which is based on graph partitioning is, able to form large groups from relationships defined over a small set of primitives and is fast. We statistically demonstrate the robust performance of the grouping and the learning frameworks on a variety of real images. Among the interesting conclusions are the significant role of photometric attributes in grouping and the ability to form large salient groups from a set of local relations, each defined over a small number of primitives.
引用
收藏
页码:504 / 525
页数:22
相关论文
共 50 条
  • [1] Graph partitioning using learning automata
    Oommen, BJ
    deStCroix, EV
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (02) : 195 - 208
  • [2] ON USING LEARNING AUTOMATA FOR FAST GRAPH PARTITIONING
    OOMMEN, BJ
    DESTCROIX, EV
    [J]. LATIN '95: THEORETICAL INFORMATICS, 1995, 911 : 449 - 460
  • [3] Deep Learning and Spectral Embedding for Graph Partitioning
    Gatti, Alice
    Hu, Zhixiong
    Smidt, Tess
    Ng, Esmond G.
    Ghysels, Pieter
    [J]. PROCEEDINGS OF THE 2022 SIAM CONFERENCE ON PARALLEL PROCESSING FOR SCIENTIFIC COMPUTING, PP, 2022, : 25 - 36
  • [4] PERCEPTUAL ORGANIZATION AND LEARNING
    KOHLER, W
    [J]. AMERICAN JOURNAL OF PSYCHOLOGY, 1958, 71 (01): : 311 - 315
  • [5] Learning Graph Similarity With Large Spectral Gap
    Wu, Zongze
    Liu, Sihui
    Ding, Chris
    Ren, Zhigang
    Xie, Shengli
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2021, 51 (03): : 1590 - 1600
  • [6] A multi-teacher learning automata computing model for graph partitioning problems
    Ikebo, S
    Qian, F
    Hirata, H
    [J]. ELECTRICAL ENGINEERING IN JAPAN, 2004, 148 (01) : 46 - 53
  • [7] Learning Graph Cellular Automata
    Grattarola, Daniele
    Livi, Lorenzo
    Alippi, Cesare
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [8] Graph learning by interacting automata
    Burdonov, I. B.
    Kossatchev, A. S.
    [J]. VESTNIK TOMSKOGO GOSUDARSTVENNOGO UNIVERSITETA-UPRAVLENIE VYCHISLITELNAJA TEHNIKA I INFORMATIKA-TOMSK STATE UNIVERSITY JOURNAL OF CONTROL AND COMPUTER SCIENCE, 2014, 28 (03): : 67 - 75
  • [9] Large Margin Graph Construction for Semi-Supervised Learning
    Guo, Lan-Zhe
    Wang, Shao-Bo
    Li, Yu-Feng
    [J]. 2018 18TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS (ICDMW), 2018, : 1030 - 1033
  • [10] Supervised Learning of Graph Structure
    Torsello, Andrea
    Rossi, Luca
    [J]. SIMILARITY-BASED PATTERN RECOGNITION: FIRST INTERNATIONAL WORKSHOP, SIMBAD 2011, 2011, 7005 : 117 - 132