深度之眼 CV paper年度會員
整體流程
Algorithm 1: Hierarchical Grouping algorithm
? Input: (color)image
? Output: Set of object location hypotheses ? Obtain initial tegions R = {r1,...,rn} using[1]
? Initialise similarity set S = 0
? foreach Neighbouring region pair(ri, rj) do
? ? Calculate similarity s(ri,rj)
? ? S = S∪s(ri,rj)
? while S != ? do
? ? Get highest similarity s(ri,rj) = max(S)
? ? Merge corresponding regions rt = ri ∪ rj ? ? Remove similarities regarding ri:S = S\s(ri,r*)
? ? Remove similarities regarding rj:S = S\s(r*,rj)
? ? Calculate similarity set St between rt and its neighbours
標(biāo)簽：
