Low-resolution visible-infrared image fusion and super-resolution (LRVIF) are critical for enhancing image quality in low-resolution scenarios, yet limited information in the input images often constrains performance. To address these challenges, we propose SaDiff, a spatially-aware adaptive diffusion model that introduces diffusion processes into LRVIF for the first time, representing a major breakthrough in the field. Leveraging the generative capabilities of diffusion models, our approach unifies and enhances image fusion and super-resolution within a cohesive framework. A key component of SaDiff is the Spatial Residual Adaptation Block, which extends the diffusion process by dynamically adapting feature representations to spatial variations in the local regions of the input images. This module maximally preserves crucial information from the input images, such as texture details and contrast, while effectively suppressing noise, ensuring robust and context-aware feature refinement. Then we further propose Direct Diffusion Synthesis, a novel mechanism that utilizes noise predictions during diffusion to generate fused images, enabling joint training of the fusion and super-resolution networks. Additionally, a Cross-Feature Fusion Module integrates texture and contrast details, producing super-resolution fused images with improved clarity and structural integrity. Extensive experiments show that SaDiff achieves state-of-the-art performance, offering a robust and unified solution to infrared-visible image fusion and super-resolution. The code for the proposed method will be made available at https://github.com/guobaoxiao/SaDiff.

Correspondence pruning aims to identify inliers from an initial set of correspondences with a low inlier ratio. Current Graph Neural Networks (GNNs) based correspondence pruning approaches suffer from feature over-smoothing during information propagation, making it difficult to distinguish inliers from outliers. In addition, Transformer-based methods can model long-range dependencies, but their quadratic complexity limits computational efficiency. To address these issues, we propose MatchMamba, a dual-view correspondence pruning network based on a selective state space model, Mamba. MatchMamba combines the strengths of GNNs and Mamba, enhancing local feature extraction while modeling global context with appropriate complexity. Specifically, to overcome Mamba’s limitations in correspondence pruning, such as the lack of local context and unidirectional modeling, we introduce the Cluster Sampling Spatial Mamba (CSSM) block and Correspondence Flip Bidirectional Mamba (CFBM) block. CSSM captures fine-grained local context through the implicit soft assignment and mitigates GNN’s over-smoothing using Mamba’s selective mechanism. CFBM block leverages Mamba’s efficient long-sequence modeling by constructing a pseudo-sequential structure through clustering. It applies forward and backward scanning to enable each correspondence to fully capture contextual information from others, achieving global context modeling with appropriate computational cost. Extensive experiments demonstrate that MatchMamba outperforms current state-of-the-art methods on several challenging tasks. The code is available at https://github.com/Mrwyb/MatchMamba.

The accuracy and stability of pathology image segmentation have become critical factors in clinical applications such as cancer screening and tumor grading. However, the presence of complex local structures, uncertain regions, and subtle morphological variations in pathological images continues to pose significant challenges. Most existing feature fusion approaches rely on the simplistic aggregation of extracted features, neglecting the unique characteristics and relative importance of distinct feature representations, which ultimately limits their potential to enhance model performance. To address these issues, we propose a Gestalt-Inspired Feature Integration Network (GeNet), a novel architecture inspired by Gestalt theory that mirrors the human visual system's ability to derive holistic understanding from partial information. Embracing the principle that 'the whole is greater than the sum of its parts,' GeNet introduces a mechanism to synergistically leverage multi-scale information, which assesses the similarity between features to achieve a more meaningful fusion of global context and local detail. Given the variability in target appearance within pathological images, we use information entropy to quantify feature uncertainty, allowing the model to prioritize uncertain regions and reduce the occurrence of ambiguous results. To explicitly eliminate multi-feature redundancy and misalignment, the refinement block utilizes parallel convolutional recalibration to fully leverage the advantages of various features. Extensive experiments on multiple pathological image segmentation datasets, including GlaS, GCaSeg, and EBHI-Seg, demonstrate that GeNet achieves high accuracy and strong robustness, offering a new perspective for joint modeling of global and local features in medical image analysis.

