3196 results about "Bitmap" patented technology

The present invention relates to an apparatus for rapidly analyzing frame(s) of digitized video data which may include objects of interest randomly distributed throughout the video data and wherein said objects are susceptible to detection, classification, and ultimately identification by filtering said video data for certain differentiable characteristics of said objects. The present invention may be practiced on pre-existing sequences of image data or may be integrated into an imaging device for real-time, dynamic, object identification, classification, logging / counting, cataloging, retention (with links to stored bitmaps of said object), retrieval, and the like. The present invention readily lends itself to the problem of automatic and semi-automatic cataloging of vast numbers of objects such as traffic control signs and utility poles disposed in myriad settings. When used in conjunction with navigational or positional inputs, such as GPS, an output from the inventative systems indicates the identity of each object, calculates object location, classifies each object by type, extracts legible text appearing on a surface of the object (if any), and stores a visual representation of the object in a form dictated by the end user / operator of the system. The output lends itself to examination and extraction of scene detail, which cannot practically be successfully accomplished with just human viewers operating video equipment, although human intervention can still be used to help judge and confirm a variety of classifications of certain instances and for types of identified objects.

Methods, systems, and techniques for facilitating access to content stored remotely, for example, as part of a virtual machine infrastructure or elsewhere in a networked environment, using a uniform mechanism are provided. Example embodiments provide an Enhanced Virtual Desktop Management Server / System with a Content Abstraction Layer which enables users to access their data stored as part of a virtual machine environment, or replicated otherwise on a network, using a generic API. The API can be incorporated into a web browser or other third party interface to provide access to the users' data without needing to remote a bitmap representation of a virtual desktop display. Accordingly, users can access their data, applications, and settings regardless of the type of access device and regardless of whether the corresponding virtual desktop is running in the data center, provisioned in the datacenter but running on a client device, or not running at all.

A bitmap of a shape, such as a font, can be subpixel optimized by producing for each of a display's subpixels a coverage value representing the percent of its area covered by the shape being represented and by distributing, to prevent color imbalance, an amount of a given subpixel's coverage value to nearby subpixels of different colors as a function of the percent of the given subpixel's coverage value that causes color imbalance. Web pages can be displayed with scaled-down and subpixel optimized images. A given layout of a Web page can be displayed at each of at least two different selected scale factors, with the font bitmaps used to represent characters in the display at each scale factor having their shape and pixel alignment selected to improve readability for the particular pixel size at which they are displayed at each such scale factor.

Methods and apparatus are disclosed for generating and using an enhanced tree bitmap data structure in determining a longest prefix match, such as in a router, packet switching system. One implementation organizes the tree bitmap to minimize the number of internal nodes that must be accessed during a lookup operation. A pointer is included in each of the trie or search nodes to the best match so far entry in the leaf or results array which allows direct access to this result without having to parse a corresponding internal node. Moreover, one implementation stores the internal node for a particular level as a first element in its child array. Additionally, one implementation uses a general purpose lookup engine that can traverse multiple tree bitmaps or other data structures simultaneously, and perform complete searches, partial searches, and resume partial searches such as after receiving additional data on which to search.

A deterministic finite automaton uses binary search (and optionally hashing) method(s) of sparse matrix representation to recognize the graphical representations of characters or icons from a bitmap representation of the computer screen. This recognition can be applied to translate data from an unknown form of original specification (file format) into a known form of representation, such as HTML. Alternatively this recognition can be applied to another process that can “see” what is on the screen, and perform programmed actions, based on what it “sees”.

The invention is intended to reduce disk access during data transfer from a disk in which occurrence of failure is anticipated to a spare disk as much as possible so that occurrence of double-failure is prevented in advance. When occurrence of failure in a disk which configures a RAID group, contents stored in the disk is copied to the spared disk. Simultaneously, another RAID group is paired with the above described RAID group and a secondary volume is provided therein. A write request is directed to the secondary volume. A differential bitmap controls a update data. Data which is not updated is read out from the primary volume, and data which is already updated is read from the secondary volume. When data transfer is completed, contents stored in the secondary volume are copied to the primary volume.

