显著性检测详解讲述.ppt

* 1.Maniford Ranking The graph-based ranking problem is described as follows: given a node as a query, the remaining nodes are ranked based on their relevances to the given query. X : a dataset ,{x1, ...,xl,xl+1,...,xn}∈ Rm×n f : a ranking value fi to each point xi. Y: indication vector Yi=1 if xi is a query, and Yi =0 otherwise. graph G=(V,E ): the nodes V are the dataset X and the edges E are weighted by an af?nity matrix W . D: a degree matrix ,diag{d11,...,dnn}, where dii=∑jwij . * α =1/(1+ μ), S is the normalized Laplacian matrix,S=D?1/2WD?1/2. We measure the sal