Improved Capacitive Proximity Detection for Conductive Objects through Target Profile Estimation
Bibliographic record
Abstract
The accuracy of a capacitive proximity sensor is affected by various factors, including the geometry and composition of the nearby object. The quantitative regression models that are used to seek out the relationship between the measured capacitances and distances to objects are highly dependent on the geometrical properties of the objects. Consequently, the application of capacitive proximity sensors has been mainly limited to detection of objects rather than estimation of distances to them. This paper presents a capacitive proximity sensing system for the detection of metallic objects with improved accuracy based on target profile estimation. The presented approach alleviates large errors in distance estimation by implementing a classifier to recognize the surface profiles before using a suitable regression model to estimate the distance. The sensing system features an electrode matrix that is configured to sweep a series of inner-connection patterns and produce features for profile classification. The performance of the sensing modalities is experimentally assessed with an industrial robot. Two-term exponential regression models provide a high degree of fittings for an object whose shape is known. Recognizing the shape of the object improved the regression models and reduced the close-distance measurement error by a factor of five compared to methods that did not take the geometry into account. The breakthroughs made through this work will make capacitive sensing a viable low-cost alternative to existing technologies for proximity detection in robotics and other fields.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".