Bibliographic record
Abstract
The main area of research delineated in this thesis provides instances when Computer vision based technology has shown tremendous productivity gains in the Oil sands industry in Fort McMurray, Alberta, Canada. Specifically, the interface between Bitumen-froth (crude oil) and the Middlings (Sand) in separation cells (during the extraction process) is estimated in real time from camera video and used for automatic control of the interface level. Two original algorithms have been developed which solve the interface estimation problem using techniques ranging from image analysis, estimation theory (Particle filters) and probabilistic reasoning. These ideas are discussed in chapters three and four. The first chapter of this thesis discusses the broad area of Computer vision research as a knowledge basis for the current work. Computer vision (automatic image analysis) has been presented starting from the basics and culminating in advanced algorithms that are used frequently. The methods described in this chapter form the foundation of the work that follows in the subsequent chapters. After the introduction to automatic image analysis, a set of Monte Carlo simulation based methods called Particle filters are introduced in the second chapter. These Monte Carlo filters assume importance in the current work as they are used to derive one of the main results of this thesis. A large part of this chapter though is devoted to the introduction of the concept of measure theoretic probability which is used in proving the convergence of Particle filters. Another application of Computer vision techniques is also developed in this thesis (in chapter five) to treat the problem of automatic interface and boundary detection in X-ray view cell images. These images are typically used to observe liquid-liquid and liquid-vapour phase behaviour of heavy oils such as Bitumen in chemical equilibrium investigations. The equilibrium data would then be used to enhance Bitumen separation technologies. Manual tracking of the interfaces between these phases for different mixtures and conditions is time consuming when a large set of such images are to be analysed. A novel algorithm is developed that is based on state-of-the-art in Computer vision techniques and automates the entire task.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.010 | 0.005 |
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".