Home Medicine Improvement of a subviral particle tracker by the use of a LAP-Kalman-algorithm
Article Open Access

Improvement of a subviral particle tracker by the use of a LAP-Kalman-algorithm

  • Andreas Rausch EMAIL logo , Dennis Müller and Thomas Schanze
Published/Copyright: September 30, 2016

Abstract

Automated detection and tracking of subviral particles is a promising method to obtain insights in complicated virus-cell interactions. This paper describes the implementation of a linear assignment problem solver and a Kalman-filter in an existing particle tracking algorithm. Two different simulated image sequences are used for the evaluation of the algorithms. Tracking and detection results of the new implemented solver are compared to the results of the original algorithm. The improved algorithm is able to improve the results by closing gaps in the particle tracks.

1 Introduction

The development of a reliable particle tracking algorithm for subivral particles is a great challenge. Difficulties in tracking subviral particles are poor spatial resolution, low contrast of the fluorescent images and effects like auto-fluorescent background, high object density, complex motion and varying shapes of the particles [1]. In coooperation with the virological institute of the Philipps-University Marburg, Germany, an algorithm (referred to as “Kienzle-algorithm”) based on expert-knowledge has been developed [2]. This algorithm enables the detection and tracking of particles with a low false-positive and a high true-positive rate. However, it is not able to fill gaps frequently present in the particle tracks [3]. To improve the tracking results by closing these gaps, i.e. combining related tracklets, a linear assignment problem (LAP) solver combined with a Kalman filter has been added to the algorithm. This paper describes the development of the LAP-Kalman-algorithm and the comparison of tracking results before and after its implementation.

2 Methods

The Kienzle-algorithm is divided into three steps. In the first step, possible candidates for subviral particles are detected and other objects are eliminated. The second step consists of the characterization of these objects. All objects are compared to a set of templates to enable a reliable linking of the tracks during the last step.

The original and the improved Kienzle-algorithm were used to analyze two different simulated image sequences with known ground-truth. The simulated image sequences contain 40, respectively 35 particles tracks with different lengths. However, not all tracks could be detected by the Kienzle-algorithm. Some tracks showed gaps, furthermore the beginnings or ends of some tracks could not be located. The simulated image sequence projection along with the interrupted tracks are shown in Figure 1.

Figure 1 Maximum intensity projection of a simulated sequence with subviral particle tracks, detected by the Kienzle algrorithm: The magnified areas in the red and the blue box show the tracked positions of two subviral particles over time (green line). These areas will be refered to in Figure 4 A, B and C. The red arrows mark the gaps, interrupting the tracks. The light green “tub” enclosing the track is the original track of the particle.
Figure 1

Maximum intensity projection of a simulated sequence with subviral particle tracks, detected by the Kienzle algrorithm: The magnified areas in the red and the blue box show the tracked positions of two subviral particles over time (green line). These areas will be refered to in Figure 4 A, B and C. The red arrows mark the gaps, interrupting the tracks. The light green “tub” enclosing the track is the original track of the particle.

Normally, the Kienzle-algorithm is filtering its results by using a treshold for assessing the object similarity. The LAP-Kalman-algorithm is working with the unfiltered raw data, resulting in a higher number of false-positive and true-positive hits. The idea to improve the tracking results was to close the gaps by post-processing the data solving the LAP combined with forward/backward-Kalman-filtering of the tracklets.

