7039252

Iterative Approximation Environments for Modeling the Evolution of an Image Propagating Through a Physical Medium in Restoration and Other Applications

PublishedMay 2, 2006
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
46 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A method for approximating the evolution of images propagating through a physical medium by calculating a fractional power of a numerical operator, said numerical operator being defined by said physical medium and comprising a diagonalizable numerical linear operator raised to a power (α), said method comprising: (a) representing a plurality of images using an individual data array for each of said plurality of images; (b) representing said numerical operator with a linear operator formed by multiplying an ordered similarity transformation operator (P) by a correspondingly-ordered diagonal operator (Λ), the result of which is multiplied by an approximate inverse (P −1 ) of said ordered similarity transformation operator (P); (c) raising diagonal elements of said correspondingly-ordered diagonal operator (Λ) to said power (α) to produce a fractional power diagonal operator; (d) multiplying said fractional power diagonal operator by an approximate inverse of said ordered similarity transformation operator (P −1 ) to produce a first partial result; (e) multiplying a data array of one of said plurality of images by said ordered similarity transformation operator (P) to produce a modified data array; (f) multiplying said modified data array by said first partial result to produce said fractional power of said numerical operator; and (g) repeating operations (e) and (f) for each of said plurality of images.

2

2. The method according to claim 1 , wherein said data array, for each of said plurality of images, is a vector.

3

3. The method according to claim 1 , wherein said data array, for each of said plurality of images, is a matrix.

4

4. The method according to claim 3 , wherein each of said plurality of matrices represent a monochrome image.

5

5. The method according to claim 3 , wherein each of said plurality of matrices represent a luminance component of a represented image.

6

6. The method according to claim 3 , wherein each of said plurality of matrices represent a chroma component of a represented image.

7

7. The method according to claim 1 , wherein said data array, for each of said plurality of images, is a tensor.

8

8. The method according to claim 7 , wherein each of said plurality of tensors represent a color image.

9

9. The method according to claim 1 , wherein said numerical operator comprises a representation of a discrete Fourier transform.

10

10. The method according to claim 9 , wherein said discrete Fourier transform comprises a one-dimensional transformation acting on vectors.

11

11. The method according to claim 9 , wherein said discrete Fourier transform comprises a two-dimensional transformation acting on matrices.

12

12. The method according to claim 11 , wherein said two-dimensional discrete Fourier transform is represented as a tensor product of two one-dimensional discrete Fourier transforms, wherein a first one of said two one-dimensional discrete Fourier transforms is uniquely associated with rows of said data array, and a second one of said two one-dimensional discrete Fourier transforms is uniquely associated with columns of said data array.

13

13. The method according to claim 1 , wherein said numerical operator comprises a matrix.

14

14. The method according to claim 13 , wherein said ordered similarity transformation operator (P) comprises an array formed from eigenvectors of said numerical operator.

15

15. The method according to claim 14 , wherein said correspondingly-ordered diagonal operator (Λ) comprises a diagonal matrix of eigenvalues corresponding to said eigenvectors which are arranged in corresponding order relative to said eigenvalues.

16

16. The method according to claim 1 , wherein said multiplying accomplished in operations (b), (d), (e), and (f) is accomplished using matrix multiplication.

17

17. The method according to claim 1 , wherein said numerical operator comprises a tensor.

18

18. The method according to claim 1 , wherein said ordered similarity transformation operator (P) comprises a matrix.

19

19. The method according to claim 1 , wherein said multiplying of said approximate inverse of said ordered similarity transformation operator and said correspondingly-ordered diagonal operator is realized by multiplying each column of said ordered similarity transformation operator by a value of a diagonal element of a corresponding row of said correspondingly-ordered diagonal operator.

20

20. The method according to claim 1 , wherein said numerical operator comprises a zero origin which matches a zero origin of each of said plurality of images.

21

21. The method according to claim 20 , said method further comprising: shifting an index of said numerical operator so that said zero origin of said numerical operator matches said zero origin of each of said plurality of images.

22

22. The method according to claim 20 , wherein said plurality of images form a composite image.

23

23. A method for approximating the evolution of images propagating through a physical medium by calculating a fractional power of a numerical operator, said numerical operator being defined by said physical medium and comprising a diagonalizable numerical linear operator raised to a power (α) having any one of a plurality of values, said method comprising: (a) representing an image using a data array; (b) representing said numerical operator with a linear operator formed by multiplying an ordered similarity transformation operator (P) by a correspondingly-ordered diagonal operator (Λ), the result of which is multiplied by an approximate inverse (P −1 ) of said ordered similarity transformation operator (P); (c) raising diagonal elements of said correspondingly-ordered diagonal operator (Λ) to one of said plurality of values of said power (α) to produce a fractional power diagonal operator; (d) multiplying said fractional power diagonal operator by an approximate inverse of said ordered similarity transformation operator (P −1 ) to produce a first partial result; (e) multiplying said data array by said ordered similarity transformation operator (P) to produce a modified data array; (f) multiplying said modified data array by said first partial result to produce said fractional power of said numerical operator; and (g) repeating operations (c) and (d) for each of said plurality of values of said power (α).

24

24. The method according to claim 23 , wherein said data array, for each of said plurality of images, is a vector.

25

25. The method according to claim 23 , wherein said data array, for each of said plurality of images, is a matrix.

26

