arrow
Return

Infinite-dimensional feature aggregation via a factorized bilinear model

delete2022-04-01
delete1
PRE
AI
武玉伟 cover
武玉伟 (Yuwei Wu) *
Z
Zhi Gao
贾云得 (Yunde Jia)
DOI:10.1016/j.patcog.2021.108397delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Aggregating infinite-dimensional features has demonstrated superiority compared with their finite dimensional counterparts. However, most existing methods approximate infinite-dimensional features with finite-dimensional representations, which inevitably results in approximation error and inferior performance. In this paper, we propose a non-approximate aggregation method that directly aggregates infinite-dimensional features rather than relying on approximation strategies. Specifically, since infinite dimensional features are infeasible to store, represent and compute explicitly, we introduce a factorized bilinear model to capture pairwise second-order statistics of infinite-dimensional features as a global descriptor. It enables the resulting aggregation formulation to only involve the inner product in an infinite-dimensional space. The factorized bilinear model is calculated by a Sigmoid kernel to generate informative features containing infinite order statistics. Experiments on four visual tasks including the fine-grained, indoor scene, texture, and material classification, demonstrate that our method consistently achieves the state-of-the-art performance. (c) 2021 Elsevier Ltd. All rights reserved.
Keywords:
Feature aggregation
Infinite-dimensional features
Non-approximate method
Second-order statistics

Journal

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

No organization information available