A LAP-algorithm is a method to solve an optimziation problem with respect to a cost function. Therefore the expenses of connecting the single tracklets to each other must be defined. Examples for these costs are distance in space and time between tracklets, differences in their average speed and travel direction, the variation of their size and the predicted next positions of the subviral particles. Distance, speed, size and direction differences are quite simple to determine pieces of information and have been already delivered by the Kienzle-tracking algorithm. So for the first step of the algorithm these simple costs are put into the LAP solver, which chooses the tracklet connections causing the lowest global costs. Its decisions are constrained by a threshold. For solving the task several algorithms were analysed and we decided to work with the auction-algorithm [4]. To estimate the behaviour of the subviral particles in the periods where no detection took place (gaps) is a complex task. To handle this problem we implemented a Kalman filter [5]. This filter is able to learn the physical behaviours of the subviral particles to estimate upcoming positions by feeding it with previous measurements. However, these measurements are affected by any kinds of interferences like statistical noise and measurement uncertainties. So the tracking algorithm can take benefit by two aspects of the Kalman filter. On the one hand it allows to smooth noisy tracks and on the other hand it is able to predict the next particle locations even if the particle is not visible at all. With sufficent information about the moving subviral particle it is, in an optimal case, possible to interpolate the missing track data with exact position estimations. We worked with a linear Kalman filter and chose constant velocity as motion model. However, in many applications, e.g. GPS, a Kalman filter is implemented. But GPS navigation or online tracking of objects do not allow to use future data for Kalman filtering, thus they only can process data from the past for updating the Kalmans predictions. In this application the Kienzle algorithm is doing the entire tracking task first so the Kalman filter is able to access all the time related positions of the virus simultaneously. As the Kalman predictions are getting more reliable the more measurement points it is fed with, it is quite instable in the beginning and is getting statistically better towards the end of each track. To compensate this effect the filter is processing each track dataset in both directions (for- and backward). The benefit of this method is illustrated in Figure 2.

Figure 2 Kalman forward and backward standard deviations: shown are the standard deviations of the estimated positions in y-direction minus the true ones, related to the position numbers one image per second). The blue line represents the standard deviations of the Kalman-forward-predictions und the green line of the backwarded ones. The red dots show the position with missing data.
Figure 2

Kalman forward and backward standard deviations: shown are the standard deviations of the estimated positions in y-direction minus the true ones, related to the position numbers one image per second). The blue line represents the standard deviations of the Kalman-forward-predictions und the green line of the backwarded ones. The red dots show the position with missing data.

Up to this point the solution of the LAP algorithm was only related on data from the Kienzle-algorithm (distance, speed, size and direction), fed into the LAP solver, followed by interpolating and smoothing the connected tracks by the Kalman filter. This already allowed to connect the tracklets obviously belonging together, as only small gaps appear between them. In contrast to this we found that in some cases tracks are seperated by huge gaps as well in space as in time. Often these gaps occur because of cell structures superposing the subviral particle tracks. In this case not only the gap between the two track parts is often enormous, also some tracks of other particles could cross the track of interest. The attempt to connect these parts by using the LAP algorithm for the previously mentioned basic cost parameters would propably fail in involving structures of a wrong track into the connection. Again we are benefiting of the Kalman algorithm ability to predict the positions of a non observable subviral particle. So in this second step of the presented algorithm each track is extended into the future and the past to anticipate the probable progression of the subviral particle track, by using the Kalman filter prediction. With the help of those predicted past and future extensions of the tracks it is now possible to estimate which track parts belong together, even if they are seperated by enormous gaps and superimposed by other structures. Again the LAP solver concludes related on these extended tracks which track belong together, by solving for the minimal distances between the estimated and the actual position of the subviral particle. Finally the tracks again are processed by the Kalman filter. So the output of the algorithm are complete smoothed and interpolated tracks. The whole algorithm sequence can be reviewed in the structure chart in Figure 3.

Figure 3 Structure chart: Boxes and ellipses represent algorithms and data, respectively. First the input for the LAP solver is obtained from the Kienzle tracking algorithm, like distance in space and time. Relating on these data the LAP algorithm is connecting the most likely track parts. Next the Kalman algorithm is interpolating and smoothing these connected tracks. The Kalman filter is estimating the previous and following position of the subviral particle. Secondly the LAP is using this new amount of information to associate more difficult tracklets with each other. Again the Kalman filter delivers smoothed and interpolated complete tracks as result. The dashed arrows symbolize only once executed dataflows and processes.
Figure 3