Whole slide image (WSI) classification is a critical task in computational pathology and is aimed at providing automated diagnostic support through high-resolution tissue image analysis. In weakly supervised WSI classification scenarios, the main challenge concerns the traditional multiple instance learning (MIL) methods, which rely on instance-level embeddings aggregated by an attention-based pooling mechanism. These methods often depend on data-driven statistical correlations, leading to misalignments between their attention allocation schemes and histopathological diagnostic regions and reducing the resulting prediction reliability. To address this, we propose frequency-aware causal regularized multiple instance learning (FC-MIL), an innovative framework combining that combines frequency-aware attention (FAA) and causal regularization (CR). FAA extracts more granular, fine-grained histological textures by jointly modeling spatial- and frequency- domain features, whereas CR introduces feature-level counterfactual perturbations as an intervention-inspired regularizer in the latent space, encouraging the model to rely less on spurious correlations and more on invariant pathological cues. Experimental results obtained on four WSI datasets show that FC-MIL outperforms the state-of-the-art MIL methods in terms of both accuracy and interpretability. Our source code is available at https://github.com/7FFDW/FCMIL.

Establishing reliable correspondences is a fundamental task in computer vision. Constructing neighbor graphs in feature space with position information to mine correspondence consistency has become a common strategy for recognizing correct correspondences (inliers). However, these neighbors may include a high ratio of incorrect correspondences (outliers), only using the correspondence consistency from feature space will probably be difficult to guarantee the matching accuracy. To address this issue, we propose a novel motion consistent space to find consistent neighbors that are independent of the correspondence's position and have a larger search range. On top of that, we build two neighbor graphs according to the feature space and motion consistent space separately, and expand a shift annular convolution to retain rich neighbor graph structure information and fully exploit the neighborhood context. Then, we design a dynamic feature fusion block to dynamically fuse these dual-neighbor graphs to flexibly cope with various complex scenarios. Finally, we develop a Dual-Neighborhoods Dynamic Fusion Network (DDFNet) for accurately identifying inliers and retrieving camera poses. Experimental results demonstrate that our proposed DDFNet outperforms the state-of-the-art methods. Source code:https://github.com/1211193023/DDFNet.

The accurate identification of high-quality correspondences is a prerequisite task in feature-based point cloud registration. However, it is extremely challenging to handle the fusion of local and global features due to feature redundancy and complex spatial relationships. Given that Gestalt principles provide key advantages in analyzing local and global relationships, we propose a novel Gestalt-guided Parallel Interaction Network via orthogonal geometric consistency (GPI-Net) in this paper. It utilizes Gestalt principles to facilitate complementary communication between local and global information. Specifically, we introduce an orthogonal integration strategy to optimally reduce redundant information and generate a more compact global structure for high-quality correspondences. To capture geometric features in correspondences, we leverage a Gestalt Feature Attention (GFA) block through a hybrid utilization of self-attention and cross-attention mechanisms. Furthermore, to facilitate the integration of local detail information into the global structure, we design an innovative Dual-path Multi-Granularity parallel interaction aggregation (DMG) block to promote information exchange across different granularities. Extensive experiments on various challenging tasks demonstrate the superior performance of our proposed GPI-Net in comparison to existing methods. The code will be released at https://github.com/XXX/GPI-Net.

Correspondence learning aims to identify correct correspondences from the initial correspondence set and estimate camera pose between a pair of images. At present, Transformer-based methods have make notable progress in the correspondence learning task due to their powerful non-local information modeling capabilities. However, these methods seem to neglect local structures during feature aggregation from all query-key pairs, resulting in computational inefficiency and inaccurate correspondence identification. To address this issue, we propose a novel Context-aware Local and Global interaction Transformer (CLGFormer), a lightweight Transformer-based module with dual-branches that address local and global context perception in attention mechanisms. CLGFormer explores the relationship between neighborhood consistency observed in correspondences and context-aware weights appearing in vanilla attention and introduces an attention-style convolution operator. On top of that, CLGFormer also incorporates a cascaded operation that splits full features into multiple subsets and then feeds to the attention heads, which not only reduces computational costs but also enhances attention diversity. At last, we also introduce a feature recombination operate with high jointness and a lightweight channel attention module. The culmination of our efforts is the Context-aware Local and Global interaction Network (CLG-Net), which accurately estimates camera pose and identifies inliers. Through rigorous experiments, we demonstrate that our CLG-Net network outperforms existing state-of-the-art methods while exhibiting robust generalization capabilities across various scenarios. Code will be available athttps://github.com/guobaoxiao/CLG.

Object detection in scenes captured by unmanned aerial vehicles (UAV) is an active research area. However, the performance and efficiency of current small object detection models for UAV images are far from reaching the desired level. The inherent limitations of the features of the small objects themselves and the inconsistency of the contextual information in the feature maps lead to a degradation of the final detection performance. In this letter, to improve the performance of UAV image small object detection, we propose a multi-scale feature optimization network, named MFO-Net. We have designed three crucial modules: feature optimization fusion (FOF) module, multi-scale localized feature aggregation (MLFA) module, and feature enhancement (FE) module. FOF module enhances the fusion of features with inconsistent contexts at different levels by learning pixel-wise displacement, facilitating more effective feature fusion, which further helps focus on and capture critical information about small objects. MLFA module aggregates richer contextual information through multi-branch stripe convolution blocks, while the FE module extracts richer gradient flow information, suppresses incompatible information, and enhances feature representation capability. We conduct extensive experiments on the challenging VisDrone2019 dataset and compare the results against those obtained from the state-of-the-art methods. The experimental results show that MFO-Net performs better than other detectors. Specifically, MFO-Net achieves the best performance with 22.3% AP, 38.9% AP50, and 22.5% AP75on VisDrone2019. Code: https://github.com/Lanziyang121/MFO-Net.

Accurately identifying correct correspondences (inliers) in two-view images is a fundamental task in computer vision. Recent studies usually adopt Graph Neural Networks or stack local graphs into global ones to establish neighborhood relations. However, the smoothing properties of Graph Convolutional Neural network (GCN) cause the model to fall into local extreme, which leads to the issue of indistinguishability between inliers and outliers. Especially when the initial correspondences contain a large number of incorrect correspondences (outliers), these studies suffer from severe performance degradation. To address the above issues and refocus perspective information on distinct features, we design a Consistency Guided ResFormer Network (CGR-Net) that uses consistent correspondences to guide model perspective focusing, thereby avoiding the negative impact of outliers. Specifically, we design an efficient Graph Score Calculation module, which aims to compute global graph scores by enhancing the representation of important features and comprehensively capturing the contextual relationships between correspondences. Then, we propose a Consistency Guided Correspondences Selection module to dynamically fuse global graph scores and consistency graphs and construct a novel consistency matrix to accurately recognize inliers. Extensive experiments on various challenging tasks demonstrate that our CGR-Net outperforms state-of-the-art methods. Our code is released athttps://github.com/XiaojieLi11/CGR-Net.

Multi-objective segmentation (MOS) in medical images is to simultaneously extract multiple regions of interest in the medical images. Due to the unbalanced distribution of samples and the similarity and significant differences between features in medical images, current methods still struggle to achieve satisfactory results. In this context, we propose a novel Morphological Guided Causal Constrain segmentation network (MCCSeg) for medical image multi-object segmentation. We introduced a Causal Constrain Module (CCM) for feature decorrelation by sample reweighting. The morphological guidance module (MG) is designed to extract the boundary features as the prior shape information for enhancing feature representation. Our experiments demonstrate that MCCSeg outperforms other state-of-the-art methods, obtaining up 3.76% and 5.41% improvements in DICE and HD95 scores on Synapse dataset, respectively.

