Photoelectric Memristor-Based Machine Vision for Artificial Intelligence Applications
Bibliographic record
Abstract
With the rapid development of next-generation artificial intelligence technology, research on advanced machine vision has received extensive attention. It is well-known that significant progress has been made in artificial vision systems based on light sensors, but the separate light sensor and memory require additional time for information transfer to realize computation due to the limitation of the von Neumann architecture, which delays the computational speed and hinders large-scale integration. In recent years, the emergence of photoelectric memristors has brought new inspiration to the study of machine vision, which is expected to overcome the above problems. Photoelectric memristors can not only respond directly to light stimuli but also perform temporary memory and real-time processing of visual information and sensory data, providing a promising hardware foundation for the development of artificial vision systems. In this review, the background and related theory of photoelectric memristors and machine vision are first introduced. Then, the research progress of photoelectric memristors and machine vision based on them is reviewed. Finally, the existing problems impeding the progress of machine vision based on photoelectric memristors are summarized, and the future development is predicted.
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.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 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.004 | 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".