---
title: Dual-Granularity Identity Association
url: https://www.emergentmind.com/topics/local-and-global-dual-granularity-identity-association-mechanism
type: topic
---

# Dual-Granularity Identity Association

Searching arXiv for the named mechanism and closely related papers.
I’ll look up arXiv records relevant to “local-and-global dual-granularity identity association.”
The **Local-and-Global Dual-Granularity Identity Association Mechanism** most directly denotes a weakly supervised text-to-person image matching framework that infers identity relations at two coupled scales: a **local level**, where cross-modal relations are explicitly constructed within a mini-batch, and a **global level**, where broader one-to-many associations are mined across the training set through a memory bank and a dynamic confidence adjustment mechanism. In this formulation, the central problem is that only paired image-text samples are known during training, while most cross-modal identity relations among different samples are unknown; the mechanism is therefore designed to recover both subtle local correspondences and dataset-level identity structure without full identity supervision [2507.06744]. Related literature uses closely analogous local/global or fine/coarse association designs in video person re-identification, visible-thermal re-identification, image-language supervision, identity customization, long-term memory retrieval, and cross-document event coreference, although the operational meaning of “local” and “global” varies by task [2110.12018].

## 1. Problem formulation and conceptual scope

In the weakly supervised text-to-person setting, the training set is
$$
\mathcal{D} = { (I_i, T_i) }_{i=1}^N,
$$
where \(I_i\) is the \(i\)-th person image and \(T_i\) is its paired text description. The only guaranteed identity relation is the paired one: \((I_i, T_i)\) share the same pedestrian identity, whereas for \(i \neq j\), the identity relation between \(I_i\) and \(T_j\) is unknown. The mechanism is motivated by the fact that one identity can correspond to **multiple images** and **multiple descriptions** across cameras and wording variations, but weak supervision does not provide those extra labels [2507.06744].

The local-and-global construction is intended to remedy a limitation of existing weakly supervised methods that usually rely on **dataset-wide clustering** to mine pseudo identity associations. The cited formulation states that such clustering is brittle for **hard samples**—including visually similar people or semantically ambiguous descriptions—because clustering can merge wrong identities or miss true ones. The proposed response is not a single pseudo-labeling step, but a two-scale association design comprising **Basic Feature Extraction (BFE)** with local relationship construction, **Global Sample Relationship Construction and Feature Refinement (GSRC-FR)**, and **Information-Asymmetric Sample Pair Construction and Consistency Learning (IASC-CL)** [2507.06744].

A broader conceptual reading is supported by adjacent work. In video person re-identification, local alignment and global appearance are described as complementary because local-only methods can be fragile under shifted or partial detections, while global-only methods may correlate background clutter or switched identities [2110.12018]. In long-term conversational agents, single-granularity retrieval is likewise described as too brittle because it loses either **fine detail** or **high-level context** [2505.19549]. These neighboring formulations suggest that a dual-granularity mechanism is best understood not as a domain-specific heuristic, but as a structured response to the general failure mode of single-scale identity or relevance estimation.

## 2. Local-granularity association within the mini-batch

The local mechanism in the weakly supervised text-to-person formulation operates **within a mini-batch** and explicitly constructs cross-modal identity relations from three ingredients: intra-modal similarity among images, intra-modal similarity among texts, and known paired image-text supervision. The image encoder and text encoder are **CLIP-pretrained**, producing image features \(\bm{f}_i^v \in \mathbb{R}^{1 \times d}\) and text features \(\bm{f}_i^t \in \mathbb{R}^{1 \times d}\). Basic alignment is first established through contrastive learning:
$$
\mathcal{L}_{t2v} = - \frac{1}{B} \sum_{i=1}^B \log \frac{\exp (\text{sim}(\bm{f}_i^t, \bm{f}_i^v) / \tau)}{\sum_{k=1}^B \exp (\text{sim}(\bm{f}_i^t, \bm{f}_k^v) / \tau)},
$$
with a symmetric \(\mathcal{L}_{v2t}\), yielding
$$
\mathcal{L}_{itc} = \mathcal{L}_{t2v} + \mathcal{L}_{v2t}.
$$
This baseline, however, still uses paired samples directly and does not by itself recover latent one-to-many identity relations [2507.06744].

