# Patent

## Title
Method and system for arbitrary-resolution transforms of frequency-space and inverse frequency-space data

## Abstract

A method and system for arbitrary-resolution and parallelizable data processing, reconstruction, and deconstruction, uses arbitrary frequency-space (FS) or inverse frequency-space (IFS, such as image, audio, or video space) sample points in N dimensions. According to a preferred embodiment of the invention, a subset of optionally pre-processed and/or pre-conditioned N-dimensional FS data (or IFS data) is acquired (102) by a processing device (360), the data is optionally transformed (115) by “region scaling factors”, and the data is optionally reduced (116) in numerical significant digits. A “horizontal key” of data elements is calculated (120) on a processor (361), preferably in parallel, for each of an arbitrary set of x-coordinates in IFS (or FS). IFS “color” data (or FS data) are calculated (130) on a processor (361), preferably in parallel, at the x-coordinates corresponding to the horizontal keys. The IFS coordinates (or the FS coordinates) are arbitrary, and the reconstruction's calculated IFS data (or the deconstruction's calculated FS data) are optionally rotated or transposed (141) (such as for display purposes), and are thus formed (150) in a memory (363) or on an output device (365). The method can be applied to other subsets, such as in the N-dimensional case.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is a continuation-in-part of U.S. application Ser. No. 14/935,491, filed 9 Nov. 2015 (and which is hereby incorporated by reference herein in its entirety), which is a continuation-in-part of U.S. application Ser. No. 14/639,114, filed 4 Mar. 2015 (and which is hereby incorporated by reference herein in its entirety, and which is now U.S. Pat. No. 9,183,648), which claims the benefit of U.S. Provisional Application No. 61/947,737, filed 4 Mar. 2014 (and which is hereby incorporated by reference herein in its entirety). Furthermore, as per 37 CFR 1.71: A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.


STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT
Not Applicable.
REFERENCE TO A COMPUTER PROGRAM LISTING APPENDIX
A computer program listing appendix is submitted herewith, as electronic text files, and is incorporated herein by reference in its entirety.
The names, dates, and sizes for the files contained in the computer program listing appendix are:
prog1.txt, 8 Nov. 2015, 10975 bytes;
prog2.txt, 8 Nov. 2015, 7615 bytes; and
prog3.txt, 8 Nov. 2015, 5197 bytes.
The file prog1.txt contains a listing of a computer program that implements an exemplary embodiment of preferred approach Option 1, which is the HRGB method implemented on a CPU-based computer system; in this case, a multi-threaded computer program parallelized for a multi-core CPU-based system.
The file prog2.txt contains a listing of a computer program that implements an exemplary embodiment of preferred approach Option 2, which is the HRGB method implemented on a parallel electronic circuit; in this case, a computer program parallelized for a GPU/GPGPU.
The file prog3.txt contains a listing of a computer program that implements an exemplary transformation of complex-color data to integer-color data, and offering multiple such options, such as for displaying the method's results on a display device or when creating a binary image file.
The program files are copyrighted by the inventor, as per 37 CFR 1.71.
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates generally to medical, industrial, scientific, and multi-media imaging and related arts, and more particularly, to a method and system for processing, reconstructing, or deconstructing acquired N-dimensional frequency-space data or image/audio/video-space data (inverse frequency-space data, in general), by the application of an arbitrary-resolution and parallelizable processing, reconstruction, and deconstruction method.
2. Description of Related Art
In many areas of science and technology, the processing and analysis of data depend on time-frequency and spatial-frequency analyses. This is true in everything from molecular analysis to image, audio, and video processing and compression. The primary techniques for such tasks are the Fast Fourier Transform (FFT) and wavelet transforms. For example, the FFT is the process of choice for many image/audio/video compression techniques (JPEG images, MP3 audio, MPEG video, etc.), and wavelets are the basis for JPEG2000 image compression. The FFT is the most popular technique for time-frequency or spatial-frequency analysis, but it is known for certain limitations—in particular, the FFT permits only specific sets of frequencies, which are all integer multiples of a single fundamental frequency, 1/Ns, where Ns is typically the number of sample points in the time or space domain. To get high resolution in FFT frequency analysis, the number of samples Ns must be correspondingly large. Wavelets offer better resolution, but are typically limited to logarithmically-spaced frequencies.
Since the FFT is limited to specific sets of frequencies, any non-uniform frequency-space data must be aligned with such frequencies. (Non-uniform data is, for example, associated with spiral and radial MM scans (magnetic resonance imaging), and CT scans (computed tomography) in general. In the field of MRI/fMRI, spiral and radial scanning patterns are typically faster than other types of patterns, and the images produced are less susceptible to errors caused by motion during the scanning process.) The most common technique for this alignment of non-uniform data is known as gridding. Although gridding is fast computationally, it is known in the art for generating image artifacts (image errors) that corrupt the reconstructed images. Newer techniques, such as the Non-Uniform FFT (NUFFT) or conjugate gradient, or traditional techniques such as back-projection approaches, attempt to eliminate the need for gridding, but these techniques are generally approximation techniques, using approaches such as least squares, interpolation, or iteration. In complex cases, iterative techniques such as conjugate gradient will converge to an answer slowly, or not at all—so, although the reconstructed images are more accurate, they might require minutes or hours of computation. The goal, then, is to find a way to transform data, such that the results exhibit no gridding artifacts, or negligible gridding artifacts, and such that the results can be computed quickly.
An additional problem in the field is that current reconstruction techniques typically generate images that are small by today's standards. For example, whereas a typical consumer camera can output raw images of sizes such as 4,600-by-3,500 pixels or larger, fMRI machines typically output raw images of size 64-by-64 pixels, and MM machines typically reconstruct raw images of size 256-by-256 pixels or 512-by-512 pixels. Such low-resolution images are associated with frequency-space based medical imaging technologies in particular, including MRI/fMRI, CT, ultrasound, PET (positron emission tomography), and SPECT (single-photon emission computed tomography). These raw images are typically scaled to larger sizes by interpolation techniques, so that radiologists can better see the results of the scans, but interpolation is an approximation technique that increases the image size on the display by essentially stretching the low-resolution image, not by generating a large raw image. The goal, then, is to find a way to process frequency-space data, so that the raw reconstructed images can be arbitrarily large. In the case of medical imaging, this can allow radiologists to get a better look at areas of interest, and would also allow them to “zoom in” to enlarge a particular sub-region.
An additional problem in the field is that the FFT requires input dimensions that are powers of 2. When this condition is not met, the size of the input data must be increased to a power of 2. Since powers of 2 grow exponentially large, the input data similarly grows exponentially, which then results in lengthier computations and slower computation times. The goal, then, is to find a way to process data, so that the reconstructions and deconstructions do not require input sizes that are exponential powers, thus resulting in efficient computations, particularly for large data sets.
An additional problem in the field is that true 3-dimensional (“true 3D”, also known as “full 3D”) or true N-dimensional (multi-dimensional) frequency-space data is associated with slow computations in industrial, medical, and scientific applications. For example, for MM, true 3D scans offer higher resolution than the more common technique of multiple and adjacent 2D scans, but it is less popular in practice largely due to the slower scans and reconstructions associated with this imaging technique. 3D and multi-dimensional scans and frequency-space data are also associated with scientific applications, such as protein analysis, and with industrial applications, such as ground penetrating radar, seismic analysis, cartography, and oil, gas, and water exploration. (It is noted here that such applications also frequently process data in fewer than 3 dimensions, but the 3D and multi-dimensional cases are the most challenging in terms of computation speed.) The goal, then, is to find a way to process 3D or multi-dimensional frequency-space data, so that the reconstructed images, or data, can be computed quickly.
SUMMARY OF THE INVENTION
The following summary will discuss exemplary embodiments of a method and system for frequency-space based and image/audio/video-space based image, audio, and video processing and reconstruction (applicable to frequency-space and inverse frequency-space data, in general). The method is herein referred to as the HRGB method (High-Resolution, General Basis).
In brief, the HRGB method and system transforms acquired N-dimensional frequency-space data to image/audio/video data (inverse frequency-space data in general, a process known as data reconstruction), and also transforms acquired N-dimensional image/audio/video data (inverse frequency-space data, in general) to frequency-space data (a process herein referred to as data deconstruction or as data processing), such that the computations can be highly parallelized, and such that the resulting data exhibit negligible gridding errors and arbitrarily high resolutions (arbitrary resolutions, in general).
The HRGB method and system for data processing, reconstruction, and deconstruction, particularly in the context of medical and industrial imaging, uses arbitrary frequency-space or image/audio/video-space (inverse frequency-space, in general) sample points in N dimensions. According to a preferred embodiment of the invention, a subset of optionally pre-processed and pre-conditioned N-dimensional frequency-space (or inverse frequency-space) data is acquired by a processing device, the data is optionally transformed by region scaling factors, and the data is optionally reduced in numerical significant digits. A “horizontal key” of data elements is calculated on a processor, preferably in parallel, for each of an arbitrary set of x-coordinates in inverse frequency-space (or frequency-space). Inverse frequency-space “color” data (or frequency-space data) are calculated on a processor, preferably in parallel, at the x-coordinates corresponding to the horizontal keys. The inverse frequency-space coordinates (or the frequency-space coordinates) are arbitrary, and the reconstruction's calculated inverse frequency-space data (or the deconstruction's calculated frequency-space data) are optionally transposed or rotated (such as for display purposes), and are thus formed, with arbitrary resolutions, in a memory or on an output device. The method can be applied to other subsets, such as in the N-dimensional case.
According to an embodiment of the invention, the HRGB method can be implemented as software on CPU-based computer systems, preferably with multi-core CPUs since the HRGB method is designed to be highly parallelizable. According to another embodiment of the invention, the HRGB method can be implemented on a parallel electronic circuit, such as an FPGA (Field-Programmable Gate Array) or ASIC (Application-Specific Integrated Circuit), as well as on computer systems that support parallel-computation hardware such as a GPU (graphics processing unit) or GPGPU (general purpose GPU).
The method starts with a set of acquired, N-dimensional, frequency-space or image/audio/video-space (inverse frequency-space, in general) data items, typically in the context of medical, industrial, or scientific imaging, or audio or video or multi-media processing. (It should be noted that frequency-space is also known in the art as Fourier space, and in the context of MRI/fMRI imaging is also known as k-space, and is also sometimes referred to as time-frequency or spatial-frequency space in the context of audio or image data.) As is typical for data in image/audio/video-space (inverse frequency-space, in general) or frequency-space, each data item comprises two parts: a coordinate position in frequency-space or image/audio/video-space (inverse frequency-space), notated herein as (k1, k2, . . . , kN), and an associated complex-numbered data value, a+ib. For notational purposes, each of the data items, or samples, is herein written in the form {k1, k2, . . . , kN; a, b}, where (k1, k2, . . . , kN) is the frequency-space or image/audio/video-space (inverse frequency-space) coordinate of the data item, and <a, b> is the complex-numbered data value, a+ib, associated with that coordinate. The brackets notation <n1, n2> is used herein to represent a complex-numbered value n1+i n2, where as in the art, the symbol i represents i2=−1. (For notational purposes, the common engineering notation j2=−1 will be used in place of i2=−1, and i will be used as an index.)
A subset, or slice, of the N-dimensional data is then considered. In a preferred embodiment of the invention, and also for notational purposes, the subset is assumed as a 2-dimensional (2D) slice in the x-y plane (in frequency-space or image/audio/video-space, i.e. inverse frequency-space), although in practice any other slice orientation is acceptable (in MM imaging in particular, the x-y-z axes can be chosen arbitrarily and obliquely). Although a 1-dimensional (1D) slice is also acceptable in an embodiment of the invention, as a reduced case of a 2D slice (for example, ignoring the method's y-axes in frequency-space and in image-space by choosing them as equal to 0—such as for 1D data such as audio or general signal data), a 2D slice of the N-dimensional data is a preferred embodiment for medical and industrial applications, since such applications are typically associated with data in two, three, or more dimensions. Without loss of generality, and for notational purposes, it will be assumed that the data items, or sample points, in the 2D (or 1D) slice are each of the form {k1, k2; a, b}, which in the context of MRI/fMRI notation is {kx, ky; a, b}. For notational purposes, this discussion will use the latter notation, {kx, ky; a, b}, to represent the data items in the 2D (or 1D) slice.
As will be seen later, the HRGB method can be applied to frequency-space data, for data reconstruction, and can be applied to image/audio/video-space data (i.e., inverse frequency-space data), for what is referred to herein as data deconstruction. That is, the HRGB method works in either direction—frequency-space to inverse frequency-space, or inverse frequency-space to frequency-space.
For ease of notation, discussion will without loss of generality now focus on frequency-space to image-space transforms (image data reconstruction) in particular. But, it should be noted that whether transforming frequency-space data to inverse frequency-space data, or whether transforming inverse frequency-space data to frequency-space data, the HRGB method is the same.
According to the rules of Fourier space, the frequency-space data items, or sample points, are contained in a region of frequency-space in the coordinate range −fx,max≦kx<+fx,max, and −fy,max≦ky<+fy,max. According to the rules of Fourier space, this corresponds to a region in image-space in the coordinate range −Xmax≦x<+Xmax, and −Ymax≦y<+Ymax. In a preferred embodiment of the invention, for computational efficiency, the (kx, ky) coordinates can be multiplied by a scaling factor (herein referred to as a “region scaling factor”) such that the frequency-space region and image-space region transform to the same size. That is, the two fields of view, or FOVs, are now aligned. That is, −Rmax≦kx, ky, x, y<+Rmax. In a preferred embodiment of the invention, this scaling factor is, according to the rules of Fourier space, (√Ns)/(2 max), where max is fx,max, or fy,max, or Xmax or Ymax, as appropriate, and where Ns is Nx or Ny, as appropriate, with each according to and as defined by the rules of Fourier space and the art-related context. For example, for image processing, Nx and Ny typically represent the image's width and height in pixels, whereas for MRI/fMRI imaging, Nx and Ny represent the pixel dimensions or the MRI/fMRI scan sizes. For the case of Nx=Ny=256, which is typically used in MM medical imaging (in which case Nx and Ny are the scan sizes along the arbitrarily-chosen x and y coordinate axes), the scaling factor is 16/(2 max), or 8/max, which then corresponds to the coordinate range −8≦kx, ky, x, y<+8 in frequency-space and in image-space. (In embodiments of the invention, this scaling is preferred for efficiency but is not strictly necessary since, for example, the HRGB method allows selection of arbitrary image-space points for reconstruction).
According to an embodiment of the invention, the kx and ky coordinates can be transposed or rotated, or in general swapped, for computational efficiency, such as for parallel-coil SENSE MRI scans for which the number of unique ky-notated coordinate values is typically less than the number of unique kx-notated coordinate values. (That is, optionally reducing the number of kx-notated coordinate values in the data set can in many cases yield speed increases when the method is implemented in practice.)
According to an embodiment of the invention, some or all of the <a, b> data values can be multiplied by density compensation factors, based on the associated coordinates (k1, k2, . . . , kN), such as those density compensation factors known in the art. (Of course, it is also possible that these density compensation factors were already applied to the raw frequency-space data points, to pre-process them prior to the start of the HRGB method. If not, and if such data processing is desired, the density compensation factors or other such pre-processing or pre-conditioning factors can be applied during the HRGB method.)
According to an embodiment of the invention, for computational efficiency, some or all of the kx or ky values (or a or b values) in the data set can be truncated, rounded, or otherwise reduced in their number of significant digits. The fewer significant digits used to represent the values (particularly the kx values), the faster the computations, although there is an associated increase in image artifacts. In practical applications of the HRGB method, such artifacts are generally negligible.
Whether or not the optional pre-processing or pre-conditioning of the frequency-space data items is applied, and whether it is applied prior to or after the start of the method, the frequency-space data items {kx, ky; a, b} are implicitly or explicitly associated in the following way. There are n unique kx values, each associated with (herein also referred to as “paired with”) a set of corresponding ky values in the reduced data set (the 2D slice). For example, for data items {5,6; 1,1} and {5,16; 1,1}, there is a single unique kx value, 5, and it is associated with, or “paired with”, two ky values, 6 and 16. For notational purposes, it is assumed that there are n unique kx values, kx1 to kxn—that is, a set kxi for i in the range 1 to n. Each such unique kxi is associated with a set of corresponding ky values in the data set—that is, a set kyi,z for z in the range 1 to Li, where Li is the number of preferably-unique ky values associated with (paired with) coordinate kxi in the data set.
For each image-space x-coordinate for which an image point reconstruction is desired, a “horizontal key”, res1, is computed. For notational purposes, it is assumed that an arbitrarily-chosen x-coordinate is notated as px. This image-space x-coordinate is associated with a horizontal key comprising n elements, each in the set of complex numbers. That is, the horizontal key res1 which is associated with image-space x-coordinate px comprises (in a preferred embodiment) n complex numbers, res1i for i in the range 1 to n, where res1i is:




  
    
      
        
          
            res
            ⁢
            
              
            
            ⁢
            
              1
              i
            
          
          =
          
            
              
                ∑
                
                  z
                  =
                  1
                
                
                  L
                  i
                
              
              ⁢
              
                
              
              ⁢
              
                
                  e
                  
                    j2π
                    ⁢
                    
                      
                    
                    ⁢
                    
                      ky
                      
                        i
                        ,
                        z
                      
                    
                    ⁢
                    
                      p
                      x
                    
                  
                
                *
              
            
            <
            
              a
              
                i
                ,
                z
              
            
          
        
        ,
        
          
            b
            
              i
              ,
              z
            
          
          >
        
      
    
    
      
        (
        1
        )
      
    
  




where <ai,z, bi,z> is the value <a, b> corresponding to k-space sample point (kxi, kyi,z), and where j represents j2=−1, and where * represents complex-number multiplication.

In a preferred embodiment of the invention, the computation of the horizontal key or keys is easily parallelized, such as on CPU cores or on parallel electronic circuits such as GPUs, FPGAs, or ASICs.
Each horizontal key then yields efficient computation of the complex-number “colors” (or image/audio/video domain data, in general) at an arbitrary set of image-space y-coordinates in the image-space column x=px associated with that horizontal key. Specifically, the complex-numbered color (or general data) at an arbitrary image-space coordinate (px, pj) can be computed, in a preferred embodiment, as:




  
    
      
        
          ∑
          
            i
            =
            1
          
          n
        
        ⁢
        
          
        
        ⁢
        
          
            e
            
              j2π
              ⁢
              
                
              
              ⁢
              
                p
                y
              
              ⁢
              
                kx
                i
              
            
          
          *
          res
          ⁢
          
            
          
          ⁢
          
            1
            i
          
        
      
    
    
      
        (
        2
        )
      
    
  




In a preferred embodiment of the invention, the computation of the colors in an image-space column x=px is easily parallelized, such as on CPU cores or on parallel electronic circuits such as GPUs, FPGAs, or ASICs.
For true 3-dimensional (3D) or N-dimensional (multi-dimensional) frequency-space data sets, it is known in the art that in such cases, 2D slices are processed with multiple 2D FFTs (such as in the x-y plane), in conjunction with 1D FFTs performed along each of the perpendicular axes (such as the z-axis). Or, equivalently, only 1D FFTs are applied, but are applied along all three coordinate axes. In the present case, a 1D HRGB (for example, ignoring the y-axes terms in the preferred 2D HRGB embodiment, by setting the ky and y terms to 0, as appropriate) can optionally act in place of the 1D FFT. (In the case of non-uniform data in the z-axes direction, the HRGB can in particular be used.) In brief, according to an embodiment of the invention, for an exemplary true 3D MRI scan with scan size 256×256×72 (in the x-y-z coordinate scan axes), the HRGB method can be applied to each of the seventy-two 256×256 x-y slices, either before or after multiple 1D FFTs (or 1D HRGBs) along the z-axes. As in the FFT-related art, the z-axes processing can occur either prior to or after the seventy-two 2D slices are processed.
Note that the term “image-space” in this (true 3D) context is defined somewhat loosely, since if the 2D slices are processed prior to the z-axes 1D FFT or HRGB applications, rather than after, the resulting colors are not technically the final colors of the final image, but rather are intermediate colors that only take their final form after the z-axes FFTs (or HRGBs) are performed. As such, the term “image-space” will herein be used to also refer to the space of such intermediate colors. That is, the art typically uses the terms “frequency-space” and “image-space”, and so this terminology will be used herein, including in the context of an intermediate image-space with such intermediate color data.
Furthermore, in an embodiment of the invention, the complex-numbered colors can be displayed on display devices in multiple possible ways as is known in the art, such as by replacing each complex-number color by its real-number part, or by its magnitude, or by its phase, etc.
Note that the HRGB method is also seamlessly compatible with k-space pre-processing techniques (such as MRI GRAPPA), as well as with image post-processing techniques (such as MRI SENSE, off-resonance correction, etc.) The HRGB method replaces the k-space (frequency-space) to image-space conversion step, after pre-processing or prior to post-processing.
In brief, what happens to the frequency-space (or image/audio/video-space) sample points before the HRGB method is applied (or during)—such as GRAPPA or ground penetrating radar pre-processing—or what happens to the image/audio/video-space or intermediate image/audio/video-space data (or frequency-space data) after the HRGB method is applied (or during)—such as SENSE processing, MRI off-resonance correction, or 3D processing—has no bearing on the fact that the HRGB method was applied to one or more slices or subsets of frequency-space (or image/audio/video-space) data, and thus such scenarios are considered within the spirit and scope of the present invention, since the method comprises the specified method steps.



BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS
Exemplary embodiments of the present invention are illustrated by way of example in the accompanying drawings, in which like reference numbers indicate the same or similar elements, additionally in which the leftmost digit of a reference number identifies the drawing in which the reference number first appears, and in which:
FIG. 1 is a flow sheet diagram of the HRGB method, according to a preferred embodiment of the invention.
FIG. 2 is a flow sheet diagram of the HRGB method, according to another exemplary embodiment of the invention.
FIG. 3 is a block schematic diagram of a preferred HRGB system for implementing the HRGB method, according to an embodiment of the invention.



DETAILED DESCRIPTION OF THE INVENTION
1. Terminology and Definitions, Part 1
The technical terminology associated with frequency-space and image/audio/video-space (inverse frequency-space, in general) is complicated by the fact that some aspects have numerous terms, while other aspects have few terms.
As such, it should be noted that, in the art, the time-frequency domain and spatial-frequency domain are computationally identical, as are the time domain and the spatial domain, differing in name only to distinguish the context of the data represented, such as audio data, general signal data, image data, etc. Furthermore, frequency-space (FS) is also referred to in the art as Fourier space, the frequency-domain, or k-space, among other terms. Without loss of generality, and for ease of notation and terminology, discussion and examples herein will often focus on the spatial-frequency domain and spatial domain in particular, and will often refer to “frequency-space” and “image-space” or “image/audio/video-space” in particular, but it should be understood that, in the art, various sets of related spaces are computationally identical, and differ only in name.
The terms “image/audio/video-space” and “image-space” are often used herein in place of what might be more accurately termed “inverse frequency-space” (IFS). Since this latter term is not used in the art, it would cause confusion. As such, the term “image-space” or “image/audio/video-space” (as in the title of the present invention) will often be used to refer to IFS, not necessarily to image data or audio data or video data specifically. That is, the terms “image” and “image/audio/video” are often used for lack of a better word, and are not intended to strictly limit the scope of the present invention.
In brief, and more accurately, the present invention discloses a parallelizable and high-resolution method and system for transforming FS data to IFS data, and transforming IFS data to FS data. (High resolution, and arbitrary resolution in general.)
Data “reconstruction” is the term typically used in the art to refer to the process of transforming FS data to IFS data (image, audio, video, etc.). The term data “deconstruction” will be used herein to refer to the transformation of IFS data to FS data. Since the term “deconstruction” is not used in the art, the term data “processing” may herein sometimes be used in its place (such as in the Abstract). Of course, the term data “processing” must also refer to general processing or manipulation of data, although care is taken to ensure that there is no confusion, based on context. In general, when the term “processing” is used in conjunction with the word “reconstruction,” such as in the Abstract, it is intended as “IFS-to-FS deconstruction.”
2. Terminology and Definitions, Part 2
The term “region scaling factors” will be used herein to refer to multiplication factors that, in preferred embodiments of the present invention, make the computations more efficient. The region scaling factors change the bounding regions of the data in FS and in IFS.
It should be noted that, as is common in the art, discussion will assume without loss of generality that the FS and IFS data are located in square or rectangular regions centered around the origin in FS and in IFS. But, as is known in the art, FS and IFS are arranged in a tiled pattern (and FS is, in theory but not always in practice, mirrored across the origin), where the square or rectangular region around the origin is duplicated in adjacent squares and rectangles throughout FS and IFS. (For this reason, some common image compression techniques assume that FS and IFS are each in the range 0 up to Ns, whereas other techniques assume that they are in the range −Ns/2 up to +Ns/2, where Ns is typically the number of pixels in a particular dimension.) Therefore, the discussion herein will assume, without loss of generality, that the FS and IFS data is centered about the origin. It is to be understood that implementing the present invention by shifting the region of analysis to another equivalent region, or regions, of FS and/or IFS, is considered within the scope of the present invention.
The term “pre-processing” will be used herein to refer to data processing techniques that alter the inputted data set of interest, before (and/or during) the implementation of the method. For example, in GRAPPA MRI imaging, a reduced set of k-space (frequency-space) data is collected by the MM machine, then computational techniques are used to fill in the remainder of the k-space data set, and then this new, full data set is used for image reconstruction (FS to IFS transformation). It is also possible that such pre-processing of the machine data is applied after the start of the HRGB method, rather than before. The patent claims of the present invention are thus written to accommodate such embodiments and scenarios.
In brief, the steps of the HRGB method can be arranged in countless ways, and therefore it is intended that such arrangements are within the scope of the invention.
A critically important pre-processing technique is density compensation. This is necessary when, for example, the data is non-uniform (non-rectilinear, or non-Cartesian), such as in the case of spiral MRI imaging, and CT imaging in general. Density compensation typically refers to changing the data values of the data points, based on the proximity of other data points, so that the reconstructed (or deconstructed) data isn't corrupted by errors. In a preferred embodiment of the present invention, non-uniform data will be pre-processed by density compensation factors. But, this can occur either before, or during, the implementation of the HRGB method. Therefore, the patent claims are written to accommodate such embodiments and scenarios.
The term “post-processing” will be used herein to refer to data processing or manipulation techniques that alter the resulting data, after (and/or during) the method's data reconstruction or deconstruction. For example, in MM SENSE imaging, the data is reconstructed (FS to IFS), but the resulting image is aliased, and therefore post-processing occurs, to un-alias the image, in order to obtain the final image.
Of course, some data manipulations can occur before and/or during the method, as well as after and/or during the method. Such processing is considered either pre-processing or post-processing, based on when it is applied.
In brief, extra data manipulation prior to (and/or during) the reconstruction or deconstruction, is referred to as “pre-processing”, and extra data manipulation after (and/or during) the reconstruction or deconstruction is referred to as “post-processing”.
The term “pre-conditioning” (and the related term “post-conditioning”) is used herein to refer to any extra pre-processing (or post-processing) data manipulations that only superficially alter the data, prior to and/or during (or, after and/or during) the method's reconstruction or deconstruction. This includes, but is not limited to, rotating the coordinates in their space, transposing them, translating/shifting them, flipping them, scaling them, or skewing them. For example, in a preferred embodiment for MRI SENSE scans, where the number of ky values is considerably less than the number of kx values, the HRGB computations can be speeded up by transposing the FS data points (swapping their kx and ky values) prior to the reconstruction. Of course, the same result would occur if the data points were rotated 90 degrees clockwise, or 90 degrees counterclockwise, etc. The claims are written to accommodate such scenarios. In brief, it is intended that pre-conditioning (and post-conditioning, as well as pre-processing and post-processing) the data points is within the scope of the present invention, since it is an addition to the primary steps that comprise the present invention.
An important form of post-conditioning is transposition (swapping the x and y coordinates in IFS, or swapping the kx and ky coordinates in FS), since the HRGB method's outputted results are typically transposed. As such, the method's results will likely need to be transposed, or rotated, flipped, etc., to be properly oriented. It is intended that post-conditioning of the results is within the scope of the invention. In fact, transposition (or rotation, etc.) is used in a preferred embodiment (in order to properly orient the output).
3. Terminology and Definitions, Part 3
The term “starting-space” and “target-space” will each refer to either FS or IFS, depending on what the starting or initial or inputted data set represents (FS data or IFS data), and what the resulting, transformed data set represents (FS data or IFS data). For example, for MRI/fMRI/CT image reconstruction, starting-space is FS, and target-space is IFS, whereas for image deconstruction (such as for data compression), starting-space is IFS, and target-space is FS. In a preferred embodiment, “starting-space” and “target-space” are different spaces, such as for transforming FS data to IFS data, or IFS data to FS data.
The term “color” is a generic term used, for ease, to refer to each of the resulting, complex-number data values calculated by the method. The terminology is borrowed from image reconstruction, but the term “color” is not intended as limiting the results to image data. Furthermore, even in the case of image data, the “color” may be an “intermediate color” rather than a final color, such as in the case of true 3D medical or industrial imaging, depending on when the z-axes FFTs or HRGBs are applied (either before, or after, the 2D slices are processed by the HRGB method).
The phrase “form final target-space data” refers to forming “target-space data” (coordinates and/or colors) that is final only in terms of current color-computation purposes, but not to imply that no more processing can be performed. For example, post-processing is possible, as well as using the data in conjunction with multi-dimensional data processing. The phrase “form final target-space data” is used, since the phrase “form target-space data” would cause confusion considering the fact that target-space data is technically formed, and typically pre-conditioned and adjusted, prior to that step.
In the claims, the term “or” is always intended as an inclusive “or” (A, or B, or A and B).
Further terms are defined in the present disclosure's description and specification sections.
In practice, the HRGB method and system will typically be applied to either a complete data set, such as for a single 2D slice of MRI or CT data or for each of a set of multiple 2D single slices, or will be applied to a subset of a larger data set, such as when true 3D or multi-dimensional frequency-space data is processed by multiple 2D HRGBs. In the patent claims, the raw starting-space data set is referred to as a “superset” rather than a set, so that for ease the data processed by the method can be referred to as a “set” of data rather than as a subset of data.
4. Terminology and Definitions, Part 4
The term “processing device” refers to any data-processing apparatus or system or computer capable of implementing an embodiment of the HRGB method specified herein. A processing device can be a general purpose computer or system that becomes a specific purpose computer or system when implementing an embodiment of the specified method. It can be a single apparatus, such as a general purpose computer, or it can comprise a plurality of component processing devices, including distributed or networked computers or systems. The processing device can comprise any suitable architecture consistent with implementing the method. In general, a processing device or data processing system is defined as an arrangement of a processor or processors in combination with either memory or peripherals, or both, performing data processing. (A peripheral is defined as a functional unit that transmits data to or receives data from a computer to which it is coupled, such as keyboards, monitors, printers, disk and tape drives, etc.)
The term “processor” refers to an apparatus or system, whether general purpose or customized to a specific purpose, whether local or distributed, capable of performing the computational steps of the specified method, and is defined in general as a functional unit that interprets and executes instruction data. Examples include but are not limited to: a single CPU with single or multiple cores, a plurality of CPUs each with either single or multiple cores, one or more GPU/GPGPUs, one or more FPGAs, one or more ASICs, or any combination of such elements. In a preferred embodiment, a combination of such processing elements will be used to implement the specified method. The term “processor” is used to refer to any such combinations.
It is to be understood that the present invention can be implemented in various forms of hardware, software, firmware, special purpose processes, or a combination thereof.
The term “memory” or “computer memory” refers to a functional unit to which data can be stored and from which data can be retrieved. Examples include random-access memory (RAM), read-only memory (ROM), etc. In a preferred embodiment, the HRGB system's “memory” will comprise multiple types of memory or computer memory, such as computer RAM, CPU registers, GPU global DRAM, GPU shared RAM, etc.
The term “display device” refers to an apparatus or system capable of displaying the method's computed colors, whether they then be in numerical form, alphanumerical form, binary form, graphical or visual form, or etc. Examples include printers, computer monitors, display screens, projectors, etc.
The term “storage device” refers to an apparatus or system capable of temporary or permanent storage of color information computed by the HRGB system or method. Examples include hard drives, compact discs, physical or digital film, RAM memory, ROM memory, etc.
The term “output device” refers to an apparatus or system capable of acquiring color information computed by the HRGB system or method. Examples include display devices, storage devices, and also computers or processors.
The term “PEC” or “parallel electronic circuit” refers to an apparatus or system capable of sequential and/or parallel computation. Examples include GPU/GPGPUs, FPGAs, ASICs, custom-designed electronic circuits or firmware, etc. It may be local, distributed, physically located within a computer or processing device, or physically located outside of a computer or processing device (and in high-performance applications likely will be).
The terms “input interface” and “output interface” are defined as in the art. In general, an “input interface” is any combination of means, such as electronic or graphical, by which a processor or processing device are connected to an input device (such as a keyboard, disk drive, or general data source) so that data can be transferred to the processor or processing device. In general, an “output interface” is any combination of means, such as electronic or graphical, by which a processor or processing device are connected to an output device (such as a disk drive, computer monitor, or printer) so that data can be transferred from the processor or processing device to the output device. The arrows in FIG. 3 that are associated with the input interface and the output interface are intended to represent the general direction of data flow, and for ease do not represent the two-way communication that is typically necessary with processors, input interfaces, output interfaces, input devices, and output devices.
5. Terminology and Definitions, Part 5
Although the terms “image” and “image-space” are often used for discussion purposes and exemplary embodiments, it should be noted that the intent is not to limit the present invention to such embodiments. Due to computational equivalence, the techniques apply equally to “audio” and “audio-space”, “video” and “video-space”, and all “inverse frequency-spaces” in general.
When the term “image” is used, it refers to literal images and image data, as well as IFS data in general (due to computational equivalence). It is defined similarly to that in U.S. application Ser. No. 13/778,446. That is, as used herein, the term “image” refers to multi-dimensional data composed of discrete—or continuous—image elements. The image may be, for example, a medical image of a subject collected by computer tomography, magnetic resonance imaging, ultrasound, or any other medical imaging system known to one of skill in the art. The image may also be associated with non-medical contexts, such as, for example, remote sensing systems, electron microscopy, etc. The method of the invention can be applied to images of any dimension, e.g. a 2-dimensional picture or a 3-dimensional volume. For a 2- or 3-dimensional image, the domain of the image is typically a 2- or 3-dimensional rectangular region, wherein each pixel or voxel can be addressed with reference to a set of 2 or 3 mutually orthogonal axes.
6. Additional Comments
The HRGB method is designed to be highly parallelizable. Of course, implementing the method sequentially, rather than in parallel, is within the scope of the invention.
Replacing the HRGB preferred embodiments with multiple 1D HRGBs, to process 2D or multi-dimensional data, is within the scope of the invention.
The term “PEC (parallel electronic circuit)” is used in association with a preferred embodiment of the HRGB system. An electronic circuit that performs the HRGB method sequentially, including in association with other such circuits, is within the scope of the invention.
In implementations of the HRGB system, the term “PEC” also refers to PEC embodiments that perform in like ways similar to GPUs/FPGAs/ASICs, but which are not necessarily add-ons or plug-ins, including such embodiments as computers, processing devices in general, distributed computers or processing devices, networked computers or processing devices, etc. (In high-performance applications, the PEC likely will be composed of distributed computers or components, or similar such systems.)
The coordinate axes are referred to as x, y, z, w, etc., for notational purposes and without loss of generality. For example, MM scans can use arbitrary and oblique coordinate axes. Such cases are therefore within the scope of the invention.
In a preferred embodiment, the HRGB method uses the n unique kx values in the acquired data set. Using fewer data items, or extra data items, is considered within the scope of the invention. In particular, especially in cases when optional kx truncation is implemented, using non-unique kx values is within the scope of the invention. Similarly, using non-unique ky values, including when there are multiple same (kx, ky) coordinates in the data set, is within the scope of the invention, and is in fact preferred in certain cases (such as to not lose data).
Shifting the phase of the numerical elements on which computation is based, such as using −j rather than j in EQS. (1)-(10), or similar such alterations, is within the scope of the invention.
The 1-dimensional raw data sets (such as audio, general signal data, 1D frequency-space data, etc.) are processed as a reduced case of the 2D HRGB. That is, the 2D HRGB's ky and y values, or kx and x values, as appropriate based on context, are set to 0. Interpolation in the starting-space data set is a preferred embodiment in certain cases, particularly in the case of discrete data samples (such as with multi-media data). The target-space data is then computed with arbitrarily-high resolution, as usual.
Typically, video data is treated as either adjacent and independent slices of 2D image data (such as for standard MM scans), or as 3D data (where the x-y-z spatial coordinates are now x-y-t spatial and time coordinates, which are in general computationally identical but differ only in name). Similarly, some medical and industrial data are considered multi-dimensional, such for 3D medical scans that are taken at multiple times, in which case the data is arranged as x-y-z-t coordinates.
It should be noted that the HRGB method's computed results are typically transposed. Therefore, when the starting-space scan sizes or pixel sizes Nx and Ny are different (such as rectangular regions rather than the common square regions), the target-space's coordinates px and py are similarly transposed, and in a preferred embodiment, should be chosen as such when computing the reconstruction or deconstruction. For example, if the starting-space data is in a (Fourier-defined) bounding region with a 5:6 ratio of height (y direction) to width (x direction), then the target-space coordinates px and py would typically be selected with a 6:5 ratio. This is in the preferred embodiment, since the method allows arbitrary data point selections, so it is possible to take a non-preferred range or ratio, which might for example result in tiling of the image.
It should also be noted that, when processing discrete data, such as standard image data, the range of target-space coordinates px and py might be translated/shifted slightly from the origin, and appropriate adjustments should be made in the selection of px and py.
It should also be noted that altering the method so that the outputted results are or aren't transposed (x and y coordinates swapped), is considered within the scope of the invention.
7. Discussion of the System and Method, Part 1
Exemplary embodiments of the HRGB system and the HRGB method will now be discussed.
For implementing the HRGB method and the HRGB system, there are two preferred approaches: Option 1, which is a software solution characterized by software running on a CPU-based computer system, preferably with multiple CPU cores so that the HRGB method's parallelized design can be used; and Option 2, which is a scalable hardware/circuit solution for extensive parallelization, characterized by parallel electronic circuits such as a GPU/GPGPU, FPGA, or ASIC. (Of course, customized or dedicated computer or processing systems would offer the greatest speed and parallelization, but the financial costs of this third preferred approach would likely cause it to be less popular in practice at the present time.)
In the first such preferred approach or embodiment, Option 1, applied to MRI/fMRI, CT, ultrasound, or other frequency-space based problems, exemplary workflow is as follows. Without loss of generality, discussion will focus on MRI/fMRI workflow in particular. The MRI/fMRI machine collects and outputs raw frequency-space (k-space) samples in analog format; an analog-to-digital converter changes the samples to digital form; the digital samples are inputted into a computer; the HRGB method is applied to the data; the HRGB method or system computes the resulting image; the computer saves the image to a local disk, and optionally saves the raw k-space samples to a local disk.
In the second preferred approach or embodiment, Option 2, the computer system uses a scalable hardware/circuit solution, for extensive parallelization. If a user prefers real-time image generation, or extremely-large images for better clarity and diagnosis, Option 2 offers scalable hardware/circuit solutions, for arbitrary levels of parallelization.
Since the HRGB method has many independent calculations, they lend themselves to highly parallel implementations. Although modern computers can certainly offer multi-core parallelization of software (Option 1), hardware/circuit solutions offer arbitrary levels of parallelization, limited only by cost. For scalable hardware/circuit parallelization, users have various cost-effective options: GPUs, FPGAs, and ASICs. The GPU option is cost-effective, while also offering the ease of software. It involves API interfaces to routines executed on off-the-shelf GPU or GPGPU cards. Current GPUs/GPGPUs can compute several trillion floating-point operations per second.
The FPGAs and ASICs options offer the highest levels of parallelization. In these embodiments, the developer can interface the computer with a card or external circuit containing a custom-programmed FPGA or custom-built ASIC.
New generation communication solutions such as PCI Express, USB 3.0, and 10 Gigabit Ethernet, are already so commonplace that, for example, some companies offer complete solutions for field-programmable gate arrays (FPGA). For example, since typical MRI raw data samples would occupy approximately a couple megabytes, a highly-parallelized external option could reduce calculation time on a scale measured in orders of magnitude. The current fast communication protocols can transfer such data in a negligible amount of time.
The design flexibility inherent in FPGAs means that a number of potential memory models, architectures, and/or access schemes could be employed. For example, ready solutions are provided by some companies for implementing dual-access RAM. Alternatives such as echoing data to multiple SRAM locations could eliminate typical speed bottlenecks associated with massively parallel computations.
Indeed, parallel RAM architectures are topics of current computer science and engineering research, and there will be more options developed by many people, so there are really no limits to the specific memory architecture.
In summary, there are so many ways to implement the HRGB method and system as parallel hardware/circuitry, that it becomes impossible to address all possible architectures. So, exemplary and preferred embodiments will be discussed.
An exemplary HRGB workflow is as follows. An MRI/fMRI machine collects then outputs raw samples in analog format; an analog-to-digital converter changes the data to digital data; the samples, now in digital form, are transferred to (inputted into) the computer. For faster processing, the incoming samples can be sorted into numerical sequence (for example, sort by kx); this sorting can be accomplished on the computer (CPU), or preferably in parallel on the GPU, FPGA, or ASIC. Next, modern communication protocols, such as PCI Express, USB 3.0, 10 Gigabit Ethernet, etc., are fast enough to make the computer-to-GPU/FPGA/ASIC transmission step negligible. Next, each GPU/FPGA/ASIC receives the full data set (or else uses concurrent RAM access to obtain it from a single source, as determined by the parallel RAM architecture chosen by the developer). Next, each functional block in the GPUs/FPGAs/ASICs computes one arbitrarily-sized section of the final image, using the computational steps of the HRGB method.
In practice, for a 512×512 pixel image, an FPGA could contain (for example) 256 or 512 functional blocks, each capable of at least single-cycle integer multiplications and additions. This functionality can be extended arbitrarily. For example, if the user wants to compute 2,000×2,000 pixel images (current machines typically output images of size up to only 256×256 pixels), and the user's system has programmed an FPGA with 100 functional blocks, then each block can take the task of computing a small, 200×200 (or etc.) pixel subimage of the complete image. If the user wants a typical 256×256 pixel image, on an FPGA with 100 functional blocks, then each block can compute a small, 25×25 (or etc.) pixel subimage.
Next, each GPU/FPGA/ASIC transmits its subimage results back to the main computer, then the main computer quickly assembles the subimages into the complete image. Or, alternatively, the GPUs/FPGAs/ASICs can combine the subimage results in the GPU/FPGA/ASIC global RAM, then transmit the complete image to the main computer.
8. Discussion of the System and Method, Part 2
The HRGB method and system will now be discussed in detail, in terms of frequency-space to image-space conversions, due to the relevance to medical imaging. However, for general data processing, the HRGB method can equivalently be performed in reverse, to go from image-space sample points (preferably interpolated) to frequency-space sample points, which is a goal of many image compression techniques.
(That is, the HRGB method can also be applied to image/audio/video-space data, rather than frequency-space data, and the result is then frequency-space data, rather than image/audio/video-space data. The HRGB method works in either direction, with no modifications. But for discussion purposes, and without loss of generality, the following discussion will focus on image reconstruction in particular, which is frequency-space data transformed to image-space data.)
Start with a given set of frequency-space sample points (typically, 2-dimensional or N-dimensional coordinates each in the set of real numbers, and typically representing spatial frequencies, or time frequencies, or in the case of MRI medical imaging, spatial frequencies known as k-space frequencies) and their associated values (typically, values are each in the set of complex numbers, each of the form a+ib). That is, each frequency-space sample point will typically consist of a set of numbers {k1, k2, . . . , kN; a, b}, which in the case of MRI imaging is a set of numbers {kx, ky; a, b} representing a k-space frequency coordinate (kx, ky), and its associated value, a+ib. In an MRI machine, the machine obtains this k-space information, then converts it to a digital stream of information, which is then transferred to the MRI computer, which is responsible for computing a medical image based on the k-space information.
For the HRGB preferred-mode process, the MM computer (or general computer, for non-MRI images, or for general data processing) can opt to convert the k-space information (or, in general, the frequency-space information) into an image by using software-only techniques (optionally using parallel threading, to increase speed of computation), or for much faster results, can opt to transfer the k-space information (in raw form, or in pre-processed form to facilitate the upcoming steps) to a parallel-computing electronic circuit—such as a custom-built ASIC integrated circuit, or a custom FPGA electronic circuit, or an off-the-shelf GPU or GPGPU.
For MM imaging in particular, the parallel electronic circuit (ASIC, FPGA, GPU, etc.) will receive a list of items which are each of the form {kx, ky; a, b}. This list can be transferred as-is to the parallel electronic circuit (PEC), or for greater efficiency can be pre-sorted or pre-processed (e.g., compressed, etc.) prior to the transfer to the PEC.
MRI machines generate Fourier-based frequency information, which means that the k-space sample points (kx, ky) are located in a rectangular region in the range −fx,max≦kx<+fx,max, and −fy,max≦ky<+fy,max, according to the rules of Fourier space. In image-space, this translates to a set of (x,y) coordinates in the range −Xmax≦x<+Xmax and −Ymax≦y<+Ymax, according to the rules of Fourier space. However, for efficiency and without loss of generality, it will be assumed in the following discussion that the k-space coordinates (kx, ky) are all multiplied by a scaling factor 8/max, so that all k-space coordinates (kx, ky) are now in the range −8≦kx<+8, and −8≦ky<+8, which then converts, by the rules of Fourier space, into an image which is in the coordinate range −8≦x<+8, and −8≦y<+8, in image-space. (The resulting image is the same either with or without this scaling factor, but the scaling factor makes the following steps more efficient.)
The PEC can now arrange the frequency-space (k-space) data, as follows. It computes (or receives from the main computer) a list of all unique kx values, along with each kx value's list of associated ky values. (For greater computational speed, the kx values can be truncated or rounded to a chosen number of decimal places, which will reduce the number of unique kx values, thereby reducing the number of computational steps.) Therefore, each unique kx is associated with a list of associated ky values, as per the original k-space data set.
For example, if the frequency-space data set consists of the data items {5,6; 1,1}, {5,11; 1,1}, {5,12; 1,1}, {10,11; 1,1}, and {10,20; 1,1}, then in that case there are n=2 unique kx values: kx1=5, and kx2=10. Further, kx1=5 is associated with (herein also referred to as “paired with”) a set of 3 (L1=3) ky values: ky1,1=6, ky1,2=11, and ky1,3=12. Similarly, kx2=10 is associated with (paired with) a set of 2 (L2=2) ky values: ky2,1=11, and ky2,2=20.
In brief, there are n unique kx values, notated kxi for i in the range 1 to n. A data item kxi is associated with (paired with) a set of Li ky values (not necessarily unique, but in practice typically will be), which are notated kyi,1, kyi,2, . . . , kyi,Li. That is, the element kxi is associated with (paired with) a set of values kyi,z, where z ranges from 1 to Li.
The user may choose which image points in image-space he or she wants to compute, when generating the associated image or MM image. Typically, the user will choose a set of image-space points (x,y) in the range −Xmax≦x<+Xmax, and −Ymax≦y<+Ymax, or in the simplified scaled case, −8≦x<+8, and −8≦y<+8. Typically, the user will choose a rectilinear set of image-space coordinates (x,y) to compute, with as many or as few image-space coordinates as per the user's fully-arbitrary choice for the resulting image's size. (For example, the user may choose a rectilinear grid of image-space coordinates measuring 2000 points by 2000 points, which will then yield an output image of size 2000×2000 pixels, rather than the typical Mill image of size 256×256 pixels.)
For each unique x coordinate chosen in image-space (that is, each unique column in image-space), the PEC (PEC in a preferred embodiment) will compute that image-space column's “horizontal key”, as follows. Assume that the current image-space column has coordinate x=px. (For example, the range for px might be something like 1024 values ranging from −8 to +8, resulting in an image of size 1024×1024 pixels.) Also, due to parallelization, the image's “horizontal keys”, one for each column value px, can be computed in parallel, on the PEC.
For each chosen value of px, compute an n-element structure res1, which will be referred to as the “horizontal key” for image-space column px. The horizontal key res1 comprises n elements (in a preferred embodiment), where as before, n is the number of unique kx values in the frequency-space data set. Therefore, the elements of res1 can be notated res1i for i in the range 1 to n.
Each term, res1i, is computed as: res1i is equal to the sum of these (complex-valued) terms:

<cos(2πkyi,zpx), sin(2πkyi,zpx)>*<ai,z,bi,z>  (3)

where * represents complex-number multiplication, and where z ranges through all of the Li subscripts z for the elements kyi,z “paired with” kxi, and where <ai,z, bi,z> is the value a, b> corresponding to k-space sample point (kxi, kyi,z). The notation <a, b> will be used to represent the complex number a+jb, where j2=−1.

(The n elements res1, are each independent, and therefore the computation of the elements res1i can be fully parallelized, in a preferred embodiment.)
When the “horizontal key” for an image-space column px has been computed, it is now possible to efficiently compute the “colors” for each of that column's chosen image points. Specifically, compute (in parallel, typically on the PEC, in a preferred embodiment) the “colors” of the image points in that image-space column, px, as follows. For each y coordinate, py, in the set of chosen image points in the current column px (for example, py ranging from −8 to +8 in increments of 1/1024), perform the following calculations. Compute an n-element structure res2, where res2 comprises n elements (in a preferred embodiment), notated res2i for i in the range 1 to n. Each term, res2i is computed as:

res2i=<cos(2πpykxi), sin(2πpykxi)>*(res1i)  (4)

where * represents complex-number multiplication. The sum of the complex-number terms res2i in res2i is the complex-number “color” at point (px, py) in image-space.

(The n elements res2i are each independent, and therefore the computation of the elements res2i can be fully parallelized, in a preferred embodiment.)
(Note that computing the sum of a set of terms can in general be parallelized, including in this case, and in a preferred embodiment.)
As with traditional MRI imaging, the complex-valued “color” values can be converted to real-valued colors by taking the magnitude of the color, or the real component only, or the phase of the complex-valued color, etc. Whichever way is chosen, it will fit seamlessly with current MRI work flows, since the same color conversion steps can now be performed here. The difference is that, now, the colors correspond to a faster, more accurate, arbitrarily-large image. (Note: the HRGB process is also seamlessly compatible with k-space pre-processing techniques (such as GRAPPA), as well as with image post-processing techniques (such as SENSE, off-resonance correction, etc.) In such cases, the HRGB process replaces the k-space to image-space conversion step, after pre-processing or prior to post-processing.)
The resulting image “colors” will typically fall outside the 0-255 range of a typical grayscale computer image. This is a positive feature, since it will allow the resulting image to have a large dynamic range, which can then be reduced to a smaller range in whichever way the user prefers—for example, by color-coding the large dynamic range, or scaling to a smaller 0-255 range, or scaling to a 0-65535 range, etc.
The user will typically choose image-space points that range across the entire image zone, −8≦x<+8, and −8≦y<+8 (or more generally, −Xmax≦x<+Xmax, and −Ymax≦y<+Ymax)). But, the user can alternatively use the computing resources to “zoom in” on a small subset of the full image-space range, such as to take a closer look at a small region of interest, such as a potential malignancy. In this case, the user may, for example, choose a set of 2000×2000 image-space points, all limited to a small subset of the full image-space range.
The image points' colors that are computed in the previous steps can either be transferred to the main computer immediately, or can be collected on the PEC and then transferred quickly and efficiently in a single batch transfer, when all of the image points' color computations are complete.
For efficiency, since the amount of computation will depend on the number of unique kx values, the user may notice that in certain cases, the number of unique ky values is actually less than the number of unique kx values (such as with parallel-coil SENSE MRI imaging). In such cases, the k-space samples can be optionally rotated or flipped, so that the kx and ky values swap. This will then result in a smaller number of unique kx values, which will then improve the speed of computation. Of course, the resulting image will similarly be swapped or flipped, which means that the image can be transformed in the opposite way, so that it will be oriented properly. Equivalently, for no swapping or flipping, the HRGB steps for computing color can be altered so that, rather than computing “horizontal keys”, which are then multiplied or processed by the py values, the PEC (or processor, in general) can alternatively compute “vertical keys”, which are then multiplied or processed by the px values. Such transpositions are intended as within the scope of the present invention, since they are simply a swap, exchange, or change of coordinates with respect to the present invention.
For non-rectilinear or non-uniform scans (such as CT, spiral or radial MM, etc.), k-space pre-processing includes such common techniques as weighting the k-space values by density-compensation functions, prior to the conversion from k-space to image-space. The HRGB process integrates seamlessly with pre-processing or post-processing, since all pre-processing or post-processing techniques will not affect the HRGB's conversion of data between k-space (frequency-space) and image-space (inverse frequency-space, in general).
9. Discussion of the System and Method, Part 3
For the purpose of drafting the patent claims, to encompass the preferred and many non-preferred embodiments, further discussion is necessary. EQS. (1)-(4) represent preferred embodiments, which yield computational efficiency due to the pre-application of region scaling factors to the FS or IFS data. The equations will now be generalized, such as for cases in which region scaling factors are not pre-applied to the starting data set, or in which non-preferred region scaling factors are applied to the data. Such cases are intended as within the scope of the present invention.
According to EQ. (3), res1i is equal to the sum of the terms

