Pith. sign in

REVIEW 4 major objections 4 minor 41 references

DMAConv: Dual Mask-Adaptive Convolution for Remote Sensing Pansharpening

T0 review · 4 major / 4 minor · reviewed 2026-08-03 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Mask-guided dual-branch adaptive convolution, routing redundant pixels to a cheap global kernel and heterogeneous pixels to per-pixel kernels, is claimed to reach state-of-the-art pansharpening at the lowest adaptive-convolution cost.

desk verdict Useful adaptive-convolution module with an overstated SOTA claim. read the letter →

arxiv 2512.08331 v2 pith:JNFLTZ3A submitted 2025-12-09 cs.CV

Xianghong Xiao , Zeyu Xia , Zhou Fei , Jinliang Xiao , Haorui Chen , Liangjian Deng This is my paper · ORCID
classification cs.CV
keywords pansharpeningadaptiveconvolutionmask-guidedroutingcomputationaltriageremotesensingimagefusiondual-branchlow-rankkernelsspatialheterogeneity
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Pansharpening fuses a sharp panchromatic image with a blurred multispectral image. Most deep-learning fusion methods treat every pixel with the same operator, which wastes computation on large uniform areas (water, rooftops) and underserves busy regions (edges, coastlines). The paper claims that a single operator, Bi2MAC, can do better by learning a soft mask that modulates features and a hard mask that routes each pixel into one of two branches: a compact global branch for redundant regions and a focused per-pixel branch for heterogeneous ones. On three satellite datasets the authors report state-of-the-art spectral metrics while using about 85% of pixels in the cheap branch and the lowest FLOPs among adaptive-convolution baselines. If right, this gives edge-deployed pansharpening a building block that is both more accurate and cheaper than existing adaptive convolutions.

What carries the argument

The load-bearing object is the Content-Adaptive Mask Generator (CAMG) feeding the Mask-Aware Bimodal Convolution (MABiC). CAMG computes a spatial-channel soft mask via a sigmoid convolution, then derives a binary hard mask by thresholding the channel-averaged soft mask at a dynamic threshold (mean + alpha*std, alpha=2). MABiC uses the hard mask to perform computational triage: roughly 85% of pixels (redundant) go through a compact branch that produces a single global adaptive kernel from global average pooling, while the remaining 15% go through a focused branch that produces pixel-wise adaptive kernels from local channel vectors. Both branches modulate independent low-rank kernels built fro

What would settle it

Train Bi2MAC with the hard mask replaced by a fixed random binary mask that routes the same 15% of pixels to the focused branch; if the spectral metrics (SAM/ERGAS) match the learned-mask version, then the learned routing is not what delivers the gain, and the computational-triage claim collapses.

Watch

Extended reading notes

Core claim

The central claim is that spatial heterogeneity in remote sensing imagery is bimodal and can be exploited directly in the convolution operator. The paper proposes Bi2MAC (Bimodal Bi-Adaptive Mask-Aware Convolution), which first produces a soft mask SM = sigmoid(W*X+b), multiplies the input by it, then averages SM across channels and binarizes it at a dynamic threshold T = mean + alpha*std. Pixels below threshold are labeled feature-redundant and routed to a compact branch that generates one global kernel from a pooled feature vector; pixels above threshold are labeled feature-heterogeneous and routed to a focused branch that generates a per-pixel kernel from local channel context. The two br

Load-bearing premise

The architecture assumes that a channel-averaged soft mask, binarized at mean + 2*std, reliably separates remote-sensing features into feature-redundant and feature-heterogeneous classes, and that this binary routing can be trained even though the binarization step has no described gradient path.

Editorial extensions

