scholarly journals Three-Dimensional Stereo Vision Tracking of Multiple Free-Swimming Fish for Low Frame Rate Video

2021 ◽  
Vol 25 (5) ◽  
pp. 639-646
Author(s):  
Maria Gemel B. Palconit ◽  
Ronnie S. Concepcion II ◽  
Jonnel D. Alejandrino ◽  
Michael E. Pareja ◽  
Vincent Jan D. Almero ◽  
...  
Keyword(s):  
Computing Time ◽  
Three Dimensional ◽  
Computation Time ◽  
Symbolic Regression ◽  
Machine Learning Algorithms ◽  
Frame Rate ◽  
Tracking Accuracy ◽  
Inference System ◽  
Fish Tracking ◽  
Low Frame Rate

Three-dimensional multiple fish tracking has gained significant research interest in quantifying fish behavior. However, most tracking techniques use a high frame rate, which is currently not viable for real-time tracking applications. This study discusses multiple fish-tracking techniques using low-frame-rate sampling of stereo video clips. The fish were tagged and tracked based on the absolute error of the predicted indices using past and present fish centroid locations and a deterministic frame index. In the predictor sub-system, linear regression and machine learning algorithms intended for nonlinear systems, such as the adaptive neuro-fuzzy inference system (ANFIS), symbolic regression, and Gaussian process regression (GPR), were investigated. The results showed that, in the context of tagging and tracking accuracy, the symbolic regression attained the best performance, followed by the GPR, that is, 74% to 100% and 81% to 91%, respectively. Considering the computation time, symbolic regression resulted in the highest computing lag of approximately 946 ms per iteration, whereas GPR achieved the lowest computing time of 39 ms.

scholarly journals Reconstructing the flight kinematics of swarming and mating in wild mosquitoes

2012 ◽  
Vol 9 (75) ◽  
pp. 2624-2638 ◽  
Author(s):  
Sachit Butail ◽  
Nicholas Manoukis ◽  
Moussa Diallo ◽  
José M. Ribeiro ◽  
Tovi Lehmann ◽  
...  
Keyword(s):  
Likelihood Function ◽  
Average Length ◽  
Tracking System ◽  
Three Dimensional ◽  
Frame Rate ◽  
Video Streams ◽  
Camera System ◽  
Multi Target Tracking ◽  
Velocity Information ◽  
Low Frame Rate

We describe a novel tracking system for reconstructing three-dimensional tracks of individual mosquitoes in wild swarms and present the results of validating the system by filming swarms and mating events of the malaria mosquito Anopheles gambiae in Mali. The tracking system is designed to address noisy, low frame-rate (25 frames per second) video streams from a stereo camera system. Because flying A. gambiae move at 1–4 m s −1 , they appear as faded streaks in the images or sometimes do not appear at all. We provide an adaptive algorithm to search for missing streaks and a likelihood function that uses streak endpoints to extract velocity information. A modified multi-hypothesis tracker probabilistically addresses occlusions and a particle filter estimates the trajectories. The output of the tracking algorithm is a set of track segments with an average length of 0.6–1 s. The segments are verified and combined under human supervision to create individual tracks up to the duration of the video (90 s). We evaluate tracking performance using an established metric for multi-target tracking and validate the accuracy using independent stereo measurements of a single swarm. Three-dimensional reconstructions of A. gambiae swarming and mating events are presented.

scholarly journals Estimating intrafraction tumor motion during fiducial-based liver stereotactic radiotherapy via an iterative closest point (ICP) algorithm

2019 ◽  
Vol 14 (1) ◽  
Author(s):  
Wu-zhou Li ◽  
Zhi-wen Liang ◽  
Yi Cao ◽  
Ting-ting Cao ◽  
Hong Quan ◽  
...  
Keyword(s):  
Stereotactic Radiotherapy ◽  
Imaging System ◽  
Liver Tumors ◽  
Three Dimensional ◽  
Rigid Motion ◽  
Iterative Closest Point ◽  
Tumor Motion ◽  
Tracking Accuracy ◽  
Icp Algorithm ◽  
Anterior Posterior

