00/12/21HIOld‘S'nz2g6oe
`
`i d4-00
`
`ft| Pley/
`
`IN THE UNITED STATES PATENT AND TRADEMARK OFFICE
`REQUEST FOR FILING A PROVISIONAL APPLICATION FOR PATENT
`UNDER 37 CFR §1.53(c}
`
`INVENTOR(S) Levanon
` 21 Bar Ilan St., Raanana, Israel
`3 Nachal Besor St., Ramat Hasharn,Israel
`
`Lavi
`
`TITLE OF THE INVENTION
`
`7/00AAl
`
`OPTIMIZATION T-JUNCTION CRACKING-PROBLEM OF IMAGE
`PARCELS BEING PACKET STREAMED BY UTILIZING QUADTREE
`SCHEME
`
`—X_
`
`Direct all correspondence to Customer Number 23488. AT
`Telephone:
`650.325.2100
`23488
`Facsimile:
`650.325.2107
`PATENT TRADEMARK OFFICE
`
`(Reg No.: 30,320)
`
`
`
`—X_ X
`
`Gerald B. Rosenberg, Esq.
`&| NewTechLaw
`11285 Hamilton Avenue, Suite 520
`af| Palo Alto, California 94301
`
`ENCLOSED APPLICATION PARTS (checkall that apply)
`
`Specification
`
`No.
`
`of pages:
`
`ui
`
`__.__
`
`Smail Entity Statement
`
`Drawings
`
`Declaration
`
`No.
`
`of sheets:
`
`—_s_
`
`Power of Attorney
`
`Assignment and Cover Sheet
`
`Other: _Return-Receipt Post Card
`
`METHOD OF PAYMENT OF FILING FEES FOR THIS PROVISIONAL APPLICATION FOR PATENT
`
`/ Provisional Basic Filing Fee: $ 150.00 (Small Entity: $75.00}
`
`Filing Fee Amount: $ 150.00
`
`|
`
`A check is enclosed to coverthe Filing Fees.
`
`The Commissioneris hereby authorized charge Filing Fees or credit any
`overpayment to: Deposit Account Number: 50-0890.
`
`This invention was not madeby or under contract with a US Government agency.
`
`US Government agency and Contract:
`
`Gerald B. Rosenberg
`Reg. No.: 30,320
`
`Date: December 26, 2000
`
`pplication Docket No:
`
`FLVT3002
`
`Express Mail Label No.:
`
`EL 661 534 274 US
`
`Address To:
`
`Box Provisional Application, Assistant Commissioner for Patents, Washington, DC 20231
`
`gbr/flvt/3002.002.prov.xmittal wpd
`Page 1 of 95
`
`Unified Patents Exhibit 1019
`
`Page 1 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`EFFICIENT CORRECTION OF T-JUNCTION
`CRACKING-PROBLEM OF IMAGE PARCELS BEING
`PACKET STREAMED BYUTILIZING QUADTREE
`SCHEME
`
`Inventors:
`Isaac Levanon
`Yoni Lavi
`
`Backgroundof the Invention
`
`The present invention is generally related to the delivery of high-resolution
`
`highly featured graphic images overlimited and narrowband communications
`
`channels.
`
`Summary of the Invention
`
`The objective is to display a two-dimensional pixel map, a16-Bit RGB color
`
`imagein the preferred embodiments, of very large dimensions and permitting the
`
`viewing of the image from a dynamic three-dimensional viewpoint. Multiple such
`
`images are remotely hosted for on-demand selection and transfer to a client
`
`system for viewing.
`
`Images, as stored by the server, mayindividually range from gigabytes to
`
`multiple terabyte in total size. A correspondingly large server storage and
`
`Attorney Docket No.: FLVT3002
`gbr/tlvt/3002.000.provisional.wpd
`
`12/26/2000
`
`Page 2 of 95
`
`Unified Patents Exhibit 1019
`
`]
`2
`3
`4
`
`5 6 7 8
`
`9
`10
`1]
`12
`13
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`25
`
`26
`
`
`
`=
`
`Page 2 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`
`
`]
`2
`3
`4
`5
`6
`7
`8
`9
`
`10
`
`11
`12
`
`13
`14
`15
`16
`17
`18
`19
`20
`21
`22
`23
`24
`25
`
`-2-
`
`processing system is contemplated. Conversely, client systems are contemplated
`to be conventional personal computer systems and,in particular, mobile, cellular,
`embedded, and handheld computer systems, such as personal digital assistants
`(PDAs) and internet-capable digital phones, with relatively limited to highly
`constrained network communications capabilities. For most wireless applications,
`conventional narrowband communications links have a bandwidth ofless than
`approximately three kilobytes of data per second. Consequently, transmittal of
`entire images to a client system in reasonable timeis infeasible as a practical
`matter.
`
`Overview:
`
`Description of the Invention
`
`For purposesof the present invention, each image (Figure 1) is at least
`logically defined in terms of multiple grids of image parcels with variouslevels of
`resolutions (Figure 2) that are created through composition of information from
`all level of resolutions, and stored by the server to provide an imagefortransfer
`to a client system (Figure 3). Composed and separate static and dynamically
`created layers are transferred to client system in parcels in a program selectable
`orderto optimize for fast quality build-up of the image presented to a userof the
`client system, particularly when the parcels are streamed over a narrowband
`communication link.
`The multiple layers of an image allow the selectivity to incorporate
`topographical, geographical, orientational, and other terrain and mapping
`related information into the image delivered. Other layers, such as geographic
`grids, graphical text overlays, and hyperlink selection areas, separately provided
`
`Attorney Docket No.: FLVT3002
`gbr/flvt/3002.000.provisional.wpd
`
`12/26/2000
`
`Page 3 of 95
`
`Unified Patents Exhibit 1019
`
`Page 3 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`3.
`
`.
`
`—_
`
`or composed, aid in the useful presentation and navigation of the image as
`
`presented bythe client system and viewed by the user.
`
`Compositing of layers on the server enables the data transfer burden to be
`
`reduced, particularly in analysis of the requirements and capabilities of the client
`
`system and the connecting communicationslink. Separate transfer of layers to the
`
`client system allowsthe client system selectivity in managing and presentation of
`
`oO0ONOOODFBWNH
`
` above-stated objective while concurrently achieving a good rendering quality for
`
`the data to the user.
`
`The system and methods of the present invention are designed to, on
`demand, select, process and immediately transfer data parcels to the client
`
`system, which immediately processes and displays a low-detail representation of
`
`11
`
`the image requested by the client system. The system and methods immediately
`
`12
`
`13
`
`continueto select, process and sequentially transfer data parcels that, in turn, are
`
`processed and displayed bythe client system to augment the presented image
`
`and thereby provide a continuously improving imageto the user.
`Selection of the sequentially transferred data is, in part, dependenton the
`
`progressive translation of the three-dimensional viewpoint as dynamically
`
`modified on the client system during the transfer process. This achieves the
`
`19
`20
`
`21
`
`22
`23
`
`24
`
`25
`
`continuousfly-over of the imageas fast as possible, yet continuously building the
`image quality to the highest resolution of the image as stored by the server.
`
`To optimize image quality build-up over
`
`limited and narrowband
`
`is
`communication links, the target image, as requested by the client system,
`represented by multiple grids of 64x64 image pixels (Figure 4) with each grid
`
`having some corresponding level of detail. That is, each grid is treated as a
`
`sparse cata array that can be progressively revised to increase the resolution of
`
`Attorney Docket No.: FLVT3002
`gbr/flvt/3002.000.provisional.wpd
`
`12/26/2000
`
`Page 4 of 95
`
`Unified Patents Exhibit 1019
`
`Page 4 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`-4-
`
`the grid and thereby the level of detail presented by the grid. The reason for
`
`choosing the 64x64 pixel dimension is that, using current image compression
`
`algorithms, a 16-bit 64x64 pixel array image can be presented as a 2KByte data
`
`parcel.
`
`In turn, this 2KByte parcel is the optimal size, subject to conventional
`
`protocol and overhead requirements, to be transmitted through a 3KByte per
`
`second narrowband transmission channel. Using a smaller image array, such as
`
`32x32, would create a 0.5KByte parcel, hence causing inefficiencies due to packet
`
`1
`
`2 3 4 5
`
`6
`
`7
`
`8
`
`transmission overhead, given the nature of current wireless communications
`
`protocols.
`
` independently processablebythe client system, which is enabled by the selection
` operations needed to process the data parcel to be performed without extended
`
`Image array dimensions are preferably powers of two so that they can be
`
`used in texture mappingefficiently. Each parcel, as received by the client system,
`
`is preferably immediately processed and incorporated into the presented image.
`
`To do so efficiently, according to the present invention, each data parcel
`
`is
`
`and server-side processing used to prepare a parcelfor transmission. In addition,
`
`each data parcelis sized appropriate to fit within the level-1 cache, or equivalent,
`
`of the client system processor, thereby enable the data processing intensive
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`memory access delays.
`
`In the preferred embodiment of the present invention,
`
`data parcels are also processed for texture mapping and other image features,
`
`such as topographicaldetailing.
`
`Currently, with regard to conventional client systems, a larger image array,
`
`such as 128x128,is too large to be fully placed within the level-1 cache of many
`
`of the smaller conventional current processors, such as used by personal digital
`
`Attorney Docket No.: FLVT3002
`gbr/flvt/3002.000.provisional.wpd
`
`12/26/2000
`
`Page 5 of 95
`
`Unified Patents Exhibit 1019
`
`Page 5 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`5-
`
`assistants (PDAs) and cellular phones.
`
`Since access to cache memory is
`
`substantially faster than to RAM this will likely result in lower frame rate.
`
`Different and larger data parcel sizes may be optimal as transmission
`
`protocols and micro-architectures of the client computers change. For purposes
`
`above, the data content was a pixel array representing image data. Where the
`
`data parcel contentis vector, text or other data that may subject to different client
`
`—
`
`1]
`
`12
`
`oNONWOOHFFWNY
` 13
` influenced by the actions and commands provided by the user of the client system
`
`system design factors, other parcel sizes may be used.
`
`In the process implemented by the present invention, data parcels maybe
`
`selected for sequential transmission based on a prioritization of the importance
`
`of the data contained. The criteria of importance maybe defined as suitable for
`
`particular applications and may directly relate to the presentation of image
`
`quality, provision of a textual overlay of a low-quality image to quickly provide a
`
`navigational orientation, or the addition of topography information at a rate or
`
`timing different from the rate of image quality improvement. Thus, image data
`
`layers reflecting navigational cues,
`
`text overlays, and topography can be
`
`composed into data packets for transmission subjectto prioritizations set by the
`
`server alone, based on the nature andtypeof the client system, and interactively
`
`19
`
`20
`
`21
`
`22
`
`23
`24
`
`25
`
`(Figure 5).
`
`Progressive transmission of image parcels is performed in an iterative
`
`process involving selection of an image data grid within the target image of the
`
`client system, whichis a portion of a potentially multi-layered source image stored
`
`by the server. The selection parameters are preferably dependent onthe client
`navigation viewpoint, effective velocity, and height, and the effective level of detail
`
`currently presented in each grid. Once a grid is selected, the server selects the
`
`Attorney Docket No.: FLVT3002
`gbr/flvt/3002.000 .provisional.wpd
`
`12/26/2000
`
`Page 6 of 95
`
`Unified Patents Exhibit 1019
`
`Page 6 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`
`
`1
`2
`3
`4
`5
`6
`7
`8
`9
`10
`1]
`
`12
`
`13
`14
`15
`16
`17
`18
`19
`20
`21
`22
`23
`24
`25
`
`-6-
`
`source data to be logically composedinto the selected grid to complement the
`effective resolution of that grid, processing the grid data to produce the optimally
`sized size grid data parcels, and sequentially transmitting the parcels to the client
`system. Preferably, the detail of a grid array is sequentially enhanced by division
`of the grid into sub-grids related by a power of two (Figure 6). Thus, a given grid
`is preferably updated using four data parcels having twice the data resolution of
`the existing grid. Whatever number of parcels are used, each data parcelis
`rendered by the client system into the target image. Additional client system
`imagedata processing to provide texturing and three-dimensional representation
`of the data may be performed aspart of the parcel rendering and integration into
`the target image.
`
`Image Parcel Download Sequence:
`Theserverof the present invention supports the download of parcel data
`to a client system by providing data parcels in response to network requests
`originatedbyclient systems. Each requested data parcelis identified within a grid
`coordinate system relative to an image stored by the server.
`A client system implementing the process of the present invention is
`responsiblefor identifying and requesting parcel data, then rendering the parcel
`data into the target image at the correct location. The client system is also
`responsible for managing navigational and other interaction with the user.
`In
`identifying the parcel data to be requested, the client system operates to select
`grids within the coordinate system, corresponding to portions ofthe target image,
`for which to request a corresponding data parcel. The requests are issued over
`the network to the server and rendering performed asynchronously as data
`
`Attorney Docket No.: FLVT3002
`gbr/flvt/3002.000.provisional.wpd
`
`12/26/2000
`
`Page 7 of 95
`
`Unified Patents Exhibit 1019
`
`Page 7 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`]
`2
`3
`4
`5
`6
`7
`8
`9
`10
`11
`12
`13
`14
`15
`16
`
`17
`
`18
`19
`
`20
`21
`22
`23
`24
`25
`
`
`
`=
`
`-7-
`
`parcels are received. The order of data parcel requests is defined as a sequence
`thatwill provide for the optimal build-up of the target image as presented to the
`user. The rate of optimal build up of the target image is dependent on the nature
`of the target image requested, such as the supported parcelsize and depth of the
`target image that can be rendered bytheclient system.
`The client identifies and requests the download of data parcels in the
`process as follows. Denote the target imageasI, anditssize in pixels as (X, Y).
`Let N be the smallest power of 2 that is equal or greater than max {X,Y}.
`Construct the grid of 64x64 pixel grid-images I5;; that together compose the
`target image |. The rectangle [64i,64i + 64] x [64j,64 j + 64] of |, is mapped
`to |pj;-
`
`In order to view a large portion of the image, the target image, without
`downloadingthe substantial bulk of the target image, mip-mapsof I, are created,
`representing a collection of imagesto be used assurface textures when rendering
`a two-dimensional representation of a three-dimensional scene, and which are
`defined recursively as:
`
`lin (ui) = avg(l, (2i,2)), (21 + 1,2)), (21,2) + 1), i(2i + 1,2] + 1))
`
`Such mip-maps are created upto Iy,M = log, (N) - 6. At this point, Im ts
`a 64x64 image containingthe entire area of the original image, hence no further
`mip-mappingis required.
`The methods ofthe present invention then proceed by constructing the
`respective grids orcells(I,;;) for each mip-map. Each nonempty imagecell Lei
`now may be downloaded. Larger values of k cover more area within the original
`
`Attorney Docket No.: FLVT3002
`gbr/flvt/3002.000.provisional.wpd
`
`12/26/2000
`
`Page 8 of 95
`
`Unified Patents Exhibit 1019
`
`Page 8 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`-8-
`
`image but provide lower detail on that area. The task at hand is now to
`
`determine, given the viewing frustum andthelist of previously downloaded image
`cells 1,,,, downloading which gridswill improve the quality of the display as fast
`as possible, considering the download rate as fixed. The scheme used to
`
`implemented the downloading sequenceof these cells is by constructing a tree,
`starting from ly.¢o9 and expanding a quadtree towardsthe lower mip-maplevels.
`(Quadtrees are data structures in which each node can have up to four child
`
`nodes. As each 64x64 pixel image in the grid 1, has exactly four matching 64x64
`
`pixel images on the grid 1,., covering the same area, the data structure is built
`
`accordingly.)
`
`For every frame that is rendered , begin with thecell that covers the area
`
`
` If the principle mip-map level is equal or higher than thelevelofthe cell,
`
`Oo90ONWOOFWN—
`
`11
`
`12
`13
`
`of the entire original image, Iy.¢o. For each cell under consideration, compute
`the principle mip-map level that should be used to drawit. If it is lower than the
`
`mip-map level of the cell, subdivide the cell
`
`to four smaller cells and use
`
`recursion.
`
`If this operation attempts to draw over areas that do not yet have
`
`imagecells at a low enough mip-map levelto use with them, the recursion stops.
`
`= 18
`
`then the cell is rendered using the cell of the principle mip-map level, whichis the
`
`19
`
`20
`21
`22
`23
`
`24
`
`parent ofthatcell in the Quad-tree, at the appropriate level. Then download the
`
`cells in which the difference betweenthe principle mip-map level to the mip-map
`level of the imagecell actually used is the highest. Downloading is asynchronous;
`the renderer maintains a priority queue of download requests, and separate
`threads are downloading images. Whenever a download is complete, another
`
`downloadis initiated immediately, based on the currently highest-priority request.
`
`Attorney Docket No.: FLVT3002
`abr/flvt/3002.000.provisional.wpd
`
`12/26/2000
`
`Page 9 of 95
`
`Unified Patents Exhibit 1019
`
`Page 9 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`9.
`
`The principle mip-map level of an imagecell is determined by the screen
`
`resolution, FOV(field of view) angle, the angle formed betweenthe image's plane
`
`normal and the line connecting between the camera andthe position within the
`
`cell that is closest to the camera, and a few other factors. The equation, which
`
`uses the above information, approximates the general mip-mapping level
`
`equation:
`
`| = max(0,log, (T/S))
`
`in which S is the surface of the cell as displayed on the screen during rendering
`
`(in pixels), and T is the surface of the cell within the texture being mapped(in
`
`pixels).
`
`When rendering a cell of the grid |,,
`
`T=N72*
`
`and
`
`S = xycos(a)ctg?(0.5FOV)#? T / 2”
`
`where xis the display's x-resolution, y is the display's y-resolution, FOVis thefield-
`
`of-view angle, a is the angle between the image's plane normal and the line
`
`connecting the viewpoint and the point in the cell of shortest distance toit, t is the
`
`length of the square each pixel in the original imageis assigned to in 3D, and z
`
`is the height of the camera over the image's plane.
`
`This arrives at the equation:
`
`Attorney Docket No.: FLVT3002
`gbr/flvt/3002.000.provisional.wed
`
`12/26/2000
`
`1
`
`2 3 4 5
`
`6
`
`7 8
`
`
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`25
`
`Page 10 of 95
`
`Unified Patents Exhibit 1019
`
`Page 10 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`-10-
`
`| = log, (z’ /{xycos(a)ctg*(0.SFOV)i"))
`| = max(O, min(I, M))
`
`For example, using a 64x64 target grid display to render the image from a view
`
`of height N with FOV angle of 90 degrees, with the length of each pixel in space
`
`being one, the entire target image can befitted precisely to the display as
`
`demonstrated by:
`
`1 2 3 4 5 6 7 8
`
`| = log, (N7/(642 #11 °13))=M
`
` schemes, knownasthe T-junction cracking problem, where an image parcelis
` by the difference in resolutions, specifically between one grid and the sub-grids
`
`Image Quality Managementat T-Junctions:
`
`Note that the geometry (polygons) generated by quadtree schemeis non-
`manifold, due fo a problem shared amongall adaptively subdivision triangulation
`
`adjacent to two smaller image parcels.
`
`In the case of the present invention,all
`
`parcels are 64x64 pixel arrays, where the parcels for smaller dimensioned grids
`
`represent a correspondingly higher resolution. The spatial discontinuity created
`
`19
`
`20
`21
`
`22
`
`23
`
`24
`
`of an adjacentgrid, results in undesirable display artifacts.
`
`The presentinvention provides a solution to this problem by converting the
`polygon,or in the presentinstance, grid mesh into a Manifold surface by adding
`
`vertices along edges connecting grids of different cell levels. The addition of new
`
`vertices, where necessary, is done efficiently, involving only constant time per
`
`vertex added.
`
`Attorney Docket No.: FLVT3002
`gbr/flvt/3002.000.provisional.wpd
`
`12/26/2000
`
`Page 11 of 95
`
`’
`
`Unified Patents Exhibit 1019
`
`Page 11 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`to the area it occupies, using the number M - | as a color, where|is the level of
`
`-11-
`
`The algorithm of the present invention works as follows: an 8-bit square
`
`map its created, in which the edge length is 2 + N/64. Where the target image
`
`size in pixels is (X, Y), N is the smallest power of 2 that is equal or greater than
`
`max {X,Y}. For each frame rendered, the contents of this map are reset to zero.
`
`Eachcell that is rendered, is also drawn as a square on the map,corresponding
`
`the grid the polygon is upon, where M is M = log, (N) - 6.
`
`The boundaries of the map remain set to zero while the cells are drawn.
`
`Wheneachofthe polygonsis rendered, its boundaries on the map are checked.
`
`Pixels on the map are evaluated to check if any vertices should be added.
`
`Locations that can be predicted mathematically are not read from the map and
`
`are skipped. Consequently, the process implemented by the present inventionis
`
`efficient and, in particular, more efficient than searching within traditional data
`
`structures such as the Quad-tree as an approachto preventing the occurrence of
`
`T-junction based artifacts.
`
`—
`
`oD0ONWOOTBRWHODY
`
`
`
`11
`
`12
`
`13
`
`14
`
`15
`
`Attorney Docket No.: FLVT3002
`gbr/fivt/3002.000.provisional.wpd
`
`12/26/2000
`
`Page 12 of 95
`
`Unified Patents Exhibit 1019
`
`Page 12 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`
`
`
`13‘Sdd‘IED
` iynNosyul;ulySe
`
`iy
`ey
`
`(/s sjexid
`
`payunjun
`
`GINpeyuUN
`
`ed
`
`aw
`Na
`a
`
`
`
`
`
`}X9}JO}JaAe]pea1ydeig
`
`SJUsWa]oGepueQz-
`
`Pls~~s1ydesBoan
`
`8AI}DEdSJaq
`
`XISUMQE
`
`josaaiBap
`
`wopeal
`
`S[PUILUIO|SJIGOIUlAZ
`
`°
`
`Page 13 of 95
`
`Unified Patents Exhibit 1019
`
`Page 13 of 95
`
`Unified Patents Exhibit 1019
`
`
`
`

`

`¢OIA
`
`Page 14 of 95
`
`Unified Patents Exhibit 1019
`
`Page 14 of 95
`
`Unified Patents Exhibit 1019
`
`
`

`

`3/5
`
`64
`
`64
`
`64
`
`64
`
`
`
`64
`
`64
`
`64
`
`64
`
`Fic. 4
`
`Page 15 of 95
`
`Unified Patents Exhibit 1019
`
`Page 15 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`
`
`FIG.5
`
`
`
`Page 16 of 95
`
`Unified Patents Exhibit 1019
`
`Page 16 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`S/S
`
`:
`
`64
`
`64
`
`64
`
`
`
`IG
`
`Page 17 of 95
`
`Unified Patents Exhibit 1019
`
`Page 17 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`}2-B4J-er
`
`fl | Ploy
`
`IN THE UNITED STATES PATENT AND TRADEMARK OFFICE
`REQUEST FOR FILING A PROVISIONAL APPLICATION FOR PATENT
`UNDER 37 CFR §1.53 (c)
`
`we
`
`wa
`wt
`
`
`
`oLad‘s'n
`
`
`
`Levanon
`
`| Lavi
`
`2g6°F INVENTOR(S]
`
`| 3 NachalBesorSt., Ramat Hasharn,Israel
`21 Bar Ilan St., Raanana, Israel
`
`TITLE OF THE INVENTION
`
`OPTIMIZATION OF RENDERING MEMORY USAGE IN FAST QUALITY
`BUILD-UP TARGET IMAGE TRANSFER OVER LIMITED AND
`NARROWBAND COMMUNICATION NETWORKS
`
`X[oe ot covezondenc e GonNoor 248 Mr
`
`Gerald B. Rosenberg, Esq.
`NewTechLaw
`|} 285 Hamilton Avenue,Suite 520
`Palo Alto, California 94301
`
`(Reg No.: 30,320)
`
`Telephone:
`Facsimile:
`
`650.325.2100
`650.325.2107
`
`23488
`PATENT TEADEMARK OFFICE
`
`ENCLOSED APPLICATION PARTS (checkall that apply)
`
`Specification
`
`No. of pages:
`
`i
`
`Small Entity Statement
`
`Drawings
`
`Declaration
`
`No. of sheets:
`
`Power of Attorney
`
`____ Assignment and Cover Sheet
`
`Other: Return-Receipt Post Card.
`
`METHOD OF PAYMENTOF FILING FEES FOR THIS PROVISIONAL APPLICATION FOR PATENT
`
`Provisional Basic Filing Fee: $ 150.00 (Small Entity: $75.00)
`
`Filing Fee Amount: $ 150.00
`
`A check is enclosed to cover the Filing Fees.
`
`The Commissioneris hereby authorized charge Filing Fees or credit any
`overpayment to: Deposit Account Number: 50-0890.
`
`This invention was not made by or under contract with a US Government agency.
`
`US Government agency and Contract:
`
`Gerald B. Rosenberg
`Reg. No.: 30,320
`
`Date: December 26, 2000
`
`Application Docket No:
`
`FLVT3004
`
`Express Mail Label No.:
`
`EL 661 534 291 US
`
`| Address To:
`
`Box Provisional Application, Assistant Commissioner for Patents, Washington, DC 20231
`
`gbr/flvv3004,002 prov xmittal wpd
`Page 18 of 95
`
`Unified Patents Exhibit 1019
`
`Page 18 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`OPTIMIZATION OF RENDERING MEMORY USAGE IN
`FAST QUALITY BUILD-UP TARGET IMAGE TRANSFER
`OVER LIMITED AND NARROWBAND
`COMMUNICATION NETWORKS
`
`Inventors:
`Isaac Levanon
`Yoni Lavi
`
`Background of the Invention
`
`The present invention is generally related to the delivery of high-resolution
`
`highly featured graphic images overlimited and narrowband communications
`channels.
`
`Summary of the Invention
`
`The objective is to display a two-dimensional pixel map, a1 6-Bit RGB color
`
`imagein the preferred embodiments, of very large dimensions and permitting the
`
`viewing of the image from a dynamic three-dimensional viewpoint. Multiple such
`images are remotely hosted for on-demandselection and transfer to a client
`
`system for viewing.
`
`Attorney Docket No.: FLVT3004
`gbr/flvt/3004.000. provisional.wpd
`
`12/26/2000
`
`Page 19 of 95
`
`Unified Patents Exhibit 1019
`
`]
`2
`3
`4
`
`5 6 7 8 9
`
`10
`11
`12
`13
`14
`15
`
`16
`
`17
`18
`
`19
`
`20
`
`2]
`
`22
`
`23
`24
`
`25
`
`
`
`=
`
`Page 19 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`-2-
`
`Images, as stored by the server, may individually range from gigabytes to
`
`multiple terabyte in total size. A correspondingly large server storage and
`
`processing system is contemplated. Conversely, client systems are contemplated
`to be conventional personal computersystems and,in particular, mobile,cellular,
`
`embedded, and handheld computer systems, such as personal digital assistants
`
`(PDAs) and internet-capable digital phones, with relatively limited to highly
`constrained network communications capabilities. For most wireless applications,
`conventional narrowband communications links have a bandwidth of less than
`
`approximately three kilobytes of data per second. Consequently, transmittal of
`
`entire images fo a client system in reasonable timeis infeasible as a practical
`
`matter.
`
`Overview:
`
`Description of the Invention
`
`For purposes of the present invention, each image (Figure 1) is at least
`logically defined in terms of multiple grids of image parcels with variouslevels of
`
`___
`
`resolutions (Figure 2) that are created through composition of information from
`all level of resolutions, and stored by the server to provide an imagefor transfer
`to a client system (Figure 3). Composed and separate static and dynamically
`created layers are transferred to client system in parcels in a program selectable
`orderto optimize for fast quality build-up of the image presented to a user of the
`client system, particularly when the parcels are streamed over a narrowband
`communicationlink.
`The multiple layers of an image allow the selectivity to incorporate
`
`]
`
`2 3 4 5
`
`6 7
`
`8
`
`10
`
`1]
`
`12
`
`13°
`
` 9
`
`14
`
`15
`16
`
`17
`18
`19
`20
`21
`22
`23
`24
`
`25
`
`topographical, geographical, orientational, and other terrain and mapping
`
`Attorney Docket No.: FLVT3004
`gbr/fivt/3004.000.provisional.wpd
`
`12/26/2000
`
`Page 20 of 95
`
`Unified Patents Exhibit 1019
`
`Page 20 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`3.
`
`related information into the image delivered. Other layers, such as geographic
`grids, graphical text overlays, and hyperlink selection areas, separately provided
`or composed, aid in the useful presentation and navigation of the image as
`presented by the client system and viewed bythe user.
`Compositing of layers on the server enables the data transfer burden to be
`reduced, particularly in analysis of the requirements and capabilities of the client
`system and the connecting communicationslink. Separate transferof layers to the
`client system allowsthe client system selectivity in managing and presentation of
`the datato the user.
`The system and methods of the present invention are designed to, on
`demand, select, process and immediately transfer data parcels to the client
`system, which immediately processes and displays a low-detail representation of
`the image requested by the client system. The system and methods immediately
`continueto select, process and sequentially transfer data parcels that, in turn, are
`processed and displayed bythe client system to augmentthe presented image
`and thereby provide a continuously improving imageto the user.
`Selection of the sequentially transferred datais, in part, dependenton the
`progressive translation of the three-dimensional viewpoint as dynamically
`modified on the client system during the transfer process. This achieves the
`above-stated objective while concurrently achieving a goodrendering quality for
`continuousfly-overof the image asfast as possible,yet continuously building the
`image quality to the highest resolution of the image as stored by the server.
`To optimize image quality build-up over
`limited and narrowband
`communication links, the target image, as requested by the client system,
`is
`represented by multiple grids of 64x64 imagepixels (Figure 4) with each grid
`
`Attorney Docket No.: FLVT3004
`gbr/flvt/3004.000.provisional.wed
`
`12/26/2000
`
`]
`
`2 3 4 5
`
`
`
`
`6
`7
`8
`9
`10
`11
`12
`13
`14
`S 15
`16
`17
`= 18
`19
`20
`21
`22
`23
`24
`25
`
`Page 21 of 95
`
`Unified Patents Exhibit 1019
`
`Page 21 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`
`
`]
`2
`3
`A
`5
`6
`7
`8
`9
`10
`11
`12
`13
`. 14
`£
`15
`
`
`=
`16
`5
`17
`
`18
`19
`20
`21
`22
`23
`24
`25
`
`4.
`
`having some correspondinglevel of detail. That is, each grid is treated as a
`sparse data arraythat can be progressively revised to increase the resolution of
`the grid and thereby the level of detail presented by the grid. The reason for
`choosing the 64x64 pixel dimension is that, using current image compression
`algorithms, a 16-bit 64x64 pixel array image can be presented as a 2KByte data
`parcel.
`In turn, this 2KByte parcel is the optimal size, subject to conventional
`protocol and overhead requirements, to be transmitted through a 3KByte per
`second narrowbandtransmission channel. Using a smaller image array, such as
`32x32, would create a 0.5KByte parcel, hence causing inefficiencies due to packet
`transmission overhead, given the nature of current wireless communications
`protocols.
`Imagearray dimensionsare preferably powers of two so that they can be
`used in texture mappingefficiently. Each parcel, as received by the client system,
`is preferably immediately processed and incorporated into the presented image.
`To do so efficiently, according to the present invention, each data parcel
`is
`independently processable by the client system, which is enabled by the selection
`and server-side processing used to prepare a parcelfortransmission.In addition,
`each data parcelis sized appropriatetofit within the level-1 cache,or equivalent,
`of the client system processor, thereby enable the data processing intensive
`operations needed to process the data parcel to be performed without extended
`memory access delays.
`In the preferred embodimentof the present invention,
`data parcels are also processed for texture mapping and other image features,
`such as topographical detailing.
`Currently, with regard to conventionalclient systems, a larger imagearray,
`such as 128x128,is too large to befully placed within the level-1 cache of many
`
`Attorney Docket No.: FLVT3004
`gbr/flvt/3004.000.provisional.wpd
`
`12/26/2000
`
`Page 22 of 95
`
`Unified Patents Exhibit 1019
`
`Page 22 of 95
`
`Unified Patents Exhibit 1019
`
`

`

