Name
Title | ||
|---|---|---|
Practical globally optimal consensus maximization by Branch-and-bound based on interval arithmetic |
Abstract | ||
|---|---|---|
•We achieve globally optimal consensus maximization by Branch-and-Bound framework and draw the idea of interval arithmetic-based bound calculation back on the map.•We provide the detailed derivation of interval arithmetic-based bound calculation for consensus maximization problems with both linear and quasi-convex residuals.•Extensive experiments show that the proposed method can better deal with larger number of data points and higher outlier ratios than existing global methods. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.patcog.2021.107897 | Pattern Recognition |
Keywords | DocType | Volume |
Consensus maximization,Globally optimization,Robust model fitting,Branch-and-bound,Interval arithmetic | Journal | 115 |
Issue | ISSN | Citations |
1 | 0031-3203 | 1 |
PageRank | References | Authors |
0.35 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yiru Wang | 1 | 2 | 2.06 |
| Yinlong Liu | 2 | 5 | 3.44 |
| Xuechen Li | 3 | 2 | 2.39 |
| Chen Wang | 4 | 361 | 93.70 |
| Manning Wang | 5 | 2 | 2.39 |
| Zhijian Song | 6 | 31 | 12.34 |