Building high-quality correspondences is critical in the feature-based point cloud registration pipelines. However, existing single-sequence learning frameworks are difficult to accurately and adequately capture contextual information, leaving a large proportion of outliers between two low-overlap scenes. In this paper, we present a progressive guidance network (PG-Net) to gather rich contextual information and exclude outliers. Specifically, we design a novel iterative structure that exploits the inlier probabilities of correspondences to guide the classification of initial correspondences progressively. This structure can mitigate outlier effects with robust contextual information to obtain more accurate model estimation. In addition, to sufficiently capture contextual information, we propose a grouped dense fusion attention feature embedding module to enhance the representation of inliers and significant channel-spatial. Meanwhile, we propose a two-stage neural spectral matching module to compute the inlier probability of each correspondence and estimate a 3D transformation model in a coarse-to-fine manner. Experiments results on indoor and outdoor datasets using distinct 3D local descriptors demonstrate that our PG-Net surpasses state-of-the-art outlier removal methods. Especially compared to the recent outlier removal network PointDSC, our PG-Net improves the registration recall by 4.06% on the indoor dataset with the FPFH descriptor. Source code: https://github.com/changcaiyang/PG-Net.

Establishing superior-quality correspondences in an image pair is pivotal to many subsequent computer vision tasks. Using Euclidean distance between correspondences to find neighbors and extract local information is a common strategy in previous works. However, most such works ignore similar sparse semantics information between two given images and cannot capture local topology among correspondences well. Therefore, to deal with the above problems, Multiple Sparse Semantics Dynamic Graph Network (MS2DG-Net) is proposed, in this paper, to predict probabilities of correspondences as inliers and recover camera poses. MS2 DG-Net dynamically builds sparse semantics graphs based on sparse semantics similarity between two given images, to capture local topology among correspondences, while maintaining permutation-equivariant. Extensive experiments prove that MS2 DG-Net outperforms state-of-the-art methods in outlier removal and camera pose estimation tasks on the public datasets with heavy outliers. Source code:https://github.com/changcaiyang/MS2DG-Net

In this letter, we propose a remote sensing image matching method that is simple yet efficient to deal with different deformations. Inspired by the region growing strategy used in image segmentation, we integrate the motion consistency into the general region growing pipeline from a novel perspective. Specifically, we first obtain a subset with a high ratio inlier as the seed correspondence set. Then, to find more reliable correspondences, we formulate the motion consistency into the correspondence growing criterion, which is general to be suitable to many remote sensing applications. Extensive experimental results on the public available remote sensing data set show that our method achieves the best performance compared with state-of-the-art methods.

Pansharpening aims to fuse a multispectral (MS) image with low spatial resolution and a panchromatic (PAN) image with a high-spatial resolution to produce an image with both high spectral and high spatial resolution. In this study, we propose a variational pansharpening method by exploiting cartoon-texture similarities. After decomposition of the PAN image, the cartoon component always contains the global structure information, while the texture component includes the locally patterned information. This enables that the fused high-spatial resolution MS image can preserve the global and local spatial details (e.g., high-order information) well after leveraging the similarities of cartoon and texture components from PAN and MS images. To explore such cartoon-texture similarities, we describe cartoon similarity as gradient sparsity, formulated as a reweighted total variation term. Meanwhile, we use group low-rank constraint for texture similarity that is presented as repetitive texture patterns. By incorporating a data fidelity term for preserving the spectral information on the basis that the down-sampled fused MS image is consistent with the MS image, we further formulate pansharpening as an optimization problem and solve it efficiently using the alternative direction multiplier method. Extensive experiments have been conducted on a series of satellite data sets, and we also carry out a simulated vegetation coverage change experiment to verify the efficiency of the proposed method in remote sensing. The qualitative and quantitative results demonstrate that our method outperforms the state-of-the-art pansharpening methods in terms of both visual effect and objective metrics.

