Instance-Level Relative Saliency Ranking with Graph Reasoning

• URL: http://arxiv.org/abs/2107.03824v1
• Date: Thu, 8 Jul 2021 13:10:42 GMT
• Title: Instance-Level Relative Saliency Ranking with Graph Reasoning
• Authors: Nian Liu, Long Li, Wangbo Zhao, Junwei Han, Ling Shao
• Abstract summary: We present a novel unified model to segment salient instances and infer relative saliency rank order. A novel loss function is also proposed to effectively train the saliency ranking branch. experimental results demonstrate that our proposed model is more effective than previous methods.
• Score: 126.09138829920627
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Conventional salient object detection models cannot differentiate the importance of different salient objects. Recently, two works have been proposed to detect saliency ranking by assigning different degrees of saliency to different objects. However, one of these models cannot differentiate object instances and the other focuses more on sequential attention shift order inference. In this paper, we investigate a practical problem setting that requires simultaneously segment salient instances and infer their relative saliency rank order. We present a novel unified model as the first end-to-end solution, where an improved Mask R-CNN is first used to segment salient instances and a saliency ranking branch is then added to infer the relative saliency. For relative saliency ranking, we build a new graph reasoning module by combining four graphs to incorporate the instance interaction relation, local contrast, global contrast, and a high-level semantic prior, respectively. A novel loss function is also proposed to effectively train the saliency ranking branch. Besides, a new dataset and an evaluation metric are proposed for this task, aiming at pushing forward this field of research. Finally, experimental results demonstrate that our proposed model is more effective than previous methods. We also show an example of its practical usage on adaptive image retargeting.

Related papers

• Exploiting Point-Wise Attention in 6D Object Pose Estimation Based on Bidirectional Prediction [22.894810893732416]
  The paper proposes a bidirectional correspondence prediction network with a point-wise attention-aware mechanism. Our key insight is that the correlations between each model point and scene point provide essential information for learning point-pair matches. Experimental results on the public datasets of LineMOD, YCB-Video, and Occ-LineMOD show that the proposed method achieves better performance than other state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-08-16T17:13:45Z)
• Unified Visual Relationship Detection with Vision and Language Models [89.77838890788638]
  This work focuses on training a single visual relationship detector predicting over the union of label spaces from multiple datasets. We propose UniVRD, a novel bottom-up method for Unified Visual Relationship Detection by leveraging vision and language models. Empirical results on both human-object interaction detection and scene-graph generation demonstrate the competitive performance of our model.
  arXiv  Detail & Related papers  (2023-03-16T00:06:28Z)
• Doubly Reparameterized Importance Weighted Structure Learning for Scene Graph Generation [40.46394569128303]
  Scene graph generation, given an input image, aims to explicitly model objects and their relationships by constructing a visually-grounded scene graph. We propose a novel doubly re parameterized importance weighted structure learning method, which employs a tighter importance weighted lower bound as the variational inference objective. The proposed method achieves the state-of-the-art performance on various popular scene graph generation benchmarks.
  arXiv  Detail & Related papers  (2022-06-22T20:00:25Z)
• Importance Weighted Structure Learning for Scene Graph Generation [40.46394569128303]
  We propose a novel importance weighted structure learning method for scene graph generation. A generic entropic mirror descent algorithm is applied to solve the resulting constrained variational inference task. The proposed method achieves the state-of-the-art performance on various popular scene graph generation benchmarks.
  arXiv  Detail & Related papers  (2022-05-14T09:25:14Z)
• Explicitly Modeling the Discriminability for Instance-Aware Visual Object Tracking [13.311777431243296]
  We propose a novel Instance-Aware Tracker (IAT) to excavate the discriminability of feature representations. We implement two variants of the proposed IAT, including a video-level one and an object-level one. Both versions achieve leading results against state-of-the-art methods while running at 30FPS.
  arXiv  Detail & Related papers  (2021-10-28T11:24:01Z)
• A Low Rank Promoting Prior for Unsupervised Contrastive Learning [108.91406719395417]
  We construct a novel probabilistic graphical model that effectively incorporates the low rank promoting prior into the framework of contrastive learning. Our hypothesis explicitly requires that all the samples belonging to the same instance class lie on the same subspace with small dimension. Empirical evidences show that the proposed algorithm clearly surpasses the state-of-the-art approaches on multiple benchmarks.
  arXiv  Detail & Related papers  (2021-08-05T15:58:25Z)
• From Canonical Correlation Analysis to Self-supervised Graph Neural Networks [99.44881722969046]
  We introduce a conceptually simple yet effective model for self-supervised representation learning with graph data. We optimize an innovative feature-level objective inspired by classical Canonical Correlation Analysis. Our method performs competitively on seven public graph datasets.
  arXiv  Detail & Related papers  (2021-06-23T15:55:47Z)
• One-Shot Object Detection without Fine-Tuning [62.39210447209698]
  We introduce a two-stage model consisting of a first stage Matching-FCOS network and a second stage Structure-Aware Relation Module. We also propose novel training strategies that effectively improve detection performance. Our method exceeds the state-of-the-art one-shot performance consistently on multiple datasets.
  arXiv  Detail & Related papers  (2020-05-08T01:59:23Z)
• Learning What Makes a Difference from Counterfactual Examples and Gradient Supervision [57.14468881854616]
  We propose an auxiliary training objective that improves the generalization capabilities of neural networks. We use pairs of minimally-different examples with different labels, a.k.a counterfactual or contrasting examples, which provide a signal indicative of the underlying causal structure of the task. Models trained with this technique demonstrate improved performance on out-of-distribution test sets.
  arXiv  Detail & Related papers  (2020-04-20T02:47:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.