Structure chart: Boxes and ellipses represent algorithms and data, respectively. First the input for the LAP solver is obtained from the Kienzle tracking algorithm, like distance in space and time. Relating on these data the LAP algorithm is connecting the most likely track parts. Next the Kalman algorithm is interpolating and smoothing these connected tracks. The Kalman filter is estimating the previous and following position of the subviral particle. Secondly the LAP is using this new amount of information to associate more difficult tracklets with each other. Again the Kalman filter delivers smoothed and interpolated complete tracks as result. The dashed arrows symbolize only once executed dataflows and processes.

3 Results

In this sections the results of the single algorithm steps, the runtime performance and the improvements of the Kienzle tracker by the presented LAP-Kalman-algorithm will be presented. The execution of the LAP-solver is resulting in a list with the IDs of the connected tracklets. For a first impression of how the results could look like we linearly connected these tracklets. These connections are symbolized by red lines in Figure 4A on the example of one subviral particle track. The Kalman filter helps the LAP solver to connect far seperated tracklets with each other. Additionally it is able to smooth and to interpolate interrupted and noisy tracks. A Kalman filtering of one interrupted track in for- and backward direction is shown in Figure 4B. One completely reconstructed track can be seen in Figure 4C. In case of the presented simulated sequences the algorithm had to process 3060, respectively 3852 tracklets. In real image sequences the amount of data can vary widely, depending on the number of subviral particles. As the cost-matrix is growing quadratically with the amount of detected tracklets, the duration of running the whole algorithm also is increasing exponetially. So developing the algorithm amongst other aspects we focussed on optimizing the performance. The time consumption of executing the whole algorithm with different datasets is shown in Figure 5 (evaluated on a i7-3770 @ 3,4 Ghz, 24 GB RAM system). For evaluating the algorithm we used the described simulated datasets with 40 tracks from subviral structures in the first sequence and 35 in the second one. Using the Kienzle tracker 37, respectively 33 of these tracks were found, but were interrupted by 58 or 52 gaps, so these tracks are seperated into 95 or rather 85 tracklets. In addition to these subviral tracks, we resort to the fact that we were working on the unfiltered dataset, a certain amount of tracks from other structures were found by the Kienzle-algorithm, resulting in alltogether 3060, respectively 4852 tracklets. Processing these “raw” data with the LAP-Kalman-algorithm reduced the amount of gaps and tracklets dramatically, by not affecting the number of found true positive tracks. The number of gaps could be reduced to three or five. At the same time the averall amount of detected tracklets decreases to 819 or 1383. So also some tracklets of cell structures are connected, which reduces the effort to do a selection of the true positive hits afterwards. However, no additional false positives were produced by connecting subviral partical tracks with some of other cell structures. The number of detected subviral tracks was determined by counting manually. Figure 6 quantifies the results.

Figure 4 LAP and Kalman results: The interrupted track parts (green) have simply been reconnected by linear interpolation (red) related on the solution for the LAP problem (A). The Kalman filter is interpolating and smoothing tracklets (green) in for- and backward direction (yellow and blue). A weightened mean track is calculated (red line). The right connections are produced, even if the tracklets are interrupted by some other structure (“dirt”) (B). The algorithm (red) is reproducing the interrupted tracklets (green) (C).
Figure 4

LAP and Kalman results: The interrupted track parts (green) have simply been reconnected by linear interpolation (red) related on the solution for the LAP problem (A). The Kalman filter is interpolating and smoothing tracklets (green) in for- and backward direction (yellow and blue). A weightened mean track is calculated (red line). The right connections are produced, even if the tracklets are interrupted by some other structure (“dirt”) (B). The algorithm (red) is reproducing the interrupted tracklets (green) (C).

Figure 5 Time consumption: The expired time by running the whole algorithm is depending on the amount of detected tracklets.
Figure 5

Time consumption: The expired time by running the whole algorithm is depending on the amount of detected tracklets.

