US4375650A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for processing video signals
Assignee: Television Analog Compression Corp
•
Filing: 1981-04-29
•
Granted: 1983-03-01
•
Expires: 2001-04-29
Abstract
Abstract A video processing system in which each field of image data is divided into rows and columns of blocks of picture elements. The number of blocks utilized is large enough so that when each block is considered to be a picture element, the blocks provide a reasonable raster for the peripheral vision aspect of the human visual perception system. The blocks of picture elements are transformed into blocks of spatial frequency components. The zero and low spatial frequency components of the blocks of spatial frequency transforms are updated at a sufficiently rapid rate to satisfy the requirements of the peripheral vision aspect of the human perception system. The higher spatial frequency components of the blocks of spatial frequency are updated at a lower rate corresponding to the rate at which the human perception system can respond to such information.
Inventors
- 👤 Jerome J. Tiemann
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 13:25
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/10; H04N19/134; H04N19/154; H04N19/102; H04N19/115; H04N19/169; H04N19/17; H04N19/176; H04N19/124; H04N19/132; H04N19/60
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
391 words
In combination, means for providing a video signal having a plurality of first sequences of values, each value of a first sequence derived from the intensity of a respective element of a picture, said picture having a plurality of elements mappable into rows and columns thereof, said picture being segmented into a plurality of identical blocks of elements, each block having rows and columns of elements, each block of elements represented by a respective set of subsequences of said first sequence of values, means for transforming each of said first sequences into a respective second sequence of values, said transformation including transforming each set of subsequences of a first sequence corresponding to a block of picture elements into a respective set of spatial frequency components of a respective block thereof, each block of spatial frequency components including rows representing different values of vertical spatial frequency ranging from low to high values of spatial frequency, and columns representing different values of horizontal spatial frequency ranging from the low to high values of spatial frequency, each component being a unique combination of a row and a column spatial frequency, said block of components being segmented into several groups of components, each group including components of a different range of spatial frequency values, the group including the component with both spatial frequency values equal to zero being designated the first group and the group including the component with the largest sum of spatial frequency values being designated the last group, said groups of components including different numbers of components, the first group including the smallest number of components and at least one of the other groups having the largest number of components, each second sequence including a series of sets of components, each set of a second sequence including a predetermined number of spatial frequency components from each of said groups arranged in a predetermined order within and among said groups, correspondingly ordered spatial frequency components from said sets of a second sequence having the same spatial frequency values, sets of components of successive second sequences having successively different combinations of spatial frequency components in accordance with a predetermined schedule, a predetermined number of successive second sequences equal to the number of components in the largest of said groups constituting a supersequence, successive supersequences representing successive pluralities of successive pictures corresponding to a scene.
Claim 2
Dependent Claim
391 words
In combination, means for providing a video signal having a plurality of first sequences of values, each value of a first sequence derived from the intensity of a respective element of a picture, said picture having a plurality of elements mappable into rows and columns thereof, said picture being segmented into a plurality of identical blocks of elements, each block having rows and columns of elements, each block of elements represented by a respective set of subsequences of said first sequence of values, means for transforming each of said first sequences into a respective second sequence of values, said transformation including transforming each set of subsequences of a first sequence corresponding to a block of picture elements into a respective set of spatial frequency components of a respective block thereof, each block of spatial frequency components including rows representing different values of vertical spatial frequency ranging from low to high values of spatial frequency, and columns representing different values of horizontal spatial frequency ranging from the low to high values of spatial frequency, each component being a unique combination of a row and a column spatial frequency, said block of components being segmented into several groups of components, each group including components of a different range of spatial frequency values, the group including the component with both spatial frequency values equal to zero being designated the first group and the group including the component with the largest sum of spatial frequency values being designated the last group, said groups of components including different numbers of components, the first group including the smallest number of components and at least one of the other groups having the largest number of components, each second sequence including a series of sets of components, each set of a second sequence including a predetermined number of spatial frequency components from each of said groups arranged in a predetermined order within and among said groups, correspondingly ordered spatial frequency components from said sets of a second sequence having the same spatial frequency values, sets of components of successive second sequences having successively different combinations of spatial frequency components in accordance with a predetermined schedule, a predetermined number of successive second sequences equal to the number of components in the largest of said groups constituting a supersequence, successive supersequences representing successive pluralities of successive pictures corresponding to a scene.
Claim 3
Dependent Claim
61 words
The combination of claim 1 in which said predetermined number of spatial frequency components from said last group included in said sets of said second sequences is zero, and in which a supersequence is constituted of a predetermined number of successive second sequences equal to the number of components in the largest of said groups excluding the last of said group.
Claim 4
Dependent Claim
28 words
The combination of claim 1 including a storage medium and means for storing each of said values of said second sequences of said supersequences in said storage medium.
Claim 5
Dependent Claim
198 words
The combination of claim 3 including means for recovering each of said values of said second sequences of said supersequences from said storage medium, a memory including a plurality of storage locations, means for storing the value of each of the components included in said supersequences of said second sequences in a respective memory location of said memory corresponding to the spatial frequency values thereof, whereby during any one supersequence all of the values of the components of each of the groups of each of said blocks of spatial frequency components are stored at least once, and the components of the groups of said blocks of spatial frequency components other than the components of the largest of said groups thereof are updated several times during the period of a supersequence, means for retrieving each block of components stored in said memory, means for obtaining the inverse transform of each retrieved block of components to obtain a set of subsequences of values corresponding to the intensity of elements of a respective block of elements of a picture, means for assemblying said sets of subsequences of values to obtain a sequence of values corresponding to said first sequence of values.
Claim 6
Dependent Claim
205 words
The combination of claim 1 including a transmission channel, means for transmitting said second sequences over said transmission channel, means for receiving each of said second sequences from said transmission channel, a memory including a plurality of storage locations, means for storing the value of each of the components included in said supersequences of said second sequences in a respective memory location of said memory corresponding to the spatial frequency values thereof, whereby during any one supersequence all of the values of the components of each of the groups of each of said blocks of spatial frequency components are stored at least once, and the components of the groups of said blocks of spatial frequency components other than the components of the largest of said groups thereof are updated several times during the period of a supersequence, means for retrieving each block of components stored in said memory, means for obtaining the inverse transform of each retrieved block of components to obtain a set of subsequences of values corresponding to the intensity of elements of a respective block of elements of a picture, means for assembling said sets of subsequences of values to obtain a sequence of values corresponding to said first sequence of values.
Claim 7
Dependent Claim
20 words
The combination of claim 1 in which the values of said second sequences are in the form of binary words.
Claim 8
Dependent Claim
48 words
The combination of claim 6 in which the words of the components of the group having the smallest number of components include the largest number of bits and the words of the components of the group having the largest number of components include the smallest number of bits.
Claim 9
Dependent Claim
28 words
The combination of claim 1 in which each of said blocks of components of spatial frequencies is a discrete cosine transform of a respective block of picture elements.
Claim 10
Dependent Claim
27 words
The combination of claim 1 in which each of said blocks of components of spatial frequencies is a Walsh-Hadamard transform of a respective block of picture elements.
Claim 11
Dependent Claim
27 words
The combination of claim 1 in which each of said blocks of components of spatial frequencies is a Fourier transform of a respective block of picture elements.
Claim 12
Dependent Claim
63 words
The combination of claim 4 in which the operation of said means for retrieving and said means for transforming each block of components to obtain a respective set of subsequence of values, and said means for assemblying said sets of subsequences of values into a first sequence of values occurs over an interval relatively short in relation to the period of a supersequence.
Claim 13
Dependent Claim
37 words
The combination of claim 4 including means programmed in accordance with said predetermined order and said predetermined schedule to direct each of said components of said second sequences to a respective preassigned storage location in said memory.
Claim 14
Dependent Claim
63 words
The combination of claim 5 in which the operation of said means for accessing and said means for transforming each block of components to obtain a respective set of subsequences of values, and said means for assemblying said sets of subsequences of values into a first sequence of values occurs over an interval relatively short in relation to the period of a supersequence.
Claim 15
Dependent Claim
37 words
The combination of claim 5 including means programmed in accordance with said predetermined order and said predetermined schedule to direct each of said components of said second sequences to a respective preassigned storage location in said memory.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1986-02-28 | 1986-08-30 | 1987-03-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1990-02-28 | 1990-08-30 | 1991-03-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1994-02-28 | 1994-08-30 | 1995-03-01 | $7700.00 | Window Closed / Lapsed |