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

Method of and apparatus for processing video signals

Assignee: US Philips Corp
•
Filing: 1988-01-19
•
Granted: 1989-08-15
•
Expires: 2008-01-19
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An arrangement for processing video signals, the video signals having the form of digitally encoded samples and being arranged to produce a television picture by line and field sequential scanning includes a frame store, a write address generator and a read address generator. Input video samples are fed from an input to an interpolator for writing into the store. When a television picture is to be rotated and the rotation is effected by the sequence of write addresses to the store a situation can arise where there is no information available for writing into certain store locations. This results in holes appearing in the output signal where no picture related information is present. A hole detector is provided at the store output and controls an interpolator which inserts information derived from adjacent picture samples into the hole.

Inventors

  • 👤 Anthony J. Field

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 22:07
CPC Classifications
G; G06; G06T; G06T3/00; G06T3/60; G06T3/606; H; H04; H04N; H04N5/00; H04N5/222; H04N5/262; H04N5/2628

Claims Analysis

Total Claims: 9
Claim 1
Independent Claim 258 words
A method of processing a video signal the video signal having the form of successive digitally encoded samples being arranged so that said successive samples represent a television picture displayable by line and field sequential scanning, the method comprising the steps of: (a) receiving from a video signal source said video signal comprising said successive samples representing said television picture; (b) applying to said television picture a preselected geometrical modification by: (b1) determining by characteristics of said preselected geometrical modification to be applied, a set of addresses for addressing selected memory locations of a video frame store; (b2) generating on the basis of said preselected geometrical modification, a set of modified samples derived from said successive samples, said set of modified samples representing a modified television picture; (b3) assigning to each sample of said set of modified samples, a respective memory location of the ones indicated by said set of addresses; (b4) storing said set of modified samples at their assigned memory locations; (c) reading successive memory locations of at least a selected part of said video frame store to produce a data stream; (d) identifying locations in said data stream corresponding to ones of said successive memory locations being read in which no modified sample was stored; (e) generating a control signal in response to each of the identified locations; and (f) inserting under control of said control signal at each said identified location, a substitute sample generated from at least one of said modified samples located adjacently in said data stream to said each identified location.
Claim 2
Independent Claim 258 words
A method of processing a video signal the video signal having the form of successive digitally encoded samples being arranged so that said successive samples represent a television picture displayable by line and field sequential scanning, the method comprising the steps of: (a) receiving from a video signal source said video signal comprising said successive samples representing said television picture; (b) applying to said television picture a preselected geometrical modification by: (b1) determining by characteristics of said preselected geometrical modification to be applied, a set of addresses for addressing selected memory locations of a video frame store; (b2) generating on the basis of said preselected geometrical modification, a set of modified samples derived from said successive samples, said set of modified samples representing a modified television picture; (b3) assigning to each sample of said set of modified samples, a respective memory location of the ones indicated by said set of addresses; (b4) storing said set of modified samples at their assigned memory locations; (c) reading successive memory locations of at least a selected part of said video frame store to produce a data stream; (d) identifying locations in said data stream corresponding to ones of said successive memory locations being read in which no modified sample was stored; (e) generating a control signal in response to each of the identified locations; and (f) inserting under control of said control signal at each said identified location, a substitute sample generated from at least one of said modified samples located adjacently in said data stream to said each identified location.
Claim 3
Dependent Claim 43 words
A method as claimed in claim 1, in which during said identifying step (d) the number of adjacent identified locations is determined, and said inserting step (f) is performed only if the number of adjacent identified locations does not exceed a predefined number.
Claim 4
Dependent Claim 14 words
A method as claimed in claim 2, in which the predefined number is one.
Claim 5
Dependent Claim 48 words
A method as claimed in claim 1, characterized by the step of writing a non-valid sample which comprises coded information lying outside of predefined limits of said video samples into all memory locations of at least said selected part of the frame store before said assigning step (b3).
Claim 6
Dependent Claim 26 words
A method as claimed in claim 4, in which said identifying step (d) comprises determining whether said non-valid sample occurs at locations in the data stream.
Claim 7
Dependent Claim 91 words
A method as claimed in claim 4 or 5, wherein said writing of non-valid samples comprises the steps of dividing the store into three parts; cyclically for each of the three parts, writing a non-valid code into all memory locations, writing modified samples into at least each said identified location, and reading said modified samples from all memory locations such that during a field in which a non-valid code is written into a first part, modified samples are written into a second part and samples are read from a third part.
Claim 8
Dependent Claim 36 words
A method as claimed in claim 6, in which said non-valid sample is written into all memory locations of the selected part of the store during the line and field blanking periods of the video signal.
Claim 9
Dependent Claim 72 words
A method as claimed in claim 2, 3, 4 or 5, in which the given geometrical modification of the television picture is a rotation about an axis perpendicular to the plane of the picture and/or one or both of two axes in the plane of the picture and in which the set of addresses is determined from a given angle of rotation and axis about which the rotation is to take place.

References Cited (Backward Citations)

GB2100956A Cited
US4611232A Cited
GB2160740A Cited
US4725887A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-08-14 1993-02-13 1993-08-15 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-08-14 1997-02-13 1997-08-15 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-08-14 2001-02-13 2001-08-15 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag