2Pw9fDLt18eHjOM1pBlDTPRLAN53741keT4WFUi9wgVq56fECcJ4ppObbN8j
  • 其他栏目

    戚金清

    • 副教授     硕士生导师
    • 性别:男
    • 毕业院校:东京工业大学
    • 学位:博士
    • 所在单位:信息与通信工程学院
    • 学科:通信与信息系统. 信号与信息处理
    • 电子邮箱:

    访问量:

    开通时间:..

    最后更新时间:..

    论文成果

    当前位置: 中文主页 >> 科学研究 >> 论文成果
    Salient object detection via point-to-set metric learning

    点击次数:

      发布时间:2019-03-12

      论文类型:期刊论文

      发表时间:2016-12-01

      发表刊物:PATTERN RECOGNITION LETTERS

      收录刊物:Scopus、EI、SCIE

      卷号:84

      页面范围:85-90

      ISSN号:0167-8655

      关键字:Salient object detection; Metric learning; Point-to-set classification

      摘要:Distance metric is an essential step of salient object detection, in which the pairwise distances are often used to distinguish salient image elements (pixels and regions) from background elements. Instead of using the point-to-point distance metrics which possibly implicitly take into account the context information around data points, we learn the point-to-set metric to explicitly compute the distances of single points to sets of correlated points and cast saliency estimation as the problem of point-to-set classification. First, we generate a series of bounding box proposals and region proposals for an input image (i. e., some pre-detected regions which possibly include object instances), and exploit them to compute a recall-preference saliency map and a precision-preference one, based on which the background and foreground seed regions are respectively determined. Next, we collect positive and negative samples (include point samples and set samples) to learn the point-to-set distance metric, and employ it to classify the image elements into foreground and background classes. Last, we update the training samples and refine the classification result. The proposed approach is evaluated on three large publicly available datasets with pixel accurate annotations. Extensive experiments clearly demonstrate the superiority of the proposed approach over the state-of-the-art approaches. (C) 2016 Elsevier B. V. All rights reserved.