Behavior monitoring model of kitchen staff based on YOLOv5l and DeepSort techniques

Although the monitoring system has been widely used, the actual monitoring task still needs more manpower to complete. This paper takes yolov5l model and deep sort algorithm as the basic framework to identify and track the staff in kitchen environment. We apply a relation construction with detected items and people, then label the relation corresponding to behaviors violate the regulations of kitchen, such as the staff did not wear mask or hat. We train our model and the experimental results show that the model can correctly identify the inappropriate behaviors of staff. The model achieves the time-constrained accuracy of 95.32% in identifying whether the staff wear a hat or not, and the time-constrained accuracy of 96.32% in identifying whether the staff wear mask correctly. The result shows that the proposed model could fulfil monitoring task in this kitchen environment.

A fast vectorized sorting implementation based on the ARM scalable vector extension (SVE)

The way developers implement their algorithms and how these implementations behave on modern CPUs are governed by the design and organization of these. The vectorization units (SIMD) are among the few CPUs’ parts that can and must be explicitly controlled. In the HPC community, the x86 CPUs and their vectorization instruction sets were de-facto the standard for decades. Each new release of an instruction set was usually a doubling of the vector length coupled with new operations. Each generation was pushing for adapting and improving previous implementations. The release of the ARM scalable vector extension (SVE) changed things radically for several reasons. First, we expect ARM processors to equip many supercomputers in the next years. Second, SVE’s interface is different in several aspects from the x86 extensions as it provides different instructions, uses a predicate to control most operations, and has a vector size that is only known at execution time. Therefore, using SVE opens new challenges on how to adapt algorithms including the ones that are already well-optimized on x86. In this paper, we port a hybrid sort based on the well-known Quicksort and Bitonic-sort algorithms. We use a Bitonic sort to process small partitions/arrays and a vectorized partitioning implementation to divide the partitions. We explain how we use the predicates and how we manage the non-static vector size. We also explain how we efficiently implement the sorting kernels. Our approach only needs an array of O(log N) for the recursive calls in the partitioning phase, both in the sequential and in the parallel case. We test the performance of our approach on a modern ARMv8.2 (A64FX) CPU and assess the different layers of our implementation by sorting/partitioning integers, double floating-point numbers, and key/value pairs of integers. Our results show that our approach is faster than the GNU C++ sort algorithm by a speedup factor of 4 on average.

Implementation Of Bubble Sort Algorithm On 2 Fruit Models Of Data Selection Using The Java Program Language

There are various kinds of data sorting methods that we know of which are the Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Shell Sort, Heap Sort, and Radix Sort methods. All of these methods have advantages and disadvantages of each, whose use is determined based on needs. Each method has a different algorithm, where different algorithms affect the execution time. One interesting algorithm to be implemented on 2 variant models of data sorting is the Bubble Sort algorithm, the reason is that this algorithm has a fairly long and detailed process flow to produce an ordered data sequence from a previously unordered data sequence. Two (2) data sorting variant models that will be implemented using the Bubble Sort algorithm are: Ascending data sorting variants moving from left to right, and Descending data sorting variants moving from left to right. And the device used in implementing the Bubble Sort algorithm is the Java programming language.

Extracting Key Traffic Parameters from UAV Video with On-Board Vehicle Data Validation

The advantages of UAV video in flexibility, traceability, easy-operation, and abundant information make it a popular and powerful aerial tool applied in traffic monitoring in recent years. This paper proposed a systematic approach to detect and track vehicles based on the YOLO v3 model and the deep SORT algorithm for further extracting key traffic parameters. A field experiment was implemented to provide data for model training and validation to ensure the accuracy of the proposed approach. In the experiment, 5400 frame images and 1192 speed points were collected from two test vehicles equipped with high-precision GNSS-RTK and onboard OBD after completion of seven experimental groups with a different height (150 m to 500 m) and operating speed (40 km/h to 90 km/h). The results indicate that the proposed approach exhibits strong robustness and reliability, due to the 90.88% accuracy of object detection and 98.9% precision of tracking vehicle. Moreover, the absolute and relative error of extracted speed falls within ±3 km/h and 2%, respectively. The overall accuracy of the extracted parameters reaches up to 98%.

Implementation of Selection Sort Algorithm in Various Programming Languages

