Abstract: Multi-graph matching is an important problem in computer vision. Our task comes from bioimaging, where a set of 100 3D-microscopic images of worms have to be brought into correspondence.
Abstract: Traditional anchor graph clustering (AGC) methods usually perform suboptimally when dealing with subspace similarity caused by spectral mixing and typically lack physical interpretability ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback