Drill Bit Damage Assessment Using Image Analysis and Deep Learning as an Alternative to Traditional IADC Dull Grading
Bibliographic record
Abstract
Abstract IADC dull bit grading is the current industry standard to assess the condition of a drill bit when it comes out of the hole. It is intended to capture the impact of drilling issues (e.g. drilling abrasive hard rock, drilling dysfunctions) on the bit and to improve future bit selection. However, the grading process is manual and subjective, making the bit grading outcome an inconsistent and unreliable metric. Recent advances in image processing and deep learning allow for bit grading to become more consistent and automated. Such a process is described in this paper. The dataset used in this project consisted of multiple images (taken from different perspectives in a random manner) of used drill bits from 13 bit runs across multiple wells. As a preliminary step in developing the approach, only PDC bits were considered in this project. The first task was to identify all the cutters on a drill bit image using Convolutional Neural Networks (CNN). The CNN approach was chosen since it has shown remarkable success in solving the problem of object detection and classification in other fields. Next, the amount of damage to each cutter was quantified using image processing techniques. Finally, from information gathered in the previous steps, a holistic damage assessment of the drill bit was made. The trained CNN was able to detect the cutters in an image to a high degree of accuracy. The accuracy of cutter detection was further improved through the use of heuristics that predict potential locations of cutters based on blade location and shape. The identification of unique cutters from a group of images of the same bit proved more challenging. Since the images could not be appropriately stitched together, each image was graded independently, and a holistic assessment of the bit was made by aggregation of the individual assessments. Additionally, not all of the cutters identified could be positively identified as damaged or not. For example, if the perspective that was available was at a right angle to the cutter's face, it is inherently not possible to quantify the damage. The computer-generated assessment of the bit was validated with collaborative assessments made by multiple human operators. This paper presents a novel approach to bit damage classification that removes the subjective bias that comes with human evaluations. The application of deep learning techniques to cutter identification, damage detection and quantification is unique and has the potential to significantly improve bit design, selection, and thus, drilling efficiency.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".