Abstract:
In a target detection system two images are obtained of a known target, using two different wavelength filters constituting a hyperspectral line pair. The images are subtracted and the resulting image is analyzed by creating a Y profile of pixel values along a vertical line through the target on the image, and creating an X profile of pixel values along a horizontal line through the target on the image. Values of peak signal, peak noise and mean noise are obtained for each profile. These values are used to test certain criteria, which if not met, results in the selection of a new hyperspectral line pair for analysis. If the criteria are met for a first tested profile, then the tests are applied to the second profile. If the analyses of both profiles meet the criteria, then that hyperspectral line pair being tested is stored as a candidate for future use in target detection.
Abstract:
Embodiments of the present invention are disclosed in which one dimensional image compression, such as for bi-level images, is implemented. An integrated circuit includes digital logic circuitry and digital memories. The digital logic circuitry and digital memories are coupled so as to implement one dimensional compression of a bit stream to be applied to the digital logic circuitry and digital memories without performing arithmetic operations. One of the digital read only memories stores, for a plurality of run lengths, a memory address for a make up code and a memory address for a termination code for the respective run lengths.
Abstract:
A method for lossy compression of images reduces visual distortion for a given compressed bit-rate or, equivalently, requires a lower bit-rate for a given level of visual distortion. An image is decomposed using a space-frequency transform and frequency bands are then partitioned into small blocks. The blocks are independently quantized and coded using an embedded block coder, so that each block bit-stream contains a large number of finely spaced truncation points. A visual distortion measure is computed for each block at each truncation point, where the metric is sensitive to masking properties of the Human Visual System. The distortion values and bit-stream lengths corresponding to each block's truncation point are used to optimise overall visual distortion at one or more target bit-rates or to minimise the bit-rate corresponding to one or more target visual distortion levels. A computationally and memory efficient procedure is described for computing the visual distortion measure for each block's truncation point, within each frequency band, as required by the subject compression system.
Abstract:
A method of detecting halftones in the wavelet domain includes determining an energy value for the sub-bands in a wavelet decomposition. The calculated energy values are compared to a model of energy values that are expected when halftone data are not present. If the actual energy values do not conform to the model, halftone data are deemed to be present. In one embodiment, the model defines a pattern of decaying sub-band energy for each sub-band moving from a highest level of the wavelet decomposition to the lowest level of the decomposition. In another embodiment, the expected energy values in the model vary depending upon the bit-rate of compression of the wavelet-domain data.
Abstract:
An image processing system which compresses an image including both a binary image and a continuous tone image by a sub-band transform method with a high compression rate. A 2×2 pixel matrix block is extracted from image data. A transform factor having a plurality of frequency components is obtained from the 2×2 pixel matrix block data. The transform factor is quantized by a fixed-length quantizing method by deleting a predetermined number of lower order bits of each of the frequency components.
Abstract:
An shape data approximation method for reducing the amount of data with an adjacency relationship between a plurality of components maintained. The shape data is read, an adjacent region of the shape data is designated, a virtual surface and a virtual edge are created in the designated adjacent region, and each edge in the shape data is evaluated to determine a evaluation score. The evaluation score is based on a change in the shape of the adjacent region on the assumption that the virtual edge is removed. The edges are subjected to data sorting, and an edge having a low evaluation score is removed with high priority, and resulting approximate shape data is thus output.
Abstract:
An image processing apparatus and method in which voice information is input to specify an object contained in a moving picture, the input voice information is recognized and analyzed, parameters representing the object to be extracted are generated based upon the result of recognition and analysis, and the object is extracted from the moving picture based upon the extracted/generated parameters.
Abstract:
A principle curvature of a target curved surface S′ and a principle curvature of a corresponding position of a reference surface S are obtained and each part is displayed by being classified into (a) a case where two principle curvatures increase, (b) a case where two principle curvatures decrease, and (c) a case where one of the principle curvatures increases and the other decreases from the difference between the principle curvatures. (a), (b), and (c) are determined as mountain, valley, and twist, respectively, and are displayed in different symbols or colors on an image. Consequently, a different part between two three-dimensional shapes can be accurately grasped, the cause of the occurrence of the error such as a partial curve or the like can be easily found, how much the shapes coincide with each other as a whole can be indicated by an objective numerical value, and the error can be easily determined even if the reference shape is complicated.
Abstract:
Various backgrounds, forms, or templates are scanned, features are extracted, and the features are stored in memory. When a composite image is scanned (image of interest plus part of background), features are extracted from the composite image. Features in the composite image are correlated to stored background features to identify which background is present. If necessary, background features from memory are shifted in two dimensions to accommodate displacement of the background. Features corresponding to the background are deleted from the features in the composite image. For forms and templates, features are used to identify the background, and then the information is directly extracted from the composite image.
Abstract:
When an image is to be filed in the storage means 105, an original copy size detection means 102b identifies the type (size and lay) of the original copy. A first positioning means 11a puts up a plurality of possible places on the printing paper to write the ID mark in, the plurality of possible places given a priority number. A space checking means 6 checks the possible space which comes up for checking according to priority numerical order and notifies the first positioning means 11a of the results. A pattern synthesizing means 108 integrates an ID mark corresponding to the document ID in the space found to be blank by the space checking means 6, generating an image representing the marked sheet.