graph-based representation approaches have been proven to be successful in the analysis of biomedical data due to their capability of capturing intricate dependencies between biological entities, such as the spatial o...
详细信息
ISBN:
(纸本)9783031550874;9783031550881
graph-based representation approaches have been proven to be successful in the analysis of biomedical data due to their capability of capturing intricate dependencies between biological entities, such as the spatial organization of different cell types in a tumor tissue. However, to further enhance our understanding of the underlying governing biological mechanisms, it is important to accurately capture the actual distributions of such complex data. graph-based deep generative models are specifically tailored to accomplish that. In this work, we leverage state-of-the-art graph-based diffusion models to generate biologically meaningful cell-graphs. In particular, we show that the adopted graphdiffusion model is able to accurately learn the distribution of cells in terms of their tertiary lymphoid structures (TLS) content, a well-established biomarker for evaluating the cancer progression in oncology research. Additionally, we further illustrate the utility of the learned generative models for data augmentation in a TLS classification task. To the best of our knowledge, this is the first work that leverages the power of graphdiffusion models in generating meaningful biological cell structures.
Salient object detection based on the diffusion process on the graph has achieved considerable performance. It mainly depends on the affinity matrix construction considering the local structure. This paper aims to dep...
详细信息
Salient object detection based on the diffusion process on the graph has achieved considerable performance. It mainly depends on the affinity matrix construction considering the local structure. This paper aims to depict the local and global structures from image features, intensifying the graph-based diffusion model by simultaneously integrating the sparse graph matrix and affinity graph matrix. The contribution work computes the affinity graph matrix and delivers an affinity matrix by incorporating the sparse representation and diffusion process. It estimates a sparse graph matrix by integrating sparse representation and laplacian smoothness. To this end, a two-stage graph-based diffusion model has been constructed by embedding the manifold smoothness and manifold reconstruction. The first stage follows the boundary-prior to generate a coarse saliency map. After, the second stage combines the saliency map and Harris convex hull to obtain the foreground seeds. Extensive experiments on six benchmark datasets have demonstrated the superiority of the proposed method compared to other state-of-the-art methods.
graph-based diffusion techniques have drawn Much interest lately for salient object detection. The diffusion performance is heavily dependent on the edge weights in graph representing the similarity between nodes, and...
详细信息
graph-based diffusion techniques have drawn Much interest lately for salient object detection. The diffusion performance is heavily dependent on the edge weights in graph representing the similarity between nodes, and are usually set through manually tuning. To improve the diffusion performance, this paper proposes a robust diffusion scheme, referred to as manifold-preserving diffusion (MPD), that is built jointly on two assumptions for preserving the manifold used in saliency detection. The smoothness assumption reflects the conditional random field (CRF) property and the related penalty term enforces similar saliency on similar graph neighbors. The penalty term related to the local reconstruction assumption enforces a local linear mapping from the feature space to saliency values. graph edge weights in the above two penalties in the proposed MPD method are determined adaptively by minimizing local reconstruction errors in feature space. This enables a better adaption of diffusion on different images. The final diffusion process is then formulated as a regularized optimization problem, taking into account of initial seeds, manifold smoothness and local reconstruction. Consequently, when applied to saliency diffusion, MPD provides a higher performance upper bound than some existing diffusion methods such as manifold ranking. By utilizing MPD, we further introduce a two-stage saliency detection scheme, referred to as manifold-preserving diffusion-based saliency (MPDS), where boundary prior, Harris convex hull, and foci convex hull are employed for deriving initial seeds and a coarse map for MPD. Experiments were conducted on five benchmark datasets and compared with eight existing methods. Our results show that the proposed method is robust in terms of consistently achieving the highest weighted F-measure and lowest mean absolute error, meanwhile maintaining comparable precision-recall curves. Salient objects in different background can be uniformly highlighted in th
In this paper we address the issue of enhancing salient object detection through diffusion-based techniques. For reliably diffusing the energy from labeled seeds, we propose a novel graph-based diffusion scheme called...
详细信息
ISBN:
(纸本)9781479999880
In this paper we address the issue of enhancing salient object detection through diffusion-based techniques. For reliably diffusing the energy from labeled seeds, we propose a novel graph-based diffusion scheme called affinity learning-baseddiffusion (ALD), which is based on learning full-range affinity between two arbitrary graph nodes. The method differs from the previous existing work where implicit diffusion was formulated as a ranking problem on a graph. In the proposed method, the affinity learning is achieved in a unified graph-based semi-supervised manner, whose outcome is leveraged for global propagation. By properly selecting an affinity learning model, the proposed ALD outperforms the ranking-baseddiffusion in terms of accurately detecting salient objects and enhancing the correct salient objects under a range of background scenarios. By utilizing the ALD, we propose an enhanced saliency detector that outperforms 7 recent state-of-the-art saliency models on 3 benchmark datasets.
In this paper we address the issue of enhancing salient object detection through diffusion-based techniques. For reliably diffusing the energy from labeled seeds, we propose a novel graph-based diffusion scheme called...
详细信息
ISBN:
(纸本)9781479999897
In this paper we address the issue of enhancing salient object detection through diffusion-based techniques. For reliably diffusing the energy from labeled seeds, we propose a novel graph-based diffusion scheme called affinity learning-baseddiffusion (ALD), which is based on learning full-range affinity between two arbitrary graph nodes. The method differs from the previous existing work where implicit diffusion was formulated as a ranking problem on a graph. In the proposed method, the affinity learning is achieved in a unified graph-based semi-supervised manner, whose outcome is leveraged for global propagation. By properly selecting an affinity learning model, the proposed ALD outperforms the ranking-baseddiffusion in terms of accurately detecting salient objects and enhancing the correct salient objects under a range of background scenarios. By utilizing the ALD, we propose an enhanced saliency detector that outperfomis 7 recent state-of-the-art saliency models on 3 benchmark datasets.
暂无评论