Bingjie Gao

dblp:165/8296 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
8since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Human-computer interaction and ubiquitous computing · 3 · 3 since 2021Systems, architecture and hardware · 2Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2026 DuoMorph: Synergistic Integration of FDM Printing and Pneumatic Actuation for Shape-Changing Interfaces
abstract
We introduce DuoMorph, a design and fabrication method that synergistically integrates Fused Deposition Modeling(FDM) printing and pneumatic actuation to create novel shape-changing interfaces. In DuoMorph, the printed structures and heat-sealed pneumatic elements are mutually designed to actuate and constrain each other, enabling functions that are difficult for either component to achieve in isolation. Moreover, the entire hybrid structure can be fabricated through a single, seamless process using only a standard FDM printer—including both heat-sealing and 3D/4D printing. In this paper, we define a design space including four primitive categories that capture the fundamental ways in which printed and pneumatic components can interact. To support this process, we present a fabrication method and an accompanying design tool. Finally, we demonstrate the potential of DuoMorph through example applications and performance demonstrations.
Xueqing Li 0005, Danqi Huang, Tianyu Yu 0001, Shuzi Yin, Bingjie Gao, Anna Matsumoto, Zhihao Yao 0004, Shiqing Lyu, Lining Yao, Haipeng Mi, Qiuyu Lu
CHI5
2026 Bridging Visual Dynamics and Narrative Reasoning: Multimodal Large Language Models for Short Drama Quality Assessment
Qingyang Liu 0008, Jiangtong Li, Zelin Peng, Shaobo Wang 0001, Zhaohe Liao, Shuochen Chang, Bingjie Gao, Mu Liu, Jidong Jiang, Li Niu 0002
WWW7
2025 HopeFix: An AR System for Building Hope Through Toy Repair
Wenjing Deng, Minxuan He, Xintong Wu, Peixi Sheng, Shuzi Yin, Bingjie Gao, Jiachen Du, Haipeng Mi
IDC6
2025 The Devil is in the Prompts: Retrieval-Augmented Prompt Optimization for Text-to-Video Generation
abstract
The evolution of Text-To-video (T2V) generative models, trained on large-scale datasets, has been marked by significant progress. However, the sensitivity of T2V generative models to input prompts highlights the critical role of prompt design in influencing generative outcomes. Prior research has predominantly relied on Large Language Models (LLMs) to align user-provided prompts with the distribution of training prompts, albeit without tailored guidance encompassing prompt vocabulary and sentence structure nuances. To this end, we introduce RAPO, a novel Retrieval-Augmented Prompt Optimization framework. In order to address potential inaccuracies and ambiguous details generated by LLM-generated prompts. RAPO refines the naive prompts through dual optimization branches, selecting the superior prompt for T2V generation. The first branch augments user prompts with diverse modifiers extracted from a learned relational graph, refining them to align with the format of training prompts via a fine-tuned LLM. Conversely, the second branch rewrites the naive prompt using a pre-trained LLM following a well-defined instruction set. Extensive experiments demonstrate that RAPO can effectively enhance both the static and dynamic dimensions of generated videos, demonstrating the significance of prompt optimization for user-provided prompts. Project website: GitHub.
Bingjie Gao, Yu Qiao 0001, Li Niu 0002, Yaohui Wang 0001
CVPR1
2025 Whisk: Inducing Altruistic Behavior to Relieve Child Dental Anxiety
abstract
This study presents Whisk, an interactive robot designed to alleviate Child Dental Anxiety (CDA) and promote health and well-being in line with the United Nations Sustainable Development Goals. Modeled as a hedgehog, Whisk simulates frightened behaviors such as curling up and raising its quills, interacting with children and guiding them to soothe the robot, thereby reducing their own anxiety. The robot's tactile feedback mechanism helps children shift their attention from fears of dental treatment to caring for the vulnerable robot, improving treatment compliance and alleviating anxiety. User experiments indicate that Whisk is effective in reducing CDA, with the robot's weakness eliciting altruistic behaviors from children. Future work will focus on optimizing emotion recognition and feedback mechanisms, as well as exploring its applications in other medical contexts. Whisk offers a novel solution for children's dental treatment, aiming to enhance the treatment experience and promote health and well-being.
Shuzi Yin, Bingjie Gao, Jiahe Lin, Yeonsu Shin, Yijie Guo, Haipeng Mi
HRI2
2025 Object Placement for Anything
abstract
Object placement aims to determine the appropriate placement (e.g., location and size) of a foreground object when placing it on the background image. Most previous works are limited by small-scale labeled dataset, which hinders the real-world application of object placement. In this work, we devise a semi-supervised framework which can exploit large-scale unlabeled dataset to promote the generalization ability of discriminative object placement models. The discriminative models predict the rationality label for each foreground placement given a foreground-background pair. To better leverage the labeled data, under the semi-supervised framework, we further propose to transfer the knowledge of rationality variation, i.e., whether the change of foreground placement would result in the change of rationality label, from labeled data to unlabeled data. Extensive experiments demonstrate that our framework can effectively enhance the generalization ability of discriminative object placement models.
Bingjie Gao, Bo Zhang 0075, Li Niu 0002
ICME1
2024 HIE-EDT: Hierarchical interval estimation-based evidential decision tree
Bingjie Gao, Qianli Zhou, Yong Deng 0001
Pattern Recognit.1
2022 BIM-AFA: Belief information measure-based attribute fusion approach in improving the quality of uncertain data
Bingjie Gao, Qianli Zhou, Yong Deng 0001
Inf. Sci.1
2017 Truthful Auctions for User Data Allowance Trading in Mobile Networks
abstract
User data allowance trading emerges as a promising practice in mobile data networks since it can help mobile networks to attract more users. However, to date, there is no study on user data allowance trading in mobile networks. In this paper, we develop a truthful framework that allows users to bid for data allowance. We focus on preventing price cheating, guaranteeing fairness, and minimizing trading maintenance cost in trading. We formulate the data trading process as a double auction problem and develop algorithms to solve the problem. In particular, we use a uniform price auction based on a competitive equilibrium to defend against price cheating and provide fair-ness. Meanwhile, we leverage linear programming to minimize trading maintenance cost. We conduct extensive simulations to demonstrate the performance of the proposed mechanism. The simulation results show that our trading mechanism is truthful and fair, while incurring a minimized maintenance cost.
Zhongxing Ming, Mingwei Xu 0001, Ning Wang 0001, Bingjie Gao, Qi Li 0002
ICDCS4
2015 TAFTA: A Truthful Auction Framework for User Data Allowance Trading in Mobile Networks
abstract
User data allowance trading is emerging as a promising field in mobile data networks. Mobile operators are establishing data trading platforms to attract more users. To date, there has been no coherent study on user data allowance trading. In this paper, we develop a truthful framework that allows users to bid for data allowance. We focus on preventing price cheating, guaranteeing fairness and minimizing trading maintenance cost. We model the data trading process as a double auction problem. We develop algorithms to solve the problem. The algorithms use a uniform price based on a competitive equilibrium to defend against price cheating and provide fairness, and use linear programming to minimize trading maintenance cost. We conduct extensive simulations to testify the proposed mechanism. Results show that our mechanism is truthful, fair and can minimize the cost of trading.
Zhongxing Ming, Mingwei Xu 0001, Ning Wang 0001, Bingjie Gao, Qi Li 0002
ICDCS4