Appeal No. 1998-2989
Application No. 08/566,987
maintains that the methodology of Bhargava would have been obvious to skilled artisans to
implement with binary images because the implementation would have used less memory
and would have been faster to manipulate than gray scale representations. We agree with
the examiner. Furthermore, with the implementation of the methodology of Bhargava to
binary images there would not have been a variation in pixel values beyond the two values
of 0 and 1. Therefore, the skilled artisan need not consider the intensity value difference
between pixels and use of an average since there are only 2 values available. Therefore, it
would have been readily apparent to skilled artisans that the groupings of pixels would
have been based solely upon the common state of the binary pixels.
Appellant argues that the Office has inappropriately relied upon appellant’s
specification as a basis to modify the teachings of Bhargava. (See brief at page 16.) We
disagree with appellant. The examiner has merely relied upon the recitation in the
specification that various prior art references teach the application of compression to
binary image data and that skilled artisans would have been motivated to apply the known
methodology of Bhargava to binary image data. Furthermore, we note that the binary
image data is a subset of the gray scale representation where only the two values are
present. In this special case, the values of 0 and 1 would be coded and grouped based
upon their common values.
5
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 Next
Last modified: November 3, 2007