← Back to Patent Explorer
US4598372A Expired / Lapsed US ⏱️ 0.0 years remaining

Apparatus and method of smoothing MAPS compressed image data

Assignee: Motorola Solutions Inc
•
Filing: 1983-12-28
•
Granted: 1986-07-01
•
Expires: 2003-12-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract MAPS compressed image data is arranged symmetrically so that it can be stored in a substantially reduced memory and operated on for smoothing with substantially less components. A serial and a parallel design are disclosed, both of which have substantially reduced memories and a reduced number of stages for processing of the surround areas.

Inventors

  • 👤 Louis A. McRoberts

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 19:29
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/40; H04N1/409

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 190 words
A method of smoothing MAPS compressed image data including video data and coefficients for a central block of pixels and video data and coefficients for a plurality of surround areas, said method comprising the steps of: arranging coefficients for surround areas CS 1 through CS i symmetrically so they are divided into at least two equal groups; storing the coefficients of one of the equal groups in an order coinciding with the arranging step; retrieving stored coefficients by accessing the stored coefficients in a first sequence for one of the equal groups and accessing the stored coefficients in an opposite sequence for the other of the equal groups; and utilizing the retrieved coefficients and the video data to calculate the output value for any pixel (n) in the central block of pixels from the equation ##EQU2## Where: D=video data for the central block, C n =coefficient for the central block, DS i =video data for the surround areas 1 through i, and CS i =coefficient for the surround areas 1 through i; and applying the calculated output value to display apparatus to produce an image from the compressed image data.
Claim 2
Independent Claim 190 words
A method of smoothing MAPS compressed image data including video data and coefficients for a central block of pixels and video data and coefficients for a plurality of surround areas, said method comprising the steps of: arranging coefficients for surround areas CS 1 through CS i symmetrically so they are divided into at least two equal groups; storing the coefficients of one of the equal groups in an order coinciding with the arranging step; retrieving stored coefficients by accessing the stored coefficients in a first sequence for one of the equal groups and accessing the stored coefficients in an opposite sequence for the other of the equal groups; and utilizing the retrieved coefficients and the video data to calculate the output value for any pixel (n) in the central block of pixels from the equation ##EQU2## Where: D=video data for the central block, C n =coefficient for the central block, DS i =video data for the surround areas 1 through i, and CS i =coefficient for the surround areas 1 through i; and applying the calculated output value to display apparatus to produce an image from the compressed image data.
Claim 3
Dependent Claim 47 words
A method as claimed in claim 1 wherein the storing step includes storing the coefficients in a binary addressable memory and the retrieving step includes generating binary numbers wherein the least significant bits are the address and the most significant bit indicates the equal group being accessed.
Claim 4
Dependent Claim 72 words
A method as claimed in claim 1 wherein the storing step includes storing the coefficients in an addressable memory and reducing the amount of memory utilized by dividing the addressable memory into independent sections, dividing the surround areas into groups with each group containing at least two surround areas which are never accessed simultaneously and storing coefficients for the surround areas in each group in a different section of the addressable memory.
Claim 5
Independent Claim 79 words
A method of reducing the amount of memory utilized in storing information, comprising the steps of: arranging the information symmetrically so it is divided into two equal groups; storing the information of one of the equal groups in an order coinciding with the arranging step; retrieving stored information by accessing the stored information in a first sequence for one of the equal groups and accessing the stored information in an opposite sequence for the other of the equal groups.
Claim 6
Independent Claim 79 words
A method of reducing the amount of memory utilized in storing information, comprising the steps of: arranging the information symmetrically so it is divided into two equal groups; storing the information of one of the equal groups in an order coinciding with the arranging step; retrieving stored information by accessing the stored information in a first sequence for one of the equal groups and accessing the stored information in an opposite sequence for the other of the equal groups.
Claim 7
Dependent Claim 58 words
A method as claimed in claim 4 wherein the storing step includes storing the information in an addressable memory, dividing the addressable memory into independent sections, dividing the information into groups with each group containing at least two sets of information which are never accessed simultaneously and storing each group in a different section of the addressable memory.
Claim 8
Dependent Claim 181 words
Apparatus for smoothing MAPS compressed image data including video data and coefficients for a central block of pixels and video data and coefficients for a plurality of surround areas, said apparatus comprising: addressble memory means having stored therein coefficients for the plurality of surround areas, the coefficients being arranged symmetrically so they are divided into two equal groups with the coefficients for one of the equal groups being stored in said memory means; address generating means connected to said addressable memory means for generating binary numbers the least significant bits of which are the address of the stored coefficient being accessed and the most significant bit of which determines the equal group being accessed: and circuitry connected to said memory means and said address generating means for calculating the output values for any pixel (n) in the central block of pixels from the equation ##EQU3## where: D=video data for the central block, C n =coefficient for the central block, DS i =video data for the surround areas 1 through i, and CS i =coefficient for the surround areas 1 through i.
Claim 9
Dependent Claim 181 words
Apparatus for smoothing MAPS compressed image data including video data and coefficients for a central block of pixels and video data and coefficients for a plurality of surround areas, said apparatus comprising: addressble memory means having stored therein coefficients for the plurality of surround areas, the coefficients being arranged symmetrically so they are divided into two equal groups with the coefficients for one of the equal groups being stored in said memory means; address generating means connected to said addressable memory means for generating binary numbers the least significant bits of which are the address of the stored coefficient being accessed and the most significant bit of which determines the equal group being accessed: and circuitry connected to said memory means and said address generating means for calculating the output values for any pixel (n) in the central block of pixels from the equation ##EQU3## where: D=video data for the central block, C n =coefficient for the central block, DS i =video data for the surround areas 1 through i, and CS i =coefficient for the surround areas 1 through i.
Claim 10
Dependent Claim 58 words
Apparatus as claimed in claim 6 wherein the addressable memory means further includes a plurality of separately addressable sections, the surround areas are divided into groups with each group containing at least two surround areas which are never accessed simultaneously and coefficients for the surround areas in each group are stored in different sections of said addressable memory.
Claim 11
Dependent Claim 34 words
Apparatus as claimed in claim 7 wherein the circuitry includes a stage of apparatus for each group of surround areas and the stages are coupled together to provide continuous processing of the video data.
Claim 12
Dependent Claim 47 words
Apparatus as claimed in claim 8 wherein there are twelve surround areas divided into five groups and the circuitry includes a stage for processing the video data and coefficients of the central block and five stages for processing the video data and coefficients of the five groups.

References Cited (Backward Citations)

US4034194A Cited
US4355337A Cited
US4323974A Cited
US4368462A Cited
US4365273A Cited
US4437121A Cited
US4463381A Cited
US4398256A Cited
US4446484A Cited
US4506382A Cited
US4450483A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1989-06-30 1989-12-30 1990-07-01 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1993-06-30 1993-12-30 1994-07-01 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1997-06-30 1997-12-30 1998-07-01 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag