Papers
Topics
Authors
Recent
Search
2000 character limit reached

QAConv-QA: Query Adaptive Convolution for ReID

Updated 3 February 2026
  • The paper introduces a module that integrates pixel-level importance weighting with bidirectional consistency, enhancing identity matching under severe clothing changes.
  • It fuses RGB and parsing-based features through multi-modal attention and uses dynamic query-adaptive convolution to generate robust, clothing-invariant representations.
  • Evaluations on PRCC, LTCC, and VC-Clothes benchmarks show significant Top-1 and mAP improvements, validating the method's effectiveness in CC-ReID.

Quality-Aware Query-Adaptive Convolution (QAConv-QA) is a module designed to enhance pixel-level matching within the dual-branch QA-ReID architecture, targeting the challenges of person re-identification (ReID) under severe clothing changes. QAConv-QA introduces two critical mechanisms—pixel-level importance weighting and explicit bidirectional consistency constraints—that together facilitate robust identity correspondence even as superficial appearance varies with clothing. This approach proves essential in clothes-changing ReID (CC-ReID), a setting characterized by strong intra-person appearance shifts.

1. Role of QAConv-QA in the Dual-Branch QA-ReID Framework

QAConv-QA is embedded within the two-branch backbone of QA-ReID, which utilizes complementary cues from RGB images and clothing-invariant structural features. The RGB branch extracts feature maps from the full image using ResNet-50 up to stage 3, producing Frgb∈RC×H×WF_{rgb}\in\mathbb R^{C\times H\times W}. The parsing branch applies a human-parsing network to produce a body-part mask Mbody∈{0,1}H′×W′M_{body}\in\{0,1\}^{H'\times W'}, removing the clothing regions to form Ipar=I⊙MbodyI_{par}=I\odot M_{body} and generating Fpar∈RC×H×WF_{par}\in\mathbb R^{C\times H\times W}.

A multi-modal attention fusion module computes a joint attention map ω∈[0,1]C×H×W\omega\in [0,1]^{C\times H\times W}, blending FrgbF_{rgb} and FparF_{par} into a fused feature map FfuseF_{fuse} via: Fmix=ω⊙Frgb+(1−ω)⊙FparF_{mix} = \omega\odot F_{rgb}+(1-\omega)\odot F_{par}

Ffuse=Conv1×1(Frgb+Fpar+Fmix)F_{fuse} = \text{Conv}_{1\times1}(F_{rgb} + F_{par} + F_{mix})

QAConv-QA directly operates on these fused features at the pixel level, comparing query and gallery images (Mbody∈{0,1}H′×W′M_{body}\in\{0,1\}^{H'\times W'}0, Mbody∈{0,1}H′×W′M_{body}\in\{0,1\}^{H'\times W'}1) through a sequence of similarity calculations, weighting, and aggregation, followed by a post-processing head (bidirectional global max pooling Mbody∈{0,1}H′×W′M_{body}\in\{0,1\}^{H'\times W'}2 batch norm Mbody∈{0,1}H′×W′M_{body}\in\{0,1\}^{H'\times W'}3 MLP Mbody∈{0,1}H′×W′M_{body}\in\{0,1\}^{H'\times W'}4 sigmoid) to yield match probabilities Mbody∈{0,1}H′×W′M_{body}\in\{0,1\}^{H'\times W'}5 (Wang et al., 27 Jan 2026).

2. Pixel-Level Importance Weighting

Each spatial location Mbody∈{0,1}H′×W′M_{body}\in\{0,1\}^{H'\times W'}6 on the Mbody∈{0,1}H′×W′M_{body}\in\{0,1\}^{H'\times W'}7 feature map receives a quality score Mbody∈{0,1}H′×W′M_{body}\in\{0,1\}^{H'\times W'}8 reflecting the likelihood that it lies on an identity-relevant (typically non-clothing) region. The score Mbody∈{0,1}H′×W′M_{body}\in\{0,1\}^{H'\times W'}9 is computed as the fraction of the corresponding Ipar=I⊙MbodyI_{par}=I\odot M_{body}0 input patch covered by the body-part mask, and is normalized by a spatial softmax: Ipar=I⊙MbodyI_{par}=I\odot M_{body}1 The pairwise cosine similarity between query and gallery pixel features Ipar=I⊙MbodyI_{par}=I\odot M_{body}2, Ipar=I⊙MbodyI_{par}=I\odot M_{body}3 is then re-weighted: Ipar=I⊙MbodyI_{par}=I\odot M_{body}4 This mechanism prioritizes features that localize to identity-stable, body-based regions and suppresses the influence of clothing-related areas.

