Monitoring image-based processes using a PCA-based control chart and a classification technique
Bibliographic record
Abstract
Machine vision systems are among the novel tools proven to be useful in different applications, among which monitoring and controlling manufacturing processes is one of the most important ones. However, due to the complexity resulted from high-dimensional image data and their inherent correlations, the acquisition of traditional statistical process control tools seems inapplicable. To overcome the shortcomings of the traditional methods in this regard, a statistical model is proposed in this paper which utilizes the concepts of both the PCA-based T2 control chart and the classification methods to develop a tool capable of controlling an image-based process. By defining the warning zones, collected data taken from an image-based process are classified into more than the two classes related to in-control and out-of-control processes. This helps practitioners to define rules to make it easier to realize when the process is getting out of control. Through simulation, the accuracy performance and the speed of four different types of classifiers including linear discriminant analysis (LDA), quadratic discriminant analysis (QDA), kth nearest neighbors (KNN), and support vector machine (SVM) are assessed in different scenarios, based on which the functionality of the proposed approach is evaluated in in-control and out-of-control conditions.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".