JPH0660547A - System for recording/reproducing animation - Google Patents

Abstract

PURPOSE:To freely delete, insert and exchange data on a medium by recording animation data continuously or discontinuously on an idle block in a data block and recording chain relation in recorded blocks on a control block. CONSTITUTION:A logical unit called a scene is imparted to the animation data. The animation data of the unit called the scene is stored in data blocks B1-B566 formed by dividing a recording area in an optical disk device into plural pieces in each block unit. Further, control data showing the chain relation with other blocks is stored in a control block B0. The block B0 is divided into SAT 20 and directory 21 further. Further, the SAT 20 is divided into entries E1-E556 corresponding to the blocks B1-B556, and the directory 21 is divided into entries E0-E255, and a scene name and a leading block number are stored in the E1-E255, and a free list is controlled by the E0. Only a next block number is controlled in the SAT 20 of the free list.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a moving picture recording / reproducing system for a television or the like, and more particularly to a moving picture recording / reproducing system capable of deleting, inserting and replacing a moving picture in a designated section on a single medium. It is about.

[0002]

2. Description of the Related Art Conventionally, as a method of recording a moving image, a method of recording on a video tape, a laser disk or the like has been typically known.

In a video tape, data arranged in the direction from the beginning to the end of the tape are reproduced in that order. In the case of a laser disc, reproduction is also performed along a track extending from the inner circumference to the outer circumference of the disc. Techniques for sequentially reproducing spiral tracks starting from the inner circumference of the laser disc are described in, for example, supervision by Pioneer Corporation: Laser Disc Technical Book, ASCII Corporation, (198
6), pp. 101-104.

[0004]

However, in the above technique, the video tape is one in which moving pictures are recorded in a state in which the temporal order is maintained from the head to the end of the tape, and the moving pictures are reproduced in the order of recording. Therefore, when deleting a specified section, etc., prepare two playback devices and a recording device, dubb the necessary parts of the moving image in the intended order, and create the target moving image on another medium. There must be. Therefore, a reproducing device and a recording device are required at the same time, and it is not possible to obtain a moving image in which the designated section is deleted by only one of the devices.

On the other hand, a laser disk can be reproduced in a form in which the temporal order is changed or deleted by random access. However, if the data in the discontinuous area is reproduced, the reproduced image must be reproduced during the seek time. Breaks and becomes discontinuous.

As described above, it is premised that the conventional video recording media, such as video tapes and laser disks, record moving pictures in a state in which the temporal order is maintained and reproduce the moving pictures in the recording order. However, there is a problem in that the moving image is always interrupted when a portion that is discontinuous in time is reproduced. Further, there is a problem that an operation such as deleting a moving image in a designated section or replacing a certain section with a section having a different length requires at least two devices, which is impossible with a single device. .

An object of the present invention is to provide a moving picture recording / reproducing system capable of freely deleting or inserting designated sections and replacing sections having different lengths on one medium.

[0008]

To achieve the above object, the present invention divides a randomly accessible medium into a plurality of blocks each having a predetermined capacity unit, and at least one of these blocks is a management block and the rest are data blocks. In the data block, moving image data is recorded continuously or discontinuously in an empty block of the data blocks, and the chain relation of the recording blocks is recorded in the management block.

When reproducing the moving picture data recorded in the data block, the semiconductor buffer memory prereads the moving picture data of at least the seek time of the medium, and the semiconductor buffer memory prereads. The moving image data is reproduced continuously in time.

[0010]

According to the above means, the moving image data is sequentially recorded in the empty blocks of the data blocks, but at this time, the information of the chain relations thereof is recorded in the management block. Therefore, by referring to the information on the chain relation, it becomes possible to freely delete a specified section, insert it at a specified position, and replace sections of different lengths on one randomly accessible medium. .

Further, at the time of reproduction, the semiconductor buffer memory pre-reads the moving picture data of at least the seek time of the medium, and the pre-reading moving picture data is reproduced continuously in time in the semiconductor buffer memory. By doing so, continuous moving images can be obtained.

