paper-with-me

Papers

MSPCaps: A Multi-Scale Patchify Capsule Network with Cross-Agreement Routing for Visual Recognition

2025-08-23 · Yudong Hu, Yueju Han, Rui Sun, Jinke Ren arxiv

Capsule Network (CapsNet) has demonstrated significant potential in visual recognition by capturing spatial relationships and part-whole hierarchies for learning equivariant feature representations. However, existing CapsNet and variants often rely on a single high-level feature map, overlooking the rich complementary information from multi-scale features. Furthermore, conventional feature fusion strategies (e.g., addition and concatenation) struggle to reconcile multi-scale feature discrepancies, leading to suboptimal classification performance. To address these limitations, we propose the Multi-Scale Patchify Capsule Network (MSPCaps), a novel architecture that integrates multi-scale feature learning and efficient capsule routing. Specifically, MSPCaps consists of three key components: a Multi-Scale ResNet Backbone (MSRB), a Patchify Capsule Layer (PatchifyCaps), and Cross-Agreement Routing (CAR) blocks. First, the MSRB extracts diverse multi-scale feature representations from input images, preserving both fine-grained details and global contextual information. Second, the PatchifyCaps partitions these multi-scale features into primary capsules using a uniform patch size, equipping the model with the ability to learn from diverse receptive fields. Finally, the CAR block adaptively routes the multi-scale capsules by identifying cross-scale prediction pairs with maximum agreement. Unlike the simple concatenation of multiple self-routing blocks, CAR ensures that only the most coherent capsules contribute to the final voting. Our proposed MSPCaps achieves remarkable scalability and superior robustness, consistently surpassing multiple baseline methods in terms of classification accuracy, with configurations ranging from a highly efficient Tiny model (344.3K parameters) to a powerful Large model (10.9M parameters), highlighting its potential in advancing feature representation learning.

📄 PDF Abstract BibTeX arXiv:2508.16922

Code (0)

등록된 구현이 없습니다.

Tasks

Representation Learning

Similar Papers 제목 키워드 기반

Patch-wise Retrieval: A Bag of Practical Techniques for Instance-level Matching

2025-12-14 · Wonseok Choi, Sohwi Lim, Nam Hyeon-Woo, Moon Ye-Bin 외 arxiv

Instance-level image retrieval aims to find images containing the same object as a given query, despite variations in size, position, or appearance. To address this challenging task, we propose Patchify, a simple yet eff…

Image Retrieval

Routing with Self-Attention for Multimodal Capsule Networks

2021-12-01 · Kevin Duarte, Brian Chen, Nina Shvetsova, Andrew Rouditchenko 외

The task of multimodal learning has seen a growing interest recently as it allows for training neural architectures based on different modalities such as vision, text, and audio. One challenge in training such models is …

Pyramidal Transformer with Conv-Patchify for Person Re-identification

2022-10-10 · Proceedings of the 30th ACM International Conference on Multimedia 2022 10 · He Li, Mang Ye, Cong Wang, Bo Do

The robust and discriminative feature extraction is the key component in person re-identification (Re-ID). The major weakness ofconventional convolution neural network (CNN) based methods is that they cannot extract long…

Person Re-IdentificationRe-RankingTranslation

Masked Capsule Autoencoders

2024-03-07 · Miles Everett, Mingjun Zhong, Georgios Leontidis

We propose Masked Capsule Autoencoders (MCAE), the first Capsule Network that utilises pretraining in a modern self-supervised paradigm, specifically the masked image modelling framework. Capsule Networks have emerged as…

Decoder

Attention routing between capsules

2019-07-03 · Jaewoong Choi, Hyun Seo, Suii Im, Myungjoo Kang

In this paper, we propose a new capsule network architecture called Attention Routing CapsuleNet (AR CapsNet). We replace the dynamic routing and squash activation function of the capsule network with dynamic routing (Ca…

Decoder