scholarly journals Key Points Tracking and Grooming Behavior Recognition of Bactrocera minax (Diptera: Trypetidae) via DeepLabCut

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Wei Zhan ◽  
Yafeng Zou ◽  
Zhangzhang He ◽  
Zhiliang Zhang
Keyword(s):  
Behavior Analysis ◽  
Observation Time ◽  
Experimental Results ◽  
Video Frame ◽  
Time Interval ◽  
Tracking Accuracy ◽  
Accuracy Rate ◽  
Grooming Behavior ◽  
Behavior Recognition ◽  
Key Points

Statistical analysis of Bactrocera grooming behavior is important for pest control and human health. Based on DeepLabCut, this study proposes a noninvasive and effective method to track the key points of Bactrocera minax and to detect and analyze its grooming behavior. The results are analyzed and calculated automatically by a computer program. Traditional movement tracking methods are invasive; for instance, the use of artificial pheromone may affect the behavior of Bactrocera minax, thus directly affecting the accuracy and reliability of experimental results. Traditional research studies mainly rely on manual work for behavior analysis and statistics. Researchers need to play the video frame by frame and record the time interval of each grooming behavior manually, which is time-consuming, laborious, and inaccurate. So the advantages of automated analysis are obvious. Using the method proposed in this paper, the image data of 94538 frames from 5 adult Bactrocera were analyzed and 14 key points were tracked. The overall tracking accuracy was as high as 96.7%. In the behavior analysis and statistics, the average accuracy rate of the five grooming behavior was all above 96%, and the accuracy rate of the remaining two grooming behavior was over 87%. The experimental results show that the automatic noninvasive method designed in this paper can track many key points of Bactrocera minax with high accuracy and ensure the accuracy of insect behavior recognition and analysis, which greatly reduces the manual observation time and provides a new method for key points tracking and behavior recognition of related insects.

Intrapartum Basal Ganglia–Thalamic Pattern Injury and Radiologically Termed “Acute Profound Hypoxic–Ischemic Brain Injury” Are Not Synonymous

2020 ◽  
Author(s):  
Johan Smith ◽  
Regan Solomons ◽  
Lindi Vollmer ◽  
Eduard J. Langenegger ◽  
Jan W. Lotz ◽  
...  
Keyword(s):  
Brain Injury ◽  
Basal Ganglia ◽  
Caesarean Section ◽  
Median Time ◽  
Mode Of Delivery ◽  
Time Interval ◽  
Key Points ◽  
Admission Status ◽  
Sentinel Event ◽  
Magnetic Resonance Imaging Mri

Objective Human cases of acute profound hypoxic-ischemic (HI) injury (HII), in which the insult duration timed with precision had been identified, remains rare, and there is often uncertainty of the prior state of fetal health. Study Design A retrospective analysis of 10 medicolegal cases of neonatal encephalopathy-cerebral palsy survivors who sustained intrapartum HI basal ganglia-thalamic (BGT) pattern injury in the absence of an obstetric sentinel event. Results Cardiotocography (CTG) admission status was reassuring in six and suspicious in four of the cases. The median time from assessment by admission CTG or auscultation to birth was 687.5 minutes (interquartile range [IQR]: 373.5–817.5 minutes), while the median time interval between first pathological CTG and delivery of the infant was 179 minutes (IQR: 137–199.25 minutes). The mode of delivery in the majority of infants (60%) was by unassisted vaginal birth; four were delivered by delayed caesarean section. The median (IQR) interval between the decision to perform a caesarean section and delivery was 169 minutes (range: 124–192.5 minutes). Conclusion The study shows that if a nonreassuring fetal status develops during labor and is prolonged, a BGT pattern HI injury may result, in the absence of a perinatal sentinel event. Intrapartum BGT pattern injury and radiologically termed “acute profound HI brain injury” are not necessarily synonymous. A visualized magnetic resonance imaging (MRI) pattern should preferably solely reflect the patterns description and severity, rather than a causative mechanism of injury. Key Points

