Seed segmentation methods are highly regarded for their effectiveness in processing complex images, user-friendliness, and compatibility with graph-based representations. However, these methods often depend on intrica...
详细信息
Seed segmentation methods are highly regarded for their effectiveness in processing complex images, user-friendliness, and compatibility with graph-based representations. However, these methods often depend on intricate computational tools, leading to issues such as poor image contour adherence and incomplete seed propagation. To address these limitations, this paper proposes an interactive framework that integrates global seed information with sparse local linear reconstruction regularization (GSSR). In this framework, a Gaussian mixture model is firstly employed to construct a flow of global seed information, establishing connections between pixel points and yielding more complete segmented objects. Additionally, the L-p(0 < p <= 1) norm is utilized to constrain the sparse local reconstruction term, facilitating the generation of sparse boundaries. An iterative process based on the Alternating Direction Method of Multipliers (ADMM) is developed to solve the L1 regularization term, which is then generalized for the L-p problem through reweighting. We conduct a comprehensive comparison on the BSD dataset, CVC-ClinicDB datasets and two publicly available MSRC datasets with different labeling schemes. Extensive experimental validation demonstrates that the proposed method outperforms existing *** source code and datasets are openly available at: https://***/choppy-water/GSSR.
Integration of diverse visual prompts like clicks, scribbles, and boxes in interactive image segmentation significantly facilitates users' interaction as well as improves interaction efficiency. However, existing ...
详细信息
Integration of diverse visual prompts like clicks, scribbles, and boxes in interactive image segmentation significantly facilitates users' interaction as well as improves interaction efficiency. However, existing studies primarily encode the position or pixel regions of prompts without considering the contextual areas around them, resulting in insufficient prompt feedback, which is not conducive to performance acceleration. To tackle this problem, this paper proposes a simple yet effective Probabilistic Visual Prompt Unified Transformer (PVPUFormer) for interactive image segmentation, which allows users to flexibly input diverse visual prompts with the probabilistic prompt encoding and feature post-processing to excavate sufficient and robust prompt features for performance boosting. Specifically, we first propose a Probabilistic Prompt-unified Encoder (PPuE) to generate a unified one-dimensional vector by exploring both prompt and non-prompt contextual information, offering richer feedback cues to accelerate performance improvement. On this basis, we further present a Prompt-to-Pixel Contrastive (P2C) loss to accurately align both prompt and pixel features, bridging the representation gap between them to offer consistent feature representations for mask prediction. Moreover, our approach designs a Dual-cross Merging Attention (DMA) module to implement bidirectional feature interaction between image and prompt features, generating notable features for performance improvement. A comprehensive variety of experiments on several challenging datasets demonstrates that the proposed components achieve consistent improvements, yielding state-of-the-art interactivesegmentation performance. Our code is available at https://***/XuZhang1211/PVPUFormer.
In the task of interactive image segmentation, user interactions about the object of interest are accepted to predict the segmentation mask. Recent works have demonstrated state-of-the-art results by using either back...
详细信息
In the task of interactive image segmentation, user interactions about the object of interest are accepted to predict the segmentation mask. Recent works have demonstrated state-of-the-art results by using either backpropagating refinement or iterative training scheme, which are computationally expensive. In this paper, we propose a novel method for interactive image segmentation using conditional generative adversarial networks to enforce higher-order consistency in the segmentation, without extra post-processing during inference. Concretely, we develop a new segmentation network which integrates three different modules by providing global contextual information and attentions and conducting feature fusions across multiple layers. This allows the segmentation network to learn strong object representations and predict more accurate segmentations. We then employ a fully convolutional discriminator to detect and correct higher-order inconsistency between the predictions of the segmentation network and the ground truth label maps. To achieve this, we optimize an objective function that combines the conventional segmentation loss with the adversarial loss of the adversarial term. We train our network on the Pascal VOC 2012 and MS COCO 2017 datasets and conduct comprehensive experiments on four benchmark datasets. Experimental results show that the adversarial training to the network architecture has improved segmentation results over state-of-the-art methods, while making the current system efficient in terms of speed.
With the development of computer vision and digital image processing technology, imagesegmentation has become an important part of various image processing and image analysis. Since interactivesegmentation can obtai...
详细信息
With the development of computer vision and digital image processing technology, imagesegmentation has become an important part of various image processing and image analysis. Since interactivesegmentation can obtain more accurate results than automatic segmentation, the most representative Graph Cuts has gradually become a popular method in imagesegmentation. However, this algorithm has two significant disadvantages. On the one hand, if the background is complex or very similar to the foreground, the accuracy will be low;on the other hand, the algorithm is slow and the iteration process is complicated. To improve it, this paper proposes a new imagesegmentation algorithm based on quantum annealing and Graph Cuts. The algorithm beds the classical interactive image segmentation problem into a quantum optimization algorithm and obtains ideal imagesegmentation results on the D-Wave quantum annealer. Meanwhile, it is compared with the other three methods. Compared with MATLAB, the segmentation results are more beautiful, with an average precision higher than 5.27% and an average recall higher than 5.43%;the quantum annealing time is always lower than the simulated annealing time;and the success probability is more than twice that of the quantum approximate optimization algorithm. Therefore, it is concluded that this method is superior.
Geodesic models are known as an efficient tool for solving various imagesegmentation problems. Most of existing approaches only exploit local pointwise image features to track geodesic paths for delineating the objec...
详细信息
Geodesic models are known as an efficient tool for solving various imagesegmentation problems. Most of existing approaches only exploit local pointwise image features to track geodesic paths for delineating the objective boundaries. However, such a segmentation strategy cannot take into account the connectivity of the image edge features, increasing the risk of shortcut problem, especially in the case of complicated scenario. In this work, we introduce a new imagesegmentation model based on the minimal geodesic framework in conjunction with an adaptive cut-based circular optimal path computation scheme and a graph-based boundary proposals grouping scheme. Specifically, the adaptive cut can disconnect the image domain such that the target contours are imposed to pass through this cut only once. The boundary proposals are comprised of precomputed image edge segments, providing the connectivity information for our segmentation model. These boundary proposals are then incorporated into the proposed imagesegmentation model, such that the target segmentation contours are made up of a set of selected boundary proposals and the corresponding geodesic paths linking them. Experimental results show that the proposed model indeed outperforms state-of-the-art minimal paths-based imagesegmentation approaches.
Although interactive image segmentation techniques have made significant progress, supervised learning-based methods rely heavily on large-scale labeled data which is difficult to obtain in certain domains such as med...
详细信息
Although interactive image segmentation techniques have made significant progress, supervised learning-based methods rely heavily on large-scale labeled data which is difficult to obtain in certain domains such as medicine, biology, etc. Models trained on natural images also struggle to achieve satisfactory results when directly applied to these domains. To solve this dilemma, we propose a Self-supervised interactivesegmentation (SIS) method that achieves superior generalization performance. By clustering features from unlabeled data, we obtain classifiers that assign pseudo-labels to pixels in images. After refinement by super-pixel voting, these pseudo-labels are then used to train our segmentation network. To enable our network to better adapt to cross-domain images, we introduce correction learning and anti-forgetting regularization to conduct test-time adaptation. Our experiment results on five datasets show that our approach significantly outperforms other interactivesegmentation methods across natural image datasets in the same conditions and achieves even better performance than some supervised methods when across to medical image domain. The code and models are available at https://***/leal0110/SIS.
interactive image segmentation (IIS) has been widely used in various fields, such as medicine, industry, etc. However, some core issues, such as pixel imbalance, remain unresolved so far. Different from existing metho...
详细信息
interactive image segmentation (IIS) has been widely used in various fields, such as medicine, industry, etc. However, some core issues, such as pixel imbalance, remain unresolved so far. Different from existing methods based on pre-processing or post-processing, we analyze the cause of pixel imbalance in depth from the two perspectives of pixel number and pixel difficulty. Based on this, a novel and unified Click-pixel Cognition Fusion network with Balanced Cut (CCF-BC) is proposed in this paper. On the one hand, the Click-pixel Cognition Fusion (CCF) module, inspired by the human cognition mechanism, is designed to increase the number of click-related pixels (namely, positive pixels) being correctly segmented, where the click and visual information are fully fused by using a progressive three-tier interaction strategy. On the other hand, a general loss, Balanced Normalized Focal Loss (BNFL), is proposed. Its core is to use a group of control coefficients related to sample gradients and forces the network to pay more attention to positive and hard-to-segment pixels during training. As a result, BNFL always tends to obtain a balanced cut of positive and negative samples in the decision space. Theoretical analysis shows that the commonly used Focal and BCE losses can be regarded as special cases of BNFL. Experiment results of five well-recognized datasets have shown the superiority of the proposed CCF-BC method compared to other state-of-the-art methods. The source code is publicly available at https://***/lab206/CCF-BC.
interactive image segmentation is a method for precisely segmenting of the object from background using information entered by the user. However, most interactivesegmentation techniques are sensitive to the location ...
详细信息
interactive image segmentation is a method for precisely segmenting of the object from background using information entered by the user. However, most interactivesegmentation techniques are sensitive to the location and the number of seed points. To obtain a satisfactory result, the user should repeat the segmentation process over and over, and also based on employed technique, it may work well in some limited conditions and applications. To overcome these limitations and enhance the robustness of interactive image segmentation algorithm, this paper proposes a parallel fusion model using the majority voting technique, which not only is more reliable than existing methods, but also requires less user interaction. To this end, at first the input image is segmented by several segmentation methods independently. Then the obtained results are combined using majority voting technique to extract final segmentation result. To reduce the computational overhead of the proposed scheme, a spiking neural-like P system model for parallel implementation of majority voting technique is also proposed. The proposed model has been evaluated and compared with state-of-the-art methods using different metrics, and the obtained results show its efficiency compared to other methods.
In this article, we propose a slice-based interactivesegmentation of spectral CT datasets using a bag of features method. The data are acquired from a MARS scanner that divides up the X-ray spectrum into multiple ene...
详细信息
In this article, we propose a slice-based interactivesegmentation of spectral CT datasets using a bag of features method. The data are acquired from a MARS scanner that divides up the X-ray spectrum into multiple energy bins for imaging. In literature, most existing segmentation methods are limited to performing a specific task or tied to a particular imaging modality. Therefore, when applying generalized methods to MARS datasets, the additional energy information acquired from the scanner cannot be sufficiently utilized. We describe a new approach that circumvents this problem by effectively aggregating the data from multiple channels. Our method solves a classification problem to get the solution for segmentation. Starting with a set of labeled pixels, we partition the data using superpixels. Then, a set of local descriptors, extracted from each superpixel, are encoded into a codebook and pooled together to create a global superpixel-level descriptor (bag of features representation). We propose to use the vector of locally aggregated descriptors as our encoding/pooling strategy, as it is efficient to compute and leads to good results with simple linear classifiers. A linear support vector machine is then used to classify the superpixels into different labels. The proposed method was evaluated on multiple MARS datasets. Experimental results show that our method achieved an average of more than 10% increase in the accuracy over other state-of-the-art methods.
Despite the advancements in neural network technologies driving interactive image segmentation forward, challenges persist, especially concerning segmentation ambiguities caused by overlapping or visually similar obje...
详细信息
ISBN:
(纸本)9789819784899;9789819784905
Despite the advancements in neural network technologies driving interactive image segmentation forward, challenges persist, especially concerning segmentation ambiguities caused by overlapping or visually similar objects against complex backgrounds, as well as intricate object boundaries. Addressing these challenges, we introduce FusionNet, focusing on effective feature fusion. Firstly, the Hierarchical Context Fusion Module aids in grasping holistic structures and multi-scale contextual information of target objects. Secondly, the Attention Feature Fusion Module captures more representative feature expressions. This design empowers FusionNet to capture details and contextual relationships better, thereby enhancing segmentation accuracy. For fine-grained boundary details, we propose the Local Correction Module, refining local mask details meticulously. This module initially focuses on information around newly clicked areas, employing discriminative correction feedback for enhanced detail processing accuracy. Rigorous experimentations on datasets like SBD, DAVIS, GrabCut, and Berkeley validate our model's effectiveness, with segmentation results strongly supporting the superiority of our approach.
暂无评论