Sorting algorithmdeals with the arrangement of alphanumeric data in static order.It plays an important roleinthe field of data science. Selection sort is one ofthe simplest and efficient algorithms which can be applied for the huge number of elements it works likeby giving list of unsorted information, the calculation which breaksintotwo partitions. One section has all the sorted information and another sectionhas all thestaying unsorted information. The calculation rehashes itself, by finding the smallestcomponentinside the rundown of unsorted information and swappingitwith the furthest left component, in the end setting everything straight information.This researchpresents the implementationof selection sort usingC/C++, Python, and Rust and measuredthetime complexity. After experiment,we have collectedtheresults in terms of running time, andanalyzed the outcomes.It was observed that python language hasvery smallamount of line of code, and it also consumesless storage and fast running time then other two languages.

Ball and Player Detection & Tracking in Soccer Videos Using Improved YOLOV3 Model

Over the past few years, there has been a tremendous increase in the interest and enthusiasm for sports among people. This has led to an increase in the importance given to video recording of various sports that capture even the minutest detail using high-end equipment. Recording and analysis have thereby become extremely crucial in sports like soccer that involve several complex and fast events. Ball detection and tracking along with player analysis have emerged as an area of interest among a lot of analysts and researchers. This is because it helps coaches in performance assessment of the team and in decision making to obtain optimized results. Video analysis can additionally be used by coaches and recruiters to look for new, talented players based on their previously played games. Ball detection also plays a pivotal role in assisting the referees in making decisions at game-changing moments. However, as the ball is almost always moving, its shape-appearance keeps changing over time and it is frequently occluded by players, it makes it difficult to track it throughout the game. We propose a deep learning-based YOLOv3 model for the ball and player detection in broadcast soccer videos. Initially, the videos are processed and unnecessary parts like zoom-ins, replays, etc., are removed to obtain only the relevant frames from each game. Tracking is achieved using the SORT algorithm which employs a Kalman filtering and bounding box overlap.

MS-Faster R-CNN: Multi-Stream Backbone for Improved Faster R-CNN Object Detection and Aerial Tracking from UAV Images

Tracking objects across multiple video frames is a challenging task due to several difficult issues such as occlusions, background clutter, lighting as well as object and camera view-point variations, which directly affect the object detection. These aspects are even more emphasized when analyzing unmanned aerial vehicles (UAV) based images, where the vehicle movement can also impact the image quality. A common strategy employed to address these issues is to analyze the input images at different scales to obtain as much information as possible to correctly detect and track the objects across video sequences. Following this rationale, in this paper, we introduce a simple yet effective novel multi-stream (MS) architecture, where different kernel sizes are applied to each stream to simulate a multi-scale image analysis. The proposed architecture is then used as backbone for the well-known Faster-R-CNN pipeline, defining a MS-Faster R-CNN object detector that consistently detects objects in video sequences. Subsequently, this detector is jointly used with the Simple Online and Real-time Tracking with a Deep Association Metric (Deep SORT) algorithm to achieve real-time tracking capabilities on UAV images. To assess the presented architecture, extensive experiments were performed on the UMCD, UAVDT, UAV20L, and UAV123 datasets. The presented pipeline achieved state-of-the-art performance, confirming that the proposed multi-stream method can correctly emulate the robust multi-scale image analysis paradigm.

Comparison of Bubble and Insertion Sort in Rust and Python Language

Sorting is the basic activity in the field of computer science and it is commonly used in searching for information and data. The main goal of sorting is to make reports or records easier to edit, delete and search, etc. It organizes the given data in any sequence. There are many sorting algorithms like insertion sort, bubble sort, radix sort, heap sort, and so forth. Bubble sort and insertion sort are clearly described with algorithms and examples. In this paper, the bubble sort and insertion sort performance analysis is carried out by calculating the time complexity. These algorithm time complexities have been calculated by implementing in the rust and python languages and observed the best case, average case, and worst case. The flowchart shows the complete workflow of this study. The results have been shown graphically and time complexity has been shown in a tabular form. We have compared the efficiency of bubble sort and insertion sort algorithms in the rust and python platforms. The rust language is more efficient than python for both bubble and insertion sort algorithms. However, it is observed insertion sort is more efficient than the bubble sort algorithm.