Weibang Dai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Weibang Dai has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Xiaogang Chen
Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai, China
6 shared publications - Zhitang Song
State Key Laboratory of Functional Materials for Informatics, Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai, China
6 shared publications - Aximu Yuemaier
School of Physical Science and Technology, ShanghaiTech University, Shanghai 201210, China
5 shared publications - Shunfen Li
State Key Laboratory of Functional Materials for Informatics, Shanghai Institute of Micro-system and Information Technology, Chinese Academy of Sciences, Shanghai 200050, China
5 shared publications - Xingyu Qian
State Key Laboratory of Functional Materials for Informatics, Shanghai Institute of Micro-system and Information Technology, Chinese Academy of Sciences, Shanghai 200050, China
5 shared publications - Wen-Chi Yang
NeuHelium Co., Ltd., Shanghai 200050, China
4 shared publications
Latest Publications
- Open Access
- 3 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (7) , 1-34
Lookup Table-based Computing: A Survey from Software Implementations to Hardware Architectures
For decades, memory-based computation has been overshadowed by processor-centric paradigms. However, memory-based computation offers distinct advantages, including high-speed operation and energy efficiency. As a representative and powerful type of memory-based computation, lookup table (LUT)-based computing has seen a resurgence in interest. Recent advancements in memory technologies, particularly cost reduction in memories and the rise of emerging non-volatile memories (NVMs), have spurred widespread adoption of LUT-based approaches. In this article, we first trace the historical evolution of LUT-based computation, then systematically analyze its modern applications across two domains: (1) software implementations, including LUT-based function evaluation and LUT-based neural networks; and (2) hardware architectures, such as LUT in FPGA and LUT-based processing-in-memory (PIM) systems. Finally, we discuss how NVMs could unlock new opportunities for next-generation LUT-based computing.
- 3 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (7) , 1-34
Open AccessLookup Table-based Computing: A Survey from Software Implementations to Hardware Architectures
For decades, memory-based computation has been overshadowed by processor-centric paradigms. However, memory-based computation offers distinct advantages, including high-speed operation and energy efficiency. As a representative and powerful type of memory-based computation, lookup table (LUT)-based computing has seen a resurgence in interest. Recent advancements in memory technologies, particularly cost reduction in memories and the rise of emerging non-volatile memories (NVMs), have spurred widespread adoption of LUT-based approaches. In this article, we first trace the historical evolution of LUT-based computation, then systematically analyze its modern applications across two domains: (1) software implementations, including LUT-based function evaluation and LUT-based neural networks; and (2) hardware architectures, such as LUT in FPGA and LUT-based processing-in-memory (PIM) systems. Finally, we discuss how NVMs could unlock new opportunities for next-generation LUT-based computing.
- Open Access
- 25 June 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (13) , 7486
Adaptive-Modeling Multi-Agent Learning System for Video Behavioral Clustering Recognition
Multi-agent systems are suitable for handling complex problems due to their high parallelism and autonomous evolution ability. In this paper, we propose an adaptive clustering multi-agent learning system for intelligent applications with continuously changing requirements. Each agent model changes temporal sequences using the longest common subsequence (LCS) algorithm. Multiple agents collaborate in a multilayer decentralized approach to enhance learning adaptability and achieve self-supervised behavioral clustering. The system is constructed using a “memory-like” method and operates primarily on memory access and comparison, avoiding extensive matrix operations of artificial neural networks while achieving learning and prediction functions. We chose an unsupervised vehicle behavioral clustering scenario for feasibility validation in which the system’s cognitive objective is to cluster and recognize vehicle behaviors. In a low computational environment, the system can complete clustering functions and exhibit continuous learning capabilities when new behavioral changes occur. The proposed approach achieves an accuracy of 97.4% while processing at a speed 1–5 times faster than similar clustering algorithms. The verification results indicate that this system has excellent potential to enhance intelligent sensing front ends.
- 25 June 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (13) , 7486
Open AccessAdaptive-Modeling Multi-Agent Learning System for Video Behavioral Clustering Recognition
Multi-agent systems are suitable for handling complex problems due to their high parallelism and autonomous evolution ability. In this paper, we propose an adaptive clustering multi-agent learning system for intelligent applications with continuously changing requirements. Each agent model changes temporal sequences using the longest common subsequence (LCS) algorithm. Multiple agents collaborate in a multilayer decentralized approach to enhance learning adaptability and achieve self-supervised behavioral clustering. The system is constructed using a “memory-like” method and operates primarily on memory access and comparison, avoiding extensive matrix operations of artificial neural networks while achieving learning and prediction functions. We chose an unsupervised vehicle behavioral clustering scenario for feasibility validation in which the system’s cognitive objective is to cluster and recognize vehicle behaviors. In a low computational environment, the system can complete clustering functions and exhibit continuous learning capabilities when new behavioral changes occur. The proposed approach achieves an accuracy of 97.4% while processing at a speed 1–5 times faster than similar clustering algorithms. The verification results indicate that this system has excellent potential to enhance intelligent sensing front ends.
- Open Access
- 19 June 2023
- Published by MDPI AG in Electronics
- Vol. 12 (12) , 2725
A Streaming Data Processing Architecture Based on Lookup Tables
Processing in memory (PIM) is a new computing paradigm that stores the function values of some input modes in a lookup table (LUT) and retrieves their values when similar input modes are encountered (instead of performing online calculations), which is an effective way to save energy. In the era of the Internet of Things, the processing of massive data generated by the front-end requires low-power and real-time processing. This paper investigates an energy-efficient processing architecture based on table lookup in phase-change memory (PCM). This architecture replaces logical-based calculations with LUT lookups to minimize power consumption and operation latency. In order to improve the efficiency of table lookup, the RISC-V instruction set has included extended lookup and data stream transmission instructions. Finally, the system architecture is validated by hardware simulation, and the performance of computing the fast Fourier transform (FFT) application is evaluated. The proposed architecture effectively improves the execution efficiency and reduces the power consumption of data flow operations.
- 19 June 2023
- Published by MDPI AG in Electronics
- Vol. 12 (12) , 2725
Open AccessA Streaming Data Processing Architecture Based on Lookup Tables
Processing in memory (PIM) is a new computing paradigm that stores the function values of some input modes in a lookup table (LUT) and retrieves their values when similar input modes are encountered (instead of performing online calculations), which is an effective way to save energy. In the era of the Internet of Things, the processing of massive data generated by the front-end requires low-power and real-time processing. This paper investigates an energy-efficient processing architecture based on table lookup in phase-change memory (PCM). This architecture replaces logical-based calculations with LUT lookups to minimize power consumption and operation latency. In order to improve the efficiency of table lookup, the RISC-V instruction set has included extended lookup and data stream transmission instructions. Finally, the system architecture is validated by hardware simulation, and the performance of computing the fast Fourier transform (FFT) application is evaluated. The proposed architecture effectively improves the execution efficiency and reduces the power consumption of data flow operations.
- Open Access
A Self-Organizing Multi-Layer Agent Computing System for Behavioral Clustering Recognition
Video behavior recognition often needs to focus on object motion processes. In this work, a self-organizing computational system oriented toward behavioral clustering recognition is proposed, which achieves the extraction of motion change patterns through binary encoding and completes motion pattern summarization using a similarity comparison algorithm. Furthermore, in the face of unknown behavioral video data, a self-organizing structure with layer-by-layer accuracy progression is used to achieve motion law summarization using a multi-layer agent design approach. Finally, the real-time feasibility is verified in the prototype system using real scenes to provide a new feasible solution for unsupervised behavior recognition and space-time scenes.
Open AccessA Self-Organizing Multi-Layer Agent Computing System for Behavioral Clustering Recognition
Video behavior recognition often needs to focus on object motion processes. In this work, a self-organizing computational system oriented toward behavioral clustering recognition is proposed, which achieves the extraction of motion change patterns through binary encoding and completes motion pattern summarization using a similarity comparison algorithm. Furthermore, in the face of unknown behavioral video data, a self-organizing structure with layer-by-layer accuracy progression is used to achieve motion law summarization using a multi-layer agent design approach. Finally, the real-time feasibility is verified in the prototype system using real scenes to provide a new feasible solution for unsupervised behavior recognition and space-time scenes.
- Open Access
- 10 May 2023
- Published by MDPI AG in Preprints.org
A Self-Organizing Multi-Layer Agent Computing System for Behavioral Clustering Recognition
Video behavior recognition often needs to focus on object motion processes. In this work, a self-organizing computational system oriented to behavioral clustering recognition is proposed, which achieves the extraction of motion change patterns by binary encoding and completes motion pattern summarization using a similarity comparison algorithm. And in the face of unknown behavioral video data, a self-organizing structure with layer-by-layer accuracy progression is used to achieve motion law summarization by using a multi-layer agent design approach. Finally, the real-time feasibility is verified in the prototype system using real scenes to provide a new feasible solution for unsupervised behavior recognition and space-time scenes.
- 10 May 2023
- Published by MDPI AG in Preprints.org
Open AccessA Self-Organizing Multi-Layer Agent Computing System for Behavioral Clustering Recognition
Video behavior recognition often needs to focus on object motion processes. In this work, a self-organizing computational system oriented to behavioral clustering recognition is proposed, which achieves the extraction of motion change patterns by binary encoding and completes motion pattern summarization using a similarity comparison algorithm. And in the face of unknown behavioral video data, a self-organizing structure with layer-by-layer accuracy progression is used to achieve motion law summarization by using a multi-layer agent design approach. Finally, the real-time feasibility is verified in the prototype system using real scenes to provide a new feasible solution for unsupervised behavior recognition and space-time scenes.
- Open Access
- 9 May 2023
- Published by MDPI AG in Preprints.org
Adaptive Modeling Multi-Agent Learning System for Video Behavior Clustering Recognition
In this work, we propose a self-supervised multi-agent system that meets the online learning of clustering tasks for video behavior recognition spatio-temporal tasks. Encoding visual behavioral actions as discrete temporal sequence(DTS). Real-time clustering recognition task in a multi-agent system for continuous model building, training, and correction. Finally, we implemented a fully decentralized multi-agent system and completed its feasibility verification in a surveillance video application scenario on vehicle path clustering.
- 9 May 2023
- Published by MDPI AG in Preprints.org
Open AccessAdaptive Modeling Multi-Agent Learning System for Video Behavior Clustering Recognition
In this work, we propose a self-supervised multi-agent system that meets the online learning of clustering tasks for video behavior recognition spatio-temporal tasks. Encoding visual behavioral actions as discrete temporal sequence(DTS). Real-time clustering recognition task in a multi-agent system for continuous model building, training, and correction. Finally, we implemented a fully decentralized multi-agent system and completed its feasibility verification in a surveillance video application scenario on vehicle path clustering.