Abstract: We present CLIPPER+, an algorithm for finding maximal cliques in unweighted graphs for outlier-robust global registration. The registration problem can be formulated as a graph and solved by ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback