Demo Data from EDBT 2026 / reviewers in the wild / expert
Changfeng Gui
dblp:93/6919
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2010
0000-0001-5903-6188ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2Artificial intelligence and machine learning · 1
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
2 papers |
Image and video processing · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video processing › image segmentation
level set evolution |
0.2 | 2 | 2010 | Distance Regularized Level Set Evolution and Its Application to Image Segmentation · IEEE Trans. Image Process. 2010 Level Set Evolution without Re-Initialization: A New Variational Formulation · CVPR (1) 2005 |
Image and video processing › image segmentation
active contour |
0.1 | 1 | 2010 | Distance Regularized Level Set Evolution and Its Application to Image Segmentation · IEEE Trans. Image Process. 2010 |
Image and video processing
image segmentation |
0.1 | 1 | 2010 | Distance Regularized Level Set Evolution and Its Application to Image Segmentation · IEEE Trans. Image Process. 2010 |
Image and video processing › image segmentation › active contour
geometric active contours |
0.1 | 1 | 2005 | Level Set Evolution without Re-Initialization: A New Variational Formulation · CVPR (1) 2005 |
Image and video processing › image segmentation
variational segmentation |
0.1 | 1 | 2005 | Level Set Evolution without Re-Initialization: A New Variational Formulation · CVPR (1) 2005 |
Mathematical optimization › variational analysis
variational principle |
0.0 | 1 | 2010 | Distance Regularized Level Set Evolution and Its Application to Image Segmentation · IEEE Trans. Image Process. 2010 |
Methods — techniques the papers use, named apart from their topics
finite difference scheme · 0.3distance regularized level set evolution · 0.2gradient flow · 0.1energy minimization · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Distance Regularized Level Set Evolution and Its Application to Image SegmentationabstractLevel set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities during its evolution, which may cause numerical errors and eventually destroy the stability of the evolution. Therefore, a numerical remedy, called reinitialization, is typically applied to periodically replace the degraded level set function with a signed distance function. However, the practice of reinitialization not only raises serious problems as when and how it should be performed, but also affects numerical accuracy in an undesirable way. This paper proposes a new variational level set formulation in which the regularity of the level set function is intrinsically maintained during the level set evolution. The level set evolution is derived as the gradient flow that minimizes an energy functional with a distance regularization term and an external energy that drives the motion of the zero level set toward desired locations. The distance regularization term is defined with a potential function such that the derived level set evolution has a unique forward-and-backward (FAB) diffusion effect, which is able to maintain a desired shape of the level set function, particularly a signed distance profile near the zero level set. This yields a new type of level set evolution called distance regularized level set evolution (DRLSE). The distance regularization effect eliminates the need for reinitialization and thereby avoids its induced numerical errors. In contrast to complicated implementations of conventional level set formulations, a simpler and more efficient finite difference scheme can be used to implement the DRLSE formulation. DRLSE also allows the use of more general and efficient initialization of the level set function. In its numerical implementation, relatively large time steps can be used in the finite difference scheme to reduce the number of iterations, while ensuring sufficient numerical accuracy. To demonstrate the effectiveness of the DRLSE formulation, we apply it to an edge-based active contour model for image segmentation, and provide a simple narrowband implementation to greatly reduce computational cost. Chunming Li, Chenyang Xu 0001, Changfeng Gui, Martin D. Fox |
IEEE Trans. Image Process. | 3 |
| 2005 | Level Set Evolution without Re-Initialization: A New Variational FormulationabstractIn this paper, we present a new variational formulation for geometric active contours that forces the level set function to be close to a signed distance function, and therefore completely eliminates the need of the costly re-initialization procedure. Our variational formulation consists of an internal energy term that penalizes the deviation of the level set function from a signed distance function, and an external energy term that drives the motion of the zero level set toward the desired image features, such as object boundaries. The resulting evolution of the level set function is the gradient flow that minimizes the overall energy functional. The proposed variational level set formulation has three main advantages over the traditional level set formulations. First, a significantly larger time step can be used for numerically solving the evolution partial differential equation, and therefore speeds up the curve evolution. Second, the level set function can be initialized with general functions that are more efficient to construct and easier to use in practice than the widely used signed distance function. Third, the level set evolution in our formulation can be easily implemented by simple finite difference scheme and is computationally more efficient. The proposed algorithm has been applied to both simulated and real images with promising results. Chunming Li, Chenyang Xu 0001, Changfeng Gui, Martin D. Fox |
CVPR (1) | 3 |