Abstract: A video coding and decoding device for encoding and decoding video signal by dividing the video signal by dividing the video signal into frequency bands in advance of coding, wherein the timing of refreshing respective frequency bands independently controlled, so as to realize sequential periodical refreshment of every frequency bands, and an increase in refresh-rate for lower-frequency bands. A refresh-control portion determines the frequency bands to be refreshed, and then sends a refresh-command to coding mode selecting portions. Upon receipt of the refresh command, the coding mode selecting portions transfer intraframe-prediction coded information and interframe-prediction coded information.

Abstract: In a method for reconstructing a lip contour signal (LCS) having edge points (EP's) representing the position and shape of a lip image being symmetrical, a reconstructed LCS is obtained based on the LCS by using a standard lip contour signal (SLCS) having predetermined standard edge points (SEP's), the SLCS representing the position and shape of a standard lip image being symmetrical. In detail, the center point of the LCS is first matched as an origin of a two dimensional xy-plane with the center point of the SLCS.

Abstract: A method and apparatus for assigning a temporary label to each connected area in an image by scanning the image by using a window which has a size of two pixels in the vertical direction and of a plurality of pixels in the horizontal direction. A set of values of pixels contained in the above window is obtained and one of predetermined temporary label assignment rules corresponding to the obtained set of pixel values is selected. A temporary label is assigned to each pixel contained in the window, based on the above one of the temporary label assignment rules determined as above, and on temporary labels of pixels in the second group in the window at the above each location. In addition, the temporary labels are converted to true labels, by scanning the image pixel within the at least one circumscribing area only, where each circumscribing area is predetermined so that the at least one circumscribing area contains all pixels which do not belong to a background area in the image.

Abstract: A method of compressing one-dimensional time series data at uniform time intervals includes: a first process of inputting the one-dimensional time series data and an approximation accuracy thereof; a second process of calculating node candidates of an interpolation function approximating the one-dimensional time series data; a third process of optimizing positions of the node candidates; a fourth process of judging an error between one-dimensional time series data produced using the interpolation function, based on the node candidates at optimized positions, and the original one-dimensional time series data; a fifth process of judging an error between one-dimensional time series data produced using the interpolation function on the basis of the node candidates at optimized positions and the original one-dimensional time series data, and changing a node number and returning to the second process when the error exceeds a value based on the approximation accuracy; and a sixth process of outputting data of the no

Abstract: An electronic document-imaging arrangement which generates imaging-bits representing a given document and transfers these bits on a "per-document basis" to various successive electronic processing stages and, finally, to data base storage; this arrangement also including a tag unit adapted to create "sync-tag" bits unique for each such imaged document and transfer these tag bits, along with the imaging bits, for each document to each processing stage that handles the imaging bits on a per document basis, and finally to an associated interface for final matching and removal of the tag bits.

Abstract: An image of a part is used to judge whether it is good or no good. A predetermined intensity, edge or similar feature image is extracted from the inspected image and is quantized. The quantized feature image is obtained from a training image in advance, and the feature is subjected to a generalized Hough transform operation which refers to the weight of each feature point for each feature value in the image and vote the feature point weight. The similarity is obtained from the results of the transform operation, and a good/no good judgement is made depending upon whether the similarity is above or below a threshold value.