Mohammad Haghighat
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mohammad Haghighat has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Mohamed Abdel-Mottaleb
Electrical and Computer Engineering, University of Miami, Florida
7 shared publicationsEhsan Namjoo
Dept. of Engineering, Shahid Chamran University of Ahvaz, Ahvaz, Iran
4 shared publications- Ali Aghagolzadeh
Faculty of Electrical and Computer Engineering, Babol Noshirvani University of Technology, Babol, Iran
3 shared publications - Hadi Seyedarabi
Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, Iran
3 shared publications - Wadee Alhalabi
Department of Computer Science, Immersive Virtual Reality Research Group, King Abdulaziz University, Jeddah, Saudi Arabia
3 shared publications Saman Zonouz
Department of Electrical and Computer Engineering, Rutgers University, Piscataway, NJ 08854, USA
2 shared publications
Latest Publications
- 1 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1589-1594
Assessing the Effect of Image Quality on SSD and Faster R-CNN Networks for Face Detection
Face detection is one of the most challenging and long-studied areas in computer vision. In real-world, images are exposed to the noise and degradation. In this paper, we investigate the robustness of two networks namely SSD and Faster R-CNN in confrontation with salt and pepper noise, Gaussian blur, as well as JPEG compression. Our experiments are conducted on the well-known Wider Face dataset. These experiments show that the Faster R-CNN is more robust against Gaussian blur, while SSD is much more sensitive to the edges. On the other hand, SSD is more robust against reduced-quality JPEG compressed images. The reason should be due to the sensitivity of Faster R-CNN to the texture of the objects. Moreover, our experiments demonstrated that both networks have a relatively similar resistance under salt and pepper noise.
- 1 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1589-1594
Assessing the Effect of Image Quality on SSD and Faster R-CNN Networks for Face Detection
Face detection is one of the most challenging and long-studied areas in computer vision. In real-world, images are exposed to the noise and degradation. In this paper, we investigate the robustness of two networks namely SSD and Faster R-CNN in confrontation with salt and pepper noise, Gaussian blur, as well as JPEG compression. Our experiments are conducted on the well-known Wider Face dataset. These experiments show that the Faster R-CNN is more robust against Gaussian blur, while SSD is much more sensitive to the edges. On the other hand, SSD is more robust against reduced-quality JPEG compressed images. The reason should be due to the sensitivity of Faster R-CNN to the texture of the objects. Moreover, our experiments demonstrated that both networks have a relatively similar resistance under salt and pepper noise.
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3198-3203
Kernel Discriminant Correlation Analysis: Feature Level Fusion for Nonlinear Biometric Recognition
In biometric recognition, feature fusion is an important area of research due to the fact that multiple types of features contain richer and complementary information. Discriminative Correlation Analysis (DCA) is a recently proposed feature fusion method, which incorporates the class association into correlation analysis so that the features not only have the maximum intrinsic correlation between feature sets but also have class structure information. However, DCA is a linear technique, that finds a linear transformation of the original space. For highly nonlinearly distributed data, classification with nonlinear techniques works better than the linear ones. In this paper, we propose Kernel-DCA which generalizes DCA in order to handle nonlinear problems. Similar to Kernel-SVM, Kernel-DCA utilizes a kernel method to map feature sets to a high-dimensional space in which features are linearly separable. Experimental results, for the fusion of ear and face feature, using the WVU database with large variations in pose, show that Kernel-DCA achieves better results on nonlinearly distributed data than DCA and other feature fusion methods.
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3198-3203
Kernel Discriminant Correlation Analysis: Feature Level Fusion for Nonlinear Biometric Recognition
In biometric recognition, feature fusion is an important area of research due to the fact that multiple types of features contain richer and complementary information. Discriminative Correlation Analysis (DCA) is a recently proposed feature fusion method, which incorporates the class association into correlation analysis so that the features not only have the maximum intrinsic correlation between feature sets but also have class structure information. However, DCA is a linear technique, that finds a linear transformation of the original space. For highly nonlinearly distributed data, classification with nonlinear techniques works better than the linear ones. In this paper, we propose Kernel-DCA which generalizes DCA in order to handle nonlinear problems. Similar to Kernel-SVM, Kernel-DCA utilizes a kernel method to map feature sets to a high-dimensional space in which features are linearly separable. Experimental results, for the fusion of ear and face feature, using the WVU database with large variations in pose, show that Kernel-DCA achieves better results on nonlinearly distributed data than DCA and other feature fusion methods.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 912-917
Low Resolution Face Recognition in Surveillance Systems Using Discriminant Correlation Analysis
Due to large distances between surveillance cameras and subjects, the captured images usually have low resolution in addition to uncontrolled poses and illumination conditions that adversely affect the performance of face recognition algorithms. In this paper, we present a low-resolution face recognition technique based on Discriminant Correlation Analysis (DCA). DCA analyzes the correlation of the features in high-resolution and low-resolution images and aims to find projections that maximize the pair-wise correlations between the two feature sets and at the same time, separate the classes within each set. This makes it possible to project the features extracted from high-resolution and low-resolution images into a common space, in which we can apply matching. The proposed method is computationally efficient and can be applied to challenging real-time applications such as recognition of several faces appearing in a crowded frame of a surveillance video. Extensive experiments performed on low-resolution surveillance images from the SCface database as well as FRGC database demonstrated the efficacy of our proposed approach in the recognition of low-resolution face images, which outperformed other state-of-the-art techniques.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 912-917
Low Resolution Face Recognition in Surveillance Systems Using Discriminant Correlation Analysis
Due to large distances between surveillance cameras and subjects, the captured images usually have low resolution in addition to uncontrolled poses and illumination conditions that adversely affect the performance of face recognition algorithms. In this paper, we present a low-resolution face recognition technique based on Discriminant Correlation Analysis (DCA). DCA analyzes the correlation of the features in high-resolution and low-resolution images and aims to find projections that maximize the pair-wise correlations between the two feature sets and at the same time, separate the classes within each set. This makes it possible to project the features extracted from high-resolution and low-resolution images into a common space, in which we can apply matching. The proposed method is computationally efficient and can be applied to challenging real-time applications such as recognition of several faces appearing in a crowded frame of a surveillance video. Extensive experiments performed on low-resolution surveillance images from the SCface database as well as FRGC database demonstrated the efficacy of our proposed approach in the recognition of low-resolution face images, which outperformed other state-of-the-art techniques.
- Open Access
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Segmentation, classification and modeling of two-dimensional forward-scan sonar imagery for efficient coding and synthesis
In this paper, we present methods for segmenting noisy two-dimensional forward-scan sonar images and classify and model their background. The segmentation approach differentiates the highlight blobs, cast shadows, and the background of sonar images. There is usually little information within relatively large background regions corresponding to the flat sea bottom and (or) water column, as they are often corrupted with speckle noise. Our experiments show that the background texture is dominated by the speckle noise which has the appearance of a pseudo-random texture. We show that the background texture of the underwater sonar images can be categorized by a small number of classes. The statistical features work better than the texture-based features in categorizing the pseudo-random background, which further strengthen our hypothesis of the dominance of noise over the background texture. As a result, we can model the noisy background with a few parameters. This has an application in coding the sonar images in which highlight blob regions and cast shadows are coded at the encoder side while the speckle noise-corrupted background can be synthesized at the decoder side. Since the background regions occupy a large fraction of the FS sonar image, we expect higher compression rates than most current image or video coding standards and other custom-designed sonar image compression techniques.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Open AccessSegmentation, classification and modeling of two-dimensional forward-scan sonar imagery for efficient coding and synthesis
In this paper, we present methods for segmenting noisy two-dimensional forward-scan sonar images and classify and model their background. The segmentation approach differentiates the highlight blobs, cast shadows, and the background of sonar images. There is usually little information within relatively large background regions corresponding to the flat sea bottom and (or) water column, as they are often corrupted with speckle noise. Our experiments show that the background texture is dominated by the speckle noise which has the appearance of a pseudo-random texture. We show that the background texture of the underwater sonar images can be categorized by a small number of classes. The statistical features work better than the texture-based features in categorizing the pseudo-random background, which further strengthen our hypothesis of the dominance of noise over the background texture. As a result, we can model the noisy background with a few parameters. This has an application in coding the sonar images in which highlight blob regions and cast shadows are coded at the encoder side while the speckle noise-corrupted background can be synthesized at the decoder side. Since the background regions occupy a large fraction of the FS sonar image, we expect higher compression rates than most current image or video coding standards and other custom-designed sonar image compression techniques.
- Top Cited PapersOpen Access
- 17 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 11 (9) , 1984-1996
Discriminant Correlation Analysis: Real-Time Feature Level Fusion for Multimodal Biometric Recognition
Information fusion is a key step in multimodal biometric systems. The fusion of information can occur at different levels of a recognition system, i.e., at the feature level, matching-score level, or decision level. However, feature level fusion is believed to be more effective owing to the fact that a feature set contains richer information about the input biometric data than the matching score or the output decision of a classifier. The goal of feature fusion for recognition is to combine relevant information from two or more feature vectors into a single one with more discriminative power than any of the input feature vectors. In pattern recognition problems, we are also interested in separating the classes. In this paper, we present discriminant correlation analysis (DCA), a feature level fusion technique that incorporates the class associations into the correlation analysis of the feature sets. DCA performs an effective feature fusion by maximizing the pairwise correlations across the two feature sets and, at the same time, eliminating the between-class correlations and restricting the correlations to be within the classes. Our proposed method can be used in pattern recognition applications for fusing the features extracted from multiple modalities or combining different feature vectors extracted from a single modality. It is noteworthy that DCA is the first technique that considers class structure in feature fusion. Moreover, it has a very low computational complexity and it can be employed in real-time applications. Multiple sets of experiments performed on various biometric databases and using different feature extraction techniques, show the effectiveness of our proposed method, which outperforms other state-of-the-art approaches.
- 17 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 11 (9) , 1984-1996
Top Cited PapersOpen AccessDiscriminant Correlation Analysis: Real-Time Feature Level Fusion for Multimodal Biometric Recognition
Information fusion is a key step in multimodal biometric systems. The fusion of information can occur at different levels of a recognition system, i.e., at the feature level, matching-score level, or decision level. However, feature level fusion is believed to be more effective owing to the fact that a feature set contains richer information about the input biometric data than the matching score or the output decision of a classifier. The goal of feature fusion for recognition is to combine relevant information from two or more feature vectors into a single one with more discriminative power than any of the input feature vectors. In pattern recognition problems, we are also interested in separating the classes. In this paper, we present discriminant correlation analysis (DCA), a feature level fusion technique that incorporates the class associations into the correlation analysis of the feature sets. DCA performs an effective feature fusion by maximizing the pairwise correlations across the two feature sets and, at the same time, eliminating the between-class correlations and restricting the correlations to be within the classes. Our proposed method can be used in pattern recognition applications for fusing the features extracted from multiple modalities or combining different feature vectors extracted from a single modality. It is noteworthy that DCA is the first technique that considers class structure in feature fusion. Moreover, it has a very low computational complexity and it can be employed in real-time applications. Multiple sets of experiments performed on various biometric databases and using different feature extraction techniques, show the effectiveness of our proposed method, which outperforms other state-of-the-art approaches.
- 1 April 2016
- Published by Elsevier in Expert Systems with Applications
- Vol. 47, 23-34
Fully automatic face normalization and single sample face recognition in unconstrained environments
- 1 April 2016
- Published by Elsevier in Expert Systems with Applications
- Vol. 47, 23-34
Fully automatic face normalization and single sample face recognition in unconstrained environments
- Open Access
- 1 March 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1866-1870
Discriminant correlation analysis for feature level fusion with application to multimodal biometrics
In this paper, we present Discriminant Correlation Analysis (DCA), a feature level fusion technique that incorporates the class associations in correlation analysis of the feature sets. DCA performs an effective feature fusion by maximizing the pair-wise correlations across the two feature sets, and at the same time, eliminating the between-class correlations and restricting the correlations to be within classes. Our proposed method can be used in pattern recognition applications for fusing features extracted from multiple modalities or combining different feature vectors extracted from a single modality. It is noteworthy that DCA is the first technique that considers class structure in feature fusion. Moreover, it has a very low computational complexity and it can be employed in realtime applications. Multiple sets of experiments performed on various biometric databases show the effectiveness of our proposed method, which outperforms other state-of-the-art approaches.
- 1 March 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1866-1870
Open AccessDiscriminant correlation analysis for feature level fusion with application to multimodal biometrics
In this paper, we present Discriminant Correlation Analysis (DCA), a feature level fusion technique that incorporates the class associations in correlation analysis of the feature sets. DCA performs an effective feature fusion by maximizing the pair-wise correlations across the two feature sets, and at the same time, eliminating the between-class correlations and restricting the correlations to be within classes. Our proposed method can be used in pattern recognition applications for fusing features extracted from multiple modalities or combining different feature vectors extracted from a single modality. It is noteworthy that DCA is the first technique that considers class structure in feature fusion. Moreover, it has a very low computational complexity and it can be employed in realtime applications. Multiple sets of experiments performed on various biometric databases show the effectiveness of our proposed method, which outperforms other state-of-the-art approaches.
- Top Cited Papers
- 1 November 2015
- Published by Elsevier in Expert Systems with Applications
- Vol. 42 (21) , 7905-7916
CloudID: Trustworthy cloud-based and cross-enterprise biometric identification
- 1 November 2015
- Published by Elsevier in Expert Systems with Applications
- Vol. 42 (21) , 7905-7916
Top Cited PapersCloudID: Trustworthy cloud-based and cross-enterprise biometric identification
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 126-131
Computationally efficient statistical face model in the feature space
In this paper, we present a computationally efficient statistical face modeling approach. The efficiency of our proposed approach is the result of mathematical simplifications in the core formula of a previous face modeling method and the use of the singular value decomposition. In order to reduce the errors in our resulting models, we preprocess the facial images to normalize for pose and illumination and remove little occlusions. Then, the statistical face models for the enrolled subjects are obtained from the normalized face images. The effects of the variations in pose, facial expression, and illumination on the accuracy of the system are studied. Experimental results demonstrate the reduction in the computational complexity of the new approach and its efficacy in modeling the face images.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 126-131
Computationally efficient statistical face model in the feature space
In this paper, we present a computationally efficient statistical face modeling approach. The efficiency of our proposed approach is the result of mathematical simplifications in the core formula of a previous face modeling method and the use of the singular value decomposition. In order to reduce the errors in our resulting models, we preprocess the facial images to normalize for pose and illumination and remove little occlusions. Then, the statistical face models for the enrolled subjects are obtained from the normalized face images. The effects of the variations in pose, facial expression, and illumination on the accuracy of the system are studied. Experimental results demonstrate the reduction in the computational complexity of the new approach and its efficacy in modeling the face images.
- 1 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-3
Fast-FMI: Non-reference image fusion metric
In this paper, we present a non-reference image fusion metric based on the mutual information of image features. Whereas a recent metric proposed by the author called FMI achieves such a goal, the algorithm is complex and has high memory requirements for its calculations. This paper shows how to modify the model of FMI, and proposes a faster algorithm to achieve similar results. The new algorithm achieves a significant complexity reduction in comparison to the previous model. Various experiments prove the efficiency of the algorithm in consistency with the subjective criteria. Matlab source code for this metric is provided at http://www.mathworks.com/matlabcentral/fileexchange/45926.
- 1 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-3
Fast-FMI: Non-reference image fusion metric
In this paper, we present a non-reference image fusion metric based on the mutual information of image features. Whereas a recent metric proposed by the author called FMI achieves such a goal, the algorithm is complex and has high memory requirements for its calculations. This paper shows how to modify the model of FMI, and proposes a faster algorithm to achieve similar results. The new algorithm achieves a significant complexity reduction in comparison to the previous model. Various experiments prove the efficiency of the algorithm in consistency with the subjective criteria. Matlab source code for this metric is provided at http://www.mathworks.com/matlabcentral/fileexchange/45926.