A method and apparatus for organizing two and / or three-dimensional computer applications on a display in a three-dimensional viewing perspective. A two-dimensional bitmap is created for each respective computer application and applied to a three-dimensional geometry (i.e., primitive). In one embodiment, the three-dimensional geometry is a cube and each respective computer application is mapped onto a respective surface of the cube. The computer user has the ability to manipulate the orientation of the cube, via a computer mouse, for example, to view the different surfaces, and, thus, different computer applications mapped thereon. The user is further given the capability to manipulate or interact with each computer application on each respective surface of the cube. In another embodiment, two or more cubes could be employed for displaying the various computer applications running on the computer's processor. The user could also allocate a particular group or category of applications to each respective cube to accomplish different tasks.

A scanning system includes a hand-held scanning device that generates two-dimensional images of a pattern reflected off an object. The system also includes a memory and processing unit. The memory stores a calibration table for the scanner and received scanned bitmap images. The processing unit generates three-dimensional information as to a scanned object. The scanning can be performed without knowledge or even precise control of the position of the object relative to the scanner. Random movement of the object during scanning is also possible. For example, the scanner is simply swept over the surface of the object by hand. Three-dimensional information of the object is obtained from the captured images using a calibration table for the scanner. A method of calibration of the scanner in X, Y and Z directions is also described. The scanner can be used for a variety of purposes, including medical and industrial purposes. The illustrated embodiment is in-vivo scanning of human teeth for purposes of orthodontic treatment planning and diagnosis.

A method of utilizing one or more hints for query processing over a hierarchical tagged data structure having a plurality of nodes in a computing system having memory, the hint being positive if there is a tag accessible in top-down traversal from a child node, and otherwise negative. For each tag in the data structure, the method calculates a bitmap for a current node with all bits set to 1 and for each child node, followed by AND-ing all child bitmaps and setting a bit corresponding to a tag ID of a current tag to zero if such current tag exists. The method further sets a bit of a current tag to 0, calculates a plurality of possible non-redundant hints for each child node, and refreshes a hint list.

A method of recognizing a handwritten word of cursive script comprising providing a template of previously classified words, and optically reading a handwritten word so as to form an image representation thereof comprising a bit map of pixels. The external pixel contour of the bit map is extracted and the vertical peak and minima pixel extrema on upper and lower zones respectively of this external contour are detected. Feature vectors of the vertical peak and minima pixel extrema are determined and compared to the template so as to generate a match between the handwritten word and a previously classified word. A method for classifying an image representation of a handwritten word of cursive script is also provided. Also provided is an apparatus for recognizing a handwritten word of cursive script. This apparatus comprises a template of previously classified words, a reader for optically reading a handwritten word, and a controller being linked thereto for generating a match between the handwritten word and the previously classified words. Two algorithms are provided for respectively correcting the skew and slant of a word image.

A novel solution for fast packet classification includes a novel data structure to store classifier rules which enables fast packet classification, which structure employs bitmaps for each field of the incoming packet for which classification is desired. A fast packet classification algorithm using the novel data structure allows the matching rule with the highest priority to be quickly obtained. A novel rule update algorithm allows new classifier rules to be added into the data structure incrementally. In one practical implementation of a classification engine employing the structures and algorithms of the present invention, a configurable processor with customized instructions is used to accelerate packet classification.

