Beyond Landmark Extraction: A Framework for Robust Geometric Feature Construction in Structured Image Classification

• URL: http://arxiv.org/abs/2609.00634v2
• Date: Wed, 02 Sep 2026 11:41:31 GMT
• Title: Beyond Landmark Extraction: A Framework for Robust Geometric Feature Construction in Structured Image Classification
• Abstract summary: discriminative information lies less in individual pixels and more in spatial relationships between semantic parts.<n>This paper studies the post-landmark feature map as the central object of analysis.<n>We evaluate coordinate, distance, angle, and hybrid representations through perturbation and ablation experiments.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Much of the literature on structured image recognition has disproportionately focused on the comparison of classification algorithms. Rather than investigating which classifier performs best, this paper instead asks: what should a classifier know before it ever makes a prediction? In structured vision problems such as gesture recognition, facial expression categorization, and medical image analysis, discriminative information lies less in individual pixels and more in spatial relationships between semantic parts. Raw pixel spaces are high-dimensional, sensitive to nuisance variation, and often obfuscate the geometric structures that make visual tasks interpretable. Landmark extraction provides one form of dimension reduction, but it does not by itself determine the information preserved. This paper studies the post-landmark feature map as the central object of analysis and proposes a systematic framework for constructing and interpreting landmark-derived representations as an, informed, feature-based "dimension reduction" step. Using static hand gesture recognition as a case study, we evaluate coordinate, distance, angle, and hybrid representations through perturbation and ablation experiments. The results show that visually variable data exposes substantial gaps between raw coordinate features and their geometrically invariant counterparts, while hybrid representations achieve the strongest overall performance by combining complementary geometric components. These findings frame feature construction as a fundamental modeling decision and ultimately suggests that the question of what representation should a classifier learn from is one worth asking. The code used for feature construction and evaluation is available at https://github.com/ShivMaureeCWRU/Feature_based_dimension_reduction

Related papers

• See More, Match Better: Multi-Source Feature Fusion for Two-View Correspondence Learning [52.52121389921707]
  Two-view correspondence learning aims to distinguish true correspondences (inliers) from false ones (outliers) in image pairs.<n>Existing methods mainly rely on coordinate-based geometric consistency.<n>We propose TriMatch, a multi-source feature fusion framework for two-view correspondence learning.
  arXiv  Detail & Related papers  (2026-06-08T09:33:01Z)
• Aitchison Embeddings for Learning Compositional Graph Representations [8.849342925277577]
  We propose a graph embedding framework grounded in Aitchison geometry, the canonical geometry for comparing mixtures.<n>Our method achieves competitive performance with strong baselines while providing explainability by construction rather than post-hoc.
  arXiv  Detail & Related papers  (2026-05-01T15:05:23Z)
• Guided Interpretable Facial Expression Recognition via Spatial Action Unit Cues [55.97779732051921]
  A new learning strategy is proposed to explicitly incorporate au cues into classifier training. We show that our strategy can improve layer-wise interpretability without degrading classification performance.
  arXiv  Detail & Related papers  (2024-02-01T02:13:49Z)
• Explicitly Disentangled Representations in Object-Centric Learning [0.0]
  We propose a novel architecture that biases object-centric models toward disentangling shape and texture components.<n>In particular, we propose a novel architecture that biases object-centric models toward disentangling shape and texture components.
  arXiv  Detail & Related papers  (2024-01-18T17:22:11Z)
• Self-Supervised Learning from Non-Object Centric Images with a Geometric Transformation Sensitive Architecture [7.825153552141346]
  We propose a Geometric Transformation Sensitive Architecture to be sensitive to geometric transformations. Our method encourages the student to be sensitive by predicting rotation and using targets that vary with those transformations. Our approach demonstrates improved performance when using non-object-centric images as pretraining data.
  arXiv  Detail & Related papers  (2023-04-17T06:32:37Z)
• Zero-shot point cloud segmentation by transferring geometric primitives [68.18710039217336]
  We investigate zero-shot point cloud semantic segmentation, where the network is trained on seen objects and able to segment unseen objects. We propose a novel framework to learn the geometric primitives shared in seen and unseen categories' objects and employ a fine-grained alignment between language and the learned geometric primitives.
  arXiv  Detail & Related papers  (2022-10-18T15:06:54Z)
• TopicFM: Robust and Interpretable Feature Matching with Topic-assisted [8.314830611853168]
  We propose an architecture for image matching which is efficient, robust, and interpretable. We introduce a novel feature matching module called TopicFM which can roughly organize same spatial structure across images into a topic. Our method can only perform matching in co-visibility regions to reduce computations.
  arXiv  Detail & Related papers  (2022-07-01T10:39:14Z)
• On Hyperbolic Embeddings in 2D Object Detection [76.12912000278322]
  We study whether a hyperbolic geometry better matches the underlying structure of the object classification space. We incorporate a hyperbolic classifier in two-stage, keypoint-based, and transformer-based object detection architectures. We observe categorical class hierarchies emerging in the structure of the classification space, resulting in lower classification errors and boosting the overall object detection performance.
  arXiv  Detail & Related papers  (2022-03-15T16:43:40Z)
• Unsupervised Part Discovery from Contrastive Reconstruction [90.88501867321573]
  The goal of self-supervised visual representation learning is to learn strong, transferable image representations. We propose an unsupervised approach to object part discovery and segmentation. Our method yields semantic parts consistent across fine-grained but visually distinct categories.
  arXiv  Detail & Related papers  (2021-11-11T17:59:42Z)
• Exploring Set Similarity for Dense Self-supervised Representation Learning [96.35286140203407]
  We propose to explore textbfset textbfsimilarity (SetSim) for dense self-supervised representation learning. We generalize pixel-wise similarity learning to set-wise one to improve the robustness because sets contain more semantic and structure information. Specifically, by resorting to attentional features of views, we establish corresponding sets, thus filtering out noisy backgrounds that may cause incorrect correspondences.
  arXiv  Detail & Related papers  (2021-07-19T09:38:27Z)
• Graph Sampling Based Deep Metric Learning for Generalizable Person Re-Identification [114.56752624945142]
  We argue that the most popular random sampling method, the well-known PK sampler, is not informative and efficient for deep metric learning. We propose an efficient mini batch sampling method called Graph Sampling (GS) for large-scale metric learning.
  arXiv  Detail & Related papers  (2021-04-04T06:44:15Z)
• Geometrically Mappable Image Features [85.81073893916414]
  Vision-based localization of an agent in a map is an important problem in robotics and computer vision. We propose a method that learns image features targeted for image-retrieval-based localization.
  arXiv  Detail & Related papers  (2020-03-21T15:36:38Z)
• High-Order Information Matters: Learning Relation and Topology for Occluded Person Re-Identification [84.43394420267794]
  We propose a novel framework by learning high-order relation and topology information for discriminative features and robust alignment. Our framework significantly outperforms state-of-the-art by6.5%mAP scores on Occluded-Duke dataset.
  arXiv  Detail & Related papers  (2020-03-18T12:18:35Z)

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.