Normalized difference vegetation index (NDVI), derived from the near-infrared and red bands of a multispectral (MS) image, has been widely used in remote sensing. To obtain a high-resolution (HR) NDVI, existing attempts typically first generate an HR-MS image using pansharpening and then calculate the HR NDVI accordingly. However, some inaccurate spatial information will be simultaneously introduced into NDVIs, influencing their spatial quality seriously. To overcome this challenge, we investigate a computational fusion approach from a novel perspective for HR NDVI in this study. Rather than pansharpening an HR-MS image, we define an HR vegetation index calculated based on an available HR panchromatic image and an estimated HR red band (VIPR) and fuse the low-resolution (LR) NDVI and HR VIPR directly to acquire an HR NDVI. In particular, we adopt a nonlocal gradient sparsity constraint to force a similar nonlocal spatial structure in the fused NDVI and VIPR, where the VIPR is dynamically updated by adding a constraint to reconstruct the HR red band. We further integrate a data fidelity term to constrain the relationship between the fused NDVI and its LR version, and an efficient strategy based on the alternative direction multiplier method is developed to solve the nonconvex optimization problem. The extensive experimental results demonstrate that the proposed method achieves superior fusion performance over the state of the art, exhibiting its wide application aspect in remote sensing.

By exploiting the gradient similarity between multispectral (MS) and panchromatic (PAN) images, a variational pansharpening method based on gradient sparse representation is proposed, based on the observation that the gradients of corresponding MS and PAN images with different resolutions have the similar sparse coefficients under certain specific dictionaries. By adding a data fidelity term to preserve the spectral information, an optimization model is constructed as a minimization problem of an energy function. The problem can be solved by the gradient descent method efficiently. Experiments on different satellite data reveal that the proposed method outperforms the state-of-the-art methods in terms of visual effect and objective quality analysis.

In this paper, a new robust model fitting method is proposed to efficiently segment multistructure data even when they are heavily contaminated by outliers. The proposed method is composed of three steps: first, a conventional greedy search strategy is employed to generate (initial) model hypotheses based on the sequential "fit-and-remove" procedure because of its computational efficiency. Second, to efficiently generate accurate model hypotheses close to the true models, a novel global greedy search strategy initially samples from the inliers of the obtained model hypotheses and samples subsequent data subsets from the whole input data. Third, mutual information theory is applied to fuse the model hypotheses of the same model instance. The conventional greedy search strategy is used to generate model hypotheses for the remaining model instances, if the number of retained model hypotheses is less than that of the true model instances after fusion. The second and the third steps are performed iteratively until an adequate solution is obtained. Experimental results demonstrate the effectiveness and efficiency of the proposed method for model fitting.

Color and depth information provided simultaneously in RGB-D images can be used to segment scenes into disjoint regions. In this paper, a graph-based segmentation method for RGB-D image is proposed, in which an adaptive data-driven combination of color- and normal-variation is presented to construct dissimilarity between two adjacent pixels and a novel region merging threshold exploiting normal information in adjacent regions is proposed to control the proceeding of the region merging. We evaluate our method on the NYU-v2 depth database and compare it with several published RGB-D partition methods. The experimental results show that our method is comparable with the state-of-the-art methods and provides more details of structures in the scene.

Summary The paper illustrates a parallel and distributed scheme for computing a planar Delaunay triangulation using a divide‐and‐conquer strategy in Cloud environment, which combines the incremental insertion algorithm and the divide‐and‐conquer method. The proposed hybrid algorithm for Delaunay triangulation construction is easy to be parallelized due to the dynamic pruned characteristic of the binary tree model used. Moreover, the Cloud platform decreases the communication overhead and improves data locality by making use of a data partitioning and integrating scheme offered by the map‐reduce architecture. The implementation of the parallel and distributed version of the algorithm relied on a robust data structure called quad‐edge, which implies the geometric relationship among the edges and vertexes adjacent. More importantly, the data are serialized easily and transmitted efficiently between different Cloud nodes; the algorithm is executed conveniently on PC clusters. We tested the parallel version of the algorithm on GeoKSCloud, a geographical knowledge service Cloud developed by our research team. Experimental results show that the proposed hybrid algorithm is efficient and competitive; it can be easily migrated and deployed in distributed and parallel computing environment, such as grid and Cloud. The parallel implementation of the hybrid algorithm has a good speed‐up, while data communication is the crucial factor for the efficiency of the parallel version. Overall, the parallel version outperforms both the sequential divide‐and‐conquer algorithm and the sequential incremental insertion algorithm.

