US4754492A — Method and system for adapting a digitized signal…

Claim 1

Independent Claim 255 words

A method for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, comprising the steps of: transform coding said digitized signal in accordance with a first composite spatial operator to obtain a first transform coded signal, said first composite spatial operator comprising: a first spatial transform coding operator characterized by M 1 ×M 2 × . . . ×M n basis functions, where said first spatial transform operator is operative over an n-dimensional peripheral annulus of (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(m n +2K n ) blocks of said sample values of said digitized signal, where K 1 , K 2 , . . . , K n are non-negative integers, and at least one of K 1 , K 2 , . . . , K n is non-zero, and a first block processing operator characterized by M 1 ×M 2 × . . . ×M n blocks, said first block processing operator being characterized by M 1 ×M 2 × . . . ×M n basis functions, where said first block processing operator is operative over M 1 ×M 2 × . . . ×M n blocks of said signal values generated by said first spatial transform operator, said first transformed signal being a block processed signal.

Claim 2

Independent Claim 255 words

A method for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, comprising the steps of: transform coding said digitized signal in accordance with a first composite spatial operator to obtain a first transform coded signal, said first composite spatial operator comprising: a first spatial transform coding operator characterized by M 1 ×M 2 × . . . ×M n basis functions, where said first spatial transform operator is operative over an n-dimensional peripheral annulus of (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(m n +2K n ) blocks of said sample values of said digitized signal, where K 1 , K 2 , . . . , K n are non-negative integers, and at least one of K 1 , K 2 , . . . , K n is non-zero, and a first block processing operator characterized by M 1 ×M 2 × . . . ×M n blocks, said first block processing operator being characterized by M 1 ×M 2 × . . . ×M n basis functions, where said first block processing operator is operative over M 1 ×M 2 × . . . ×M n blocks of said signal values generated by said first spatial transform operator, said first transformed signal being a block processed signal.

Claim 3

Dependent Claim 55 words

A method according to claim 1 comprising the further step of: transforming said first transform coded signal in accordance with a second composite spatial operator to obtain an output transformed signal, said second composite spatial operator including a second block processing operator characterized by M 1 ×M 2 × . . . ×M n blocks.

Claim 4

Dependent Claim 33 words

A method according to claim 2 wherein said output transformed signal substantially corresponds to said digitized signal, and said second composite spatial operator being substantially the inverse of said first composite spatial operator.

Claim 5

Dependent Claim 30 words

A method according to claim 3 wherein said first block processing operator comprises a discrete cosine transform (DCT) operator and said second composite spatial operator comprises an inverse DCT operator.

Claim 6

Dependent Claim 16 words

A method according to claim 3 wherein said first and second composite spatial operators are non-orthogonal.

Claim 7

Dependent Claim 69 words

A method according to claim 2 comprising after said first composite spatial operator transform coding step and before said second composite spatial operator transforming step, the further sub-steps of: encoding said block processed signal to obtain an encoded signal adapted for transmission over a communications medium, transmitting said encoded signal over said medium, receiving said encoded signal and decoding said received encoded signal to re-obtain said block processed signal.

Claim 8

Dependent Claim 30 words

A method according to claim 2 wherein said first block processing operator comprises a discrete cosine transform (DCT) operator and said second composite spatial operator comprises an inverse DCT operator.

Claim 9

Dependent Claim 19 words

A method according to claim 1 wherein said first block processing operator comprises a discrete cosine transform (DCT) operator.

Claim 10

Dependent Claim 139 words

A method according to claim 1 wherein said first composite spatial operator has the form of the product of a window function and a modified discrete cosine transform (DCT) operator, wherein said modified DCT operator being characterized by M 1 ×M 2 × . . . ×M n basis functions operative over (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of sample values of said digitized signal, and wherein said window function is an n-dimensional sequence and wherein said window function is symmetrical in each of said n-dimensions, and wherein for each sample value in a block, the sum of the window function for that sample value in that block and the window functions for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 11

Dependent Claim 8 words

A method according to claim 1 wherein n=1.

Claim 12

Dependent Claim 8 words

A method according to claim 1 wherein n=2.

Claim 13

Dependent Claim 69 words

A method according to claim 1 wherein said transform coding in accordance with said first spatial transform coding operator comprises the step of modifying said sample values by replacing selective ones of said sample values in said blocks with modified sample values, said modified sample values being equal to the combination of pairs of associated sample values symmetrically disposed about the boundaries between adjacent blocks of said digitized signal.

Claim 14

Dependent Claim 24 words

A method according to claim 12 wherein said modifying step includes the sub-step of generating weighted linear combinations of said pairs of sample values.

Claim 15

Dependent Claim 46 words

A method according to claim 13 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 16

Independent Claim 30 words

A method according to claims 12 or 13 wherein the distribution of weighting coefficients of said combinations for each of said pairs in a block is symmetrical across that block.

Claim 17

Dependent Claim 46 words

A method according to claim 15 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 18

Dependent Claim 186 words

In a method for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, including the step of transform coding said digitized signal in accordance with a first block processing operator to obtain a first transform coded signal, said block processing operator being characterized by M 1 ×M 2 × . . . ×M n basis functions, the improvement being the further step of: controlling said transform coding step whereby said block processing operator is operative over (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of said sample values of said digitized signal, where K 1 , K 2 , . . . , K n are non-negative integers, and at least one of K 1 , K 2 , . . . , K n is non-zero, said first transform coded signal being a block processed signal.

Claim 19

Dependent Claim 186 words

In a method for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, including the step of transform coding said digitized signal in accordance with a first block processing operator to obtain a first transform coded signal, said block processing operator being characterized by M 1 ×M 2 × . . . ×M n basis functions, the improvement being the further step of: controlling said transform coding step whereby said block processing operator is operative over (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of said sample values of said digitized signal, where K 1 , K 2 , . . . , K n are non-negative integers, and at least one of K 1 , K 2 , . . . , K n is non-zero, said first transform coded signal being a block processed signal.

Claim 20

Dependent Claim 52 words

A method according to claim 17 comprising the further step of: transforming said block processed signal in accordance with a composite spatial operator to obtain an output transformed signal, said composite spatial operator comprising a second block processing operator characterized by M 1 ×M 2 × . . . ×M n blocks.

Claim 21

Dependent Claim 30 words

A method according to claim 18 wherein said first block processing operator comprises a discrete cosine transform (DCT) operator and said second composite spatial operator comprises an inverse DCT operator.

Claim 22

Dependent Claim 34 words

A method according to claim 18 wherein said output transformed signal substantially corresponds to said digitized signal, and said composite spatial operator being substantially the inverse of the operator of said controlled transforming step.

Claim 23

Dependent Claim 29 words

A method according to claim 20 wherein said first block processing operator comprises a discrete cosine transform (DCT) operator and said composite spatial operator comprises an inverse DCT operator.

Claim 24

Dependent Claim 65 words

A method according to claim 18 comprising between said first controlled transform coding step and said composite spatial operator transforming step, the further sub-steps of: encoding said block processed signal to obtain an encoded signal adapted for transmission over a communications medium, transmitting said encoded signal over said medium, receiving said encoded signal and decoding said received encoded signal to re-obtain said block processed signal.

Claim 25

Dependent Claim 19 words

A method according to claim 17 wherein said first block processing operator comprises a discrete cosine transform (DCT) operator.

Claim 26

Dependent Claim 145 words

A method according to claim 17 wherein said controlled transform coding corresponds to a controlled spatial operator having the form of the product of a window function and a modified discrete cosine transform (DCT) operator, wherein said modified DCT operator being characterized by M 1 ×M 2 × . . . ×M n basis functions operative over (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of sample values of said digitized signal, and wherein said window function is an n-dimensional sequence and wherein said window function is symmetrical in each of said n dimensions, and wherein for each sample value in a block, the sum of the window function for that sample value in that block and the window functions for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 27

Dependent Claim 8 words

A method according to claim 17 wherein n=1.

Claim 28

Dependent Claim 8 words

A method according to claim 17 wherein n=2.

Claim 29

Dependent Claim 68 words

A method according to claim 17 wherein said transform coding in accordance with said first block processing operator comprises the step of modifying said sample values by replacing selective ones of said sample values in said blocks with modified sample values, said modified sample values being equal to the combination of pairs of associated sample values symmetrically disposed about the boundaries between adjacent blocks of said digitized signal.

Claim 30

Dependent Claim 24 words

A method according to claim 27 wherein said modifying step includes the sub-step of generating weighted linear combinations of said pairs of sample values.

Claim 31

Dependent Claim 46 words

A method according to claim 28 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 32

Independent Claim 30 words

A method according to claims 27 or 28 wherein the distribution of weighting coefficients of said combinations for each of said pairs in a block is symmetrical across that block.

Claim 33

Dependent Claim 46 words

A method according to claim 30 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 34

Independent Claim 166 words

A method for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, comprising the sequential steps of: A. transform coding said digitized signal in accordance with a first spatial transform coding operator to obtain a first transform coded signal, whereby said first tranform coded signal differs from said digitized signal at corresponding sample values contiguous to and including the boundaries of said adjacent blocks, and said first transform coded signal is substantially the same as said digitized signal otherwise, and B. transforming said first transform coded signal in accordance with a second spatial transform operator to obtain an output transformed signal, whereby said output transformed signal substantially corresponds to said digitized signal, said second spatial transform operator being substantially the inverse of said first spatial transform operator.

Claim 35

Independent Claim 166 words

A method for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, comprising the sequential steps of: A. transform coding said digitized signal in accordance with a first spatial transform coding operator to obtain a first transform coded signal, whereby said first tranform coded signal differs from said digitized signal at corresponding sample values contiguous to and including the boundaries of said adjacent blocks, and said first transform coded signal is substantially the same as said digitized signal otherwise, and B. transforming said first transform coded signal in accordance with a second spatial transform operator to obtain an output transformed signal, whereby said output transformed signal substantially corresponds to said digitized signal, said second spatial transform operator being substantially the inverse of said first spatial transform operator.

Claim 36

Dependent Claim 57 words

A method according to claim 32 comprising the further step of block processing said first transform coded signal prior to step B, said block processing being in accordance with a block process characterized by M 1 ×M 2 × . . . ×M n blocks, thereby establishing said first transform coded signal as a block processed signal.

Claim 37

Dependent Claim 60 words

A method according to claim 33 wherein said block processing step comprises the sub-steps of: encoding said block encoded signal to obtain an encoded signal adapted for transmission over a communications medium, transmitting said encoded signal over said medium, receiving said encoded signal and decoding said received encoded signal to obtain a decoded signal corresponding to said first transformed signal.

Claim 38

Independent Claim 18 words

A method according to claims 32 or 33 wherein said first and second spatial transform operators are non-orthogonal.

Claim 39

Independent Claim 106 words

A method according to claims 32 or 33 wherein said first spatial transform coding operator is characterized by M 1 ×M 2 × . . . M n basis functions and where said first spatial transform operator is operative over an n dimensional peripheral annulus of (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M N +2K n ) blocks of said sample values of said digitized signal, where K 1 , K 2 , . . . , K n are integers, and at least one of K 1 , K 2 , . . . , K n is non-zero.

Claim 40

Dependent Claim 16 words

A method according to claim 36 wherein said first and second spatial transform operators are non-orthogonal.

Claim 41

Dependent Claim 69 words

A method according to claim 32 wherein said transform coding in accordance with said first spatial transform coding operator comprises the step of modifying said sample values by replacing selective ones of said sample values in said blocks with modified sample values, said modified sample values being equal to the combination of pairs of associated sample values symmetrically disposed about the boundaries between adjacent blocks of said digitized signal.

Claim 42

Dependent Claim 24 words

A method according to claim 38 wherein said modifying step includes the sub-step of generating weighted linear combinations of said pairs of sample values.

Claim 43

Dependent Claim 46 words

A method according to claim 39 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 44

Independent Claim 30 words

A method according to claims 38 or 39 wherein the distribution of weighting coefficients of said combinations for each of said pairs in a block is symmetrical across that block.

Claim 45

Dependent Claim 46 words

A method according to claim 41 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 46

Independent Claim 221 words

A method for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, comprising the sequential steps of: A. transform coding said digitized signal in accordance with a first spatial transform coding operator to obtain a first transform coded signal, said first spacial transform coding operator being characterized by M 1 ×M 2 × . . . M n basis functions, where said first spatial transform coding operator is operative over an n dimensional peripheral annulus of (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of sample values of said digitized signal, where K 1 , K 2 , . . . , K n are integers, and at least one of K 1 , K 2 , . . . , K n is non-zero, and B. transforming said transform coded signal in accordance with a second spatial transform operator to obtain an output transformed signal, whereby said output transformed signal substantially corresponds to said digitized signal, and said second spatial transform operator being substantially the inverse of said first spatial transform.

Claim 47

Independent Claim 221 words

A method for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, comprising the sequential steps of: A. transform coding said digitized signal in accordance with a first spatial transform coding operator to obtain a first transform coded signal, said first spacial transform coding operator being characterized by M 1 ×M 2 × . . . M n basis functions, where said first spatial transform coding operator is operative over an n dimensional peripheral annulus of (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of sample values of said digitized signal, where K 1 , K 2 , . . . , K n are integers, and at least one of K 1 , K 2 , . . . , K n is non-zero, and B. transforming said transform coded signal in accordance with a second spatial transform operator to obtain an output transformed signal, whereby said output transformed signal substantially corresponds to said digitized signal, and said second spatial transform operator being substantially the inverse of said first spatial transform.

Claim 48

Dependent Claim 57 words

A method according to claim 43 comprising the further step of: block processing said first transform coded signal prior to step B, said block processing being in accordance with a block process characterized by M 1 ×M 2 × . . . ×M n blocks, thereby establishing said first transform coded signal as a block processed signal.

Claim 49

Dependent Claim 60 words

A method according to claim 44 wherein said block processing step comprises the sub-steps of: encoding said block encoded signal to obtain an encoded signal adapted for transmission over a communications medium, transmitting said encoded signal over said medium, receiving said encoded signal and decoding said received encoded signal to obtain a decoded signal corresponding to said first transformed signal.

Claim 50

Independent Claim 18 words

A method according to claims 43 or 44 wherein said first and second spatial transform operators are non-orthogonal.

Claim 51

Dependent Claim 69 words

A method according to claim 43 wherein said transform coding in accordance with said first spatial transform coding operator comprises the step of modifying said sample values by replacing selective ones of said sample values in said blocks with modified sample values, said modified sample values being equal to the combination of pairs of associated sample values symmetrically disposed about the boundaries between adjacent blocks of said digitized signal.

Claim 52

Dependent Claim 24 words

A method according to claim 47 wherein said modifying step includes the sub-step of generating weighted linear combinations of said pairs of sample values.

Claim 53

Dependent Claim 46 words

A method according to claim 48 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 54

Independent Claim 30 words

A method according to claims 47 or 48 wherein the distribution of weighting coefficients of said combinations for each of said pairs in a block is symmetrical across that block.

Claim 55

Dependent Claim 46 words

A method according to claim 50 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 56

Independent Claim 254 words

A system for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, comprising: means for transform coding said digitized signal in accordance with a first composite spatial operator to obtain a first transform coded signal, said first composite spatial operator comprising: a first spatial transform coding operator characterized by M 1 ×M 2 × . . . ×M n basis functions, where said first spatial transform operator is operative over an n-dimensional peripheral annulus of (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of said sample values of said digitized signal, where K 1 , K 2 , . . . , K n are non-negative integers, and at least one of K 1 , K 2 , . . . , K n is non-zero, and a first block processing operator characterized by M 1 ×M 2 × . . . ×M n blocks, said first block processing operator being characterized by M 1 ×M 2 × . . . ×M n basis functions, where said first block processing operator is operative over M 1 ×M 2 × . . . ×M n blocks of said signal values generated by said first spatial transform operator, said first transformed signal being a block processed signal.

Claim 57

Independent Claim 254 words

A system for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, comprising: means for transform coding said digitized signal in accordance with a first composite spatial operator to obtain a first transform coded signal, said first composite spatial operator comprising: a first spatial transform coding operator characterized by M 1 ×M 2 × . . . ×M n basis functions, where said first spatial transform operator is operative over an n-dimensional peripheral annulus of (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of said sample values of said digitized signal, where K 1 , K 2 , . . . , K n are non-negative integers, and at least one of K 1 , K 2 , . . . , K n is non-zero, and a first block processing operator characterized by M 1 ×M 2 × . . . ×M n blocks, said first block processing operator being characterized by M 1 ×M 2 × . . . ×M n basis functions, where said first block processing operator is operative over M 1 ×M 2 × . . . ×M n blocks of said signal values generated by said first spatial transform operator, said first transformed signal being a block processed signal.

Claim 58

Dependent Claim 54 words

A system according to claim 52 further comprising: means for transforming said first transform coded signal in accordance with a second composite spatial operator to obtain an output transformed signal, said second composite signal operator including a second block processing operator characterized by M 1 ×M 2 × . . . ×M n blocks.

Claim 59

Dependent Claim 33 words

A system according to claim 53 wherein said output transformed signal substantially corresponds to said digitized signal, and said second composite spatial operator being substantially the inverse of said first composite spatial operator.

Claim 60

Dependent Claim 30 words

A system according to claim 54 wherein said first block processing operator comprises a discrete cosine transform (DCT) operator and said second composite spatial operator comprises an inverse DCT operator.

Claim 61

Dependent Claim 16 words

A system according to claim 54 wherein said first and second composite spatial operators are non-orthogonal.

Claim 62

Dependent Claim 78 words

A system according to claim 53 comprising means operative after said means for transform coding in accordance with said first composite spatial operator and before said means for transforming in accordance with said second composite spatial operator for: encoding said block processed signal to obtain an encoded signal adapted for transmission over a communications medium, transmitting said encoded signal over said medium, receiving said encoded signal and decoding said received encoded signal to re-obtain said block processed signal.

Claim 63

Dependent Claim 30 words

A system according to claim 53 wherein said first block processing operator comprises a discrete cosine transform (DCT) operator and said second composite spatial operator comprises an inverse DCT operator.

Claim 64

Dependent Claim 19 words

A system according to claim 52 wherein said first block processing operator comprises a discrete cosine transform (DCT) operator.

Claim 65

Dependent Claim 140 words

A system according to claim 52 wherein said first composite spatial operator has the form of the product of a window function and a modified discrete cosine transform (DCT) operator, wherein said modified DCT operator being characterized by M 1 ×M 2 × . . . ×M n basis functions operative over (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of sample values of said digitized signal, and wherein said window function is an n-dimensional sequence and wherein said window function is symmetrical in each of said n dimensions, and wherein for each sample value in a block, the sum of the window function for that sample value in that block and the window functions for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 66

Dependent Claim 8 words

A system according to claim 52 wherein n=1.

Claim 67

Dependent Claim 8 words

A system according to claim 52 wherein n=2.

Claim 68

Dependent Claim 70 words

A system according to claim 52 wherein said means for transform coding in accordance with said first spatial transform coding operator comprises means for modifying said sample values by replacing selective ones of said sample values in said blocks with modified sample values, said modified sample values being equal to the combination of pairs of associated sample values symmetrically disposed about the boundaries between adjacent blocks of said digitized signal.

Claim 69

Dependent Claim 23 words

A system according to claim 63 wherein said means modifying includes means for generating weighted linear combinations of said pairs of sample values.

Claim 70

Dependent Claim 46 words

A system according to claim 64 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 71

Dependent Claim 30 words

A system according to claim 63 or 64 wherein the distribution of weighting coefficients of said combinations for each of said pairs in a block is symmetrical across that block.

Claim 72

Dependent Claim 46 words

A system according to claim 66 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 73

Dependent Claim 182 words

In a system for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, including means for transform coding said digitized signal in accordance with a first block processing operator to obtain a first transform coded signal, said block processing operator being characterized by M 1 ×M 2 × . . . ×M n basis functions, the improvement including: means controlling said transform coding step whereby said block processing operator is operative over (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of said sample values of said digitized signal, where K 1 , K 2 , . . . , K n are non-negative integers, and at least one of K 1 , K 2 , . . . , K n is non-zero, said first transform coded signal being a block processed signal.

Claim 74

Dependent Claim 182 words

In a system for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, including means for transform coding said digitized signal in accordance with a first block processing operator to obtain a first transform coded signal, said block processing operator being characterized by M 1 ×M 2 × . . . ×M n basis functions, the improvement including: means controlling said transform coding step whereby said block processing operator is operative over (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of said sample values of said digitized signal, where K 1 , K 2 , . . . , K n are non-negative integers, and at least one of K 1 , K 2 , . . . , K n is non-zero, said first transform coded signal being a block processed signal.

Claim 75

Dependent Claim 51 words

A system according to claim 68 further comprising: means for transforming said block processed signal in accordance with a composite spatial operator to obtain an output transformed signal, said composite spatial operator comprising a second block processing operator characterized by M 1 ×M 2 × . . . ×M n blocks.

Claim 76

Dependent Claim 34 words

A system according to claim 69 wherein said output transformed signal substantially corresponds to said digitized signal, and said composite spatial operator being substantially the inverse of the operator of said controlled transforming step.

Claim 77

Dependent Claim 29 words

A system according to claim 70 wherein said first block processing operator comprises a discrete cosine transform (DCT) operator and said composite spatial operator comprises an inverse DCT operator.

Claim 78

Dependent Claim 67 words

A system according to claim 69 comprising means operative after said controlling means and before said means for transform coding in accordance with composite spatial operator, for: encoding said block processed signal to obtain an encoded signal adapted for transmission over a communications medium, transmitting said encoded signal over said medium, receiving said encoded signal and decoding said received encoded signal to re-obtain said block processed signal.

Claim 79

Dependent Claim 30 words

A system according to claim 69 wherein said first block processing operator comprises a discrete cosine transform (DCT) operator and said second composite spatial operator comprises an inverse DCT operator.

Claim 80

Dependent Claim 19 words

A system according to claim 68 wherein said first block processing operator comprises a discrete cosine transform (DCT) operator.

Claim 81

Dependent Claim 147 words

A system according to claim 68 wherein said means for controlling said transform coding effects a controlled spatial operator having the form of the product of a window function and a modified discrete cosine transform (DCT) operator, wherein said modified DCT operator being characterized by M 1 ×M 2 × . . . ×M n basis functions operative over (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of sample values of said digitized signal, and wherein said window function is an n-dimensional sequence and wherein said window function is symmetrical in each of said n dimensions, and wherein for each sample value in a block, the sum of the window function for that sample value in that block and the window functions for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 82

Dependent Claim 8 words

A system according to claim 68 wherein n=1.

Claim 83

Dependent Claim 8 words

A system according to claim 68 wherein n=2.

Claim 84

Dependent Claim 71 words

A system according to claim 68 wherein said means for transform coding in accordance with said first block processing transform operator comprises the means for modifying said sample values by replacing selective ones of said sample values in said blocks with modified sample values, said modified sample values being equal to the combination of pairs of associated sample values symmetrically disposed about the boundaries between adjacent blocks of said digitized signal.

Claim 85

Dependent Claim 23 words

A system according to claim 78 wherein said modified means includes means for generating weighted linear combinations of said pairs of sample values.

Claim 86

Dependent Claim 46 words

A system according to claim 79 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 87

Independent Claim 30 words

A system according to claims 78 or 79 wherein the distribution of weighting coefficients of said combinations for each of said pairs in a block is symmetrical across that block.

Claim 88

Dependent Claim 46 words

A system according to claim 81 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 89

Independent Claim 166 words

A system for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, comprising: A. means for transform coding said digitized signal in accordance with a first spatial transform coding operator to obtain a first transform coded signal, whereby said first transform coded signal differs from said digitized signal at corresponding sample values contiguous to and including the boundaries of said adjacent blocks, and said first transform coded signal is substantially the same as said digitized signal otherwise, and B. means for transform coding said first transformed signal in accordance with a second spatial transform operator to obtain an output transformed signal, whereby said output transformed signal substantially corresponds to said digitized signal, said second spatial transform operator being substantially the inverse of said first spatial transform operator.

Claim 90

Independent Claim 166 words

A system for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, comprising: A. means for transform coding said digitized signal in accordance with a first spatial transform coding operator to obtain a first transform coded signal, whereby said first transform coded signal differs from said digitized signal at corresponding sample values contiguous to and including the boundaries of said adjacent blocks, and said first transform coded signal is substantially the same as said digitized signal otherwise, and B. means for transform coding said first transformed signal in accordance with a second spatial transform operator to obtain an output transformed signal, whereby said output transformed signal substantially corresponds to said digitized signal, said second spatial transform operator being substantially the inverse of said first spatial transform operator.

Claim 91

Dependent Claim 69 words

A system according to claim 83 comprising the further means for block processing said first transform coded signal prior to the operation of said means for transforming in accordance with said second spatial operator, said block processing being in accordance with a block process characterized by M 1 ×M 2 × . . . ×M n blocks, thereby establishing said first transform coded signal as a block processed signal.

Claim 92

Dependent Claim 59 words

A system according to claim 84 wherein said block processing means comprises means for: encoding said block encoded signal to obtain an encoded signal adapted for transmission over a communications medium, transmitting said encoded signal over said medium, receiving said encoded signal and decoding said received encoded signal to obtain a decoded signal corresponding to said first transformed signal.

Claim 93

Independent Claim 106 words

A system according to claims 83 or 84 wherein said first spatial transform coding operator is characterized by M 1 ×M 2 × . . . M n basis functions and where said first spatial transform operator is operative over an n dimensional peripheral annulus of (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M N +2K n ) blocks of said sample values of said digitized signal, where K 1 , K 2 , . . . , K n are integers, and at least one of K 1 , K 2 , . . . , K n is non-zero.

Claim 94

Dependent Claim 16 words

A system according to claim 86 wherein said first and second spatial transform operators are non-orthogonal.

Claim 95

Independent Claim 18 words

A system according to claims 83 or 84 wherein said first and second spatial transform operators are non-orthogonal.

Claim 96

Dependent Claim 70 words

A system according to claim 83 wherein said means for transform coding in accordance with said first spatial transform coding operator comprises means for modifying said sample values by replacing selective ones of said sample values in said blocks with modified sample values, said modified sample values being equal to the combination of pairs of associated sample values symmetrically disposed about the boundaries between adjacent blocks of said digitized signal.

Claim 97

Dependent Claim 23 words

A system according to claim 89 wherein said modifying means includes means for generating weighted linear combinations of said pairs of sample values.

Claim 98

Dependent Claim 46 words

A system according to claim 90 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 99

Independent Claim 30 words

A system according to claims 89 or 90 wherein the distribution of weighting coefficients of said combinations for each of said pairs in a block is symmetrical across that block.

Claim 100

Dependent Claim 46 words

A system according to claim 92 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 101

Independent Claim 224 words

A system for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, comprising the sequential steps of: A. means for transform coding said digitized signal in accordance with a first spatial transform coding operator to obtain a first transform coded signal, and first spatial transform coding operator being characterized by M 1 ×M 2 × . . . M n basis functions, where said first spatial transform operator is operative over an n dimensional peripheral annulus of (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of sample values of said digitized signal, where K 1 , K 2 , . . . , K n are integers, and at least one of K 1 , K 2 , . . . , K n is non-zero, and B. means for transforming said transform coded signal in accordance with a second spatial transform operator to obtain an output transformed signal, whereby said output transformed signal substantially corresponds to said digitized signal, and said second spatial transform operator being substantially the inverse of said first spatial transform.

Claim 102

Independent Claim 224 words

A system for processing an n-dimensional digitized signal containing at least two adjacent M 1 ×M 2 × . . . ×M n blocks of digitized sample values, where M 1 , M 2 , . . . , M n are integers respectively associated with one of said n dimensions, comprising the sequential steps of: A. means for transform coding said digitized signal in accordance with a first spatial transform coding operator to obtain a first transform coded signal, and first spatial transform coding operator being characterized by M 1 ×M 2 × . . . M n basis functions, where said first spatial transform operator is operative over an n dimensional peripheral annulus of (M 1 +2K 1 )×(M 2 +2K 2 )× . . . ×(M n +2K n ) blocks of sample values of said digitized signal, where K 1 , K 2 , . . . , K n are integers, and at least one of K 1 , K 2 , . . . , K n is non-zero, and B. means for transforming said transform coded signal in accordance with a second spatial transform operator to obtain an output transformed signal, whereby said output transformed signal substantially corresponds to said digitized signal, and said second spatial transform operator being substantially the inverse of said first spatial transform.

Claim 103

Dependent Claim 65 words

A system according to claim 94 further comprising: means for block processing said first transformed signal prior to operation of said means for transforming in accordance with said second spatial operator, said block processing being in accordance with a block process characterized by M 1 ×M 2 × . . . ×M n blocks, thereby establishing said first transformed signal as a block processed signal.

Claim 104

Dependent Claim 59 words

A system according to claim 95 wherein said block processing means comprises means for: encoding said block encoded signal to obtain an encoded signal adapted for transmission over a communications medium, transmitting said encoded signal over said medium, receiving said encoded signal and decoding said received encoded signal to obtain a decoded signal corresponding to said first transformed signal.

Claim 105

Dependent Claim 18 words

A system according to claim 94 or 95 wherein said first and second spatial transform operators are non-orthogonal.

Claim 106

Dependent Claim 71 words

A system according to claim 94 wherein said means for transform coding in accordance with said first spatial transform coding operator comprises the means for modifying said sample values by replacing selective ones of said sample values in said blocks with modified sample values, said modified sample values being equal to the combination of pairs of associated sample values symmetrically disposed about the boundaries between adjacent blocks of said digitized signal.

Claim 107

Dependent Claim 23 words

A system according to claim 98 wherein said modifying means includes means for generating weighted linear combinations of said pairs of sample values.

Claim 108

Dependent Claim 46 words

A system according to claim 99 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value in all blocks adjacent to that block is a predetermined value.

Claim 109

Independent Claim 30 words

A system according to claims 98 or 99 wherein the distribution of weighting coefficients of said combinations for each of said pairs in a block is symmetrical across that block.

Claim 110

Dependent Claim 46 words

A system according to claim 101 wherein for each sample value in a block, the sum of said weighting coefficients for that sample value in that block and the weighting coefficients for that sample value on all blocks adjacent to that block is a predetermined value.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1991-06-28	1991-12-28	1992-06-28	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	1995-06-28	1995-12-28	1996-06-28	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	1999-06-28	1999-12-28	2000-06-28	$7700.00	Window Closed / Lapsed

Method and system for adapting a digitized signal processing system for block processing with minimal blocking artifacts

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag