In ideal object detection, a model draws a tight bounding box around every individual object. However, when models are trained with "weak" supervision—using only image-level tags like "dog" or "car" instead of precise boxes—they often fall into a specific trap. Instead of identifying three separate dogs in a park, the model draws one giant box encompassing the entire group.
This phenomenon, known as instance grouping ambiguity, occurs because a single large box containing multiple instances satisfies the training objective just as well as individual boxes do. To a weakly supervised model, a cluster of objects is simply a high-density region of class-specific evidence.
The Maximum Evidence Trap
The root of the problem lies in how models localize objects without explicit boundaries. In foundational frameworks like Weakly Supervised Deep Detection Networks, Hakan Bilen and Andrea Vedaldi proposed a two-stream architecture: one for classification and one for detection. The model learns to pick the "proposal" (a candidate box) that best represents the class.
When objects are crowded, the model becomes "lazy." As Qiang Chen notes in the context of maximum subarray search, if detection is treated as finding the region with the highest sum of local confidence scores, the model will naturally prefer a box that captures a whole group of objects. This aggregate box has a higher total "score" than any single box covering just one instance. This leads to a failure in instance-level granularity, where the model cannot distinguish where one entity ends and the next begins.
From Blobs to Points
One way to break this ambiguity is to provide a tiny bit more information: a single dot for each object. Issam H. Laradji and colleagues introduced LC-FCN, which uses point-level supervision to solve the "counting by localization" problem.
Instead of letting the model decide how many objects are in a region, the loss function explicitly encourages the network to produce exactly one "blob" of activation per annotated point. This forces the model to find boundaries even in extremely crowded scenes where objects overlap, effectively preventing the "one box for all" error by anchoring the detection to a specific coordinate.
Spatial Voting and Global Memory
In pure weakly supervised settings where even points aren't available, researchers use architectural constraints to "purify" instances.
Ze Chen introduced Spatial Likelihood Voting (SLV) to combat the tendency of models to merge adjacent objects. Instead of just picking the highest-scoring box, SLV allows all candidate boxes to "vote" on the spatial extent of an object. This consensus mechanism helps the model converge on the actual center and boundaries of individual instances rather than getting pulled toward the center of a cluster.
Another approach involves "remembering" what a single instance looks like across the entire dataset. Yufei Yin and Houqiang Li developed Instance Mining with Class Feature Banks (IM-CFB). By maintaining a memory bank of features from high-confidence objects found in other images, the model can compare a crowded scene against its knowledge of a "prototypical" single object. If a candidate box in a new image contains features that look like two prototypes, the model can recognize it as an incorrect grouping and look for smaller, more precise boxes.
Contrastive Separation
Recent work has turned to contrastive learning to create clear "moats" between instances. Jinhwan Seo and Wonho Bae proposed a Weakly Supervised Contrastive Loss (WSCL) that encourages the model to learn a feature space where different instances of the same category are distinct.
Similarly, the Negative Prototypes Guided Contrastive Learning (NPGC) framework by Chuang Zhu and Yu Zhang focuses on the model's mistakes. By identifying "negative prototypes"—the specific ways the model tends to incorrectly group objects—the system can explicitly learn to avoid those patterns, leading to sharper boundaries in dense environments like remote sensing or baggage security.