Patent US5121502A successfully refreshed from Google Patents.
US5771033A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for dissolving an image displayed on a computer screen
Assignee: Microsoft Technology Licensing LLC
•
Filing: 1996-05-24
•
Granted: 1998-06-23
•
Expires: 2016-05-24
Abstract
Abstract In association with a computer system, a method and system for implementing a graphical dissolve effect of a first image into a second image displayed on a computer screen. The sequence in which each pixel comprising the first image is replaced with a corresponding pixel in the second image is determined mathematically such that the sequence appears random, thereby producing a dissolve effect that is visually pleasing. The sequence in which the pixels of a first image having a width and height of "w" and "h" pixels, respectively, are replaced is determined by first selecting a value for the variables p and m. The number p is a prime number and the number m is selected such that the numbers m, m 2 , m 3 , . . . , m p-1 , when taken modulo p, yield a reordering of the numbers 1, 2, 3, . . . , p-1. A random number k 0 is selected between 1 and p-1 and a number k is set equal to k 0 . A number j is then calculated according to the formula j=(w*h)+k-p. If j is non-negative, pixel number j in the first image is dissolved by replacing it with the corresponding pixel from the second image. A new number j is then calculated according to the formula j new =j-(p-1). If j is negative, a new value for the number k is calculated according to the formula k new =(k*m) mod p and then a new value of j is calculated according to the formula above using k new . The entire first 30 image is dissolved when the value of k new is equal to k 0 .
Inventors
- 👤 Gary Shon Katzenberger
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 19:12
CPC Classifications
G; G06; G06T; G06T11/00
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
188 words
A method for dissolving a first image displayed on a pixel-oriented display of a computer into a second image by controlling the values of pixels representing the image, said first image being w pixels in width and h pixels in height and each pixel being identified by a unique non-negative number, comprising the steps of: (a) selecting a prime number p; (b) selecting a number k=k 0 , where k 0 is a number between 1 and p-1; (c) calculating a pixel number j in the current image according to the formula j=(w*h)+k-p; (d) determining if j is non-negative; if j is non-negative: (e) replacing the pixel corresponding to pixel number j in the first image with the corresponding pixel in the second image; (f) calculating a number j new according to the formula j new =j-(p-1), and setting j=j new ; and (g) returning to step (d); and if j is negative: (h) calculating a number knew according to the formula k new =(k*m) mod p, wherein m is a primitive root of unity modulo p, and setting k=k new ; and (i) returning to step (c).
Claim 2
Independent Claim
188 words
A method for dissolving a first image displayed on a pixel-oriented display of a computer into a second image by controlling the values of pixels representing the image, said first image being w pixels in width and h pixels in height and each pixel being identified by a unique non-negative number, comprising the steps of: (a) selecting a prime number p; (b) selecting a number k=k 0 , where k 0 is a number between 1 and p-1; (c) calculating a pixel number j in the current image according to the formula j=(w*h)+k-p; (d) determining if j is non-negative; if j is non-negative: (e) replacing the pixel corresponding to pixel number j in the first image with the corresponding pixel in the second image; (f) calculating a number j new according to the formula j new =j-(p-1), and setting j=j new ; and (g) returning to step (d); and if j is negative: (h) calculating a number knew according to the formula k new =(k*m) mod p, wherein m is a primitive root of unity modulo p, and setting k=k new ; and (i) returning to step (c).
Claim 3
Dependent Claim
38 words
The method of claim 1 wherein the pixel to be replaced in the first image, identified by pixel number j, is located at column x and row y of the first image, where x=j mod w and y=j/w.
Claim 4
Dependent Claim
25 words
The method of claim 1 wherein p=2 e +1 with e being a positive integer and m=2 c -1 with c being a positive integer.
Claim 5
Dependent Claim
9 words
The method of claim 3 wherein e=16 and c=15.
Claim 6
Dependent Claim
21 words
The method of claim 1 wherein all pixels in the first image have been replaced when k new =k 0 .
Claim 7
Dependent Claim
74 words
The method of claim 1 wherein each pixel in the first image displays a color associated with an entry in a current palette and each corresponding pixel in the second image displays a color associated with an entry in a source palette, and wherein the current palette is gradually changed to the source palette by linearly interpolating each palette entry between the color in the current palette and the color in the source palette.
Claim 8
Dependent Claim
240 words
A computer system operative to execute a program module for dissolving a first image displayed on a pixel-oriented display of an output device into a second image, said first image being w pixels in width and h pixels in height and each pixel being identified by a unique non-negative number, comprising: a processing device; a memory, coupled to the processing device, for storing the program module, the program module operative to display an image; and an output device having a display, coupled to the processing device, for displaying an image, the processing device, responsive to instructions from the program module, operative to: (a) select a prime number p; (b) select a random number k 0 between 1 and p-1; (c) set a number k=k 0 ; (d) calculate a pixel number j according to the formula j=(w*h)+k-p; (e) determine if j is non-negative; if j is non-negative: (f) control the pixel value associated with the pixel corresponding to pixel number j in the first image to replace said pixel with the corresponding pixel in the second image; and (g) calculate a number anew according to the formula j new =j-(P-1), and set j=j new ; and (h) return to (e); and if j is negative: (i) calculate a number k new according to the formula k new =(k*m) mod p, wherein m is a primitive root of unity modulo p, and set k=k new ; and (j) return to (d).
Claim 9
Dependent Claim
240 words
A computer system operative to execute a program module for dissolving a first image displayed on a pixel-oriented display of an output device into a second image, said first image being w pixels in width and h pixels in height and each pixel being identified by a unique non-negative number, comprising: a processing device; a memory, coupled to the processing device, for storing the program module, the program module operative to display an image; and an output device having a display, coupled to the processing device, for displaying an image, the processing device, responsive to instructions from the program module, operative to: (a) select a prime number p; (b) select a random number k 0 between 1 and p-1; (c) set a number k=k 0 ; (d) calculate a pixel number j according to the formula j=(w*h)+k-p; (e) determine if j is non-negative; if j is non-negative: (f) control the pixel value associated with the pixel corresponding to pixel number j in the first image to replace said pixel with the corresponding pixel in the second image; and (g) calculate a number anew according to the formula j new =j-(P-1), and set j=j new ; and (h) return to (e); and if j is negative: (i) calculate a number k new according to the formula k new =(k*m) mod p, wherein m is a primitive root of unity modulo p, and set k=k new ; and (j) return to (d).
Claim 10
Dependent Claim
38 words
The system of claim 7 wherein the pixel to be replaced in the first image, identified by pixel number j, is located at column x and row y of the first image, where x=j mod w and y=j/w.
Claim 11
Dependent Claim
25 words
The system of claim 7 wherein p=2 e +1 with e being a positive integer and m=2 c -1 with c being a positive integer.
Claim 12
Dependent Claim
9 words
The system of claim 9 wherein e=16 and c=15.
Claim 13
Dependent Claim
21 words
The system of claim 8 wherein all pixels in the first image have been replaced when k new =k 0 .
Claim 14
Dependent Claim
75 words
The system of claim 7 wherein each pixel in the first image displays a color associated with an entry in a current palette and the each corresponding pixel in the second image displays a color associated with an entry in a source palette, and wherein the current palette is gradually changed to the source palette by linearly interpolating each palette entry between the color in the current palette and the color in the source palette.
Claim 15
Dependent Claim
200 words
A computer-readable medium on which is stored a program module for dissolving a first image displayed on a pixel-oriented display into a second image, said first image being w pixels in width and h pixels in height and each pixel in said first image being identified by a unique non-negative number, the program module comprising instructions which, when executed by the computer, perform the steps of: (a) selecting a prime number p; (b) selecting a number k=k 0 , where k 0 is a number between 1 and p-1; (c) calculating a pixel number j in the current image according to the formula j=(w*h)+k-p; (d) determining if j is non-negative; if j is non-negative: (e) replacing the pixel corresponding to pixel number j in the first image with the corresponding pixel in the second image; (f) calculating a number j new according to the formula j new =j-(p-1), and setting j=j new ; and (g) returning to step (d); and if j is negative: (h) calculating a number k new according to the formula k new =(k*m) mod p, wherein m is a primitive root of unity modulo p, and setting k=k new ; and (i) returning to step (c).
Claim 16
Dependent Claim
200 words
A computer-readable medium on which is stored a program module for dissolving a first image displayed on a pixel-oriented display into a second image, said first image being w pixels in width and h pixels in height and each pixel in said first image being identified by a unique non-negative number, the program module comprising instructions which, when executed by the computer, perform the steps of: (a) selecting a prime number p; (b) selecting a number k=k 0 , where k 0 is a number between 1 and p-1; (c) calculating a pixel number j in the current image according to the formula j=(w*h)+k-p; (d) determining if j is non-negative; if j is non-negative: (e) replacing the pixel corresponding to pixel number j in the first image with the corresponding pixel in the second image; (f) calculating a number j new according to the formula j new =j-(p-1), and setting j=j new ; and (g) returning to step (d); and if j is negative: (h) calculating a number k new according to the formula k new =(k*m) mod p, wherein m is a primitive root of unity modulo p, and setting k=k new ; and (i) returning to step (c).
Claim 17
Dependent Claim
37 words
The medium of claim 13 wherein the pixel to be replaced in the first, identified by pixel number j, is located at column x and row y of the first image, where x=j mod w and y=j/w.
Claim 18
Dependent Claim
25 words
The medium of claim 13 wherein p=2 e +1 with e being a positive integer and m=2 c -1 with c being a positive integer.
Claim 19
Dependent Claim
9 words
The system of claim 15 wherein e=16 and c=15.
Claim 20
Dependent Claim
21 words
The medium of claim 14 wherein all pixels in the first image have been replaced when k new =k 0 .
Claim 21
Dependent Claim
75 words
The medium of claim 13 wherein each pixel in the first image displays a color associated with an entry in a current palette and the each corresponding pixel in the second image displays a color associated with an entry in a source palette, and wherein the current palette is gradually changed to the source palette by linearly interpolating each palette entry between the color in the current palette and the color in the source palette.
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) | 2001-06-22 | 2001-12-22 | 2002-06-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-06-22 | 2005-12-22 | 2006-06-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-06-22 | 2009-12-22 | 2010-06-23 | $7700.00 | Window Closed / Lapsed |