Automatic Partitioning of Large Scale Simulation in Grid Computing for Run Time Reduction

2012 ◽  
pp. 225-252
Author(s):  
Nurcin Celik ◽  
Esfandyar Mazhari ◽  
John Canby ◽  
Omid Kazemi ◽  
Parag Sarfare ◽  
...  
Keyword(s):  
Execution Time ◽  
Large Scale ◽  
Time Synchronization ◽  
Computational Grid ◽  
Experimental Results ◽  
Time Interval ◽  
Computational Power ◽  
Large Scale Systems ◽  
Large Scale Simulations ◽  
Reduce Execution Time

Simulating large-scale systems usually entails exhaustive computational powers and lengthy execution times. The goal of this research is to reduce execution time of large-scale simulations without sacrificing their accuracy by partitioning a monolithic model into multiple pieces automatically and executing them in a distributed computing environment. While this partitioning allows us to distribute required computational power to multiple computers, it creates a new challenge of synchronizing the partitioned models. In this article, a partitioning methodology based on a modified Prim’s algorithm is proposed to minimize the overall simulation execution time considering 1) internal computation in each of the partitioned models and 2) time synchronization between them. In addition, the authors seek to find the most advantageous number of partitioned models from the monolithic model by evaluating the tradeoff between reduced computations vs. increased time synchronization requirements. In this article, epoch- based synchronization is employed to synchronize logical times of the partitioned simulations, where an appropriate time interval is determined based on the off-line simulation analyses. A computational grid framework is employed for execution of the simulations partitioned by the proposed methodology. The experimental results reveal that the proposed approach reduces simulation execution time significantly while maintaining the accuracy as compared with the monolithic simulation execution approach.

scholarly journals Task Assignment Algorithm Based on Trust in Volunteer Computing Platforms

Information ◽  
2019 ◽  
Vol 10 (7) ◽  
pp. 244 ◽  
Author(s):  
Ling Xu ◽  
Jianzhong Qiao ◽  
Shukuan Lin ◽  
Ruihua Qi
Keyword(s):  
Completion Time ◽  
Fuzzy Model ◽  
Task Assignment ◽  
Experimental Results ◽  
Volunteer Computing ◽  
Time Interval ◽  
Reliability Model ◽  
Assignment Algorithm ◽  
Computing Platforms ◽  
Task Segmentation

In volunteer computing (VC), the expected availability time and the actual availability time provided by volunteer nodes (VNs) are usually inconsistent. Scheduling tasks with precedence constraints in VC under this situation is a new challenge. In this paper, we propose two novel task assignment algorithms to minimize completion time (makespan) by a flexible task assignment. Firstly, this paper proposes a reliability model, which uses a simple fuzzy model to predict the time interval provided by a VN. This reliability model can reduce inconsistencies between the expected availability time and actual availability time. Secondly, based on the reliability model, this paper proposes an algorithm called EFTT (Earliest Finish Task based on Trust, EFTT), which can minimize makespan. However, EFTT may induce resource waste in task assignment. To make full use of computing resources and reduce task segmentation rate, an algorithm IEFTT (improved earliest finish task based on trust, IEFTT) is further proposed. Finally, experimental results verify the efficiency of the proposed algorithms.

scholarly journals Moving Vehicle Tracking Optimization Method Based on SPF

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Caixia Lv ◽  
Xuejing Zhang
Keyword(s):  
Behavior Analysis ◽  
Adjacency Matrix ◽  
Intelligent Transportation System ◽  
Red Light ◽  
Optimization Method ◽  
Vehicle Tracking ◽  
Experimental Simulation ◽  
Target Area ◽  
Tracking Accuracy ◽  
Moving Vehicle