[0012]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings.

FIG. 1 is a block diagram of a moving picture recording / reproducing apparatus according to the present invention. A writable optical disk apparatus 10 and a data processing apparatus 1 for controlling each constituent apparatus.
1. A ring buffer memory 12 for inputting / outputting to / from the optical disk device 10, a D / A converter 13 for converting the digital data recorded in the ring buffer memory 12 into an analog signal, and combining a moving image signal and an audio signal. A / D converter 14 for converting the data into digital data, a switch unit 15 for operating the entire apparatus, a display device 16 for displaying a moving image, a speaker 17 for reproducing a sound, a video camera 18 for inputting a moving image, an input of the sound It is composed of a microphone 19 for operating.

Of these, the data processing unit 11 is the CPU 1
1A and memory 11B.

Optical disk device 10 used in this embodiment
Has specifications as shown in Table 1, for example.

[0016]

[Table 1]

In this embodiment, a logical unit called a scene is given to moving image data. This is a concept corresponding to music in music, and refers to a unit that should not be separated in time.

The moving image data in the unit of this scene is shown in FIG.
As shown in FIG. 5, the recording area of the optical disk device 10 is divided into a plurality of data blocks and stored in block units. At this time, management data indicating a chain relationship with other blocks is stored in the management block at the head of the block.

That is, the optical disk device 10 is set to 512k.
Divide into blocks of byte units, and number from 0. Among them, the block B0 having the block number "0" is a management block, and the other data blocks B1 to B
566 is a data block for recording the moving image data itself.

The management block B0 further includes SAT (Se
an Allocation Table) 20 and a directory 21.

As shown in the figure, the SAT 20 is divided into 566 entries E1 to E566 each consisting of 4 bytes, each of which corresponds to a data block B1 to B566.

The directory 21 is further divided into 256 entries E0 to E255, of which the entry E1
The scene name and the head block number are stored in E255. Further, the entry E0 manages a list (free list) of unused data blocks.

Although a scene is composed of data blocks as a minimum unit, the physical block positions on the disk of one scene are not always continuous. Therefore, the next block number 201 and p in SAT20
The rioor block number 202 manages the order in which these blocks are connected to form one scene.

Here, the next block number 201 indicates what number block the next block is, and pri
The or block number 202 indicates the immediately preceding block number.

The in-block data length 203 controls how many bytes of moving image data are stored in each of the blocks B1 to B566.

Here, when the next block number (22-bit configuration) of the SAT 20 is 3FFFFFH, it indicates that the corresponding block is the last block of one scene. In addition, each block B1 to B5
66 is controlled so that the data filling rate is 50% or more.

FIG. 3 shows an example of storing one scene of a moving image. In this example, the scene name is "Omiya visiting". The moving picture data starts from block 002 (data length = 390 Kbytes), is connected to 003 (data length = 450 Kbytes) and 004 (data length = 500 Kbytes), and 008 is the final block (next). Block number = 3
FFFFFH).

In this case, the prio of the first block 002
The r block number indicates the number of the final block 008.

Unused empty blocks 005,
006 and 007 are logically linked by the SAT 20 like one scene, and are managed as a free list in the head area E1 of the directory 21.

When a new block is needed for adding a scene, it is removed from the free list and used. Blocks that are no longer needed are linked back to the free list. Naturally, in the initial state of the optical disk device 10, all blocks are linked to the free list.

In the free list SAT20, next
Only block numbers are managed, not prior block numbers.

The SAT 20 and the directory 21 are read into the memory 11B of the data processing unit 11 when the system is started up, and when an update occurs, for example, one update is performed 10 times.
The data is written back to the optical disk device 10 at a rate of once. From Table 1, the time required for this write back is 512 Kbytes /
(7.4 Mbit / sec) = 540 msec.

This value will be used later in the ring buffer memory 12
It is used when calculating the required capacity of.

In this way, moving image data is stored in a plurality of data blocks in units of scenes while maintaining a chain relationship, so that deletion of an arbitrary section, insertion at an arbitrary position, insertion of each scene, It can be easily deleted or replaced. The detailed algorithm will be described later.

