Adaptive Graph Convolutional Network with Attention Graph Clustering for Co-saliency Detection
Co-saliency detection aims to discover the common and salient foregrounds from a group of relevant images. For this task, we present a novel adaptive graph convolutional network with attention graph clustering (GCAGC). Three major contributions have been made, and are experimentally shown to have substantial practical merits. First, we propose a graph convolutional network design to extract information cues to characterize the intra- and interimage correspondence. Second, we develop an attention graph clustering algorithm to discriminate the common objects from all the salient foreground objects in an unsupervised fashion. Third, we present a unified framework with encoder-decoder structure to jointly train and optimize the graph convolutional network, attention graph cluster, and co-saliency detection decoder in an end-to-end manner. We evaluate our proposed GCAGC method on three cosaliency detection benchmark datasets (iCoseg, Cosal2015 and COCO-SEG). Our GCAGC method obtains significant improvements over the state-of-the-arts on most of them.
Code (1)
Tasks
ClusteringCo-Salient Object DetectionDecoderGraph ClusteringSaliency DetectionSimilar Papers 제목 키워드 기반
Attention-driven Graph Clustering Network
The combination of the traditional convolutional network (i.e., an auto-encoder) and the graph convolutional network has attracted much attention in clustering, in which the auto-encoder extracts the node attribute featu…
AttributeClusteringDeep ClusteringGraph ClusteringAdaptive Graph Convolutional Subspace Clustering
Spectral-type subspace clustering algorithms have shown excellent performance in many subspace clustering applications. The existing spectral-type subspace clustering algorithms either focus on designing constraints for …
ClusteringMultiview Subspace Clustering of Hyperspectral Images based on Graph Convolutional Networks
High-dimensional and complex spectral structures make clustering of hy-perspectral images (HSI) a challenging task. Subspace clustering has been shown to be an effective approach for addressing this problem. However, cur…
ClusteringSmoothness Sensor: Adaptive Smoothness-Transition Graph Convolutions for Attributed Graph Clustering
Clustering techniques attempt to group objects with similar properties into a cluster. Clustering the nodes of an attributed graph, in which each node is associated with a set of feature attributes, has attracted signifi…
ClusteringGraph ClusteringContrastive Multi-view Subspace Clustering of Hyperspectral Images based on Graph Convolutional Networks
High-dimensional and complex spectral structures make the clustering of hyperspectral images (HSI) a challenging task. Subspace clustering is an effective approach for addressing this problem. However, current subspace c…
ClusteringContrastive LearningMulti-view Subspace Clustering