In the intelligent transportation system, the license information can be automatically recognized by the computer and the vehicle can be tracked. Red light running, illegal change of lanes, vehicle retrograde, and other illegal driving events are reasonably recorded. This is undoubtedly an effective help for the traffic police to relieve the huge work pressure. However, in China, a considerable number of vehicle tracking methods have certain limitations in resisting complex external environmental influences. The external environmental factors include but not limited to variable factors such as camera movement, jitter, and severe rain and snow. These factors cannot be controlled well, so the tracking accuracy is greatly reduced. In regard to this, this paper proposes an optimization method for moving vehicle tracking based on SPF. First, according to the size of the overlapping area of the motion area between the two images, the researcher can construct and simplify the vertex adjacency matrix that reflects the characteristics of the undirected bipartite graph. Then according to the corresponding relationship between the vertex adjacency matrix and the regional behavior and vehicle behavior, the researcher completes the regional behavior analysis and vehicle behavior analysis. On this basis, a particle filter vehicle tracking algorithm based on segmentation compensation is introduced, and the vector sum of the tracked segmentation area is used as the final position of the target vehicle. In this way, as many scattered particles fall on the target area as possible, which will greatly improve the efficiency of particle utilization, enhance tracking accuracy, and avoid the problem of tracking failure caused by too fast vehicle movement. Through experimental simulation, it can be seen that the method proposed in this paper can greatly enhance the vehicle tracking ability when tracking vehicles in “complex environments.”

The Algorithm of Sense Disambiguation Based on Bayesian Model

2013 ◽  
Vol 427-429 ◽  
pp. 1879-1882
Author(s):  
Chun Xiang Zhang ◽  
Xue Yao Gao ◽  
Zhi Mao Lu
Keyword(s):  
Pattern Recognition ◽  
Bayesian Model ◽  
Ambiguous Word ◽  
Experimental Results ◽  
Accuracy Rate ◽  
Part Of Speech ◽  
Sense Disambiguation ◽  
The Right

Sense disambiguation is an important problem in pattern recognition. In this paper, a new algorithm of sense disambiguation is proposed, in which part-of-speech tags of the left word and the right word around the ambiguous word are extracted as discriminative features. At the same time, the bayesian model is selected as the sense disambiguation classifier and it is built based on discriminative features. The architecture of sense classification is given. The new algorithm is trained on sense-annotated corpus. Then it is used to determine its sense category. Experimental results show that the accuracy rate of disambiguation arrives at 60%.

scholarly journals CPSFS: A Credible Personalized Spam Filtering Scheme by Crowdsourcing

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Xin Liu ◽  
Pingjun Zou ◽  
Weishan Zhang ◽  
Jiehan Zhou ◽  
Changying Dai ◽  
...  
Keyword(s):  
Social Trust ◽  
Experimental Results ◽  
Bayesian Filtering ◽  
Spam Filtering ◽  
Network Resources ◽  
Accuracy Rate ◽  
Spam Filters ◽  
Interest Similarity ◽  
Client Side ◽  
Email Spam

Email spam consumes a lot of network resources and threatens many systems because of its unwanted or malicious content. Most existing spam filters only target complete-spam but ignore semispam. This paper proposes a novel and comprehensive CPSFS scheme: Credible Personalized Spam Filtering Scheme, which classifies spam into two categories: complete-spam and semispam, and targets filtering both kinds of spam. Complete-spam is always spam for all users; semispam is an email identified as spam by some users and as regular email by other users. Most existing spam filters target complete-spam but ignore semispam. In CPSFS, Bayesian filtering is deployed at email servers to identify complete-spam, while semispam is identified at client side by crowdsourcing. An email user client can distinguish junk from legitimate emails according to spam reports from credible contacts with the similar interests. Social trust and interest similarity between users and their contacts are calculated so that spam reports are more accurately targeted to similar users. The experimental results show that the proposed CPSFS can improve the accuracy rate of distinguishing spam from legitimate emails compared with that of Bayesian filter alone.

A New Method of Line Feature Generalization Based on Shape Characteristic Analysis

2011 ◽  
Vol 18 (4) ◽  
pp. 597-606 ◽  
Author(s):  
Hongshan Nie ◽  
Zhijian Huang
Keyword(s):  
Adaptive Threshold ◽  
Experimental Results ◽  
New Method ◽  
Characteristic Analysis ◽  
Line Feature ◽  
Shape Characteristic ◽  
Position Accuracy ◽  
Threshold Algorithm ◽  
Key Points ◽  
Line Features

