Canon Kabushiki Kaisha

Manoj Mathew

Keiichi Sakai

Allison Bajo

Bradley Scott Denney

Don Hideyasu Matsubayashi

Dariusz T Dusberger

Prateek Jain

Ako Kobayashi

Systems and methods for displaying an object determine a display time of a first object, wherein the display time of the first object is determined based on one or more attributes of objects in a collection of objects, generate a display that includes at least part of the first object in a first portion of the display for the display time of the first object, wherein the display is configured for rendering on a display device, and remove the first object from the first portion of the display after the display time of the first object has elapsed.

Timing of displayed objects

Work is distributed amongst a plurality of nodes. A first plurality of tasks is extracted, where the number of tasks is selected in correspondence to the number of nodes, and where sizes of the tasks are sized based on a job load metric. The first plurality of tasks is distributed. A determination is made whether a time difference between a response from a node that is first to complete its task and a response from a node that is last to complete its task exceeds a predefined threshold. In response to a determination that the time difference exceeds the predefined threshold, the job load metric is adjusted. A second plurality of tasks is extracted, where the number of tasks is selected in correspondence to the number of nodes, and wherein sizes of the tasks are sized based on the adjusted job load metric. The second plurality of tasks is distributed.

Task allocation multiple nodes in a distributed computing system

Image data which includes a feature is labeled. The image data is comprised of pixel data in an N&#xd7;M array. At least one pixel is designated and flagged. Asynchronous processes are executed, where each process corresponds to exactly one pixel. Each process sets a flag only for the owner pixel and only if a connected neighbor pixel in the pre-defined path is flagged. Each process inspects pixel data for all neighbor pixels of the owner pixel to determine if a neighbor pixel is a connected pixel and if the neighbor pixel is flagged, and continues until it sets the flag for the owner pixel or until all connected horizontal and vertical neighbor pixels have been inspected without encountering a connected neighbor pixel whose flag is set. The asynchronous processes are repeated until a pre-defined condition has been satisfied. All flagged pixels are labeled.

Image labeling using parallel processing

Transmission of a medical image such as a DICOM-formatted image which is formatted into a plurality of data sets including a data set for the image data and a data set for embedded information which identifies the nature of the medical image. A region of interest in the medical image is identified automatically by using the embedded information. Image data for the region of interest is transmitted, and image data for a region other than the region of interest is transmitted. Transmission of the image data for the entirety of the region of interest is completed before transmission of the image data for the entirety of the region other than the region of interest.

Transmission of medical image data

An anti-aliasing filter comprised by a first filter kernel is applied to the medical image data so as to obtain filtered image data. The filtered image data is downsampled so as to obtain decimated image data, and pixel resolution of the decimated image data is approximately one half of pixel resolution of the image data for the medical image. The decimated image data is upsampled and an interpolation filter is applied so as to obtain interpolated image data. The interpolation filter is comprised by a second filter kernel, and the size of the first kernel is smaller than the size of the second filter kernel. Pixel resolution of the interpolated image data is approximately equal to pixel resolution of the medical image data. Difference image data between the interpolated image data and the medical image data for the medical image is obtained, and the difference image data is displayed.

Processing of medical image data

A thinned output image is generated from an input image. Values of pixels surrounding a pixel of interest in the input image are determined, and first and second neighboring pixel patterns surrounding the pixel of interest are established based on the values of the pixels surrounding the pixel of interest. The first neighboring pixel pattern may be compared to each of a set of purge patterns to determine whether to eliminate the pixel, and the second neighboring pixel pattern may be compared to each of a set of conservation patterns to determine whether to conserve the pixel. The comparisons to the purge and conservation patterns are performed for each pixel independently, and in parallel for all pixels of the input image.

Parallel processing for generating a thinned image

An erosion image is generated from an original digital image utilizing a processing image (b) and a target image (T), where each pixel in the target image is processed in parallel. The process entails, for each target pixel, i) determining coordinate values for the target pixel, ii) determining a surrounding pixel area for the target pixel, iii) and processing each pixel in the surrounding pixel area to determine whether or not to updated the value of the target pixel. In processing each surrounding pixel, a determination is made whether the pixel has a value of 1. If not, then the next surrounding pixel is processed. If so, then a determination is made which pixel element of a structuring element overlays the target pixel, and whether that SE pixel has a value of 1. If so, then the value of the target pixel is updated. If not, then the next pixel in the surrounding pixel area is processed. Once the target pixel has been updated a set number of times to a predetermined value (e.g., 2), the processing of the remaining surrounding pixels is terminated. After all target pixels have been processed, an output image is obtained by setting target pixels having a value of 2 to a binary value of 1, and setting the other pixels to a binary value of 0. The resultant output image is an erosion image that is then output.

Generating an erosion image utilizing parallel pixel processing

A dilation image is generated from an original digital image utilizing a processing image (b) and a target image (T), where each pixel in the target image is processed in parallel. The process entails, for each target pixel, i) determining coordinate values for the target pixel, ii) determining a surrounding pixel area for the target pixel, iii) and processing each pixel in the surrounding pixel area to determine whether or not to updated the value of the target pixel. In processing each surrounding pixel, a determination is made whether the pixel has a value of 1. If not, then the next surrounding pixel is processed. If so, then a determination is made which pixel element of the structuring element overlays the target pixel, and whether that pixel has a value of 1. If so, then the value of the target pixel is updated. If not, then the next pixel in the surrounding pixel area is processed. Once the target pixel has been updated one time, the processing of the remaining surrounding pixels is terminates. If processing of all surrounding pixels results in no update to the target pixel, then the target pixel is not updated. After all target pixels have been processed, the resultant image is output as the dilation image.

Growing community of inventors

Tustin, CA, United States of America

Manoj Mathew