Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lingjie Kong

dblp:78/8668 · DBLP profile ↗
← Back
9ranked-venue papers
2as first author
9since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Databases, data management, data science and information retrieval · 3 · 3 since 2021Software engineering, systems software and programming languages · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Generative modeling · 95% Knowledge representation and reasoning · 5%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Computer graphics and multimedia
1 paper
Visual content generation and editing · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
0.912025
CustAny: Customizing Anything from A Single Example · CVPR 2025
Machine learning › Generative modeling
image generation
0.912025
CustAny: Customizing Anything from A Single Example · CVPR 2025
Machine learning › Generative modeling › diffusion model
personalized image generation
0.912025
CustAny: Customizing Anything from A Single Example · CVPR 2025
Machine learning › Generative modeling › diffusion model
text-to-image generation
0.912025
CustAny: Customizing Anything from A Single Example · CVPR 2025
Bioinformatics and computational biology › survival analysis
survival prediction
0.712023
Causally-Aware Intraoperative Imputation for Overall Survival Time Prediction · CVPR 2023
Visual content generation and editing
image editing
0.312025
CustAny: Customizing Anything from A Single Example · CVPR 2025
Visual content generation and editing › image editing
text-guided image editing
0.312025
CustAny: Customizing Anything from A Single Example · CVPR 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning
causal reasoning
0.212023
Causally-Aware Intraoperative Imputation for Overall Survival Time Prediction · CVPR 2023

Methods — techniques the papers use, named apart from their topics