Next, a mechanism for continuously reproducing the moving picture data stored discontinuously as described above will be described.

In principle, even if the reading from the optical disk device 10 is interrupted due to the seek of the head, if continuous data is passed to the D / A converter 13, it can be reproduced as a temporally continuous moving image. You can However, when the data blocks are discontinuous, since there is a seek time, the moving image is temporarily interrupted. Therefore, in order to solve this, the ring buffer memory 12 is used.

As shown in FIG. 4, the ring buffer memory 12 is divided into 0th to nth blocks, and the moving image data read from the optical disk device 10 is sequentially stored from the 0th block and read. Similarly, the blocks are numbered sequentially from the 0th block.

In this way, by utilizing the ring buffer memory 12 in the clockwise direction in FIG. 4, it is possible to perform prefetching until the write block to the buffer memory 12 catches up with the read block.

In the example of FIG. 4, blocks 4 to 7 are pre-read moving image data.

On the contrary, this mechanism is also used when recording a moving image. That is, the moving image signal and the audio signal from the video camera 18 are input to the A / D converter 14 and the encoded signal is once written in the ring buffer memory 12 and then written in the optical disc device 10. At this time, a point different from that at the time of reproduction is that the management block B0 having the SAT 20 and the directory 21 must be written back. At the time of reproduction, the SAT 20 in the memory 11B is referred to and only the data block in the optical disk device 10 is traced. Therefore, the ring buffer memory 12 for one seek is sufficient. However, at the time of recording, the management block must be written back in addition to tracing the data block. Therefore, the capacity of the ring buffer memory 12 is determined by the restrictions at the time of recording.

Assuming that one second of moving picture data corresponds to one block, for example, the maximum time required to write it is 210 msec (maximum access time) +540 m.
sec (writing time for one block) = 750 msec
And a minimum of 250 ms per second (1 block)
If there is ec margin and the management block B0 is not written, the ring buffer memory 12 is not necessary.

However, since it takes 750 msec to write back the management block B0 as well as the data block,
The above margin of 3 seconds (block) is required. Therefore,
The minimum capacity of the required ring buffer memory 12 is 3 blocks, which is 512 Kbytes × 3 blocks = 1536 Kbytes.

The operation of this embodiment will be described below with reference to the flow chart. The management of the ring buffer memory 12 operates independently of these flowcharts, and a description thereof will be omitted.

FIG. 5 is a flow chart showing the processing procedure when a new scene is inserted between scenes that have already been recorded, next to the last scene, or at the beginning (including a new medium).

First, an existing scene or the beginning or the end is designated, a position for newly inserting a scene is designated, and a scene name is input from the switch section 15 (step 501). Next, one free data block is removed from the free list of the directory 21 (step 502).

Next, the entries E1 to E of the directory 21
The entry behind the scene insertion position in 255 is shifted by one (step 503), and the new scene name and the data block number obtained in step 502 are registered as the start block number at that position (step 50).
4).

Next, the moving picture data encoded by the A / D converter 14 is recorded (step 505), and if the recording is completed (step 506), to what extent of the last block the moving picture data is stored in the SAT 20. Is recorded and the process ends (step 507).

If recording is not completed, the process loops through step 508 until one block is filled. Step 5
When one block becomes full in 08, one free data block is removed from the free list again (step 50).
9), make a chain of SAT20 (Step 51
0), and returns to step 505.

FIG. 6 is a flow chart showing a processing procedure for deleting a designated scene.

In the case of deleting, first, in step 601, the scene to be deleted is designated from the switch section 15, and in step 6
In 02, the leading block number of the relevant scene is extracted from the directory 21, and the entry is marked with a deletion mark.

Next, the SAT 20 is traced to obtain the final block number of the block string forming the scene to be deleted (step 603). Then, the corresponding SA of the block number
The next block number of T20 is set as the top block number of the current free list (step 604). next,
The start block number of the free list in the directory 21 is set as the start block number of the scene (step 60).
5).

