967 resultados para evaluating methods
Resumo:
Biosignals processing, Biological Nonlinear and time-varying systems identification, Electomyograph signals recognition, Pattern classification, Fuzzy logic and neural networks methods
Resumo:
AbstractBackground:Prone imaging has been demonstrated to minimize diaphragmatic and breast tissue attenuation.Objectives:To determine the role of prone imaging on the reduction of unnecessary rest perfusion studies and coronary angiographies performed, thus decreasing investigation time and radiation exposure.Methods:We examined 139 patients, 120 with an inferior wall and 19 with an anterior wall perfusion defect that might represented attenuation artifact. Post-stress images were acquired in both the supine and prone position. Coronary angiography was used as the “gold standard” for evaluating coronary artery patency. The study was terminated and rest imaging was obviated in the presence of complete improvement of the defect in the prone position. Quantitative interpretation was performed. Results were compared with clinical data and coronary angiographic findings.Results:Prone acquisition correctly revealed defect improvement in 89 patients (89/120) with inferior wall and 12 patients (12/19) with anterior wall attenuation artifact. Quantitative analysis demonstrated statistically significant difference in the mean summed stress scores (SSS) of supine and mean SSS of prone studies in patients with disappearing inferior wall defect in the prone position and patent right coronary artery (true negative results). The mean difference between SSS in supine and in prone position was higher with disappearing than with remaining defects.Conclusion:Technetium-99m (Tc-99m) tetrofosmin myocardial perfusion imaging with the patient in the prone position overcomes soft tissue attenuation; moreover it provides an inexpensive, accurate approach to limit the number of unnecessary rest perfusion studies and coronary angiographies performed.
Resumo:
Magdeburg, Univ., Fak. für Informatik, Diss., 2009
Resumo:
Magdeburg, Univ., Fak. für Informatik, Diss., 2009
Resumo:
Magdeburg, Univ., Fak. für Mathematik, Diss., 2010
Resumo:
12th ed
Resumo:
Magdeburg, Univ., Fak. für Naturwiss., Diss., 2012
Resumo:
Magdeburg, Univ., Fak. für Mathematik, Diss., 2013
Resumo:
Magdeburg, Univ., Fak. für Informatik, Diss., 2013
Resumo:
Magdeburg, Univ., Fak. für Informatik, Diss., 2013
Resumo:
In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inverse Fast Fourier Transformation (IFFT), and proper techniques for maximizing the FFT/IFFT execution speed, such as pipelining or parallel processing, and use of memory structures with pre-computed values (look up tables -LUT) or other dedicated hardware components (usually multipliers). Furthermore, we discuss the optimal hardware architectures that best apply to various FFT/IFFT algorithms, along with their abilities to exploit parallel processing with minimal data dependences of the FFT/IFFT calculations. An interesting approach that is also considered in this paper is the application of the integrated processing-in-memory Intelligent RAM (IRAM) chip to high speed FFT/IFFT computing. The results of the assessment study emphasize that the execution speed of the FFT/IFFT algorithms is tightly connected to the capabilities of the FFT/IFFT hardware to support the provided parallelism of the given algorithm. Therefore, we suggest that the basic Discrete Fourier Transform (DFT)/Inverse Discrete Fourier Transform (IDFT) can also provide high performances, by utilizing a specialized FFT/IFFT hardware architecture that can exploit the provided parallelism of the DFT/IDF operations. The proposed improvements include simplified multiplications over symbols given in polar coordinate system, using sinе and cosine look up tables, and an approach for performing parallel addition of N input symbols.
Resumo:
In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inverse Fast Fourier Transformation (IFFT), and proper techniquesfor maximizing the FFT/IFFT execution speed, such as pipelining or parallel processing, and use of memory structures with pre-computed values (look up tables -LUT) or other dedicated hardware components (usually multipliers). Furthermore, we discuss the optimal hardware architectures that best apply to various FFT/IFFT algorithms, along with their abilities to exploit parallel processing with minimal data dependences of the FFT/IFFT calculations. An interesting approach that is also considered in this paper is the application of the integrated processing-in-memory Intelligent RAM (IRAM) chip to high speed FFT/IFFT computing. The results of the assessment study emphasize that the execution speed of the FFT/IFFT algorithms is tightly connected to the capabilities of the FFT/IFFT hardware to support the provided parallelism of the given algorithm. Therefore, we suggest that the basic Discrete Fourier Transform (DFT)/Inverse Discrete Fourier Transform (IDFT) can also provide high performances, by utilizing a specialized FFT/IFFT hardware architecture that can exploit the provided parallelism of the DFT/IDF operations. The proposed improvements include simplified multiplications over symbols given in polar coordinate system, using sinе and cosine look up tables,and an approach for performing parallel addition of N input symbols.
Resumo:
Magdeburg, Univ., Fak. für Naturwiss., Diss., 2014