Figure 6 Results: Presented in absolute amounts. While reducing the number of gaps and thus the amount of tracklets, the number of found subviral particle tracks does not change.
Figure 6

Results: Presented in absolute amounts. While reducing the number of gaps and thus the amount of tracklets, the number of found subviral particle tracks does not change.

4 Discussion

A linear assignment problem solver and a Kalman-filter have been implemented to improve an existing particle tracking algorithm. The new algorithm is working in two main steps. First the LAP solver is connecting the obviously related tracks with each other by using parameters like distance between tracks, size of the subviral particles, etc. Afterwards the Kalman-filter is interpolating and smoothing these achieved completed tracks by processing them in for- and backward direction. In the second step the LAP-solver suggests tracklets which belong together. This time its results are based on predictions from the Kalman filter for the previous and following positions of a subviral particle. At the end the new tracks are smoothed and interpolated. The tracking results have been introduced and compared. The LAP-Kalman-algorithm is able to close gaps in the particle tracks and smoothes noisy track data. Despite on the fact that we were working on the raw data, no tracks which don’t belong together were connected mistakenly. A way to improve the stability and quality of results could be to process the presented LAP-Kalman algorithm as often as desired within an iterative loop. So after each iteration more tracklets are connected with each other and the cost parameters can be updated for even more reliable results. Also a dynamic weighting of the particular cost parameters, related on their increasing accuracy within each iteration, is planned. Furthermore the whole algorithm will be applied to more datasets for a more profound evaluation and to analyze influences on the LAP-Kalman-algorithm with and without iterative approach.

Acknowledgement

The authors would like to thank the virological institute of the Philipps-University, Marburg for providing fluorescence images.

Author’s Statement

Parts of this work have been presented at “Workshop Biosignalverarbeitung 201”, Berlin, 7–8 April 2016 [6]. Research funding: The author state no funding involved. Conflict of interest: Authors state no conflict of interest. Material and Methods: Informed consent: Informed consent is not applicable. Ethical approval: The conducted research is not related to either human or animals use

References

[1] Godinez WJ, Lampe M, Wörz S, Müller B, Eils R, Rohr L. Deterministic and probabilistic approaches for tracking virus particles in timelapse fluorescence microscopy image sequences. Med Image Anal. 2009;13:325–42.10.1016/j.media.2008.12.004Search in Google Scholar PubMed

[2] Kienzle C, Schudt G, Becker S, Schanze T. Multiple subviral particle in fluorescence microscopy sequences. BVMed; 2012.10.1515/bmt-2013-4193Search in Google Scholar PubMed

[3] Müller D, Schanze T. Comparison of different algorithms for automated detection and tracking of fluorescence-labeled subviral particles. BMT; 2015.Search in Google Scholar

[4] Bertsekas DP. Auction algorithms. Encyclopedia of Optimization; 2001.10.1007/0-306-48332-7_15Search in Google Scholar

[5] Welch G, Bishop G. An introduction to the Kalman filter. University of North Carolina at Chapel Hill; 2001.Search in Google Scholar

[6] Rausch A, Müller D, Schanze T. Improvement of a subviral particle tracking algorithm by the use of a Kalman filter. BSV; 2016.10.1515/cdbme-2016-0092Search in Google Scholar

Published Online: 2016-9-30
Published in Print: 2016-9-1

