The AREA Framework for Location-Based Smart Mobile Augmented Reality Applications
Bibliographic record
Abstract
During the last years, the computational capabilities of smart mobile devices have been continuously improved by hardware vendors, raising new opportunities for mobile application engineers. Mobile augmented reality can be considered as one demanding scenario demonstrating that smart mobile applications are becoming more and more mature. In the AREA (Augmented Reality Engine Application) project, we developed a powerful kernel that enables location-based, mobile augmented reality applications. On top of this kernel, mobile application developers can realize sophisticated individual applications. The AREA kernel, in turn, allows for both robustness and high performance. In addition, it provides a flexible architecture that fosters the development of individual location-based mobile augmented reality applications. As a particular feature, the kernel allows for the handling of points of interests (POI) clusters. Altogether, advanced concepts are required to realize a location-based mobile augmented reality kernel that are presented in this paper. Furthermore, results of an experiment are presented in which the AREA kernel was compared to other location-based mobile augmented reality applications. To demonstrate the applicability of the kernel, we apply it in the context of various mobile applications. As a lesson learned, sophisticated mobile augmented reality applications can be efficiently run on present mobile operating systems and be effectively realized by engineers using the AREA framework. We consider mobile augmented reality as a killer application for mobile computational capabilities as well as the proper support of mobile users in everyday life.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 0.004 |
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".