Spectral Image Segmentation with Global Appearance Modeling

• URL: http://arxiv.org/abs/2006.06573v2
• Date: Thu, 6 Oct 2022 22:14:05 GMT
• Title: Spectral Image Segmentation with Global Appearance Modeling
• Authors: Jeova F. S. Rocha Neto and Pedro F. Felzenszwalb
• Abstract summary: We introduce a new spectral method for image segmentation that incorporates long range relationships for global appearance modeling. The approach combines two different graphs, one is a sparse graph that captures spatial relationships between nearby pixels and another is a dense graph that captures pairwise similarity between all pairs of pixels.
• Score: 0.913755431537592
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a new spectral method for image segmentation that incorporates long range relationships for global appearance modeling. The approach combines two different graphs, one is a sparse graph that captures spatial relationships between nearby pixels and another is a dense graph that captures pairwise similarity between all pairs of pixels. We extend the spectral method for Normalized Cuts to this setting by combining the transition matrices of Markov chains associated with each graph. We also derive an efficient method for sparsifying the dense graph of appearance relationships. This leads to a practical algorithm for segmenting high-resolution images. The resulting method can segment challenging images without any filtering or pre-processing.

Related papers

• Parallax-tolerant Image Stitching via Segmentation-guided Multi-homography Warping [14.098118907921947]
  We propose a novel image stitching method using multi-homography warping guided by image segmentation. Our method provides the best alignment accuracy by a large margin, compared with the state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-06-28T13:51:59Z)
• Ensemble Quadratic Assignment Network for Graph Matching [52.20001802006391]
  Graph matching is a commonly used technique in computer vision and pattern recognition. Recent data-driven approaches have improved the graph matching accuracy remarkably. We propose a graph neural network (GNN) based approach to combine the advantages of data-driven and traditional methods.
  arXiv  Detail & Related papers  (2024-03-11T06:34:05Z)
• A Sparse Graph Formulation for Efficient Spectral Image Segmentation [0.0]
  Spectral Clustering is one of the most traditional methods to solve segmentation problems. We adopt a sparse graph formulation based on the inclusion of extra nodes to a simple grid graph. Applying the original Normalized Cuts algorithm to this graph leads to a simple and scalable method for spectral image segmentation.
  arXiv  Detail & Related papers  (2023-06-22T19:06:27Z)
• Joint Dense-Point Representation for Contour-Aware Graph Segmentation [2.138299283227551]
  We present a novel methodology that combines graph and dense segmentation techniques by jointly learning both point and pixel contour representations. This addresses deficiencies in typical graph segmentation methods where misaligned objectives restrict the network from learning discriminative and contour features. Our approach is validated on several Chest X-ray datasets, demonstrating clear improvements in segmentation stability and accuracy.
  arXiv  Detail & Related papers  (2023-06-21T10:07:17Z)
• Adaptive Fusion Affinity Graph with Noise-free Online Low-rank Representation for Natural Image Segmentation [3.7189024338041836]
  We propose an adaptive affinity fusion graph (AFA-graph) with noise-free low-rank representation in an online manner for natural image segmentation. Experimental results on the BSD300, BSD500, MSRC, and PASCAL VOC show the effectiveness of AFA-graph in comparison with state-of-the-art approaches.
  arXiv  Detail & Related papers  (2021-10-22T10:15:27Z)
• Joint Graph Learning and Matching for Semantic Feature Correspondence [69.71998282148762]
  We propose a joint emphgraph learning and matching network, named GLAM, to explore reliable graph structures for boosting graph matching. The proposed method is evaluated on three popular visual matching benchmarks (Pascal VOC, Willow Object and SPair-71k) It outperforms previous state-of-the-art graph matching methods by significant margins on all benchmarks.
  arXiv  Detail & Related papers  (2021-09-01T08:24:02Z)
• Spectral-Spatial Global Graph Reasoning for Hyperspectral Image Classification [50.899576891296235]
  Convolutional neural networks have been widely applied to hyperspectral image classification. Recent methods attempt to address this issue by performing graph convolutions on spatial topologies.
  arXiv  Detail & Related papers  (2021-06-26T06:24:51Z)
• Spatial-spectral Hyperspectral Image Classification via Multiple Random Anchor Graphs Ensemble Learning [88.60285937702304]
  This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE) Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region. Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
  arXiv  Detail & Related papers  (2021-03-25T09:31:41Z)
• Multilayer Clustered Graph Learning [66.94201299553336]
  We use contrastive loss as a data fidelity term, in order to properly aggregate the observed layers into a representative graph. Experiments show that our method leads to a clustered clusters w.r.t. We learn a clustering algorithm for solving clustering problems.
  arXiv  Detail & Related papers  (2020-10-29T09:58:02Z)
• Wasserstein-based Graph Alignment [56.84964475441094]
  We cast a new formulation for the one-to-many graph alignment problem, which aims at matching a node in the smaller graph with one or more nodes in the larger graph. We show that our method leads to significant improvements with respect to the state-of-the-art algorithms for each of these tasks.
  arXiv  Detail & Related papers  (2020-03-12T22:31:59Z)

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.