Method for minimal-logic non-linear filter implementation
A method for implementing a filter on a signal is disclosed wherein interval membership information is computed and stored in such a manner so as to use a minimal amount of memory thereby allowing filter computation by a small number of deterministic sequence of table lookups and bit-wise logical operations. In general, the present invention involves using a non-linear filter represented as a plurality of intervals and the discrete values a sample may take. Each sample corresponds to a component in a vector. Each interval is comprised of a lower and upper vector. Each sample value is compared to the lower and upper values of the sample's associated coordinate. A table for that sample is then constructed with binary entries where a ‘1’ denotes that a sample value is within the lower and upper values of the coordinate and ‘0’ denoting otherwise. A table is built for each sample.
1. A method for implementing a filter on a signal wherein interval membership information is computed and stored in such a manner that filter computation by a small number of deterministic sequence of table lookups and bit-wise logical operations can be performed quickly and efficiently, comprising the steps of:
a) obtaining a windowed observation from an image or signal and storing that observation in a vector X such that X=(X 1 , . . . ,X N );
b) for each component X i stored in vector (X 1 , . . . , X N ), obtaining an index into a table to produce a one-dimensional interval number L i (X i );
c) for each produced one-dimensional interval value L i (X i ), utilizing L i (X i ) as an index into a table of bit-vectors to obtain the set of corresponding bit-vectors;
d) performing a logical AND operation for each set of N corresponding bit-vectors;
e) retrieving position k of a unique non-zero bit and using position k as an index into a second table T of stored filter values; and
f) de-referencing the corresponding stored filter value such that T is the filter value at observation X.