|
关注:1
2013-05-23 12:21
求翻译:Planning itself is easy: We pick those parts first for which the uncertainty in localization is minimal. Again, we use a greedy optimization algorithm to make the choices: The first part is selected by descriptor uniqueness: We match the descriptor model against the whole training set and choose the part with the lowest 是什么意思?![]() ![]() Planning itself is easy: We pick those parts first for which the uncertainty in localization is minimal. Again, we use a greedy optimization algorithm to make the choices: The first part is selected by descriptor uniqueness: We match the descriptor model against the whole training set and choose the part with the lowest
问题补充: |
湖北省互联网违法和不良信息举报平台 | 网上有害信息举报专区 | 电信诈骗举报专区 | 涉历史虚无主义有害信息举报专区 | 涉企侵权举报专区