If this is right

  • If Bi2MAC is correct, adaptive convolution for pansharpening need not be uniformly expensive: the same operator can concentrate FLOPs on the minority of heterogeneous pixels and spend almost nothing on the majority redundant pixels.
  • The reported 85/15 routing ratio, with the compact branch using a single global kernel, implies that total FLOPs scale sublinearly with spatial resolution relative to per-pixel adaptive methods.
  • Because the module is plug-and-play (replacing standard convolutions in three existing backbones improves all), the benefit is attributed to the operator itself, not to the surrounding backbone architecture.
  • If the state-of-the-art numbers hold, edge-side pansharpening on devices like a consumer GPU can use lower parameter counts without sacrificing spectral fidelity as measured by SAM and ERGAS.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A testable extension: the same mask-routing idea could transfer to other remote sensing tasks with heavy background redundancy, such as super-resolution or cloud removal, where a per-pixel kernel branch could be reserved for clouds, edges, or outliers.
  • The fixed threshold alpha with no reported sensitivity analysis suggests the routing may not need fine tuning; one editorial inference is that the soft mask's continuous modulation, not the hard binarization, may carry much of the adaptivity — a hypothesis the paper's ablations do not fully isolate.
  • The hard-mask binarization has no explicitly described straight-through gradient; if gradients reach the mask only through the soft-modulation path, the claimed learned routing could be partly a byproduct of soft attention rather than a genuinely learned hard partition. An ablation that freezes HM to a fixed random partition at the same 15% ratio would test this.
  • The reported efficiency comparison is module-level at a single input size; end-to-end latency on large-format satellite tiles could differ, so deployment claims warrant a full-pipeline benchmark.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper proposes Bi2MAC/DMAConv, a dual-branch adaptive convolution operator for pansharpening. A lightweight mask generator produces a soft mask and a hard binary mask; the hard mask routes each spatial location into either a compact branch (global adaptive kernel) or a focused branch (pixel-wise adaptive kernel). The module is inserted into a U-Net to form Bi2MANet, and experiments are reported on WV3, QB, and GF2 under reduced- and full-resolution protocols, together with ablations and plug-and-play replacements of standard convolutions in existing networks. The authors claim SOTA accuracy and the lowest computational cost among adaptive convolution methods, supported by a bimodal redundant/heterogeneous motivation based on SVD and Fourier analysis.

Significance. If substantiated, the operator would be a useful building block for resource-constrained pansharpening: it couples a cheap content-adaptive mask, low-rank kernels, and asymmetric FLOP allocation. The paper's strengths are its extensive benchmark comparisons, ablations, plug-and-play experiments on FusionNet/LAGConv/ARNet, and the explicit SVD/Fourier motivation for regional adaptivity. However, the headline claims are currently overstated, and the training of the binary routing is not described. With corrected claims and a clear treatment of hard-mask learning, the contribution would be a solid empirical architecture study; in its current form the main assertions require revision.

major comments (4)
  1. [Abstract and Sec. 3.2; Tables 2, 8, 10] The abstract and Sec. 3.2 claim SOTA on a broad array of quantitative benchmarks. The paper's own tables do not support this on full-resolution HQNR: Table 2 reports ARNet at 0.9579 vs Proposed at 0.9497 on WV3; Table 8 reports SSDiff at 0.9338 vs Proposed at 0.9141 on QB and SSDiff at 0.9573 vs Proposed at 0.9299 on GF2. SSDiff is listed as a baseline in the supplementary (Table 7) but is omitted from the main tables, and even among main-table baselines ARNet wins the WV3 full-resolution HQNR. The SOTA claim should be narrowed to the reduced-resolution metrics, or the full-resolution results must be reconciled with the claim.
  2. [Sec. 2.2.1, Eqs. (3)-(4)] The hard mask HM is obtained by thresholding SM_F at T = mu + alpha*sigma and binarizing. This operation has zero gradient almost everywhere with respect to SM_F and the threshold parameters. The paper does not specify a straight-through estimator, a Gumbel-softmax relaxation, or any other differentiable relaxation, yet Sec. 3.4 and Fig. 5 describe the mask as learned and state that the model learns increasingly reliable partitioning. Because the binary routing is the central computational-triage mechanism, the paper should either describe a differentiable training scheme or provide evidence that the routing is genuinely learned (e.g., by comparing with a fixed random routing at the same 85/15 ratio). Without this, the claimed adaptive triage may be a static split determined by the fixed alpha, not a learned behavior.
  3. [Abstract and Table 3] The abstract states 'substantially lower parameter counts and the minimal computational cost among adaptive convolution models.' Table 3 shows the Proposed method has 16,322 parameters vs LAGConv's 14,141, and a runtime of 65s vs LAGConv's 43s. Thus the parameter-count claim is false, and the runtime advantage holds only relative to CANNet and ARNet, not LAGConv. Only FLOPs (152.91M) is lowest. The efficiency claims should be restated to specify FLOPs and to acknowledge the parameter/runtime trade-offs shown in Table 3.
  4. [Sec. 3.3] The paper states that CAMG routes approximately 85% of pixels to the compact branch, citing supplementary details, but no such measurement appears in the supplementary material. The only related number is the 15% assignment used in the random-mask ablation (Table 5). Since the 85/15 ratio is the basis of the claimed computational savings, please provide quantitative mask statistics across test images and across network depths, or remove the specific ratio claim.
minor comments (4)
  1. [Title/Abstract] The method is called DMAConv in the abstract and submission metadata but Bi2MAC throughout the body (and both names appear in the full text). Pick one consistent name for the module.
  2. [References] References [23] and [24] are duplicates: both cite 'Robust band-dependent spatial-detail approaches for panchromatic sharpening' by Vivone, IEEE TGRS 2019, with slightly different page/issue fields. Merge or disambiguate.
  3. [Sec. 2.2.1 / Sec. 6.3] The threshold coefficient alpha is fixed at 2 with no sensitivity analysis. Given the importance of the threshold in Eq. (4), a short sensitivity study over alpha (e.g., 1.5, 2, 2.5, 3) would strengthen confidence that the reported results are not tuned to a single value.
  4. [Tables 2, 8, 10] The supplementary tables show PNN, DiCNN, CMT, and SSDiff results, but the main tables omit the stronger deep baselines (SSDiff in particular). Moving at least SSDiff into the main comparison, even if it is not the focus, would make the 'SOTA' discussion transparent.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the paper's claims rest on external benchmarks and explicit architectural definitions, not on self-referential derivations.

full rationale

Bi2MAC is presented as an architecture plus an empirical evaluation, not as a derivation that assumes its own conclusion. The hard mask (Eq. 4) is defined as a threshold of the soft mask (Eq. 3); this is an architectural definition, not a predicted result, and the paper never claims to infer the mask values from the downstream metrics. The SVD/Fourier analysis in the supplementary is independent motivating evidence for the bimodal split, and no fitted parameter is relabeled as a prediction. The only shared-author citation that enters the construction (SpanConv low-rank kernels, ref. [4]) is a borrowed building block, and its use is internally ablated in Table 4, so it does not function as an unverified self-citation controlling the outcome. All quantitative claims are obtained by training on standard PanCollection/Wald-protocol data and comparing to external baselines; the full-resolution tables actually show SSDiff/ARNet ahead of the Proposed method on HQNR, which is an accuracy/claim discrepancy rather than circularity. The non-differentiability of the hard mask is a legitimate design/trainability concern, but it does not make the evaluation circular. No step in the paper reduces an output to an input by construction.

Assumptions & free parameters 1 free parameters · 3 assumptions · 0 invented entities

The main tunable quantity is alpha, which fixes the compute split. The bimodal hypothesis is the core domain assumption. The training of the hard mask is an unexplained ad hoc assumption that the architecture silently relies on.

free parameters (1)
  • alpha (threshold coefficient) = 2
    Eq. (3): T = mu + alpha*sigma; alpha=2 fixed in Sec. 6.3; no sensitivity analysis reported; controls the redundant/complex pixel ratio (~85/15) that drives the FLOPs savings claim.
