Moving picture managing device

Abstract: In a moving picture managing device, a boundary sensor (4) senses the boundary between a cut of the input moving picture consisting of a plurality of frames and another cut on the basis of the difference in the number of blocks at the time of encoding the moving picture for a frame between the frame and an adjacent frame. Based on the boundaries sensed at the boundary sensor (4), the moving picture is filed in cuts. The moving picture is processed so as to be stored in a memory (3) in a tree structure fashion in which the moving picture is composed of scenes and a plurality of cuts, each scene consisting of cuts. The filing is managed in cuts under the tree structure.

Description: This invention relates to a moving picture managing device capable of performing the electronic input, display, storage, editing, and retrieval of moving pictures. With the recent spread of VTRs and video movies, moving pictures have been one of the most popular media. As more and more moving pictures are recorded to storage media such as videocassettes, it is increasingly difficult to manage them. At present, there is no choice but to inefficiently to retrieve stored moving pictures using the label of each cassette. Since videocassettes are basically sequential access media, to locate a desired scene in a videocassette for retrieval or editing, it is necessary to repeat the fast-forward and the fast-rewind transport while watching the tape counter until the desired portion is reached. Therefore, it is difficult not only to find out the necessary scene or cut, but also to edit tape in scenes or cuts. Furthermore, cut-by-cut filing is too heavy a burden for the user. GB-A-2 189 037 discloses a videotape editing system in which when a videotape is generated from a cinematographic film, a consecutive code on each frame of the film is detected by the video camera having a change detector. Discontinuities of the frame count are stored so as to obtain a listing of information regarding the edit points of the film. The document PATTERN RECOGNITION Vol. 17 No. 1 1984 Great Britain, pages 29-43; H,. Tamura et al: "Image database systems" discloses a tree-structure for storing data within an image database. It is, accordingly, an object of the present invention to overcome the disadvantages of difficulty in finding out the necessary scene or cut and editing tape in scenes or cuts and of forcing the user to do unreasonably troublesome cut-by-cut filing, by providing a moving picture managing device that manages moving pictures by storing them in a tree structure fashion in which a moving picture is composed of scenes and cuts, assures not only easy retrieval of necessary scenes and cuts but also easy editing on a scene or cut basis, and even provides automatic cut-by-cut filing to ease the user's burden. The foregoing object is accomplished by providing a moving picture managing device comprising the features of claim 1. With this arrangement, each cut boundary is sensed on the basis of the amount of change in the number of blocks at the time of encoding a moving picture for a frame between adjacent frames. Based on the sensed cut boundaries, the moving picture is divided into single-cut files, each cut consisting of a plurality of frames, and these single-cut files are stored in storage means. The stored single-cut files are read from the storage means for display. Seeing what is displayed on the screen, the operator is allowed to specify the partition of adjacent scenes, each consisting of a plurality of cuts. According to this invention, a moving picture is stored in the storage means in the form of a tree structure of scenes and cuts. With this method, moving pictures can be managed by storing them in the form of a tree structure of scenes and cuts, which provides easy retrieval of necessary scenes and cuts as well as easy editing on a scene or cut basis. Additionally, cut-by-cut filing can be performed automatically, thereby easing a burden on the user. This invention can be more fully understood from the following detailed description when taken in conjunction with the accompanying drawings, in which: Fig. 1 is a schematic block diagram showing the construction of a moving picture managing device according to the present invention; Fig. 2 shows a format of moving pictures to be processed by the moving picture managing device according to the present invention; Fig. 3 is a block diagram for the cut boundary sensing section of Fig. 1; Fig. 4 is a block diagram for the encoder of Fig. 3; Fig. 5 is a block diagram for the boundary sensor of Fig. 3; Fig. 6 is an explanatory view for the operation of the boundary sensor of Fig. 3; Fig. 7 is a block diagram for the video interface of Fig. 1; Fig. 8 illustrates how a moving picture is formed with respect to time; Fig. 9 is a tree structure diagram of the scenes and cuts constituting a moving picture; Fig. 10 shows the structure of a single-cut file; and Fig. 11 depicts a picture on the display in the moving picture managing device according to the present invention. An embodiment of the present invention will be described in detail, referring to the accompanying drawings. Figure 1 is a block diagram for a moving picture managing device according to the present invention. The moving picture managing device is composed of: a CPU 1 for performing various controls; a CRT display device 2 for displaying moving pictures and information on moving picture management; a memory 3 for storing the control program for the CPU 1, pictures to be displayed on the CRT display device 2, and others; a boundary sensing section 4 for receiving a series of moving pictures made up of a plurality of cuts and sensing cut boundaries; a magnetic disk device 11 for handling a magnetic disk (HD) 5 that stores a series of moving pictures or single-cut files consisting of a plurality of frames segmented at the boundary sensing section 4; a video interface 6 for receiving an NTSC (National Television System Committee) signal from a video camera 7, VTR 8, or the like and converting it into a format suitable for the present moving picture managing device; the video camera 7 or VRT 8 connected to the video interface 6; and a mouse (or a keyboard) serving as input means. Connected to a bus 9 are the CPU 1, memory 3, boundary sensing section 4, video interface 6, mouse 10, and magnetic disk device 11, of which the CPU 1 controls the other components. In place of the magnetic disk 5, other types of storage medium may be used. For example, an optical disk (OD) or a remote file by way of a network may be used. An example of a format of moving pictures used in the embodiment is shown in Fig. 2. A pixel is represented by density of 8 bits and chromaticity (I, Q) of 4 bits each and 640 × 512 pixels constitute a frame and 30 frames are processed in a second. The boundary sensing section 4 carries out operation in blocks that are obtained by dividing 640 × 512 pixels into blocks of 8 × 8 pixels. The boundary sensing section 4, as shown in Fig. 3, is composed of: an encoder 41 for encoding the input picture through the intraframe comparison of sensing the presence or absence of movements by comparing a frame with the previous frame in blocks or the interframe comparison of sensing the presence or absence of movements by comparing the adjacent frames in terms of the number of blocks encoded, which causes smaller errors; a boundary sensor 42 for sensing the cut boundaries of consecutive frames by using the intraframe flag/interframe flag supplied from the encoder 41; and a decoder 43 for decoding the encoded moving pictures. Moving picture information encoded at the encoder 41 is segmented into cuts at the boundaries sensed by the boundary sensor 42, and these cuts, with a cut as a file, are stored in the magnetic disk 5. The decoder 43 decodes a file stored in the magnetic disk 5 when it is displayed. The encoder 41, as shown in Fig. 4, is made up of an intraframe/interframe judging unit 411, an orthogonal transform unit 412, a quantization unit 413, an inverse quantization unit 414, an inverse orthogonal transform unit 415, a frame memory 416, a loop filter 417, an encoder 418, a subtracter 410, selector switches 408 and 409, and an adder 407. The intraframe/interframe judging unit 411 predicts for a frame the amount of change in the moving picture motion between the input block and the block undergone motion compensation using a retrieved motion vector and, when the prediction error is large, continues the prediction between the input block and the block already present in the frame. When the prediction error is large, then the selector switches 409 and 408 will be switched to the upper position to deliver the picture of the input block as it is to the orthogonal transform unit 412 via the selector switch 409. When the prediction error is small, then the selector switches 409 and 408 will be changed to the lower position, so that the block or blocks of the immediately preceding picture from the loop filter 417 is or are subtracted from the input block of a moving picture at the subtracter 410 and then the resulting picture is supplied to the orthogonal transform unit 412. The orthogonal transform unit 412 performs a two-dimensional orthogonal transform (DCT) on the picture sup plied from the selector switch 409. The quantization unit 413 quantizes the result of orthogonal transform at the orthogonal transform unit 412. The inverse quantization unit 414 carries out the inverse quantization in order to perform the motion compensation of the coefficient of 8 × 8 pixels after quantization by the quantization unit 413. The inverse orthogonal transform unit 415 decodes the data from the inverse quantization unit 414 by inverse orthogonal transform. The frame memory 416 stores the added picture (the immediately preceding picture) from the adder 407, the picture being obtained by adding the decoded data from the inverse orthogonal transform unit 415 to the picture supplied via the loop filter 417 and selector switch 408 from the frame memory 416 at the adder 407. The loop filter 417 is used to reduce quantization errors. The encoder 418 supplies codes according to the block specification by the intraframe/interframe judging unit 411, the quantization index for conversion coefficient and the instruction from the quantization unit 413, the motion vector from the frame memory 416, and the loop on/off instruction from the loop filter 417. With this configuration, the intraframe/interframe judging unit 411 predicts for a frame the amount of change in the moving picture motion between the input block and the intraframe block undergone motion compensation using a retrieved motion vector. When the prediction error is large, the selector switches 409 and 408 will be switched to the upper position, whereas when it is small, they will be switched to the lower position. Therefore, with a large prediction error, the picture of the input block is supplied as it is via the selector switch 409 to the orthogonal transform unit 412, which performs a two-dimensional orthogonal transform (DCT). Then, the orthogonally transformed data is quantized at the quantization unit 413 and is supplied to the encoder 418. The quantized data from the quantization unit 413 is decoded at the inverse quantization unit 414 and inverse orthogonal transform unit 415 and then is supplied to the adder 407. The adder 407 adds the decoded picture from the inverse orthogonal transform unit 415 to the immediately preceding picture from the frame memory 416 and the resulting picture updates the contents of the frame memory 416. The encoder 418 supplies codes according to the specification of blocks in the intraframe/interframe by the intraframe/interframe judging unit 411, the quantization index for conversion coefficient and the instruction from the quantization unit 413, the motion vector from the frame memory 416, and the loop filter on/off instruction from the loop filter 417. The way of dividing a moving picture composed of a series of frames into cuts will now be explained. Since there is a great similarity between continuous frames within a cut, interframe encoding has smaller prediction errors, requiring the decreased number of blocks to undergo intraframe encoding. Conversely, a correlation between the last frame of a cut and the first frame of the next cut is much less strong, so that intraframe encoding is more preferable, which locally increases the number of blocks undergone intraframe encoding. In this way, a series of moving pictures is segmented into individual cuts. The boundary sensor 42, as shown in Fig. 5, is made up of an adder 421, a comparator 422, FF circuits 423 through 426, and logic gates 427 through 434. The adder 421, which is initialized to zero by the frame end signal (or the frame start signal) from the CPU 1, checks each block to see if the flag from the encoder 41 is that of intraframe or interframe, and increases by 1 when it is an intraframe flag, while remaining unchanged when it is an interframe flag. The comparator 422 compares the number of blocks encoded for a frame with the threshold value previously given by the CPU 1 and when the number of blocks is larger, supplies a flag indicating that there was a change (or a presence-of-change flag). The FF circuits 423 through 426, which constitute a four-stage circuit and latch the presence-of-change flag from the comparator 422 with the timing of the frame end signal from the CPU 1, hold information on the presence or absence of changes in the last four frames. The logic gates 427 through 434 made up a logic circuit that determines that a cut boundary is sensed when the flags indicating the presence or absence of changes in five consecutive frames are in the order of <absence, presence, absence, *, * (* may be either presence or absence)> or <absence, presence, presence, absence, *> or <absence, presence, presence, presence, absence>. With this arrangement, the adder 421 is initialized to zero for each frame with the timing of the frame end signal from the CPU 1. When the flag sent from the encoder 41 for each block is that of an intraframe block, the adder 421 increases by 1 and supplies the result to the comparator 422. When the comparator 422 determines that the contents of addition from the adder 421, or the number of blocks encoded for a frame, is larger than the specified threshold value, it supplies a presence-of-change flag to the FF circuit 423. The FF circuits 423 through 426, with the timing of the frame end signal form the CPU 1, latch the presence-of-change flag in sequence to hold information on the presence or absence of changes in the last four frames. When the contents of the latched data in the FF circuits 423 through 426 are one of <absence, presence, absence, *, *>, <absence, presence, presence, absence, *>, and <absence, presence, presence, presence, absence>, logical operation by the logic gates 427 through 434 determines that a cut boundary has been sensed and the logic gate 428 produces a boundary flag. That is, this logic circuit determines the existence of a cut boundary when a presence of change continues over three consecutive three frames or less with the preceding and the following absence. An example of judgment is shown in Fig. 6. The number of frames are indicated on the abscissa axis and the number of blocks encoded for each frame on the ordinate axis. It is assumed that the number of blocks encoded has changed as shown in the figure. Because peak 1 has a portion higher than the threshold value for only one frame with the preceding and following frames remaining unchanged, the boundary sensor 42 of Fig. 5 judges that a boundary is sensed. As a result, the first frame to the frame immediately before peak 1 are segmented as cut 1 and stored as a file. Similarly, peak 2 is also judged for a boundary, so that the frames from peak 1 to just before peak 2 are segmented as cut 2. On the other hand, peak 3 has more than three consecutive frames with the presence of change, so that it is not judged to be a boundary. In this way, an object moving in front of the lens of the video camera 7 or a sudden, large movement of the video camera is not erroneously judged to be a cut boundary, which provides good segmentation. In the embodiment, a portion where an absence of change lasts for one or more frames, a presence of change for three or less consecutive frames, and an absence of change for one or more frames in that order is judged to be the boundary of peak 1. By modifying the FF circuit and logic gates of Fig. 5, it is also possible to make the same judgment when an absence of change lasts for Tf or more consecutive frames, a presence of change for Tw or more consecutive frames, and an absence of change for Ta or more consecutive frames in that order. Because the decoder 43 has the same construction as that of the encoder 41, the encoder 41 may be constructed so as to act as both encoder and decoder, in which case the decoder 43 is unnecessary. The video interface 6, as shown in Fig. 7, is composed of an A/D converter 61 and a format converter 62. The A/D converter 61 converts an NTSC signal from the video camera 7, VTR 8, or the like into a digital signal. The format converter 62 converts the digitized NTSC signal from the A/D converter 61 into the format shown in Fig. 2. The input signal may be of another type such as the high definition television type instead of the NTSC type. In this case, the format should be converted so as to be compatible with the resolution of the type used. Alternatively, the input signal may be converted into the format of the present embodiment beforehand at another system and supplied via a network or in the form of FD (floppy disk). The operation of the device thus constructed will now be explained. First, the entry of data from the video cassette in the video camera 7 or VTR 8 into the magnetic disk 5 is specified at the mouse 10 or keyboard. Frames of moving pictures are then supplied from the video camera 7 or VTR 8 via the video interface 6 and bus 9 to the boundary sensing section 4. The boundary sensing section 4 encodes the received moving pictures and at the same time, senses cut boundaries. After this processing, a cut consisting of a plurality of frames is stored as a file on a magnetic disk 5 in the magnetic disk device 11. In this case, as shown in Fig. 10, the magnetic disk 5 stores the name of a moving picture, cut number, cut length (in seconds), and moving-picture information consisting of a cut of encoded frames, the cut number being given serially in the cutting order. The operator specifies the reading of the picture entered in the magnetic disk 5 from the mouse 10 or keyboard. Then, the CPU 1 sequentially reads out only the first frame of each cut, under the corresponding name of a moving picture, and displays them on the CRT display device 2. Seeing what is displayed on the screen, the operator judges whether each cut has the proper end and specifies the end for a scene (a series of consecutive cuts united in terms of meaning and time). The CPU 1 assigns the scene number to each cut on the magnetic disk 5 and at the same time, replaces the cut numbers with the serial numbers of scenes. When the operator judges that the cuts have the wrong ends, the CPU 1 is caused to enter the preceding and following cuts on the magnetic disk 5 as one cut. Therefore, on the magnetic disk 5, the individual scenes and cuts for a series of moving pictures are constructed as shown in Figs. 8 and 9, and are entered in the form of a tree structure in which a plurality of scenes, each consisting of a plurality of cuts, constitute a series of moving pictures. As shown in Fig. 10, the parent cut, the daughter cuts, and the addresses of the parent cut and daughter cuts specified by the operator from the mouse 10 or keyboard are entered for each cut in the single-cut memory area of the magnetic disk 5. In the single-cut memory area of the magnetic disk 5, the pictures of the first frame and an intermediate frame are entered as the moving picture encoded for a representative frame. The picture for the representative frame is used during fast-forward transport. The CPU 1 may form a picture of a tree structure or a hierarchy structure (refer to Fig. 9) for a series of moving pictures and then enter it onto the magnetic disk 5, with the picture being associated with the cuts of the moving pictures. When the operator specifies an operation such as picture editing and the name of moving picture from the mouse 10 and keyboard, then a picture representing the tree structure or hierarchy structure corresponding to the name of moving picture will be read out of the magnetic disk 5 and, as shown in Fig. 11, be displayed in the window 21 of the CRT display device 2. What is displayed in the window 21 is a structure where a moving picture is classified into scenes and cuts, each being indicated by a particular icon. In this situation, when the operator specifies the regeneration of a particular icon from the mouse 10 or keyboard, another window 22 will be opened and the scene or cut indicated by the icon will be read from the magnetic disk 5 and displayed in the window 22. As noted above, the boundaries of cuts of the input moving picture are sensed on the basis of the amount of change between frames, and based on the sensed boundaries, the moving picture is divided into single-cut files, each consisting of a plurality of frames. Those single-cut files are stored in the magnetic disk. The picture for each stored single-cut file is read out of the magnetic file for display. Seeing the displayed picture, the operator specifies the end of a scene consisting of cuts from the mouse or keyboard. According to this specification, one moving picture is stored in the magnetic disk in the form of a hierarchy structure of scenes and cuts. In this way, it is possible to manage moving pictures by storing each moving picture in the magnetic disk in the form of a hierarchy structure of scenes and cuts, and easily find out the necessary scenes and cuts. In addition, a moving picture can be easily edited in scenes or cuts and even automatically segmented in cuts, which alleviates the user's burden.