An efficient write-watch mechanism and process. A bitmap is associated with the virtual address descriptor (VAD) for a process, one bit for each virtual page address allocated to a process having write-watch enabled. As part of the write-watch mechanism, if a virtual address is trimmed to disk and that virtual address page is marked as modified, then the corresponding bit in the VAD is set for that virtual address page. In response to an API call (e.g., from a garbage collection mechanism) seeking to know which virtual addresses in a process have been modified since last checked, the memory manager walks the bitmap in the relevant VAD for the specified virtual address range for the requested process. If a bit is set, then the page corresponding to that bit is known to have been modified since last asked. If specified by the API, the bit is cleared in the VAD bitmap so that it will reflect the state since this time of asking. If the bit is not set, to determine if the page was modified, the page table entry (PTE) is checked for that page, and if the PTE indicates the page was modified, the page is known to be modified, otherwise that page is known to be unmodified since the last call. One enhancement uses page directory tables to locate a series of trimmed pages, sometimes avoiding the need to access the PTE.

The present invention features a playing card shuffling device, which through the use of a small image capturing means, captures an image of the face value of each card and stores the image in memory. This image is sorted in the format of a bitmap image. The operator of the machine would be able to recall through the use of a key pad, the images of the cards that comprised the individual hands in the previous game. This feature allows for verification of a winning hand after a game has been completed. Thereby, a quick recheck of hands before paying a winning hand is performed. The face value of each card is determined by character recognition software. These card values would be stored in memory for archival access for use in monitoring the randomness of the game and determining the number of winning hands.

A method and system for rendering a desktop on a computer using a composited desktop model operating system are disclosed. A composited desktop window manager, upon receiving content information from application programs, draws the window to a buffer memory for future reference, and takes advantage of advanced graphics hardware and visual effects to render windows based on content on which they are drawn. The windows may also be rendered based on environment variables including virtual light sources. The frame portion of each window may be generated by pixel shading a bitmap having the appearance of frosted glass based on the content of the desktop on top of which the frame is displayed. Legacy support is provided so that the operating system can draw and render windows generated by legacy applications to look consistent with non-legacy application windows.

Systems and methods for tracking changes and performing backups to a storage device are provided. For virtual disks of a virtual machine, changes are tracked from outside the virtual machine in the kernel of a virtualization layer. The changes can be tracked in a lightweight fashion with a bitmap, with a finer granularity stored and tracked at intermittent intervals in persistent storage. Multiple backup applications can be allowed to accurately and efficiently backup a storage device. Each backup application can determine which block of the storage device has been updated since the last backup of a respective application. This change log is efficiently stored as a counter value for each block, where the counter is incremented when a backup is performed. The change log can be maintained with little impact on I / O by using a coarse bitmap to update the finer grained change log.

A communication apparatus generates a single physical frame including a plurality of MAC frames, and transmits the physical frame. The physical frame has variable-length bitmap information comprising bits corresponding to the plurality of MAC frames, respectively, and length information of the bitmap information.

A computer system modifies digital images of the human form as well as other objects. The computer system provides intuitive means for accessing warp, smooth, stretch, copy, and paste tools for image modification; undo, toggle and restore tools for change management; and zoom, fit, and full tools for image display sizing. The computer system is controlled by a program that uses a combination of novel approaches to make image manipulation fast and easy. Buttons are displayed only when they are actually available for use, based on the current system operating mode. The image sizing tools enable an image size change to accomodate the tool size without a required change to the cursor state or to the edit mode state. When regions are defined by the user, the cursor shape changes to indicate whether the cursor is located inside a region, outside the region, and on the region bounding box; allowing a user to perform different operations depending upon cursor location rather than depending upon, and requiring, user executed button pushing as a specific operation. The computer system uses display contexts and bitmap masks that enhance operation speed. Operations are always performed on the full image resolution rather than a displayed image resolution.

A method and apparatus for controlling inter-cell interference in an evolved Node-B for a cellular communication system with a frequency reuse factor of 1 are provided. The apparatus includes a bitmap generator for receiving scheduling information from evolved Node-Bs of a plurality of neighbor cells, and for generating scheduling information including its cell's bitmap information for the resource allocation using the received neighbor cells' scheduling information, and a scheduler for scheduling the resource allocation for UEs in its cell based on the scheduling information provided from the bitmap generator and power allocation information of the UEs in its cell.

