Divide-and-Conquer Approach to Holistic Cognition in High-Similarity Contexts with Limited Data

• URL: http://arxiv.org/abs/2604.19339v1
• Date: Tue, 21 Apr 2026 11:17:09 GMT
• Title: Divide-and-Conquer Approach to Holistic Cognition in High-Similarity Contexts with Limited Data
• Abstract summary: We propose a novel Divide-and-Conquer Holistic Cognition Network (DHCNet)<n>DHCNet implements a divide-and-conquer strategy by decomposing holistic cues into spatially-associated subtle discrepancies.<n>DHCNet achieves remarkable performance on five widely-used Ultra-FGVC datasets.
• Score: 73.20753799870282
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Ultra-fine-grained visual categorization (Ultra-FGVC) aims to classify highly similar subcategories within fine-grained objects using limited training samples. However, holistic yet discriminative cues, such as leaf contours in extremely similar cultivars, remain under-explored in current studies, thereby limiting recognition performance. Though crucial, modeling holistic cues with complex morphological structures typically requires massive training samples, posing significant challenges in data-limited scenarios. To address this challenge, we propose a novel Divide-and-Conquer Holistic Cognition Network (DHCNet) that implements a divide-and-conquer strategy by decomposing holistic cues into spatially-associated subtle discrepancies and progressively establishing the holistic cognition process, significantly simplifying holistic cognition while reducing dependency on training data. Technically, DHCNet begins by progressively analyzing subtle discrepancies, transitioning from smaller local patches to larger ones using a self-shuffling operation on local regions. Simultaneously, it leverages the unaffected local regions to potentially guide the perception of the original topological structure among the shuffled patches, thereby aiding in the establishment of spatial associations for these discrepancies. Additionally, DHCNet incorporates the online refinement of these holistic cues discovered from local regions into the training process to iteratively improve their quality. As a result, DHCNet uses these holistic cues as supervisory signals to fine-tune the parameters of the recognition model, thus improving its sensitivity to holistic cues across the entire objects. Extensive evaluations demonstrate that DHCNet achieves remarkable performance on five widely-used Ultra-FGVC datasets.

Related papers

• Beyond Activation Alignment: The Geometry of Neural Sensitivity [0.0]
  We introduce a framework based on local decodable information, which focuses on a representation's ability to discriminate small perturbations.<n>We compare these regularized signatures using a log-spectral distance on the manifold of symmetric positive definite (SPD) matrices.<n> Empirically, this framework enables the recovery of corresponding layers across independently trained artificial neural networks.
  arXiv  Detail & Related papers  (2026-05-04T23:21:24Z)
• Learning Neural Operators from Partial Observations via Latent Autoregressive Modeling [25.277110071740953]
  We introduce the first systematic framework for learning neural operators from partial observation.<n>Our proposed Latent Autoregressive Neural Operator(LANO) introduces two novel components designed explicitly to address the core difficulties of partial observations.
  arXiv  Detail & Related papers  (2026-01-22T00:33:38Z)
• Neighbor-Aware Calibration of Segmentation Networks with Penalty-Based Constraints [19.897181782914437]
  We propose a principled and simple solution based on equality constraints on the logit values, which enables to control explicitly both the enforced constraint and the weight of the penalty. Our approach can be used to train a wide span of deep segmentation networks.
  arXiv  Detail & Related papers  (2024-01-25T19:46:57Z)
• Sampling-enabled scalable manifold learning unveils the discriminative cluster structure of high-dimensional data [17.411028691739897]
  We propose a sampling-based Scalable manifold learning technique that enables Uniform and Discriminative Embedding, namely SUDE, for large-scale and high-dimensional data.<n>We empirically validated the effectiveness of SUDE on synthetic datasets and real-world benchmarks, and applied it to analyze single-cell data and detect anomalies in electrocardiogram (ECG) signals.
  arXiv  Detail & Related papers  (2024-01-02T08:43:06Z)
• Deep face recognition with clustering based domain adaptation [57.29464116557734]
  We propose a new clustering-based domain adaptation method designed for face recognition task in which the source and target domain do not share any classes. Our method effectively learns the discriminative target feature by aligning the feature domain globally, and, at the meantime, distinguishing the target clusters locally.
  arXiv  Detail & Related papers  (2022-05-27T12:29:11Z)
• Inducing Gaussian Process Networks [80.40892394020797]
  We propose inducing Gaussian process networks (IGN), a simple framework for simultaneously learning the feature space as well as the inducing points. The inducing points, in particular, are learned directly in the feature space, enabling a seamless representation of complex structured domains. We report on experimental results for real-world data sets showing that IGNs provide significant advances over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-04-21T05:27:09Z)
• Weakly Supervised Person Search with Region Siamese Networks [65.76237418040071]
  Supervised learning is dominant in person search, but it requires elaborate labeling of bounding boxes and identities. We present a weakly supervised setting where only bounding box annotations are available. Our model achieves the rank-1 of 87.1% and mAP of 86.0% on CUHK-SYSU benchmark.
  arXiv  Detail & Related papers  (2021-09-13T16:33:27Z)
• Quasi-Global Momentum: Accelerating Decentralized Deep Learning on Heterogeneous Data [77.88594632644347]
  Decentralized training of deep learning models is a key element for enabling data privacy and on-device learning over networks. In realistic learning scenarios, the presence of heterogeneity across different clients' local datasets poses an optimization challenge. We propose a novel momentum-based method to mitigate this decentralized training difficulty.
  arXiv  Detail & Related papers  (2021-02-09T11:27:14Z)
• Improving Monocular Depth Estimation by Leveraging Structural Awareness and Complementary Datasets [21.703238902823937]
  We propose a structure-aware neural network with spatial attention blocks to exploit the spatial relationship of visual features. Second, we introduce a global focal relative loss for uniform point pairs to enhance spatial constraint in the prediction. Third, based on analysis of failure cases for prior methods, we collect a new Hard Case (HC) Depth dataset of challenging scenes.
  arXiv  Detail & Related papers  (2020-07-22T08:21:02Z)
• Seismic horizon detection with neural networks [62.997667081978825]
  This paper is an open-sourced research of applying binary segmentation approach to the task of horizon detection on multiple real seismic cubes with a focus on inter-cube generalization of the predictive model. The main contribution of this paper is an open-sourced research of applying binary segmentation approach to the task of horizon detection on multiple real seismic cubes with a focus on inter-cube generalization of the predictive model.
  arXiv  Detail & Related papers  (2020-01-10T11:30:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.