Appeal No. 2000-2247
Application 08/137,189
odd field and an even field (figures 1 and 2). Krause discloses
(col. 2, lines 24-37):
Successive interlaced video frames are subdivided into
blocks of odd field pixel data and even field pixel data.
The odd field blocks and even field blocks of a first video
frame are stored in memory after further processing
including compression and decompression. Each block of
pixel data from a subsequent second video frame is compared
before compression to similarly situated blocks in both the
odd and even fields of the first video frame. A preferred
first frame counterpart (e.g., the best match) for each
second frame block is determined. A prediction error signal
is generated for each second frame block indicative of the
difference between the block and the odd or even first frame
block it matches best.
This is illustrated in figure 3 where each block (a block is 8
pixels wide and 8 pixels high for a total of 64 pixels per block)
in a current frame is compared to similarly situated blocks in
the odd field and even field. Thus, block 1 of odd field 100
(current frame before compression) is compared to block 1 of
prior frame odd field 102 as well as to block 2 of even field 104
of the prior frame (col. 4, lines 60-63). This embodiment does
not compare a block to a block in a closest vicinity of the
block, as claimed, but compares a block to a block in the same
location in a prior odd or even field.
Krause further discloses (col. 2, lines 44-49):
Page: Previous 1 2 3 4 5 6 7 8 9 Next
Last modified: November 3, 2007