`-5-
`
`OoODOONOOOF&FWHNY—
` 17
`
`of the smaller conventional current processors, such as used by personal digital
`assistants (PDAs) and cellular phones.
`Since access to cache memory is
`substantially faster than to RAM this will likely result in lower framerate.
`Different and larger data parcel sizes may be optimal as transmission
`protocols and micro-architectures of the client computers change. For purposes
`above, the data content was a pixel array representing image data. Where the
`data parcel contentis vector, text or other data that may subjectto differentclient
`system design factors, other parcel sizes may be used.
`In the process implementedby the presentinvention, data parcels maybe
`selected for sequential transmission based onaprioritization of the importance
`1]
`of the data contained. Thecriteria of importance maybe defined as suitable for
`12
`particular applications and may directly relate to the presentation of image
`13
`quality, provision of a textual overlay of a low-quality image to quickly provide a
`14
`navigationalorientation, or the addition of topography information at a rate or
`15
`timing different from the rate of image quality improvement. Thus, image data
`16
`layers reflecting navigational cues,
`text overlays, and topography can be
`composedinto data packets for transmission subjectto prioritizations set by the
`server alone, based on the nature andtype ofthe client system, and interactively
`influenced by the actions and commandsprovided bythe useroftheclient system
`(Figure 5).
`|
`Progressive transmission of image parcels is performed in aniterative
`process involving selection of an image data grid within the target imageof the
`client system, whichis a portion of a potentially multi-layered source image stored
`by the server. The selection parameters are preferably dependenton the client
`navigation viewpoint, effective velocity, and height, and the effective level of detail
`
`18
`19
`20
`21
`22
`23
`24
`25
`
`Attorney Docket No.: FLVT3004
`gbr/flvt/3004.000.provi