<cos(2πkyi,zpx), sin(2πkyi,zpx)>*<ai,z,bi,z>

where z ranges from 1 to Li, and where <ai,z, bi,z> is the data value <a, b> corresponding to k-space sample point (kxi, kyi,z).

Rewriting that using common art-related notation, for which e(jT) is the preferred notation for <cos(T), sin(T)>, and rewriting using common summation notation, we get:




  
    
      
        
          res
          ⁢
          
            
          
          ⁢
          
            1
            i
          
        
        =
        
          
            ∑
            
              z
              =
              1
            
            
              L
              i
            
          
          ⁢
          
            (
            
              
                
                  
                    e
                    
                      j2π
                      ⁢
                      
                        
                      
                      ⁢
                      
                        ky
                        
                          i
                          ,
                          z
                        
                      
                      ⁢
                      
                        p
                        x
                      
                    
                  
                  *
                
                <
                
                  a
                  
                    i
                    ,
                    z
                  
                
              
              ,
              
                
                  b
                  
                    i
                    ,
                    z
                  
                
                >
              
            
            )
          
        
      
    
    
      
        (
        5
        )
      
    
  




According to EQ. (4), the structure res2 comprises n elements, res2i for i in the range 1 to n:

res2i=<cos(2πpykxi), sin(2πpykxi)>*(res1i)