3. Bidirectional Consistency Constraints

To further enhance reliability in pixel-level matching, QAConv-QA introduces explicit bidirectional consistency. Conditional softmaxes are defined over feature locations, establishing the probability that a given pixel in one sample is the best match for a pixel in the other, and vice versa: Ipar=I⊙MbodyI_{par}=I\odot M_{body}5

Ipar=I⊙MbodyI_{par}=I\odot M_{body}6

The bidirectional-consistent similarity takes the product: Ipar=I⊙MbodyI_{par}=I\odot M_{body}7 Aggregating Ipar=I⊙MbodyI_{par}=I\odot M_{body}8 over all pixel pairs with bidirectional global maximum pooling yields a scalar score Ipar=I⊙MbodyI_{par}=I\odot M_{body}9, emphasizing only mutually top-matching, identity-consistent region pairs.

4. Query-Adaptive Convolution and Dynamic Filtering

QAConv-QA adopts a dynamic filter paradigm inspired by the original QAConv formulation [Shengcai Liao & Ling Shao, ECCV 2020], where each query pixel feature Fpar∈RC×H×WF_{par}\in\mathbb R^{C\times H\times W}0 acts as a Fpar∈RC×H×WF_{par}\in\mathbb R^{C\times H\times W}1 convolutional filter upon the gallery feature map:

Fpar∈RC×H×WF_{par}\in\mathbb R^{C\times H\times W}2

This equates to a full query-gallery location similarity matrix. Computation is optimized batch-wise using im2col and einsum. After initial cosine similarity, QAConv-QA systematically applies pixel-level reweighting and bidirectional consistency as above.

5. Integration with Multi-Modal Fusion and Forward Pass Workflow

The QAConv-QA module relies on multi-modal fusion of RGB and parsing-based features, providing joint representations for matching. The forward pass, as outlined in the implementation, comprises: fused feature extraction, pixel weight calculation, pairwise cosine similarity computation, quality reweighting, dual-direction softmax normalization, computation of bidirectionally consistent similarity, aggregation via Bi-GMP, and final post-processing through batch normalization, MLP, and sigmoid activation. The following summarizes the computational sequence:

Fpar∈RC×H×WF_{par}\in\mathbb R^{C\times H\times W}5

6. Supervision and Training Loss Composition

The QA-ReID framework integrates three types of losses:

  • Identity classification loss on globally pooled features of each branch,
  • Triplet loss operating over these embeddings, and
  • Binary cross-entropy matching loss on pixel-level pairwise scores from QAConv-QA.

The total loss Fpar∈RC×H×WF_{par}\in\mathbb R^{C\times H\times W}3 is given by: Fpar∈RC×H×WF_{par}\in\mathbb R^{C\times H\times W}4 This composite objective enforces both global structural identity constraints and fine-grained local alignment under varied clothing.

7. Performance in Clothes-Changing ReID

On challenging CC-ReID benchmarks—PRCC, LTCC, and VC-Clothes—QA-ReID augmented with QAConv-QA achieves state-of-the-art results under clothing-changing protocols:

Dataset Top-1 Gain mAP Gain
PRCC +6.9% +3.9%
LTCC +0.7% +1.9%
VC-Clothes +3.0% +2.8%

Ablation studies isolate the contributions of the two QAConv-QA blocks: pixel weighting alone yields +1.6% Top-1 (PRCC), bidirectional matching alone +0.7%, with the full combination providing +3.1% improvement.

Visualization of QAConv-QA attention maps demonstrates that the model attends chiefly to identity-stable regions—such as the head and limbs—rather than clothing-variant areas, confirming the intended focus on semantically stable cues (Wang et al., 27 Jan 2026).

In sum, QAConv-QA imparts quality-aware, mutual pixel-level filtering to query-adaptive convolution, crucially advancing robust ReID performance amid drastic clothing transitions through a unified mechanism of feature fusion, spatial weighting, and tightly enforced mutual consistency.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Quality-Aware Query Adaptive Convolution (QAConv-QA).