mlsanityData to 13 Oct 2026

ChESS - Quick and Robust Detection of Chess-board Features

arXiv 1301.5491 ↗First posted 23 Jan 2013cs.CVcited by 5

Not on the map. Why?

Abstract (arXiv)

Localization of chess-board vertices is a common task in computer vision, underpinning many applications, but relatively little work focusses on designing a specific feature detector that is fast, accurate and robust. In this paper the `Chess-board Extraction by Subtraction and Summation' (ChESS) feature detector, designed to exclusively respond to chess-board vertices, is presented. The method proposed is robust against noise, poor lighting and poor contrast, requires no prior knowledge of the extent of the chess-board pattern, is computationally very efficient, and provides a strength measure of detected features. Such a detector has significant application both in the key field of camera calibration, as well as in Structured Light 3D reconstruction. Evidence is presented showing its robustness, accuracy, and efficiency in comparison to other commonly used detectors both under simulation and in experimental 3D reconstruction of flat plate and cylindrical objects

Key facts. Cited by 5 papers in the map (data through 13 Oct 2026). First posted on arXiv 23 Jan 2013.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 0; 2023: 2; 2024: 0; 2025: 1.

5 papers.