26. The method according to claim 25 , wherein each of said plurality of matrices represent a monochrome image.

27

27. The method according to claim 25 , wherein each of said plurality of matrices represent a luminance component of a represented image.

28

28. The method according to claim 25 , wherein each of said plurality of matrices represent a chroma component of a represented image.

29

29. The method according to claim 23 , wherein said data array, for each of said plurality of images, is a tensor.

30

30. The method according to claim 29 , wherein each of said plurality of tensors represent a color image.

31

31. The method according to claim 23 , wherein said numerical operator comprises a representation of a discrete Fourier transform.

32

32. The method according to claim 31 , wherein said discrete Fourier transform comprises a one-dimensional transformation acting on vectors.

33

33. The method according to claim 31 , wherein said discrete Fourier transform comprises a two-dimensional transformation acting on matrices.

34

34. The method according to claim 33 , wherein said two-dimensional discrete Fourier transform is represented as a tensor product of two one-dimensional discrete Fourier transforms, wherein a first one of said two one-dimensional discrete Fourier transforms is uniquely associated with rows of said data array, and a second one of said two one-dimensional discrete Fourier transforms is uniquely associated with columns of said data array.

35

35. The method according to claim 23 , wherein said numerical operator comprises a matrix.

36

36. The method according to claim 35 , wherein said ordered similarity transformation operator (P) comprises an array formed from eigenvectors of said numerical operator.

37

37. The method according to claim 36 , wherein said correspondingly-ordered diagonal operator (Λ) comprises a diagonal matrix of eigenvalues corresponding to said eigenvectors which are arranged in corresponding order relative to said eigenvalues.

38

38. The method according to claim 23 , wherein said multiplying accomplished in operations (b), (d), (e), and (f) is accomplished using matrix multiplication.

39

39. The method according to claim 23 , wherein said numerical operator comprises a tensor.

40

40. The method according to claim 23 , wherein said ordered similarity transformation operator (P) comprises a matrix.

41

41. The method according to claim 23 , wherein said multiplying of said approximate inverse of said ordered similarity transformation operator and said correspondingly-ordered diagonal operator is realized by multiplying each column of said ordered similarity transformation operator by a value of a diagonal element of a corresponding row of said correspondingly-ordered diagonal operator.

42

42. The method according to claim 23 , wherein said numerical operator comprises a zero origin which matches a zero origin of said image.

43

43. The method according to claim 42 , said method further comprising: shifting an index of said numerical operator so that said zero origin of said numerical operator matches said zero origin of said image.

44

44. The method according to claim 42 , wherein said image is one portion of a composite image.

45

45. A computer-readable medium containing instructions for controlling a computer system to approximate the evolution of images propagating through a physical medium by calculating a fractional power of a numerical operator, said numerical operator being defined by said physical medium and comprising a diagonalizable numerical linear operator raised to a power (α), said controlling provided by said computer system being accomplished according to operations comprising: (a) representing a plurality of images using an individual data array for each of said plurality of images; (b) representing said numerical operator with a linear operator formed by multiplying an ordered similarity transformation operator (P) by a correspondingly-ordered diagonal operator (Λ), the result of which is multiplied by an approximate inverse (P −1 ) of said ordered similarity transformation operator (P); (c) raising diagonal elements of said correspondingly-ordered diagonal operator (Λ) to said power (α) to produce a fractional power diagonal operator; (d) multiplying said fractional power diagonal operator by an approximate inverse of said ordered similarity transformation operator (P −1 ) to produce a first partial result; (e) multiplying a data array of one of said plurality of images by said ordered similarity transformation operator (P) to produce a modified data array; (f) multiplying said modified data array by said first partial result to produce said fractional power of said numerical operator; and (g) repeating operations (e) and (f) for each of said plurality of images.

46

46. A computer-readable medium containing instructions for controlling a computer system to approximate the evolution of images propagating through a physical medium by calculating a fractional power of a numerical operator, said numerical operator being defined by said physical medium and comprising a diagonalizable numerical linear operator raised to a power (α) having any one of a plurality of values, said controlling provided by said computer system being accomplished according to operations comprising: (a) representing an image using a data array; (b) representing said numerical operator with a linear operator formed by multiplying an ordered similarity transformation operator (P) by a correspondingly-ordered diagonal operator (Λ), the result of which is multiplied by an approximate inverse (P −1 ) of said ordered similarity transformation operator (P); (c) raising diagonal elements of said correspondingly-ordered diagonal operator (Λ) to one of said plurality of values of said power (α) to produce a fractional power diagonal operator; (d) multiplying said fractional power diagonal operator by an approximate inverse of said ordered similarity transformation operator (P −1 ) to produce a first partial result; (e) multiplying said data array by said ordered similarity transformation operator (P) to produce a modified data array; (f) multiplying said modified data array by said first partial result to produce said fractional power of said numerical operator; and (g) repeating operations (c) and (d) for each of said plurality of values of said power (α).

Patent Metadata

Filing Date

Unknown

Publication Date

May 2, 2006

Inventors

Lester F. Ludwig

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “ITERATIVE APPROXIMATION ENVIRONMENTS FOR MODELING THE EVOLUTION OF AN IMAGE PROPAGATING THROUGH A PHYSICAL MEDIUM IN RESTORATION AND OTHER APPLICATIONS” (7039252). https://patentable.app/patents/7039252

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.