A New Method of Line Feature Generalization Based on Shape Characteristic Analysis This paper presents a piecewise line generalization algorithm (PG) based on shape characteristic analysis. An adaptive threshold algorithm is used to detect all corners, from which key points are selected. The line is divided into some segments by the key points and generalized piecewise with the Li-Openshaw algorithm. To analyze the performance, line features with different complexity are used. The experimental results compared with the DP algorithm and the Li-Openshaw algorithm show that the PG has better performance in keeping the shape characteristic with higher position accuracy.

Droplet Tracking in Double-Electrode GMAW

2011 ◽  
Vol 418-420 ◽  
pp. 1180-1183
Author(s):  
Zhen Zhou Wang ◽  
Yang Yu ◽  
Shu Jun Chen ◽  
Yu Ming Zhang
Keyword(s):  
Real Time ◽  
Gas Metal Arc Welding ◽  
Metal Transfer ◽  
Least Square ◽  
Experimental Results ◽  
Original Position ◽  
Tracking Accuracy ◽  
Tracking Method ◽  
Metal Arc Welding ◽  
Double Electrode

Controlled metal transfer in gas metal arc welding (GMAW) and its modifications including the double-electrode GMAW implies controllable heat and mass inputs and better assured weld quality. To understand, analyze, and control the metal transfer process, the droplet should be monitored in real time. Due to the fast development and transfer of the droplet, the monitoring speed is a key. A tracking method that takes advantage of results from previous images to speed the processing is advantageous. In this paper, Kalman Filter tracking and Least Square Match tracking algorithms are developed to track a droplet in the innovative double-electrode GMAW after its original position is identified. Experimental results showed that the Kalman Filtering algorithm is not suitable for this application due to the limited life span of each droplet. Instead, the Least Square Match algorithm is effective in tracking a droplet if a universal droplet template can be found and defined. However, there are no universal templates suitable for all the droplets. Hence, a real time template updating and LSM tracking method is proposed to track the droplet effectively. Experimental results verified its tracking accuracy.

scholarly journals ANALISIS BEBAN KERJA DAN KEBUTUHAN KARYAWAN PEMUPUKAN KELAPA SAWIT DI PT. WIRA INOVA NUSANTARA KABUPATEN KUTAI TIMUR KALIMANTAN TIMUR

2020 ◽  
Vol 5 (02) ◽  
pp. 101-111
Author(s):  
Aries Rimbawan
Keyword(s):  
Sampling Method ◽  
Observation Time ◽  
Qualitative Approach ◽  
Working Time ◽  
Time Interval ◽  
Job Description ◽  
Work Sampling ◽  
The Right ◽  
Employee Needs ◽  
Timely Work

This research is motivated by the growing area of ​​land or land used for oil palm business, in the industrial and cultivation sectors and in the company also has a design in determining the desired employee needs including determining the right employee needs according to their workload. emban. This study aims at workload to analyze workload, effective working time, and the amount of labor required by the fertilizer division. The study was conducted using the work sampling method to determine the pattern of activities in the use of working time. Fertilizing employees for 3 working days for each employee with an observation time interval of 10 minutes. This study uses a qualitative approach by means of observation and interviews. The results showed a job description of each employee in the fertilization section. The effective working time owned by employees is 59,976 minutes per year with effective working days for a year is 204 days. The total annual workload of the surface part is 60,384 minutes with a total of 13 employees. These results indicate that the number of employees who are deficient will have an impact on the completion time of the task. Therefore, it is advisable for the section that handles employees at PT Wira Inova Nusantara to review the distribution of employees in order to produce optimal and timely work. It is hoped that it can provide information that can be useful for those who read or who want to develop existing methods to be better and more effective methods and can be used as an evaluation in planning and determining the needs of fertilization employees for future consideration and evaluation.

Sign in / Sign up

Export Citation Format

Share Document