where the sum of the terms res2i yields the “color” at point (px, py) in image-space (or IFS, in general).

Rewriting that using e(jT) notation and summation notation, we get: the color at point (px, py) in IFS is:




  
    
      
        
          ∑
          
            i
            =
            1
          
          n
        
        ⁢
        
          (
          
            
              e
              
                j2π
                ⁢
                
                  
                
                ⁢
                
                  p
                  y
                
                ⁢
                
                  kx
                  i
                
              
            
            *
            res
            ⁢
            
              
            
            ⁢
            
              1
              i
            
          
          )
        
      
    
    
      
        (
        6
        )
      
    
  




As was discussed, EQS. (1)-(4), and therefore EQS. (1)-(6), are based on FS data and IFS data that are pre-multiplied by region scaling factors, to align the data regions in FS and IFS. In a preferred embodiment, computational efficiency is obtained by applying region scaling factors to the FS data and IFS data, to align the data regions in FS and IFS. In a non-preferred embodiment, the data are not scaled, since according to the method the target-space data points are arbitrary, and thus the method can compensate for such a case by (for example) taking an appropriately-sized reconstruction or deconstruction region. Such cases are intended as within the scope of the present invention. Such non-preferred scenarios will now be discussed in more detail.
For ease, consider a 1D case, with a set of kx values in FS and a set of x values in IFS. The same rules will of course apply for higher-dimensional cases, such as with ky and y values, kz and z values, kw and w values, etc. As first explained in the summary section, the data regions in FS and IFS will align if the kx values are each multiplied by a factor (√Nx)/(2fx,max)—call this E6—and the x values are each multiplied by a factor (√Nx)/(2 Xmax)—call this E2. Similarly, along the y-axes, ky values are each multiplied by a factor (√Ny)/(2fx,max)—call this E1—and y values are each multiplied by a factor (√Ny)/(2 Ymax)—call this E5.
In brief, the prior equations EQS. (1)-(6) are based on kyi,z,pre-scaled, etc., which is equal to E1 ki,z,unscaled etc. As such the equations' ki,z,pre-scaled, etc., can be replaced by E1 ki,z,unscaled, etc. Therefore, if the FS and IFS data is not pre-scaled by region scaling factors for efficiency, the equations EQS. (5)-(6) are then, in a non-preferred embodiment:




  
    
      
        
          res
          ⁢
          
            
          
          ⁢
          
            1
            i
          
        
        =
        
          
            ∑
            
              z
              =
              1
            
            
              L
              i
            
          
          ⁢
          
            (
            
              
                
                  
                    e
                    
                      j2π
                      ⁢
                      
                        
                      
                      ⁢
                      
                        ky
                        
                          i
                          ,
                          z
                        
                      
                      ⁢
                      
                        E
                        1
                      
                      ⁢
                      
                        p
                        x
                      
                      ⁢
                      
                        E
                        2
                      
                    
                  
                  *
                
                <
                
                  a
                  
                    i
                    ,
                    z
                  
                
              
              ,
              
                
                  b
                  
                    i
                    ,
                    z
                  
                
                >
              
            
            )
          
        
      
    
    
      
        (
        7
        )
      
    
  
  
    
      
        
          ∑
          
            i
            =
            1
          
          n
        
        ⁢
        
          (
          
            
              e
              
                j2π
                ⁢
                
                  
                
                ⁢
                
                  p
                  y
                
                ⁢
                
                  E
                  5
                
                ⁢
                
                  kx
                  i
                
                ⁢
                
                  E
                  6
                
              
            
            *
            res
            ⁢
            
              
            
            ⁢
            
              1
              i
            
          
          )
        
      
    
    
      
        (
        8
        )
      
    
  