In this paper, we present two methods using Neural networks to mine virtual machine usage data. For the one-for-all training method, we use the trained model to predict the whole weeks' data. For the separated model, we cut the testing set into seven smaller sets of each day, then use the corresponding model to predict that particular day's data. A whole weeks' data are used as testing set. The final results show that our method can predict network usage with only around 20% of errors.

Delaunay triangulation (D-TIN) is an important graphic tool in computational geometry, which is not only widely used in many real applications, but also very significant for many spatial data mining algorithms. However, constructing Delaunay triangulation is time-consuming for most practical applications. Distributed and parallel computing mechanism is becoming a good choice to solve large scale and compute-intensive D-TIN applications. This paper proposes a novel hybrid algorithm (HA) for D-TIN construction in cloud computing environment, which is based on a balanced binary-tree model and an elegant data structure called quad-edge. HA combines the divide & conquer approach and the incremental method. Moreover, a distributed and parallel version of Delaunay triangulation computing service in cloud is designed and implemented. The hybrid algorithm performed in both centralised and in cloud environments are compared. Experimental results showed that the hybrid D-TIN service outperforms both the the divide & conquer one and the incremental one, and it can effectively provide higher data mining services with fundamental D-TIN construction function in cloud.

Non-rigid point set registration is a fundamental problem for many computer vision technologies. In this paper, we proposed a new non-rigid point set registration method based on coherent spatial mapping (CSM) and local geometrical constraint. Our central idea is to express each point as a weighted sum of several nearest neighbors and the same relation holds after the transformation. The registration problem is solved by minimizing an error function, which combines the the global model and local geometrical constraint. The registration experiments are undertaken on various synthetic and real data. The results demonstrate that the proposed approach is robust and is superior to the state-of-the-art methods.

In this letter, we propose a probabilistic method for the feature matching of remote sensing images which undergo nonrigid transformations. We start by creating a set of putative correspondences based on the feature similarity and then focus on removing outliers from the putative set and estimating the transformation as well. This is formulated as a maximum likelihood estimation of a Bayesian model with latent variables indicating whether matches in the putative set are inliers or outliers. We impose nonparametric global geometrical constraints on the correspondence using Tikhonov regularizers in a reproducing kernel Hilbert space. We also introduce a local geometrical constraint to preserve local structures among neighboring feature points. The problem is solved by using the expectation-maximization algorithm, and the closed-form solution of the transformation is derived in the maximization step. Moreover, a fast implementation based on sparse approximation is given which reduces the method computation complexity to linearithmic without performance sacrifice. Extensive experiments on real remote sensing images demonstrate accurate results of the proposed method which outperforms current state-of-the-art methods, particularly in case of severe outliers.

Infrared small-target detection plays an important role in image processing for infrared remote sensing. In this letter, different from traditional algorithms, we formulate this problem as salient region detection, which is inspired by the fact that a small target can often attract attention of human eyes in infrared images. This visual effect arises from the discrepancy that a small target resembles isotropic Gaussian-like shape due to the optics point spread function of the thermal imaging system at a long distance, whereas background clutters are generally local orientational. Based on this observation, a new robust directional saliency-based method is proposed incorporating with visual attention theory for infrared small-target detection. Experimental results demonstrate that the proposed algorithm outperforms the state-of-the-art methods for real infrared images with various typical complex backgrounds.