Image Segmentation Method Selection for Vehicle Detection Using Unmanned Aerial Vehicle
Bibliographic record
Abstract
This article discusses the possibility of applying the methods of allocating super pixels in the task for detecting moving and stationary vehicles in images obtained from the unmanned aerial vehicle (UAV) which flying over roads and parking lots. The paper will also consider the specificity of images obtained when shooting with the UAV, the specificity of the image processing, and formed the requirements for segmentation algorithm applicable to the task. Author of the article has developed the application required to measure the average image processing speed in the video stream and the application for evaluating vehicles partitioning quality. This application works with the test image, on which the location of the vehicle were determined by the human. A study was conducted of the several algorithms for image segmentation: LIC, Quick Shift, Felzenszwalb-Huttenlocher, and Model based clustering algorithm. The article presents data on the speed and accuracy of the evaluation of these algorithms in the task for UAV's images segmentation. In conclusion, author has chosen methods that suitable for their use in specific application task. For image segmentation, it was decided to use two of the most appropriate method: segmentation algorithm Felzenszwalb-Huttenlocher and developed by the author earlier algorithm based on the approach to clustering model based clustering. The article also discusses possible further ways of unification super pixels containing regions with vehicles. Further work will focus on the modification, parallelization and accelerate software implementation of FHS and MBC. The author will be also investigate the question of the possibility of Markov Chains to solving the task for super pixels association to the regions and the question of the applicability of the binary classification of regions for the detection of vehicles.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".