Abstract Background Tumor motion may compromise the accuracy of liver stereotactic radiotherapy. In order to carry out a precise planning, estimating liver tumor motion during radiotherapy has received a lot of attention. Previous approach may have difficult to deal with image data corrupted by noise. The iterative closest point (ICP) algorithm is widely used for estimating the rigid registration of three-dimensional point sets when these data were dense or corrupted. In the light of this, our study estimated the three-dimensional (3D) rigid motion of liver tumors during stereotactic liver radiotherapy using reconstructed 3D coordinates of fiducials based on the ICP algorithm. Methods Four hundred ninety-five pairs of orthogonal kilovoltage (KV) images from the CyberKnife stereo imaging system for 12 patients were used in this study. For each pair of images, the 3D coordinates of fiducial markers inside the liver were calculated via geometric derivations. The 3D coordinates were used to calculate the real-time translational and rotational motion of liver tumors around three axes via an ICP algorithm. The residual error was also investigated both with and without rotational correction. Results The translational shifts of liver tumors in left-right (LR), anterior-posterior (AP),and superior-inferior (SI) directions were 2.92 ± 1.98 mm, 5.54 ± 3.12 mm, and 16.22 ± 5.86 mm, respectively; the rotational angles in left-right (LR), anterior-posterior (AP), and superior-inferior (SI) directions were 3.95° ± 3.08°, 4.93° ± 2.90°, and 4.09° ± 1.99°, respectively. Rotational correction decreased 3D fiducial displacement from 1.19 ± 0.35 mm to 0.65 ± 0.24 mm (P<0.001). Conclusions The maximum translational movement occurred in the SI direction. Rotational correction decreased fiducial displacements and increased tumor tracking accuracy.

Shape Optimization of Forward-Curved-Blade Centrifugal Fan with Navier-Stokes Analysis

2004 ◽  
Vol 126 (5) ◽  
pp. 735-742 ◽  
Author(s):  
Kwang-Yong Kim ◽  
Seoung-Jin Seo
Keyword(s):  
Response Surface ◽  
Stokes Equations ◽  
Computing Time ◽  
Relative Size ◽  
Three Dimensional ◽  
Navier Stokes ◽  
Centrifugal Fan ◽  
Navier Stokes Equations ◽  
Design Variables ◽  
Curved Blade

In this paper, the response surface method using a three-dimensional Navier-Stokes analysis to optimize the shape of a forward-curved-blade centrifugal fan is described. For the numerical analysis, Reynolds-averaged Navier-Stokes equations with the standard k-ε turbulence model are discretized with finite volume approximations. The SIMPLEC algorithm is used as a velocity–pressure correction procedure. In order to reduce the huge computing time due to a large number of blades in forward-curved-blade centrifugal fan, the flow inside of the fan is regarded as steady flow by introducing the impeller force models. Four design variables, i.e., location of cutoff, radius of cutoff, expansion angle of scroll, and width of impeller, were selected to optimize the shapes of scroll and blades. Data points for response evaluations were selected by D-optimal design, and a linear programming method was used for the optimization on the response surface. As a main result of the optimization, the efficiency was successfully improved. Effects of the relative size of the inactive zone at the exit of impeller and momentum fluxes of the flow in scroll on efficiency were further discussed. It was found that the optimization process provides a reliable design of this kind of fan with reasonable computing time.

scholarly journals Assessing biases, relaxing moralism: On ground-truthing practices in machine learning design and application

2021 ◽  
Vol 8 (1) ◽  
pp. 205395172110135
Author(s):  
Florian Jaton
Keyword(s):  
Machine Learning ◽  
William James ◽  
A Priori ◽  
Learning Algorithms ◽  
Three Dimensional ◽  
Ground Truth ◽  
Machine Learning Algorithms ◽  
Ground Truthing ◽  
Set Up ◽  
The Moment

This theoretical paper considers the morality of machine learning algorithms and systems in the light of the biases that ground their correctness. It begins by presenting biases not as a priori negative entities but as contingent external referents—often gathered in benchmarked repositories called ground-truth datasets—that define what needs to be learned and allow for performance measures. I then argue that ground-truth datasets and their concomitant practices—that fundamentally involve establishing biases to enable learning procedures—can be described by their respective morality, here defined as the more or less accounted experience of hesitation when faced with what pragmatist philosopher William James called “genuine options”—that is, choices to be made in the heat of the moment that engage different possible futures. I then stress three constitutive dimensions of this pragmatist morality, as far as ground-truthing practices are concerned: (I) the definition of the problem to be solved (problematization), (II) the identification of the data to be collected and set up (databasing), and (III) the qualification of the targets to be learned (labeling). I finally suggest that this three-dimensional conceptual space can be used to map machine learning algorithmic projects in terms of the morality of their respective and constitutive ground-truthing practices. Such techno-moral graphs may, in turn, serve as equipment for greater governance of machine learning algorithms and systems.

Simulation of microstructure evolution during recrystallization using a high resolution three dimensional cellular automaton

2004 ◽  
Vol 120 ◽  
pp. 225-230
Author(s):  
P. Mukhopadhyay ◽  
M. Loeck ◽  
G. Gottstein
Keyword(s):  
High Resolution ◽  
Cellular Automata ◽  
Cellular Automaton ◽  
Microstructure Evolution ◽  
Static Recrystallization ◽  
Three Dimensional ◽  
Computation Time ◽  
Recrystallization Process ◽  
Recovery Condition ◽  
Physically Based

A more refined 3D cellular Automata (CA) algorithm has been developed which has increased the resolution of the space and reduced the computation time and can take care of the complexity of recrystallization process through physically based solutions. This model includes recovery, condition for nucleation and orientation dependent variable nuclei growth as a process of primary static recrystallization. Incorporation of microchemistry effects makes this model suitable for simulating recrystallization behaviour in terms of texture, kinetics and microstructure of different alloys. The model is flexible to couple up with other simulation programs on a common database.

scholarly journals Accelerated RAPID Model Using Heterogeneous Porous Objects

2018 ◽  
Vol 10 (8) ◽  
pp. 1264 ◽  
Author(s):  
Huaguo Huang
Keyword(s):  
Three Dimensional ◽  
Computation Time ◽  
Single Scattering ◽  
Projection Algorithm ◽  
Forest Plot ◽  
Transfer Model ◽  
Bidirectional Reflectance Factor ◽  
Reflectance Factor ◽  
Radiation Transfer Model ◽  
Porous Object

To enhance the capability of three-dimensional (3D) radiative transfer models at the kilometer scale (km-scale), the radiosity applicable to porous individual objects (RAPID) model has been upgraded to RAPID3. The major innovation is that the homogeneous porous object concept (HOMOBJ) used for a tree crown scale is extended to a heterogeneous porous object (HETOBJ) for a forest plot scale. Correspondingly, the radiosity-graphics-combined method has been extended from HOMOBJ to HETOBJ, including the random dynamic projection algorithm, the updated modules of view factors, the single scattering estimation, the multiple scattering solutions, and the bidirectional reflectance factor (BRF) calculations. Five cases of the third radiation transfer model intercomparison (RAMI-3) have been used to verify RAPID3 by the RAMI-3 online checker. Seven scenes with different degrees of topography (valleys and hills) at 500 m size have also been simulated. Using a personal computer (CPU 2.5 GHz, memory 4 GB), the computation time of BRF at 500 m is only approximately 13 min per scene. The mean root mean square error is 0.015. RAPID3 simulated the enhanced contrast of BRF between backward and forward directions due to topography. RAPID3 has been integrated into the free RAPID platform, which should be very useful for the remote sensing community. In addition, the HETOBJ concept may also be useful for the speedup of ray tracing models.

scholarly journals Optimization Method for Forecasting Confirmed Cases of COVID-19 in China

2020 ◽  
Vol 9 (3) ◽  
pp. 674 ◽  
Author(s):  
Mohammed A. A. Al-qaness ◽  
Ahmed A. Ewees ◽  
Hong Fan ◽  
Mohamed Abd El Aziz
Keyword(s):  
Relative Error ◽  
Computing Time ◽  
World Health ◽  
Coefficient Of Determination ◽  
Flower Pollination Algorithm ◽  
Percentage Error ◽  
Anfis Model ◽  
Local Optima ◽  
Inference System ◽  
Proposed Model