zero-shot customization · 1.7fine-tuning · 1.7diffusion model · 1.7causal graph · 1.3causal discovery · 1.3
YearPublicationVenuePosition
2026 M2Emo: Fine-grained mamba transformer guided multi-task golden snub-nosed monkey emotion recognition
Xianlin Peng, Fangqing Fan, Lingjie Kong, Qiyao Hu, Gu Fang 0002
Inf. Sci.3
2026 EmoSkeMPR: ViT-based masked position reconstruction and skeleton feature fusion for multi-task emotion and behavior recognition
Xianlin Peng, Lingjie Kong, Qiyao Hu, Jinye Peng 0001, Gu Fang 0002
Inf. Sci.2
2025 CustAny: Customizing Anything from A Single Example
abstract
Recent advances in diffusion-based text-to-image models have simplified creating high-fidelity images, but preserving the identity (ID) of specific elements, like a personal dog, is still challenging. Object customization, using reference images and textual descriptions, is key to addressing this issue. Current object customization methods are either object-specific, requiring extensive fine-tuning, or object-agnostic, offering zero-shot customization but limited to specialized domains. The primary issue of promoting zero-shot object customization from specific domains to the general domain is to establish a large-scale general ID dataset for model pre-training, which is time-consuming and labor-intensive. In this paper, we propose a novel pipeline to construct a large dataset of general objects and build the Multi-Category ID-Consistent (MC-IDC) dataset, featuring 315k text-image samples across 10k categories. With the help of MC-IDC, we introduce Customizing Anything (CustAny), a zero-shot framework that maintains ID fidelity and supports flexible text editing for general objects. CustAny features three key components: a general ID extraction module, a dual-level ID injection module, and an ID-aware decoupling module, allowing it to customize any object from a single reference image and text prompt. Experiments demonstrate that CustAny outperforms existing methods in both general object customization and specialized domains like human customization and virtual try-on. Our contributions include a large-scale dataset, the CustAny framework and novel ID processing to advance this field. The official project page is in https://lingjiekong-fdu.github.io.
Lingjie Kong, Chengming Xu 0001, Xiaobin Hu, Wenhui Han, Jinlong Peng, Donghao Luo 0001, Mengtian Li 0002, Jiangning Zhang, Chengjie Wang 0001, Yanwei Fu 0001
CVPR1
2025 A search-and-fill strategy to code generation for complex software requirements
Yukun Dong, Lingjie Kong, Xiaoshan Liu, Mingcheng Chen
Inf. Softw. Technol.2
2024 Multi-Object Tracking with Partial-Level Features and Adaptive Threshold Mechanism
abstract
Multi-object tracking (MOT) is a technique that aims to detect multiple objects in a single frame and maintain their identities in a given video sequence. Currently, the tracking-by-detection paradigm stands out as the most effective approach for MOT, encompassing object detection, person re-identification (Re-ID), and data association. In this paper, we propose enhancements to the Re-ID and data association modules, emphasizing the pivotal role of appearance information in achieving robust tracking quality. To capture more discriminative features, we introduce a network based on partial-level features. We also employ reparameterization to remove residual connection blocks from the backbone network without altering the original output to enhance tracking accuracy while optimizing computational efficiency. Moreover, the utilization of bounding boxes significantly influences tracking performance. We introduce an adaptive threshold mechanism and incorporate gating functions for data association, ensuring efficient use of each bounding box while minimizing trajectory fragmentation and missed detections. Experimental results illustrate that our proposed method attains high detection and tracking accuracy, particularly excelling in challenging video sequences. Our approach demonstrates comparable performance to state-of-the-art trackers on various benchmarks, including MOT17 and MOT20, where MOT20 presents frequent and severe interactions and occlusions.
Lingjie Kong, Xiaopeng Hu 0001, Fan Wang 0017
IJCNN1
2024 A Genetic Algorithm with Lower Neighborhood Search for the Three-Dimensional Multiorder Open-Size Rectangular Packing Problem
abstract
This paper addresses the multiorder open-dimension three-dimensional rectangular packing problem (3D-MOSB-ODRPP), which involves packing rectangular items from multiple orders into a single, size-adjustable container. We propose a novel metaheuristic approach combining a genetic algorithm with the Gurobi solver. The algorithm incorporates a lower neighborhood search strategy and is underpinned by a mathematical model representing the multiorder open-dimension packing scenario. Extensive experiments validate the effectiveness of the proposed approach. The LNSGA algorithm outperforms Gurobi and the traditional genetic algorithm in solution quality and computational efficiency. For small-scale instances, LNSGA achieves optimal values in most cases. LNSGA demonstrates significant optimization improvements over Gurobi and the genetic algorithm for large-scale instances. The superior performance is attributed to the effective integration of the lower neighborhood search mechanism and the Gurobi solver. This study offers valuable insights for optimizing the packing process in e-commerce warehousing and logistics operations.
Jianglong Yang, Huwei Liu, Kaibo Liang, Man Shan, Lingjie Kong, Li Zhou 0011
Int. J. Intell. Syst.5
2024 A method to identify overfitting program repair patches based on expression tree
Yukun Dong, Xiaotong Cheng, Lingjie Kong
Sci. Comput. Program.6
2023 Causally-Aware Intraoperative Imputation for Overall Survival Time Prediction
abstract
Previous efforts in vision community are mostly made on learning good representations from visual patterns. Beyond this, this paper emphasizes the high-level ability of causal reasoning. We thus present a case study of solving the challenging task of Overall Survival (OS) time in primary liver cancers. Critically, the prediction of OS time at the early stage remains challenging, due to the unobvious image patterns of reflecting the OS. To this end, we propose a causal inference system by leveraging the intraoperative attributes and the correlation among them, as an intermediate supervision to bridge the gap between the images and the final OS. Particularly, we build a causal graph, and train the images to estimate the intraoperative attributes for final as prediction. We present a novel Causally-aware Intraoperative Imputation Model (CAWIM) that can sequentially predict each attribute using its parent nodes in the estimated causal graph. To determine the causal directions, we propose a splitting-voting mechanism, which votes for the direction for each pair of adjacent nodes among multiple predictions obtained via causal discovery from heterogeneity. The practicability and effectiveness of our method are demonstrated by the promising results on liver cancer dataset of 361 patients with long-term observations.
Xuelin Qian, Litian Liang, Lingjie Kong, Qiaole Dong, Jiejun Chen, Dingxia Liu, Xiuzhong Yao, Yanwei Fu 0001
CVPR4
2021 Enhanced collection of scattered photons in nonlinear fluorescence microscopy by extended epi-detection with a silicon photomultiplier array
abstract
To maximize signal collection in nonlinear optical microscopy, non-descanned epi-detection is generally adopted for in vivo imaging. However, because of severe scattering in biological samples, most of the emitted fluorescence photons go beyond the collection angles of objectives and thus cannot be detected. Here, we propose an extended detection scheme to enhance the collection of scattered photons in nonlinear fluorescence microscopy using a silicon photomultiplier array ahead of the front apertures of objectives. We perform numerical simulations to demonstrate the enhanced fluorescence collection via extended epi-detection in the multi-photon fluorescence imaging of human skin and mouse brain through craniotomy windows and intact skulls. For example, with red fluorescence emission at a depth of 600 µm in human skin, the increased collection can be as much as about 150% with a 10×, 0.6-NA objective. We show that extended epi-detection is a generally applicable, feasible technique for use in nonlinear fluorescence microscopy to enhance signal detection.
Ruheng Shi, Cheng Jin 0007, Lingjie Kong
Frontiers Inf. Technol. Electron. Eng.4