Efficient Pruning Optimization for Trainable Descriptor-Based Facade Signboard Classification

2026

Closed access Metadata (CSL-JSON)
DOI 10.23919/fruct70069.2026.11506537
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Commercial facade service classification from street-level imagery benefits from multi-branch pipelines that fuse global facade appearance with signboard-centric cues; however, this design increases inference cost and hinders large-scale deployment. We study pruning for a multi-branch facade recognition pipeline with a trainable signboard descriptor and compare unstructured magnitude pruning with structured baselines, including channel pruning and latency-aware structured pruning. We further propose a customized, architecture-aware pruning strategy that allocates sparsity across modules according to their sensitivity and computational profile. Experiments on a curated Google Street View subset and the Signboard Classification Dataset show that unstructured pruning reduces parameters, but yields limited wall-clock speedup, whereas structured pruning provides substantial acceleration. At$\mathbf{5 0 \%}$sparsity, the proposed method reduces latency from 14.3 ms to 7.9 ms and FLOPs from 2.83 G to 1.26 G while preserving macro-averaged F 1 -score close to the baseline ($\mathbf{0. 8 3 6}$vs.$\mathbf{0. 8 4 4}$on GSV;$\mathbf{0. 8 7 8}$vs.$\mathbf{0. 8 8 7}$on SCD). At 60 % sparsity, it further reduces latency to 6.9 ms and FLOPs to 1.04 G with competitive performance$(0.826$on GSV; 0.868 on SCD). Overall, the proposed strategy improves the accuracy-efficiency trade-off of facade service recognition under realistic domain variability.