Article View: sci.image.processing
Article #271Re: Pattern identification
From: Larry D. Pyeatt
Date: Thu, 06 Aug 1992 21:01
Date: Thu, 06 Aug 1992 21:01
23 lines
1636 bytes
1636 bytes
In article <1992Aug5.103712.24039@ccsun.strath.ac.uk>, craa85@ccsun.strath.ac.uk writes:
|> Is there any known way of instantaneously identifying a bit stream (i.e. a
|> very simple bit map of an image) using hardware techniques. The idea is
|> to avoid using processing power to identify the image.
|>
If the pattern is fairly small and you are only concerned with an exact match,
you could build a state machine and feed it one bit at a time.
If the pattern is more complex, you could store it in an eprom, and compare
it byte by byte to your new pattern. This also would require a state machine
(counter) to control access to the eprom.
You could also do it using combinatorial logic. A stack of eproms could be
programmed to retreive a code for any pattern which is fed into its address space.
This solution should allow the identification of several bit patterns with
one circuit.
--
Larry D. Pyeatt The views expressed here are not
Internet : pyeatt@texaco.com those of my employer or of anyone
Voice : (713) 975-4056 that I know of with the possible
exception of myself.
Technical Details
Message-ID:
<1992Aug6.210138.24541@texhrc.uucp>Path:
arc1-ca.pugleaf.net!sparky!uunet!gatech!darwin.sura.net!zaphod.mps.ohio-state.edu!menudo.uh.edu!lobster!nuchat!texhrc!texhrc!ak45ldpReferences:
<1992Aug5.103712.24039@ccsun.strath.ac.uk>Show Full Headers
Complete Article Headers
Newsgroups: sci.image.processing Path: arc1-ca.pugleaf.net!sparky!uunet!gatech!darwin.sura.net!zaphod.mps.ohio-state.edu!menudo.uh.edu!lobster!nuchat!texhrc!texhrc!ak45ldp From: ak45ldp@Texaco.com (Larry D. Pyeatt) Subject: Re: Pattern identification Message-ID: <1992Aug6.210138.24541@texhrc.uucp> Sender: news@texhrc.uucp Nntp-Posting-Host: aisun Organization: Texaco References: <1992Aug5.103712.24039@ccsun.strath.ac.uk> Date: Thu, 6 Aug 1992 21:01:38 GMT Lines: 23