where, again, E=(√Ny)/(2 fy,max), E2=(√Nx)/(2 Xmax), E5=(√Ny)/(2 Ymax), and E6=(√Nx)/(2 fx,max).

These E1 to E6 factors are the optimal region scaling factors, which are pre-applied to the FS and IFS data for efficiency, in a preferred embodiment, but which also might be instead applied during the steps of the HRGB method, in a non-preferred embodiment. In another non-preferred scenario, the region scaling factors might be applied with arbitrary numbers, and then compensated for (for example) by canceling computationally to yield the preferred factors. In another exemplary scenario, non-preferred region scaling factors can be compensated for, by the use of a non-preferred arbitrarily-chosen target-space range of points—for example, causing the medical or industrial image to be smaller and/or surrounded by an unnecessarily large margin. All such non-preferred embodiments are intended as within the spirit and scope of the present invention. In brief, optimal region scaling factors were discussed, but non-preferred factors can be compensated for, such as computationally, or by the selection of non-preferred target-space regions, or etc. Therefore, EQS. (7)-(8) are the general forms of EQS. (5)-(6).
Furthermore, although the summation index range 1 to Li, and 1 to n, are the preferred index ranges, it is intended as within the scope of the invention if embodiments use fewer terms, or more terms. In fact, if the goal is to increase computation speed at the expense of image quality or target-space data quality, then taking fewer terms in the sum is actually the preferred approach. As such, the optimal summation range 1 to Li will be generalized as r1 to r2, and the optimal summation range 1 to n will be generalized as r3 to r4. (It is intended that these ranges also encompass cases where the summation index is irregularly spaced, such as when taking an arbitrary subset of the summation terms.)
In conclusion, to try to encompass a large number of the countless non-preferred and preferred embodiments, EQS. (5)-(8) can be written generally as:




  
    
      
        
          res
          ⁢
          
            
          
          ⁢
          
            1
            i
          
        
        =
        
          
            ∑
            
              z
              =
              
                r
                1
              
            
            
              r
              2
            
          
          ⁢
          
            (
            
              
                
                  
                    e
                    
                      j2π
                      ⁢
                      
                        
                      
                      ⁢
                      
                        ky
                        
                          i
                          ,
                          z
                        
                      
                      ⁢
                      
                        E
                        1
                      
                      ⁢
                      
                        p
                        x
                      
                      ⁢
                      
                        E
                        2
                      
                    
                  
                  *
                
                <
                
                  a
                  
                    i
                    ,
                    z
                  
                
              
              ,
              
                
                  b
                  
                    i
                    ,
                    z
                  
                
                >
              
            
            )
          
        
      
    
    
      
        (
        9
        )
      
    
  
  
    
      
        
          ∑
          
            i
            =
            
              r
              3
            
          
          
            r
            4
          
        
        ⁢
        
          (
          
            
              e
              
                j2π
                ⁢
                
                  
                
                ⁢
                
                  p
                  y
                
                ⁢
                
                  E
                  5
                
                ⁢
                
                  kx
                  i
                
                ⁢
                
                  E
                  6
                
              
            
            *
            res
            ⁢
            
              
            
            ⁢
            
              1
              i
            
          
          )
        
      
    
    
      
        (
        10
        )
      
    
  




