The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
An efficient and robust line segment matching approach based on LBD descriptor and pairwise geometric consistency
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
SURF: Speeded Up Robust Features
Bay, H., Tuytelaars, T., & Van Gool, L. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744023_32 · Cited by 14,955
Speeded-Up Robust Features (SURF)
Bay, H., Ess, A., Tuytelaars, T., & Van Gool, L. (2008) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2007.09.014 · Cited by 13,557
ORB: An efficient alternative to SIFT or SURF
Rublee, E., Rabaud, V., Konolige, K., & Bradski, G. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126544 · Cited by 11,037
A performance evaluation of local descriptors
Mikolajczyk, K., & Schmid, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.188 · Cited by 6,723
BRIEF: Binary Robust Independent Elementary Features
Calonder, M., Lepetit, V., Strecha, C., & Fua, P. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15561-1_56 · Cited by 3,597
BRISK: Binary Robust invariant scalable keypoints
Leutenegger, S., Chli, M., & Siegwart, R. Y. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126542 · Cited by 3,450
A spectral technique for correspondence problems using pairwise constraints
Leordeanu, M., & Hebert, M. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.20 · Cited by 1,222
Matching Widely Separated Views Based on Affine Invariant Regions
Tuytelaars, T., & Van Gool, L. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000020671.28016.e8 · Cited by 617
EDLines: A real-time line segment detector with a false detection control
Akinlar, C., & Topal, C. (2011) · Pattern Recognition Letters · doi:10.1016/j.patrec.2011.06.001 · Cited by 539
Cited by
PL-SLAM: A Stereo SLAM System Through the Combination of Points and Line Segments
Gomez-Ojeda, R., Moreno, F.-A., Zuniga-Noel, D., Scaramuzza, D., & Gonzalez-Jimenez, J. (2019) · IEEE Transactions on Robotics · doi:10.1109/tro.2019.2899783 · Cited by 560
PL-SLAM: Real-time monocular visual SLAM with points and lines
Pumarola, A., Vakhitov, A., Agudo, A., Sanfeliu, A., & Moreno-Noguer, F. (2017) · 2017 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2017.7989522 · Cited by 482
Crater matching algorithm based on feature descriptor
Shao, W., Xie, J., Cao, L., Leng, J., & Wang, B. (2020) · Advances in Space Research · doi:10.1016/j.asr.2019.09.031 · Cited by 17
Metadata
- Authors
- Zhang, L., & Koch, R.
- Venue
- Journal of Visual Communication and Image Representation
- Publisher
- Elsevier BV
- Published
- 2013-10
- Volume
- 24
- Issue
- 7
- Pages
- 794-805
- ISSN
- 1047-3203 (ISSN-L)
- OpenAlex
- W2008849352
- Cited by
- 536
- References
- 26
- FWCI
- 14.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An efficient and robust line segment matching approach based on LBD descriptor and pairwise geometric consistency. https://app.cochat.ai/papers/10.1016/j.jvcir.2013.05.006
- The paper
- Zhang, L., & Koch, R. (2013). An efficient and robust line segment matching approach based on LBD descriptor and pairwise geometric consistency. Journal of Visual Communication and Image Representation. https://doi.org/10.1016/j.jvcir.2013.05.006
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