A method supporting a Hybrid Automatic Repeat Request (HARQ) between a subscriber station and a base station in a broadband wireless access communication system including. The method includes the steps of: transmitting at least one H-ARQ enabled uplink burst from the subscriber station to the base station; generating ACK / NACK information according to the received HARQ enabled uplink burst at the base station; mapping the generated ACK / NACK information to a bitmap at the base station; transmitting the bitmap through a downlink information from the base station to the subscriber station.

The present invention relates to display of visual content on a client device using server-side rasterization of visual content. Visual content is rendered on a server system, transformed into bitmaps compatible with the display attributes of a client device, and transmitted for display on the client device. The invention allows the server to perform, in effect, as a remote browser for displaying Web pages, e-mail, e-mail attachments, electronic document and forms, database queries and results, drawings, presentations, and images at the client device. The approach is “remote” because the server does the rendering and the client provides the interface; “multi-level” because rendered visual content is represented as a multi-level set of raster representations; and constitutes a “browsing system” because the client and server share data about the source visual content element being browsed, and the client performs a specific browsing function assisted by the server.

A method and system for rendering a desktop on a computer using a composited desktop model operating system are disclosed. A composited desktop window manager, upon receiving base object and content object information for one or more content objects from an application program, draws the window to a buffer memory, and takes advantage of advanced graphics hardware and visual effects to render windows based on content on which they are drawn. The frame portion of each window may be generated by pixel shading a bitmap having the appearance of frosted glass based on the content of the desktop on top of which the frame is displayed. Legacy support is provided so that the operating system can draw and render windows generated by legacy applications to look consistent with non-legacy application windows.

A database management system that has bitmap values in which set bits in a representation of a bitstring specify a set of objects whose definitions are built into the database management system. The database management system further includes user-accessible operations on the bitmap values. The bitmap values are represented by means of a mapping specifier that specifies a range of the set of objects and a representation of a string of bits that has been mapped onto the set of object specified by the range specifier. Objects containing bitmap values may be indexed by means of an index tree that includes summary bitmap values.

Data can be protected at a production server in a virtually continuous fashion, without necessarily imposing severe constraints on the source application(s). For example, a production server can create an application-consistent backup of one or more volumes, the backups corresponding to a first instance in time. A volume filter driver can monitor data changes in each volume using an in-memory bitmap, while a log file and / or update sequence number journal can keep track of which files have been added to or updated. The volume updates are also consistent for an instance (later) in time. At the next replication cycle, such as every few minutes (however configured), the volume filter driver passes each in-memory bitmap to the physical disk on the production server. The production server then sends the updates to the backup server, which thus stores application-consistent backups for the volume for multiple instances of time.

A method and apparatus for recording on an optical recording medium, including the recording of management information, are described as a standard for the write-once Blu-ray disc. The management information is recorded in a management area of the disc, such as a temporary defect management area (TDMA), and includes record status information and update information. The record status information is a space bitmap (SBM) indicating whether a recording operation has been performed for a predetermined area of the disc, and the update information is SBM update information indicating whether the record status information is to be continuously managed. The SBM update information controls the state of an SBM-on / off function for each of a plurality of recording areas and may be in the form of either start position information and length information corresponding to the respective areas or an SBM update flag. The SBM update information is recorded in the TDMA and is stored in a memory of an optical disc recording / reproducing device for use during recording and reproducing operations. At the time of recording in the predetermined area, an SBM-on state enables a logical overwriting operation to be performed as necessary.

A mobile device has a touch sensitive surface such as a touch screen. In a touch-based zooming control method, the mobile device displays target data of a selected content on a screen. While the target data is displayed, the mobile device activates a zoom mode in response to a given gesture or input event. Then, the mobile device receives a touch-based gesture input which starts from a specific point on the target data, and executes a zooming function such as a zoom-in and a zoom-out in response to the received gesture input. Particularly, a continuous zooming control in various zooming rates is possible based on a single touch gesture. A toggling-based zooming control is also possible. A bitmap image is used for a rapid real-time display of the target data.