10. Exemplary and Preferred Embodiments of the Method and System
FIG. 1 illustrates a preferred embodiment of the HRGB method, and FIG. 3 illustrates an exemplary and preferred embodiment of the HRGB system. A subset of optionally pre-processed and pre-conditioned N-dimensional frequency-space (or image/audio/video-space) data is acquired 102 by a processing device 360, the data is transformed 115 by region scaling factors, and the data is optionally reduced 116 in numerical significant digits. A “horizontal key” of elements is calculated 120 on a processor 361, preferably in parallel, for each of an arbitrary set of x-coordinates in image/audio/video-space (or frequency-space). Image/audio/video-space “color” data (or frequency-space data) are calculated 130 on a processor 361, preferably in parallel, at the x-coordinates corresponding to the horizontal keys. The spatial/time-domain coordinates (or the frequency-space coordinates) are arbitrary, and the reconstruction's calculated image/audio/video data (or the deconstruction's calculated frequency-space data) are optionally transposed 141 (such as for display purposes), and are thus formed 150 in a memory 363 or on an output device 365. The method can be applied to other subsets, such as in the N-dimensional case. The computer program instructions (such as machine language code, object code, assembly language code, pseudocode, or high-level language code) implementing the method, such as for a computer system, may be stored on a non-transitory computer-readable storage device 370.
FIG. 2 illustrates another exemplary embodiment of the HRGB method. A medical, industrial, or scientific apparatus generates raw N-dimensional (1D, 2D, 3D, or multi-dimensional) FS or IFS data or equivalent such data (a superset comprising “N-dimensional starting-space sample points”, wherein each such sample point comprises a set of associated “sample-point component numbers” which are notated without loss of generality as a, b, kx, ky, k3, k4, k5, etc., wherein (kx, ky, k3, k4, k5, . . . ) represents a “starting-space coordinate” and <a, b> represents a “starting-space data value” associated with that coordinate). Next, a “starting-space data set”, such as a 2D subset of the superset, is acquired 102 by a processing device 360 (by way of an input interface 362), for computational processing by implementation of the method. Next, the data is optionally pre-processed 211, in the processing device 360, such as by art-specific techniques (such as GRAPPA k-space filling for MRI GRAPPA scans, seismic data pre-reconstruction pre-processing, etc.), and/or by density compensation factors 212. The data is then optionally pre-conditioned 213 in the processing device 360 (such as by transposing MM SENSE data so that the number of unique kx values is reduced). Next, the data is optionally transposed 214 in the processing device 360 (such as for MM SENSE data, or for rectangular image deconstruction so that the outputted results are oriented in the same height and width ratios as the raw data). Next, after the data has been pre-processed and pre-conditioned, the data is optionally transformed 115 by applying region scaling factors, for computational efficiency. Next, the data optionally has all kx values reduced 116 in their significant digits, such as to 3 decimal places (thousandths place). Next, a set of arbitrary target-space coordinates, each of the form (px, py), is chosen. For each chosen “target-space x-coordinate” px value, a horizontal key is calculated 120 on the processor 361, and these horizontal keys (each comprising a set of “horizontal key elements”, each such element notated res1i and computed based on the disclosed equations) are preferably computed in parallel. For each px value, the set of arbitrary py values in that column are then considered, and this is preferably done in parallel for each py, and similarly across all px's, which is also done preferably in parallel. For each such (px, py) combination (wherein px is a current “target-space x-coordinate” and py is a current “target-space y-coordinate”), a color is calculated 130 (based on the disclosed equations) on the processor 361. The resulting target-space data is optionally transposed 141 and/or post-conditioned 242 (rotated, skewed, scaled, etc.), such as for correctly orienting the outputted data. Next, the complex-number color data is optionally adjusted 243, from complex numbers to real numbers or integers, such as when the target-space data is image data and is in its final form (for example, isn't intermediate data during multi-dimensional data processing, and is ready for display right after the adjustment), and needs to be adjusted to real or integer color data for the purpose of creating a standard-format image file such as a PNG or JPG image. The resulting data is now successfully formed 150 in the memory 363, and is therefore optionally displayed on a display device 367 such as a computer screen, or stored on a storage device 366 such as a disc, etc. Post-processing 261 is optionally applied to the data (such as for MM SENSE processing, where the resulting image is combined with other images, in order to combine them into a single un-aliased image). Optionally, the post-processed data can be outputted to an output device 365 (such as an Internet server) by way of an output interface 364.
11. Additional Comments
It is to be understood that the above (and below) described embodiments are merely illustrative of numerous and varied other embodiments which may constitute applications of the principles of the present invention. Such other embodiments may be readily devised by those skilled in the art without departing from the spirit and scope of the invention and it is intended that they be deemed within the scope of the invention.
12. Additional Comments and Disclosures
The prior sections are identical to or essentially identical to the corresponding sections of the priority document U.S. application Ser. No. 14/639,114 (which is now U.S. Pat. No. 9,183,648).
The next few sections are identical to or essentially identical to the corresponding sections of the priority document U.S. application Ser. No. 14/935,491, which is a continuation-in-part of the '114 document.
In the following sections, reference is made to the priority documents U.S. application Ser. No. 14/639,114 and U.S. Provisional App. No. 61/947,737.
The '737 and '114 priority documents disclose using the HRGB method to process multi-media content generally. For example, the HRGB method allows arbitrarily-sized outputs, which is of course applicable to multi-media data. Furthermore, the HRGB method's pre-processing, post-processing, pre-conditioning, and post-conditioning steps can be used to implement multi-media effects, such as those FS and IFS adjustments known in the art, including smoothing, sharpening, rippling (such as Gibbs ringing), applying low-pass filters or high-pass filters or other such filters, combining or compositing data, adding or omitting data in the data sets, etc.
Since the HRGB method allows arbitrary input data, the inputted multi-media data can be pre-processed (pre-processing, which occurs prior to or during implementation of the HRGB method) to increase or decrease dynamic range, which can then increase or decrease contrast, which then allows the method's outputted data to reflect that pre-processing—for example, resulting in the increase or decrease of Fourier rippling (or Gibbs ringing) artifacts, such as in the context of multi-media graphical effects.
Since the HRGB method allows arbitrary inputs in starting-space and arbitrary outputs in target-space, multi-media or general data processing or compression applications are not limited to rectilinear data, in contrast to current FFT-based data compression techniques that deconstruct (or reconstruct) rectilinear data. For example, since the HRGB output's data points are arbitrary, an image can be deconstructed into radial, semi-radial, spiral, etc., frequency-space data, rather than rectilinear frequency-space data. This can offer different amounts of compression compared to rectilinear forms of compression.
Furthermore, the trigonometric functions in the '114 document's claims (and the present document's claims) can be replaced with different functions, including arbitrary functions, as was alluded to and referenced in the '737 and '114 priority documents. Also, as further discussed in the priority documents, the data sets can be limited to different sub-regions, such as 0 to 0.5, or etc., rather than the preferred FS or IFS ranges.
As discussed in the '737 and '114 priority documents, windowing functions such as those known in the art can be applied to the data.
Also, the technique of “zero-padding” data is well known in the related arts, particularly in the context of FS data, including when windowing is used to alter data.
It is noted here that in the present application and in the priority documents, the term “FFT” (Fast Fourier Transform) was used, as is sometimes done in art, to refer to the Fourier Transform or Fourier Transform techniques in general. The FFT is a particular computational speed-up implementation of the Discrete Fourier Transform, and is sometimes, for ease of discussion, used in the art synonymously with the DFT or FT, based on context. That is, since the FFT is the most common implementation of the DFT and FT, it is often used as a general term.
The '737 and '114 priority documents refer in detail to density-compensation functions and data weights, such as those known in the art. There are numerous density-compensation functions well known in the art, particularly those for radial and spiral data such as MRI/CT/PET/SPECT data. (It is noted here that “density-compensation functions” are often also (similarly or identically) known in the art as “density-compensation filters”, and are sometimes applied to IFS data and deconstructions, not just to FS data and reconstructions.) In particular, some well-known and frequently-used density-compensation functions/filters known and used in the art, particularly for radial and spiral data, are: ramp filters, Voronoi weighting, modified ramp filters, apodized ramp filters, Hanning/Hann filters, Butterworth filters, ramp-Hanning filters, ramp-Hamming filters, Parzen filters, Hamming filters, Shepp-Logan filters, Cosine filters, square root of a ramp filter, etc.
Some well-known and frequently-used interpolation techniques, such as for back-projection approaches, include: nearest, linear, spline, cubic, etc. (It is noted here that the HRGB method does not require gridding or interpolation, but these interpolation techniques are listed here in terms of optional pre-processing of data prior to or during the HRGB reconstruction or deconstruction.)
It is known in the art that ramp filters are sometimes fine-tuned and adjusted based on a particular data set, since different data sets can exhibit different amounts and types of noise, signal, etc.
For the purpose of claims drafting, ramp filters are defined specifically and generally in the claims, including with intent to address competitor work-arounds for the claims that are related to ramp filters. (Additional enablement: It is noted here that quadratic, cubic, etc., power-based ramp filters were sometimes useful in practice too, particularly for non-uniform data.)
The '737 and '114 priority documents disclose using the HRGB method for general data processing. They also disclose using the HRGB method for processing and analyzing general signal data, such as digital signals and analog signals (including in cases where Analog-to-Digital conversion is applied to digitize the analog data), and such as electronic or wireless signals. It is noted that signal data is known in the art as comprising 1D, 2D, 3D, or etc., data.
It is known in the art that FS data and/or IFS data can be modified in particular contexts, including combining multiple FS data sets, in the context of data processing, such as for filtering, match filtering, correlation, auto-correlation, cross-correlation, convolution, deconvolution, etc. The HRGB's FS or IFS data can of course be similarly processed prior to, during, etc., the implementation of the HRGB method's steps. This falls in the category of pre-processing and/or pre-conditioning of the data, as was defined and discussed in the priority documents.
Omitting some or all of the region scaling factors, Ei, is in the scope of the '114 document's claims and the present application's claims, since the specific case Ei=1 was disclosed, which of course has the same effect as omitting the corresponding Ei term or terms in the HRGB equations.
Omitting some of the preferred or computed data is explicitly in the scope of the '114 document's claims and the present application's claims. For example, in industrial applications the imaginary-number portions of the complex-number data are sometimes omitted. This is also, in addition, reflected in the priority document's and present application's disclosures explicitly stating that data, such as the computed color data, can be translated to non-complex numbers as desired.
Since the HRGB method can process N-dimensional data, data compression (such as for multi-media) is not limited to the typical 2D data groups—in contrast to typical compression techniques which for example compress each 2D color channel separately—but can compress simultaneously across multiple dimensions (such as by treating the color channels as a multi-dimensional group). This compression can be applied to a subset or portion of the multi-media data (such as in JPEG compression), or can be applied to the entire multi-media data (such as by doing IFS to FS deconstruction on the entire image, either on each color channel or across the full set of color channels).
As was stated in the '114 priority document, frequency-space exhibits (in theory, but not always in practice) symmetry about the origin, conjugate symmetry, and periodicity. As was stated in the '114 priority document, this fact is to be considered, particularly in the context of competitor work-arounds of the patent claims.
13. Additional Comments and Disclosures
The '114 priority document explicitly listed uses such as remote sensing. As is known in the art, remote sensing includes a large number of fields and applications, including ground penetrating radar and synthetic aperture radar, which process, reconstruct, and/or deconstruct FS and IFS data. The '114 priority document explicitly lists known problems in the related arts, including the problems of gridding, iteration, interpolation, etc. Gridding and interpolation are known bottlenecks in the fields of remote sensing, affecting Fourier-based and gridding-based reconstructions, and back-projection-based and interpolation-based reconstructions. As was stated in the '737 and '114 priority documents, the HRGB method does not rely on gridding and interpolation (except in optional cases), while offering arbitrarily-high resolutions and arbitrarily-high parallelizations. It is noted that common remote sensing applications such as synthetic aperture radar frequently rely on polar and/or radial data, similar to CT data, and it is often associated with a thin section of data points which is in contrast to CT data which is typically spread across a larger section of FS. In practice, SAR processing is often accomplished with Fourier techniques, since at large distances the SAR data is often nearly Cartesian. Since the HRGB method allows non-uniform data, SAR data is not required to exhibit such nearly-Cartesian properties. It is noted here that SAR data often does not necessarily require density-compensation, but density-compensation can be applied as needed or desired, such as in order to generate outputs with fewer artifacts. It is also noted here that, as is known in the art, FS data can often be reconstructed in sub-sections. For example, CT or SAR data can be reconstructed in sections, and then combined such as by summing.
Furthermore, it is known in the art that some remote sensing applications, such as SAR in particular, are associated with side-lobe artifacts. It is known in the art that pre-processing and post-processing of the data can reduce side-lobe artifacts. These same side-lobe reduction steps can similarly be applied to the remote sensing data in the context of reconstruction/deconstruction done by the HRGB method.
Furthermore, remote sensing data, particularly when in a narrow range of FS, results in point-spread artifacts. It is recommended that, in a preferred embodiment, the remote sensing data is deconvolved in order to reduce or eliminate point-spread artifacts. For example, the remote sensing FS data can be deconvolved by a point-spread function corresponding to the data, or similarly can be point-wise multiplied by or divided by the FS representation of a point-spread function corresponding to the remote sensing data's point-spread artifacts.
14. Additional Comments and Disclosures
The '737 and '114 priority documents refer to the wide range of applications known in the related arts, regarding FS and IFS, and reconstructions and deconstructions, including in the contexts of medical, industrial, scientific, and multi-media data applications. Some specific examples are listed in the '737 and '114 priority documents, for exemplary applications of data reconstructions and deconstructions. Exemplary uses of deconstructions included molecular analysis (in addition to reconstructions). Furthermore, additional examples of deconstructions (in addition to reconstructions) known in the related arts, include: MEG (magnetoencephalography), EEG (electroencephalography), FTIR (Fourier transform infrared spectroscopy), chemical analysis in general, spectroscopy, etc. Data processing in the context of optical coherence tomography (OCT) is an additional application. (For claims drafting purposes, MEG, EEG, and FTIR are considered in the category of spectroscopy.)
In the context of data compression, the present disclosures can of course be used in combination with other techniques. For example, iteration techniques can allow a user to test or delete or alter data set items, by comparing the resulting reconstructions or deconstruction with a test case or set of metrics. For example, a data set can be reduced by determining which data can be omitted without affecting the resulting reconstruction or deconstruction. For example, an image can be compressed in this way, such that the data set is reduced while allowing the uncompressed image to yield a desired amount of accuracy. Compressed sensing approaches can also be used in conjunction with the disclosed techniques, such as in the context of data compression.
15. Additional Comments and Disclosures
Data reconstruction and deconstruction is also known in the fields of digital and computer-generated holography. A possible application is as follows. LCD screens (and/or related types of apparatuses) typically resemble holographic plates (that is, a combination of clear and opaque or non-clear areas), and hence a (preferably fine-resolution) diffraction, interference, or Fourier pattern can be generated in real time, while the LCD screen is lit with a holographic light source, such as a laser. In a preferred embodiment, this is performed in combination with lenses, such as those used in the holographic arts. As a particular example, the LCD screen's typical back light can be replaced with a laser source (or holographic light source in general) that lights the LCD screen instead of a typical holographic plate. The screen's data can display the computational results of the HRGB method, either computed in real time, or pre-computed but displayed, preferably in real time, on the display screen. Similarly, the HRGB method's parallelization can yield quickly-generated and/or large-sized holographic patterns, which can then be transferred to holographic media such as plates. Such techniques are known in the holographic arts, but now are used in conjunction with the HRGB method's computations. Similarly, the computed patterns can be transferred to media such as a film strip, and can thus be played as a real-time film, where the film projector's light source is replaced by a laser or similar holographic light source. In addition, since the HRGB's output has arbitrarily-high resolution, this will allow outputting of high-resolution and detailed FS data or holographic data.
It is noted here that remote sensing, which is typically performed with Fourier-type reconstructions and deconstructions or with back-projection techniques, was first performed with lasers, lenses, and holographic media techniques, rather than with digital computations.
It is further noted that holographic data is herein considered image data, consistent with the definitions presented in the priority documents. (Also, it is noted that video data is considered as video data and also as a collection of images, in general.)
16. Additional Comments and Disclosures
Data reconstruction and deconstruction is also known in the art as applying to data that is not “strictly” image, audio, video, etc., data. For example, it is also known for applications in molecular analysis (mentioned in the '737 and '114 priority documents), general signals and signal analysis and processing (mentioned in the '737 and '114 priority documents). Furthermore, additional examples of reconstructions and deconstructions that do not strictly process image, audio, or video, etc., data, include, as is known in the art: efficient polynomial multiplication and calculations (traditionally Fourier based), long integer multiplication (traditionally Fourier based), protein analysis, etc. (For claims drafting purposes, polynomial multiplication and calculations, and long integer multiplication, will be considered in the category of spectroscopy, although this is not strictly accurate.) As was discussed in the priority documents, the phrase image-audio-video-space is used as a general term that applies to inverse frequency-space in general, and is not limited to these types of multi-media data specifically, due to computational equality in the context of reconstructions and deconstructions. For example, molecular analysis or FTIR does not strictly constitute such multi-media data, but the HRGB method's deconstructions can be used.
17. Additional Comments and Disclosures
As was mentioned in the '737 and '114 priority documents, discrete data is preferably interpolated in certain cases, such as when extra data is required or desired. This is particularly applicable in the context of deconstructions, such as with signal or multi-media deconstructions.
As was discussed in detail in the '737 and '114 priority documents, the HRGB method can “zoom in” to an area of interest. It is noted here that since the outputted data is, in such cases, limited to a sub-region, the dynamic range computations are of course easier for that sub-region, since the dynamic range of the outputted data does not need to be balanced with the rest of the full set of output data.
A brief listing of the unique features and special features of the HRGB method is as follows: dual functionality (reconstructions and deconstructions with the same method steps), arbitrarily-sized outputs and arbitrary output resolutions (a feature not known in the background art), computation with arbitrary amounts of parallelization (arbitrarily scalable) for fast computations, accurate reconstructions and deconstructions (not limited by errors due to gridding and/or interpolation, unlike common techniques in the background art), outputs that feature large dynamic range, reconstructions or deconstructions on non-uniform data in addition to uniform data (non-uniform data offers the biggest computational challenges in the background art), arbitrary choices of starting-space data and coordinates and arbitrary choices of target-space data and coordinates (which also allows non-rectilinear outputs, such as non-rectilinear output data in multi-media compression applications), and “zooming in” to areas of interest (since the starting and target coordinates are arbitrary).
It is noted here that the summations in the claims (in the '114 priority document and in the present CIP application) use indices that are defined as sequential integers starting at 1. For claiming purposes, it is intended that the inputted “sample-point component numbers” are indexed in this way, regardless of how the user chooses to refer to them. (That is, the emphasis is on the data processing steps, not on the choice of subscripts and indexes.) That is, the inputted kx-notated “sample-point component numbers” are indexed as kx1, kx2, kx3, etc., and the kyi,z numbers are similarly indexed sequentially from i=1 and z=1. Competitor work-arounds that try to re-index the inputted data, such as −1, −2, −3, etc., are intended as within the scope of the present invention, since the present invention's numbering of data is affirmed regardless of the user's choice.
The claims in the '114 priority document and in the present CIP application refer to complex-number data. It is noted here that real numbers and integer numbers are considered subsets of the complex numbers, as in the rules of algebra. That is, real numbers and integer numbers are within the scope of the claims.
In the present application's claims, the phrase “wherein one of” implies “wherein at least one of”, as is common in claims drafting.
It is noted here that (such as in the case of attempted competitor work-arounds) replacing at least one of the inputted data points with at least one different data point (whether it is the coordinates that are changed, or the complex-number data that is changed) is considered within the scope of the present invention (including the present application's claims and the priority documents's claims). For example, in such cases, starting-space data is stored, which is explicitly listed in the present claims and in the priority documents's claims, and furthermore is in the category of “pre/post-processing” data or “pre/post-conditioning” data.
18. Additional Comments and Disclosures
It is common in the background art to reconstruct and deconstruct data so that it is within the typical Fourier-defined square or rectangular regions, as defined by the rules of Fourier space, and therefore circular/oval sets of data are often arranged as an inscribed circle/oval in a typical square or rectangular Fourier region. In contrast, the HRGB's flexibility allows circular/oval sets of data that are circumscribed outside the typical Fourier region, or to process and establish data in a larger circular/oval region or larger square or rectangular region. In brief, arbitrary starting and target points are a key feature of the HRGB method.
In the context of multi-media compression, the FS data points outputted after deconstruction can be grouped or sequenced. For example, if a web browser has its quality setting set, then a web transfer of data can transmit a corresponding number of groups of FS data points. Or, the web transfer can transmit a number of FS data points according to a pre-set sequence. The larger the number of data groups, or the longer the sequence of data, the web browser (or data recipient in general) can obtain a corresponding amount of FS information, for the decompression/reconstruction step. Preferably, the data groups or data sequences are arranged such that the uncompressed/reconstructed multi-media quality increases proportionally as the number of groups or the length of sequence increases. For example, a low quality choice could result in a rough but acceptable multi-media reconstruction. A high quality choice could result in the complete data set.
In the context of JPEG image compression (similarly applied to multi-media compression in general), current techniques typically cluster adjacent image points or pixels as a single color, in each of the color channels. It is then these clustered colors that are data compressed, rather than compressing the colors of each pixel in the cluster. (It is noted here that, as in the art, including in the context of JPEG compression, the term color channel is defined loosely, since it often refers to intensities, etc., rather than actual spectral colors.) A new technique is as follows. In each color channel (loosely defined as in the art), the data is clustered in the shape of a “plus”, which is a set of five adjacent pixels, and the cluster's color is the average or weighted average of the colors of the five pixels in the cluster. In each color channel, the “pluses” are tiled. The different color channels can use the same tiling pattern, or preferably, each color channel has a tiling pattern that is slightly offset from the prior color channel, such as by an offset of a single pixel. Any of the common data compression techniques (or any desired data compression techniques in general) can then be applied to these color clusters, rather than to the typical color clusters. (The phrase “common data compression techniques” is intended to include the HRGB method. It is further noted that it is well known in the related arts how the steps of deconstruction and reconstruction fit in to data compression and multi-media compression, hence this aspect does not need to be discussed in detail here.)
19. Additional Comments and Disclosures in the Present Application
The prior few sections are identical to or essentially identical to the corresponding sections of the priority document U.S. application Ser. No. 14/935,491.
The following sections include additional comments and/or disclosures in the present CIP application.
In the following sections, reference is made to the present CIP patent application's three priority documents, which are: U.S. application Ser. No. 14/935,491, U.S. application Ser. No. 14/639,114, and U.S. Provisional App. No. 61/947,737.
As was discussed in the priority documents, one of the key aspects of the HRGB method is the fact that it allows arbitrary selections of FS and IFS data points, therefore reconstructions and deconstructions can contain point collections with multiple different densities. This feature can be applied to data such as multi-media data, for unique data compression purposes or graphical effects. For example, an image can be reconstructed from FS data, such that the reconstructed image contains point regions with different densities. Areas of interest, for example, might be reconstructed with high resolutions, whereas some areas are reconstructed with sparser point distributions. Furthermore, any or all of the sparse data points can be “grown” outward, either directly or with interpolation, to fill up the full pixel collection of an image. Similarly, deconstructions can compute FS data with multiple different resolutions, such as in the case of data compression.
In the case of remote sensing data, non-linear color transformations can sometimes be used as efficient or rudimentary replacements for side-lobe or point-spread artifact reduction. For example, by using a quadratic rather than linear transformation of outputted color data to grayscale colors.
Interesting multi-media effects can be accomplished by inputting random or semi-random data (or non-random data) into the HRGB method. For example, interesting artwork images can be reconstructed from random or semi-random FS data (or non-random FS data). Since the HRGB method allows radial data (and arbitrary data, in general), the multi-media artwork effects can accomplish patterns and effects that are not readily accomplished by standard techniques such as Fourier techniques.
As in all of the present application's priority documents, references to reconstruction/deconstruction of multi-media data are intended include the context of data compression. Therefore, in the present application's claims, as in the prior applications's claims, the references to multi-media include multi-media data compression. The present application's claims further include the term “digital data compression”, which is intended to refer to data compression in general, not just multi-media data. That is, the compressed data is not limited to data representing multi-media.
It is known in the art that blur effects can be accomplished by decreasing the weights of FS data whose coordinates are further from an origin point, or by increasing the weights of FS data whose coordinates are closer to an origin point. Since the HRGB method allows radial data and/or arbitrary data points, interesting “glow effects” can be accomplished in this way, and are more readily accomplished and more general than can be accomplished with typical Fourier-based techniques.

## Claims

1. A method for data reconstruction or deconstruction, comprising:
(a) acquiring, by inputting into a processing device or storing in a memory, a starting-space data set comprising a plurality of N-dimensional starting-space sample points selected by a user or a computer from an acquired image, audio, video, molecular analysis, chemical analysis, protein analysis, digital signal, digital data compression, or spectroscopy data superset, wherein each N-dimensional starting-space sample point comprises a set of associated sample-point component numbers, each set of sample-point component numbers notated herein as {kx, ky, k3, k4, . . . , kN; a, b}, and wherein starting-space is either frequency-space or inverse frequency-space;
(b) calculating, on a processor, for each of at least one user-selected or computer-selected x-coordinate px in target-space, an associated horizontal key res1 comprising at least one horizontal key element, wherein target-space is frequency-space when starting-space is inverse frequency-space and is inverse frequency-space when starting-space is frequency-space, and wherein each horizontal key element is notated as res1i and comprises at least one term of the sum:





  
    ∑
    
      z
      =
      
        r
        1
      
    
    
      r
      2
    
  
  ⁢
  
    (
    
      
        
          
            e
            
              j2π
              ⁢
              
                
              
              ⁢
              
                ky
                
                  i
                  ,
                  z
                
              
              ⁢
              
                E
                1
              
              ⁢
              
                p
                x
              
              ⁢
              
                E
                2
              
            
          
          *
        
        <
        
          a
          
            i
            ,
            z
          
        
      
      ,
      
        
          b
          
            i
            ,
            z
          
        
        >
      
    
    )
  




wherein j2=−1, index z is a positive integer, and r1=1 and r2=Li, wherein Li is a number of ky values paired with at least one of the kx-notated values in the starting-space data set, and further wherein E1 and E2 are each a region scaling factor, kyi,z is one of the sample-point component numbers in the starting-space data set, <ai,z, bi,z> is one of a plurality of complex-number starting-space data values in the starting-space data set, and wherein * represents complex-number multiplication;
(c) calculating, on the processor, for each of at least one user-selected or computer-selected target-space point (px, py) comprising a current target-space x-coordinate px and a current target-space y-coordinate py, a color, wherein the color comprises at least one term of the sum:





  
    ∑
    
      i
      =
      
        r
        3
      
    
    
      r
      4
    
  
  ⁢
  
    (
    
      
        e
        
          j2π
          ⁢
          
            
          
          ⁢
          
            p
            y
          
          ⁢
          
            E
            5
          
          ⁢
          
            kx
            i
          
          ⁢
          
            E
            6
          
        
      
      *
      res
      ⁢
      
        
      
      ⁢
      
        1
        i
      
    
    )
  




wherein j2=−1, index i is a positive integer, r3=1 and r4=n, wherein n is a number of kx values in the starting-space data set, and further wherein E5 and E6 are each a region scaling factor, kxi is one of the sample-point component numbers in the starting-space data set, res1i is one of the horizontal key elements associated with at least one of the horizontal keys, and wherein * represents complex-number multiplication; and
(d) forming, by storing in the memory, outputting to a display device, storing on a storage device, or outputting to an output device, target-space data comprising at least one of the computed colors, thereby generating target-space data having a resolution corresponding to a number or density of the selected target-space points.

2. The method of claim 1, further comprising applying at least one density-compensation function, by calculating on the processor or storing in the memory, at least one additional starting-space data value, wherein each additional starting-space data value comprises a complex number computed based on at least one sample-point component number in the starting-space data set.

3. The method of claim 2, wherein one of the at least one density-compensation function is a ramp filter, Voronoi weighted filter, modified ramp filter, apodized ramp filter, Hanning/Hann filter, Butterworth filter, ramp-Hanning filter, ramp-Hamming filter, Parzen filter, Hamming filter, Shepp-Logan filter, Cosine filter, or square root of a ramp filter.

4. The method of claim 2, wherein one of the at least one density-compensation function is defined as a function of the distance between at least two starting-space coordinates.

5. A system for reconstructing or deconstructing data, comprising:
(a) a processing device configured to acquire, by way of an input interface, a starting-space data set comprising a plurality of N-dimensional starting-space sample points selected by a user or a computer from an acquired image, audio, video, molecular analysis, chemical analysis, protein analysis, digital signal, digital data compression, or spectroscopy data superset, wherein each N-dimensional starting-space sample point comprises a set of associated sample-point component numbers, each set of sample-point component numbers notated herein as {kx, ky, k3, k4, . . . , kN; a, b}, and wherein starting-space is either frequency-space or inverse frequency-space;
(b) a processor configured to calculate, for each of at least one user-selected or computer-selected x-coordinate px in target-space, an associated horizontal key res1 comprising at least one horizontal key element, wherein target-space is frequency-space when starting-space is inverse frequency-space and is inverse frequency-space when starting-space is frequency-space, and wherein each horizontal key element is notated as res1i and comprises at least one term of the sum:





  
    ∑
    
      z
      =
      
        r
        1
      
    
    
      r
      2
    
  
  ⁢
  
    (
    
      
        
          
            e
            
              j2π
              ⁢
              
                
              
              ⁢
              
                ky
                
                  i
                  ,
                  z
                
              
              ⁢
              
                E
                1
              
              ⁢
              
                p
                x
              
              ⁢
              
                E
                2
              
            
          
          *
        
        <
        
          a
          
            i
            ,
            z
          
        
      
      ,
      
        
          b
          
            i
            ,
            z
          
        
        >
      
    
    )
  




wherein j2=−1, index z is a positive integer, and r1=1 and r2=Li, wherein Li is a number of ky values paired with at least one of the kx-notated values in the starting-space data set, and further wherein E1 and E2 are each a region scaling factor, kyi,z is one of the sample-point component numbers in the starting-space data set, <ai,z, bi,z> is one of a plurality of complex-number starting-space data values in the starting-space data set, and wherein * represents complex-number multiplication,
and further configured to calculate, for each of at least one user-selected or computer-selected target-space point (px, py) comprising a current target-space x-coordinate px and a current target-space y-coordinate py, a color, wherein the color comprises at least one term of the sum:





  
    ∑
    
      i
      =
      
        r
        3
      
    
    
      r
      4
    
  
  ⁢
  
    (
    
      
        e
        
          j2π
          ⁢
          
            
          
          ⁢
          
            p
            y
          
          ⁢
          
            E
            5
          
          ⁢
          
            kx
            i
          
          ⁢
          
            E
            6
          
        
      
      *
      res
      ⁢
      
        
      
      ⁢
      
        1
        i
      
    
    )
  




wherein j2=−1, index i is a positive integer, r3=1 and r4=n, wherein n is a number of kx values in the starting-space data set, and further wherein E5 and E6 are each a region scaling factor, kxi is one of the sample-point component numbers in the starting-space data set, res1i is one of the horizontal key elements associated with at least one of the horizontal keys, and wherein * represents complex-number multiplication; and
(c) a memory configured to form target-space data by storing at least one of the computed colors, thereby generating target-space data having a resolution corresponding to a number or density of the selected target-space points.

6. The system of claim 5, wherein the memory further comprises being configured to apply at least one density-compensation function, by storing at least one additional starting-space data value, wherein each additional starting-space data value comprises a complex number computed based on at least one sample-point component number in the starting-space data set.

7. The system of claim 6, wherein one of the at least one density-compensation function is a ramp filter, Voronoi weighted filter, modified ramp filter, apodized ramp filter, Hanning/Hann filter, Butterworth filter, ramp-Hanning filter, ramp-Hamming filter, Parzen filter, Hamming filter, Shepp-Logan filter, Cosine filter, or square root of a ramp filter.

8. The system of claim 6, wherein one of the at least one density-compensation function is defined as a function of the distance between at least two starting-space coordinates.

9. A non-transitory computer-readable storage device storing instructions that when executed by a computer cause the computer to perform a method for using a computer system to reconstruct or deconstruct data, the method comprising:
(a) acquiring, by inputting into a processing device or storing in a memory, a starting-space data set comprising a plurality of N-dimensional starting-space sample points selected by a user or a computer from an acquired image, audio, video, molecular analysis, chemical analysis, protein analysis, digital signal, digital data compression, or spectroscopy data superset, wherein each N-dimensional starting-space sample point comprises a set of associated sample-point component numbers, each set of sample-point component numbers notated herein as {kx, ky, k3, k4, . . . , kN; a, b}, and wherein starting-space is either frequency-space or inverse frequency-space;
(b) calculating, on a processor, for each of at least one user-selected or computer-selected x-coordinate px in target-space, an associated horizontal key res1 comprising at least one horizontal key element, wherein target-space is frequency-space when starting-space is inverse frequency-space and is inverse frequency-space when starting-space is frequency-space, and wherein each horizontal key element is notated as res1i and comprises at least one term of the sum:





  
    ∑
    
      z
      =
      
        r
        1
      
    
    
      r
      2
    
  
  ⁢
  
    (
    
      
        
          
            e
            
              j2π
              ⁢
              
                
              
              ⁢
              
                ky
                
                  i
                  ,
                  z
                
              
              ⁢
              
                E
                1
              
              ⁢
              
                p
                x
              
              ⁢
              
                E
                2
              
            
          
          *
        
        <
        
          a
          
            i
            ,
            z
          
        
      
      ,
      
        
          b
          
            i
            ,
            z
          
        
        >
      
    
    )
  




wherein j2=−1, index z is a positive integer, and r1=1 and r2=Li, wherein Li is a number of ky values paired with at least one of the kx-notated values in the starting-space data set, and further wherein E1 and E2 are each a region scaling factor, kyi,z is one of the sample-point component numbers in the starting-space data set, <ai,z, bi,z> is one of a plurality of complex-number starting-space data values in the starting-space data set, and wherein * represents complex-number multiplication;
(c) calculating, on the processor, for each of at least one user-selected or computer-selected target-space point (px, py) comprising a current target-space x-coordinate px and a current target-space y-coordinate py, a color, wherein the color comprises at least one term of the sum:





  
    ∑
    
      i
      =
      
        r
        3
      
    
    
      r
      4
    
  
  ⁢
  
    (
    
      
        e
        
          j2π
          ⁢
          
            
          
          ⁢
          
            p
            y
          
          ⁢
          
            E
            5
          
          ⁢
          
            kx
            i
          
          ⁢
          
            E
            6
          
        
      
      *
      res
      ⁢
      
        
      
      ⁢
      
        1
        i
      
    
    )
  




wherein j2=−1, index i is a positive integer, r3=1 and r4=n, wherein n is a number of kx values in the starting-space data set, and further wherein E5 and E6 are each a region scaling factor, kxi is one of the sample-point component numbers in the starting-space data set, res1i is one of the horizontal key elements associated with at least one of the horizontal keys, and wherein * represents complex-number multiplication; and
(d) forming, by storing in the memory, outputting to a display device, storing on a storage device, or outputting to an output device, target-space data comprising at least one of the computed colors, thereby generating target-space data having a resolution corresponding to a number or density of the selected target-space points.

10. The computer-readable storage device of claim 9, the method further comprising applying at least one density-compensation function, by calculating on the processor or storing in the memory, at least one additional starting-space data value, wherein each additional starting-space data value comprises a complex number computed based on at least one sample-point component number in the starting-space data set.

11. The computer-readable storage device of claim 10, wherein one of the at least one density-compensation function is a ramp filter, Voronoi weighted filter, modified ramp filter, apodized ramp filter, Hanning/Hann filter, Butterworth filter, ramp-Hanning filter, ramp-Hamming filter, Parzen filter, Hamming filter, Shepp-Logan filter, Cosine filter, or square root of a ramp filter.

12. The computer-readable storage device of claim 10, wherein one of the at least one density-compensation function is defined as a function of the distance between at least two starting-space coordinates.