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

Nadezhda Zlateva

dblp:51/5678 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

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

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 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
1 paper
Image and video processing · 100%
Artificial intelligence
1 paper
Face, body and person analysis · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing
image segmentation
0.112012
Graph cuts optimization for multi-limb human segmentation in depth maps · CVPR 2012
Image and video processing › image segmentation › semantic segmentation
multi-label segmentation
0.112012
Graph cuts optimization for multi-limb human segmentation in depth maps · CVPR 2012
Computer vision › Face, body and person analysis
human pose analysis
0.012012
Graph cuts optimization for multi-limb human segmentation in depth maps · CVPR 2012

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

random forest · 0.3graph cuts · 0.3alpha-beta swap · 0.3
YearPublicationVenuePosition
2012 Graph cuts optimization for multi-limb human segmentation in depth maps
abstract
We present a generic framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs in depth maps. First, from a set of random depth features, Random Forest is used to infer a set of label probabilities for each data sample. This vector of probabilities is used as unary term in α-β swap Graph-cuts algorithm. Moreover, depth of spatio-temporal neighboring data points are used as boundary potentials. Results on a new multi-label human depth data set show high performance in terms of segmentation overlapping of the novel methodology compared to classical approaches.
Antonio Hernández-Vela, Nadezhda Zlateva, Alexander Marinov, Miguel Reyes, Petia Radeva, Dimo Dimov 0001, Sergio Escalera
CVPR2