Demo Data from EDBT 2026 / reviewers in the wild / expert
Kanglin Xu
dblp:65/1927
· DBLP profile ↗
3ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0005-7877-8124ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-authorComputer networks · 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.
| Computer networks
1 paper |
Internet of things and sensor networks · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Embedded and real-time systems · 100% | |
| Artificial intelligence
1 paper |
Segmentation and scene understanding · 50% 3D vision · 50% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Embedded and real-time systems
energy-efficient embedded systems |
0.9 | 1 | 2025 | LEGO+: Redefining the Redundancy Removal for IoT Sensing Edge-End Systems · MobiSys 2025 |
Computer vision › Segmentation and scene understanding › image segmentation › boundary-aware segmentation
contour-based segmentation |
0.0 | 1 | 2003 | Segmentation of Multiple Salient Closed Contours from Real Images · IEEE Trans. Pattern Anal. Mach. Intell. 2003 |
Computer vision › 3D vision › low-level vision
salient contour extraction |
0.0 | 1 | 2003 | Segmentation of Multiple Salient Closed Contours from Real Images · IEEE Trans. Pattern Anal. Mach. Intell. 2003 |
Methods — techniques the papers use, named apart from their topics
task state prediction · 1.7hardware-level logic orchestration · 1.7markov process · 0.0gestalt principles · 0.0eigenvector analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | LEGO+: Redefining the Redundancy Removal for IoT Sensing Edge-End SystemsabstractThe Internet of Things (IoT) can only thrive if IoT sensor nodes can be effortlessly deployed and maintained without compromising their general-purpose nature. However, existing low-power sensor systems fail to strike a balance between these two issues, leaving the widespread of IoT sensor nodes as an open problem. In this paper, we propose LEGO+ as a minimalist yet general-purpose sensing edge-end architecture. Instead of running embedded software on a redundant general-purpose microprocessor, LEGO+ can directly construct the desired control functionality for various IoT sensing applications through hardware-level logic orchestration. To achieve this, we first conduct an in-depth analysis of the underlying unit behaviors within IoT sensor systems and, based on this, abstract a uniform logic orchestration model. Next, to enable sensor nodes to comprehend and execute the generated logic, we devise a hierarchical atomic control circuit with negligible overheads. Finally, we develop a task state prediction scheme to further improve the overall operation efficiency among multiple nodes. We prototype LEGO+ for proof-of-concept and conduct comprehensive experiments, and the results demonstrate that LEGO+ can reduce the overall power consumption of sensor nodes by 86% and enhance task efficiency by 49%, thereby facilitating a wider array of IoT sensing applications. Chong Zhang 0017, Han Wang 0032, Qianhe Meng, Yize Zhao, Yihang Song, Kanglin Xu, Jinzhe Li, Li Lu 0001 |
MobiSys | 6 |
| 2007 | The model for optimal design of robot vision systems based on kinematic error correction
Kanglin Xu, George F. Luger |
Image Vis. Comput. | 1 |
| 2003 | Segmentation of Multiple Salient Closed Contours from Real ImagesabstractUsing a saliency measure based on the global property of contour closure, we have developed a segmentation method which identifies smooth closed contours bounding objects of unknown shape in real images. The saliency measure incorporates the Gestalt principles of proximity and good continuity that previous methods have also exploited. Unlike previous methods, we incorporate contour closure by finding the eigenvector with the largest positive real eigenvalue of a transition matrix for a Markov process where edges from the image serve as states. Element (i, j) of the transition matrix is the conditional probability that a contour which contains edge j will also contain edge i. We show how the saliency measure, defined for individual edges, can be used to derive a saliency relation, defined for pairs of edges, and further show that strongly-connected components of the graph representing the saliency relation correspond to smooth closed contours in the image. Finally, we report for the first time, results on large real images for which segmentation takes an average of about 10 seconds per object on a general-purpose workstation. Shyjan Mahamud, Lance R. Williams, Karvel K. Thornber, Kanglin Xu |
IEEE Trans. Pattern Anal. Mach. Intell. | 4 |