Spelling suggestions: "subject:"[een] ADAPTIVE FILTERING"" "subject:"[enn] ADAPTIVE FILTERING""
71 |
Restauração cega de imagens: soluções baseadas em algoritmos adaptativos. / Blind image restoration: solutions based on adaptive algorithms.Daniela Brasil Silva 24 May 2018 (has links)
O objetivo da desconvolução cega de imagens é restaurar uma imagem degradada sem usar informação da imagem real ou da função de degradação. O mapeamento dos níveis de cinza de uma imagem em um sinal de comunicação possibilita o uso de técnicas de equalização cega de canais para a restauração de imagens. Neste trabalho, propõe-se o uso de um esquema para desconvolução cega de imagens baseado na combinação convexa de um equalizador cego com um equalizador no modo de decisão direta. A combinação também é adaptada de forma cega, o que possibilita o chaveamento automático entre os filtros componentes. Dessa forma, o esquema proposto é capaz de atingir o desempenho de um algoritmo de filtragem adaptativa supervisionada sem o conhecimento prévio da imagem original. O desempenho da combinação é ilustrado por meio de simulações, que comprovam a eficiência desse esquema quando comparado a outras soluções da literatura. / The goal of blind image deconvolution is to restore a degraded image without using information from the actual image or from the point spread function. The mapping of the gray levels of an image into a communication signal enables the use of blind equalization techniques for image restoration. In this work, we use a blind image deconvolution scheme based on the convex combination of a blind equalizer with an equalizer in the decision-directed mode. The combination is also blindly adapted, which enables automatic switching between the component filters. Thus, the proposed scheme is able to achieve the performance of a supervised adaptive filtering algorithm without prior knowledge of the original image. The performance of the combination is illustrated by simulations, which show the efficiency of this scheme when compared to other solutions in the literature.
|
72 |
Algoritmos adaptativos LMS normalizados proporcionais: proposta de novos algoritmos para identificação de plantas esparsas / Proportional normalized LMS adaptive algorithms: proposed new algorithms for identification of sparse plantsCastelo Branco, César Augusto Santana 12 December 2016 (has links)
Submitted by Rosivalda Pereira (mrs.pereira@ufma.br) on 2017-06-23T20:42:44Z
No. of bitstreams: 1
CesarCasteloBranco.pdf: 11257769 bytes, checksum: 911c33f2f0ba5c1c0948888e713724f6 (MD5) / Made available in DSpace on 2017-06-23T20:42:44Z (GMT). No. of bitstreams: 1
CesarCasteloBranco.pdf: 11257769 bytes, checksum: 911c33f2f0ba5c1c0948888e713724f6 (MD5)
Previous issue date: 2016-12-12 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPQ) / This work proposes new methodologies to optimize the choice of the parameters of the proportionate normalized least-mean-square (PNLMS) adaptive algorithms. The proposed approaches use procedures based on two optimization methods, namely, the golden section and tabu search methods. Such procedures are applied to determine the optimal parameters in each iteration of the adaptation process of the PNLMS and improved PNLMS (IPNLMS) algorithms. The objective function for the proposed procedures is based on the a posteriori estimation error. Performance studies carried out to evaluate the impact of the PNLMS and IPNLMS parameters in the behavior of these algorithms shows that, with the aid of optimization techniques to choose properly such parameters, the performance of these algorithms may be improved in terms of convergence speed for the identification of plants with high sparseness degree. The main goal of the proposed methodologies is to improve the distribution of the adaptation energy between the coefficients of the PNLMS and IPNLMS algorithms, using parameter values that lead to the minimal estimation error of each iteration of the adaptation process. Numerical tests performed (considering various scenarios in which the plant impulse response is sparse) show that the proposed methodologies achieve convergence speeds faster than the PNLMS and IPNLMS algorithms, and other algorithms of the PNLMS class, such as the sparseness controlled IPNLMS (SC-IPNLMS) algorithm. / Neste trabalho, novas metodologias para otimizar a escolha dos parâmetros dos algoritmos adaptativos LMS normalizados proporcionais (PNLMS) são propostas. As abordagens propostas usam procedimentos baseados em dois métodos de otimização, a saber, os métodos da razão áurea e da busca tabu. Tais procedimentos são empregados para determinar os parâmetros ótimos em cada iteração do processo de adaptação dos algoritmos PNLMS e PNLMS melhorado (IPNLMS). A função objetivo adotada pelos procedimentos propostos é baseada no erro de estimação a posteriori. O estudo de desempenho realizado para avaliar o impacto dos parâmetros dos algoritmos PNLMS e IPNLMS no comportamento dos mesmos mostram que, com o auxílio de técnicas de otimização para escolher adequadamente tais parâmetros, o desempenho destes algoritmos pode ser melhorado, em termos de velocidade de convergência, para a identificação de plantas com elevado grau de esparsidade. O principal objetivo das metodologias propostas é melhorar a distribuição da energia de ativação entre os coeficientes dos algoritmos PNLMS e IPNLMS, usando valores de parâmetros que levam ao erro de estimação mínimo em cada iteração do processo de adaptação. Testes numéricos realizados (considerando diversos cenários nos quais a resposta impulsiva da planta é esparsa) mostram que as metodologias propostas alcançam velocidades de convergência superiores às dos algoritmos PNLMS e IPNLMS, além de outros algoritmos da classe PNLMS, tais como o algoritmo IPNLMS com controle de esparsidade (SCIPNLMS).
|
73 |
Circuitos divisores Newton-Raphson e Goldschmidt otimizados para filtro adaptativo NLMS aplicado no cancelamento de interferênciaFURTADO, Vagner Guidotti 07 December 2017 (has links)
Submitted by Cristiane Chim (cristiane.chim@ucpel.edu.br) on 2018-05-08T17:34:22Z
No. of bitstreams: 1
Vagner Guidotti Furtado (1).pdf: 2942442 bytes, checksum: a43c18ecb28456284d4b6c622f11210d (MD5) / Made available in DSpace on 2018-05-08T17:34:22Z (GMT). No. of bitstreams: 1
Vagner Guidotti Furtado (1).pdf: 2942442 bytes, checksum: a43c18ecb28456284d4b6c622f11210d (MD5)
Previous issue date: 2017-12-07 / The division operation in digital systems has its relevance because it is a necessary
function in several applications, such as general purpose processors, digital signal processors
and microcontrollers. The digital divider circuit is of great architectural complexity and may
occupy a considerable area in the design of an integrated circuit, and as a consequence may
have a great influence on the static and dynamic power dissipation of the circuit as a whole. In
relation to the application of dividing circuits in circuits of the Digital Signal Processing
(DSP) area, adaptive filters have a particular appeal, especially when using algorithms that
perform a normalization in the input signals. In view of the above, this work focuses on the
proposition of algorithms, techniques for reducing energy consumption and logical area,
proposition and implementation of efficient dividing circuit architectures for use in adaptive
filters. The Newton-Raphson and Goldschmidt iterative dividing circuits both operating at
fixed-point were specifically addressed. The results of the synthesis of the implemented
architectures of the divisors with the proposed algorithms and techniques showed
considerable reduction of power and logical area of the circuits. In particular, the dividing
circuits were applied in adaptive filter architectures based on the NLMS (Normalized least
Mean Square) algorithm, seeking to add to these filters, characteristics of good convergence
speed, combined with the improvement in energy efficiency. The adaptive filters
implemented are used in the case study of harmonic cancellation on electrocardiogram
signals / A operação de divisão em sistemas digitais tem sua relevância por se tratar de uma
função necessária em diversas aplicações, tais como processadores de propósito geral,
processadores digitais de sinais e microcontroladores. O circuito divisor digital é de grande
complexidade arquitetural, podendo ocupar uma área considerável no projeto de um circuito
integrado, e por consequência pode ter uma grande influência na dissipação de potência
estática e dinâmica do circuito como um todo. Em relação à aplicação de circuitos divisores
em circuitos da área DSP (Digital Signal Processing), os filtros adaptativos têm um particular
apelo, principalmente quando são utilizados algoritmos que realizam uma normalização nos
sinais de entrada. Diante do exposto, este trabalho foca na proposição de algoritmos, técnicas
de redução de consumo de energia e área lógica, proposição e implementação de arquiteturas
de circuitos divisores eficientes para utilização em filtros adaptativos. Foram abordados em
específico os circuitos divisores iterativos Newton-Raphson e Goldschmidt ambos operando
em ponto-fixo. Os resultados da síntese das arquiteturas implementadas dos divisores com os
algoritmos e técnicas propostas mostraram considerável redução de potência e área lógica dos
circuitos. Em particular, os circuitos divisores foram aplicados em arquiteturas de filtros
adaptativos baseadas no algoritmo NLMS (Normalized least Mean Square), buscando agregar
a esses filtros, características de boa velocidade de convergência, aliada à melhoria na
eficiência energética. Os filtros adaptativos implementados são utilizados no estudo de caso
de cancelamento de harmônicas em sinais de eletrocardiograma (ECG)
|
74 |
Channel Compensation for Speaker Recognition SystemsNeville, Katrina Lee, katrina.neville@rmit.edu.au January 2007 (has links)
This thesis attempts to address the problem of how best to remedy different types of channel distortions on speech when that speech is to be used in automatic speaker recognition and verification systems. Automatic speaker recognition is when a person's voice is analysed by a machine and the person's identity is worked out by the comparison of speech features to a known set of speech features. Automatic speaker verification is when a person claims an identity and the machine determines if that claimed identity is correct or whether that person is an impostor. Channel distortion occurs whenever information is sent electronically through any type of channel whether that channel is a basic wired telephone channel or a wireless channel. The types of distortion that can corrupt the information include time-variant or time-invariant filtering of the information or the addition of 'thermal noise' to the information, both of these types of distortion can cause varying degrees of error in information being received and analysed. The experiments presented in this thesis investigate the effects of channel distortion on the average speaker recognition rates and testing the effectiveness of various channel compensation algorithms designed to mitigate the effects of channel distortion. The speaker recognition system was represented by a basic recognition algorithm consisting of: speech analysis, extraction of feature vectors in the form of the Mel-Cepstral Coefficients, and a classification part based on the minimum distance rule. Two types of channel distortion were investigated: Convolutional (or lowpass filtering) effects Addition of white Gaussian noise Three different methods of channel compensation were tested: Cepstral Mean Subtraction (CMS) RelAtive SpecTrAl (RASTA) Processing Constant Modulus Algorithm (CMA) The results from the experiments showed that for both CMS and RASTA processing that filtering at low cutoff frequencies, (3 or 4 kHz), produced improvements in the average speaker recognition rates compared to speech with no compensation. The levels of improvement due to RASTA processing were higher than the levels achieved due to the CMS method. Neither the CMS or RASTA methods were able to improve accuracy of the speaker recognition system for cutoff frequencies of 5 kHz, 6 kHz or 7 kHz. In the case of noisy speech all methods analysed were able to compensate for high SNR of 40 dB and 30 dB and only RASTA processing was able to compensate and improve the average recognition rate for speech corrupted with a high level of noise (SNR of 20 dB and 10 dB).
|
75 |
Segmentation of Carotid Arteries from 3D and 4D Ultrasound Images / Segmentering av halsartärer från 3D och 4D ultraljudsbilderMattsson, Per, Eriksson, Andreas January 2002 (has links)
This thesis presents a 3D semi-automatic segmentation technique for extracting the lumen surface of the Carotid arteries including the bifurcation from 3D and 4D ultrasound examinations. Ultrasound images are inherently noisy. Therefore, to aid the inspection of the acquired data an adaptive edge preserving filtering technique is used to reduce the general high noise level. The segmentation process starts with edge detection with a recursive and separable 3D Monga-Deriche-Canny operator. To reduce the computation time needed for the segmentation process, a seeded region growing technique is used to make an initial model of the artery. The final segmentation is based on the inflatable balloon model, which deforms the initial model to fit the ultrasound data. The balloon model is implemented with the finite element method. The segmentation technique produces 3D models that are intended as pre-planning tools for surgeons. The results from a healthy person are satisfactory and the results from a patient with stenosis seem rather promising. A novel 4D model of wall motion of the Carotid vessels has also been obtained. From this model, 3D compliance measures can easily be obtained.
|
76 |
Subband Adaptive Filtering Algorithms And ApplicationsSridharan, M K 06 1900 (has links)
In system identification scenario, the linear approximation of the system modelled by its impulse response, is estimated in real time by gradient type Least Mean Square (LMS) or Recursive Least Squares (RLS) algorithms. In recent applications like acoustic echo cancellation, the order of the impulse response to be estimated is very high, and these traditional approaches are inefficient and real time implementation becomes difficult. Alternatively, the system is modelled by a set of shorter adaptive filters operating in parallel on subsampled signals. This approach, referred to as subband adaptive filtering, is expected to reduce not only the computational complexity but also to improve the convergence rate of the adaptive algorithm. But in practice, different subband adaptive algorithms have to be used to enhance the performance with respect to complexity, convergence rate and processing delay. A single subband adaptive filtering algorithm which outperforms the full band scheme in all applications is yet to be realized.
This thesis is intended to study the subband adaptive filtering techniques and explore the possibilities of better algorithms for performance improvement. Three different subband adaptive algorithms have been proposed and their performance have been verified through simulations. These algorithms have been applied to acoustic echo cancellation and EEG artefact minimization problems.
Details of the work
To start with, the fast FIR filtering scheme introduced by Mou and Duhamel has been generalized. The Perfect Reconstruction Filter Bank (PRFB) is used to model the linear FIR system. The structure offers efficient implementation with reduced arithmetic complexity. By using a PRFB with non adjacent filters non overlapping, many channel filters can be eliminated from the structure. This helps in reducing the complexity of the structure further, but introduces approximation in the model. The modelling error depends on the stop band attenuation of the filters of the PRFB. The error introduced due to approximation is tolerable
for applications like acoustic echo cancellation.
The filtered output of the modified generalized fast filtering structure is given by
(formula)
where, Pk(z) is the main channel output, Pk,, k+1 (z) is the output of auxiliary channel filters at the reduced rate, Gk (z) is the kth synthesis filter and M the number of channels in the PRFB. An adaptation scheme is developed for adapting the main channel filters. Auxiliary channel filters are derived from main channel filters.
Secondly, the aliasing problem of the classical structure is reduced without using the cross filters. Aliasing components in the estimated signal results in very poor steady state performance in the classical structure. Attempts to eliminate the aliasing have reduced the computation gain margin and the convergence rate. Any attempt to estimate the subband reference signals from the aliased subband input signals results in aliasing. The analysis filter Hk(z) having the following antialiasing property
(formula)
can avoid aliasing in the input subband signal. The asymmetry of the frequency response prevents the use of real analysis filters. In the investigation presented in this thesis, complex analysis filters and real'synthesis filters are used in the classical structure, to reduce the aliasing errors and to achieve superior convergence rate.
PRFB is traditionally used in implementing Interpolated FIR (IFIR) structure. These filters may not be ideal for processing an input signal for an adaptive algorithm. As third contribution, the IFIR structure is modified using discrete finite frames. The model of an FIR filter s is given by Fc, with c = Hs. The columns of the matrix F forms a frame with rows of H as its dual frame. The matrix elements can be arbitrary except that the transformation should be implementable as a filter bank. This freedom is used to optimize the filter bank, with the knowledge of the input statistics, for initial convergence rate enhancement .
Next, the proposed subband adaptive algorithms are applied to acoustic echo cancellation problem with realistic parameters. Speech input and sufficiently long Room Impulse Response (RIR) are used in the simulations. The Echo Return Loss Enhancement (ERLE)and the steady state error spectrum are used as performance measures to compare these algorithms with the full band scheme and other representative subband implementations.
Finally, Subband adaptive algorithm is used in minimization of EOG (Electrooculogram) artefacts from measured EEG (Electroencephalogram) signal. An IIR filterbank providing sufficient isolation between the frequency bands is used in the modified IFIR structure and this structure has been employed in the artefact minimization scheme. The estimation error in the high frequency range has been reduced and the output signal to noise ratio has been increased by a couple of dB over that of the fullband scheme.
Conclusions
Efforts to find elegant Subband adaptive filtering algorithms will continue in the future. However, in this thesis, the generalized filtering algorithm could offer gain in filtering complexity of the order of M/2 and reduced misadjustment . The complex classical scheme offered improved convergence rate, reduced misadjustment and computational gains of the order of M/4 . The modifications of the IFIR structure using discrete finite frames made it possible to eliminate the processing delay and enhance the convergence rate. Typical performance of the complex classical case for speech input in a realistic scenario (8 channel case), offers ERLE of more than 45dB. The subband approach to EOG artefact minimization in EEG signal was found to be superior to their fullband counterpart.
(Refer PDF file for Formulas)
|
77 |
Segmentation of Carotid Arteries from 3D and 4D Ultrasound Images / Segmentering av halsartärer från 3D och 4D ultraljudsbilderMattsson, Per, Eriksson, Andreas January 2002 (has links)
<p>This thesis presents a 3D semi-automatic segmentation technique for extracting the lumen surface of the Carotid arteries including the bifurcation from 3D and 4D ultrasound examinations. </p><p>Ultrasound images are inherently noisy. Therefore, to aid the inspection of the acquired data an adaptive edge preserving filtering technique is used to reduce the general high noise level. The segmentation process starts with edge detection with a recursive and separable 3D Monga-Deriche-Canny operator. To reduce the computation time needed for the segmentation process, a seeded region growing technique is used to make an initial model of the artery. The final segmentation is based on the inflatable balloon model, which deforms the initial model to fit the ultrasound data. The balloon model is implemented with the finite element method. </p><p>The segmentation technique produces 3D models that are intended as pre-planning tools for surgeons. The results from a healthy person are satisfactory and the results from a patient with stenosis seem rather promising. A novel 4D model of wall motion of the Carotid vessels has also been obtained. From this model, 3D compliance measures can easily be obtained.</p>
|
78 |
Αποδοτικές τεχνικές προσαρμοστικής ισοστάθμισης διαύλου βασισμένες στη μέθοδο Conjugate Gradient / Efficient techniques for channel equalization based on the Conjugate Gradient methodΛάλος, Αριστείδης 16 May 2007 (has links)
Η χρήση επαναληπτικών τεχνικών προσαρμοστικής ισοστάθμισης διαύλου αποτελεί μια σχετικά πρόσφατη και πολλά υποσχόμενη μέθοδο αντιμετώπισης του φαινομένου της διασυμβολικής παρεμβολής που εισάγεται από το κανάλι λόγω του φαινομένου της πολυδιόδευσης. Ο αλγόριθμος που έχει επικρατήσει στις περισσότερες προσαρμοστικές εφαρμογές είναι ο ελαχίστων μέσων τετραγώνων (LMS). Διακρίνεται για την απλότητά του, έχει όμως φτωχές ιδιότητες σύγκλισης. Η μέθοδος των αναδρομικών ελαχίστων τετραγώνων (RLS) είναι επίσης αρκετά διαδεδομένη και κατέχει υπερέχουσες ιδιότητες σύγκλισης. Ωστόσο παρουσιάζει μεγάλη υπολογιστική πολυπλοκότητα και αυξημένες απαιτήσεις σε μνήμη. Στα πλαίσια της εργασίας αυτής εγίνε μια προσπάθεια ανάλυσης των τεχνικών που βασίζονται στη μέθοδο των συζυγών παραγώγων (Conjugate Gradient), χρησιμοποιούνται σε προβλήματα προσαρμοστικού φιλτραρίσματος και πιο ειδικά στο πρόβλημα της προσαρμοστικής ισοστάθμισης διαύλου. Οι τεχνικές αυτές επεξεργάζονται τα δεδομένα και ανά μπλοκ. Είναι ικανές να παρέχουν ιδιότητες σύγκλισης συγκρίσιμες με αυτές της (RLS) μεθόδου, εισάγοντας υπολογιστική πολυπλοκότητα ενδιάμεσων απαιτήσεων μεταξύ των μεθόδων LMS και RLS χωρίς να παρουσιάζουν προβλήματα αριθμητικής ευστάθειας. / The use of iteration methods for adaptive equalization has received considerable attention during the past several decades. The Least Mean Squares (LMS) method, which has found widespread use owing to its simplicity, has poor convergence properties. The Recursive Least Squares (RLS) method possess superior convergence properties, but it is computationally intensive and has high storage requirements for matrix manipulations. In this MSc thesis the technique of conjugate gradients is applied for the adaptive filtering problem. Conjugate gradient algorithms for adaptive filtering applications suitable for efficient implementation has been developed and has been applied for the design of an adaptive transversal equalizer. Low cost block algorithms using the preconditioned conjugate gradient method are also discussed. The algorithms are capable of providing convergence comparable to RLS schemes at a computational complexity between the LMS and the RLS methods and does not suffer from any known instability problems.
|
79 |
Kalman filtering for computer music applicationsBenning, Manjinder 27 August 2007 (has links)
This thesis discusses the use of Kalman filtering for noise reduction in a 3-D gesture-
based computer music controller known as the Radio Drum and for real-time tempo
tracking of rhythmic and melodic musical performances. The Radio Drum noise
reduction Kalman filter is designed based on previous research in the field of target
tracking for radar applications and prior knowledge of a drummer’s expected gestures
throughout a performance. In this case we are seeking to improve the position
estimates of a drum stick in order to enhance the expressivity and control of the
instrument by the performer. Our approach to tempo tracking is novel in that a multi-
modal approach combining gesture sensors and audio in a late fusion stage lead to
higher accuracy in the tempo estimates.
|
80 |
Algoritmos set-membership para equalização autodidata aplicados a redes de sensores sem fioAssis, Fábio Ferreira de January 2018 (has links)
Orientadora: Profa. Dra. Aline de Oliveira Neves Panazio / Dissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Engenharia da Informação, Santo André, 2018. / Este trabalho dedica-se ao estudo de algoritmos de filtragem adaptativa autodidata no modo difusão, com aplicações em redes de sensores sem fio (RSSF). No modo difusão, os nós sensores da rede possuem poder de processamento local e trocam informações com seus vizinhos. Neste trabalho, propomos dois algoritmos utilizando como base o algoritmo CMA no modo Difusão (CMAD), com duas abordagens distintas da técnica Set-Membership. O primeiro baseia-se no algoritmo Set-Membership Least Mean Squares (SM-LMS), desenvolvido também no modo difusão. Estendemos o algoritmo para o contexto não supervisionado, denotando por Algoritmo Set-Membership CMA no modo Difusão (SM-CMAD). Mostramos que este algoritmo apresenta desempenho melhor ou similar ao CMAD, em termos de velocidade de convergência, patamar de interferência intersimbólica (IIS) e possuindo a importante vantagem de reduzir as trocas de informações entre os nós, economizando energia e recursos da rede. O segundo algoritmo proposto se baseia no Set-Membership do Módulo Constante (SM-CM), o qual estendemos para o contexto de redes de sensores sem fio no modo difusão. Tal algoritmo é denotado por Algoritmo Set-membership CMA no modo Difusão Square-root Gamma (SM-CMAD-SG). Novamente o algoritmo apresenta um bom desempenho quando comparado com o CMAD e, quando comparado ao SM-CMAD, vemos que sua principal vantagem está na economia em termos de atualizações dos coeficientes do filtro, que chega a valores acima de 70% em diversos cenários de simulação, sem grandes perdas de desempenho economizando energia. / This work is devoted to the study of unsupervised adaptive filtering algorithms in diffusion mode, with applications in wireless sensor networks (WSNs). In diffusion mode, network sensing nodes have local processing power and exchange information with their neighbors. In this work, we propose two algorithms based on the CMA algorithm in Diffusion mode (CMAD), with two different approaches to the Set-Membership technique. The first one is based on the Set-Membership Least Mean Squares (SM-LMS) algorithm, also developed in the diffusion mode. We extend the algorithm to the unsupervised context, denoting by Set-Membership CMA in Diffusion mode (SM-CMAD). We show that this algorithm presents better or similar performance to CMAD, in terms of convergence speed, intersymbol interference threshold (IIS), and has the important advantage of reducing the exchange of information between nodes, saving energy and network resources. The second proposed algorithm is based on the Set-Membership of the Constant Modulus (SM-CM), which we extend to the context of wireless sensor networks in the diffusion mode. This algorithm is denoted by the Set-membership CMA in Diffusion mode Square-root Gamma (SM-CMAD-SG). This algorithm performs well when compared to CMAD and, when compared to SM-CMAD, we see that its main advantage lies in the economy in terms of the update of the filter coefficients, which reaches values above 70% in several scenarios without loss of performance, saving energy.
|
Page generated in 0.0585 seconds