location: Current position: jjcao >> Scientific Research >> Paper Publications

Mesh saliency detection via double absorbing Markov chain in feature space

Hits:

Indexed by:期刊论文

Date of Publication:2016-09-01

Journal:VISUAL COMPUTER

Included Journals:SCIE、EI、Scopus

Volume:32

Issue:9

Page Number:1121-1132

ISSN No.:0178-2789

Key Words:Mesh saliency; Absorbing Markov chain; Feature space; Foreground cues

Abstract:We propose a mesh saliency detection approach using absorbing Markov chain. Unlike most of the existing methods based on some center-surround operator, our method employs feature variance to obtain insignificant regions and considers both background and foreground cues. Firstly, we partition an input mesh into a set of segments using Ncuts algorithm and then each segment is over segmented into patches based on Zernike coefficients. Afterwards, some background patches are selected by computing feature variance within the segments. Secondly, the absorbed time of each node is calculated via absorbing Markov chain with the background patches as absorbing nodes, which gives a preliminary saliency measure. Thirdly, a refined saliency result is generated in a similar way but with foreground nodes extracted from the preliminary saliency map as absorbing nodes, which inhibits the background and efficiently enhances salient foreground regions. Finally, a Laplacian-based smoothing procedure is utilized to spread the patch saliency to each vertex. Experimental results demonstrate that our scheme performs competitively against the state-of-the-art approaches.

Pre One:Learning to Diffuse: A New Perspective to Design PDEs for Visual Analysis

Next One:Harmonic mean normalized Laplace-Beltrami spectral descriptor