905 resultados para face recognition algorithms


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Speaker Recognition, Speaker Verification, Sparse Kernel Logistic Regression, Support Vector Machine

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2010

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Magdeburg, Univ., Fak. für Mathematik, Diss., 2012

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This work describes a test tool that allows to make performance tests of different end-to-end available bandwidth estimation algorithms along with their different implementations. The goal of such tests is to find the best-performing algorithm and its implementation and use it in congestion control mechanism for high-performance reliable transport protocols. The main idea of this paper is to describe the options which provide available bandwidth estimation mechanism for highspeed data transport protocols and to develop basic functionality of such test tool with which it will be possible to manage entities of test application on all involved testing hosts, aided by some middleware.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2013

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2013

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Magdeburg, Univ., Fak. für Informatik, Diss., 2014

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A presente dissertação busca abordar a questão da restrição ao direito fundamental de liberdade da pessoa toxicodependente no Brasil, consistente, precisamente, na internação forçada para o tratamento de sua saúde e/ou para a segurança pública, sob o olhar do princípio constitucional da dignidade da pessoa humana em suas dimensões positiva, que exige uma obrigação de fazer por parte do Estado, e negativa, que cobra deste uma postura omissiva de proteção, em torno de um mesmo indivíduo; sem se olvidar do interesse público na execução da medida. Para tanto, ao longo do trabalho, a legislação brasileira atinente ao tema é posta em comparação com a sua correspondente portuguesa e, à luz, basicamente, das doutrinas desses países, são examinados direitos afetos à liberdade individual e ao direito social à saúde, sob a costura do apontado princípio estruturante das respectivas Constituições, de modo a permitir a visualização do amparo da medida restritiva no texto maior brasileiro e, ao final, uma análise crítica à ponderação de bens (direitos) realizada pelo legislador ordinário, com possíveis soluções para a sua aplicação em concreto, quando da análise da proporcionalidade da intervenção da liberdade pelo Poder Judiciário.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Some practical aspects of Genetic algorithms’ implementation regarding to life cycle management of electrotechnical equipment are considered.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Otto-von-Guericke-Universität Magdeburg, Fakultät für Wirtschaftswissenschaft, Univ., Dissertation, 2015

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Phylloscyrtini occurs from eastern United States to Argentina and includes 21 valid species. It is a highly neglected group of crickets and little is known about its biology and distribution. Cranistus colliurides Stål, 1861 and Phylloscyrtus amoenus (Burmeister, 1880) were recorded for the state of Rio Grande do Sul, southern Brazil, and information on calling song, stridulatory file and recognition characters were provided.