Showing papers on "Residual frame published in 1988"
•
11 Aug 1988TL;DR: In this article, a differential amplitude suppression (DAS) circuit is used to suppress the amplitude of interframe differential block data based on a motion detection threshold value determined by an encoding control circuit.
Abstract: An interframe video data coding and decoding apparatus utilizes a differential amplitude suppression circuit in combination with a block encoder and a motion detector to non-linearly suppress amplitude values of interframe differential block data based on a motion detection threshold value determined by an encoding control circuit. The determined threshold value is based on the amount of encoded data being stored in a transmission buffer memory. The suppressed amplitude differential block data is added to corresponding blocks in a frame memory to update the contents of the frame memory during each frame of input video data. In another embodiment, vector quantization encoders are utilized to transmit a motion vector index with encoded frame differential data. In yet another embodiment, a time integral circuit integrates a continuous input video signal series by frame and writes the integrated frame signal into one of two frame memories, while interframe coding is performed on data stored in the other frame memory. Two transmission buffers are provided so that transmission can occur simultaneously with writing of the encoded interframe data into the buffer, by alternating switched connections of the two buffers.
121 citations
••
TL;DR: Two algorithms to make ray-tracing faster for the production of motion pictures by taking advantage of the fact that motion picture images do not change very much from frame to frame are presented.
Abstract: The basic ray-tracing algorithm is adapted to make ray-tracing faster for the production of motion pictures. Two algorithms are presented. The image space temporal coherence algorithm takes advantage of the fact that motion picture images do not change very much from frame to frame. The reprojection algorithm uses information about the object space saved from the previous frame to accelerate the processing of the current frame. The reprojection algorithm is used when the viewpoint of the current frame is changed by a small amount from the viewpoint of the previous frame.
91 citations
•
17 Oct 1988
TL;DR: In this article, the number of frames between the distance is obtained through division of the obtained distance by the pitch between frame number bar codes or frame numbers, and a frame number of a frame positioned at the film mask is discriminated based on the obtained number of frame and the read frame number.
Abstract: A photographic film is printed with numerical frame numbers and corresponding coded frame number bar codes. When a sensor completely reads a frame number bar code, a transportation quantity measuring unit starts measuring the transportation of the film to obtain a distance between the center of the film mask and the read frame number bar code or the associated frame number. The number of frames between the distance is obtained through division of the obtained distance by the pitch between frame number bar codes or frame numbers. A frame number of a frame positioned at the film mask is discriminated based on the obtained number of frames and the read frame number.
71 citations
•
13 Jun 1988
TL;DR: In this article, a method and apparatus for assigning time slots in a frame of time slots used for time division multiplexing, the time slots being representable as a position within the frame, in which it is determined what quantity of the time slot are required to provide a needed amount of bandwidth.
Abstract: A method and apparatus for assigning time slots in a frame of time slots used for time division multiplexing, the time slots being representable as a position within the frame, in which it is determined what quantity of the time slots are required to provide a needed amount of bandwidth. A random number generator (40) generates (92) a uniformly distributed random number which is scaled (94) to represent a position in the first portion of the frame. A first of the positions within the frame is assigned based upon the value of the randon number. The remaining positions are assigned by fitting (64) the remaining required positions to the available positions in the frame spacing them at approximately equally spaced intervals as available. This prevents bunching of the used time solts which would otherwise prevent dynamic allocation of large blocks of bandwidth in the frame without complete recalculation of the frame.
55 citations
•
30 Sep 1988TL;DR: In this article, a sub-band speech coding arrangement was proposed, which divides the speech spectrum into sub-bands and allocates bits to encode the time frame interval samples of each subband responsive to the speech energies of the subbands.
Abstract: A sub-band speech coding arrangement divides the speech spectrum into sub-bands and allocates bits to encode the time frame interval samples of each sub-band responsive to the speech energies of the sub-bands. The sub-band samples are quantized according to the sub-band energy bit allocation and the time frame quantized samples and speech energy signals are coded. A signal representative of the residual difference between the each time frame interval speech sample of the sub-band and the corresponding quantized speech sample of the sub-band is generated. The quality of the sub-band coded signal is improved by selecting the sub-bands with the largest residual differences, producing a vector signal from the sequence of residual difference signals of each selected sub-band, and matching the sub-band vector signal to one of a set of stored Gaussian codebook entries to generate a reduced bit code for the selected vector signal. The coded time frame interval quantized signals, speech energy signals and reduced bit codes for the selected residual differences are combined to form a multiplexed stream for the speech pattern of the time frame interval.
47 citations
••
TL;DR: A first attempt at a disciplined analysis of the power of a frame buffer seen as a computational engine for use in graphics algorithms is shown, showing the inherent power of frame buffers to perform a number of graphics algorithms in terms of the number of data fields required per pixel, the types of operations allowed on these registers, and the input data.
Abstract: Raster graphics displays are almost always refreshed out of a frame buffer in which a digital representation of the currently visible image is kept. The availability of the frame buffer as a two-dimensional memory array representing the displayable area in a screen coordinate system has motivated the development of algorithms that take advantage of this memory for more than just picture storage. The classic example of such an algorithm is the depth buffer algorithm for determining visible surfaces of a three-dimensional scene. This paper constitutes a first attempt at a disciplined analysis of the power of a frame buffer seen as a computational engine for use in graphics algorithms. We show the inherent power of frame buffers to perform a number of graphics algorithms in terms of the number of data fields (registers) required per pixel, the types of operations allowed on these registers, and the input data. In addition to upper bounds given by these algorithms, we prove lower bounds for most of them and show most of these algorithms to be optimal.One result of this study is the introduction of new frame buffer algorithms for computing realistic shadows and for determining the convex intersection of half spaces, an operation important in computational geometry and in rendering objects defined using planes rather than polygons. Another result is that it shows clearly the relationships between different and important areas of research in computer graphics, such as visible surface determination, compositing, and hardware for smart frame buffers.
43 citations
•
13 Jun 1988
TL;DR: In this article, a detection and write management circuit receives the packets and writes them in a packet memory as and when they arrive, in parallel with the writing of the packets, the addresses of the memory cell having memorized the packets of a given frame are written in the form of a string of frame addresses in a second memory.
Abstract: The apparatus is designed to use a single transmission medium to multiplex frames consisting of any number of bits of different origins which have previously passed through an asynchronous time-division network and are delivered in the form of packets of fixed length interlaced by an asynchronous time-division multiplex. A detection and write management circuit receives the packets and writes them in a packet memory as and when they arrive. In parallel with the writing of the packets, the addresses of the memory cell having memorized the packets of a given frame are written in the form of a string of frame addresses in a second memory. After complete writing of a frame in the first memory, a frame read and transmission circuit completely reads the frame using the corresponding address string and transmits it in serial form on the transmission medium. Packing words such as flags are inserted between the frames read.
37 citations
•
NEC1
TL;DR: In this article, a frame interpolation process is used to convert an input television signal into an output television signal having a second frame number per second in accordance with an interpolation coefficient, where a memory unit memorizes the processed signal in synchronism with a write-in address signal given by a first frame synchronizing signal of the input TV signal.
Abstract: In a television signal frame number converter for converting an input television signal having a first frame number per second into an output television signal having a second frame number per second in accordance with an interpolation coefficient, a processing unit processes two successive frames of the input television signal by a frame interpolation process to produce a processed signal. A memory unit memorizes the processed signal in synchronism with a write-in address signal given by a first frame synchronizing signal of the input television signal and is read out by a read-out address signal given by a second frame synchronizing signal of a reference television signal having the second frame number per second. The converter determines the interpolation coefficient in accordance with a time interval between a write-in start timing of the memory unit and a read-out start timing of the memory unit.
18 citations
•
22 Sep 1988TL;DR: In this article, a motion vector suitable for motion-compensated prediction in an inter-frame differential video coder is derived by comparison of each block of a current frame and with shifted corresponding region of a previous frame with the regions of the previous frame.
Abstract: A motion vector suitable for motion-compensated prediction in an inter-frame differential video coder is derived by comparison of each block of a current frame and with shifted corresponding region of a previous frame with the regions of the previous frame. Rather than dealing with each block in turn, the apparatus carries out all comparisons involving a line n of the video signal before commencing comparisons involving n+p (where p is the number of lines encompassed by a block).
15 citations
•
30 Dec 1988
TL;DR: In this article, an adaptive method for coding and decoding a series of images by transformation is proposed, in which each image is divided into image element frames, each frame being represented by a frame of luminance values, and each frame corresponding to the corresponding color difference values.
Abstract: The invention relates to an adaptive method for coding and decoding a series of images by transformation, the coding comprising: dividing each image into image element frames, each frame being represented by a frame of luminance values, a frame of blue color difference values, and a frame of red color difference values; applying a bi-dimensional cosine transformation to each frame of values in order to obtain a frame of transformation coefficients; transmitting for each frame of values, either the value of the coefficients of transformation of the frame, or the value difference of these transformation coefficients, with respect to the value of the transformation coefficients of the homologous frame in the preceding image; multiplying the transformation coefficients and the differences of transformation coefficients, before the transmission, by a weighting coefficient favouring the low spatial frequencies and by a quantification coefficient, theses two coefficients being variable as a function of the filling of the buffer memory wherein are simultaneously stored coded data corresponding to the luminance values, to the blue color difference values and to the red color difference values. Application to the reduction of flow rate for the transmission of a series of television images.
14 citations
••
01 Jun 1988-Graphical Models \/graphical Models and Image Processing \/computer Vision, Graphics, and Image Processing
TL;DR: It is asserted that, in many instances, the statistical properties of images do not vary significantly from one TV frame period to the next, and it should be possible to produce inexpensive hardware for high-speed histogram modification of TV-rate images.
Abstract: It is asserted that, in many instances, the statistical properties of images do not vary significantly from one TV frame period to the next. It should be possible therefore to produce inexpensive hardware for high-speed histogram modification of TV-rate images. The system described performs TV-rate image enhancement of the current frame using picture statistics collected several frame periods earlier. The total materials cost of the unit is less than £300.
•
29 Jan 1988
TL;DR: In this article, an improved method for transferring motion pictures from film to videotape, with an improved video image quality for moving objects, was described, where the motion picture is filmed at twice the video frame rate.
Abstract: An improved method is disclosed for transferring motion pictures from film to videotape, with an improved video image quality for moving objects. In the preferred embodiment, the motion picture is filmed at twice the video frame rate, and alternating scanning fields from each pair of film frames are transferred to interleaved fields on a single video frame. The method substantially eliminates image jitter of moving objects, and is particularly adapted to a new 3-D television technique. Various alternate transfer systems are described, as well as a generalization of the invention to account for different film speeds or numbers of fields per frame.
•
05 Feb 1988
TL;DR: In this article, the authors propose to encode the picture data of plural frames altogether, leveling the fluctuation of an encoding data quantity and adjusting a date transfer speed in accordance with the encoding data quantities.
Abstract: PURPOSE:To transmit the moving picture data of a high picture quality by encoding the picture data of plural frames altogether, leveling the fluctuation of an encoding data quantity and adjusting a date transfer speed in accordance with the encoding data quantity. CONSTITUTION:A moving picture signal 4 from a moving picture source 3 is stored in a frame memory 7 after converting into picture data 6 on an A/D conversion circuit 5 by (n) frame quantity. A picture encoding circuit 8 encodes the picture data 6 of the (n) frame quantity in the memory 7 and forms the encoded data. A data transfer speed calculation circuit 10 calculates the average data quantity of the encoded date, outputs data transfer speed information 11 and stores in a buffer memory 12 together with the encoded data. These data are editted to a format for an optical disk by a mastering device 13, recorded in the master disk 14 of the optical disk and an optical disk 16 is produced by a press device 15.
•
19 Sep 1988TL;DR: In this article, a system for processing video signals to produce slow motion television pictures is described, where a sequence is produced of output frames at broadcast rate by combining a decreasing proportion of pixel values of a first frame (i) stored in a first-frame store with an increasing proportion of fixed valves of a second-frame (i+1) stored on a secondframe store.
Abstract: A system for processing video signals to produce slow motion television pictures is disclosed. A sequence is produced of output frames at broadcast rate by combining a decreasing proportion of pixel values of a first frame (i) stored in a first frame store with an increasing proportion of fixed valves of a second frame (i+1) stored in a second frame store. On completing a cycle the second frame (i+1) is treated as the first frame and a new second frame (i+2) is provided from a third frame store.
••
TL;DR: A three-parameter constant-gain recursive filter is augmented by a residual-dependent frame time algorithm that automatically increases sampling rates when a target maneuvers, showing that tracking performance is essentially independent of the particular target trajectory.
Abstract: A three-parameter constant-gain recursive filter is augmented by a residual-dependent frame time algorithm that automatically increases sampling rates when a target maneuvers. Computer simulations show that tracking performance is essentially independent of the particular target trajectory. It is found that radial distance errors remain effectively constant over different trajectories. It is the number of observations dictated by the adaptive frame time algorithm that is trajectory-dependent. The filter equations along with the frame time adjustment algorithm are first described, and a comparison made with a similar procedure. Examples given use the nonlinear observations generated by a passive sensor system. >
•
NEC1
TL;DR: In this paper, a frame interpolation process is used to convert an input television signal having a first frame number per second into an output television signal with a second frame number in accordance with an interpolation coefficient.
Abstract: In a television signal frame number converter for converting an input television signal having a first frame number per second into an output television signal having a second frame number per second in accordance with an interpolation coefficient, a processing unit (11) processes two successive frames on the input television signal by a frame interpolation process to produce a processed signal. A memory unit (12) memorizes the processed signal in synchronism with a write-in address signal (141) given by a first frame synchronizing signal (13) of the input television signal and is read out by a read-out address signal (171) given by a second frame synchronizing signal (16) of a reference television signal having the second frame number per second. The converter determines (15) the interpolation coefficient in accordance with a time interval between a write-in start timing of the memory unit and a read-out start timing of the memory unit.
•
30 Sep 1988
TL;DR: In this paper, an imitation frequency of less than one bit per frame was calculated for a predetermined frame alignment word (12 bits) for a time-division multiplex frame structure.
Abstract: For time-division multiplex frame structures previously used, an imitation frequency of less than one per frame can be calculated for a predetermined frame alignment word (12 bits). Assuming a frame structure which is built up with octets, an imitation frequency of greater than nine per frame is obtained for an 8-bit frame alignment word. It is the object of the invention to establish fast and reliable frame synchronisation for such frame structures having an imitation frequency of greater than one. For this purpose, all bit patterns which correspond to the frame alignment word are first determined in a search mode for the duration of one time frame, and an information item on their position in time is in each case stored. In a following comparison mode, it is determined for the duration of the next time frame, in each case at the times stored, whether a frame alignment word is again present. The respective yes/no result is evaluated for establishing frame synchronisation.
••
TL;DR: A system is described in which an uncompressed video signal is recorded on a disk and reproduced by a disk player that is connected to a high-definition television (HDTV) processor, which can generate a display command that adds false moving-picture effects to the reproduced image.
Abstract: A system is described in which an uncompressed video signal is recorded on a disk and reproduced by a disk player that is connected to a high-definition television (HDTV) processor. Although primarily intended for still picture reproduction, this system can generate a display command that adds false moving-picture effects to the reproduced image. Each still-picture frame consists of 1280*1024 active pixels. This system records the luminance signal Y and two color difference signals CW and CN as component codes. The sampling frequency is 49.68 MHz for signal Y, and 24.84 MHz for the color difference signals. These signals are quantized by 8-bit linear conversion. The reproducing system has frame memory capacity equivalent to 2048*2048 pixels, 3.2 times the quantity of data per frame. Each frame memory stores data that continues over two frames and also provides vertical frame scrolls. Since video data can be transmitted in both horizontal and vertical scanning directions, the picture can be switched from one frame to another, making a vertical or a horizontal wipe. The remaining video area of the frame memory can store split-screen data. >
•
30 Dec 1988
TL;DR: In this article, an adaptive method for coding and decoding a series of images by transformation is proposed, in which each image is divided into image element frames, each frame being represented by a frame of luminance values, and each frame corresponding to the corresponding color difference values.
Abstract: The invention relates to an adaptive method for coding and decoding a series of images by transformation, the coding comprising: dividing each image into image element frames, each frame being represented by a frame of luminance values, a frame of blue color difference values, and a frame of red color difference values; applying a bi-dimensional cosine transformation to each frame of values in order to obtain a frame of transformation coefficients; transmitting for each frame of values, either the value of the coefficients of transformation of the frame, or the value difference of these transformation coefficients, with respect to the value of the transformation coefficients of the homologous frame in the preceding image; multiplying the transformation coefficients and the differences of transformation coefficients, before the transmission, by a weighting coefficient favouring the low spatial frequencies and by a quantification coefficient, theses two coefficients being variable as a function of the filling of the buffer memory wherein are simultaneously stored coded data corresponding to the luminance values, to the blue color difference values and to the red color difference values. Application to the reduction of flow rate for the transmission of a series of television images.