Peer-to-Peer Federated Continual Learning for Naturalistic Driving Action Recognition

Liangqi Yuan, Yunsheng Ma, Lu Su, Ziran Wang
4/14/2023
cs.LGcs.CV

No confident code implementation found for this paper.

Abstract

Naturalistic driving action recognition (NDAR) has proven to be an effective method for detecting driver distraction and reducing the risk of traffic accidents. However, the intrusive design of in-cabin cameras raises concerns about driver privacy. To address this issue, we propose a novel peer-to-peer (P2P) federated learning (FL) framework with continual learning, namely FedPC, which ensures privacy and enhances learning efficiency while reducing communication, computational, and storage overheads. Our framework focuses on addressing the clients' objectives within a serverless FL framework, with the goal of delivering personalized and accurate NDAR models. We demonstrate and evaluate the performance of FedPC on two real-world NDAR datasets, including the State Farm Distracted Driver Detection and Track 3 NDAR dataset in the 2023 AICity Challenge. The results of our experiments highlight the strong competitiveness of FedPC compared to the conventional client-to-server (C2S) FLs in terms of performance, knowledge dissemination rate, and compatibility with new clients.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{yuan2023peertopeer,
  title  = {Peer-to-Peer Federated Continual Learning for Naturalistic Driving Action Recognition},
  author = {Liangqi Yuan and Yunsheng Ma and Lu Su and Ziran Wang},
  year   = {2023},
  eprint = {2304.07421},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.07421v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.07421.svg)](https://codeofpaper.com/paper/2304.07421)

Discussion