Demo Data from EDBT 2026 / reviewers in the wild / expert
Shi Yan 0003
dblp:81/7761-3
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0003-0681-0656ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
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 graphics and multimedia
1 paper |
Image and video processing · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video processing › image segmentation
active contour |
0.4 | 1 | 2020 | Convexity Shape Prior for Level Set-Based Image Segmentation Method · IEEE Trans. Image Process. 2020 |
Image and video processing
image segmentation |
0.4 | 1 | 2020 | Convexity Shape Prior for Level Set-Based Image Segmentation Method · IEEE Trans. Image Process. 2020 |
Image and video processing › image segmentation › variational segmentation
level set segmentation |
0.4 | 1 | 2020 | Convexity Shape Prior for Level Set-Based Image Segmentation Method · IEEE Trans. Image Process. 2020 |
Methods — techniques the papers use, named apart from their topics
signed distance function · 0.4level set method · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Convexity Shape Prior for Level Set-Based Image Segmentation MethodabstractIn this paper, we propose an image segmentation model that incorporates convexity shape priori using level set representations. In the past decade, several discrete and continuous methods have been developed to solve this problem. Our method comes from the observation that the signed distance function of a convex region must be a convex function. Based on this observation, we transfer the complicated geometrical convexity shape priori into some simple constraints on the signed distance function. We propose a simple algorithm to keep these constraints exactly. The proposed method could be easily applied to level set based segmentation models, such as the well-known Chan-Vese mode and the active contour models. By setting some good initial curves, the proposed method can easily segment convex objects from images with complicated background. We demonstrate the performance of the proposed methods on both synthetic images and real images, as well as the comparison to some state-of-the-art methods. Shi Yan 0003, Xue-Cheng Tai, Jun Liu 0029, Haiyang Huang 0001 |
IEEE Trans. Image Process. | 1 |