Approximate computing for biometrie security systems: A case study on iris scanning

  title={Approximate computing for biometrie security systems: A case study on iris scanning},
  author={Soheil Hashemi and Hokchhay Tann and Francesco Buttafuoco and Sherief Reda},
  journal={2018 Design, Automation \& Test in Europe Conference \& Exhibition (DATE)},
  • S. Hashemi, Hokchhay Tann, S. Reda
  • Published 19 March 2018
  • Computer Science
  • 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE)
Exploiting the error resilience of emerging data-rich applications, approximate computing promotes the introduction of small amount of inaccuracy into computing systems to achieve significant reduction in computing resources such as power, design area, runtime or energy. Successful applications for approximate computing have been demonstrated in the areas of machine learning, image processing and computer vision. In this paper we make the case for a new direction for approximate computing in… 

Figures and Tables from this paper

A Resource-Efficient Embedded Iris Recognition System Using Fully Convolutional Networks
A resource-efficient, end-to-end iris recognition flow, which consists of FCN-based segmentation and a contour fitting module, followed by Daugman normalization and encoding, and a novel dynamic fixed-point accelerator, which fully demonstrate the SW/HW co-design realization of the flow on an embedded FPGA platform.
Hardware Acceleration of Image Processing Algorithms on Low-Power Embedded Platforms
The implementation of two main algorithms based on hardwaresoftware co-design to identify some features from particular images using Gradient Based Local Search and GradientBased Cross-Spectral Stereo Matching.
IMACS: A Framework for Performance Evaluation of Image Approximation in a Closed-loop System
This work proposes a framework - for both software-in-the-loop (SiL) and hardware-in theloop (HiL) simulation - for performance evaluation of image approximation on a closed-loop automotive IBC system (IMACS) and shows the effectiveness of the framework using a vision-based lateral control example.
Approximation Trade Offs in an Image-Based Control System
This work identifies the error resilient stages and the corresponding coarse-grained approximation settings for the IBC system, and performs trade off analysis between the QoC, memory utilisation and energy consumption for varying degrees of coarse- grained approximation.
A Time-Domain Computing Accelerated Image Recognition Processor With Efficient Time Encoding and Non-Linear Logic Operation
Novel time-domain circuit techniques are presented, including a double-encoding strategy, bit-scalable design that accelerates the performance compared with previous linear coding, and shared time generator (TG) with variation-aware design technique which significantly improves the error tolerance of TC.
Approximation-Aware Design of an Image-Based Control System
This work proposes an approximation-aware design approach for optimizing the energy, memory and performance of an IBC system, making it suitable for embedded implementation and designs an optimal approximation- aware controller that models the approximation error as sensor noise and shows QoC improvements.
Approximate Logic Synthesis Using Boolean Matrix Factorization
This work provides a unified approach enabling the factorization algorithm to utilize semiring algebra, field algebra, and a combination of both for truth table factorization, and provides an automatic circuit partitioning approach and a design space exploration heuristic to navigate the search space.
Hardware-Software Co-design of Resource-Efficient Deep Neural Networks
Design methodologies to reduce the hardware complexities of DNN models and propose light-weight approximate accelerators that can efficiently process these models are introduced.
Approximate Logic Synthesis: A Survey
This work reviews methods devised to synthesize approximate circuits, given their exact functionality and an approximability threshold, and summarizes strategies for evaluating the error that circuit simplification can induce on the output, which guides synthesis techniques in choosing the circuit transformations that lead to a given amount of induced error.


How iris recognition works
  • J. Daugman
  • Computer Science
    IEEE Transactions on Circuits and Systems for Video Technology
  • 2004
Algorithms developed by the author for recognizing persons by their iris patterns have now been tested in many field and laboratory trials, producing no false matches in several million comparison
DRUM: A Dynamic Range Unbiased Multiplier for approximate applications
This paper designs a novel approximate multiplier to have an unbiased error distribution, which leads to lower computational errors in real applications because errors cancel each other out, rather than accumulate, as the multiplier is used repeatedly for a computation.
Towards full-system energy-accuracy tradeoffs: A case study of an approximate smart camera system?
This paper proposes a systematic methodology to perform joint approximations across different subsystems, leading to significant energy benefits compared to approximating individual subsystems in isolation, and uses the example of a smart camera system that executes various computer vision and image processing applications to illustrate how the sensing, memory, and processing subsystems can all be approximated synergistically.
Hardware-software co-design of an iris recognition algorithm
Experimental results show that with a clock speed of 40 MHz, an IrisCode is obtained in less than 523 ms from an image of 640x480 pixels, which is just 20% of the total time needed by a software solution running on the same microprocessor embedded in the architecture.
Automated High-Level Generation of Low-Power Approximate Computing Circuits
This article provides an expanded and improved treatment of the ABACUS methodology, which aims to automatically generate approximate designs directly from their behavioral register-transfer level (RTL) descriptions, enabling a wider range of possible approximations.
Real Time Iris Segmentation on FPGA
A real time FPGA-based iris segmentation system that implements the Canny edge detection algorithm and a circle search to detect an iris in an image or video frame is presented.
Fast algorithm and application of Hough transform in iris segmentation
Hough transform algorithm is introduced and is adopted in iris segmentation and a modified fast algorithm is presented to solving low speed of Hough transform.
Resistive configurable associative memory for approximate computing
A resistive configurable associative memory (ReCAM) that enables selective approximation and asymmetric voltage overscaling to manage delivered efficiency and reduce energy.
High-level synthesis of approximate hardware under joint precision and voltage scaling
This paper presents an approximate high-level synthesis approach that outputs a quality-energy optimized register-transfer-level implementation from an accurate high- level C description by combining an optimization pass that estimates the scheduling impact of approximations with fast yet accurate quality- energy models and an efficient optimization solver to find near-optimal solutions constructively.
SALSA: Systematic logic synthesis of approximate circuits
This work proposes SALSA, a Systematic methodology for Automatic Logic Synthesis of Approximate circuits, which encodes the quality constraints using logic functions called Q-functions, and captures the flexibility that they engender as Approximation Don't Cares, which are used for circuit simplification using traditional don't care based optimization techniques.