The local association stage then computes intra-modal similarity matrices:
$$
{\bm{M}^v}(i,j) = {\rm{sim}( {\bm{f}_i^v}, \bm{f}_j^v)}, \qquad
{\bm{M}^t}(i,j) = {\rm{sim}( {\bm{f}_i^t}, \bm{f}_j^t)}.
$$
Because self-similarity may contain noise from non-identity factors, the matrices are binarized by thresholding with \(\text{th}=0.7\):
$$
\tilde {\bm{M}^k}(i,j) =
\left\{
\begin{array}{ll}
1 & \text{if } {\bm{M}^k}(i,j) > \text{th} \\
0 & \text{if } {\bm{M}^k}(i,j) \le \text{th}
\end{array}
\right.
$$
for \(k \in \{v,t\}\). The cross-modal identity correspondence matrix is then defined by Hadamard product:
$$
{\bm{M}^{v,t} = {\tilde {\bm{M}^v} \odot {\tilde {\bm{M}^t}.
$$
This construction encodes the paper’s core local claim: if two samples are judged similar both in image space and text space, they are more likely to share identity [2507.06744].

To reduce mismatches, the local relationship matrix is softened:
$$
\bm{Q} = \bm{I} + \lambda (\bm{M}^{v,t} - \bm{I}),
$$
after which zero entries are masked out,
$$
\bm{Q}(i,j) =
\left\{
\begin{array}{ll}
-\infty & \text{if } \bm{Q}(i,j) = 0 \\
\bm{Q}(i,j) & \text{otherwise}
\end{array}
\right.
$$
and converted into a target distribution
$$
q_{i,j} = \frac{\exp(\bm{Q}(i,j))}{\sum_{k=1}^B \exp(\bm{Q}(i,k))}.
$$
The model prediction over text-image pairs is
$$
p_{i,j} = \frac{\exp\left(\text{sim}\left(\bm{f}_i^v, \bm{f}_j^t\right) / \tau\right)}{\sum_{k=1}^B \exp\left(\text{sim}\left(\bm{f}_i^v, \bm{f}_k^t\right) / \tau\right)}.
$$
The local similarity distribution matching loss is
$$
\mathcal{L}_{rc\_b}^v = \frac{1}{B} \sum_{i=1}^B \sum_{j=1}^B p_{i,j} \log\left(\frac{p_{i,j}}{q_{i,j} + \varepsilon}\right),
$$
with a symmetric \(\mathcal{L}_{rc\_b}^t\), giving
$$
\mathcal{L}_{rc\_b} = \mathcal{L}_{rc\_b}^v + \mathcal{L}_{rc\_b}^t.
$$
The stated effect is to form **bidirectional cross-modal identity constraints** inside a batch while also using within-modality structure to infer additional likely identity relations [2507.06744].

## 3. Global-granularity identity expansion and dynamic refinement

The global mechanism addresses a structural limitation of the batch-level design: a mini-batch is too small to contain many same-identity cross-modal pairs. To expand supervision across the **entire training set**, the method introduces memory banks
$$
{\mathcal{B}^v} = \{ \hat{\bm{f}_i^v \}_{i=1}^N, \quad
{\mathcal{B}^t} = \{ \hat{\bm{f}_i^t \}_{i=1}^N,
$$
and updates the image memory bank by momentum:
$$
\hat{\bm{f}_{i,n}^v = \alpha {\bm{f}_i^v + (1 - \alpha) \hat{\bm{f}_{i,n-1}^v.
$$
A key design choice is to use **person images as the anchor**, because visual appearance is described as carrying richer and more identity-specific cues than text [2507.06744].

For a current batch image feature \(\bm{f}_i^v\), similarity to all memory-bank image features is computed as
$$
\bm{M}_m^v(i,j) = \text{sim}( \bm{f}_i^v, \hat{\bm{f}_{j,n-1}^v ).
$$
For each row, the top-\(k\) nearest candidates are taken and then filtered by thresholding:
$$
\bm{J}_i = \{ j \mid {\bm{M}_m^v(i,j) > \text{th} \}, \quad i \in \{ 1, \ldots, B \}.
$$
These \(\bm{J}_i\) are treated as samples sharing identity with image \(i\). Identity is then propagated from image \(i\) to its corresponding text, and from those texts back to other images, thereby establishing a dataset-level **one-to-many** identity association [2507.06744].

Cross-modal association is expanded by combining within-batch text-image similarity
$$
\bm{S}^{t,v}(i,j) = {\rm sim}(\bm{f}_i^t, \bm{f}_j^v)
$$
with similarity between batch texts and memory-bank-selected images
$$
\bm{S}^{t,m}(i,j) = {\rm sim}(\bm{f}_i^t, \hat{\bm{f}_{j,n-1}^v).
$$
These are concatenated:
$$
\bm{S}' = {\rm concat}(\bm{S}^{t,v}, \bm{S}^{t,m}) \in \mathbb{R}^{B \times B_1},
$$
and used to build a target matrix
$$
\bm{Q}'(i,j) =
\left\{
\begin{array}{cl}
1 & \text{if } j \in \bm{J}'_i \\
-\infty & \text{otherwise}
\end{array}
\right.
$$
for each text’s candidate set \(\bm{J}'_i\) [2507.06744].

The defining refinement is the **confidence-based dynamic adjustment mechanism**. For \(j \in \bm{J}'_i\) and \(j \ne i\),
$$
\bm{Q}'(i,j) = 1 - \frac{\exp({\rm sim}(\bm{f}_i^v, \bm{f}_j^v))}{\sum\limits_{k \in \bm{J}'_i} \exp({\rm sim}(\bm{f}_i^v, \bm{f}_k^v))}.
$$
The accompanying interpretation is explicit: directly using \(\bm{Q}'\) may overemphasize high-confidence pairs and ignore weak but informative ones, whereas the adjusted target controls very strongly similar candidates and prevents weaker related pairs from being discarded completely. The final normalized target and prediction are
$$
q'_{i,j} = \frac{\exp(\bm{Q}'(i,j))}{\sum\limits_{k \in \bm{J}'_i} \exp(\bm{Q}'(i,k))},
\qquad
p'_{i,j} = \frac{\exp(\bm{S}'(i,j)/\tau)}{\sum\limits_{k=1}^{B_1} \exp(\bm{S}'(i,k)/\tau)},
$$
and the global SDM loss is
$$
\mathcal{L}_{rc\_g}^{t} = \frac{1}{B} \sum\limits_{i=1}^B \sum\limits_{j=1}^{B_1} p'_{i,j} \log \left( \frac{p'_{i,j}}{q'_{i,j} + \epsilon} \right),
$$
with symmetric \(\mathcal{L}_{rc\_g}^{v}\), giving
$$
\mathcal{L}_{rc\_g} = \mathcal{L}_{rc\_g}^{v} + \mathcal{L}_{rc\_g}^{t}.
$$
The stated role of this global stage is to expand supervision beyond the batch and improve sensitivity to **weakly associated samples** [2507.06744].

## 4. Information asymmetry, consistency learning, and the complete training objective

The cited mechanism does not stop at local and global relation construction. It adds **Information-Asymmetric Sample Pair Construction and Consistency Learning (IASC-CL)** to address hard sample mining and robustness. For a paired sample \((I_i, T_i)\), image augmentation is
$$
{\mathcal{A}^v(I_i) = \text{Augment}(I_i),
$$
including horizontal flipping, border padding, random cropping, and random erasing, while text augmentation is
$$
{\mathcal{A}^t(T_i) = \text{Mask}(T_i),
$$
which masks parts of the sentence with `[MASK]`. The asymmetric pair
$$
({\mathcal{A}^v(I_i), {\mathcal{A}^t(T_i))}
$$
therefore has weaker explicit semantic correspondence while preserving identity consistency [2507.06744].

The purpose of this construction is stated in practical terms. It simulates real-world conditions such as occlusion, viewpoint changes, incomplete descriptions, and varying description granularity, without requiring manually mined hard pairs. The consistency constraint on these asymmetric pairs is written as
$$
\mathcal{L}_{rc\_h} = \mathcal{L}_{rc\_h}^{\:v} + \mathcal{L}_{rc\_h}^{\:t},
$$
and is intended to preserve semantic identity consistency even when the available information differs across modalities [2507.06744].

The full objective combines the baseline contrastive term, the local within-batch relation construction term, the global relation construction and refinement term, and the asymmetric consistency term:
$$
\mathcal{L} = \mathcal{L}_{itc} + \mathcal{L}_{rc\_b} + \mathcal{L}_{rc\_g} + \mathcal{L}_{rc\_h}.
$$
In the cited presentation, the improvement mechanism is cumulative. The **local level** captures fine-grained, immediate identity constraints inside the batch; the **global level** expands association beyond the batch and identifies broader one-to-many correspondences; the **confidence-based adjustment** keeps weak associations active; and the **information-asymmetric learning** supplies hard conditions without relying on noisy clustering [2507.06744]. This suggests that the “mechanism” is not merely the coexistence of two scales, but the interaction of local inference, global expansion, and robustness-oriented refinement.

## 5. Empirical profile and ablation evidence

The mechanism is evaluated on **CUHK-PEDES**, **ICFG-PEDES**, and **RSTPReid**. On **CUHK-PEDES**, the reported weakly supervised results are **Rank-1: 73.06%**, **mAP: 64.88%**, and **mINP: 48.15%**, improving on **CPCL** by **Rank-1 by 3.03%** and **mAP by 1.69%**. On **ICFG-PEDES**, the reported values are **Rank-1: 63.71%**, **mAP: 36.87%**, and **mINP: 6.20%**. On **RSTPReid**, the reported values are **Rank-1: 61.30%**, **mAP: 47.20%**, and **mINP: 25.47%**, improving on CPCL by **Rank-1 by 2.95%** and **mAP by 1.39%** [2507.06744].

The ablation sequence is especially central because it isolates the contribution of each component. The baseline gives **64.69 / 54.24 / 54.60** Rank-1 on **CUHK / ICFG / RSTPReid**. Adding **LRC** yields **69.04 / 58.45 / 56.30**. Adding **GSRC-FR** alone yields **67.56 / 58.51 / 55.90**. Combining **LRC + GSRC-FR** yields **70.20 / 60.30 / 57.25**. The full system with **LRC + GSRC-FR + IASC-CL** yields **73.06 / 63.71 / 61.30**. The reported pattern is therefore additive rather than redundant: local association helps, global association helps, and the asymmetric consistency module provides the largest final boost [2507.06744].

Additional analysis supports the reliability of the global mining stage. The paper reports that the global relation construction module achieves mined-relation accuracy of **up to 92.0% on CUHK-PEDES** and **about 75.0% on ICFG-PEDES** [2507.06744]. A plausible implication is that the memory-bank expansion is not functioning merely as a high-recall neighbor collector, but as a relatively precise identity propagation mechanism under weak supervision.

## 6. Related local/global and fine/coarse association designs

The phrase “Local-and-Global Dual-Granularity Identity Association Mechanism” is exact for weakly supervised text-to-person image matching, but several adjacent papers instantiate closely related structures.

| Domain and paper | Local granularity | Global granularity |
|---|---|---|
| Weakly supervised text-to-person matching [2507.06744] | Within-batch cross-modal identity relations | Memory-bank-expanded one-to-many relations |
| Video person Re-ID [2110.12018] | Local part alignments via LAQ | Global appearance correlations via GCQ |
| VT-ReID with DGTL [2012.05010] | Sample-based triplet supervision | Center-based triplet supervision |
| Person Re-ID with language [1808.01571] | Image-region and noun-phrase association | Whole-image and whole-description association |
| VT-ReID with CM-LSP-GE [2206.04401] | Horizontal-part shortest-path alignment | BN-enhanced whole-person representation |
| Identity customization [2412.16832] | Face-region identity, pose, and expression control | Whole-image harmony and location control |
| Long-term memory retrieval [2505.19549] | Turn/session-level memory | Summary/keyword-level memory |

In **LOGA** for video Re-ID, the method concurrently optimizes a **local aligned quality (LAQ)** module and a **global correlated quality (GCQ)** module, connected through a **local-assembled global appearance prototype**. The cited distinction from prior joint methods is that interaction matters more than mere parallelism: local evidence defines a clean anchor for the global branch, while global evidence feeds back to refine the final tracklet representation [2110.12018]. In **DGTL** for visible-thermal person re-identification, the dual-granularity structure is explicitly **fine-to-coarse**, combining sample-based triplet loss with center-based triplet loss while using **only global person features**; the same paper states that the method can still be viewed as associating identities at **two granularity levels**, moving from **instance-level matching** to **center-level identity matching** [2012.05010].

In image-language supervised person Re-ID, the mechanism is explicitly formulated as **global and local image-language associations**. The **global image-language association** is established according to the identity labels, while the **local association** aligns image regions with noun phrases and reconstructs phrases from phrase-specific visual features [1808.01571]. In visible-thermal Re-ID with **CM-LSP-GE**, local identity association is implemented by horizontally partitioning the image and matching body-part graphs via a shortest-path strategy, whereas the global branch strengthens modality-shared identity discrimination with batch-normalization enhancement [2206.04401].

Outside re-identification, **RealisID** divides identity customization into a **local branch** for facial details, pose, expression, and scale robustness, and a **global branch** for image harmony and face location [2412.16832]. **MemGAS** represents memory as a local-to-global bundle of session, turn, summary, and keywords, then uses GMM-based association, entropy-based granularity routing, Personalized PageRank, and LLM-based filtering to preserve local detail while integrating global conversational context [2505.19549]. In **event coreference**, the relation between identity and granularity is framed through local mention evidence and global document-level aggregation, with the claim that event identity depends on compatibility of action, time, place, and participants rather than lexical matching alone [1704.04259]. Across these formulations, the recurring pattern is that fine-grained evidence supplies precision, while coarser aggregation supplies semantic completeness or robustness.

## 7. Conceptual distinctions and recurrent misconceptions

A recurrent misconception is to equate dual granularity with any architecture that has two branches. The literature does not support that simplification. In video Re-ID, the proposed associative strategy is explicitly reported to outperform a dual-branch strategy that learns local and global information separately, and the conclusion drawn there is that **interaction matters more than just parallelism** [2110.12018]. The weakly supervised text-to-person mechanism follows the same logic: the local and global stages are not independent heads attached to a common encoder, but successive relation-construction procedures whose outputs alter the supervision structure seen by the model [2507.06744].

A second misconception is that “local” must mean body parts and “global” must mean holistic appearance. Some papers adopt that meaning, but the term is task-dependent. In the weakly supervised text-to-person setting, local refers to **within-batch** identity inference and global refers to **dataset-level** association through memory banks [2507.06744]. In DGTL, the relevant distinction is **sample-based** versus **center-based** supervision, and the paper explicitly notes that the method works with **only global person features** [2012.05010]. In MemGAS, local and global denote turn/session details versus summary/keyword abstractions [2505.19549]. The commonality is therefore not a fixed spatial decomposition, but the coordinated use of fine and coarse evidence.

A third misconception is that such mechanisms are simply alternatives to clustering. The weakly supervised text-to-person paper argues the opposite: dataset-wide clustering is brittle for hard samples, and the proposed mechanism is intended to replace sole reliance on clustering with local relationship construction, global memory-bank expansion, dynamic confidence adjustment, and information-asymmetric consistency learning [2507.06744]. Related work in event coreference reaches a comparable conclusion from a different angle: if identity constraints are too loose, the system produces “extreme aggregation and lumping,” whereas overly strict constraints make “each mention ... unique” [1704.04259]. In both cases, the central issue is controlled aggregation rather than indiscriminate merging.

Taken together, these papers define a dual-granularity identity association mechanism as a structured method for linking entities, samples, events, or memories across at least two representational scales. The exact implementation differs by domain, but the underlying design principle remains stable: use a finer level to preserve discriminative detail, use a coarser level to recover broader identity structure, and couple the two so that neither scale dominates the final association decision.

Source: https://www.emergentmind.com/topics/local-and-global-dual-granularity-identity-association-mechanism