assumptions (3)
  • domain assumption Bimodal hypothesis: remote sensing features are mostly redundant (low-rank, low-frequency) with a minority of complex (high-rank, high-frequency) regions.
    Sec. 2.1 and Fig. 2/Supp. Sec. 5 support this with SVD/Fourier analysis of a few patches; the entire dual-branch routing rests on this clean separability.
  • domain assumption Wald protocol creates valid ground truth from reduced-resolution images.
    Sec. 3.1: standard practice in pansharpening; if the protocol biases training, SOTA claims overstate real-world fusion quality.
  • ad hoc to paper The threshold-binarized hard mask (Eq. 4) can be trained end-to-end despite being non-differentiable.
    The paper does not describe a straight-through estimator, Gumbel-softmax, or any gradient approximation for HM, so the routing decision may never receive task gradients; this is an unflagged assumption in Sec. 2.2.1.

how reviews work

0 comments
Cite this review

Pith. "Pith review of DMAConv: Dual Mask-Adaptive Convolution for Remote Sensing Pansharpening." pith.science (2026). https://pith.science/paper/JNFLTZ3A

@misc{pith2026251208331,
  author       = {Pith},
  title        = {Pith review of: DMAConv: Dual Mask-Adaptive Convolution for Remote Sensing Pansharpening},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JNFLTZ3A}},
  note         = {Machine review of arXiv:2512.08331}
}
read the original abstract

Pansharpening aims to fuse a high-resolution panchromatic image with a low-resolution multispectral image. Existing deep learning methods, including recent adaptive convolutions, struggle with regional heterogeneity in remote sensing images and often incur prohibitive computational costs. To address these challenges, we propose Dual Mask-Adaptive Convolution (DMAConv), a novel operator that dynamically allocates computational resources based on feature characteristics. DMAConv first employs a lightweight module to generate soft and hard masks. The hard mask separates features into a compact branch for processing redundant information globally and a focused branch that models complex, heterogeneous regions with greater computational investment. The soft mask then preliminarily modulates the input features for both branches. This dual-branch, mask-adaptive design significantly enhances feature representation while minimizing computational overhead. Extensive experiments demonstrate that our method achieves SOTA on a broad array of quantitative benchmarks, with substantially lower parameter counts and the minimal computational cost among adaptive convolution models.

Figures

Figures reproduced from arXiv: 2512.08331 by the authors.

