Hamid Abrishami Moghaddam
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hamid Abrishami Moghaddam has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Mohamad Forouzanfar
Université du Québec
2 shared publications - Youness Aliyari Ghassabeh
Electrical Engineering Department, K. N. Toosi University of Technology, Tehran, Iran
2 shared publications - A.H. Rouhi
AZAD University, Science & Research Unit, P.O. Box 19395-3755, Tehran, Iran
1 shared publication Hadi Farzin
Department of Electrical Engineering, K.N. Toosi University of Technology
1 shared publication- Kh. Amiri Zadeh
Department of Computer Engineering Islamic Azad University Branch of Garmsar Semnan Iran
1 shared publication - M. Matinfar
Biomedical Engineering Group, Department of Electrical Engineering, K.N. Toosi University of Technology, Seyed Khandan, P.O. Box 16315-1355, Tehran, Iran
1 shared publication
Latest Publications
- Open Access
- 9 April 2008
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2008 (1) , 280635
A Novel Retinal Identification System
- 9 April 2008
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2008 (1) , 280635
Open AccessA Novel Retinal Identification System
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2007 IEEE International Conference on Control Applications
- No. 10851992,p. 491-496
Incremental Feature Extraction from Gaussian Data using Neural Networks
In this paper, we present new self-organized networks to extract optimal features from multidimensional Gaussian data while preserving class separability. For this purpose, we introduce new adaptive algorithms for the computation of the square root of the inverse covariance matrix Sigma-1/2. Then we construct self-organized networks based on the proposed algorithms and use them for optimal feature extraction from Gaussian data. Convergence proof of the proposed algorithms and networks is given by introducing the related cost function and discussion about its properties. Adaptive nature of the new feature extraction method makes it appropriate for on-line pattern recognition applications. Experimental results using two-class multidimensional Gaussian data demonstrated the effectiveness of the new adaptive feature extraction method.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2007 IEEE International Conference on Control Applications
- No. 10851992,p. 491-496
Incremental Feature Extraction from Gaussian Data using Neural Networks
In this paper, we present new self-organized networks to extract optimal features from multidimensional Gaussian data while preserving class separability. For this purpose, we introduce new adaptive algorithms for the computation of the square root of the inverse covariance matrix Sigma-1/2. Then we construct self-organized networks based on the proposed algorithms and use them for optimal feature extraction from Gaussian data. Convergence proof of the proposed algorithms and networks is given by introducing the related cost function and discussion about its properties. Adaptive nature of the new feature extraction method makes it appropriate for on-line pattern recognition applications. Experimental results using two-class multidimensional Gaussian data demonstrated the effectiveness of the new adaptive feature extraction method.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Speckle Reduction in Medical Ultrasound Images using a New Multiscale Bivariate Bayesian MMSE-Based Method
This paper introduces a new wavelet-based speckle reduction method for medical ultrasound images, which extends a recently emerged homomorphic Bayesian technique. The new method exploits interscale dependency of wavelet coefficients. For this purpose, bivariate alpha-stable distributions are proposed, which are able to better capture the heavy-tailed nature of the data. Using this new statistical model, we design a bivariate Bayesian estimator to effectively remove speckle from wavelet coefficients. Better results are obtained using the oriented two-dimensional dual-tree complex wavelet transform (2D DTCWT) which offers improved directional selectivity and near shift invariance property. To assess the performance of the proposed method, results are compared with some related earlier techniques. Both numerical and visual comparisons indicate improved speckle reduction while preserving structural features, as desired for better diagnosis in medical images.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Speckle Reduction in Medical Ultrasound Images using a New Multiscale Bivariate Bayesian MMSE-Based Method
This paper introduces a new wavelet-based speckle reduction method for medical ultrasound images, which extends a recently emerged homomorphic Bayesian technique. The new method exploits interscale dependency of wavelet coefficients. For this purpose, bivariate alpha-stable distributions are proposed, which are able to better capture the heavy-tailed nature of the data. Using this new statistical model, we design a bivariate Bayesian estimator to effectively remove speckle from wavelet coefficients. Better results are obtained using the oriented two-dimensional dual-tree complex wavelet transform (2D DTCWT) which offers improved directional selectivity and near shift invariance property. To assess the performance of the proposed method, results are compared with some related earlier techniques. Both numerical and visual comparisons indicate improved speckle reduction while preserving structural features, as desired for better diagnosis in medical images.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 291-296
A Face Recognition System using Neural Networks with Incremental Learning Ability
In this paper, we present a new incremental face recognition (IFR) system based on new adaptive learning algorithms and networks. We introduce new adaptive linear discriminant analysis (LDA) algorithm and related network for optimal facial feature extraction and use them to construct a new IFR system. Convergence proof of all algorithms is given using an appropriate cost function and discussing about its initial conditions. Application of the new IFR on feature extraction from facial image sequences is given in two steps: i) image preprocessing, which includes normalization, histogram equalization, mean centering and background removal, ii) adaptive LDA feature estimation. In the preprocessing stage, all input images are cropped and prepared for the next step. Outputs of the preprocessing stage are used as a sequence of inputs for IFR system. The proposed system was tested on YALE face database. Experimental results on this database demonstrated the effectiveness of the proposed system for adaptive estimation of the feature space for online face recognition.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 291-296
A Face Recognition System using Neural Networks with Incremental Learning Ability
In this paper, we present a new incremental face recognition (IFR) system based on new adaptive learning algorithms and networks. We introduce new adaptive linear discriminant analysis (LDA) algorithm and related network for optimal facial feature extraction and use them to construct a new IFR system. Convergence proof of all algorithms is given using an appropriate cost function and discussing about its initial conditions. Application of the new IFR on feature extraction from facial image sequences is given in two steps: i) image preprocessing, which includes normalization, histogram equalization, mean centering and background removal, ii) adaptive LDA feature estimation. In the preprocessing stage, all input images are cropped and prepared for the next step. Outputs of the preprocessing stage are used as a sequence of inputs for IFR system. The proposed system was tested on YALE face database. Experimental results on this database demonstrated the effectiveness of the proposed system for adaptive estimation of the feature space for online face recognition.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 279-284
Self Organized Networks for Optimal Feature Extraction
In this paper, we introduced new adaptive learning algorithms and related networks to extract optimal features from multidimensional data in order to reduce the data dimensionality while preserving class separability. For this purpose, new adaptive algorithms for the computation of the square root of the inverse covariance matrix Sigma-1/2 are introduced. We introduce a new cost function related to the given adaptive learning algorithms in order to prove their convergence. Self organized Sigma-1/2 networks are constructed based on these algorithms. By cascading Sigma-1/2 network and an adaptive principal component analysis (APCA) network, we present new adaptive self organized LDA feature extraction network. Adaptive nature of the new optimal feature extraction method makes it appropriate for on-line incremental pattern classification and machine learning applications. Both networks in the proposed structure are trained simultaneously, using a stream of input data. Existence of cost function, make it available to compute learning rate efficiently in every iteration in order to increase the convergence rate. Experimental results using synthetic multi-class multi-dimensional sequence of data, demonstrated the effectiveness of the new adaptive self organized feature extraction networks.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 279-284
Self Organized Networks for Optimal Feature Extraction
In this paper, we introduced new adaptive learning algorithms and related networks to extract optimal features from multidimensional data in order to reduce the data dimensionality while preserving class separability. For this purpose, new adaptive algorithms for the computation of the square root of the inverse covariance matrix Sigma-1/2 are introduced. We introduce a new cost function related to the given adaptive learning algorithms in order to prove their convergence. Self organized Sigma-1/2 networks are constructed based on these algorithms. By cascading Sigma-1/2 network and an adaptive principal component analysis (APCA) network, we present new adaptive self organized LDA feature extraction network. Adaptive nature of the new optimal feature extraction method makes it appropriate for on-line incremental pattern classification and machine learning applications. Both networks in the proposed structure are trained simultaneously, using a stream of input data. Existence of cost function, make it available to compute learning rate efficiently in every iteration in order to increase the convergence rate. Experimental results using synthetic multi-class multi-dimensional sequence of data, demonstrated the effectiveness of the new adaptive self organized feature extraction networks.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A Directional Multiscale Approach for Speckle Reduction in Optical Coherence Tomography Images
This paper presents a new directional Bayesian despeckling technique for optical coherence tomography (OCT) images in the complex wavelet domain, which reduces speckle while preserving the detailed features and textural information. It has been shown that wavelet coefficients of natural images have significantly non-Gaussian statistics that are best described by families of heavy-tailed distributions. On the other hand, most of the edge information of layer boundaries in OCT images is located in the same direction. For these directional images, the use of heavy-tailed distributions does not seem to be appropriate for all wavelet decomposition subbands. So wavelet coefficients of the subbands which have almost the same orientation as the original image are modeled with heavy-tailed distributions such as the Cauchy, while the others are modeled with a simple Gaussian distribution. Within this framework, we design a maximum a posteriori estimator to remove speckle from noisy coefficients. Better results are obtained when we use the dual-tree complex wavelet transform which offers improved directional selectivity and near shift invariance property. Our results show that the proposed scheme outperforms some existing despeckling methods.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A Directional Multiscale Approach for Speckle Reduction in Optical Coherence Tomography Images
This paper presents a new directional Bayesian despeckling technique for optical coherence tomography (OCT) images in the complex wavelet domain, which reduces speckle while preserving the detailed features and textural information. It has been shown that wavelet coefficients of natural images have significantly non-Gaussian statistics that are best described by families of heavy-tailed distributions. On the other hand, most of the edge information of layer boundaries in OCT images is located in the same direction. For these directional images, the use of heavy-tailed distributions does not seem to be appropriate for all wavelet decomposition subbands. So wavelet coefficients of the subbands which have almost the same orientation as the original image are modeled with heavy-tailed distributions such as the Cauchy, while the others are modeled with a simple Gaussian distribution. Within this framework, we design a maximum a posteriori estimator to remove speckle from noisy coefficients. Better results are obtained when we use the dual-tree complex wavelet transform which offers improved directional selectivity and near shift invariance property. Our results show that the proposed scheme outperforms some existing despeckling methods.
- 19 December 2006
- Published by Elsevier in Pattern Recognition Letters
- Vol. 28 (5) , 613-621
Fast adaptive LDA using quasi-Newton algorithm
- 19 December 2006
- Published by Elsevier in Pattern Recognition Letters
- Vol. 28 (5) , 613-621
Fast adaptive LDA using quasi-Newton algorithm
- 1 August 2005
- Published by Elsevier in Pattern Recognition
- Vol. 38 (12) , 2506-2518
Wavelet correlogram: A new approach for image indexing and retrieval
- 1 August 2005
- Published by Elsevier in Pattern Recognition
- Vol. 38 (12) , 2506-2518
Wavelet correlogram: A new approach for image indexing and retrieval
- 31 August 2003
- Published by Elsevier in Pattern Recognition
- Vol. 36 (8) , 1695-1702
Fast adaptive algorithms and networks for class-separability features
- 31 August 2003
- Published by Elsevier in Pattern Recognition
- Vol. 36 (8) , 1695-1702
Fast adaptive algorithms and networks for class-separability features