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

Lizhu Ye

dblp:254/2716 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 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
1 paper
Segmentation and scene understanding · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Segmentation and scene understanding › image segmentation
graph-based segmentation
0.612022
Explored Normalized Cut With Random Walk Refining Term for Image Segmentation · IEEE Trans. Image Process. 2022
Computer vision › Segmentation and scene understanding
image segmentation
0.612022
Explored Normalized Cut With Random Walk Refining Term for Image Segmentation · IEEE Trans. Image Process. 2022
Computer vision › Segmentation and scene understanding › image segmentation › graph-based segmentation
normalized cuts
0.612022
Explored Normalized Cut With Random Walk Refining Term for Image Segmentation · IEEE Trans. Image Process. 2022

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

random walk · 0.6move-making optimization · 0.6
YearPublicationVenuePosition
2022 Explored Normalized Cut With Random Walk Refining Term for Image Segmentation
abstract
The Normalized Cut (NCut) model is a popular graph-based model for image segmentation. But it suffers from the excessive normalization problem and weakens the small object and twig segmentation. In this paper, we propose an Explored Normalized Cut (ENCut) model that establishes a balance graph model by adopting a meaningful-loop and a k-step random walk, which reduces the energy of small salient region, so as to enhance the small object segmentation. To improve the twig segmentation, our ENCut model is further enhanced by a new Random Walk Refining Term (RWRT) that adds local attention to our model with the help of an un-supervising random walk. Finally, a move-making based strategy is developed to efficiently solve the ENCut model with RWRT. Experiments on three standard datasets indicate that our model can achieve state-of-the-art results among the NCut-based segmentation models.
Lei Zhu 0012, Xuejing Kang, Lizhu Ye, Anlong Ming
IEEE Trans. Image Process.3
2021 HDNet: Hybrid Distance Network for semantic segmentation
Chunpeng Li, Xuejing Kang, Lei Zhu 0012, Lizhu Ye, Panhe Feng, Anlong Ming
Neurocomputing4
2019 Adaptive Occlusion Boundary Extraction for Depth Inference
abstract
In this paper, we propose an adaptive occlusion boundary extraction method for depth inference based on an adaptive segmentation and classification. First, an Adaptive DRW is proposed to generate more precise seeds and adaptive segmentation results, which can improve the feature quality and lower the boundary imbalance degree. Then, to deal with the imbalanced classification, we design a cost-sensitive boosting method-Adaptive AdaCost to better classify the imbalanced boundary, which can further improve overall performance and lower the cumulative misclassification cost and cost upper bound. Benefited from our Adaptive DRW and AdaCost, we extract more reliable and precise occlusion boundaries and use them for depth inference. The experiment results demonstrate that the combination of our Adaptive DRW and Adaptive AdaCost can produce more precise occlusion boundaries, and the depth inference result with our occlusion boundaries can be greatly improved.
Lizhu Ye, Lei Zhu 0012, Xuejing Kang, Anlong Ming
ICIP1