84,581 research outputs found
Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization
Many artificial intelligence (AI) problems naturally map to NP-hard
optimization problems. This has the interesting consequence that enabling
human-level capability in machines often requires systems that can handle
formally intractable problems. This issue can sometimes (but possibly not
always) be resolved by building special-purpose heuristic algorithms, tailored
to the problem in question. Because of the continued difficulties in automating
certain tasks that are natural for humans, there remains a strong motivation
for AI researchers to investigate and apply new algorithms and techniques to
hard AI problems. Recently a novel class of relevant algorithms that require
quantum mechanical hardware have been proposed. These algorithms, referred to
as quantum adiabatic algorithms, represent a new approach to designing both
complete and heuristic solvers for NP-hard optimization problems. In this work
we describe how to formulate image recognition, which is a canonical NP-hard AI
problem, as a Quadratic Unconstrained Binary Optimization (QUBO) problem. The
QUBO format corresponds to the input format required for D-Wave superconducting
adiabatic quantum computing (AQC) processors.Comment: 7 pages, 3 figure
Design of an embedded iris recognition system for use with a multi-factor authentication system.
This paper describes in detail the design, manufacturing and testing of an embedded iris scanner for use with a multifactor authentication system. The design process for this project included hardware design from part selection to board design to populating. Additionally, this process included the entirety of the software development, though the iris recognition process was largely based on other works. The functional requirements for the overall multi-factor authentication system were to have three authentication methods with a thirty second window to complete all three. The system acceptance accuracy was required to be greater than 75%. Those requirements therefore dictate that the iris scanner module must also have an acceptance accuracy higher than 75% and perform iris recognition in a few seconds so that the user can gain admittance in the allotted window of time. While the hardware has been verified and tested, further development and testing is necessary on the software and image processing. This work is funded by the Department of Energy’s Kansas City National Security Campus, operated by Honeywell Federal Manufacturing & Technologies, LLC under contract number DE-NA0002839
An efficient hardware architecture for H.264 adaptive deblocking filter algorithm
This paper presents an efficient hardware architecture for real-time implementation of adaptive deblocking filter algorithm used in H.264 video coding standard. This hardware is designed to be used as part of a complete H.264 video coding system for portable applications. We use a novel edge filter ordering in a Macroblock to prevent the deblocking filter hardware from unnecessarily waiting for the pixels that will be filtered become available. The proposed architecture is implemented in Verilog HDL. The Verilog RTL code is verified to work at 72 MHz in a Xilinx Virtex II FPGA. The FPGA implementation can code 30 CIF frames (352x288) per second
A micropower centroiding vision processor
Published versio
Block-Matching Optical Flow for Dynamic Vision Sensor- Algorithm and FPGA Implementation
Rapid and low power computation of optical flow (OF) is potentially useful in
robotics. The dynamic vision sensor (DVS) event camera produces quick and
sparse output, and has high dynamic range, but conventional OF algorithms are
frame-based and cannot be directly used with event-based cameras. Previous DVS
OF methods do not work well with dense textured input and are designed for
implementation in logic circuits. This paper proposes a new block-matching
based DVS OF algorithm which is inspired by motion estimation methods used for
MPEG video compression. The algorithm was implemented both in software and on
FPGA. For each event, it computes the motion direction as one of 9 directions.
The speed of the motion is set by the sample interval. Results show that the
Average Angular Error can be improved by 30\% compared with previous methods.
The OF can be calculated on FPGA with 50\,MHz clock in 0.2\,us per event (11
clock cycles), 20 times faster than a Java software implementation running on a
desktop PC. Sample data is shown that the method works on scenes dominated by
edges, sparse features, and dense texture.Comment: Published in ISCAS 201
- …