Absorbing Markov chain

Known as: Fundamental matrix, Fundamental matrix (absorbing Markov chain) 
In the mathematical theory of probability, an absorbing Markov chain is a Markov chain in which every state can reach an absorbing state. An… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In this paper, we propose a bottom–up saliency model based on absorbing Markov chain (AMC). First, a sparsely connected graph is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2018
2018
Breast cancer is the most common type of cancer in women and ranks first in the world. Every year, more than one million new… (More)
Is this relevant?
2018
2018
Traditional saliency detection via Markov chain only consider boundaries nodes. However, in addition to boundaries cues… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2017
2017
We propose a simple but effective approach to detect salient objects by exploring both patch-level and object-level cues under… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2016
2016
Roadside Units (RSUs) are a device that can transmit and receive information between vehicles, an essential component for the… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2015
2015
Saliency region detection plays an important role in image pre-processing, and uniformly emphasizing saliency region is still an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
Markov Chains are a fundamental tool for the analysis of real world phenomena and randomized algorithms. Given a graph with some… (More)
  • figure 2
  • figure 1
Is this relevant?
Highly Cited
2013
Highly Cited
2013
In this paper, we formulate saliency detection via absorbing Markov chain on an image graph model. We jointly consider the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We introduce a novel ranking algorithm called GRASSHOPPER, which ranks items with an emphasis on diversity. That is, the top… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
1994
1994
We present a sample path based approach for analyzing the time-reversed discrete-time finite-state absorbing Markov chain. 
Is this relevant?