A novel transform for fast detection of naturally curved items in digital images is described in this article. This general purpose image transform is defined to suit platforms with limited memory and processing footprints by utilizing only additions and simple shift and bitwise operations. We present this unique algorithmic approach in application to real world problems of iris detection and handwriting recognition systems as typical applications in such devices. The new approach is tested on several data sets and the experiments show promising and superior performance compared to existing techniques.
https://www.researchgate.net/publication/290691433_Systems_and_methods_for_obtaining_structural_information_from_a_digital_image
3. Magdi Mohamed, 2017:06:02 3 / 81
Optical Eye Tracking System Diagram – Motivation for Idea
Hough
Transform
Processing
And / Or
Other Methods
(Timm & Barth)
Frame
Normalization
Size
Light
Pose
Image
Preprocessing
Binarization
Noise Filtering
Smoothing
Image
Segmentation
Morphological
Operations,
Clustering,
&
Relaxation
Techniques
Feature
Extraction
Edge
Operations:
Detection
Linking
Thinning
Analysis &
Classification
Search
&
Image
Interpretation
Tasks
Post-
processing
Spatial
Relationships,
Sanity Checks
&
Accept / Reject
Iris detection is essential for several applications including gaze tracking
4. Magdi Mohamed, 2017:06:02 4 / 81
Overview of Techniques
Practical solutions are usually engineering combination of multiple techniques
5. Magdi Mohamed, 2017:06:02 5 / 81
Hough Transform for Iris Detection – Existing Solution
β
α
(α1, β1)
Hough Space for Circles
(α− x1 ) 2 + ( β − y1 ) 2 = r2
x
y Image Space
( x - α1 ) 2 + ( y – β1 ) 2 = r 2
(x1,y1)
Iris Detection Requirements
Deals with variations in light and reflections
Deals with partially occluded, missing, and noisy features
No special markers or makeup required
Features realtime processing
Quantifies action codes
Hough method can detect multiple curves and is resilient to noisy inputs
6. Magdi Mohamed, 2017:06:02 6 / 81
Other Methods: Timm & Barth – Existing Solution
{timm,barth}@inb.uni-luebeck.de
Proposing a faster and novel extension of this method
7. Magdi Mohamed, 2017:06:02 7 / 81
Gradient Direction Transform: New Idea
after initializing the transform matrix to zeros, for each gradient vector in the
input image region of interest, increment / decrement the value of the cells in
the transform matrix inline with the gradient vector accordingly
8. Magdi Mohamed, 2017:06:02 8 / 81
Gradient Direction Transform: Solution for Iris Detection
Pre-Processing
Blur-Convolution
Vertical-Edge Horizontal-Edge
Gradient Direction Transform
Weighted Gradient Direction
Thinning
Find Eye
Otsu Dynamic Threshold
Edge-Convolution
i-image
n-image
b-image e-image
o-imagev-image h-image
g-image
w-image h-space
iris-location
Hough Transform for Elliptical Shapes
t-image
13. Magdi Mohamed, 2017:06:02 13 / 81
References
• Hough:
Method and means for recognizing complex patterns
https://docs.google.com/viewer?url=patentimages.storage.googleapis.com/pdfs/US3069654.pdf
• Ballard:
Generalizing Hough transform to recognize arbitrarily shapes
http://www.cs.utexas.edu/~dana/HoughT.pdf
• Mohamed & Nasir:
Method and system for parallel processing of Hough transform computations
https://docs.google.com/viewer?url=patentimages.storage.googleapis.com/pdfs/US7406212.pdf
• Timm & Barth:
Accurate eye center localization by means of gradients
http://cjee.lakeheadu.ca/public/journals/22/TiBa11b.pdf
• Bresenham:
A rasterizing algorithm for drawing curves
http://members.chello.at/easyfilter/bresenham.pdf
14. Magdi Mohamed, 2017:06:02 14 / 81
Major Characteristics – Complexities & Capabilities
Face detection takes ~ 30 ms (24 x 24)
Eye corner detection takes ~ 12 ms (256 x 256)
Iris detection time complexity for region of interest (C x R)
T&B = K1 (C * R)
2
(K1 ~ cost for normalized floating point vector dot product)
GDT = K2 (C * R) * C (K2 ~ cost for integer addition and bit-wise operations, C>R)
T&B ignores sign of vector in squaring dot products to avoid square root
computations
GDT is capable of efficient
Consideration of sign of vectors at no extra cost (inward/outward directions)
Extension of gradient normal-vector (by choice) to other directions such as gradient
tangent-vector that may suit describing other (binary/gray/color) image analysis tasks
15. Magdi Mohamed, 2017:06:02 15 / 81
Timm & Barth Versus Gradient Direction Transform
Method
Size (C x R)
Conventional
T&B
T1 (Seconds)
Novel
GDT
T2 (Seconds)
Speedup
Ratio
T1 / T2
040 x 030 0001.291 0000.053 024.538
080 x 060 0022.630 0000.345 065.672
160 x 120 0394.155 0002.689 146.580
240 x 180 2063.608 0013.426 153.705
320 x 240 6603.897 0036.665 180.116
Measured Speedup Ratio = T1 / T2
27. Magdi Mohamed, 2017:06:02 27 / 81
Iris Detection – Major Challenges
Eye boarder localization
Occlusion
Eyelashes
Glasses
Makeup
Shadows
Resolution
Non-circularity
Wrinkles
Redness
Water
Abrupt motion
Blinks
Differences between left and right eyes
Pose, color variations, and light reflections
Age sensitive
Manual annotation and evaluation metrics
Strong/Weak eye concerns for gaze
28. Magdi Mohamed, 2017:06:02 28 / 81
Iris Detection - Notes On Used Data
The data is not constructed particularly for evaluating iris detection algorithms
It contains illegitimate images, and less accurate annotation for iris centers
It contains some faces with sun glasses
It contains many cases with corneal reflections from strong light sources
It significantly represents almost frontal faces
It contains mostly colored images
It represents different categories (age groups, makeup, styles, …)
Since it is the only annotated data available to us, we used it to construct our
facial landmark detector, and to evaluate the iris detector
Ideally, a balanced data set with “casual” iris positions, not mostly looking at the
camera, with more accurate manual annotation of iris centers is needed
29. Magdi Mohamed, 2017:06:02 29 / 81
Iris Detection – Experiment # 1 Setup
Using 15800 (mostly frontal view) face images with 40 landmarks per face
manually annotated as Ground Truth,
Using Omron Face Detector,
Using Omron Eye Corner Locator,
Conducting a Blind Test to Compare GDT Versus T&B Solution,
Compute normalized Cumulative Error Distribution (CED) for each estimator
31. Magdi Mohamed, 2017:06:02 31 / 81
Iris Detection – Experiment # 2 Setup
Using 15800 (mostly frontal view) face images with 40 landmarks per face
manually annotated as Ground Truth,
Using Omron Face Detector,
Using Omron Eye Corner Locator,
Conducting a Blind Test to Compare GDT Versus Omron Solution,
Compute normalized Cumulative Error Distribution (CED) for each estimator
33. Magdi Mohamed, 2017:06:02 33 / 81
Iris Detection – Experiment # 3 Setup
Using 15800 (mostly frontal view) face images with 40 landmarks per face
manually annotated as Ground Truth,
Using Omron Face Detector,
Using Supervised Newton Facial Landmark Detection method with Qualcomm
feature descriptor (HSG) and training algorithm,
Conducting 5 fold cross validation for evaluation,
Compute normalized Cumulative Error Distribution (CDF) for each estimator
56. Magdi Mohamed, 2017:06:02 56 / 81
Handwriting Recognition Using BAR Features
A Character Image and the Feature Image for the Foreground Horizontal Direction Pseudo-Code for Computing the Bar Transform on the Foreground
BAR transform is an existing technique proven to provide superior performance
57. Magdi Mohamed, 2017:06:02 57 / 81
Handwriting Recognition Using BAR Features
An Upper Case “B” and the Foreground and Background Bar Transform Feature Images Corresponding to the East-West Directions
BAR Feature Vector Uses Both Foreground & Background BAR Transforms