Bibliographic record
Abstract
Current approaches to lightness perception include low-level and mid-level models. Low-level models are computational, but have no representation of important factors such as lighting conditions. Mid-level models incorporate such factors, but are typically conceptual rather than genuinely computational, and this limits both their usefulness and our ability to derive testable predictions from them. Here I use Markov random field (MRF) methods to develop a computational mid-level model of lightness perception. The model makes simple statistical assumptions about local patterns of lighting and reflectance, and uses belief propagation and simulated annealing to find globally maximum a posteriori estimates of lighting and reflectance in stimulus images. To simplify this first implementation, I model lightness perception in stimuli on a 16 x 16 pixel grid; within this constraint one can recreate many lightness illusions (e.g., the argyle illusion) and many lightness phenomena (e.g., simultaneous contrast). The model assumes that (1) reflectance spans the range 3% to 90%, (2) illuminance (incident lighting) spans 0 to 100,000 lux, (3) illuminance edges are less common than reflectance edges, (4) illuminance edges tend to be straighter than reflectance edges, and (5) reflectance and illuminance edges usually occur at image luminance edges. Guided by these few simple assumptions, the model arrives at human-like interpretations of lightness illusions that have been problematic for previous models, including the argyle illusion, snake illusion, Koffka ring, and their control conditions. The model also reproduces important phenomena in human lightness perception, including simultaneous contrast and anchoring to white. Thus an MRF model that incorporates simple assumptions about reflectance and lighting provides a strong mid-level computational account of lightness perception over a wide range of conditions. It also illustrates how MRFs can be used to develop more powerful models of constancy that incorporate factors such colour and 3D shape. Meeting abstract presented at VSS 2018
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.000 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 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".