Binarization is widely used as an image preprocessing step to separate object especially text from background before recognition. For noisy images with uneven illumination, threshold values should be computed pixel by pixel to obtain a good segmentation. Since local threshold values typically depend on moments-based statistics such as mean and variance of gray levels inside rectangular windows, integral images are commonly used to accelerate the calculation. However, integral images are memory consuming. For Sauvola's method, the two integral images occupy @math bytes given a @math input image. By using a recursive technique to avoid integral images, memory usage of intermediate data structures can be reduced significantly to @math bytes, while the time complexity remains @math independent of window size. Therefore, the proposed implementation enable various local adaptive binarization methods to be applied in real-time use cases on devices with limited resources.
@cite_20 used integral images to speed up the calculation of the mean of gray levels inside a window. @cite_9 extended the trick to calculate the standard deviation. Let @math , then @math as shown in Fig. . The integral image @math can be computed recursively using the following recurrence relation: @math . Therefore, the time complexity of Sauvola's method can be reduced to @math , which is independent of window size. However, consumption of memory increased significantly from @math to @math because the two additional integral images need to be stored.
@cite_9 @cite_20
2059783351 2005008005 2044439645 2134557905
Many database management systems support whole-image matching. However, users may only remember certain subregions of the images. In this paper, we develop Padding and Reduction Algorithms to support subimage queries of arbitrary size based on local color information. The idea is to estimate the best- case lower bound to the dissimilarity measure between the query and the image. By making use of multiresolution representation, this lower bound becomes tighter as the scale becomes finer. Because image contents are usually pre- extracted and stored, a key issue is how to determine the number of levels used in the representation. We address this issue analytically by estimating the CPU and I O costs, and experimentally by comparing the performance and accuracy of the outcomes of various filtering schemes. Our findings suggest that a 3-level hierarchy is preferred. We also study three strategies for searching multiple resolutions. Our studies indicate that the hybrid strategy with horizontal filtering on the coarse level and vertical filtering on remaining levels is the best choice when using Padding and Reduction Algorithms in the preferred 3-level multiresolution representation. The best 10 desired images can be retrieved efficiently and effectively from a collection of a thousand images in about 3.5 seconds.© (1997) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only. Adaptive binarization is an important first step in many document analysis and OCR processes. This paper describes a fast adaptive binarization algorithm that yields the same quality of binarization as the Sauvola method,1 but runs in time close to that of global thresholding methods (like Otsu's method2), independent of the window size. The algorithm combines the statistical constraints of Sauvola's method with integral images.3 Testing on the UW-1 dataset demonstrates a 20-fold speedup compared to the original Sauvola algorithm. In short-exposure imaging through turbulence, there is some probability that the image will be nearly diffraction limited because the instantaneous wave-front distortion over the aperture was negligible. A number of years ago in a rather brief paper, Hufnagel (1966) argued heuristically that the probability of getting a good image would decrease exponentially with aperture area. This paper undertakes a rigorous quantitative analysis of the probability. We find that the probability of obtaining a good short-exposure image is Prob ≈ 5.6 exp[−0.1557 (D r0)2] (for D r0 ≥ 3.5), where D is the aperture diameter and r0 is the coherence length of the distorted wave front, as defined by Fried (1967). A good image is taken to be one for which the squared wave-front distortion over the aperture is 1 rad2 or less. The analysis is based on the decomposition of the distorted wave front over the aperture, in an orthonormal series with randomly independent coefficients. The orthonormal functions used are the eigenfunctions of a Karhunen-Loeve integral equation. The integral equation is solved using a separation of variables into radial and azimuthal dependence. The azimuthal dependence was solved analytically and the radial, numerically. The first 569 radial eigenfunctions and eigenvalues were obtained. The probability of obtaining a good short-exposure image corresponds to a hyperspace integral in which the spatial dimensions are the independent random coefficients in the orthonormal series expansion. It is equal to the probability that a randomly chosen point in the hyperspace will lie within a hypersphere of unit radius, the points in the hyperspace being randomly chosen in accordance with the product of independent Gaussian probability distribution—one distribution for each dimension. The variance of these distrbutions is directly proportional to the eigenvalues of the Karhunen-Loeve equation. This hyperspace integral (involving up to several hundred dimensions) has been evaluated using Monte Carlo techniques. We assess the applicability of several popular learning methods for the problem of recognizing generic visual categories with invariance to pose, lighting, and surrounding clutter. A large dataset comprising stereo image pairs of 50 uniform-colored toys under 36 azimuths, 9 elevations, and 6 lighting conditions was collected (for a total of 194,400 individual images). The objects were 10 instances of 5 generic categories: four-legged animals, human figures, airplanes, trucks, and cars. Five instances of each category were used for training, and the other five for testing. Low-resolution grayscale images of the objects with various amounts of variability and surrounding clutter were used for training and testing. Nearest neighbor methods, support vector machines, and convolutional networks, operating on raw pixels or on PCA-derived features were tested. Test error rates for unseen object instances placed on uniform backgrounds were around 13 for SVM and 7 for convolutional nets. On a segmentation recognition task with highly cluttered images, SVM proved impractical, while convolutional nets yielded 16 7 error. A real-time version of the system was implemented that can detect and classify objects in natural scenes at around 10 frames per second.