©2016 Andreas Rausch et al., licensee De Gruyter.

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Articles in the same Issue

  1. Synthesis and characterization of PIL/pNIPAAm hybrid hydrogels
  2. Novel blood protein based scaffolds for cardiovascular tissue engineering
  3. Cell adhesion and viability of human endothelial cells on electrospun polymer scaffolds
  4. Effects of heat treatment and welding process on superelastic behaviour and microstructure of micro electron beam welded NiTi
  5. Long-term stable modifications of silicone elastomer for improved hemocompatibility
  6. The effect of thermal treatment on the mechanical properties of PLLA tubular specimens
  7. Biocompatible wear-resistant thick ceramic coating
  8. Protection of active implant electronics with organosilicon open air plasma coating for plastic overmolding
  9. Examination of dielectric strength of thin Parylene C films under various conditions
  10. Open air plasma deposited antimicrobial SiOx/TiOx composite films for biomedical applications
  11. Systemic analysis about residual chloroform in PLLA films
  12. A macrophage model of osseointegration
  13. Towards in silico prognosis using big data
  14. Technical concept and evaluation of a novel shoulder simulator with adaptive muscle force generation and free motion
  15. Usability evaluation of a locomotor therapy device considering different strategies
  16. Hypoxia-on-a-chip
  17. Integration of a semi-automatic in-vitro RFA procedure into an experimental setup
  18. Fabrication of MEMS-based 3D-μECoG-MEAs
  19. High speed digital interfacing for a neural data acquisition system
  20. Bionic forceps for the handling of sensitive tissue
  21. Experimental studies on 3D printing of barium titanate ceramics for medical applications
  22. Patient specific root-analogue dental implants – additive manufacturing and finite element analysis
  23. 3D printing – a key technology for tailored biomedical cell culture lab ware
  24. 3D printing of hydrogels in a temperature controlled environment with high spatial resolution
  25. Biocompatibility of photopolymers for additive manufacturing
  26. Biochemical piezoresistive sensors based on pH- and glucose-sensitive hydrogels for medical applications
  27. Novel wireless measurement system of pressure dedicated to in vivo studies
  28. Portable auricular device for real-time swallow and chew detection
  29. Detection of miRNA using a surface plasmon resonance biosensor and antibody amplification
  30. Simulation and evaluation of stimulation scenarios for targeted vestibular nerve excitation
  31. Deep brain stimulation: increasing efficiency by alternative waveforms
  32. Prediction of immediately occurring microsleep events from brain electric signals
  33. Determining cardiac vagal threshold from short term heart rate complexity
  34. Classification of cardiac excitation patterns during atrial fibrillation
  35. An algorithm to automatically determine the cycle length coverage to identify rotational activity during atrial fibrillation – a simulation study
  36. Deriving respiration from high resolution 12-channel-ECG during cycling exercise
  37. Reducing of gradient induced artifacts on the ECG signal during MRI examinations using Wilcoxon filter
  38. Automatic detection and mapping of double potentials in intracardiac electrograms
  39. Modeling the pelvic region for non-invasive pelvic intraoperative neuromonitoring
  40. Postprocessing algorithm for automated analysis of pelvic intraoperative neuromonitoring signals
  41. Best practice: surgeon driven application in pelvic operations
  42. Vasomotor assessment by camera-based photoplethysmography
  43. Classification of morphologic changes in photoplethysmographic waveforms
  44. Novel computation of pulse transit time from multi-channel PPG signals by wavelet transform
  45. Efficient design of FIR filter based low-pass differentiators for biomedical signal processing
  46. Nonlinear causal influences assessed by mutual compression entropy
  47. Comparative study of methods for solving the correspondence problem in EMD applications
  48. fNIRS for future use in auditory diagnostics
  49. Semi-automated detection of fractional shortening in zebrafish embryo heart videos
  50. Blood pressure measurement on the cheek
  51. Derivation of the respiratory rate from directly and indirectly measured respiratory signals using autocorrelation
  52. Left cardiac atrioventricular delay and inter-ventricular delay in cardiac resynchronization therapy responder and non-responder
  53. An automatic systolic peak detector of blood pressure waveforms using 4th order cumulants
  54. Real-time QRS detection using integrated variance for ECG gated cardiac MRI
  55. Preprocessing of unipolar signals acquired by a novel intracardiac mapping system
  56. In-vitro experiments to characterize ventricular electromechanics
  57. Continuous non-invasive monitoring of blood pressure in the operating room: a cuffless optical technology at the fingertip
  58. Application of microwave sensor technology in cardiovascular disease for plaque detection
  59. Artificial blood circulatory and special Ultrasound Doppler probes for detecting and sizing gaseous embolism
  60. Detection of microsleep events in a car driving simulation study using electrocardiographic features
  61. A method to determine the kink resistance of stents and stent delivery systems according to international standards
  62. Comparison of stented bifurcation and straight vessel 3D-simulation with a prior simulated velocity profile inlet
  63. Transient Euler-Lagrange/DEM simulation of stent thrombosis
  64. Automated control of the laser welding process of heart valve scaffolds
  65. Automation of a test bench for accessing the bendability of electrospun vascular grafts
  66. Influence of storage conditions on the release of growth factors in platelet-rich blood derivatives
  67. Cryopreservation of cells using defined serum-free cryoprotective agents
  68. New bioreactor vessel for tissue engineering of human nasal septal chondrocytes
  69. Determination of the membrane hydraulic permeability of MSCs
  70. Climate retainment in carbon dioxide incubators
  71. Multiple factors influencing OR ventilation system effectiveness
  72. Evaluation of an app-based stress protocol
  73. Medication process in Styrian hospitals
  74. Control tower to surgical theater
  75. Development of a skull phantom for the assessment of implant X-ray visibility
  76. Surgical navigation with QR codes
  77. Investigation of the pressure gradient of embolic protection devices
  78. Computer assistance in femoral derotation osteotomy: a bottom-up approach
  79. Automatic depth scanning system for 3D infrared thermography
  80. A service for monitoring the quality of intraoperative cone beam CT images
  81. Resectoscope with an easy to use twist mechanism for improved handling
  82. In vitro simulation of distribution processes following intramuscular injection
  83. Adjusting inkjet printhead parameters to deposit drugs into micro-sized reservoirs
  84. A flexible standalone system with integrated sensor feedback for multi-pad electrode FES of the hand
  85. Smart control for functional electrical stimulation with optimal pulse intensity
  86. Tactile display on the remaining hand for unilateral hand amputees
  87. Effects of sustained electrical stimulation on spasticity assessed by the pendulum test
  88. An improved tracking framework for ultrasound probe localization in image-guided radiosurgery
  89. Improvement of a subviral particle tracker by the use of a LAP-Kalman-algorithm
  90. Learning discriminative classification models for grading anal intraepithelial neoplasia
  91. Regularization of EIT reconstruction based on multi-scales wavelet transforms
  92. Assessing MRI susceptibility artefact through an indicator of image distortion
  93. EyeGuidance – a computer controlled system to guide eye movements
  94. A framework for feedback-based segmentation of 3D image stacks
  95. Doppler optical coherence tomography as a promising tool for detecting fluid in the human middle ear
  96. 3D Local in vivo Environment (LivE) imaging for single cell protein analysis of bone tissue
  97. Inside-Out access strategy using new trans-vascular catheter approach
  98. US/MRI fusion with new optical tracking and marker approach for interventional procedures inside the MRI suite
  99. Impact of different registration methods in MEG source analysis
  100. 3D segmentation of thyroid ultrasound images using active contours
  101. Designing a compact MRI motion phantom
  102. Cerebral cortex classification by conditional random fields applied to intraoperative thermal imaging
  103. Classification of indirect immunofluorescence images using thresholded local binary count features
  104. Analysis of muscle fatigue conditions using time-frequency images and GLCM features
  105. Numerical evaluation of image parameters of ETR-1
  106. Fabrication of a compliant phantom of the human aortic arch for use in Particle Image Velocimetry (PIV) experimentation
  107. Effect of the number of electrodes on the reconstructed lung shape in electrical impedance tomography
  108. Hardware dependencies of GPU-accelerated beamformer performances for microwave breast cancer detection
  109. Computer assisted assessment of progressing osteoradionecrosis of the jaw for clinical diagnosis and treatment
  110. Evaluation of reconstruction parameters of electrical impedance tomography on aorta detection during saline bolus injection
  111. Evaluation of open-source software for the lung segmentation
  112. Automatic determination of lung features of CF patients in CT scans
  113. Image analysis of self-organized multicellular patterns
  114. Effect of key parameters on synthesis of superparamagnetic nanoparticles (SPIONs)
  115. Radiopacity assessment of neurovascular implants
  116. Development of a desiccant based dielectric for monitoring humidity conditions in miniaturized hermetic implantable packages
  117. Development of an artifact-free aneurysm clip
  118. Enhancing the regeneration of bone defects by alkalizing the peri-implant zone – an in vitro approach
  119. Rapid prototyping of replica knee implants for in vitro testing
  120. Protecting ultra- and hyperhydrophilic implant surfaces in dry state from loss of wettability
  121. Advanced wettability analysis of implant surfaces
  122. Patient-specific hip prostheses designed by surgeons
  123. Plasma treatment on novel carbon fiber reinforced PEEK cages to enhance bioactivity
  124. Wear of a total intervertebral disc prosthesis
  125. Digital health and digital biomarkers – enabling value chains on health data
  126. Usability in the lifecycle of medical software development
  127. Influence of different test gases in a non-destructive 100% quality control system for medical devices
  128. Device development guided by user satisfaction survey on auricular vagus nerve stimulation
  129. Empirical assessment of the time course of innovation in biomedical engineering: first results of a comparative approach
  130. Effect of left atrial hypertrophy on P-wave morphology in a computational model
  131. Simulation of intracardiac electrograms around acute ablation lesions
  132. Parametrization of activation based cardiac electrophysiology models using bidomain model simulations
  133. Assessment of nasal resistance using computational fluid dynamics
  134. Resistance in a non-linear autoregressive model of pulmonary mechanics
  135. Inspiratory and expiratory elastance in a non-linear autoregressive model of pulmonary mechanics
  136. Determination of regional lung function in cystic fibrosis using electrical impedance tomography
  137. Development of parietal bone surrogates for parietal graft lift training
  138. Numerical simulation of mechanically stimulated bone remodelling
  139. Conversion of engineering stresses to Cauchy stresses in tensile and compression tests of thermoplastic polymers
  140. Numerical examinations of simplified spondylodesis models concerning energy absorption in magnetic resonance imaging
  141. Principle study on the signal connection at transabdominal fetal pulse oximetry
  142. Influence of Siluron® insertion on model drug distribution in the simulated vitreous body
  143. Evaluating different approaches to identify a three parameter gas exchange model
  144. Effects of fibrosis on the extracellular potential based on 3D reconstructions from histological sections of heart tissue
  145. From imaging to hemodynamics – how reconstruction kernels influence the blood flow predictions in intracranial aneurysms
  146. Flow optimised design of a novel point-of-care diagnostic device for the detection of disease specific biomarkers
  147. Improved FPGA controlled artificial vascular system for plethysmographic measurements
  148. Minimally spaced electrode positions for multi-functional chest sensors: ECG and respiratory signal estimation
  149. Automated detection of alveolar arches for nasoalveolar molding in cleft lip and palate treatment
  150. Control scheme selection in human-machine- interfaces by analysis of activity signals
  151. Event-based sampling for reducing communication load in realtime human motion analysis by wireless inertial sensor networks
  152. Automatic pairing of inertial sensors to lower limb segments – a plug-and-play approach
  153. Contactless respiratory monitoring system for magnetic resonance imaging applications using a laser range sensor
  154. Interactive monitoring system for visual respiratory biofeedback
  155. Development of a low-cost senor based aid for visually impaired people
  156. Patient assistive system for the shoulder joint
  157. A passive beating heart setup for interventional cardiology training
Downloaded on 8.3.2026 from https://www.degruyterbrill.com/document/doi/10.1515/cdbme-2016-0092/html
Scroll to top button