|Publication number||US7912299 B2|
|Application number||US 11/247,513|
|Publication date||22 Mar 2011|
|Filing date||11 Oct 2005|
|Priority date||8 Oct 2004|
|Also published as||US20080031527|
|Publication number||11247513, 247513, US 7912299 B2, US 7912299B2, US-B2-7912299, US7912299 B2, US7912299B2|
|Inventors||Blaise Aguera y Arcas, Julian Walker|
|Original Assignee||Microsoft Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (92), Non-Patent Citations (15), Referenced by (2), Classifications (7), Legal Events (4)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This application claims the benefit of U.S. Provisional Patent Application Ser. No. 60/617,485, filed Oct. 8, 2004, entitled “Method for Encoding Large Texts, Metadata, and other Coherently Accessed Non-Image Data” which is incorporated herein by reference; this application is also a continuation in part of U.S. patent application Ser. No. 11/082,556, filed Mar. 17, 2005, now U.S. Pat. No. 7,254,271 entitled “Method for Encoding and Serving Geospatial or Other Vector Data as Images” which claims the benefit of U.S. Provisional Patent Application Ser. No. 60/622,867, filed Oct. 28, 2004, entitled “Method for Encoding and Serving Geospatial or Other Vector Data as Images,” all of which applications are hereby incorporated herein by reference.
Recently, image compression standards such as JPEG2000/JPIP (JPEG 2000 Interactive Protocol) have been introduced to meet a demanding engineering goal: to enable very large images (i.e. gigapixels in size) to be delivered incrementally or selectively from a server to a client over a low-bandwidth communication channel. (See David Taubman's implementation of Kakadu at www.kakadusoftware.com). When such images are being viewed at full resolution, only a limited region of each image can fit on a client's graphical display at any given time. The new standards are geared toward selectively accessing such regions and sending across the communication channel only data relevant to the region. If this “region of interest” or ROI changes continuously, then a continuous dialogue between a client and server over a low-bandwidth channel can continue to keep the client's representation of the area inside the ROI accurate.
However, existing approaches generally require the transmission of substantial amounts of data to significantly shift the location of the region of interest, thus limiting the speed at which such shifts may be implemented. Moreover, existing approaches generally depend on sequential access to a linear string of text, thereby imposing a significant burden on text navigation when a client seeks to significantly change the location of the region of interest. Accordingly, an improved method for transmitting data from a server to a client is needed.
According to one or more embodiments, the invention provides a method that may include converting data identifying a plurality of visual features into a plurality of pixel characteristic data values; and forming an image file with pixels having the respective pixel characteristic data values. Preferably, the plurality of visual features comprise at least one graphical symbol. Preferably, the visual feature identification data comprises ASCII codes. Preferably, the visual feature identification data comprises frequency-order positions of the visual features. Preferably, the visual feature identification data is determined based on a combination of a) a frequency of use of the visual features and b) transition probabilities between successive ones of the visual features. Preferably, the pixel characteristic data values comprise at least one data type selected from the group consisting of: pixel intensity data values, pixel color data values, and image contrast data values.
Preferably, the pixel characteristic data values comprise pixel color data values. Preferably, the pixel color data values comprise at least one color-data value type selected from the group consisting of: RBG (Red, Blue, Green) pixel color data values, HSV (Hue Saturation Value) pixel color data values, and CMYK (Cyan, Magenta, Yellow, Black) color data values.
Preferably, the method further comprises losslessly compressing said image file. Preferably, the visual feature identification data comprises differences in values of the identification data for successive ones of the visual features. Preferably, the visual features comprise alphanumeric characters. Preferably, the method further comprises locating the pixels in said image file in a same order that said alphanumeric characters are ordered in, within an original document. Preferably, the method further comprises transmitting the image file to a client. Preferably, the method further comprises decoding at least a region of said image file into the alphanumeric characters for viewing by the client. Preferably, the method further comprises enabling the client to browse the decoded image file region in a first dimension.
Preferably, the method further comprises enabling the client to browse the decoded image file region in first and second dimensions. Preferably, browsing in said first dimension includes advancing along a line of the alphanumeric characters, and browsing in the second dimension preferably includes scrolling over a plurality of lines of the alphanumeric characters. Preferably, the browsing comprises browsing the decoded image file in a manner that emulates browsing within the original document. Preferably, the method further comprises correlating locations of the pixels in the image file with locations of the alphanumeric characters corresponding to said pixels in an original document containing the alphanumeric characters.
Preferably, the pixels' locations within the image file at least substantially correspond to locations of the corresponding alphanumeric characters in the original document. Preferably, the pixels' locations within the image file are substantially the same as locations of the corresponding alphanumeric characters in the original document. Preferably, the method further comprises transmitting at least a region of the image file from a server to a client. Preferably, the method further comprises requesting a region of the image file from a server by a client.
Preferably, the method further comprises sending the requested region of the image file by the server. Preferably, the sending step comprises transmitting compressed data suitable for decoding by the client.
According to another aspect, one or more embodiments of the present invention provide an apparatus that may include a processor operating under the instructions of a software program, the software program causing the apparatus to perform actions, including converting data identifying a plurality of visual features into a plurality of pixel characteristic data values; and forming an image file with pixels having the respective pixel characteristic data values.
According to another aspect, one or more embodiments of the present invention may provide a storage medium containing a software program operable to cause an apparatus including a processor under the instructions of the software program to perform actions, comprising: converting data identifying a plurality of visual features into a plurality of pixel characteristic data values; and forming an image file with pixels having the respective pixel characteristic data values.
Other aspects, features, advantages, etc. will become apparent to one skilled in the art when the description of the preferred embodiments of the invention herein is taken in conjunction with the accompanying drawings.
For the purposes of illustrating the various aspects of the invention, there are shown in the drawings forms that are presently preferred, it being understood, however, that the invention is not limited to the precise arrangements and instrumentalities shown.
One or more embodiments of the present invention may involve extending selectively decompressable image compression and transmission technologies to textual or other data that may be identified using a binary representation.
Herein, binary data that identify and/or describe visual features may be converted from an initial format, such as ASCII (American Standard Code for Information Interchange) or other format, may be converted into a format suitable for incorporation into image data, such as but not limited to pixel intensity data.
The visual features referred to above may include but are not limited to graphical symbols and/or alphanumeric characters. However, herein, visual features may include any visible image features that may be described and/or identified using binary data. Moreover, while such data may be encoded into pixel intensity data, the present invention is not limited to encoding in this format.
In one or more embodiments, the initial data (visual feature identification data) may be converted into several possible types of pixel characteristic data including but not limited to pixel intensity data, pixel color data, image contrast data, and/or other form of image data. The above-mentioned pixel color data may include but is not limited to Red, Blue, Green (RBG) pixel color data, Hue Saturation Value (HSV) pixel color data, Cyan, Magenta, Yellow, Black (CMYK) pixel color data, and/or other form of pixel color data.
In the following discussion, a large text, specifically the book “Ulysses,” by James Joyce, is considered. In one or more embodiments, this text may be formatted by putting each chapter in its own column, with columns for successive chapters arranged from left to right. However, it will be appreciated that other arrangements of the chapters may be implemented. Columns are assumed to have a maximum width in characters, such as 100.
In one or more embodiments, the intensity value of each pixel may be set equal to the ASCII code of the character being encoded in the pixel. Because grayscale pixels and ASCII characters may both be represented using 8-bit sequences, (which may both have values in the range 0-255), the correspondence between a pixel value and a character may be readily implemented. In this disclosure, although textual and other characters may be represented with pixels using the ASCII code as a value for pixel intensity, it will be appreciated that other codes for textual or other characters may be employed for this purpose.
Generally, the full text of Ulysses in ordinary ASCII representation (i.e. as a standard text file) occupies 1.5 MB of storage space, which may be too large to transmit in its entirety over a narrowband communication channel. The pixel-characteristic-data representation of character data (which is known herein as the “character-pixel image” and also as the “text-image”) of
However, more important than the overall file size, is the ability of an ordinary JPIP server to serve this file to a client selectively and incrementally. Specifically, of concern here is the ability of a server to serve selected portions of the file at controllable increments of resolution.
In one or more embodiments, a client viewing the text at a zoom level sufficient to read the characters (which may require well over 1 pixel/character on the client-side display) can use JPIP (or other suitable protocol) to request only the relevant portion of the text. This operation is efficient, and adequate performance could be achieved for a reader of the text even with a very low bandwidth connection to the server, under conditions that would make it prohibitive to download the entire text, due to the magnitude of data involved in such a download.
In one or more embodiments, similar effects may be achieved using a client/server technology specifically designed for selective access to large texts, but the character-pixel image approach described above has a number of advantages over conventional implementations, which are listed below.
1) The character-pixel image approach may use existing technology and protocols designed for very large data volume.
2) The character-pixel image approach may easily scale up to texts of many gigabytes in size, or even larger, without any degradation of performance.
3) Access to text or other visual features within a region of interest is preferably two-dimensional in one or more embodiments of the present invention. Thus, in many situations (for example, when text is to be viewed in columns as in the Ulysses case), the character-pixel image approach disclosed herein preferably enables more efficient browsing than is available using existing approaches that deal with text as a one-dimensional string.
4) Because wavelets are used in JPEG2000, the character-pixel image is preferably subject to a multi-resolution representation. Although the text, or other visual feature identified using visual feature identification data, will generally not be readable at other than the final (most detailed) resolution, the broader spatial support of lower-resolution wavelets preferably provides an intelligent client-side cache for text, and/or other visual features, near the region of interest. Moving the ROI over various regions of the original text, as may be done when scrolling through text in a traditional manner, may therefore be efficiently performed using one or more embodiments of the present invention.
In one or more embodiments, the above concepts may be readily extended to deal with formatted text, Unicode, or other metadata, as all such data can be represented using ASCII text strings, possibly with embedded escape sequences.
In selected applications, JPEG2000 may be used as a lossy compression format, meaning that the decoded image bytes are not necessarily identical to the original bytes. Herein, the term “decoding” refers to converting pixel data in a text image back into the original text data, or other visual feature data. If the image bytes represent text, lossy compression will generally not be acceptable. One of the design goals of JPEG2000 was, however, to support lossless compression efficiently, as this is important for certain imaging functions (such as for medical and scientific applications). Lossless compression ratios for photographic images are typically only around 2:1, as compared with visually acceptable lossy images, which can usually easily be compressed by 24:1.
Image compression, both lossy and lossless, generally operate best on images that have good spatial continuity, meaning that the differences between the intensity values of adjacent pixels are low. The raw ASCII encoding is not optimal from this perspective, since successive text characters encoded in ASCII may have widely varying values. Thus, some alternatives are considered below.
In one or more embodiments of the present invention, the encoding efficiency may be improved by reordering characters according to their frequency of occurrence in the pertinent text, in the English language as a whole, or in another language as a whole, from highest frequency to lowest frequency. Thus, in one or more embodiments, empty space would have code zero, and a pixel value of zero in the character-pixel image. The “space” character could receive code “one” (with its corresponding value in the character-pixel image also being “1”). A sequence of characters such as e, t, a, o, i, n, s, r, h, l, etc. . . . could be caused to convert to successive pixel values starting with “2” (corresponding to “e”) and proceeding upward therefrom up to the value 255.
It is possible that, upon converting all the characters in a large text into pixel values using this approach, all 255 pixel values could end up being used. However, by the very nature of the text character (or other visual feature) to pixel value conversion contemplated herein, pixel value occurrences preferably become increasingly rare with increasing numerical values thereof.
The image of
Where all pixel values in the range 0-255 are equally likely, eight bits will generally be needed to represent each pixel value. However, in embodiments in which some pixel values occur much more frequently than others, the pixel values can preferably be represented with fewer bits, without losing any information.
An example is considered to illustrate this point. In this extreme case, the pixel value equals zero 99% of the time, and has another value, somewhere between 0 and 255, the rest of the time. In this case, the encoding algorithm may encode the 0 value with a single “0” bit, and non-zero values with a leading “1” bit (to signal the presence of a non-zero value) followed by an 8-bit representation of the non-zero value. Thus, this approach conserves 7 bits per pixel for 99 out of 100 pixels, but uses one extra pixel to represent a non-zero pixel which occurs only 1% of the time. The decoding algorithm corresponding to the above-described encoding algorithm thus preferably interprets a “0” bit as representing a 0 bit value and a bit sequence starting with a “1” bit value has having the value represented by the bits succeeding the leading “1” bit.
However, even in less extreme situations, the existence of pixel values that occur much more frequently than others may enable considerable savings in storage space, without incurring any loss of pixel data, and by logical extension without incurring any loss of the visual-feature data represented by the pixel data. In general, two or more categories of value occurrence frequency may be established, generally using a progressively increasing number of bits to represent values occurring with decreasing frequency. In this manner, smaller bit sequences may be used most of the time, thereby conserving data storage space and data communication bandwidth requirements.
In an intermediate example, five bits could be used to represent the most frequently occurring pixel values, and nine bits for the less frequently occurring values. For the most frequently occurring visual features, a leading bit, which may be a “0”, may be provided, which may be followed by four bits representing the actual value of the pixel. For the less frequency occurring pixel values, a leading bit, which may be a “1”, may be provided, which may be followed by eight bits representing the actual value of the pixel.
In one or more other embodiments, frequency encoding may benefit from spatial coherence to represent a text image using a reduced number of bits. Specifically, the image may be divided into 8×8 pixel blocks, thus providing 64 pixels in each block, with each pixel representing a frequency encoded visual feature (which may be a text character). The encoding method may then review each block and determine the number of bits needed to represent the highest-valued pixel value in the block. This determined number of bits may then be used to represent all pixel values in that block.
For many of the blocks within any given image, the highest-value pixel may be able to be represented with four or fewer bits. Thus, considerable savings in data storage requirements may be obtained when employing this block by block approach.
In one or more embodiments, when the frequency-encoded text-image of Ulysses is compressed losslessly as a JPEG2000 image, the file size is 1.6 MB, barely larger than the raw ASCII text file (1.5 MB), and 37% smaller than the ASCII encoded text-image. With further optimizations of the letter encoding, the compressed file size can drop well below the ASCII text file size. The further optimizations can include, but are not limited to: using letter transition probabilities (Markov-1) to develop the encoding, instead of just frequencies (Markov-0); and/or encoding as pixels the delta or difference between one character and the next, rather than the characters themselves.
With these added optimizations, text ready to be served in this fashion may actually take up less data storage space than the raw ASCII.
One or more embodiments of the present invention discussed herein include using JPEG2000/JPIP as a selective image decompression technology, but the present invention is not limited to using this image compression technology. Other image compression formats and protocols may be employed in conjunction with the present invention, including but not limited to, for example, LizardTech's MrSID format and protocol, which has similar properties.
In one or more embodiments, RAM 406 and/or ROM 408 may hold user data, system data, and/or programs. I/O adapter 410 may connect storage devices, such as hard drive 412, a CD-ROM (not shown), or other mass storage device to computing system 400. Communications adapter 422 may couple computing system 400 to a local, wide-area, or Internet network 424. User interface adapter 416 may couple user input devices, such as keyboard 426 and/or pointing device 414, to computing system 400. Moreover, display adapter 418 may be driven by CPU 402 to control the display on display device 420. CPU 402 may be any general purpose CPU.
It is noted that the methods and apparatus described thus far and/or described later in this document may be achieved utilizing any of the known technologies, such as standard digital circuitry, analog circuitry, any of the known processors that are operable to execute software and/or firmware programs, programmable digital devices or systems, programmable array logic devices, or any combination of the above. One or more embodiments of the invention may also be embodied in a software program for storage in a suitable storage medium and execution by a processing unit.
Although the invention herein has been described with reference to particular embodiments, it is to be understood that these embodiments are merely illustrative of the principles and applications of the present invention. It is therefore to be understood that numerous modifications may be made to the illustrative embodiments and that other arrangements may be devised without departing from the spirit and scope of the present invention as defined by the appended claims.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4532605||12 Apr 1982||30 Jul 1985||Tektronix, Inc.||True zoom of a displayed image|
|US4549275||1 Jul 1983||22 Oct 1985||Cadtrak Corporation||Graphics data handling system for CAD workstation|
|US4597057 *||31 Dec 1981||24 Jun 1986||System Development Corporation||System for compressed storage of 8-bit ASCII bytes using coded strings of 4 bit nibbles|
|US4847788||12 Feb 1986||11 Jul 1989||Hitachi, Ltd.||Graphic data processing method and system|
|US5222205||16 Mar 1990||22 Jun 1993||Hewlett-Packard Company||Method for generating addresses to textured graphics primitives stored in rip maps|
|US5237647||28 Oct 1991||17 Aug 1993||Massachusetts Institute Of Technology||Computer aided drawing in three dimensions|
|US5367615||2 Sep 1993||22 Nov 1994||General Electric Company||Spatial augmentation of vertices and continuous level of detail transition for smoothly varying terrain polygon density|
|US5471572||9 Jul 1993||28 Nov 1995||Silicon Graphics, Inc.||System and method for adding detail to texture imagery in computer generated interactive graphics|
|US5590250||14 Sep 1994||31 Dec 1996||Xerox Corporation||Layout of node-link structures in space with negative curvature|
|US5666475||3 Jan 1995||9 Sep 1997||University Of Washington||Method and system for editing multiresolution images at fractional-levels of resolution using a wavelet representation|
|US5699497||11 Mar 1996||16 Dec 1997||Evans & Sutherland Computer Corporation||Rendering global macro texture, for producing a dynamic image, as on computer generated terrain, seen from a moving viewpoint|
|US5760783||6 Nov 1995||2 Jun 1998||Silicon Graphics, Inc.||Method and system for providing texture using a selected portion of a texture map|
|US5999187||27 Jun 1997||7 Dec 1999||Resolution Technologies, Inc.||Fly-through computer aided design method and apparatus|
|US6002406||13 Nov 1996||14 Dec 1999||Silicon Graphics, Inc.||System and method for storing and accessing data representative of an object in various level-of-detail|
|US6034661||14 May 1997||7 Mar 2000||Sony Corporation||Apparatus and method for advertising in zoomable content|
|US6154213||29 May 1998||28 Nov 2000||Rennison; Earl F.||Immersive movement-based interaction with large complex information structures|
|US6184894||29 Jan 1999||6 Feb 2001||Neomagic Corp.||Adaptive tri-linear interpolation for use when switching to a new level-of-detail map|
|US6191793||1 Apr 1998||20 Feb 2001||Real 3D, Inc.||Method and apparatus for texture level of detail dithering|
|US6204850||7 Apr 1998||20 Mar 2001||Daniel R. Green||Scaleable camera model for the navigation and display of information structures using nested, bounded 3D coordinate spaces|
|US6204857||16 Apr 1998||20 Mar 2001||Real 3-D||Method and apparatus for effective level of detail selection|
|US6259458||29 Jan 1999||10 Jul 2001||Elastic Technology, Inc.||Method of generating and navigating a 3-D representation of a hierarchical data structure|
|US6313837||29 Sep 1998||6 Nov 2001||Schlumberger Technology Corporation||Modeling at more than one level of resolution|
|US6324621||10 Jun 1998||27 Nov 2001||International Business Machines Corporation||Data caching with a partially compressed cache|
|US6348921||1 May 1998||19 Feb 2002||Ze Hong Zhao||System and method for displaying different portions of an object in different levels of detail|
|US6356659||16 Jan 2001||12 Mar 2002||Eyematic Interfaces, Inc.||Labeled bunch graphs for image analysis|
|US6360029||9 May 1995||19 Mar 2002||International Business Machines Corporation||Method and apparatus for variable magnification of an image|
|US6373495||21 Jun 1999||16 Apr 2002||Industrial Technology Research Institute||Apparatus and method for texture mapping using multiple levels of detail|
|US6392661||17 Jun 1999||21 May 2002||Trident Systems, Inc.||Method and apparatus for improving situational awareness using multiple map displays employing peripheral range bands|
|US6400372||29 Nov 1999||4 Jun 2002||Xerox Corporation||Methods and apparatuses for selecting levels of detail for objects having multi-resolution models in graphics displays|
|US6424933||17 Mar 2000||23 Jul 2002||Vicinity Corporation||System and method for non-uniform scaled mapping|
|US6453330||24 Nov 1999||17 Sep 2002||Ati International Srl||High-precision bilinear interpolation|
|US6476829||15 Jun 2000||5 Nov 2002||Sun Microsystems, Inc.||Method and apparatus for zooming on non-positional display attributes|
|US6493858||10 Jul 2001||10 Dec 2002||The Board Of Trustees Of The Leland Stanford Jr. University||Method and system for displaying VLSI layout data|
|US6501482||11 Oct 2000||31 Dec 2002||Neomagic Corp.||Texture map blender with adaptive interpolation when switching to a new level-of-detail map|
|US6505205||3 Jan 2002||7 Jan 2003||Oracle Corporation||Relational database system for storing nodes of a hierarchical index of multi-dimensional data in a first module and metadata regarding the index in a second module|
|US6509892||17 Dec 1999||21 Jan 2003||International Business Machines Corporation||Method, system and program for topographical interfacing|
|US6563517||29 Jan 1999||13 May 2003||International Business Machines Corp.||Automatic data quality adjustment to reduce response time in browsing|
|US6639598||12 Dec 2000||28 Oct 2003||Intel Corporation||Method and apparatus for effective level of detail selection|
|US6650326||22 Jan 2001||18 Nov 2003||Navigation Technologies Corp.||Method of handling context during scaling with a map display|
|US6681056||30 Mar 1999||20 Jan 2004||International Business Machines Corporation||Method and system for digital image acquisition and continuous zoom display from multiple resolutional views using a heterogeneous image pyramid representation|
|US6703924 *||20 Dec 2001||9 Mar 2004||Hewlett-Packard Development Company, L.P.||Tactile display apparatus|
|US6708309 *||11 Mar 1999||16 Mar 2004||Roxio, Inc.||Method and system for viewing scalable documents|
|US6747649||19 Mar 2002||8 Jun 2004||Aechelon Technology, Inc.||Terrain rendering in a three-dimensional environment|
|US6763137||14 Sep 2000||13 Jul 2004||Canon Kabushiki Kaisha||Recognition and clustering of connected components in bi-level images|
|US6763139||22 Jun 1999||13 Jul 2004||Canon Kabushiki Kaisha||Image coding method and apparatus for localized decoding at multiple resolutions|
|US6885939||31 Dec 2002||26 Apr 2005||Robert Bosch Gmbh||System and method for advanced 3D visualization for mobile navigation units|
|US6891535||16 Mar 2001||10 May 2005||Mitsubishi Electric Research Labs, Inc.||System and method for modeling graphics objects|
|US6904423||18 Feb 2000||7 Jun 2005||Bioreason, Inc.||Method and system for artificial intelligence directed lead discovery through multi-domain clustering|
|US6907345||22 Mar 2002||14 Jun 2005||Maptech, Inc.||Multi-scale view navigation system, method and medium embodying the same|
|US6909965||28 Dec 2001||21 Jun 2005||Garmin Ltd.||System and method for creating and organizing node records for a cartographic data map|
|US6912462||29 Aug 2001||28 Jun 2005||Sony Corporation||Information processing apparatus, information processing method and program storage media|
|US6927782||8 Aug 2002||9 Aug 2005||Airbus France||Airport display device|
|US6943811||21 Mar 2003||13 Sep 2005||David J. Matthews||Apparatus and method of managing data objects|
|US6961754||12 Jan 2001||1 Nov 2005||Telefonaktiebolaget Lm Ericsson||Interactive access, manipulation, sharing and exchange of multimedia data|
|US6981119||29 Aug 2002||27 Dec 2005||Advanced Micro Devices, Inc.||System and method for storing performance-enhancing data in memory space freed by data compression|
|US6982726||18 Jul 2000||3 Jan 2006||Canon Kabushiki Kaisha||Non-Cartesian representation|
|US6985929||31 Aug 2000||10 Jan 2006||The United States Of America As Represented By The Secretary Of The Navy||Distributed object-oriented geospatial information distribution system and method thereof|
|US6993476||26 Aug 1999||31 Jan 2006||International Business Machines Corporation||System and method for incorporating semantic characteristics into the format-driven syntactic document transcoding framework|
|US7072764||5 Mar 2002||4 Jul 2006||University Of Minnesota||Real time high accuracy geospatial database for onboard intelligent vehicle applications|
|US7075535 *||1 Mar 2004||11 Jul 2006||Sand Codex||System and method for exact rendering in a zooming user interface|
|US7088866||26 Jan 2004||8 Aug 2006||Canon Kabushiki Kaisha||Image coding method and apparatus for localized decoding at multiple resolutions|
|US7096118||17 Dec 2004||22 Aug 2006||Harman Becker Automotive Systems Gmbh||Ergonomic map information system|
|US7107285||14 Mar 2003||12 Sep 2006||Questerra Corporation||Method, system, and program for an improved enterprise spatial system|
|US7181457||28 May 2003||20 Feb 2007||Pervasive Software, Inc.||System and method for utilizing compression in database caches to facilitate access to database information|
|US7206696||19 May 2004||17 Apr 2007||Honda Motor Co., Ltd.||Method for modifying navigation information|
|US7248262||28 Feb 2001||24 Jul 2007||Arcsoft, Inc.||Process and data structure for providing required resolution of data transmitted through a communications link of given bandwidth|
|US7283135||6 Jun 2002||16 Oct 2007||Bentley Systems, Inc.||Hierarchical tile-based data structure for efficient client-server publishing of data over network connections|
|US7346856||21 Aug 2003||18 Mar 2008||International Business Machines Corporation||Apparatus and method for distributing portions of large web images to fit smaller constrained viewing areas|
|US7365655 *||12 May 2004||29 Apr 2008||Intel Corporation||Transcoding media content from a personal video recorder for a portable device|
|US7428004 *||25 Jan 2005||23 Sep 2008||Pentax Of America, Inc.||Standalone device connectible to CCTV network|
|US7430473||1 Oct 2004||30 Sep 2008||Bose Corporation||Vehicle navigation display|
|US7480333 *||7 May 2008||20 Jan 2009||Vixs Systems Inc||Method and system for transcoding video data|
|US7542882||6 Dec 2004||2 Jun 2009||Microsoft Corporation||System and method for abstracting and visualizing a route map|
|US7600183 *||2 Jun 2003||6 Oct 2009||Olive Software Inc.||System and method for data publication through web pages|
|US20010030647||11 Jan 2001||18 Oct 2001||Sun Microsystems, Inc.||Using messaging to manage scene-based rendering|
|US20020075311||14 Feb 2001||20 Jun 2002||Julian Orbanes||Method for viewing information in virtual space|
|US20020116586||26 Apr 2002||22 Aug 2002||Marc Tremblay||Shared write buffer for use by multiple processor units|
|US20030026268||11 Mar 2002||6 Feb 2003||Siemens Technology-To-Business Center, Llc||Characteristic routing|
|US20030135649||11 Jan 2002||17 Jul 2003||Xerox Corporation||Method for document viewing|
|US20040027258||30 Apr 2003||12 Feb 2004||Telmap Ltd||Template-based map distribution system|
|US20040056861||16 Sep 2003||25 Mar 2004||Mark Huber||Method of handling context during scaling with a display|
|US20040095400||19 Nov 2002||20 May 2004||Anderson Andrew T.||Reconfiguration of content for display on devices of different types|
|US20040128070||31 Dec 2002||1 Jul 2004||Hauke Schmidt||System and method for advanced 3D visualization for mobile navigation units|
|US20040130579||19 Dec 2003||8 Jul 2004||Shinya Ishii||Apparatus, method, and program for processing information|
|US20040145679||28 Jan 2002||29 Jul 2004||Dong-Hee Kim||Method of transmitting images for online publication|
|US20040170332||26 Jan 2004||2 Sep 2004||Canon Kabushiki Kaisha||Image coding method and apparatus for localised decoding at multiple resolutions|
|US20040187124||11 Feb 2004||23 Sep 2004||Canon Kabushiki Kaisha||Method and device for managing requests in an architecture of the client-server type|
|US20050041858||21 Aug 2003||24 Feb 2005||International Business Machines Corporation||Apparatus and method for distributing portions of large web pages to fit smaller constrained viewing areas|
|US20050149979||25 Jan 2005||7 Jul 2005||Pentax U.S.A., Inc.||Standalone device connectible to CCTV network|
|US20060023956 *||1 Aug 2005||2 Feb 2006||Ola Hugosson||Systems and methods for information storage|
|US20080025391 *||9 Nov 2005||31 Jan 2008||Peter Amon||Transcoding Method And Device|
|US20090016433 *||25 Sep 2008||15 Jan 2009||Canon Kabushiki Kaisha||Method and Device for Selecting a Transcoding Method Among a Set of Transcoding Methods|
|1||Bill Overall, Foveated Image: Applications to Image and Video Compress, Mar. 12, 1999, http://scien.standord, edu/class/psych221/projects/99/wro.|
|2||Chi, Chi-Hung, et al. "Pervasive Web Content Delivery with Efficient Data Reuse" Jul. 26, 2004, [online] [retrieved on Jun. 15, 2007] Retrieved from the Internet entire document (especially p. 8, col. 1, p. 9, col. 2, p. 11, col. 1, p. 13).|
|3||Chi, Chi-Hung, et al. "Pervasive Web Content Delivery with Efficient Data Reuse" Jul. 26, 2004, [online] [retrieved on Jun. 15, 2007] Retrieved from the Internet <URL:http://web.archive.org/web/20040726072942/http://2002.iwcw.org/papers/18500120.pdf> entire document (especially p. 8, col. 1, p. 9, col. 2, p. 11, col. 1, p. 13).|
|4||Foley et al., Computer Graphics: Principles and Practice, Addison-Wesley Publishing Company Inc:, 1997, p. 166-170.|
|5||Hierarchical Data Structures, CS488/688: Introduction to Interactive Computer Graphics, University of Waterloo, Feb. 18, 2001, http://web.archive.org/web/2001028051725/http:/medialab.di.unipi.it/web/IUM/Waterloo/node73. html.|
|6||How to Read a United States National Grid (USNG) Spatial Address, 2000, http:/www.xyproject.org/How%20Read% 20USNG/How%20to%20read%20USNG.htm.|
|7||International Search Report and Written Opinion in PCT/US/2006/011405.|
|8||Mix-in class for Parent Figures, May 10, 2000. http://web.archive.org/web/20030510164335/http://openhealth.com/bw/doc/auto/Parent.html.|
|9||Reading Topographic Maps, Feb. 14, 2003, http://web.archive.org/web/20030214004603/http://www.map-reading.com/ch4-3,php.|
|10||Space Variant Imaging, Nov. 25, 2002, http://web.archive/org/web/20021125075827/http://;www.svi.cps.utexas.edu/index.htm.|
|11||TDB-ACC-NO: NN961137-Disclosure Title: Multidimensional Index Structure With Multi-Level Entry and Skip-Level Search for Partially-Specified Queries.-Publication-Data: IBM Technical Disclosure Bulletin, Nov. 1996, US.|
|12||TDB-ACC-NO: NN961137—Disclosure Title: Multidimensional Index Structure With Multi-Level Entry and Skip-Level Search for Partially-Specified Queries.—Publication-Data: IBM Technical Disclosure Bulletin, Nov. 1996, US.|
|13||The Annoteated VRML 97 Reference, 1999, http://assad.osu.edu/~pgerstma/class/vnv/resources/info/AnnotatedVrmlRef/ch1.htm.|
|14||The Annoteated VRML 97 Reference, 1999, http://assad.osu.edu/˜pgerstma/class/vnv/resources/info/AnnotatedVrmlRef/ch1.htm.|
|15||Williams, Lance, "Pyramidal Parametrics", Jul. 1983, pp. 1-11, ACM SIGGRAPH Computer Graphics, Computer Graphics Laboratory, New York Institute of Technology, Old Westbury, New York, vol. 17, Issue 3.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US8917947 *||20 Jun 2012||23 Dec 2014||International Business Machines Corporation||Selective predictor and selective predictive encoding for two-dimensional geometry compression|
|US20120275719 *||20 Jun 2012||1 Nov 2012||International Business Machines Corporation||Selective predictor and selective predictive encoding for two-dimensional geometry compression|
|U.S. Classification||382/232, 375/E07.198|
|Cooperative Classification||H04N19/40, H03M7/40|
|European Classification||H04N7/26T, H03M7/40|
|12 Jul 2006||AS||Assignment|
Owner name: SAND CODEX, LLC, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:AGUERA Y ARCAS, BLAISE;WALKER, JULIAN;REEL/FRAME:017915/0598
Effective date: 20051115
Owner name: SEADRAGON SOFTWARE, INC., WASHINGTON
Free format text: MERGER;ASSIGNOR:SAND CODEX, LLC;REEL/FRAME:017921/0001
Effective date: 20050829
|1 Nov 2007||AS||Assignment|
Owner name: MICROSOFT CORPORATION, WASHINGTON
Free format text: MERGER;ASSIGNOR:SEADRAGON SOFTWARE, INC.;REEL/FRAME:020052/0368
Effective date: 20070420
|25 Aug 2014||FPAY||Fee payment|
Year of fee payment: 4
|9 Dec 2014||AS||Assignment|
Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICROSOFT CORPORATION;REEL/FRAME:034543/0001
Effective date: 20141014