Jump to content

Joint compatibility branch and bound

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by JCW-CleanerBot (talk | contribs) at 04:04, 10 May 2019 (→top: task, replaced: | journal = Robotics and Automation, IEEE Transactions on → | journal = IEEE Transactions on Robotics and Automation). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Joint compatibility branch and bound (JCBB) is an algorithm in computer vision and robotics commonly used for data association in simultaneous localization and mapping. JCBB measures the joint compatibility of a set of pairings that successfully rejects spurious matchings and is hence known to robust in complex environments.[1]

References

  1. ^ Neira, J. Tardos; Tardos, J.D. (2001), "Data association in stochastic mapping using the joint compatibility test" (PDF), IEEE Transactions on Robotics and Automation, 17 (6): 890–897, doi:10.1109/70.976019
Retrieved from "https://en.wikipedia.org/w/index.php?title=Joint_compatibility_branch_and_bound&oldid=896385995"