In December 2019, a novel coronavirus, called COVID-19, was discovered in Wuhan, China, and has spread to different cities in China as well as to 24 other countries. The number of confirmed cases is increasing daily and reached 34,598 on 8 February 2020. In the current study, we present a new forecasting model to estimate and forecast the number of confirmed cases of COVID-19 in the upcoming ten days based on the previously confirmed cases recorded in China. The proposed model is an improved adaptive neuro-fuzzy inference system (ANFIS) using an enhanced flower pollination algorithm (FPA) by using the salp swarm algorithm (SSA). In general, SSA is employed to improve FPA to avoid its drawbacks (i.e., getting trapped at the local optima). The main idea of the proposed model, called FPASSA-ANFIS, is to improve the performance of ANFIS by determining the parameters of ANFIS using FPASSA. The FPASSA-ANFIS model is evaluated using the World Health Organization (WHO) official data of the outbreak of the COVID-19 to forecast the confirmed cases of the upcoming ten days. More so, the FPASSA-ANFIS model is compared to several existing models, and it showed better performance in terms of Mean Absolute Percentage Error (MAPE), Root Mean Squared Relative Error (RMSRE), Root Mean Squared Relative Error (RMSRE), coefficient of determination ( R 2 ), and computing time. Furthermore, we tested the proposed model using two different datasets of weekly influenza confirmed cases in two countries, namely the USA and China. The outcomes also showed good performances.

Numerical Study on 3D Coupled Heat Transfer of Thrust Chamber with Regenerative Cooling

2011 ◽  
Vol 52-54 ◽  
pp. 1057-1061
Author(s):  
Tao Nie ◽  
Wei Qiang Liu
Keyword(s):  
Heat Transfer ◽  
Optimization Design ◽  
Numerical Study ◽  
Computing Time ◽  
Three Dimensional ◽  
Geometrical Model ◽  
Performance Estimation ◽  
Transfer Model ◽  
Empirical Formulas ◽  
Coupled Heat Transfer

To obtain temperature distribution in regenerative-cooled liquid propellant rocket nozzle quickly and accurately, three-dimensional numerical simulation employed using empirical formulas. A reduced one-dimensional model is employed for the coolant flow and heat transfer, while three dimensional heat transfer model is used to calculate the coupling heat transfer through the wall. The geometrical model is subscale hot-firing chamber. The numerical results agree well with experimental data, while temperature field in nozzle obtained. In terms of computing time and accuracy of results, this method can provide a reference for optimization design and performance estimation.

scholarly journals Coarse-grained tight-binding models

2021 ◽  
Author(s):  
Tianxiang Liu ◽  
Li Mao ◽  
Mats-Erik Pistol ◽  
Craig Pryor
Keyword(s):  
Quantum Well ◽  
Computing Time ◽  
Numerical Test ◽  
Tight Binding ◽  
Computation Time ◽  
Coarse Grained ◽  
Weakly Bound ◽  
Trade Offs ◽  
Full Calculation ◽  
Binding Models

Abstract Calculating the electronic structure of systems involving very different length scales presents a challenge. Empirical atomistic descriptions such as pseudopotentials or tight-binding models allow one to calculate the effects of atomic placements, but the computational burden increases rapidly with the size of the system, limiting the ability to treat weakly bound extended electronic states. Here we propose a new method to connect atomistic and quasi-continuous models, thus speeding up tight-binding calculations for large systems. We divide a structure into blocks consisting of several unit cells which we diagonalize individually. We then construct a tight-binding Hamiltonian for the full structure using a truncated basis for the blocks, ignoring states having large energy eigenvalues and retaining states with an energy close to the band edge energies. A numerical test using a GaAs/AlAs quantum well shows the computation time can be decreased to less than 5% of the full calculation with errors of less than 1%. We give data for the trade-offs between computing time and loss of accuracy. We also tested calculations of the density of states for a GaAs/AlAs quantum well and find a ten times speedup without much loss in accuracy.

Sign in / Sign up

Export Citation Format

Share Document