Abstract: A specified object in still images or video may be detected using a sliding search window technique, applied to the original image and its downscaled versions, in order to detect objects of different sizes. At each scale and each position of the sliding window, the technique may use a boosted tree classifier to determine whether the window contains the object. It may exit earlier if some intermediate sum falls below the certain threshold. To accelerate object detection, hybrid features are used in different boosted chains. For first boosted chains, the fastest features may be applied and then, after more complex (but slower) features and for the last few chains, the most powerful feature (but most computationally expensive) is used. This strategy may improve the speed of detection because for a majority of checking windows, only first boosted chains are used and so only the fastest features are calculated in some embodiments.

Abstract: A specified object in still images or video may be detected using a sliding search window technique, applied to the original image and its downscaled versions, in order to detect objects of different sizes. At each scale and each position of the sliding window, the technique may use a boosted tree classifier to determine whether the window contains the object. It may exit earlier if some intermediate sum falls below the certain threshold. To accelerate object detection, hybrid features are used in different boosted chains. For first boosted chains, the fastest features may be applied and then, after more complex (but slower) features and for the last few chains, the most powerful feature (but most computationally expensive) is used. This strategy may improve the speed of detection because for a majority of checking windows, only first boosted chains are used and so only the fastest features are calculated in some embodiments.

Abstract: Super-resolution images may be produced by dividing a higher resolution image into a set of non-overlapping rectangular tiles of substantially the same size. Then, each pixel in each lower resolution image is mapped to the higher resolution image and it is determined which tiles are mapped to which lower resolution image pixels. A continuous buffer may be allocated for each tile and the relevant lower resolution pixels may be stored, together with optical flow vectors, in that continuous buffer. Then, the determination of gradients may use the information now stored in the buffer to facilitate symmetric multiprocessing using multi-core processors.

Abstract: Super-resolution images may be produced by dividing a higher resolution image into a set of non-overlapping rectangular tiles of substantially the same size. Then, each pixel in each lower resolution image is mapped to the higher resolution image and it is determined which tiles are mapped to which lower resolution image pixels. A continuous buffer may be allocated for each tile and the relevant lower resolution pixels may be stored, together with optical flow vectors, in that continuous buffer. Then, the determination of gradients may use the information now stored in the buffer to facilitate symmetric multiprocessing using multi-core processors.

Abstract: Super-resolution images may be produced by dividing a higher resolution image into a set of non-overlapping rectangular tiles of substantially the same size. Then, each pixel in each lower resolution image is mapped to the higher resolution image and it is determined which tiles are mapped to which lower resolution image pixels. A continuous buffer may be allocated for each tile and the relevant lower resolution pixels may be stored, together with optical flow vectors, in that continuous buffer. Then, the determination of gradients may use the information now stored in the buffer to facilitate symmetric multiprocessing using multi-core processors.

Abstract: Super-resolution images may be produced by dividing a higher resolution image into a set of non-overlapping rectangular tiles of substantially the same size. Then, each pixel in each lower resolution image is mapped to the higher resolution image and it is determined which tiles are mapped to which lower resolution image pixels. A continuous buffer may be allocated for each tile and the relevant lower resolution pixels may be stored, together with optical flow vectors, in that continuous buffer. Then, the determination of gradients may use the information now stored in the buffer to facilitate symmetric multiprocessing using multi-core processors.

Abstract: Embodiments of the present invention perform efficient decoding of variable length codes statically defined by a coding standard for a wide range of source data. According to the disclosed method, special data structures (decoding tables) are created. A bit set size is associated with each decoding table. Each decoding table contains a decoded value, actual code length, reference to another table (from the set of created tables), and validity indicator for each bit combination that can be formed from the number of bits equal to the bit set size. An active decoding table is selected. Then the number of bits equal to the bit set size associated with the active decoding table is read from a bit stream. The active decoding table is indexed with the actual value of bits read to obtain the decoded value, actual code length, reference to another table, and validity indicator. The validity indicator is then checked to determine whether the decoded value obtained is valid.

Abstract: Embodiments of the present invention perform efficient decoding of variable length codes statically defined by a coding standard for a wide range of source data. According to the disclosed method, special data structures (decoding tables) are created. A bit set size is associated with each decoding table. Each decoding table contains a decoded value, actual code length, reference to another table (from the set of created tables), and validity indicator for each bit combination that can be formed from the number of bits equal to the bit set size. An active decoding table is selected. Then the number of bits equal to the bit set size associated with the active decoding table is read from a bit stream. The active decoding table is indexed with the actual value of bits read to obtain the decoded value, actual code length, reference to another table, and validity indicator. The validity indicator is then checked to determine whether the decoded value obtained is valid.

Abstract: The present invention allows for the locations of points of interest in a calibration object in a calibration image for a digital camera to be identified automatically. The image is an array of pixels corresponding to the calibration object, which has a known reference pattern. In a preferred embodiment, the invention includes receiving an array of pixels produced by a camera, classifying each pixel of the image as light or dark, extracting contours from the image by identifying lines between light and dark pixels, comparing the extracted contours to the shapes of the known reference pattern, and identifying the shapes of the known reference pattern in the image using the extracted contours. Preferably, the image is a color image, and the color information in the pixels of the image are converted into gray scale values to render the image as a gray scale image before the pixels are classified.