That is, the block sequence of the scene to be deleted is put in the beginning of the free list as it is.

As a result, the designated scene is deleted.

FIG. 7 is a flow chart showing a processing procedure for changing the order of two designated scenes. First,
Two scenes to be exchanged are designated by the switch unit 15 in step 701, and the positions of the corresponding entries in the respective directories 21 are exchanged in step 702.

As a result, the order of the two designated scenes is exchanged.

FIG. 8 is a flowchart showing a processing procedure for inserting a moving image at a specified position in a scene.

In this case, first, in step 801, the insertion position is designated from the switch unit 15, and in step 802, moving image data after the insertion position of the block having the insertion position is stored in the work area of the memory 11B. Hereinafter, this data is referred to as data A.

Next, the moving picture data is recorded from the designated insertion position by the unit of coding (step 803).

Next, if recording is not completed in step 804, it is judged in step 808 whether the current recording position is the end of the block. If it is the end, one free data block is removed from the free list ( Step 80
9), make a chain of SAT20 of the current recorded scene.

If it is determined in step 808 that the recording position is not the end of the block, the next step in the block is step 80.
If a new block is secured in 9, the moving image data is recorded from the beginning of the new block by the unit of coding (step 811).

If the recording is completed in step 804,
It is determined whether the data A saved in step 802 can be stored in the last block into which the data has been inserted (step 805). If the data can be stored, the data A is stored there (step 812).

Next, the filling rate of the block is checked, and it is 50
If it is less than%, the video data is
And the filling rate of all blocks is 50% or more.

However, when the data A does not enter the last block in step 805, the empty data block is removed from the free list, the data including the last insertion block and the data A is divided into two, and the new data is added to the last block. The data is stored in the block secured in step 806 (step 806). Finally, a chain of SATs 20 of new data blocks is created and the process is terminated (step 807).

As a result, a new moving image is inserted at the designated position in the scene.

FIG. 9 is a flowchart showing a processing procedure for deleting a designated section in a scene.

In this case, first, in step 901, the switch section 15 designates the start point and the end point of the deletion section. If the start point and end point are within the same block (step 90)
2) The data after the end point in the block is shifted to the start point (step 912). As a result of the deletion, when the filling rate of the block is less than 50% and there is another block related to the same scene, the moving image data of the block adjacent to the deleted block is combined into one or two blocks (step 914). .

However, when the filling rate of the block is 50% or more and the start point and the end point are different blocks, the data after the end point of the block having the end point is shifted to the beginning of the block (step 903).

Next, if there is a block other than the block having the start point and the block having the end point in the section to be deleted (step 904), these blocks are connected to the free list as free blocks (step 905), and the start point is set. Corresponding SATs of blocks with
20 chains are connected, and it progresses to step 907.

If the deletion section is only two blocks, the block having the start point and the block having the end point, the processes of steps 905 and 906 are not performed and the process proceeds to step 907.

In step 907, it is checked whether the filling rate of one or both of the blocks having the start point or the end point is less than 50%. If the filling rate is less than 50%, step 908 in FIG. Proceed to.

In step 908, the process branches depending on the sum of the data amounts of the block having the end point and the block having the start point.

That is, when the sum of the data of both blocks is larger than one block, the data is moved from the block having a large amount of data to the block having a small amount of data and the filling rate of both is 5
After making it 0% or more, the process proceeds to step 911.

On the other hand, if the sum of the data of both blocks is larger than 0.5 block and less than 1 block, the data is moved from the block having the end point to the block having the start point (step 909).

If the sum of the data of both blocks is less than 0.5 block and there is no block other than both blocks (step 916), the process proceeds to step 911. However, in the case of less than 0.5 blocks, if there is a block other than both blocks, the data of the block adjacent to the block having the start point or the end point and the data of both blocks are combined into one or two blocks (step 917), 910
Proceed to to connect free blocks to the free list.

Finally, in step 911, the data length of the corresponding SAT entry of the block in which the data has moved is corrected and the process ends.

