A Branch-and-Bound Approach to Correspondence and Grouping Problems
- DOI
- 10.1109/tpami.2012.264
- Published
- 2013-07
- Container
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Open access
- unknown
Credibility signals
uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- supportingDOI registered: A matching record was returned by Crossref.
- supportingDOI resolves: A matching record was returned by Crossref.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- supportingMetadata completeness: All 6 scored descriptive metadata groups are present.
Cite this work
BibTeX
@article{allodium:10.1109/tpami.2012.264,
title = {A Branch-and-Bound Approach to Correspondence and Grouping Problems},
author = {J. Bazin and Hongdong Li and In So Kweon and C. Demonceaux and P. Vasseur and K. Ikeuchi},
year = {2013},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
doi = {10.1109/tpami.2012.264},
url = {https://doi.org/10.1109/tpami.2012.264}
}RIS
TY - JOUR TI - A Branch-and-Bound Approach to Correspondence and Grouping Problems AU - J. Bazin AU - Hongdong Li AU - In So Kweon AU - C. Demonceaux AU - P. Vasseur AU - K. Ikeuchi PY - 2013 JO - IEEE Transactions on Pattern Analysis and Machine Intelligence DO - 10.1109/tpami.2012.264 UR - https://doi.org/10.1109/tpami.2012.264 ER -
APA
Bazin, J., Li, H., Kweon, I. S., Demonceaux, C., Vasseur, P., & Ikeuchi, K. (2013). A Branch-and-Bound Approach to Correspondence and Grouping Problems. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2012.264
Source records
- crossref · retrieved 2026-09-25T01:34:13.691Z