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

Jianwu Ai

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

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

Graphics, 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.

Artificial intelligence
1 paper
Segmentation and scene understanding · 33% Image recognition and object detection · 33% Probabilistic and Bayesian machine learning · 33%

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

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection › saliency prediction
bottom-up saliency
0.312018
Saliency Detection via Absorbing Markov Chain With Learnt Transition Probability · IEEE Trans. Image Process. 2018
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
markov chain
0.312018
Saliency Detection via Absorbing Markov Chain With Learnt Transition Probability · IEEE Trans. Image Process. 2018
Computer vision › Segmentation and scene understanding
saliency detection
0.312018
Saliency Detection via Absorbing Markov Chain With Learnt Transition Probability · IEEE Trans. Image Process. 2018

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

transition probability learning · 0.3deep features · 0.3angular embedding · 0.3
YearPublicationVenuePosition
2018 Saliency Detection via Absorbing Markov Chain With Learnt Transition Probability
abstract
In this paper, we propose a bottom-up saliency model based on absorbing Markov chain (AMC). First, a sparsely connected graph is constructed to capture the local context information of each node. All image boundary nodes and other nodes are, respectively, treated as the absorbing nodes and transient nodes in the absorbing Markov chain. Then, the expected number of times from each transient node to all other transient nodes can be used to represent the saliency value of this node. The absorbed time depends on the weights on the path and their spatial coordinates, which are completely encoded in the transition probability matrix. Considering the importance of this matrix, we adopt different hierarchies of deep features extracted from fully convolutional networks and learn a transition probability matrix, which is called learnt transition probability matrix. Although the performance is significantly promoted, salient objects are not uniformly highlighted very well. To solve this problem, an angular embedding technique is investigated to refine the saliency results. Based on pairwise local orderings, which are produced by the saliency maps of AMC and boundary maps, we rearrange the global orderings (saliency value) of all nodes. Extensive experiments demonstrate that the proposed algorithm outperforms the state-of-the-art methods on six publicly available benchmark data sets.
Lihe Zhang, Jianwu Ai, Huchuan Lu, Xiukui Li
IEEE Trans. Image Process.2