Pedro de A. Berger

Pedro de A. Berger

Auto-generated profile, based on publicly available information

Pedro de A. Berger

Computer Science Department, University of Brasília, Brasília, Brazil

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 March 2006 in Physiological Measurement
Verified
Journal Article
Closed access
PBPedro de A Berger
Pedro de A Berger
FNFrancisco A de O Nascimento
Francisco A de O Nascimento
JCJake C Do Carmo
Jake C Do Carmo
ARAdson Ferreira da Rocha
Adson Ferreira da Rocha
This paper presents a hybrid adaptive algorithm for the compression of surface electromyographic (S-EMG) signals recorded during isometric and/or isotonic contractions. This technique is useful for minimizing data storage and transmission requirements for applications where multiple channels with high bandwidth data are digitized, such as telemedicine applications. The compression algorithm proposed in this work uses a discrete wavelet transform for spectral decomposition and an intelligent dynamic bit allocation scheme implemented by an approach using the Kohonen layer, which improves the bit allocation for sections of the S-EMG with different characteristics. Finally, data and overhead information are packed by entropy coding. The results for the compression of isometric EMG signals showed that this algorithm has a better performance than standard wavelet compression algorithms presented in the literature (presenting a decrease of at least 5% in per cent residual difference (PRD) for the same compression ratio), and a performance that is comparable with the performance of algorithms based on an embedded zero-tree wavelet. For isotonic EMG signals, its performance is better than the performance of the algorithms based on embedded zero-tree wavelets (presenting a decrease in PRD of about 3.6% for the same compression ratios, in the useful compression range).

15 January 2010 in BioMedical Engineering OnLine
Verified
Journal Article
Open access
PDF file
SMSalvador A MeloJúnior
Salvador A MeloJúnior
BMBruno Macchiavello
Bruno Macchiavello
MAMarcelino M Andrade
Marcelino M Andrade
JCJoão LA Carvalho
João LA Carvalho
HCHervaldo Carvalho
Hervaldo Carvalho
FNFrancisco Ao Nascimento
Francisco Ao Nascimento
Background: Two-dimensional echocardiography (2D-echo) allows the evaluation of cardiac structures and their movements. A wide range of clinical diagnoses are based on the performance of the left ventricle. The evaluation of myocardial function is typically performed by manual segmentation of the ventricular cavity in a series of dynamic images. This process is laborious and operator dependent. The automatic segmentation of the left ventricle in 4-chamber long-axis images during diastole is troublesome, because of the opening of the mitral valve. Methods: This work presents a method for segmentation of the left ventricle in dynamic 2D-echo 4-chamber long-axis images over the complete cardiac cycle. The proposed algorithm is based on classic image processing techniques, including time-averaging and wavelet-based denoising, edge enhancement filtering, morphological operations, homotopy modification, and watershed segmentation. The proposed method is semi-automatic, requiring a single user intervention for identification of the position of the mitral valve in the first temporal frame of the video sequence. Image segmentation is performed on a set of dynamic 2D-echo images collected from an examination covering two consecutive cardiac cycles. Results: The proposed method is demonstrated and evaluated on twelve healthy volunteers. The results are quantitatively evaluated using four different metrics, in a comparison with contours manually segmented by a specialist, and with four alternative methods from the literature. The method's intra- and inter-operator variabilities are also evaluated. Conclusions: The proposed method allows the automatic construction of the area variation curve of the left ventricle corresponding to a complete cardiac cycle. This may potentially be used for the identification of several clinical parameters, including the area variation fraction. This parameter could potentially be used for evaluating the global systolic function of the left ventricle.

1 August 2007 in 2018 40th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)
Verified
Conference Paper
Closed access
PBPedro de A. Berger
Pedro de A. Berger
FNFrancisco A. de O. Nascimento
Francisco A. de O. Nascimento
ARAdson Ferreira da Rocha
Adson Ferreira da Rocha
JCJoao L. A. Carvalho
Joao L. A. Carvalho
Despite the growing interest in the transmission and storage of electromyographic signals for long periods of time, only a few studies dealt with the compression of these signals. In this article we propose a novel algorithm for EMG signal compression using the wavelet transform. For EMG signals acquired during isometric contractions, the proposed algorithm provided compression factors ranging from 50 to 90%, with an average PRD ranging from 1.4 to 7.5%. The proposed method uses a new scheme for normalizing the wavelet coefficients. The wavelet coefficients are quantized using dynamic bit allocation, which is carried out by a Kohonen Neural Network. After the quantization, these coefficients are encoded using an arithmetic encoder. The compression results using the proposed algorithm were compared to other algorithms based on the wavelet transform. The proposed algorithm had a better performance in compression ratio and fidelity of the reconstructed signal.

1 January 2013 in BioMedical Engineering OnLine
Verified
Journal Article
Open access
PDF file
GCGuillermo A Camacho
Guillermo A Camacho
CLCarlos Humberto Llanos
Carlos Humberto Llanos
PBPedro A Berger
Pedro A Berger
CMCristiano Jacques Miosso
Cristiano Jacques Miosso
ARAdson Ferreira da Rocha
Adson Ferreira da Rocha
The information of electromyographic signals can be used by Myoelectric Control Systems (MCSs) to actuate prostheses. These devices allow the performing of movements that cannot be carried out by persons with amputated limbs. The state of the art in the development of MCSs is based on the use of individual principal component analysis (iPCA) as a stage of pre-processing of the classifiers. The iPCA pre-processing implies an optimization stage which has not yet been deeply explored. The present study considers two factors in the iPCA stage: namely A (the fitness function), and B (the search algorithm). The A factor comprises two levels, namely A1 (the classification error) and A2 (the correlation factor). Otherwise, the B factor has four levels, specifically B1 (the Sequential Forward Selection, SFS), B2 (the Sequential Floating Forward Selection, SFFS), B3 (Artificial Bee Colony, ABC), and B4 (Particle Swarm Optimization, PSO). This work evaluates the incidence of each one of the eight possible combinations between A and B factors over the classification error of the MCS. A two factor ANOVA was performed on the computed classification errors and determined that: (1) the interactive effects over the classification error are not significative (F0.01,3,72 = 4.0659 > f AB = 0.09), (2) the levels of factor A have significative effects on the classification error (F0.02,1,72 = 5.0162 < f A = 6.56), and (3) the levels of factor B over the classification error are not significative (F0.01,3,72 = 4.0659 > f B = 0.08). Considering the classification performance we found a superiority of using the factor A2 in combination with any of the levels of factor B. With respect to the time performance the analysis suggests that the PSO algorithm is at least 14 percent better than its best competitor. The latter behavior has been observed for a particular configuration set of parameters in the search algorithms. Future works will investigate the effect of these parameters in the classification performance, such as length of the reduced size vector, number of particles and bees used during optimal search, the cognitive parameters in the PSO algorithm as well as the limit of cycles to improve a solution in the ABC algorithm.