Figure 1
Figure 1. [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. We analyze image patches from typical redundant (e.g., [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
Figure 3
Figure 3. Overview of the proposed Bi2MAC model.The model consists of two key components: a Content-Aware Mask Generator (CAMG) and a Mask-Aware Bimodal Adaptive Convolution (MABiC). The CAMG first produces hard masks, which guide each pixel into different branches for adaptive processing. The figure illustrates the overall data flow, as well as the generation of masks, adaptive kernels, and low-rank kernels. Next, to obtain … view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: Visual Fusion image and Error maps on GF2 dataset (reduced data). For the error maps, blue indicates low error. [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 5
Figure 5. Figure 5: Visualization of the soft mask flat (SMF ) heatmaps and hard mask (HM) maps generated by Bi2MAC at different training stages and network depths. Scale denotes the downsampling ratio in the U-Net. The color intensity in SMF reflects the model’s attention level to each r…
Figure 6
Figure 6. Figure 6: Empirical Analysis of Feature Heterogeneity in Remote [PITH_FULL_IMAGE:figures/full_fig_p012_6.png]
Figure 7
Figure 7. Figure 7: Overview of the proposed Bi2MANet architecture. The figure details the structures of the Bi2MAC-Resblock, up-sampling, and down-sampling modules, and depicts the dataflow and skip connections within the network. Method Year Introduction BT-H 2017 Applies haze-corrected…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

41 extracted references · 1 linked inside Pith

  1. [1]

    Mtf-tailored multiscale fusion of high-resolution ms and pan imagery.Photogrammetric Engineering & Remote Sensing, 72(5):591–596, 2006

    Bruno Aiazzi, Luciano Alparone, Stefano Baronti, Andrea Garzelli, and Massimo Selva. Mtf-tailored multiscale fusion of high-resolution ms and pan imagery.Photogrammetric Engineering & Remote Sensing, 72(5):591–596, 2006. 6

    2006

  2. [2]

    Full-resolution quality assessment of pansharpening: Theoretical and hands-on ap- proaches.IEEE Geoscience and Remote Sensing Magazine, 10(3):168–201, 2022

    Alberto Arienzo, Gemine Vivone, Andrea Garzelli, Luciano Alparone, and Jocelyn Chanussot. Full-resolution quality assessment of pansharpening: Theoretical and hands-on ap- proaches.IEEE Geoscience and Remote Sensing Magazine, 10(3):168–201, 2022. 6

    2022

  3. [3]

    Dynamic convolu- tion: Attention over convolution kernels

    Yinpeng Chen, Xiyang Dai, Mengchen Liu, Dongdong Chen, Lu Yuan, and Zicheng Liu. Dynamic convolu- tion: Attention over convolution kernels. InProceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 11030–11039, 2020. 3

    2020

  4. [4]

    Spanconv: A new convolution via span- ning kernel space for lightweight pansharpening

    Zhi-Xuan Chen, Cheng Jin, Tian-Jing Zhang, Xiao Wu, and Liang-Jian Deng. Spanconv: A new convolution via span- ning kernel space for lightweight pansharpening. InIJCAI, pages 841–847, 2022. 5

    2022

  5. [5]

    A new adaptive component-substitution-based satellite image fusion by us- ing partial replacement.IEEE transactions on geoscience and remote sensing, 49(1):295–309, 2010

    Jaewan Choi, Kiyun Yu, and Yongil Kim. A new adaptive component-substitution-based satellite image fusion by us- ing partial replacement.IEEE transactions on geoscience and remote sensing, 49(1):295–309, 2010. 2

    2010

  6. [6]

    Detail injection-based deep convolutional neu- ral networks for pansharpening.IEEE Transactions on Geo- science and Remote Sensing, page 6995–7010, 2021

    Liang-Jian Deng, Gemine Vivone, Cheng Jin, and Jocelyn Chanussot. Detail injection-based deep convolutional neu- ral networks for pansharpening.IEEE Transactions on Geo- science and Remote Sensing, page 6995–7010, 2021. 2

    2021

  7. [7]

    Machine learning in pan- sharpening: A benchmark, from shallow to deep networks

    Liang-Jian Deng, Gemine Vivone, Mercedes E Paoletti, Giuseppe Scarpa, Jiang He, Yongjun Zhang, Jocelyn Chanussot, and Antonio Plaza. Machine learning in pan- sharpening: A benchmark, from shallow to deep networks. IEEE Geoscience and Remote Sensing Magazine, 10(3): 279–315, 2022. 5, 2

    2022

  8. [8]

    Content-adaptive non-local convolution for remote sensing pansharpening

    Yule Duan, Xiao Wu, Haoyu Deng, and Liang-Jian Deng. Content-adaptive non-local convolution for remote sensing pansharpening. InProceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 27738–27747, 2024. 3

    2024

Show all 41 references
  1. [9]

    A variational pan-sharpening with local gradient constraints

    Xueyang Fu, Zihuang Lin, Yue Huang, and Xinghao Ding. A variational pan-sharpening with local gradient constraints. InProceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 10265–10274, 2019. 2

    2019

  2. [10]

    Robustness of a network of networks.Physical review letters, 107(19):195701, 2011

    Jianxi Gao, Sergey V Buldyrev, Shlomo Havlin, and H Eu- gene Stanley. Robustness of a network of networks.Physical review letters, 107(19):195701, 2011. 3

    2011

  3. [11]

    Hypercomplex quality assessment of multi/hyperspectral images.IEEE Geoscience and Remote Sensing Letters, 6(4):662–665, 2009

    Andrea Garzelli and Filippo Nencini. Hypercomplex quality assessment of multi/hyperspectral images.IEEE Geoscience and Remote Sensing Letters, 6(4):662–665, 2009. 6

    2009

  4. [12]

    Deep residual learning for image recognition

    Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. InProceed- ings of the IEEE conference on computer vision and pattern recognition, pages 770–778, 2016. 2

    2016

  5. [13]

    A general adaptive dual-level weighting mechanism for remote sensing pansharpening

    Jie Huang, Haorui Chen, Jiaxuan Ren, Siran Peng, and Liangjian Deng. A general adaptive dual-level weighting mechanism for remote sensing pansharpening. InProceed- ings of the Computer Vision and Pattern Recognition Con- ference, pages 7447–7456, 2025. 2

    2025

  6. [14]

    Dynamic filter networks.Advances in neural informa- tion processing systems, 29, 2016

    Xu Jia, Bert De Brabandere, Tinne Tuytelaars, and Luc V Gool. Dynamic filter networks.Advances in neural informa- tion processing systems, 29, 2016. 2

    2016

  7. [15]

    Lagconv: Local-context adap- tive convolution kernels with global harmonic bias for pan- sharpening

    Zi-Rong Jin, Tian-Jing Zhang, Tai-Xiang Jiang, Gemine Vivone, and Liang-Jian Deng. Lagconv: Local-context adap- tive convolution kernels with global harmonic bias for pan- sharpening. InProceedings of the AAAI conference on arti- ficial intelligence, pages 1113–1121, 2022. 2

    2022

  8. [16]

    Haze correction for contrast-based multispectral pansharpening.IEEE Geoscience and Remote Sensing Let- ters, 14(12):2255–2259, 2017

    Simone Lolli, Luciano Alparone, Andrea Garzelli, and Gem- ine Vivone. Haze correction for contrast-based multispectral pansharpening.IEEE Geoscience and Remote Sensing Let- ters, 14(12):2255–2259, 2017. 6

    2017

  9. [17]

    Some methods for classification and analy- sis of multivariate observations

    J MacQueen. Some methods for classification and analy- sis of multivariate observations. volume 1 of proceedings of the fifth berkeley symposium on mathematical statistics and probability, 1967. 3

    1967

  10. [18]

    Fusion of multispectral and panchromatic images based on morphological operators.IEEE Transac- tions on Image Processing, 25(6):2882–2895, 2016

    Rocco Restaino, Gemine Vivone, Mauro Dalla Mura, and Jo- celyn Chanussot. Fusion of multispectral and panchromatic images based on morphological operators.IEEE Transac- tions on Image Processing, 25(6):2882–2895, 2016. 6

    2016

  11. [19]

    U- net: Convolutional networks for biomedical image segmen- tation

    Olaf Ronneberger, Philipp Fischer, and Thomas Brox. U- net: Convolutional networks for biomedical image segmen- tation. InInternational Conference on Medical image com- puting and computer-assisted intervention, pages 234–241. Springer, 2015. 5

    2015

  12. [20]

    Cmt: Cross modulation transformer with hybrid loss for pansharpening.IEEE Geoscience and Remote Sens- ing Letters, 2024

    Wen-Jie Shu, Hong-Xia Dou, Rui Wen, Xiao Wu, and Liang- Jian Deng. Cmt: Cross modulation transformer with hybrid loss for pansharpening.IEEE Geoscience and Remote Sens- ing Letters, 2024. 2

    2024

  13. [21]

    Kpconv: Flexible and deformable convolution for point clouds

    Hugues Thomas, Charles R Qi, Jean-Emmanuel Deschaud, Beatriz Marcotegui, Franc ¸ois Goulette, and Leonidas J Guibas. Kpconv: Flexible and deformable convolution for point clouds. InProceedings of the IEEE/CVF international conference on computer vision, pages 6411–6420, 2019. 2

    2019

  14. [22]

    Vari- ational pansharpening by exploiting cartoon-texture similari- ties.IEEE Transactions on Geoscience and Remote Sensing, 60:1–16, 2021

    Xin Tian, Yuerong Chen, Changcai Yang, and Jiayi Ma. Vari- ational pansharpening by exploiting cartoon-texture similari- ties.IEEE Transactions on Geoscience and Remote Sensing, 60:1–16, 2021. 2, 5

    2021

  15. [23]

    Robust band-dependent spatial-detail ap- proaches for panchromatic sharpening.IEEE Transactions on Geoscience and Remote Sensing, page 6421–6433, 2019

    Gemine Vivone. Robust band-dependent spatial-detail ap- proaches for panchromatic sharpening.IEEE Transactions on Geoscience and Remote Sensing, page 6421–6433, 2019. 6

    2019

  16. [24]

    Robust band-dependent spatial-detail ap- proaches for panchromatic sharpening.IEEE transactions on Geoscience and Remote Sensing, 57(9):6421–6433, 2019

    Gemine Vivone. Robust band-dependent spatial-detail ap- proaches for panchromatic sharpening.IEEE transactions on Geoscience and Remote Sensing, 57(9):6421–6433, 2019. 2

    2019

  17. [25]

    Contrast and error- based fusion schemes for multispectral image pansharpen- ing.IEEE Geoscience and Remote Sensing Letters, 11(5): 930–934, 2013

    Gemine Vivone, Rocco Restaino, Mauro Dalla Mura, Gior- gio Licciardi, and Jocelyn Chanussot. Contrast and error- based fusion schemes for multispectral image pansharpen- ing.IEEE Geoscience and Remote Sensing Letters, 11(5): 930–934, 2013. 2

    2013

  18. [26]

    Full scale regression-based injection coefficients for panchromatic sharpening.IEEE Transactions on Image Pro- cessing, 27(7):3418–3431, 2018

    Gemine Vivone, Rocco Restaino, and Jocelyn Chanus- sot. Full scale regression-based injection coefficients for panchromatic sharpening.IEEE Transactions on Image Pro- cessing, 27(7):3418–3431, 2018. 6

    2018

  19. [27]

    Full scale regression-based injection coefficients for panchromatic sharpening.IEEE Transactions on Image Pro- cessing, 27(7):3418–3431, 2018

    Gemine Vivone, Rocco Restaino, and Jocelyn Chanus- sot. Full scale regression-based injection coefficients for panchromatic sharpening.IEEE Transactions on Image Pro- cessing, 27(7):3418–3431, 2018. 2

    2018

  20. [28]

    Presses des MINES, 2002

    Lucien Wald.Data fusion: definitions and architectures: fusion of images of different spatial resolutions. Presses des MINES, 2002. 6

    2002

  21. [29]

    Fusion of satellite images of different spatial resolutions: Assessing the quality of resulting images.Photogrammetric engineer- ing and remote sensing, 63(6):691–699, 1997

    Lucien Wald, Thierry Ranchin, and Marc Mangolini. Fusion of satellite images of different spatial resolutions: Assessing the quality of resulting images.Photogrammetric engineer- ing and remote sensing, 63(6):691–699, 1997. 5

    1997

  22. [30]

    Adaptive rectangular convolution for remote sensing pansharpening

    Xueyang Wang, Zhixin Zheng, Jiandong Shao, Yule Duan, and Liang-Jian Deng. Adaptive rectangular convolution for remote sensing pansharpening. InProceedings of the Computer Vision and Pattern Recognition Conference, pages 17872–17881, 2025. 2

    2025

  23. [31]

    Swift: A general sensitive weight identification framework for fast sensor-transfer pan- sharpening.arXiv preprint arXiv:2507.20311, 2025

    Zeyu Xia, Chenxi Sun, Tianyu Xin, Yubo Zeng, Haoyu Chen, and Liang-Jian Deng. Swift: A general sensitive weight identification framework for fast sensor-transfer pan- sharpening.arXiv preprint arXiv:2507.20311, 2025. 2

    2025 arXiv

  24. [32]

    Fusionmamba: Dynamic feature enhancement for mul- timodal image fusion with mamba.Visual Intelligence, 2(1): 37, 2024

    Xinyu Xie, Yawen Cui, Tao Tan, Xubin Zheng, and Zitong Yu. Fusionmamba: Dynamic feature enhancement for mul- timodal image fusion with mamba.Visual Intelligence, 2(1): 37, 2024. 2

    2024

  25. [33]

    Tianyu Xin, Jin-Liang Xiao, Zeyu Xia, Shan Yin, and Liang-Jian Deng. Training and inference within 1 second– tackle cross-sensor degradation of real-world pansharpen- ing with efficient residual feature tailoring.arXiv preprint arXiv:2508.07369, 2025. 2

    2025

  26. [34]

    Qizhi Xu, Yuan Li, Mingjin Zhang, and Wei Li. Coco- net: A dual-supervised network with unified roi-loss for low-resolution ship detection from optical satellite image sequences.IEEE Transactions on Geoscience and Remote Sensing, 60:1–15, 2022. 1

    2022

  27. [35]

    PanNet: A Deep Network Ar- chitecture for Pan-Sharpening

    Junfeng Yang, Xueyang Fu, Yuwen Hu, Yue Huang, Xing- hao Ding, and John Paisley. PanNet: A Deep Network Ar- chitecture for Pan-Sharpening. In2017 IEEE International Conference on Computer Vision (ICCV), pages 1753–1761,

  28. [36]

    Shengwei Zhong, Ye Zhang, Yushi Chen, and Di Wu. Com- bining component substitution and multiresolution analysis: A novel generalized bdsd pansharpening algorithm.IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 10(6):2867–2875, 2017. 6

    2017

  29. [37]

    Ssdiff: Spatial-spectral integrated diffusion model for remote sensing pansharpening.Advances in Neu- ral Information Processing Systems, 37:77962–77986, 2024

    Yu Zhong, Xiao Wu, Zihan Cao, Hong-Xia Dou, and Liang- Jian Deng. Ssdiff: Spatial-spectral integrated diffusion model for remote sensing pansharpening.Advances in Neu- ral Information Processing Systems, 37:77962–77986, 2024. 2

    2024

  30. [38]

    Yu-Wei Zhuo, Tian-Jing Zhang, Jin-Fan Hu, Hong-Xia Dou, Ting-Zhu Huang, and Liang-Jian Deng. A deep-shallow fu- sion network with multidetail extractor and spectral attention for hyperspectral pansharpening.IEEE Journal of Selected Topics in Applied Earth Observations and Remo...

    2022

  31. [39]

    Analysis on Redundant and Heterogeneous Regions 5.1. Rank Heterogeneity Revealed by SVD Analysis To mathematically quantify the disparity in information content between ”redundant backgrounds” and ”complex foregrounds” in remote sensing imagery, we performed a Singular Value D...

  32. [40]

    Details of Bi2MANet Architecture Inspired by the celebrated U-Net architecture, we propose Bi2MANet, a network designed for high-quality multispec- tral image reconstruction

    Details on Experiments and Discussion 6.1. Details of Bi2MANet Architecture Inspired by the celebrated U-Net architecture, we propose Bi2MANet, a network designed for high-quality multispec- tral image reconstruction. As illustrated in Fig. 7, the net- work takes a channel-wis...

  33. [41]

    This includes the imple- mentation of Bi2MANet, all training and evaluation scripts, and the pre-trained models used in this paper

    Code Availability To ensure the reproducibility of our results and to facilitate future research in the community, we will release the com- plete source code for our project. This includes the imple- mentation of Bi2MANet, all training and evaluation scripts, and the pre-train...

    2017

Pith tools

Reviewed August 3, 2026 · model on record in the stance chip above.