scholarly journals Long-Range Pose Estimation for Aerial Refueling Approaches Using Deep Neural Networks

2020 ◽  
Vol 17 (11) ◽  
pp. 634-646
Author(s):  
Andrew Lee ◽  
Will Dallmann ◽  
Scott Nykl ◽  
Clark Taylor ◽  
Brett Borghetti
2021 ◽  
Vol 180 ◽  
pp. 105863
Author(s):  
Cheng Fang ◽  
Tiemin Zhang ◽  
Haikun Zheng ◽  
Junduan Huang ◽  
Kaixuan Cuan

2018 ◽  
Author(s):  
Alexander Mathis ◽  
Richard Warren

Pose estimation is crucial for many applications in neuroscience, biomechanics, genetics and beyond. We recently presented a highly efficient method for markerless pose estimation based on transfer learning with deep neural networks called DeepLabCut. Current experiments produce vast amounts of video data, which pose challenges for both storage and analysis. Here we improve the inference speed of DeepLabCut by up to tenfold and benchmark these updates on various CPUs and GPUs. In particular, depending on the frame size, poses can be inferred offline at up to 1200 frames per second (FPS). For instance, 278 × 278 images can be processed at 225 FPS on a GTX 1080 Ti graphics card. Furthermore, we show that DeepLabCut is highly robust to standard video compression (ffmpeg). Compression rates of greater than 1,000 only decrease accuracy by about half a pixel (for 640 × 480 frame size). DeepLabCut’s speed and robustness to compression can save both time and hardware expenses.


2021 ◽  
pp. 1-39
Author(s):  
Kimberly Villalobos ◽  
Vilim Štih ◽  
Amineh Ahmadinejad ◽  
Shobhita Sundaram ◽  
Jamell Dozier ◽  
...  

Abstract The insideness problem is an aspect of image segmentation that consists of determining which pixels are inside and outside a region. Deep neural networks (DNNs) excel in segmentation benchmarks, but it is unclear if they have the ability to solve the insideness problem as it requires evaluating long-range spatial dependencies. In this letter, we analyze the insideness problem in isolation, without texture or semantic cues, such that other aspects of segmentation do not interfere in the analysis. We demonstrate that DNNs for segmentation with few units have sufficient complexity to solve the insideness for any curve. Yet such DNNs have severe problems with learning general solutions. Only recurrent networks trained with small images learn solutions that generalize well to almost any curve. Recurrent networks can decompose the evaluation of long-range dependencies into a sequence of local operations, and learning with small images alleviates the common difficulties of training recurrent networks with a large number of unrolling steps.


2018 ◽  
Vol 16 (1) ◽  
pp. 117-125 ◽  
Author(s):  
Talmo D. Pereira ◽  
Diego E. Aldarondo ◽  
Lindsay Willmore ◽  
Mikhail Kislin ◽  
Samuel S.-H. Wang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document