Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Shireen Y. Elhabian is active.

Publication


Featured researches published by Shireen Y. Elhabian.


Recent Patents on Computer Science | 2008

Moving Object Detection in Spatial Domain using Background Removal Techniques - State-of-Art

Shireen Y. Elhabian; Khaled M. El-Sayed; Sumaya H. Ahmed

Identifying moving objects is a critical task for many computer vision applications; it provides a classification of the pixels into either foreground or background. A common approach used to achieve such classification is background removal. Even though there exist numerous of background removal algorithms in the literature, most of them follow a simple flow diagram, passing through four major steps, which are pre-processing, background modelling, foreground de- tection and data validation. In this paper, we survey many existing schemes in the literature of background removal, sur- veying the common pre-processing algorithms used in different situations, presenting different background models, and the most commonly used ways to update such models and how they can be initialized. We also survey how to measure the performance of any moving object detection algorithm, whether the ground truth data is available or not, presenting per- formance metrics commonly used in both cases.


medical image computing and computer assisted intervention | 2010

Toward precise pulmonary nodule descriptors for nodule type classification

A.A. Farag; Shireen Y. Elhabian; James H. Graham; Aly A. Farag; Robert Falk

A framework for nodule feature-based extraction is presented to classify lung nodules in low-dose CT slices (LDCT) into four categories: juxta, well-circumscribed, vascularized and pleural-tail, based on the extracted information. The Scale Invariant Feature Transform (SIFT) and an adaptation to Daugmans Iris Recognition algorithm are used for analysis. The SIFT descriptor results are projected to lower-dimensional subspaces using PCA and LDA. Complex Gabor wavelet nodule response obtained from an adopted Daugman Iris Recognition algorithm revealed improvements from the original Daugman binary iris code. This showed that binarized nodule responses (codes) are inadequate for classification since nodules lack texture concentration as seen in the iris, while the SIFT algorithm projected using PCA showed robustness and precision in classification.


computer vision and pattern recognition | 2009

Face recognition at-a-distance based on sparse-stereo reconstruction

Ham M. Rara; Shireen Y. Elhabian; Asem M. Ali; Mike Miller; Thomas L. Starr; Aly A. Farag

We describe a framework for face recognition at a distance based on sparse-stereo reconstruction. We develop a 3D acquisition system that consists of two CCD stereo cameras mounted on pan-tilt units with adjustable baseline. We first detect the facial region and extract its landmark points, which are used to initialize an AAM mesh fitting algorithm. The fitted mesh vertices provide point correspondences between the left and right images of a stereo pair; stereo-based reconstruction is then used to infer the 3D information of the mesh vertices. We perform experiments regarding the use of different features extracted from these vertices for face recognition. The cumulative rank curves (CMC), which are generated using the proposed framework, confirms the feasibility of the proposed work for long distance recognition of human faces with respect to the state-of-the-art.


international conference on image processing | 2009

Model-based shape recovery from single images of general and unknown lighting

Ham M. Rara; Shireen Y. Elhabian; Thomas L. Starr; Aly A. Farag

We present a new statistical shape-from-shading framework for images of unknown illumination. The object (e.g., face) to be reconstructed is described by a parametric model. To deal with arbitrary illumination, the framework makes use of recent results that general lighting can be expressed using low-order spherical harmonics for convex Lambertian objects. The classical shape-from-shading equation is modified according to this framework. Results show accurate shape recovery with respect to ground truth data.


Frontiers in Neurology | 2014

Subject–Motion Correction in HARDI Acquisitions: Choices and Consequences

Shireen Y. Elhabian; Yaniv Gur; Clement Vachet; Joseph Piven; Martin Styner; Ilana R. Leppert; G. Bruce Pike; Guido Gerig

Diffusion-weighted imaging (DWI) is known to be prone to artifacts related to motion originating from subject movement, cardiac pulsation, and breathing, but also to mechanical issues such as table vibrations. Given the necessity for rigorous quality control and motion correction, users are often left to use simple heuristics to select correction schemes, which involves simple qualitative viewing of the set of DWI data, or the selection of transformation parameter thresholds for detection of motion outliers. The scientific community offers strong theoretical and experimental work on noise reduction and orientation distribution function (ODF) reconstruction techniques for HARDI data, where post-acquisition motion correction is widely performed, e.g., using the open-source DTIprep software (1), FSL (the FMRIB Software Library) (2), or TORTOISE (3). Nonetheless, effects and consequences of the selection of motion correction schemes on the final analysis, and the eventual risk of introducing confounding factors when comparing populations, are much less known and far beyond simple intuitive guessing. Hence, standard users lack clear guidelines and recommendations in practical settings. This paper reports a comprehensive evaluation framework to systematically assess the outcome of different motion correction choices commonly used by the scientific community on different DWI-derived measures. We make use of human brain HARDI data from a well-controlled motion experiment to simulate various degrees of motion corruption and noise contamination. Choices for correction include exclusion/scrubbing or registration of motion corrupted directions with different choices of interpolation, as well as the option of interpolation of all directions. The comparative evaluation is based on a study of the impact of motion correction using four metrics that quantify (1) similarity of fiber orientation distribution functions (fODFs), (2) deviation of local fiber orientations, (3) global brain connectivity via graph diffusion distance (GDD), and (4) the reproducibility of prominent and anatomically defined fiber tracts. Effects of various motion correction choices are systematically explored and illustrated, leading to a general conclusion of discouraging users from setting ad hoc thresholds on the estimated motion parameters beyond which volumes are claimed to be corrupted.


