SMRFC-PDCNN: An Efficient Scene Matching Recognition with DCNN and Feature Clustering on Spark

Scene recognition, an AI technology based on deep learning, has been widely used in public safety, road traffic, and automatic driving, but applying it on massive data in deep convolutional neural networks (DCNNs) results in performance bottlenecks. This paper proposes SMRFC-PDCNN, an efficient scene matching recognition algorithm that addresses three specific problems: decreased accuracy of feature maps, redundant feature calculations, and low efficiency in parallel recognition. The proposed algorithm includes a feature pooling selection strategy called MI-IPSS, a feature selection strategy called DCPSO-FSS, a load balancing strategy called CCG-LBS. MI-IPSS solves the problem of de-creased accuracy of feature maps by adapting the pooling strategy based on mutual information coefficient between feature maps before and after pooling. DCPSO-FSS uses density clustering and particle swarm optimization to locate clustering parameters quickly and recognize clustered features through sampling in the fully connected layer. CCG-LBS dynamically calculates the computing overhead of feature maps and allocates data between groups according to the over-head to solve the problem of low efficiency in parallel recognition. Experimental results show that SMRFC-PDCNN has good performance and is suitable for the fast scene matching recognition process of parallelized DCNNs on large-scale datasets.

Authors

Institutions

Publication Details

Journal
Computing and Informatics
Published
2025-01-01
DOI
https://doi.org/10.31577/cai_2025_2_467
Primary Topic
Advanced Image and Video Retrieval Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

SMRFC-PDCNN: An Efficient Scene Matching Recognition with DCNN and Feature Clustering on Spark

Yimin Mao, Jingguo Dai
Computing and Informatics
Advanced Image and Video Retrieval Techniques
article

SMRFC-PDCNN: An Efficient Scene Matching Recognition with DCNN and Feature Clustering on Spark

Yimin Mao, Jingguo Dai
article en

Abstract

Scene recognition, an AI technology based on deep learning, has been widely used in public safety, road traffic, and automatic driving, but applying it on massive data in deep convolutional neural networks (DCNNs) results in performance bottlenecks. This paper proposes SMRFC-PDCNN, an efficient scene matching recognition algorithm that addresses three specific problems: decreased accuracy of feature maps, redundant feature calculations, and low efficiency in parallel recognition. The proposed algorithm includes a feature pooling selection strategy called MI-IPSS, a feature selection strategy called DCPSO-FSS, a load balancing strategy called CCG-LBS. MI-IPSS solves the problem of de-creased accuracy of feature maps by adapting the pooling strategy based on mutual information coefficient between feature maps before and after pooling. DCPSO-FSS uses density clustering and particle swarm optimization to locate clustering parameters quickly and recognize clustered features through sampling in the fully connected layer. CCG-LBS dynamically calculates the computing overhead of feature maps and allocates data between groups according to the over-head to solve the problem of low efficiency in parallel recognition. Experimental results show that SMRFC-PDCNN has good performance and is suitable for the fast scene matching recognition process of parallelized DCNNs on large-scale datasets.

Computing and InformaticsVol. 44(2)
Guangdong University Of Finances and Economics (CN), Shaoguan University (CN)
Openalex Percentile: Top 88%
Advanced Image and Video Retrieval Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.