Gallery — University

Folienvorlage für Präsentationen an der Otto-von-Guericke-Universität in Magdeburg auf Basis der beamer-Dokumentklasse im 16:9-Format

There are several voice communication systems that are used nowadays which are capable of maintain voice calls between two users in real time. Telephones are widely used all around the world in an unlimited kind of situations. All of these situations expose the microphone (or microphones) of the phones to different and unpredictable noises, as street noise, sea noise, rain noise, wind noise, unwanted voices, car motors, etc. As microphones capture all the sounds around it, including the wanted voice and the unwanted noises, it is necessary to implement digital real time filters capable of attenuate as much as possible all the surrounding noises. It exists a large quantity of noise reduction methods that have been used in the calling algorithms of phones. Even if these methods have had, in general, a good performance, there is still a research being done in this area in order to improve the current results. Because of this, the multichannel methods were created (using multiple microphones) as well as new algorithms that pretend to have a better noise reduction than the single channel methods. Most of these methods require a speech presence probability (SPP) method to achieve the noise reduction. The following document presents a research about different SPP methods as well as a comparison between these. This includes an explanation on how theses algorithm work, a Matlab implementation using real voice and noise recordings and objective tests of the filter.

This template can be used to write theses at Massey University. More info about this template please refer to https://www.io.ac.nz Licensed under CC-BY-SA-4.0

Ukázkový text a dokumentace stylu pro text závěrečné (bakalářské a diplomové) práce na KI PřF UP v Olomouci Copyright (C) 2012 Martin Rotter, <rotter.martinos@gmail.com> Copyright (C) 2014 Jan Outrata, <jan.outrata@upol.cz>

Imperial College London provides a set of Competition Poster Templates with official colour-scheme and branding guidelines. Here we provide LaTeX versions of these templates, which use the beamer poster theme created for Imperial College by Lian Tze Lim (Overleaf). To start working on your poster, simply click the 'Open as Template' button above. You'll be able to set up your template to use any of the four official Imperial College London poster colour-schemes: Black Dark Blue Light Blue White The template also provides the option to toggle between different sizes (e.g. A0, A1) and different orientations (portrait, landscape) as required. The example poster shown on the right uses the White colour-scheme, and is set to be A0, portrait by default.

MUW Poster LaTeX Template Version 1.0 (31/08/2016) (Based on Version 1.0 (31/08/2015) of the Jacobs Portrait Poster License: CC BY-NC-SA 4.0 Created by: Nicolas Ballarini, CeMSIIS, Medical University of Vienna nicoballarini@gmail.com http://statistics.msi.meduniwien.ac.at/

This is an un-official template for Johns Hopkins University theses. This template was originally created by R. Jacob Vogelstein, then updated by Noah J. Cowan, Brian Weitzner, John Muschelli, Leonardo Collado Torres, and Ben Ackerman.

Thesis template for Linköpings universitet (LiU).

This is the official Caltech Thesis LaTeX Template for 2016, provided by Overleaf and the Caltech Library. To start writing your thesis, simply click the 'Open as Template' button above. If you have any questions before starting your thesis, it is recommended to read the Caltech Library thesis guide. This version of the template includes the Caltech logo on the title page. If you wish to remove this logo, you may do so within the template, or by starting from this version. To download this template for use offline, please click here and save the zip file to your computer. For more information on using Overleaf, and to claim your free upgrade to Overleaf Pro through the Caltech institutional license, please visit the Caltech portal on Overleaf.