international conference on pattern recognition | 2010

Face Recognition at-a-Distance Using Texture, Dense- and Sparse-Stereo Reconstruction

Ham M. Rara; Asem A. Ali; Shireen Y. Elhabian; Thomas L. Starr; Aly A. Farag

This paper introduces a framework for long-distance face recognition using dense and sparse stereo reconstruction, with texture of the facial region. Two methods to determine correspondences of the stereo pair are used in this paper: (a) dense global stereo-matching using maximum-a-posteriori Markov Random Fields (MAP-MRF) algorithms and (b) Active Appearance Model (AAM) fitting of both images of the stereo pair and using the fitted AAM mesh as the sparse correspondences. Experiments are performed using combinations of different features extracted from the dense and sparse reconstructions, as well as facial texture. The cumulative rank curves (CMC), which are generated using the proposed framework, confirms the feasibility of the proposed work for long distance recognition of human faces.


international conference on image processing | 2010

3D face recovery from intensities of general and unknown lighting using Partial Least Squares

Ham M. Rara; Shireen Y. Elhabian; Thomas L. Starr; Aly A. Farag

We discuss a statistical shape-from-shading framework for images of general and unknown illumination. To overcome arbitrary illumination, the framework makes use of the fact that general lighting can be expressed using low-order spherical harmonics for convex Lambertian objects. We cast the classical shape-from-shading equation as a Partial Least Squares (PLS) regression problem, which allows for the rapid computation of the solution. Results show accurate shape recovery with respect to ground truth data.


british machine vision conference | 2011

Towards Efficient and Compact Phenomenological Representation of Arbitrary Bidirectional Surface Reflectance

Shireen Y. Elhabian; Ham M. Rara; Aly A. Farag

The visual appearance of real-world surfaces is the net result of surface reflectance characteristics when exposed to illumination. Appearance models can be constructed using phenomenological models which capture surface appearance through mathematical modeling of the reflection process. This yields an integral equation, known as reflectance equation, describing the surface radiance, which depends on the interaction between the incident light field and the surface bidirectional reflectance distribution function (BRDF). The BRDF is a function defined on the cartesian product of two hemispheres corresponding to the incident and outgoing directions; the natural way to represent such a hemispherical function is to use hemispherical basis. However, due to their compactness in the frequency space, spherical harmonics (SH) have been extensively used for this purpose. In this paper, we address the geometrical compliance of hemispherical basis for representing surface BRDF. We propose a tensor product of the hemispherical harmonics (HSH) to provide a compact and efficient representation for arbitrary BRDFs, while satisfying the Helmholtz reciprocity property. We provide an analytical analysis and experimental justification that for a given approximation order, our proposed hemispherical basis provide better approximation accuracy when compared to Zernike-based basis, while avoiding the high computational complexity inherited from such polynomials. We validate our proposed Helmholtz HSH-based basis functions on Oren-Nayar and Cook-Torrance BRDF physical models.


international symposium on visual computing | 2009

A Framework for Long Distance Face Recognition Using Dense - and Sparse-Stereo Reconstruction

Ham M. Rara; Shireen Y. Elhabian; Asem M. Ali; Travis R. Gault; Mike Miller; Thomas L. Starr; Aly A. Farag

This paper introduces a framework for long-distance face recognition using both dense- and sparse-stereo reconstruction. Two methods to determine correspondences of the stereo pair are used in this paper: (a) dense global stereo-matching using maximum-a-posteriori Markov Random Fields (MAP-MRF) algorithms and (b) Active Appearance Model (AAM) fitting of both images of the stereo pair and using the fitted AAM mesh as the sparse correspondences. Experiments are performed regarding the use of different features extracted from these vertices for face recognition. A comparison between the two approaches (a) and (b) are carried out in this paper. The cumulative rank curves (CMC), which are generated using the proposed framework, confirms the feasibility of the proposed work for long distance recognition of human faces.


international conference on image processing | 2009

Distant face recognition based on sparse-stereo reconstruction

Ham M. Rara; Shireen Y. Elhabian; Asem M. Ali; Mike Miller; Thomas L. Starr; Aly A. Farag

We introduce a framework for face recognition at a distance based on sparse-stereo reconstruction. We develop a 3D acquisition system that consists of two CCD stereo cameras mounted on pan-tilt units with adjustable baseline. We first detect the facial region and extract its landmark points, which are used to initialize an AAM mesh fitting algorithm. The fitted mesh vertices provide point correspondences between the left and right images of a stereo pair; stereo-based reconstruction is then used to infer the 3D information of the mesh vertices. We perform experiments regarding the use of different features extracted from these vertices for face recognition. The cumulative rank curves (CMC), which are generated using the proposed framework, confirms the feasibility of the proposed work for long distance recognition of human faces with respect to the state-of-the-art [3].

Collaboration


Dive into the Shireen Y. Elhabian's collaboration.

Top Co-Authors

Avatar

Aly A. Farag

University of Louisville

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Ham M. Rara

University of Louisville

View shared research outputs
Top Co-Authors

Avatar

Asem M. Ali

University of Louisville

View shared research outputs
Top Co-Authors

Avatar

A.A. Farag

University of Louisville

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Martin Styner

University of North Carolina at Chapel Hill

View shared research outputs
Researchain Logo
Decentralizing Knowledge