Abstract: A method is disclosed for processing at least a portion of an input digital image comprising rows of pixels extending in two mutually perpendicular directions over a 2D field. The method comprises defining a kernel for processing an image, the kernel comprising at least one row of contiguous elements of the same non-zero value (such rows being referred to herein as equal-valued kernel regions), the equal-valued kernel regions, if more than one, extending parallel to one another. For each pixel in at least selected parallel rows of pixels within the image portion, the cumulative sum of the pixel is calculated by adding a value of the pixel to the sum of all preceding pixel values in the same row of the image portion. The kernel is convolved with the image portion at successive kernel positions relative to the image portion such that each pixel in each selected row is a target pixel for a respective kernel position.

Abstract: A method is disclosed for processing at least a portion of an input digital image comprising rows of pixels extending in two mutually perpendicular directions over a 2D field. The method comprises defining a kernel for processing an image, the kernel comprising at least one row of contiguous elements of the same non-zero value (such rows being referred to herein as equal-valued kernel regions), the equal-valued kernel regions, if more than one, extending parallel to one another. For each pixel in at least selected parallel rows of pixels within the image portion, the cumulative sum of the pixel is calculated by adding a value of the pixel to the sum of all preceding pixel values in the same row of the image portion. The kernel is convolved with the image portion at successive kernel positions relative to the image portion such that each pixel in each selected row is a target pixel for a respective kernel position.

Abstract: A method is disclosed for processing at least a portion of an input digital image comprising rows of pixels extending in two mutually perpendicular directions over a 2D field. The method comprises defining a kernel for processing an image, the kernel comprising at least one row of contiguous elements of the same non-zero value (such rows being referred to herein as equal-valued kernel regions), the equal-valued kernel regions, if more than one, extending parallel to one another. For each pixel in at least selected parallel rows of pixels within the image portion, the cumulative sum of the pixel is calculated by adding a value of the pixel to the sum of all preceding pixel values in the same row of the image portion. The kernel is convolved with the image portion at successive kernel positions relative to the image portion such that each pixel in each selected row is a target pixel for a respective kernel position.

Abstract: A method for producing framing information for a set of N source images, each comprising an object region R, comprises scaling, translating and/or rotating images of the source images so that the object region is aligned. For a given image of the object aligned source images, at a given frame size, a given frame angle for a frame relative to the object aligned images and at a first candidate boundary position for the frame, the method determines if there is at least one position for a second boundary of the frame orthogonal to the first boundary where the frame lies within the image and the frame encloses the object region. If so, counters associated with the first candidate boundary position are incremented. Responsive to any counter meeting a threshold value,K?N, for the source images, framing is indicated as possible at the given frame size, frame angle, first candidate boundary position and any position for the second boundary associated with the threshold meeting counter.

Abstract: A method for producing framing information for a set of N source images, each comprising an object region R, comprises scaling, translating and/or rotating images of the source images so that the object region is aligned. For a given image of the object aligned source images, at a given frame size, a given frame angle for a frame relative to the object aligned images and at a first candidate boundary position for the frame, the method determines if there is at least one position for a second boundary of the frame orthogonal to the first boundary where the frame lies within the image and the frame encloses the object region. If so, counters associated with the first candidate boundary position are incremented. Responsive to any counter meeting a threshold value, K?N, for the source images, framing is indicated as possible at the given frame size, frame angle, first candidate boundary position and any position for the second boundary associated with the threshold meeting counter.

Abstract: A method is disclosed for processing at least a portion of an input digital image comprising rows of pixels extending in two mutually perpendicular directions over a 2D field. The method comprises defining a kernel for processing an image, the kernel comprising at least one row of contiguous elements of the same non-zero value (such rows being referred to herein as equal-valued kernel regions), the equal-valued kernel regions, if more than one, extending parallel to one another. For each pixel in at least selected parallel rows of pixels within the image portion, the cumulative sum of the pixel is calculated by adding a value of the pixel to the sum of all preceding pixel values in the same row of the image portion. The kernel is convolved with the image portion at successive kernel positions relative to the image portion such that each pixel in each selected row is a target pixel for a respective kernel position.