Claims: A moving picture managing device comprising: input means (6) for inputting a moving picture, sensing means (4) for sensing the boundary between a cut of the input moving picture consisting of a plurality of frames and another cut, said sensing being carried out in accordance with an amount of change sensed by comparing a frame with the previous frame, said frames being encoded in blocks, and the number of blocks encoded in adjacent frames specifying the amount of change, storage means (5) for storing in cuts the moving picture sensed by said sensing means; output means (2) connected to said storage means (5) for supplying the moving picture in cuts read from said storage means (5); specifying means (10) for specifying the partition between a scene made up of a plurality of cuts of the moving picture supplied from said output means (2) and another scene; and processing means (1) for, according to the specification by said specifying means (10), storing one moving picture in a tree structure fashion in which the moving picture is composed of one scene and a plurality of cuts. The moving picture managing device according to claim 1, characterized in that said sensing means (4) determines that the boundary is sensed when for one side of adjacent frames consists of consecutive frames each of which has the number of encoded blocks less than a specified value and larger than a threshold value. The moving picture managing device according to claim 1, characterized in that said sensing means (4) contains encoding means (41) for receiving and encoding a moving picture and a boundary sensor (42) connected to said encoding means (41), which, receiving either an intraframe flag or an interframe flag from said encoding means (41), supplies a boundary sense flag depending on the presence or absence of a flag indicating a threshold value is exceeded.

Inventors: SAITO AKIRA, SAITO, AKIRA, Saito, Akira, c/o Intellectual Property Div.
Applicants: TOSHIBA KK, KABUSHIKI KAISHA TOSHIBA
Application year: 1991
Main classification: G11B27
IPC codes: G11B27, H04N5