Patent US4652392A successfully refreshed from Google Patents.
US6816628B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Methods for outlining and filling regions in multi-dimensional arrays
Assignee: Mk Systems Us Holdco Inc
•
Filing: 2000-10-26
•
Granted: 2004-11-09
•
Expires: 2020-10-26
Abstract
Abstract A system and method of adding hyperlinked information to a television broadcast. The broadcast material is analyzed and one or more regions within a frame are identified. Additional information can be associated with a region, and can be transmitted in encoded form, using timing information to identify the frame with which the information is associated. The system comprising a video source and an encoder that produces a transport stream in communication with the video source, an annotation source, a data packet stream generator that produces encoded annotation data packets in communication with the annotation source and the encoder, and a multiplexer system in communication with the encoder and the data packet stream generator. The encoder provides timestamp information to the data packet stream generator and the data packet stream generator synchronizes annotation data from the annotation source with a video signal from the video source in response to the timestamp information. The multiplexer generates a digital broadcast signal that includes an augmented transport stream from the transport stream and the encoded data packets. A receiver displays the annotation information associated with the video signal in response to a viewer request on a frame by frame basis. A viewer can respond interactively to the material, including performing commercial transactions, by using a backchannel that is provided for interactive communication.
Inventors
- 👤 Karen Sarachik
- 👤 Jon Dakss
- 👤 V. Michael Bove, Jr.
- 👤 Josh Wachman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 03:07
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/90; H04N19/93; G; G06; G06F; G06F16/00; G06F16/70; G06F16/74; G06F16/748; G06F16/90; G06F16/95; G06F16/954; G06F16/955; G06F16/9558; H04N1/00; H04N1/46; H04N1/64; H04N21/00; H04N21/20; H04N21/23; H04N21/234; H04N21/2343; H04N21/234318; H04N21/235; H04N21/40; H04N21/43; H04N21/435; H04N21/45; H04N21/462; H04N21/4622; H04N21/47; H04N21/472; H04N21/4722; H04N21/4725; H04N21/4728; H04N21/478; H04N21/4782; H04N21/80; H04N21/81; H04N21/812; H04N21/85; H04N21/854; H04N21/8543; H04N21/858; H04N21/8583; H04N21/8586
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
263 words
A method for filling a connected three-dimensional digital volume, the method comprising: (a) selecting a plurality of sequential two-dimensional sections that contain the volume, said two dimensional sections disposed orthogonally to a third dimension, each two-dimensional section containing locations identified by a first coordinate and a second coordinate; (b) defining a plurality of regions in at least one of said two-dimensional sections, each region comprising at least one location; (c) selecting a first region in one of said at least one of said two-dimensional sections, said region included within said volume to be filled with a selected symbol; (d) filling said selected first region with said selected symbol; (e) moving in a first direction along said third dimension to the successive two-dimensional section; (f) determining whether a location in the successive two-dimensional section corresponding to a filled location in said one of said at least one of said two-dimensional sections belongs to said volume; (1) if there is a positive outcome of said determination step: (i) filling a region that includes said location in said successive two-dimensional section with said selected symbol; and (ii) beginning with said newly-filled region in said successive two-dimensional section, repeating said moving, determining and filling steps recited immediately heretofore until said determining step results in a negative outcome; and (g) upon a negative outcome of any determining step heretofore, returning to said first region, and, moving along said third dimension in a direction opposite to said first direction, repeating the steps of moving, determining and filling as stated above until a negative outcome results for a determining step.
Claim 2
Independent Claim
263 words
A method for filling a connected three-dimensional digital volume, the method comprising: (a) selecting a plurality of sequential two-dimensional sections that contain the volume, said two dimensional sections disposed orthogonally to a third dimension, each two-dimensional section containing locations identified by a first coordinate and a second coordinate; (b) defining a plurality of regions in at least one of said two-dimensional sections, each region comprising at least one location; (c) selecting a first region in one of said at least one of said two-dimensional sections, said region included within said volume to be filled with a selected symbol; (d) filling said selected first region with said selected symbol; (e) moving in a first direction along said third dimension to the successive two-dimensional section; (f) determining whether a location in the successive two-dimensional section corresponding to a filled location in said one of said at least one of said two-dimensional sections belongs to said volume; (1) if there is a positive outcome of said determination step: (i) filling a region that includes said location in said successive two-dimensional section with said selected symbol; and (ii) beginning with said newly-filled region in said successive two-dimensional section, repeating said moving, determining and filling steps recited immediately heretofore until said determining step results in a negative outcome; and (g) upon a negative outcome of any determining step heretofore, returning to said first region, and, moving along said third dimension in a direction opposite to said first direction, repeating the steps of moving, determining and filling as stated above until a negative outcome results for a determining step.
Claim 3
Dependent Claim
12 words
The method of claim 1 , wherein the two-dimensional sections comprise images.
Claim 4
Dependent Claim
20 words
The method of claim 2 , wherein the first coordinate and the second coordinate define the location of a pixel.
Claim 5
Dependent Claim
21 words
The method of claim 2 , wherein the first coordinate and the second coordinate define rows and columns of an image.
Claim 6
Dependent Claim
12 words
The method of claim 1 , wherein the third dimension comprises time.
Claim 7
Dependent Claim
18 words
The method of claim 1 , wherein the symbol represents a visual effect when rendered on a display.
References Cited (Backward Citations)
US4016361A
Cited
US4122477A
Cited
US4264924A
Cited
US4264925A
Cited
US4532547A
Cited
US4959718A
Cited
US4507680A
Cited
US4573072A
Cited
US4602279A
Cited
US4941040A
Cited
US4811407A
Cited
US4903317A
Cited
US4748512A
Cited
US4743959A
Cited
US5452372A
Cited
US4847700A
Cited
US4847699A
Cited
US4847698A
Cited
US5195092A
Cited
US4792849A
Cited
US4829372A
Cited
US5208665A
Cited
USRE34340E
Cited
US4803553A
Cited
US5124811A
Cited
US5008751A
Cited
US5267333A
Cited
US5014125A
Cited
US5101280A
Cited
US5008745A
Cited
US5045940A
Cited
US5130792A
Cited
EP0498511A1
Cited
US5347322A
Cited
US5504534A
Cited
US5724091A
Cited
US6181334B1
Cited
US6204843B1
Cited
US6215484B1
Cited
US5861881A
Cited
US5640601A
Cited
US5754250A
Cited
US5526024A
Cited
US5805204A
Cited
US5644354A
Cited
EP0596823A3
Cited
EP0596823A2
Cited
EP0596823B1
Cited
US5655050A
Cited
US5404173A
Cited
EP1089279A2
Cited
EP0649102B1
Cited
EP0649102A2
Cited
US5905523A
Cited
EP0649102A3
Cited
US5949476A
Cited
US5452006A
Cited
US5499050A
Cited
US5590262A
Cited
US6223211B1
Cited
US5585858A
Cited
EP0680213A3
Cited
EP0680213B1
Cited
EP0680213A2
Cited
US5583561A
Cited
US6501853B1
Cited
US5630067A
Cited
US6002455A
Cited
US5600775A
Cited
US5603058A
Cited
US5883975A
Cited
US5632007A
Cited
US5832121A
Cited
US5757968A
Cited
US5815634A
Cited
US5541662A
Cited
US5533021A
Cited
US6008857A
Cited
US5689799A
Cited
US5969715A
Cited
US5848352A
Cited
US6205231B1
Cited
EP1098534A2
Cited
EP1098533A2
Cited
EP1098532A2
Cited
US5977989A
Cited
US5541602A
Cited
US5771073A
Cited
EP0752786A1
Cited
US6009229A
Cited
US5754233A
Cited
US5835146A
Cited
US5708845A
Cited
US5786855A
Cited
US5912994A
Cited
US5768431A
Cited
US6204885B1
Cited
US6341178B1
Cited
US5838828A
Cited
US5790269A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2007-11-09 | 2008-05-10 | 2008-11-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-11-09 | 2012-05-10 | 2012-11-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-11-09 | 2016-05-10 | 2016-11-09 | $7700.00 | Window Closed / Lapsed |