Method for generating increasing shift-invariant filters

Image analysis – Image enhancement or restoration – Image filter

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C708S300000, C708S322000, C708S819000

Reexamination Certificate

active

06778710

ABSTRACT:

FIELD OF THE INVENTION
The present invention is generally related to the field of signal processing and, more particularly, to the field of programmable hardware and/or software filtering of image data in compact architectures with windowed shift-invariant filters operating on signals with two or more levels per sample.
BACKGROUND OF THE INVENTION
In the arts it is often necessary to manipulate a received signal or image, for both practical and operational reasons. For instance, the signal may need to be enhanced prior to some secondary operation being performed on the data such as printing with a laser printer. A scanned image may eventually need to be restored or reconstructed to its original form. Other operations can take the form of resolution conversion, thinning or thickening, among others. In order to manipulate the received signal or image data in these instances, mathematical operations are often performed. To achieve this, the discrete signal or image is often converted into or represented by a mathematical sequence or array of discrete values. For example, binary signals or images often take the form of discrete values of [0,1] and 8-bit gray-scale images often take the form of values in the range of [0..255]. The field of discrete signal and image processing, both theoretical and applied, is relatively dominated by mathematics in the form of specific methods and applications.
Many methods of signal or image processing use one or more applications involving filters. A filter operates by capturing a windowed observation of an image or signal. A windowed observation is a collection or vector of samples from the captured image or signal. Based on this vector, a decision, based on some formula or algorithm, is made about the image or signal at a particular position within the image or signal. In general, a filter operates on a set of signal or image samples which are mathematically written as a vector having the form of (X
1
. . . , X
N
).
Many techniques can be found in the arts, of which the following are representative and which are hereby incorporated by reference being made thereto. For example, a filter can assign a new sample value to the center pixel of a window in order to accomplish the overall goal of a restoration or enhancement of a degraded image, as taught by
Enhancement and Restoration of Digital Documents
, R. P. Loce and E. R. Dougherty, SPIE Press, 1997, and
Enhancement of Digital Documents
, R. P. Loce and E. R. Dougherty, Electronic Imaging Technology, SPIE Press 1999, and
Two-Dimensional Signal and Image Processing
. J. S. Lim, Prentice Hall, 1990. Many other operations are found in the known literature. Furthermore, other applications of filters used in signal or image processing include, resolution conversion, object detection, speckle-removal, and edge enhancement.
Nonlinear image or signal processing is a general representation of signal or image filtering based on a logical decomposition of a filter into a set of relatively simple operators. Any windowed increasing shift-invariant filter can be represented as a combination of simple operations called erosions as taught by
Nonlinear Filters for Image Processing
, E. R. Dougherty and J. Astola (eds.), SPIE/IEEE Press, 1999. The term nonlinear refers to the entire class of windowed filters that includes linear filters, i.e., those filters computed by convolution.
Since filters can be highly complex and repeatedly be executed millions of times in rapid succession in order to perform a single operation on a given image or signal, what is needed in the arts are compact, efficient computing architectures directed towards this end. Efficient architectures depend on filter representations. If a filter can be broken down into its base operations, it might be possible to execute the relatively simple operations in parallel in order to achieve high-speed execution and overall efficiency.
Computational Gray
-
Scale Momphology on Lattices
(
A Comparator
-
Based Image Algebra
)
Part I: Architecture
, E. R. Dougherty and D. Sinha, Real Time Imaging, Vol.1, No.1, 1995, teaches a computer architecture using representations that perform tests in parallel. The representational methods as taught therein express any filtering operation as a collection of logical tests or operations wherein each logical test is associated with a value. If a windowed observation satisfies a test, the filter output is then associated with that value. Although the above architecture is not practical for filters requiring many tests, it does teach a general representational method.
Increasing filters are of special interest in the art of signal processing because they can be more efficiently implemented than a general nonlinear filter. An increasing filter F has the mathematical property that if (x
1
, . . . , x
N
)<=(y
1
, . . . , y
N
), then F(x
1
, . . . , x
N
)<=F(y
1
, . . . , y
N
). It is known in the art that increasing filters can have two orders of magnitude fewer logical comparisons in their representations that a general non-increasing filter. Applications of increasing filters known in the art are thinning, thickening, hole-filling, restoration of ragged edges, resolution conversion, median filtering, and noise removal.
It is the aim of the present invention to overcome the conventional prior art print limitations, as described above, by performing logical comparisons in a more compact and efficient way.
SUMMARY OF THE INVENTION
A method for implementing a filter for processing discrete signal image is presented having the steps of first obtaining a plurality of sample values from said discrete signal image and then using each sample value to retrieve a bit vector from a plurality of tables. Afterwhich a logical AND on the set of retrieved bit vectors is performed and the position of the largest non-zero bit is determined. Then, this position is used to index into a table of filter values. The corresponding filter value is then retrieved from the table.
Additional benefits and advantages of the present invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of this invention. The advantages of this invention, as described herein, may be realized and obtained by means particularly pointed out and distinctly claimed in the appended claims, taken in conjunction with the accompanying drawings and detailed specification.


REFERENCES:
patent: 4589084 (1986-05-01), Fling et al.
patent: 4661948 (1987-04-01), Shapiro et al.
patent: 4674045 (1987-06-01), Kerber et al.
patent: 4771396 (1988-09-01), South et al.
patent: 4941191 (1990-07-01), Miller
patent: 5873081 (1999-02-01), Harel
patent: 6071004 (2000-06-01), Le Gall et al.
patent: 6173388 (2001-01-01), Abercrombie et al.
patent: 6295546 (2001-09-01), Adiletta

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method for generating increasing shift-invariant filters does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for generating increasing shift-invariant filters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for generating increasing shift-invariant filters will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3275423

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.