Literature Database Entry
ashraf2024intelligent
Sajad Ashraf, "Intelligent UAV Network for Monitoring Food Trees in Greenhouses," Bachelor Thesis, School of Electrical Engineering and Computer Science (EECS), TU Berlin (TUB), August 2024. (Advisor: Jorge Torres Gómez; Referees: Falko Dressler and Thomas Sikora)
Abstract
Precision agriculture is advancing rapidly, necessitating innovative techniques for increased productivity and sustainability. This research focuses on developing a Proof of Concept (PoC) for an intelligent UAV network using the YOLO algorithm for real-time image recognition to monitor and count oranges in greenhouses. Traditional methods like manual inspection are labor-intensive and error-prone. This UAV-AI integration aims to enhance efficiency and accuracy in crop management. The UAV network, equipped with a mini-drone with a high-resolution camera, processes images under various conditions to ensure robustness. The system’s performance is evaluated based on detection accuracy, tracking consistency, and latency. Early results show that the system accurately detects and counts oranges, reducing manual labor and improving efficiency. A medium confidence threshold balances accuracy and reliability best. Comparing BoT-SORT and BitTrack algorithms, BoT-SORT is recommended for its higher accuracy despite slightly slower processing speeds. This research lays a foundational framework for automated crop monitoring, promoting sustainable and efficient agricultural practices, and guiding future developments in agricultural AI systems.
Quick access
Contact
Sajad Ashraf
BibTeX reference
@phdthesis{ashraf2024intelligent,
author = {Ashraf, Sajad},
title = {{Intelligent UAV Network for Monitoring Food Trees in Greenhouses}},
advisor = {Torres G{\'{o}}mez, Jorge},
institution = {School of Electrical Engineering and Computer Science (EECS)},
location = {Berlin, Germany},
month = {8},
referee = {Dressler, Falko and Sikora, Thomas},
school = {TU Berlin (TUB)},
type = {Bachelor Thesis},
year = {2024},
}
Copyright notice
Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.
The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.
The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.
The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.
This page was automatically generated using BibDB and bib2web.