Apparatus for picture processing

• US 4,134,134 A
• Filed: 06/08/1977
• Issued: 01/09/1979
• Est. Priority Date: 06/10/1976
• Status: Expired due to Term

• Current Assignee: US Philips Corporation (Koninklijke Philips N.V.)
• Original Assignee: US Philips Corporation (Koninklijke Philips N.V.)
• Inventors: Lux, Peter
• Primary Examiner(s): Britton, Howard W.
• Application Number:
  US05/804,719
• Time in Patent Office: 580 Days
• Field of Search: 358/260, 358/280, 358/133, 358/138, 364/515, 340/347 DD, 360/8, 360/9
• US Class Current: 358/448
• CPC Class Codes: G06F 17/145 Square transforms, e.g. Hadamard, Walsh, Haar, Hough, Slant transforms
• CPC Class Codes: G06T 5/20 using local operators
• CPC Class Codes: H04N 19/60 using transform coding

Abstract

A Hadamard domain encoder wherein adding and subtracting operations on digitized intensities of 2 × 2 picture points yield secondary results. Likewise processing of groups of 2 × 2 secondary results yields further intermediate and/or final results. The complement of unprocessed secondary and final results fully characterizes the original picture but is better suited for data storage and/or transfer because the energy content of the picture is substantially restricted to a limited region. Redundancy in the stored/transmitted data is thus reduced.

Claims

1. Apparatus for picture processing comprising an input for receiving digitized data values of picture points situated within a predetermined matrix area of 2^N ×

2^N points within a picture according to a predetermined sequence among said points, said input being connected to a first input of a storage means having first and second inputs and first and second outputs and a plurality of separately addressable locations, said apparatus further comprising correlating means having its input connected to said first output and its output connected to said second input for receiving the data values stored in subgroups comprising four of said locations and for multiplying the data of each subgroup with data constituting the basic Hadamard matrix of the second order (H2), for generating the sums of said data and three further correlated data values and for producing the resultant data values on its output, said storage means being adapted for storing data values received on its first and second inputs according to a predetermined first address sequence, said storage means being adapted for accessing all stored data values therein received on its first input and all data values of said sums, only once, according to a predetermined second address sequence and producing the accessed data values in subgroups of 2 ×

2 accessed locations on its first output, the data values of each subgroup all having been correlated the same number of times p in said correlating means and representing the digitized data of 2^p+1 ×

2^p+1 picture points.

2. Apparatus according to claim 1 wherein the maximum value of p = N.

3. Apparatus according to claim 1, wherein said 2^p+1 ×

2^p+1 picture points represent all picture points within a block of consecutively arranged picture points.

4. Apparatus as claimed in claim 1 wherein said storage means comprises a random access storage and an address sequencer for generating a plurality of address sequences for executing a read-process-write operation on the data contained therein.

5. Apparatus according to claim 1, wherein said storage means include means for producing, after termination of said second address sequence, the digitized data values stored therein according to a third address sequence at its second output said second output being connected to an input of quantizer means which function to generate quantized digital data values.

6. Apparatus as claimed in claim 5 wherein an output of said quantizer means is connected to an input of an error detection-code generator.

7. Apparatus as claimed in claim 5, wherein an output of said apparatus is connected to an input of means for receiving digitized and correlated digital data values of picture points and for reconstructing the original picture point data values therefrom, said apparatus including an input for receiving a matrix of 2^N ×

2^N processed data values according to a predetermined sequence, said input being connected to a first input of a storage means having first and second inputs and first and second outputs and a plurality of separately addressable locations, said apparatus further comprising further correlating means having an input connected to said first output and its output connected to said second input for receiving the data values stored in a subgroup comprising four of said locations and for multiplying the data values of each subgroup with data values constituting the basic Hadamard matrix of the second order (H2) for generating the sums of said data values and three further correlated data values and for producing the resultant data values on its output, said storage means being adapted for storing data values received on its first and second inputs according to a predetermined first address sequence, said storage means being adapted for accessing all stored data values therein received on its first input and all data values of said sums, only once, according to a predetermined second address sequence and producing the accessed data values in subgroups of 2 ×

2 accessed locations on its first output, the data values of each subgroup all having been correlated the same number of times p in said further correlating means and representing the digitized data values of 2^p+1 ×

2^p+1 received data values.

8. Apparatus according to claim 1, wherein said storage means include means for producing the digitized data stored therein according to a third address sequence at its second output after termination of said second address sequence, said third sequence starting with those data values which have been correlated p times followed by those data values which have been correlated (p-1) times, the third address sequence for the highest value of p starting with a partial sequence of said sums, and furthermore comprising for each value of p first, second and third partial sequences, the first partial sequence thereof including correlated data values indicating a brightness variation along a first scanning direction within said subgroup, the second partial sequence thereof including correlated data values indicating a brightness variation along a second scanning direction, and the third partial sequence thereof including the remaining correlated data values.

9. Apparatus as claimed in cliam 8, wherein for each value of p up to a predetermined maximum value of p = N-1 said storage means comprises four shift registers having their outputs connected in parallel to inputs of said correlating means for presenting thereto four digital data values, A1, A2, A3, A4 in parallel.

10. Apparatus as claimed in claim 9, whereby said correlating means includes arithmetic means for forming the respective digital values:

space="preserve" listing-type="equation">A1 + A2 + A3 + A4 = B1

space="preserve" listing-type="equation">a1 - a2 + a3 - a4 = b2

space="preserve" listing-type="equation">a1 + a2 - a3 - a4 = b3

space="preserve" listing-type="equation">a1 - a2 - a3 + a4 = b4.

11. apparatus as claimed in claim 9 wherein, whereby the digital data values B2, B3, B4 are fed back to inputs of the same shift registers where three of the data values A1-A4 had been stored.

12. Apparatus as claimed in claim 9, wherein for correlating data values for the 1st, 2nd, 3rd . . . pth time up to at most the (N-1)st time said four shift registers have a capacity of 2^2N-2, 2^N-4, 2^2N-6 . . . stages, each stage accommodating one complete data value to be correlated four at a time.