As a result, the designated section in the scene is deleted.

FIG. 11 is a flow chart showing the procedure for reproducing a moving image.

In the present embodiment, two kinds of methods of reproducing the scenes from the beginning or sequentially from the designated scene will be described, but various reproduction methods such as random reproduction and reverse reproduction are also used as necessary. Can be adopted. Also,
Although it is described in this flowchart that the entire scene cannot be ended without being reproduced, the operation can be stopped at any time (even in the middle of the scene) by operating the switch unit 15.

For reproduction, first, the switch section 15 is used to input whether reproduction from the beginning or a scene to start reproduction is specified, and in the latter case, that scene is also specified (step 1).
001).

When reproducing from the beginning, the directory 2
If it is the entry 1 (E1) of 1 and the scene name, the number of the corresponding directory 21 is obtained (step 1002).

Next, the leading block number is obtained from the entry of the corresponding directory 21 (step 1003), and the SAT 20 is traced from there to reproduce one scene. The above operation is repeated while the entries remain in the directory 21, and the scenes are sequentially reproduced (step 1004).
~ 1006).

As a result, the moving image from the designated scene is reproduced and displayed on the display.

[0083]

As described above, according to the present invention, a randomly accessible medium is divided into a plurality of blocks each having a predetermined capacity unit, at least one of which is a management block and the rest are data blocks. , The moving image data is continuously or discontinuously recorded in an empty block of the data blocks, and the chain relation of the recording blocks is recorded in the management block. When reproducing the moving image data, a semiconductor is used. Since the buffer memory pre-reads the moving picture data at least before the seek time of the medium, and the pre-read moving picture data is reproduced continuously in time in the semiconductor buffer memory, the information on the chain relationship is stored. By referring, you can delete a specified section, insert it at a specified position, or replace sections with different lengths on one randomly accessible medium. It is possible to carry out the reason.

[Brief description of drawings]

FIG. 1 is a block diagram showing an embodiment of a moving picture recording / reproducing apparatus according to the present invention.

FIG. 2 is a diagram showing a data management structure on the optical disc of the present embodiment.

FIG. 3 is a diagram showing a specific example of managing one scene in the data management of this embodiment.

FIG. 4 is a configuration diagram of a ring buffer memory of this embodiment.

FIG. 5 is a flowchart showing a processing procedure of scene insertion according to the present embodiment.

FIG. 6 is a flowchart showing a scene deletion processing procedure according to the present embodiment.

FIG. 7 is a flowchart showing a processing procedure for scene replacement according to the present embodiment.

FIG. 8 is a flowchart showing a processing procedure for inserting a moving image into a designated position in the present embodiment.

FIG. 9 is a flowchart showing a processing procedure for deleting a designated section of a moving image according to the present embodiment.

FIG. 10 is a flowchart showing a sequel to FIG. 9;

FIG. 11 is a flowchart showing a processing procedure of moving image reproduction according to the present embodiment.

[Explanation of symbols]

10 ... Optical disk device, 11 ... Data processing device, 11A
... CPU, 11B ... Memory, 12 ... Ring buffer memory, 13 ... D / A converter, 14 ... A / D converter, 15 ...
Switch part, 16 ... Display, 17 ... Speaker, 1
8 ... Video camera, 19 ... Microphone.

Claims (2)

[Claims] 1. A moving image data recorded on a randomly accessible medium.
A recording method for recording data, in which the medium is divided into a plurality of blocks each having a predetermined capacity unit, at least one of these blocks is a management block, and the rest are data blocks. A moving picture recording / reproducing system characterized in that moving picture data is recorded continuously or discontinuously in the recording medium, and the chain relation of the recording blocks is recorded in the management block. 2. When reproducing the moving picture data recorded in the data block, the semiconductor buffer memory pre-reads the moving picture data of at least the seek time of the medium, and the pre-reading moving picture data in the semiconductor buffer memory. 2. The moving picture recording / reproducing system according to claim 1, wherein the data is reproduced continuously in time.