75 resultados para Graphics calculators
Resumo:
In this work, possibility of simulating biological organs in realtime using the Boundary Element Method (BEM) is investigated, with specific reference to the speed and the accuracy offered by BEM. First, a Graphics Processing Unit (GPU) is used to speed up the BEM computations to achieve the realtime performance. Next, instead of the GPU, a computer cluster is used. A pig liver is the biological organ considered. Results indicate that BEM is an interesting choice for the simulation of biological organs. Although the use of BEM for the simulation of biological organs is not new, the results presented in the present study are not found elsewhere in the literature.
Resumo:
In this work, possibility of simulating biological organs in realtime using the Boundary Element Method (BEM) is investigated. Biological organs are assumed to follow linear elastostatic material behavior, and constant boundary element is the element type used. First, a Graphics Processing Unit (GPU) is used to speed up the BEM computations to achieve the realtime performance. Next, instead of the GPU, a computer cluster is used. Results indicate that BEM is fast enough to provide for realtime graphics if biological organs are assumed to follow linear elastostatic material behavior. Although the present work does not conduct any simulation using nonlinear material models, results from using the linear elastostatic material model imply that it would be difficult to obtain realtime performance if highly nonlinear material models that properly characterize biological organs are used. Although the use of BEM for the simulation of biological organs is not new, the results presented in the present study are not found elsewhere in the literature.
Resumo:
Approximate Nearest Neighbour Field maps are commonly used by computer vision and graphics community to deal with problems like image completion, retargetting, denoising, etc. In this paper, we extend the scope of usage of ANNF maps to medical image analysis, more specifically to optic disk detection in retinal images. In the analysis of retinal images, optic disk detection plays an important role since it simplifies the segmentation of optic disk and other retinal structures. The proposed approach uses FeatureMatch, an ANNF algorithm, to find the correspondence between a chosen optic disk reference image and any given query image. This correspondence provides a distribution of patches in the query image that are closest to patches in the reference image. The likelihood map obtained from the distribution of patches in query image is used for optic disk detection. The proposed approach is evaluated on five publicly available DIARETDB0, DIARETDB1, DRIVE, STARE and MESSIDOR databases, with total of 1540 images. We show, experimentally, that our proposed approach achieves an average detection accuracy of 99% and an average computation time of 0.2 s per image. (C) 2013 Elsevier Ltd. All rights reserved.
Resumo:
PurposeTo extend the previously developed temporally constrained reconstruction (TCR) algorithm to allow for real-time availability of three-dimensional (3D) temperature maps capable of monitoring MR-guided high intensity focused ultrasound applications. MethodsA real-time TCR (RT-TCR) algorithm is developed that only uses current and previously acquired undersampled k-space data from a 3D segmented EPI pulse sequence, with the image reconstruction done in a graphics processing unit implementation to overcome computation burden. Simulated and experimental data sets of HIFU heating are used to evaluate the performance of the RT-TCR algorithm. ResultsThe simulation studies demonstrate that the RT-TCR algorithm has subsecond reconstruction time and can accurately measure HIFU-induced temperature rises of 20 degrees C in 15 s for 3D volumes of 16 slices (RMSE = 0.1 degrees C), 24 slices (RMSE = 0.2 degrees C), and 32 slices (RMSE = 0.3 degrees C). Experimental results in ex vivo porcine muscle demonstrate that the RT-TCR approach can reconstruct temperature maps with 192 x 162 x 66 mm 3D volume coverage, 1.5 x 1.5 x 3.0 mm resolution, and 1.2-s scan time with an accuracy of 0.5 degrees C. ConclusionThe RT-TCR algorithm offers an approach to obtaining large coverage 3D temperature maps in real-time for monitoring MR-guided high intensity focused ultrasound treatments. Magn Reson Med 71:1394-1404, 2014. (c) 2013 Wiley Periodicals, Inc.
Resumo:
The complexity in visualizing volumetric data often limits the scope of direct exploration of scalar fields. Isocontour extraction is a popular method for exploring scalar fields because of its simplicity in presenting features in the data. In this paper, we present a novel representation of contours with the aim of studying the similarity relationship between the contours. The representation maps contours to points in a high-dimensional transformation-invariant descriptor space. We leverage the power of this representation to design a clustering based algorithm for detecting symmetric regions in a scalar field. Symmetry detection is a challenging problem because it demands both segmentation of the data and identification of transformation invariant segments. While the former task can be addressed using topological analysis of scalar fields, the latter requires geometry based solutions. Our approach combines the two by utilizing the contour tree for segmenting the data and the descriptor space for determining transformation invariance. We discuss two applications, query driven exploration and asymmetry visualization, that demonstrate the effectiveness of the approach.
Resumo:
This paper presents numerical simulation of the evolution of one-dimensional normal shocks, their propagation, reflection and interaction in air using a single diaphragm Riemann shock tube and validate them using experimental results. Mathematical model is derived for one-dimensional compressible flow of viscous and conducting medium. Dimensionless form of the mathematical model is used to construct space-time finite element processes based on minimization of the space-time residual functional. The space-time local approximation functions for space-time p-version hierarchical finite elements are considered in higher order GRAPHICS] spaces that permit desired order of global differentiability of local approximations in space and time. The resulting algebraic systems from this approach yield unconditionally positive-definite coefficient matrices, hence ensure unique numerical solution. The evolution is computed for a space-time strip corresponding to a time increment Delta t and then time march to obtain the evolution up to any desired value of time. Numerical studies are designed using recently invented hand-driven shock tube (Reddy tube) parameters, high/low side density and pressure values, high- and low-pressure side shock tube lengths, so that numerically computed results can be compared with actual experimental measurements.
Resumo:
In epitaxially grown alloy thin films, spinodal decomposition may be promoted or suppressed depending on the sign of the epitaxial strain. We study this asymmetry by extending Cahn's linear theory of spinodal decomposition to systems with a composition dependent lattice parameter and modulus (represented by Vegard's law coefficients, GRAPHICS] and y, respectively), and an imposed (epitaxial) strain (e). We show analytically (and confirm using simulations) that the asymmetric effect of epitaxial strains arises only in elastically inhomogeneous systems. Specifically, we find good agreement between analytical and simulation results for the wave number GRAPHICS] of the fastest growing composition fluctuation. The asymmetric effect due to epitaxial strain also extends to microstructure formation: our simulations show islands of elastically softer (harder) phase with (without) a favourable imposed strain. We discuss the implications of these results to GeSi thin films on Si and Ge substrates, as well as InGaAs films on GaAs substrates.
Resumo:
Consider N points in R-d and M local coordinate systems that are related through unknown rigid transforms. For each point, we are given (possibly noisy) measurements of its local coordinates in some of the coordinate systems. Alternatively, for each coordinate system, we observe the coordinates of a subset of the points. The problem of estimating the global coordinates of the N points (up to a rigid transform) from such measurements comes up in distributed approaches to molecular conformation and sensor network localization, and also in computer vision and graphics. The least-squares formulation of this problem, although nonconvex, has a well-known closed-form solution when M = 2 (based on the singular value decomposition (SVD)). However, no closed-form solution is known for M >= 3. In this paper, we demonstrate how the least-squares formulation can be relaxed into a convex program, namely, a semidefinite program (SDP). By setting up connections between the uniqueness of this SDP and results from rigidity theory, we prove conditions for exact and stable recovery for the SDP relaxation. In particular, we prove that the SDP relaxation can guarantee recovery under more adversarial conditions compared to earlier proposed spectral relaxations, and we derive error bounds for the registration error incurred by the SDP relaxation. We also present results of numerical experiments on simulated data to confirm the theoretical findings. We empirically demonstrate that (a) unlike the spectral relaxation, the relaxation gap is mostly zero for the SDP (i.e., we are able to solve the original nonconvex least-squares problem) up to a certain noise threshold, and (b) the SDP performs significantly better than spectral and manifold-optimization methods, particularly at large noise levels.
Resumo:
The power of X-ray crystal structure analysis as a technique is to `see where the atoms are'. The results are extensively used by a wide variety of research communities. However, this `seeing where the atoms are' can give a false sense of security unless the precision of the placement of the atoms has been taken into account. Indeed, the presentation of bond distances and angles to a false precision (i.e. to too many decimal places) is commonplace. This article has three themes. Firstly, a basis for a proper representation of protein crystal structure results is detailed and demonstrated with respect to analyses of Protein Data Bank entries. The basis for establishing the precision of placement of each atom in a protein crystal structure is non-trivial. Secondly, a knowledge base harnessing such a descriptor of precision is presented. It is applied here to the case of salt bridges, i.e. ion pairs, in protein structures; this is the most fundamental place to start with such structure-precision representations since salt bridges are one of the tenets of protein structure stability. Ion pairs also play a central role in protein oligomerization, molecular recognition of ligands and substrates, allosteric regulation, domain motion and alpha-helix capping. A new knowledge base, SBPS (Salt Bridges in Protein Structures), takes these structural precisions into account and is the first of its kind. The third theme of the article is to indicate natural extensions of the need for such a description of precision, such as those involving metalloproteins and the determination of the protonation states of ionizable amino acids. Overall, it is also noted that this work and these examples are also relevant to protein three-dimensional structure molecular graphics software.
Resumo:
This paper presents the Treadport Active Wind Tunnel (TPAWT)-a full-body immersive virtual environment for the Treadport locomotion interface designed for generating wind on a user from any frontal direction at speeds up to 20 kph. The goal is to simulate the experience of realistic wind while walking in an outdoor virtual environment. A recirculating-type wind tunnel was created around the pre-existing Treadport installation by adding a large fan, ducting, and enclosure walls. Two sheets of air in a non-intrusive design flow along the side screens of the back-projection CAVE-like visual display, where they impinge and mix at the front screen to redirect towards the user in a full-body cross-section. By varying the flow conditions of the air sheets, the direction and speed of wind at the user are controlled. Design challenges to fit the wind tunnel in the pre-existing facility, and to manage turbulence to achieve stable and steerable flow, were overcome. The controller performance for wind speed and direction is demonstrated experimentally.
Resumo:
Rapid reconstruction of multidimensional image is crucial for enabling real-time 3D fluorescence imaging. This becomes a key factor for imaging rapidly occurring events in the cellular environment. To facilitate real-time imaging, we have developed a graphics processing unit (GPU) based real-time maximum a-posteriori (MAP) image reconstruction system. The parallel processing capability of GPU device that consists of a large number of tiny processing cores and the adaptability of image reconstruction algorithm to parallel processing (that employ multiple independent computing modules called threads) results in high temporal resolution. Moreover, the proposed quadratic potential based MAP algorithm effectively deconvolves the images as well as suppresses the noise. The multi-node multi-threaded GPU and the Compute Unified Device Architecture (CUDA) efficiently execute the iterative image reconstruction algorithm that is similar to 200-fold faster (for large dataset) when compared to existing CPU based systems. (C) 2015 Author(s). All article content, except where otherwise noted, is licensed under a Creative Commons Attribution 3.0 Unported License.
Resumo:
A commuting triple of operators (A, B, P) on a Hilbert space H is called a tetrablock contraction if the closure of the set E = {(a(11),a(22),detA) : A = GRAPHICS] with parallel to A parallel to <1} is a spectral set. In this paper, we construct a functional model and produce a set of complete unitary invariants for a pure tetrablock contraction. In this construction, the fundamental operators, which are the unique solutions of the operator equations A - B* P = DPX1DP and B - A* P = DPX2DP where X-1, X-2 is an element of B(D-P) play a pivotal role. As a result of the functional model, we show that every pure tetrablock isometry (A, B, P) on an abstract Hilbert space H is unitarily equivalent to the tetrablock contraction (MG1*+G2z, MG2*+G1z, M-z) on H-DP*(2). (D), where G(1) and G(2) are the fundamental operators of (A*, B*, P*). We prove a Beurling Lax Halmos type theorem for a triple of operators (MF1*+F2z, MF2*+F1z, M-z), where epsilon is a Hilbert space and F-1, F-2 is an element of B(epsilon). We also deal with a natural example of tetrablock contraction on a functions space to find out its fundamental operators.
Resumo:
Sepsis is a life threatening condition resulting from a high burden of infection. It is a major health care problem and associated with inflammation, organ dysfunction and significant mortality. However, proper understanding and delineating the changes that occur during this complex condition remains a challenge. A comparative study involving intra-peritoneal injection of BALB/c mice with Salmonella Typhimurium (infection), lipopolysaccharide (endotoxic shock) or thioglycollate (sterile peritonitis) was performed. The changes in organs and sera were profiled using immunological assays and Fourier Transform Infrared (FTIR) micro-spectroscopy. There is a rapid rise in inflammatory cytokines accompanied with lowering of temperature, respiratory rate and glucose amounts in mice injected with S. Typhimurium or lipopolysaccharide. FTIR identifies distinct changes in liver and sera: decrease in glycogen and protein/lipid ratio and increase in DNA and cholesteryl esters. These changes were distinct from the pattern observed in mice treated with thioglycollate and the differences in the data obtained between the three models are discussed. The combination of FTIR spectroscopy and other biomarkers will be valuable in monitoring molecular changes during sepsis. GRAPHICS] Intra-peritoneal infection with high dose of Salmonella Typhimurium leads to rapid increase in inflammatory cytokines, e.g. Tnf alpha (A). FTIR analysis of liver (B) and sera (C) identifies several metabolic changes: glycogen, protein/lipid, cholesteryl esters and DNA.
Resumo:
CucurbitacinE (CurE) has been known to bind covalently to F-actin and inhibit depolymerization. However, the mode of binding of CurE to F-actin and the consequent changes in the F-actin dynamics have not been studied. Through quantum mechanical/molecular mechanical (QM/MM) and density function theory (DFT) simulations after the molecular dynamics (MD) simulations of the docked complex of F-actin and CurE, a detailed transition state (TS) model for the Michael reaction is proposed. The TS model shows nucleophilic attack of the sulphur of Cys257 at the beta-carbon of Michael Acceptor of CurE producing an enol intermediate that forms a covalent bond with CurE. The MD results show a clear difference between the structure of the F-actin in free form and F-actin complexed with CurE. CurE affects the conformation of the nucleotide binding pocket increasing the binding affinity between F-actin and ADP, which in turn could affect the nucleotide exchange. CurE binding also limits the correlated displacement of the relatively flexible domain 1 of F-actin causing the protein to retain a flat structure and to transform into a stable ``tense'' state. This structural transition could inhibit depolymerization of F-actin. In conclusion, CurE allosterically modulates ADP and stabilizes F-actin structure, thereby affecting nucleotide exchange and depolymerization of F-actin. (C) 2015 Elsevier Inc. All rights reserved.
Resumo:
The bilateral filter is a versatile non-linear filter that has found diverse applications in image processing, computer vision, computer graphics, and computational photography. A common form of the filter is the Gaussian bilateral filter in which both the spatial and range kernels are Gaussian. A direct implementation of this filter requires O(sigma(2)) operations per pixel, where sigma is the standard deviation of the spatial Gaussian. In this paper, we propose an accurate approximation algorithm that can cut down the computational complexity to O(1) per pixel for any arbitrary sigma (constant-time implementation). This is based on the observation that the range kernel operates via the translations of a fixed Gaussian over the range space, and that these translated Gaussians can be accurately approximated using the so-called Gauss-polynomials. The overall algorithm emerging from this approximation involves a series of spatial Gaussian filtering, which can be efficiently implemented (in parallel) using separability and recursion. We present some preliminary results to demonstrate that the proposed algorithm compares favorably with some of the existing fast algorithms in terms of speed and accuracy.