Jump to content

Joint compatibility branch and bound

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jiuguang Wang (talk | contribs) at 19:15, 19 February 2009 (Created page with ''''Joint Compatibility Branch and Bound (JCBB)''' is an algorithm in computer vision and robotics, commonly used for data association in [[simultane…'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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 (2001), "Data association in stochastic mapping using the jointcompatibility test" (PDF), Robotics and Automation, IEEE Transactions on, 17 (6): 890–897