JP2006164344A - Information editing device, imaging apparatus and information editing method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To efficiently perform a variety of editing such as partial deletion about a file without performing complicated processing such as for rearranging data as much as possible and to use the file after editing without inconvenience. <P>SOLUTION: When the editing is performed for the file recorded in a hard disk 33 in which a detailed information management table (such as directory) about the file and a storage area management table (such as a FAT) about the file are provided, a control part 20 adds information indicating about a mode of the editing and how processing should be performed for the data about a predetermined area unit to be a reading unit, etc. as data about the storage area management table corresponding to the area unit including an editing target position and detailed information about the file which should exist on a recording medium is properly held in the detailed information management table after the editing. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention, for example, a device for editing data recorded as a file on a random-accessible recording medium such as a hard disk, and records image data of a subject obtained by imaging on a random-accessible recording medium. The present invention relates to devices and methods used when editing data in these devices.

  Various recording media such as a hard disk, an MO (Magneto Optical Disk), a PD (Phase changer rewritable disk), a zip, and a SuperDisk are provided as recording media capable of large capacity and random access. These recording media are used, for example, as recording media for personal computers and personal digital assistants. In recent years, the size and weight of the recording media have increased, and digital video cameras, digital still cameras, and the like have been carried around and used. It is also used as a recording medium for information equipment.

  And when moving images and audio are recorded on a recording medium using a digital video camera, or when a large number of still images are shot and recorded on a recording medium using a digital still camera, files are recorded after recording. In many cases, so-called editing processing is performed in which division or combination is performed.

  For example, when shooting a video of a children's athletic meet, only the appearance scene of their child's appearance is edited and left, or a lot of photos (still images) taken with a digital still camera at a travel destination It may be possible to classify items by location, date, or member in the photo.

  Conventionally, when such editing processing of image data and audio data is performed, a space area for moving or copying data to be edited is required on the recording medium, although temporarily. . When there is not enough free space, it is necessary to use another recording medium together, or to organize data recorded on a recording medium with insufficient capacity. In addition, when performing editing processing such as dividing, combining, and copying files, file management for editing processing is troublesome, making editing work difficult for an unfamiliar user (user).

  For this reason, in Patent Document 1 shown below, management data (reference information) for managing each file is hierarchically provided so that files are divided, combined, copied, and the like. As described above, there has been proposed a technique that allows the same data to be referred from a plurality of files without physically moving the data.

  In other words, the technique described in Patent Document 1 manages each file formed on a recording medium as a master file, and allows a user to manage at least a part of data in each master file. And the data of each master file is recognized through this shared file.

  Therefore, by using the technique described in Patent Document 1, a part of data of a target file can be used as data of one file via logically formed reference information (file It is also relatively easy to use a plurality of target file data as one file data (combine files). Be made possible.

As described above, the technique described in Patent Document 1 performs logical editing of a file so that each file recorded on the recording medium is edited non-destructively without any modification. This makes it possible to perform complex editing in a relatively short time without performing troublesome operations and editing.
JP 2000-090645 A

  By the way, in the case of the technique described in the above-mentioned patent document 1, it is logically formed so that the same data can be referred from a plurality of files without dividing, combining and copying the files. Data will be handled via reference information. For this reason, it is considered that it may take time to handle the file recorded on the recording medium in the same manner by other devices.

  For example, considering the use of a digital video camera or a digital still camera, a usage form in which a file after shooting (and after editing) is taken out to an external device such as a personal computer can be considered. At that time, in order to be able to use the technology described in Patent Document 1 also in the external device that is the takeout destination, it is necessary to take out all of the reference data + the actual data that is referred to (a plurality of). In this case, it is necessary to take out all the data that is not actually used, and software for using the file via the reference information is also required.

  For this reason, with respect to files that are logically divided or combined by the technique described in Patent Document 1, when they are taken out to the outside, they are written as a single file. Processing such as creating a real file consisting of data and taking it out to an external device is required. Further, when forming an actual file made up of target data, the recording medium needs to have enough free space to form the actual file.

  In addition to file division and combination, it is necessary to be able to easily delete a part of a file and delete a part of the file. This file part deletion is performed when the head part or tail part of the file is to be deleted, or when the middle part of the file is to be deleted.

  Therefore, it is desired to provide an editing method that can efficiently perform various editing on a file without performing complicated processing, and can use the edited file without any inconvenience.

  In view of the above, the present invention enables various editing such as partial deletion of a file efficiently without performing complicated processing such as rearranging data as much as possible. It is an object of the present invention to provide an apparatus and a method that can be used without inconvenience.

In order to solve the above-described problem, an information editing apparatus according to claim 1 is provided.
Randomly accessible recording medium provided with a detailed information management table for managing detailed information of individual files and a storage area management table for managing the use state of the storage area of each file for each predetermined unit area An information editing device that uses
Receiving means for receiving a partial deletion editing instruction input for deleting a part of a file recorded on the recording medium;
An addition that adds information related to an editing mode as information of the predetermined area unit in the storage area management table corresponding to the editing target position of the target file based on the received partial deletion editing instruction input Means,
Updating means for updating the information in the detailed information management table based on the received edit instruction input.

  The information editing apparatus according to the first aspect of the present invention is a detailed information management table for managing detailed information of individual files called directories and folders, for example, which is a randomly accessible recording medium such as a hard disk. And a file recorded on a recording medium provided with a storage area management table for managing a storage area use state for each file as a chain of a predetermined area unit such as FAT (File Allocation Table). The file can be partially deleted and edited in accordance with an instruction from the user who has received the means.

  In this case, for the data in the storage area management table corresponding to the area unit including the editing position, the editing mode, that is, the data in the predetermined area unit corresponding to the editing corresponding position for performing the instructed editing. Information indicating whether or not to be processed is added by the adding means. In addition, after the partial deletion editing process, the updating unit updates the detailed information about the file that should exist on the recording medium so that the detailed information is appropriately held in the detailed information management table.

  Thereby, partial deletion editing of a file on the recording medium is realized by editing chain information of a predetermined unit area in the storage area management table and editing data of the detailed information management table of the target file. That is, non-destructive editing of a file without relocation of data by the information in the two management tables for the storage area management table and the detailed information management table, which are necessary for file management even in normal times ( File logical editing).

An information editing apparatus according to the invention described in claim 2
Randomly accessible recording medium provided with a detailed information management table for managing detailed information of individual files and a storage area management table for managing the use state of the storage area of each file for each predetermined unit area An information editing device that uses
Receiving means for receiving an edit instruction input for a file recorded on the recording medium;
Determining means for determining whether or not the editing instruction input received through the receiving means is for instructing combined editing or hollow editing;
When it is determined by the determination means that the edit instruction input is an instruction for combined editing or hollow editing, based on the information on the recording medium, between the data areas at positions separated after editing A calculating means for calculating the distance;
When the distance calculated by the calculating means is smaller than a prescribed value, based on the received editing instruction input, the predetermined area unit in the storage area management table corresponding to the editing target position of the target file Adding means for adding information relating to the editing mode as information of
And updating means for updating information in the detailed information management table based on the received edit instruction input when the distance calculated by the calculating means is smaller than a prescribed value.

  According to the information editing apparatus of the second aspect of the present invention, for example, a recording medium capable of random access such as a hard disk, for example, detailed information for managing detailed information of individual files called directories and folders For a file recorded on a recording medium provided with a management table and a storage area management table for managing a use state of a storage area for each file such as FAT (File Allocation Table) as a chain of predetermined area units The file can be partially deleted and edited in accordance with an instruction from the user who has received it through the receiving means.

  Then, when it is determined by the determination means that the instruction input received through the reception means is an instruction to perform file combination editing or hollow editing, the calculation means performs combined editing or hollow editing. When this is done, the distance between the two files to be combined, or the distance between the data areas to be divided is calculated.

  If the distance calculated by the calculating means is smaller than the predetermined value, it is determined that it does not take time to seek the read head. In this case, the data in the storage area management table corresponding to the area unit including the editing position is used. On the other hand, information indicating the mode of editing, that is, how to process data in a predetermined area unit corresponding to the editing corresponding position in order to perform the instructed editing is added by the adding means. . In addition, after the partial deletion editing process, the updating unit updates the detailed information about the file that should exist on the recording medium so that the detailed information is appropriately held in the detailed information management table.

  Thus, only when editing is possible so that the edited file can be used without any problem, the partial deletion editing of the file on the recording medium is performed by editing the chain information of a predetermined unit area in the storage area management table and This is realized by editing the data in the detailed information management table of the file. In other cases, the edited file can be used without any problems by editing using the conventional editing method that rearranges the data. To be done.

  According to the first invention, a storage area management table such as FAT for managing editing processing for a file recorded on a random-accessible recording medium as a chain of file storage areas as a predetermined unit area; By using a detailed information management table called a directory or folder for managing detailed information, file editing without data relocation can be realized.

  In addition, it is not necessary to secure a free area for file relocation, and the recording medium can be effectively used. In addition, since the file partial deletion editing process is not performed by the file rearrangement process, the number of access to the recording medium (recording medium drive frequency) related to the file partial deletion editing process can be reduced. The processing time required for the editing process can be shortened and the power consumption can be reduced.

  In addition, since the file is edited using the detailed information management table and the storage area management table for the file used for using the file recorded on the recording medium, the edited file is stored in, for example, a personal computer. In the case of moving to an external device such as an external device, only the edited file can be moved as a normal file, and the reference information as in the technique described in Patent Document 1 described above can be used. Therefore, there is no need for auxiliary information such as the above, so that it is not necessary to take any complicated considerations when using it in an external device.

  Further, according to the second invention, only when the file can be edited so that it can be used without any trouble, the editing process without data rearrangement can be performed. Therefore, it is possible not only to improve the efficiency of the editing process but also to edit the file by the most suitable method in consideration of the state of the edited file.

  Hereinafter, an embodiment of an apparatus and a method according to the present invention will be described with reference to the drawings. In the embodiments described below, an imaging device that can use a removable hard disk as a recording medium and a memory card formed using a semiconductor memory, still image data, moving image data, audio A digital video camera (camera-integrated video tape recorder) that can record information signals such as data on a recording medium and can reproduce still image data, moving image data, and audio data recorded on the recording medium A case where this is applied to will be described as an example.

[Configuration and basic operation of digital video camera]
First, the digital video camera of this embodiment will be described. FIG. 1 is a block diagram for explaining a digital video camera according to this embodiment. The digital video camera according to this embodiment captures an image and records an image data obtained by capturing the image on a recording medium, and the image input / output unit 16, the audio input / output unit 17, or the communication unit 19. It has a VTR mode in which supplied data is recorded on a recording medium and data recorded on the recording medium is reproduced.

  In addition, the imaging mode includes a moving image imaging mode in which a moving image is imaged and a sound that is picked up at the same time is recorded on a recording medium, and a still image imaging mode in which a still image is imaged. In the VTR mode, the supplied data is recorded by operating the record button switch, and the target data recorded on the recording medium is reproduced by operating the playback button switch. Is something that can be done.

  As shown in FIG. 1, the digital video camera of this embodiment includes an optical lens unit 11, a photoelectric conversion unit 12, a camera function control unit 13, an image signal processing unit 14, an LCD (Liquid Crystal Display) 15, an image input / output. 16, an audio input / output unit 17, an audio signal processing unit 18, a communication unit 19, a control unit 20, an operation input unit 31, a hard disk drive (hard disk device) 32, and a memory card 34.

  The control unit 20 controls each unit of the digital video camera according to the present embodiment, and includes a CPU (Central Processing Unit) 21, a ROM (Read Only Memory) 22, a RAM (Random Access Memory) 23, an EEPROM (Electrical Erasable). and Programmable ROM) 24 are connected through a system bus 25 to form a microcomputer.

  Here, the ROM 22 is prerecorded with various processing programs executed by the CPU 21 of the digital video camera, information used for various processing, and the like. The RAM 23 is mainly used as a work area, such as temporarily storing intermediate results in each process. The EEPROM 24 is a so-called nonvolatile memory, and stores and holds data that needs to be held even when the power of the digital video camera is turned off, such as various setting parameters.

  The operation input unit 31 also has a mode switching key for switching operation modes such as a moving image shooting mode, a still image shooting mode, and a VTR mode, a shutter key for shooting a still image, a shooting start key for shooting a movie, a recording Various operation keys and function keys such as a key, a playback key, a stop key, a fast-forward key, and a fast-rewind key are provided. The controller 20 receives an operation input from the user and sends an electric signal corresponding to the received operation input to the control unit 20. It can be supplied.

  Accordingly, the control unit 20 reads out and executes a program for performing a target process from the ROM 22 in accordance with an operation input from the user, and controls each unit, so that the digital video camera of this embodiment can be operated by the user. The processing according to the instruction from can be performed.

  The digital video camera of this embodiment can use the hard disk drive 32 and the memory card 34 as recording media. The hard disk drive 32 is configured to be detachable from the digital video camera, and writes data to the built-in hard disk 33 or reads data from the built-in hard disk 33 under the control of the control unit 20. It is something that can be done.

  The hard disk drive 32 used here employs a ZCAV (Zone Constant Angular Velocity) method as a rotation control method. In the ZCAV method, the recording surface of the disk medium is divided into concentric zones (regions composed of a plurality of sectors), and the number of sectors forming the zones is increased toward the outer periphery, and data writing / reading is performed. By increasing the data transfer speed, the data recording density can be kept high even at the outer periphery.

  Therefore, in the ZCAV method, although the data transfer rate of writing / reading (hereinafter referred to as the transfer rate) is different for each zone, the rotational speed of the disk medium is constant, so as in CLV (Constant Linear Velocity), When accessing, the so-called seek operation that positions the read / write head of the hard disk drive at the desired position on the hard disk does not take time, and as described above, high-density recording of data is also achieved. Is something that can be done.

  Further, in the hard disk drive 32, a file allocation table (FAT) system is used as a file system in order to manage files formed on the hard disk 33, and the recording area of the hard disk 33 is divided into a plurality of partitions. Each partition can be treated like an independent drive. Details of the FAT are described in detail in, for example, “Microsoft Extensible Firmware Initiative FAT32 File System Specification”.

  The memory card 34 is also detachable from the digital video camera, and writes data to the built-in semiconductor memory or reads data from the built-in semiconductor memory according to the control of the control unit 20. It is something that can be done.

  Therefore, the digital video camera of this embodiment has a slot for attaching / detaching the hard disk drive 32 and the memory card 34 so that the hard disk drive 32 and / or the memory card 34 can be easily attached / detached. The hard disk drive and memory card can be used properly.

  The hard disk drive 32 can record moving image data and audio data, and the memory card 34 can record still image data. It is also possible to select whether the data recording destination is the hard disk drive 32 or the memory card 34.

  In this embodiment, ATA / ATAPI (AT Attachment / Advanced Technology Attachment Packet Interface) is used as an interface between the digital video camera body and the hard disk drive 32. Details of ATA / ATAPI are disclosed through, for example, the American Standards Association Web page (http://www.t13.org/).

  There are various types of ATA / ATAPI, and in recent years, ATA / ATAPI-6 has been provided. In this ATA / ATAPI-6, the correspondence area that can be expressed by LBA (Logical Block Address) is expanded from 28-bit space to 48-bit space, and it can also cope with a large-capacity hard disk whose LBA exceeds 28 bits. Is.

  In this embodiment, for example, an existing ATA / ATAPI such as ATA / ATAPI-6 is used, but the usable interface is not limited to this. For example, a successor interface of an existing interface such as ATA / ATAPI-7 or other various interfaces can be used.

  When a predetermined operation key of the operation input unit 31 is operated, the digital video camera is set to the moving image shooting mode, and a shooting start key for shooting a moving image is operated, or the still image shooting mode is set. When a shutter key for shooting a still image is operated, the camera function control unit 13 operates each of the optical lens unit 11 and the photoelectric conversion unit 12 according to control from the control unit 20. Drive signals and timing signals to be generated are formed and supplied to the optical lens unit 11 and the photoelectric conversion unit 12 to operate the optical lens unit 11 and the photoelectric conversion unit 12.

  The optical lens unit 11 includes a lens, a focus mechanism, a diaphragm mechanism, a shutter mechanism, a zoom mechanism, and the like, and controls the focus mechanism, the diaphragm mechanism, the shutter mechanism, and the zoom mechanism in accordance with a drive signal from the camera function control unit 13. Then, an image of a target subject is taken in and formed on a predetermined portion of the photoelectric conversion unit 12.

  The photoelectric conversion unit 12 includes a CCD (Charge Coupled Device), a preprocessing circuit, and the like. The photoelectric conversion unit 12 converts an image of a subject captured by the optical lens unit 11 into an electrical signal (image signal) by the CCD, and obtains it. The pre-processing necessary for the pre-processing circuit of the photoelectric conversion unit 12 is performed on the obtained image signal.

  In the pre-processing circuit of the photoelectric conversion unit 12, for example, CDS (Correlated Double Sampling) processing is performed to maintain a good S / N ratio, and AGC (Automatic Gain Control) processing is performed to increase the gain. Processes such as control. Then, the image signal that has been subjected to the predetermined preprocessing is A / D (Analog / Digital) converted and supplied to the image signal processing unit 14.

  The image signal processing unit 14 is configured as a DSP (Digital Signal Processor), and performs AF (Auto Focus), image data from the photoelectric conversion unit 12 in accordance with control from the control unit 20. Camera signal processing such as AE (Auto Exposure) and AWB (Auto White Balance) is performed.

  Then, an analog image signal to be supplied to the LCD 15 is formed from the image data after the camera signal processing, and this is supplied to the LCD 15 so that the image of the subject can be confirmed through the LCD 15. In the case of the digital video camera of this embodiment, simultaneously, an analog image signal from the image signal processing unit 14 is supplied to an external device such as another recording / playback device or a monitor receiver through the image input / output unit 16. You can also do it.

  Then, the image signal processing unit 14 compresses the image data on which the camera signal processing has been performed with a predetermined compression method, and records the compressed data on the hard disk 33 of the hard disk drive 32 through the control unit 20. In this way, the photographed subject image can be recorded on the hard disk 33 of the hard disk drive 32.

  In the digital video camera of this embodiment, at the time of shooting a movie, the shooting start key is operated again, and the subject images are sequentially captured as described above until a movie shooting stop instruction is given. It is recorded on the hard disk 33 as moving image data. When the shutter key is operated, when the shutter key is operated, the image formed on the photoelectric conversion unit 12 is captured as a still image and recorded as still image data on the hard disk.

  At the time of shooting a moving image, an audio signal obtained by picking up sound through a microphone (not shown) and converting it into an electric signal is converted into a digital signal, and this is compressed with a predetermined compression method, together with the moving image data. Recording on the hard disk 33 of the hard disk drive 32 is also possible.

  The digital video camera of this embodiment includes an audio input / output unit 17. For this reason, together with the analog image signal output through the image input / output unit 16, as described above, the audio signal captured at the time of shooting is output through the audio signal processing unit 18 and the audio input terminal 17, and other recording / playback devices. It can also be supplied to speaker devices. In this case, the audio signal processing unit 18 performs D / A conversion processing, compression / decompression processing of audio data compressed by a predetermined compression method, and the like.

  In the digital video camera of this embodiment, the information is supplied from an external device such as a video tape recorder, and is received through the audio input / output unit 17 and the analog image signal received through the image input / output unit 16. An analog audio signal can be recorded on the hard disk 33 of the hard disk drive 32.

  That is, when an external device is connected to the image input / output unit 16 and the audio input / output unit 17, a predetermined operation key of the operation input unit 31 is operated, and this digital video camera is in the VTR mode. When an analog image signal and an analog audio signal are supplied from the external device and the recording key of the operation input unit 31 is operated, the analog received through the image input / output unit 16 and the audio input / output unit 17 Record image signals and analog audio signals.

  In this case, the analog image signal received through the image input / output unit 16 is supplied to the image signal processing unit 14, where it is A / D converted and data compressed by a predetermined compression method, and then the control unit 20. To be recorded on the hard disk 33 of the hard disk drive 32.

  The analog audio signal received through the audio input / output unit 17 is supplied to the audio signal processing unit 18, where it is A / D converted and data-compressed by a predetermined compression method, and then through the control unit 20. Recording is possible on the hard disk 33 of the hard disk drive 32. In this way, analog image signals and analog audio signals supplied from external devices can be recorded on the hard disk of the hard disk drive 32.

  In this case, the supplied analog image signal is also supplied to the LCD 15 via the image signal processing unit 14, and an image based on the supplied analog image signal can be displayed on the display screen of the LCD 15 and viewed. . Also, the supplied analog audio signal is supplied to a speaker (not shown) provided in the digital video camera of this embodiment, and sound corresponding to the analog audio signal supplied from the speaker is emitted, and this is output. You will be able to listen.

  Similarly, in the digital video camera of this embodiment, moving image data, still image data, audio data such as music, and other various data received through the communication unit 19 can be recorded on the hard disk 33 of the hard disk drive 32. I am doing so. The communication unit 19 transmits / receives data through a wired interface such as Ethernet (registered trademark) or USB (Universal Serial Bus), or performs IEEE (Institute of Electrical and Electronics Engineers) 802.11a / b / g, Data is transmitted and received through a wireless interface such as BlueTooth.

  Therefore, when the communication unit 19 is connected to the network, a predetermined operation key of the operation input unit 31 is operated, and the digital video camera is in the VTR mode. When the recording key 31 is operated, the digital signal supplied through the communication unit 19 can be recorded on the hard disk 33 of the hard disk drive 32.

  Since image data and audio data supplied as digital data through the network are often already compressed, the digital data acquired through the communication unit 19 is recorded on the hard disk 33 of the hard disk drive 32 through the control unit 20. Will be.

  In this case, the supplied digital image signal is supplied to, for example, the image signal processing unit 14, where it is compressed and decompressed, converted into an analog video signal, and then supplied to the LCD 15. The corresponding image is displayed on the display screen of the LCD 15 so that it can be viewed.

  The supplied digital audio signal is, for example, compressed and decompressed by the audio signal processing unit 18 and converted into an analog audio signal, and then supplied to a speaker (not shown) provided in the digital video camera of this embodiment. Thus, sound corresponding to the analog sound signal is emitted from the speaker and can be heard.

  In addition, the digital data recorded in the digital video camera of this embodiment, such as the hard disk 33, can be supplied to an external device connected to the network through the communication unit 19.

  Note that when an external device is connected to the image input / output unit 16 and the audio input / output unit 17 and is also connected to a network through the communication unit 19, which input / output terminal is instructed by a user instruction, for example. Whether to input or output information through the unit can be switched.

  Next, as described above, the operation at the time of reproducing image data and audio data recorded on the hard disk 33 of the hard disk drive 32 will be described. When the instruction for reproducing the target image data and audio data is input after the VTR mode is set through the operation input unit 31, the control unit 20 receives the target image data and audio data from the hard disk 33 of the hard disk drive 32. read out. The read image data is supplied to the image signal processing unit 14, and the read audio data is supplied to the audio signal processing unit 18.

  The image signal processing unit 14 performs compression / decompression processing on the image data supplied through the control unit 20 in accordance with the compression method used at the time of data compression, restores the image data before the data compression, and performs D / A conversion. Thus, an analog image signal is formed and supplied to the LCD 15 and the image input / output unit 16.

  Also, the audio signal processing unit 18 performs compression / decompression processing on the audio data supplied through the control unit 20 in accordance with the compression method used for the data compression characters, restores the audio data before data compression, The analog audio signal is formed by A / A conversion, and this is supplied to the audio input / output unit 17 or a speaker provided in the digital video camera.

  In this way, the image data and audio data recorded on the hard disk 33 of the hard disk drive 32 can be reproduced and used. Further, as described above, the analog image signal and analog audio signal to be reproduced can be output to the external device connected thereto through the image input / output unit 16 and the audio input / output unit 17. In addition, digital data recorded in the hard disk 33 or the like can be output to the outside through the communication unit 19.

  As described above, the digital video camera of this embodiment can also use the memory card 34. For example, when an instruction to shoot a still image is given through the operation input unit 31, the optical video camera The still image data captured through the lens unit 11 and the photoelectric conversion unit 12 is subjected to the above-described various adjustment processes in the image signal processing unit 14 and then compressed, and this is recorded in the memory card 34 through the control unit 20. Is done.

  In addition, by designating the recording destination through the operation input unit 31 and specifying either the hard disk drive 32 or the memory card 34, still image data can be recorded in the hard disk drive 32 or moving image data. And audio data can be recorded on a memory card.

[About editing files]
As described above, the digital video camera according to this embodiment has still image data and moving image data obtained by taking an image through a camera unit including the optical lens unit 11 and the photoelectric conversion unit 12, or the image input / output unit 16. Still image data and moving image data supplied from an external device through the communication unit 19, and still image data and moving image data supplied through the communication unit 19 can be recorded as files on the hard disk 33 or the memory card 34. is there.

  Similarly, with respect to audio data obtained by collecting sound with a microphone (not shown), audio data supplied from an external device through the audio input / output unit 17, and audio data supplied through the communication unit 19, the hard disk 33 is also used. And can be recorded as a file on the memory card 34.

  In addition to these still image data, moving image data, and audio data, for example, program data, text data, and the like can be recorded as files on the hard disk 33 or the memory card 34. As described above, the digital video camera according to this embodiment can record various data having different attributes (types) as files on a recording medium.

  Then, there is a case where it is desired to edit the file recorded on the recording medium. For example, the captured moving image data can be divided so that only the target scene can be handled as a separate file, or multiple image data files can be combined and handled as a single file. If you want to.

  The digital video camera of this embodiment can edit a file recorded on a recording medium in response to an instruction input from a user received through the operation input unit 31. In this case, the digital video camera of this embodiment basically does not form new reference information for editing or the like, and physically records already recorded data in another storage area. Various editing can be performed by using information provided for file management on the recording medium without relocation processing of data to be moved.

  That is, in the digital video camera according to this embodiment, unnecessary data is deleted from the data already recorded on the recording medium, and the recording area in which the deleted data is recorded is released. The data is recorded as a file, which is created by logical editing and repairing, without moving to another recording area or copying and re-recording the data. The data can be edited in a non-destructive manner without any rearrangement processing.

  In the following, description will be given by taking as an example the case of editing various files recorded on the hard disk 33 of the hard disk drive 32.

[About hard disk drive 32 and hard disk 33]
First, before describing in detail the editing of a file recorded on the hard disk 33 in the digital video camera of this embodiment, a large capacity and random access capable of recording various data are possible. The hard disk 33 that is a recording medium will be described.

  As described above, the hard disk drive 32 of this embodiment uses the FAT system as the file system, and the hard disk 33 is initialized according to the FAT system.

  FIG. 2 is a diagram for explaining a state of the hard disk 33 that can be used by being initialized in accordance with the FAT system. The FAT system includes FAT16, FAT32, etc. FIG. 2 shows an area structure in the case of FAT16 in which data for managing files is 16 bits.

  As shown in FIG. 2, the first sector (LBA = 0 sector) of the hard disk is provided with an MBR (Master Boot Record), which is a system startup area, as will be described in detail later. Next to the MBR, a preliminary free area is provided, and next to the free area, a partition area is provided.

  As shown in FIG. 2, a BPB (BIOS Parameter Block), a free area, FAT1, FAT2 which is a spare FAT, and a directory area are provided in the partition area. It becomes a data area where data is actually recorded in cluster units. As shown in FIG. 2, the directory area is provided immediately before the first cluster in the data area and is formed for each file formed in the data area, and manages detailed information of each file. The root directory entry to be stored is stored.

  In FIG. 2, only one partition area is shown. As will be described later, a plurality of MBR partition tables are prepared according to the number of partition areas to be formed. Partition areas are formed so that each can be treated as an independent individual disk (storage area).

  Next, a plurality of partition areas that can be formed on the hard disk 33 will be described. 3 and 4 are diagrams for explaining a partition area formed on the hard disk 33 and a partition table for managing the partition area. As shown in FIG. 2 and FIG. 3, the MBR provided in the first sector (LBA = 0 sector) of the hard disk 33 includes an activation code area 331 and a partition table area 332.

  At the time of activation, first, an activation code (program) is read from the activation code area 331 of the MBR. As shown in FIG. 3, the read activation code of the MBR refers to the partition table of the partition table area 332 formed immediately after the activation code, reads the information of the boot sector of the target partition, An OS (Operating System) is activated by the code (program) of the boot sector.

  A plurality of (for example, four) partition tables can be provided. As described above, each partition table holds information indicating the position (start address) and size (partition size) of each partition area formed by dividing the recording area of the hard disk 33. In FIG. As shown in Fig. 5, the target partition area can be accessed and the information recorded therein can be referred to.

  Next, the partition table formed in the MBR of the head sector will be specifically described. As described above and as shown in FIG. 4A, the MBR of the head sector of the hard disk 33 (an area of 512 bytes from the head of the hard disk 33) includes an activation code area 331 and a partition table area 332.

  In this embodiment, the partition table area 332 is an area having a size capable of storing a partition table having a data length of 16 bytes for four entries, that is, an area for 64 bytes. However, a partition table for four entries is not always formed, and at least one and a maximum of four can be formed according to the number of partitions provided.

  The 2 bytes following the partition table area 332 are signatures (magic numbers) attached to the partition table, and unless it is “55h” and “AAh” in order, it is determined that the partition table does not exist or has been destroyed. Will be. In this specification and drawings, the letter h immediately after the character string represented by a numeral, an alphabet from A to F, and a combination thereof, such as “55h” and “AAh” described above, This indicates that the character string is expressed in hexadecimal.

  The data structure of the partition table having a data length of 16 bytes (128 bits) is as shown in FIG. 4B. The 8-byte area from the 0th byte to the 7th byte is a storage area for information used when the address is specified by the CHS method, and the 8-byte area from the 8th byte to the 15th byte is the LBA method. This is an information storage area used when specifying an address.

  Here, the CHS method is to specify an address (position) on the hard disk 33 by using three parameters of a cylinder, a head, and a sector as one set. In the LBA method, numbers (block addresses (logical addresses)) are assigned in order from, for example, 0 to each accessible unit block (for example, one sector unit) on the recording area of the hard disk. By designating, an address (position) on the recording area of the hard disk is designated.

  As shown in FIG. 4B, the storage area for information used when accessing by the CHS method is the 0th byte storage area for active flag information (hereinafter simply referred to as flag information), the 1st byte to the 3rd byte. Storage area of start sector information used when 3 bytes up to 3 bytes are accessed by CHS method, 4th byte is storage area for partition type information (hereinafter simply referred to as type information), 5th byte to 7th byte A storage area of end sector information used when 3 bytes are accessed by the CHS method.

  Also, as shown in FIG. 4B, the information storage area used when accessing by the LBA method is the storage area of the start sector information in which 4 bytes from the 8th byte to the 11th byte are used by the LBA method, 12 bytes The 4 bytes from the first to the 15th byte are a partition size storage area used in the LBA method.

  The CHS method uses the physical structure of the hard disk as it is, and as described above, there are three parameters for addressing: cylinder, head, and sector. It becomes complicated. On the other hand, in the case of the LBA method, since it is designated by a single parameter called a block address, the address designation at the time of access is very simple.

  For this reason, the LBA method has become the mainstream addressing method for hard disks, and the LBA method is also used for other recording media such as various memory cards that have come to be widely used as so-called removable media. More and more addresses can be specified. The hard disk used in the digital video camera of this embodiment also uses the LBA method for addressing.

  In the hard disk drive 32 of this embodiment, an EBR (Extended Boot Record) can also be used. The MBR is for a basic area that always exists in one system, whereas the EBR is for an extended area that is secured in addition to the basic area.

  This EBR is also formed in the same manner as the MBR described above with reference to FIG. 4A, and includes an activation code area and a partition table area, and the data structure of each partition formed in the partition table area is also shown in FIG. 4B. It is configured similarly to the MBR partition table described above. This EBR does not necessarily exist, and is provided according to a partition creation policy by the system or user.

  Thus, in the digital video camera of this embodiment, a plurality of partition areas are formed on the hard disk 33 so that each partition area can be used as an independent storage area.

[About directory and FAT]
As described above, in the digital video camera of this embodiment, the hard disk 33 can be divided into a plurality of partition areas, and each partition area can be handled as an independent recording medium. Various files formed in each partition area are managed by information on the directory area and FAT formed in the partition area, and can be used by the user.

  In the digital video camera of this embodiment, the file formed on the hard disk is managed, and the file is edited by using each of the directory and FAT that are required when the user intends to use the file. I have to. In the following, after describing each of the directory and the FAT, file editing using the FAT and the directory will be described.

[About Directory]
FIG. 5 is a diagram for explaining the information structure of the directory entry formed for each file, which is information stored in the directory area provided in each partition as shown in FIG. The directory entry shown in FIG. 5 is information formed in a directory area in accordance with a formed file when a file is formed in a partition, and manages detailed information of the formed file. is there. That is, the directory entry is a detailed information management table for managing detailed information of individual files in this embodiment.

  As shown in FIG. 5, the directory entry of each file includes a name (file name) column, an extended name column, an attribute column, a reservation column, a creation time column, a creation date column, a last access date column, a first cluster number, Instruction information (High) field, recording time field, recording date field, head cluster number instruction information (Low) field, file size field, each corresponding information, ie, file name, extended name, attribute, creation time, The creation date, last access date, top cluster number (High), recording time, recording date, top cluster number (Low), and file size are managed.

  By using this directory entry information, the file specified by the file name is (1) what attribute it is, (2) where the start (start) cluster is, and (3) how big it is (4) When created, (5) When last accessed, (6) When data was recorded, etc. can be managed.

  Here, the start (first) cluster number is information for specifying a storage area in cluster units of the data area of the partition where the recording of the data of the file is started. In other words, the start cluster number indicates from which storage area of each storage area obtained by dividing the data area of the partition into cluster units, the data of the file is recorded. In the case of this example, as shown in FIG. 5, the head cluster number is managed by dividing it into 2 bytes on the upper side (high side) and 2 bytes on the lower side (low side). ing.

  The cluster means a minimum recording unit per file in which a plurality of sectors are collected. Since the sector, which is the minimum unit of the hard disk, is too small as a unit for managing files, file management is facilitated by using a unit area called a cluster in which a plurality of sectors are collected. The specific size of the cluster is, for example, 32 kilobytes for FAT16 and 4 kilobytes for FAT32. In this specification, the storage area itself divided into cluster units may be called a cluster.

[About FAT]
6 and 7 are diagrams for explaining the FAT used in the hard disk 33 of the digital video camera according to this embodiment. In this embodiment, the FAT has a function as a storage area management table for managing the use state of storage areas of individual files in units of clusters, as will be described below. The 8-digit numbers in FIGS. 6 and 7 and the 2-digit numbers in FIG. 7A are expressed in hexadecimal.

  As described with reference to FIG. 2, each partition area formed on the hard disk 33 is provided with a FAT. When this FAT is destroyed, the record information of the file can no longer be used, so troubles are prevented by preparing a plurality of FATs.

  Also in this embodiment, as shown in FIG. 2, two FATs, FAT1 and FAT2, are prepared in each partition area. These have exactly the same contents, and when FAT1 is destroyed, information on FAT2 is used to prevent data from becoming unavailable. That is, FAT2 is provided as a spare for FAT1.

  Each of FAT1 and FAT2 includes a plurality of storage areas (FAT entry areas) for storing cluster numbers and the like, as shown in FIGS. 6 (A) and 6 (B). In FIG. 6, it can be indicated by the FAT entry number indicated in hexadecimal. The FAT entry number corresponds to the cluster in the partition in which FAT1 and FAT2 are provided on a one-to-one basis.

  The storage area of the FAT1 and FAT2 cluster numbers and the like is a 4-byte (32-bit) area. The storage area of each file provided in the partition to which the FAT1 and FAT2 belong is mainly a storage area in cluster units. A cluster number or the like (FAT entry) for designating as a chain (connection) is stored.

  Further, when the cluster number is not stored in the storage area of the FAT1 and FAT2 cluster numbers, for example, a reserved cluster, an unused cluster, a defective cluster, a final cluster of a file (End Of File cluster), etc. Information indicating the state of the cluster is stored. Note that the storage areas indicated by the FAT entry numbers “00000000h” and “00000001h” are used for predetermined purposes.

  The example shown in FIG. 6 is a case where one file is formed in the entire data area of the partition. As shown in the storage example of FIG. 6C, the cluster numbers of FAT1 and FAT2 are used. In this example, cluster numbers that are incremented one by one from “00000002h” are sequentially stored in the order indicated by the FAT entry number.

  As can be seen from FIG. 6, the cluster numbers stored in the storage areas such as the cluster numbers of FAT1 and FAT2 are in one-to-one correspondence with the cluster unit area constituting the data area, as shown in FIG. It is made to correspond to. Therefore, by tracing the cluster (area in cluster units of the data area) indicated by the FAT1 or FAT2 cluster number, it is possible to accurately refer to the entire data from the beginning to the end of the file formed in the data area. Etc., so that the data of the entire file can be handled.

  FIG. 7 is a diagram for explaining an example of FAT provided in a partition in which a plurality of files are formed. FIG. 7A shows the state of the FAT entry stored in each FAT entry area in the FAT, and FIG. It is a figure for demonstrating the state of the chain of the cluster which comprises each file. Note that the example shown in FIG. 7 shows an example in which four files are formed in a predetermined partition.

  As described above, the start (first) cluster number of a file can be known from the directory entry information of the file, as described with reference to FIG. In FIG. 7A, it is assumed that the FAT entry indicated by diagonal lines is the first cluster of each file, and is specified by the start cluster number of the directory entry of each file.

  That is, in the example shown in FIG. 7, the start cluster of the first file is a cluster with the cluster number “00000007h”, and the start cluster of the second file is a cluster with the cluster number “0000000000Ah”. The start cluster of the third file is a cluster with the cluster number “0000001Bh”, and the start cluster of the fourth file is a cluster with the cluster number “0000002Ch”.

  Then, with respect to the first file, when the chain of clusters is followed on the FAT of FIG. 7A from the start cluster “00000007h” of the file, as shown in the first file column of FIG. 7B, “00000007h” → The cluster can be followed as “00000008h” → “00000009h”, and it can be seen that the “00000009h” -th cluster is the final cluster of the first file.

  That is, by reading data from the “00000007h” -th cluster to the “00000009h” -th cluster in the storage area of the partition in which the first file is formed, all the data in the first file is read. It can be read and used.

  Similarly, regarding the second file, if the cluster chain is traced from the start cluster “0000000Ah” of the file on the FAT of FIG. 7A, the cluster chain as shown in the second file column of FIG. 7B. Can be followed. In the case of the second file, data is recorded in a storage area including a skipped cluster, such as “0000000Ah” → “0000001Fh” → “00000025h” → The “00000030h” -th cluster is This is the final cluster of the second file.

  Further, regarding the third file, when the cluster chain is followed from the start cluster “0000001Bh” of the file on the FAT of FIG. 7A, the cluster chain is changed as shown in the third file column of FIG. 7B. Can be chased. In the case of the third file, the start cluster and the final cluster are skipped clusters, but the cluster between them can secure a continuous cluster, and the data area is secured relatively efficiently. Yes.

  For the fourth file, if the cluster chain is followed from the start cluster “0000002Ch” of the file on the FAT of FIG. 7A, the cluster chain is changed as shown in the fourth file column of FIG. 7B. Can be chased. In the case of the fourth file, clusters are not continuous in some parts, but almost continuous clusters are secured as data areas.

  Thus, when using the data of the target file, the start cluster number is specified by the directory entry of the file, and the chain of clusters managed by the FAT is determined based on the specified start cluster number. By tracing, it becomes possible to use all of the data of the target file.

[About logical editing of files using FAT and directories]
In the digital video camera of this embodiment, by editing the directory entry and FAT1 and FAT2 information, it is possible to perform editing (so-called non-destructive editing) on the target file. ing. Specifically, as described below, by performing each editing process such as cluster concatenation, division, partial deletion, and hollowing out on the FAT, the necessary data is moved to a file consisting only of the necessary data. You can edit the file without copying or copying. File editing includes file division, file combination, partial deletion of data in the file, deletion of data at the beginning and tail of the file, deletion of data in the middle of the file (so-called hollow deletion) and Various modes of editing can be performed by combining these.

  In the case of file division, since there are at least two files, a directory entry for a new file is formed and necessary information such as the file size of the directory entry of the original file is formed. Need to be changed.

  In the case of file combination, at least two or more files become one file, so an unnecessary directory entry is generated and any of the files combined with the combined directory entry is generated. If a directory entry is used, the starting cluster number and file size of the directory entry are changed.

  The partial deletion of the file does not generate a newly formed file or a file that disappears, but changes the start position and end position of the area in which necessary data is recorded, the file size, and the like.

  Furthermore, in the digital video camera of this embodiment, as described above, by moving the data of the already recorded file, the files themselves are not physically divided or combined. In other words, so-called non-destructive editing is performed to logically edit. For this reason, a data “skip” process is required in the cluster of the divided part of the file, the cluster of the joined part of the file or the cluster of the deleted part of the file.

  For example, the data “skip skip” process is described in the case where the file 1 and the file 2 are combined. After the process of connecting the final cluster of the file 1 and the start cluster of the file 2 is performed, the final process of the file 1 is performed. This is a process for skipping over invalid data existing in the cluster.

  Further, when the file 1 is divided into two files 2a and 2b, a collection of data before the position at the target position of the target cluster of the file 1 is set as the file 2a, and the file 1 After the process of setting the later data set as the file 2b, the file 2a needs to skip unnecessary data (the data of the part that became the file 2b) in the cluster that became the final cluster. Also, in the file 2b, it is necessary to skip the unnecessary data (data that has become the file 2a) on the head side in the cluster that has become the start cluster.

  In the case of partial deletion of a file, if the data at the beginning of the file is deleted, it becomes necessary to skip the unnecessary data part in the start cluster after deletion, and the data at the tail part of the file is deleted. When deleted, it becomes necessary to skip unnecessary data in the final cluster after deletion. In addition, in the case of omitting a file, it may be necessary to skip unnecessary data in the cluster at the beginning and the tail of the deleted data.

  Therefore, in the digital video camera of this embodiment, when performing logical editing (non-destructive editing) of a file, the details of the file after editing are managed by a directory entry. Information indicating the mode of editing to FAT1 and FAT2 is updated, and data can be skipped by this information.

  Specifically, as described below, information indicating the data skipping mode is added to the FAT1 data (FAT entry) corresponding to the cluster in which skipping occurs, and the cluster in which skipping occurs is added. Information indicating the start or end position of skipping of the cluster is added to the corresponding FAT2 data (FAT entry).

  Then, by appropriately skipping data based on the information added to FAT1 and FAT2, the edited file can be used properly and the edited file can be used. Output to an external device or the like can be easily performed.

  In this embodiment, the information indicating the mode of skipping added to FAT1 and the information indicating the start or end position of skipping added to FAT2 are information regarding the mode of editing.

Examples of the “skip” of data include the following.
(1) Data reading from the beginning of the target cluster to the target position of the target cluster is skipped.
(2) Data reading is skipped from the target position of the target cluster to the end of the target cluster.
(3) When the target cluster is the start cluster, data is skipped from the beginning of the target cluster to the target position of the target cluster. When the target cluster is the final cluster, the target cluster The data is skipped from the target position to the end of the target cluster.
These are the basic skipping modes.

  For example, (1) is an aspect of skipping data performed in the start cluster of the file on the back side when the file is divided, and (2) is in the cluster of the joined portion when the files are joined. This is a mode of data skipping performed. In (3), for example, when a file is divided, the final cluster of the front file and the start cluster of the rear file are the same cluster. This is an aspect of skipping used when it is possible to cope with skipping.

  Also, in the case of partial deletion of a file, if the data at the beginning of the file is deleted, the start cluster after deletion will be skipped in the mode (1) described above, and the file When the data of the tail portion is deleted, the skip is performed in the above-described mode (2) in the end cluster after the deletion.

  In addition, in the case where a file is omitted, it may be necessary to skip in the mode (2) described above in the cluster at the beginning of the deleted data. In a cluster, it may be necessary to skip reading in the above-described mode (2). Further, in the case of hollowing out, it may be necessary to skip reading from a predetermined position, which is a deleted data portion, to a predetermined position in a cluster including the deleted data.

  As will be described later, when the file is divided, the data skipping process for the last cluster of the front file is performed by a rounding process in the cluster calculated from the file size and the cluster size that are normally performed. Since it is possible to cope with this, it is not necessary to perform the data skip processing in the mode shown in (3). However, when skipping data in the manner shown in (3), it is possible to give a skip instruction to any of the divided files.

  In the digital video camera of this embodiment, the reading skip mode of (1) described above is “1h”, the skipping mode of (2) is “2h”, and the skipping mode of (3) is It is expressed as information of about 4 bits, such as “3h”, and this is added to the FAT1 FAT entry corresponding to the cluster where skipping occurs, and information indicating the start or end of skipping is skipped. Are added to the FAT2 FAT entry corresponding to the cluster in which.

  In this way, by updating the directory entry and adding information indicating the mode of editing to FAT1 and FAT2, logical editing can be performed without copying or moving the file itself to be edited. However, it enables non-destructive editing.

[Specific examples of file merging and file splitting]
Next, in the digital video camera of this embodiment, a specific example will be shown with respect to file combination processing (combined editing processing) and file division processing (divided editing processing) performed on files recorded on the hard disk 33. explain. FIG. 8 to FIG. 11 are diagrams for explaining an example of a logical editing process of a file performed in the digital video camera of this embodiment. 8 and 9 are diagrams for explaining the file combining process, and FIGS. 10 and 11 are diagrams for explaining the file dividing process. In FIG. 8 to FIG. 11, the 8-digit number is expressed in hexadecimal.

[Specific examples of combining files]
First, file combination processing will be described with reference to FIGS. FIG. 8 is for explaining the file before the joining process, and FIG. 9 is for explaining the file after the joining process. As shown in FIG. 8A, a case where file 1 and file 2 are combined is taken as an example. In this example, as shown in FIG. 8A, the description will be made assuming that the size of one cluster (cluster size) is 32 KB (kilobytes).

  In this example, from the directory entry information of file 1 and file 2, as shown in FIG. 8B, the start cluster number of file 1 is 00001008h, the file size is 100KB, the start cluster number of file 2 is 00022001h, The size is 150KB. In this embodiment, as described above, since the cluster size is 32 KB, as shown in FIG. 8A, the file 1 is composed of four clusters, and the file 2 is composed of five clusters. Yes.

  Then, if each chain of file 1 and file 2 is traced in FAT1, starting from each start cluster of file 1 and file 2 as grasped from the directory entry information, as shown in FIG. 1 can be traced, and file 2 can be traced. In this case, the final cluster (End OF File) of the file 1 is 0000100Bh, and the final cluster (End OF File) of the file 2 is 00022005h.

  When the file 1 and the file 2 formed on the hard disk 33 are combined as described with reference to FIG. 8 and the combined file is a new file 1 as shown in FIG. The last cluster of file 1 and the starting cluster of original file 2 are connected. In this case, as shown in FIG. 9B, the start cluster number is not changed in the directory entry of the new file 1, but the file size is changed from 100 KB to 250 KB. Further, since the directory entry of the file 2 becomes unnecessary, it is deleted from the directory.

  Further, as shown in FIG. 9C, information indicating a skipping state is added to the FAT1 FAT entry corresponding to the cluster that needs to be skipped among the clusters in the combined portion of the original file 1 and file 2. Append. In this example, as shown in FIG. 9A, the final cluster of the original file 1 is joined (linked) with the start cluster of the original file 2, so the final cluster of the original file 1 (0000100Bh) Is added to the most significant byte of the FAT1 FAT entry corresponding to.

  In the case of this example, the information “2h” indicating that “(2) data is skipped from the target position of the target cluster to the end of the target cluster” described above is shown in FIG. 9C. Thus, it is added to the most significant byte of the entry of FAT1 corresponding to the cluster (0000100Bh). Accordingly, by confirming the FAT entry of FAT1, it becomes possible to indicate what kind of data skipping is necessary in which cluster.

  Even if you know the cluster that needs to skip data and the mode of skipping, if you cannot clearly indicate where to skip data in that cluster, only the unnecessary data is read appropriately. I can't fly. Therefore, information indicating the start or end position of skipping that is determined according to the skipping mode is added to the FAT2 FAT entry corresponding to the cluster where skipping of data occurs.

  In the example of the file combination shown in FIGS. 8 and 9, the file size of the original file 1 is 100 KB, and one cluster is 32 KB. Therefore, in the “0000100Bh” -th cluster that is the final cluster, Only the data for 4 KB from the head is recorded, and the data necessary for the data of file 1 does not exist in the storage area after 4 KB of the cluster. Therefore, in this example, as shown in FIG. 9D, the value “1000h” indicating 4 KB is used as information indicating the start position X2 of skipping, and the FAT2 FAT entry corresponding to the cluster “0000100Bh” is used. Record in the lower 2 bytes.

  As a result, in this example, the FAT entry of FAT1 indicates in what cluster it is necessary to skip what kind of data, and the FAT entry of FAT2 corresponding to the cluster (this join processing) In this case, the lower 2 bytes of data of the FAT entry) indicate where and how much data should actually be skipped, and in accordance with this, it is possible to perform appropriate skip skipping of data. Is done.

  In this way, by updating the directory entry, adding data indicating the mode of skipping to FAT1, and adding data indicating how much data is skipped to FAT2, the data is recorded on the hard disk 33. The new file 1 can be formed by combining the existing file 1 and file 2 without moving or copying them.

[Specific example of file division]
Next, file division processing will be described with reference to FIGS. FIG. 10 is for explaining the file before the division processing, and FIG. 11 is for explaining the file after the division processing. Here, as shown in FIGS. 10A and 10B, the file 2 having the file size of 150 KB formed on the hard disk 33 is divided at the position indicated by the arrow, and the file 2a having the file size of 100 KB and the file having the file size of 50 KB are divided. The case of dividing into 2b is taken as an example. In this example as well, the cluster size is 32 KB.

  In this example, it is assumed that the start cluster number is known to be 00022001h from the directory entry information of file 2. In this case, in FAT1, if the chain of the file 2 cluster is traced from 00022001h which is the start cluster, the data of the file 2 can be used by tracing the five clusters as shown in FIG. 10C. The

  Then, when the file 2 shown in FIG. 10A is divided into the file 2a and the file 2b as shown in FIG. 11A, as shown in FIG. 10A, the divided portion in the cluster having the cluster number 00022004h. Will occur. That is, the start cluster of the divided file 2a is 00022001h, which is the same as the start cluster of the original file 2, and the final cluster of the file 2 is a cluster of 00022004h. The start cluster of the file 2b after the division is a cluster of 00022004h, and the final cluster of the file 2b is 00022005h which is the same as the final cluster of the original file 2.

  Therefore, as shown in FIG. 11B, a directory entry of the file 2a having a start cluster number of 00022001h and a file size of 100 KB, and a directory entry of a file 2b having a start cluster number of 00022004h and a file size of 50 KB In addition to creating in the directory, the directory entry of the original file 2 is unnecessary and is deleted.

  In this example, as described above, the last cluster of the file 2a and the start cluster of the file 2b are the same 00022004h-th cluster, and when reading the data of the file 2a and when reading the data of the file 2b And the range of data to be skipped is different.

  Therefore, for the 00022004h-th cluster, which is the final cluster of the file 2a, as described above, the rounding process in the cluster calculated from the file size and the cluster size that is normally performed when processing the data of the final cluster is performed. By doing so, unnecessary data that has become the data of the file 2b is not read out.

  In the case of the file 2b, in the 00022004h-th cluster which is the start cluster of the file 2b, the data for 4 KB from the top of the cluster is the data of the file 2a, so this portion of data must be skipped. Don't be. Therefore, in the case of this example, information indicating a skipping state is added to the FAT1 FAT entry corresponding to the 00022004h-th cluster.

  In this example, as shown in FIG. 11C, in the 00022004h-th cluster, which is the start cluster of the file 2b, 4 KB data from the start of the cluster must be skipped. Information indicating an aspect of skipping data is added to the most significant byte of the FAT entry of FAT1 corresponding to 00022004h.

  In the case of this example, the information “1h” indicating that “(1) skip data from the beginning of the target cluster to the target position of the target cluster” described above is illustrated in FIG. 11C. As described above, it is added to the most significant byte of the entry of FAT1 corresponding to the cluster (00022004h). Therefore, by checking the FAT entry of FAT1, it becomes possible to indicate in what cluster it is necessary to skip what kind of data, but the FAT entry whose most significant byte is “1h” In this case, it is made valid only when the FAT entry is the start cluster.

  That is, even if there is a FAT entry having the highest byte of “1h”, if it corresponds to the last cluster, it is impossible to skip data from the beginning of the cluster, so it is ignored. Become. Therefore, when the data of the file 2a formed by division is used, the cluster 00022004h is not the start cluster but the last cluster, so even if the most significant byte is “1h”, it is ignored. It will be.

  In the cluster 00022004h, the value “1000h” indicating 4 KB is recorded in the upper 2 bytes of the FAT2 FAT entry corresponding to the cluster “00022004h” as information indicating the end position of skipping.

As a result, in this example, the FAT entry of FAT1 indicates in what cluster it is necessary to skip what kind of data, and the FAT entry of FAT2 corresponding to the cluster (this division processing) In this case, the upper 2 bytes of data of the FAT entry) indicate how far the data should actually be skipped from the beginning of the cluster, and accordingly, it is possible to perform appropriate data skip control. To be.

  In this way, by updating the directory entry, adding data indicating the mode of skipping to FAT1, and adding data indicating how much data is skipped to FAT2, the data is recorded on the hard disk 33. The new file can be formed by dividing the existing file 1 and file 2 without moving or copying them.

  As described above, in the most significant byte of FAT1 corresponding to cluster 00022004h, “(3) If the target cluster is the start cluster, the data from the head of the target cluster to the target position of the target cluster is displayed. If the target cluster is the last cluster, the data “3h” indicating that the data is skipped from the target position of the target cluster to the end of the target cluster. You may make it add.

  In this case, the corresponding FAT entry of FAT2 holds a hexadecimal number “1000h” indicating 4 KB. As a result, when the 0002004h-th cluster that is the cluster to be processed is the final cluster, the data of 4 KB is read from the head of the 00022004h-th cluster, and the data from the head to the end of the cluster after 4 KB is read. When the 0002004h-th cluster that is the cluster to be processed is the start cluster, it is possible to skip 4KB from the head of the 00022004h-th cluster and read the rest.

  As described above, in the digital video camera of this embodiment, when editing a file formed on the hard disk 33, the directory entry shown in FIG. 5 is formed according to the newly formed file. In this case, if it is necessary to add a directory entry, if it is sufficient to change it, it may be necessary to delete it further. If necessary, the directory corresponding to the file after editing can be added. An entry is to be formed.

  Further, as shown in FIG. 12A, “1h”, “2h”, “3h”, etc. are predetermined for the most significant byte of the FAT entry in FAT1 corresponding to the cluster that requires data skipping. As shown in FIG. 12B, information indicating the mode of skipping data is added, and as shown in FIG. 12B, as FAT entry in FAT2 corresponding to the cluster that requires skipping data, information X1 indicating the end position of skipping data, Information X2 indicating the start position is held.

  In this embodiment, as described above, the information X1 indicating the end position and the information X2 indicating the start position are indicated by the amount of data from the beginning of the cluster where data skipping occurs. ing. In this embodiment, since one cluster is 32 KB, the values that the information X1 and X2 can take are 1 to 65.

  Based on the information about the editing mode added to FAT1 and FAT2 and the directory entry, the original file is edited such as dividing or combining files without moving or copying. Can do. In the digital video camera of this embodiment, editing of the file recorded on the hard disk 33 is controlled by the control unit 20 in accordance with an instruction from the user received through the operation input unit 31. Is done.

[Operations when combining and dividing digital video cameras]
The operations at the time of combining processing and division processing in the digital video camera of this embodiment described above will be described in comparison with the operations at the time of conventional combining processing and operations at the time of dividing processing. FIG. 13 is a diagram for explaining the operation during the combining process, and FIG. 14 is a diagram for explaining the operation during the dividing process.

  First, with reference to FIG. 13, the operation when the file 1 and the file 2 are combined to form a new file 1 will be described. In FIG. 13, FIG. 13A is a flowchart for explaining the file combining process by the conventional method, FIG. 13B shows the state of the file before the combining process in the hard disk, and FIG. 13C shows the state after the combining process by the conventional method in the hard disk. It shows the status of each file.

  In FIG. 13, FIG. 13D is a flowchart for explaining the file combination process according to the method of the present invention, FIG. 13E shows the state of the file before the combination process in the hard disk, and FIG. The state of the file after the joining process by the method according to the invention is shown respectively.

  As shown in FIG. 13B, when files 1 and 2 existing on the hard disk are combined to form a new file 1 (new file 1) by the conventional method, first, a temporary name (file name) is added to the directory. By creating an entry, a data storage area for the new file 1 is secured on the hard disk (step S11).

  Then, the data (contents) of file 1 is copied to the data storage area secured with the temporary name, and after the copying is completed, the directory entry of file 1 and the data of file 1 are deleted, thereby deleting the original file 1. (Step S12). In this state, the data of the original file 1 exists in the data storage area provided with a temporary name.

  Next, the original file 2 is deleted by copying the data (contents) of the file 2 to the data storage area secured with a temporary name, and deleting the directory entry of the file 2 and the data of the file 2 after the copying is completed. (Step S13). In this state, the data of the original file 1 and the data of the original file 2 exist in the data storage area provided with temporary names.

  Thereafter, by changing the name (file name) of the data storage area secured with the temporary name to file 1 (step S14), as shown in FIG. The process for forming the file 1 ends.

  In the case of this conventional method, as can be seen by comparing FIG. 13B and FIG. 13C, the file 1 and the file 2 that originally existed in FIG. 13B do not exist in FIG. 13C, but are formed by combining them. There is only a new file 1 after the joining process. In the case of this conventional method, there must be enough free space for the data storage area to be secured with a temporary name capable of storing the data with the files 1 and 2 before the joining process, and the files 1 and 1 Since the actual data 2 is actually moved, data relocation is inefficient, for example, processing time is required or a free space is formed on the hard disk as shown in FIG. 13C. Is.

  On the other hand, in the case of the method of the present invention, when the file 1 and the file 2 existing on the disk are combined as shown in FIG. 13E, the control unit 20 of the digital video camera of this embodiment firstly The FAT is edited so as to continue from the last cluster of file 1 to the start cluster of file 2 (step S21).

  Next, the control unit 20 adds information indicating a data skipping mode to the FAT1 FAT entry corresponding to the final cluster of the original file 1 and also FAT2 FAT2 corresponding to the final cluster of the original file 1. In the entry, start position information for skipping data is stored (step S22).

  Then, the control unit 20 controls the hard disk drive 32 to delete the directory entry of the file 2 (step S23), and according to the new file 1 formed in the joining process, the file size information of the directory entry of the file 1 and the like. (Step S24), and the file combining process is terminated.

  In the case of the method according to the present invention, as can be seen by comparing FIG. 13E and FIG. 13F, the original file 1 and file 2 are not copied or deleted, and the file 1 and the file 2 are located at the same recording position. Can be formed as a new file 1 (new file 1). In other words, the files can be combined by a relatively simple process of connecting the clusters between files and editing the directory entry.

  Next, the operation when the file 2 is divided to form the file 2a and the file 2b will be described with reference to FIG. 14A is a flowchart for explaining the file division processing according to the conventional method, FIG. 14B shows the state of the file before the division processing on the hard disk, and FIG. 14C shows the state after the division processing according to the conventional method on the hard disk. It shows the status of each file.

  In FIG. 14, FIG. 14D is a flowchart for explaining the file division processing according to the method according to the present invention, FIG. 14E shows the state of the file before the division processing in the hard disk, and FIG. 14F shows the file division processing in the hard disk. The state of the file after division processing by the method according to the invention is shown respectively.

  As shown in FIG. 14B, when the file 2 existing on the hard disk is divided and the new file 2a and the file 2b are formed by the conventional method, first, a directory entry for the file 2a to be newly formed is created. Thus, a data storage area for the file 2a is secured (step S31), and data to be data of the file 2a extracted from the original file 2 is copied to the secured data storage area for the file 2a (step S31). S32).

  Next, by creating a directory entry for the file 2b to be newly formed, a data storage area for the file 2b is secured (step S33), and the data storage area for the file 2b is secured in the original data storage area. The data to be the data of the file 2b extracted from the file 2 is copied (step S34). Then, the original file 2 is deleted, and the file division process ends.

  In the case of this conventional method, as can be seen from FIGS. 14B and 14C, the file 2 originally present in FIG. 14B does not exist in FIG. 14C, and the file after the division process formed by dividing the file 2 Only 2a and file 2b exist. In the case of this conventional method, the data storage areas of the file 2a and the file 2b must be secured before the dividing process, and the actual data of the file 2 is actually moved. Data relocation is inefficient, for example, it takes processing time or a free space is formed on the hard disk as shown in FIG. 14C.

  On the other hand, in the case of the method of the present invention, when the file 2 existing on the disc is divided into the file 2a and the file 2b as shown in FIG. 14E, the control unit 20 of the digital video camera of this embodiment By controlling the hard disk drive 32, first, the name (file name) of the directory entry of the original file 2 is changed to the file 2a (step S41).

  Next, the control unit 20 controls the hard disk drive 32 to create a new directory entry for the file 2b (step S42). Then, editing such as rewriting the file size and other information of the directory entry for the file 2a provided in the process of step S41 is performed to prepare a directory entry that matches the target file 2a (step S43).

  Then, the control unit 20 adds information for skipping to the information of FAT1 and FAT2 corresponding to the start cluster (first cluster) of the file 2b (step S44), and ends the file division process.

  In the case of the method according to the present invention, as can be seen by comparing FIG. 14E and FIG. 14F, the data of the original file 2 is not copied or deleted, and the file is recorded at the same recording position as the original file 2. 2a and file 2b can be formed. That is, the files can be divided by a relatively simple process of connecting the clusters between files and editing the directory entry.

[Use of files after editing]
Next, the use of the data after the editing process performed by the digital video camera according to this embodiment described with reference to FIGS. 9, 11, 13D, E, F, and 14D, E, F will be described. FIG. 15 is a flowchart for explaining processing in the case of using the edited file data by reading it out and reproducing it in the digital video camera of this embodiment.

  When the reproduction of the edited file is instructed, the control unit 20 of the digital video camera according to the present embodiment controls the hard disk drive 32 to start the process of reading the file recorded on the hard disk 33. .

  In this case, as described with reference to FIG. 5, the control unit 20 reads the directory entry of the target file recorded in the hard disk 33 and acquires necessary information such as the start cluster number and the file size. Then, as described with reference to FIG. 7, the data of the file instructed to be reproduced is read in units of clusters by sequentially following the chain of clusters from the FAT1 FAT entry corresponding to the start cluster number.

  At this time, the control unit 20 determines whether or not the cluster to be read is a cluster that needs to be skipped based on the information of the most significant byte of the FAT entry of FAT1 (step S51). In the determination process of step S51, when it is determined that the information indicating the skipping state is not added to the most significant byte of the FAT entry and the cluster does not need to be skipped, the control unit 20 Is read (step S52).

  When it is determined in the determination process in step S51 that the cluster requires data skipping, the control unit 20 refers to and holds the FAT2 FAT entry information corresponding to the cluster (step S53). ). Then, the control unit 20 determines the data skipping mode based on the information of the most significant byte of the FAT1 FAT entry confirmed in step S51 (step S54).

  In the determination process in step S54, the information indicating the FAT1 skipping mode is “1h”, and as described above, “(1) Reading data from the beginning of the target cluster to the target position of the target cluster”. Is to be skipped ”, the upper two bytes of information of the FAT entry of FAT2 held in step S53 is set as information X1 indicating the position of the end of reading, and from the head of the cluster. The data is skipped until X1, and after X1, the data is read to the end of the cluster. (Step S55).

  In the determination processing in step S54, the information indicating the FAT1 reading skip mode is “2h”, and as described above, “(2) skipping data from the target cluster target position to the end of the target cluster. Is used as the information X2 indicating the start position of skipping, and the X2 from the beginning of the cluster. Until the end of the cluster is skipped after X2. (Step S55).

  In the determination processing in step S54, the information indicating the FAT1 skipping mode is “3h”, and as described above, “(3) When the target cluster is the start cluster, from the head of the target cluster. Data skipping to the target position of the target cluster is performed, and when the target cluster is the final cluster, data is skipped from the target position of the target cluster to the end of the target cluster. ”, The control unit 20 determines whether the cluster to be read out is the start cluster or the final cluster based on the start cluster number of the directory entry, and also considers this. Is skipped (step S57).

  Specifically, in the process of step S57, when the cluster to be read is a start cluster, the position indicated by the upper 2 bytes information X1 of the FAT2 FAT entry acquired in step S53 from the head of the cluster to be read. The previous data is skipped and the subsequent data is read. On the other hand, if the cluster to be read is an end cluster, data from the beginning of the cluster to be read to the position indicated by the information 2 in the lower 2 bytes of the FAT2 FAT entry acquired in step S53 is read. To skip the data.

  Then, the data read out by the processing of step S52, step S55, step S56, and step S57 is output to the outside through the communication unit 19, or if the read data is image data, the image signal processing unit. 14 or when the read data is audio data, it is supplied to the audio signal processing unit 18 for processing. Then, the process proceeds to the process for the next cluster, and the process shown in FIG. 15 is repeatedly performed.

  As described above, even when the edited file is used in the digital video camera according to this embodiment, the file can be reproduced by the directory entry and the FAT information as usual.

  Further, when outputting to the outside, only the data of the edited file is outputted, so that the external device at the output destination does not need the information added to the FAT, and as usual. It can be used as a file.

[Specific examples of file deletion]
Next, in the digital video camera of this embodiment, the partial deletion of a file performed on a file recorded on the hard disk 33 will be described with a specific example. FIGS. 16 to 19 are diagrams for explaining an example of logical editing processing of a file performed in the digital video camera of this embodiment. Of these, FIGS. 16 and 17 show the partial deletion (1) process (partial deletion editing process) for partially deleting the data at the beginning of the file, and FIGS. 18 and 19 delete the data at the intermediate part of the file. It is a figure for demonstrating the hollow process (cut-out edit process) which is partial deletion (2). In FIGS. 16 to 19, the 8-digit number is expressed in hexadecimal.

[Specific example of file partial deletion (1)]
First, partial deletion (1) for deleting data at the beginning of a file will be described with reference to FIGS. Hereinafter, the partial deletion (1) is simply referred to as partial deletion. FIG. 16 is for explaining the file before the partial deletion process, and FIG. 17 is for explaining the file after the partial deletion process.

  Here, the case where the head part of the file 3 shown in FIG. 16A is deleted will be described as an example. Also in this example, as shown in FIG. 16A, the description will be made assuming that the size of one cluster (cluster size) is 32 KB (kilobytes).

  In the case of this example, it is known from the directory entry information of the file 3 that the start cluster number of the file 3 is 00003001h and the file size is 150 KB, as shown in FIG. 16B. In this embodiment, as described above, since the cluster size is 32 KB, the file 3 is composed of five clusters as shown in FIG. 16A.

  Then, if the starting cluster of the file 3 grasped from the directory entry information is used as a starting point and the chain of the cluster of the file 3 is traced in the FAT1, the cluster constituting the file 3 may be traced as shown in FIG. 16C. it can. In this case, the final cluster (End OF File) of the file 3 is 00003005h.

  As described with reference to FIG. 16, data of 50 KB is deleted from the top of the file 3 formed on the hard disk 33, and the file after the partial deletion processing is set as a new file 3 as shown in FIG. 17A. In this case, as shown in FIG. 17B, in the directory entry of the new file 3, by deleting 50 KB of data from the beginning of the original file 3, the start cluster number becomes 00033002h, and the file size ranges from 150 KB to 100 KB. Will be changed.

  Furthermore, in the start cluster of file 3 after data deletion, the area of 18 KB from the beginning corresponds to the deleted data part, and therefore skipping is necessary. For this reason, as shown in FIG. 17C, information indicating a skipping mode is added to the FAT entry of FAT1 corresponding to the start cluster of the new file 3 after partial deletion.

  In this example, as shown in FIG. 17A, in the start cluster after partial deletion, 18 KB from the beginning is deleted, so the FAT1 FAT entry corresponding to the start cluster (00033002h) Information indicating an aspect of skipping data is added to the most significant byte.

  In the case of this example, the information “1h” indicating that “(1) skip data from the beginning of the target cluster to the target position of the target cluster” described above is illustrated in FIG. 17C. As described above, it is added to the most significant byte of the entry of FAT1 corresponding to the cluster (00033002h). Accordingly, by confirming the FAT entry of FAT1, it becomes possible to indicate what kind of data skipping is necessary in which cluster.

  Even if you know the cluster that needs to skip data and the mode of skipping, if you cannot clearly indicate where to skip data in that cluster, only the unnecessary data is read appropriately. I can't fly. Therefore, information indicating the start or end position of the skipping that is determined according to the skipping mode is added to the FAT2 FAT entry corresponding to the cluster where the skipping of data occurs.

  In the example of partial deletion of the file shown in FIGS. 16 and 17, the file size of the original file 3 is 150 KB. Therefore, when 50 KB is deleted from the top of the file 3, the file 3 after deletion is deleted. In this starting cluster, 18 KB from the beginning is unnecessary data. Therefore, in this example, as shown in FIG. 17D, the value “4800h” indicating 18 KB is used as information indicating the end position X1 of skipping, in the FAT2 FAT entry corresponding to the cluster “00033002h”. Record in upper 2 bytes.

  Since the start cluster (00033001h) of the file 3 before the partial deletion process is a cluster in which unnecessary data is recorded, the cluster of 00033001h is cleared to zero so as to return to an unused cluster (free cluster).

  As a result, in this example, the FAT entry of FAT1 indicates in what cluster it is necessary to skip what kind of data, and the FAT entry of FAT2 corresponding to the cluster (this partial deletion) In the case of the process (1), the upper 2 bytes of data of the FAT entry) indicate where and how much data should actually be skipped, and according to this, appropriate data skip control is performed. To be able to.

  In this way, by updating the directory entry, adding data indicating the mode of skipping to FAT1, and adding data indicating how much data is skipped to FAT2, the data is recorded on the hard disk 33. A new file 3 can be formed by partial deletion without moving or copying a part of the existing file 3.

  In this case, in the most significant byte of FAT1 corresponding to the cluster 0003302h, “(3) When the target cluster is the start cluster, data skipping from the start of the target cluster to the target position of the target cluster is skipped. When the target cluster is the final cluster, data “3h” is added to indicate that data is skipped from the target position of the target cluster to the end of the target cluster. You may do it.

  In this case, the corresponding FAT entry of FAT2 holds a hexadecimal number “4800h” indicating 18 KB. As a result, when the 00044002h-th cluster, which is the cluster to be processed, is the start cluster, data of 18 KB is skipped from the head of the 00033002h-th cluster, and the subsequent data can be read.

[Specific example of file partial deletion (2)]
Next, partial deletion (2) for deleting an intermediate part of a file will be described with reference to FIGS. This partial deletion (2) is to perform a so-called hollowing process in which a middle part is deleted and a new file is created from the data before and after that part. Therefore, in the following, the process of partial deletion (2) for deleting an intermediate part of a file will be referred to as a hollowing process.

  FIG. 18 is for explaining the file before the hollowing process, and FIG. 19 is for explaining the file after the hollowing process. Here, as shown in FIGS. 18A and 18B, a file formed on the hard disk 33 having a start cluster number of 00044001h and a file size of 150 KB is deleted, and a new file 4 is deleted. This will be described as an example. In this example as well, the cluster size is 32 KB.

  In this example, it is assumed that the starting cluster number is known to be 00044001h from the directory entry information of the file 4. In this case, if the chain of the file 4 cluster is traced from the start cluster 00044001h in FAT1, the data of the file 4 can be used by tracing the five clusters as shown in FIG. 18C. The

  Then, the file 4 shown in FIG. 18A is deleted from the 46 KB data from 50 KB to 96 KB counted from the head as shown in FIG. 19A to form a new file 4. . In this case, the new file 4 has a start cluster number of 00044001h as shown in FIG. 19B, and the file size is 100 KB. Therefore, as shown in FIG. 19B, the directory entry of the file 4 In this case, the file size is changed to 100 KB.

  In this example, since data of 46 KB from 50 KB to 96 KB counted from the head of the file 4 is deleted, partial data on the terminal side of the 00044002h-th cluster (data of 14 KB on the terminal side) ) And all the data of the 00044003h-th cluster (data of 32 KB) are unnecessary.

  That is, data from the middle of the 00044002h-th cluster of the file 4 to the end of the cluster becomes a target to be skipped, and the cluster 00044003h needs to be released as an unused cluster (free cluster).

  Therefore, as shown in FIG. 19C, information indicating a skipping state is added to the FAT1 FAT entry corresponding to the 00044002h-th cluster which is a new file 4 cluster. In the case of this example, as shown in FIG. 19C, in the 00044002h-th cluster that is the cluster of the file 4, data from the beginning of the cluster to the 18 KB and beyond to the end of the cluster must be skipped. Therefore, information indicating an aspect of skipping data is added to the most significant byte of the FAT1 FAT entry corresponding to the 00044002h-th cluster.

  In the case of this example, the information “2h” indicating that “(2) data is skipped from the target position of the target cluster to the end of the target cluster” described above is shown in FIG. 19C. Thus, it is added to the most significant byte of the entry of FAT1 corresponding to the 00044002h-th cluster. Accordingly, by confirming the FAT entry of FAT1, it becomes possible to indicate what kind of data skipping is necessary in which cluster.

  Then, as shown in FIG. 19D, in the 00044002h-th cluster, as information indicating the skip start position X2, a value “4800h” indicating 18 KB from the head of the 00044002h-th cluster is set as the cluster “00044002h”. Are recorded in the lower 2 bytes of the FAT2 FAT entry. Further, since all the data of the 00044003h-th cluster is not necessary, the 00044003h-th cluster is cleared to zero so as to be an unused cluster (free cluster).

  As a result, in this example, the FAT entry of FAT1 indicates in what cluster it is necessary to skip what kind of data, and the FAT entry of FAT2 corresponding to the cluster (this void) In the case of processing, the lower 2 bytes of data of the FAT entry) indicate from what position in the cluster the data should be skipped from the end of the cluster, and in accordance with this, appropriate data skip control is performed. Will be able to do.

  In this way, by updating the directory entry, adding data indicating the mode of skipping to FAT1, and adding data indicating how much data is skipped to FAT2, the data is recorded on the hard disk 33. With respect to the existing file 4, the data in the middle part of the file 4 is deleted without moving or copying the data, and a new file 4 can be formed.

  In this file partial deletion process and file cut-out process, the information X1 indicating the end position and the information X2 indicating the start position are indicated by the amount of data from the beginning of the cluster where data skipping occurs. I am doing so. In this embodiment, since one cluster is 32 KB, the values that the information X1 and X2 can take are 1 to 65.

  These editing information such as FAT1 and FAT2, and editing such as partial deletion and omission of the original file without actually moving or copying the data, with the directory entry and the information relating to the editing mode added to the FAT1 and FAT2. Can be done. In the digital video camera of this embodiment, editing of the file recorded on the hard disk 33 is controlled by the control unit 20 in accordance with an instruction from the user received through the operation input unit 31. Is done.

  Also, in this example, among the two clusters that are connected in the middle, the skip of the latter half part occurs in the 00044002h cluster that is the previous cluster, and in the 00044004h cluster that is the subsequent cluster. It was a case where skipping did not occur. However, there may be a case where skipping is necessary in both of the two clusters that are connected by being hollowed out.

  In this case, information “2h” indicating that reading of the latter half is necessary is added to the FAT1 information corresponding to the previous cluster, and the data amount of the skipping is added to the FAT2 information corresponding thereto. In addition, information “1h” indicating that skipping of the first half portion is necessary is added to the information of FAT1 corresponding to the subsequent cluster, and information of FAT2 corresponding to this is added. By adding information indicating the amount of data to be skipped, it is possible to perform skipping in both of the two clusters at the connection portion.

  Of course, in the FAT1 information corresponding to the previous cluster, information “3h” indicating that skipping of the first half portion is necessary in the case of the start cluster and skipping of the second half portion is necessary in the case of the end cluster. Is added to the FAT2 information corresponding thereto, and information indicating the skipped data amount is added to the FAT1 information corresponding to the subsequent cluster when the start cluster is used. In the case of an end cluster, information “3h” is added to indicate that the first half is skipped and the latter half is skipped, and the data amount of the skip is added to the corresponding FAT2 information. By adding the information to be shown, it is possible to skip reading in both of the two clusters in the connection portion.

  In this case, the cluster before the connection portion may be regarded as the end cluster, and the subsequent cluster may be regarded as the start cluster. Specifically, when two clusters having “3h” at the beginning of the information of FAT1 are consecutive, it can be handled by regarding the previous cluster as the end cluster and the subsequent cluster as the start cluster. it can.

[Operations during digital video camera partial deletion processing and hollow-out processing]
The operations at the time of partial deletion processing and hollowing out processing in the digital video camera of this embodiment described above will be described in comparison with the operations at the time of conventional partial deletion processing and hollowing out processing. FIG. 20 illustrates the operation during the partial deletion process, and FIG. 21 illustrates the operation during the hollowing process.

  First, referring to FIGS. 20A and 20B, the operation in the case of deleting the head portion of the file 3 and forming a new file 3 as described with reference to FIGS. 16 and 17 will be described. 20, FIG. 20A is a flowchart for explaining the file partial deletion processing according to the conventional method, FIG. 20B shows the state of the file before the partial deletion processing in the hard disk, and FIG. 20C shows the portion of the hard disk according to the conventional method. This shows the state of the file after the copy deletion process.

  20D is a flowchart for explaining the file partial deletion processing according to the method according to the present invention. FIG. 20E shows the state of the file before the partial deletion processing in the hard disk, and FIG. The file states after partial deletion processing by the method according to the present invention are respectively shown.

  As shown in FIG. 20B, consider a conventional editing method in which, for example, 50 KB of the top part of a file 3 existing on the hard disk is deleted and the remaining part is used as a new file 3 (new file 3). In this case, first, the rearrangement of the contents of the new file 3 is started from the beginning of the old file 3, and the new file 3 consisting only of data excluding the data for the first 50 KB is formed ( Step S61).

  Thereafter, as a result of rearrangement, the FAT information for the unused portion, that is, the first 50 KB of the original file 3 is cleared (step S62), and the size of the directory entry of the new file 3 is edited (step S62). S63), the file partial deletion process is terminated. As a result, as shown in FIG. 20C, a new file 3 is formed in which the data for the first 50 KB is deleted from the original file 3.

  In the case of this conventional method, as can be seen by comparing FIG. 20B and FIG. 20C, in the new file 3 after editing, data for the first 50 KB of the original file 3 does not physically exist. In the case of this conventional method, since the data rearrangement process in step S61 is performed, the entire process is inefficient.

  On the other hand, in the case of the method of the present invention, as shown in FIG. 20E, when the data for the first 50 KB of the file 3 existing on the disk is deleted to form a new file 3 (new file 3), First, the FAT information of the data for the first 50 KB to be deleted is cleared (step S71), and the start cluster of the file 3 is edited (step S72). The processing in step S72 is processing such as adding information on how to skip reading to the corresponding portion of FAT1, or adding information indicating the amount of skipped data to the corresponding portion of FAT2. .

  Then, the size of the directory entry of the file 3 is edited (step S73), and the file partial deletion process is terminated.

  In the case of the method according to the present invention, as can be seen by comparing FIG. 20E and FIG. 20F, the necessary data in the original file 3 is rearranged such as moved or copied, that is, physical. It is understood that only unnecessary data portions are deleted without performing any significant movement. In this case, the data portion that has become unnecessary and has been deleted becomes an empty area and can be reused.

  In the case of the method according to the present invention, only the FAT and directory entry are edited and the data is not rearranged, so that partial deletion can be performed efficiently. Since no change occurs in the data portion to be left as necessary data, it is possible to ensure high data reliability.

  Next, as described with reference to FIGS. 18 and 19 with reference to FIG. 21, the middle part of the file 4 is deleted to form a new file 4 (new file 4). An operation when processing is performed will be described. In FIG. 21, FIG. 21A is a flowchart for explaining the file hollowing process according to the conventional method, FIG. 21B shows the state of the file before the hollowing process in the hard disk, and FIG. Each of the file states after the extraction process is shown.

  In FIG. 21, FIG. 21D is a flowchart for explaining the file hollowing process according to the method according to the present invention, FIG. 21E shows the state of the file before the hollowing process in the hard disk, and FIG. The file states after the hollowing out process according to the method according to the present invention are respectively shown.

  As shown in FIG. 21B, for the file 4 existing on the hard disk, the data for 46 KB from 50 KB to 96 KB counted from the head, that is, the data of the intermediate part of the file 4 is deleted, and the remaining part is replaced with a new file. Consider a conventional editing method in the case of 4 (new file 4). In this case, first, the rearrangement of the contents of the new file 4 is started from the beginning of the old file 3, and the new file 4 consisting only of data excluding the data of 46 KB in the intermediate portion is formed. (Step S81).

  Thereafter, as a result of the rearrangement, the FAT information for the part that has not been used, that is, the intermediate part 46 KB of the original file 4 is cleared (step S82), and the size of the directory entry of the new file 4 is edited ( Step S83), the file hollowing process is terminated. As a result, as shown in FIG. 21C, a new file 4 is formed in which data corresponding to the intermediate portion 46 KB is deleted from the original file 4.

  In the case of this conventional method, as can be seen by comparing FIG. 21B and FIG. 21C, in the new file 4 after editing, data corresponding to the intermediate portion 46 KB of the original file 4 does not physically exist. In the case of this conventional method, since the data rearrangement process in step S81 is performed, the entire process is inefficient.

  On the other hand, in the case of the system of the present invention, as shown in FIG. 21E, the file 4 existing on the disk is 46 KB data from 50 KB to 96 KB counted from the head, that is, the middle part of the file 4. If the data is deleted and the remaining part is a new file 4 (new file 4), the FAT information for file 4 is edited so that it follows the cluster immediately after being dropped from the cluster immediately before being dropped. (Step S91).

  The processing of step S92 is processing such as adding information on how to skip reading to the corresponding portion of FAT1, or adding information indicating the amount of data skipped to the corresponding portion of FAT2. . Then, the size of the directory entry of the file 4 is edited (step S93), and the file hollowing process is terminated.

  In the case of the method according to the present invention, as in the case of the partial deletion process described with reference to FIG. 20, as can be seen from a comparison between FIGS. 21E and 21F, the necessary data in the original file 4 is It can be seen that the rearrangement such as moving or copying, that is, the physical movement is not performed at all, and only the unnecessary data portion is deleted. In this case, the data portion that has become unnecessary and has been deleted becomes an empty area and can be reused.

  In the case of the method according to the present invention, only the FAT and directory entry are edited and the data is not rearranged, so that partial deletion can be performed efficiently. Since no change occurs in the data portion to be left as necessary data, it is possible to ensure high data reliability.

[Deleting the tail part of a file]
The above-described partial deletion of a file has been described by taking the case of deleting the top part of a file as an example, but of course, it is possible to perform partial deletion of the tail part of a file in the same way as partial deletion of the top part of a file. is there. Here, a case will be described in which partial deletion of the tail part of the file and partial deletion of the head part of the file are combined, and data in the middle part of the file is left and edited into a new file.

  FIGS. 22 and 23 show that a new file can be created by deleting the both ends of the file by combining the partial deletion of the tail part of the file and the partial deletion of the head part of the file, leaving the data in the middle part of the file. It is a figure for demonstrating the edit process in the case of forming. In FIG. 22 and FIG. 23, the 8-digit number is expressed in hexadecimal.

  Here, a description will be given by taking as an example a case where the beginning and tail portions of the file 5 shown in FIG. 22A are deleted and a new file 5 (new file 5) consisting only of the middle portion of the file 5 is formed. Also in this example, as shown in FIG. 22A, the description will be made assuming that the size of one cluster (cluster size) is 32 KB (kilobytes).

  In the case of this example, it is known from the directory entry information of the file 5 that the start cluster number of the file 5 is 00055001h and the file size is 256 KB as shown in FIG. 22B. In this embodiment, as described above, since the cluster size is 32 KB, the file 5 is composed of eight clusters as shown in FIG. 22A.

  Then, if the starting cluster of the file 5 grasped from the directory entry information is used as the starting point and the chain of the cluster of the file 5 is traced in the FAT1, the cluster constituting the file 5 may be traced as shown in FIG. 22C. it can. In this case, the final cluster (End OF File) of the file 5 is 00005008h.

  Then, as described with reference to FIG. 22, the data of 50 KB from the beginning of the file 5 formed on the hard disk 33 and the data of 50 KB at the end are deleted, and as shown in FIG. The file after the deletion process is set as a new file 5. In this case, as shown in FIG. 22B, in the directory entry of the new file 5, by deleting 50 KB of data from the beginning of the original file 3, the start cluster number becomes 00055002h and the final cluster number becomes 00055007h. The file size is changed from 256 KB to 156 KB.

  Further, in the start cluster of file 5 after data deletion, the area of 18 KB from the head corresponds to the deleted data part, and therefore skipping is necessary. Further, in the start cluster of the file 5 after data deletion, the area of 18 KB after the area of 14 KB from the head corresponds to the deleted data part, so it is necessary to skip reading.

  For this reason, as shown in FIG. 17C, information indicating the skipping state is added to the FAT entry of FAT1 corresponding to the start cluster of the new file 5 after the partial deletion, and a new one after the partial deletion is added. Information indicating the skipping state is added to the FAT1 FAT entry corresponding to the end cluster of the file 5.

  In the case of this example, as shown in FIG. 23A, in the start cluster after partial deletion, 18 KB from the head is deleted, so the FAT entry of FAT1 corresponding to the start cluster (00055002h) Information indicating the data skipping mode is added to the most significant byte, and in the end cluster after partial deletion, data after the 14 KB area from the beginning is deleted, so the end cluster (00055007h) Is added to the most significant byte of the FAT1 FAT entry corresponding to.

  In the case of this example, for the 00055002h-th cluster which is the start cluster, “(1) data skipping from the beginning of the target cluster to the target position of the target cluster” is performed. The information “1h” shown is added to the most significant byte of the entry of FAT1 corresponding to the 00055002h-th cluster that is the start cluster, as shown in FIG. 23C.

  Further, the information “2h” indicating that “(2) data is skipped from the target position of the target cluster to the end of the target cluster” is stored in the 00055007h-th cluster that is the end cluster. As shown in FIG. 23C, it is added to the most significant byte of the entry of FAT1 corresponding to the 00033007h-th cluster which is the end cluster. Thus, by confirming the FAT entry of FAT1, it becomes possible to indicate what kind of data skipping is necessary in which cluster.

  Even if you know the cluster that needs to skip data and the mode of skipping, if you cannot clearly indicate where to skip data in that cluster, only the unnecessary data is read appropriately. I can't fly. Therefore, information indicating the start or end position of the skipping that is determined according to the skipping mode is added to the FAT2 FAT entry corresponding to the cluster where the skipping of data occurs.

  In the example of partial deletion at both ends of the file shown in FIGS. 22 and 23, the file size of the original file 5 is 256 KB. Therefore, when 50 KB is deleted from the beginning of the file 5, In the starting cluster of the file 5, 18 KB from the head is unnecessary data. Further, when 50 KB at the end of the file 5 is deleted, in the end cluster of the file 5 after deletion, 18 KB after the 14 KB from the beginning is unnecessary data.

Therefore, in this example, as shown in FIG. 23D, the value “4800h” indicating 18 KB is used as information indicating the end position X1 of skipping, and the FAT2 FAT entry corresponding to the start cluster “00055002h” is used. And the value “3800h” indicating 14 KB is recorded in the lower 2 bytes of the FAT entry of FAT2 corresponding to the end cluster “00055007h” as information indicating the start position X2 of skipping. Since the start cluster (00055001h) and end cluster (00055008h) of the file 5 before the partial deletion processing are clusters in which unnecessary data is recorded, the clusters of 00055001h and 00055008h are unused clusters (free clusters). To return to zero Ah.

  As a result, in this example, the FAT entry of FAT1 indicates in what cluster it is necessary to skip what kind of data, and the FAT entry of FAT2 corresponding to the cluster actually It is possible to know where and how much data should be skipped, and according to this, it is possible to perform appropriate data skip control.

  In this way, by updating the directory entry, adding data indicating the mode of skipping to FAT1, and adding data indicating how much data is skipped to FAT2, the data is recorded on the hard disk 33. The new file 5 can be formed by deleting both end portions of the file 5 without performing so-called data rearrangement of moving or copying the existing file 5 data.

  In this case, in the most significant byte of FAT1 corresponding to the start cluster (00055002h) and the end cluster (00055007h), “(3) If the target cluster is the start cluster, the target cluster starts from the head of the target cluster. The data is skipped to the target position of the cluster, and when the target cluster is the final cluster, the data is skipped from the target position of the target cluster to the end of the target cluster. Similarly, the partial deletion of both ends of the file can be performed by adding the information “3h” indicating the above.

  As described above, even when both end portions of the file are deleted and a new file is formed in which only the data in the middle portion of the file is left, the FAT is not performed without performing data relocation processing such as data movement or copying. A file consisting only of the target data can be formed (edited) simply by editing the directory entry and the directory entry.

[Seek overhead problems associated with file merging and hollowing out]
By the way, according to the present invention described above, when the file data after the editing process is read out by performing the file combination process or the file skip process, the seek time of the read head (magnetic head) is increased, and the data There is a possibility that inconveniences such as it takes a long time to read the data may occur. In such a case, the seek time may be shortened by using the conventional editing method rather than using the editing method of the present invention.

  For example, as shown in FIG. 24, a large number of files (files a, b, c, d,...) Exist, and the file 1 and the file 2 that are separated from each other in the recording position on the hard disk 33 are stored in the present invention. When editing is performed using this editing method, the positions of the files 1 and 2 on the medium do not change because the data is not rearranged. Therefore, when the file 1 and the file 2 are separated from each other on the medium, it takes time to move (seek) the read head from the file 1 to the file 2, and the data reading is interrupted in the middle. It is possible to generate a state.

  Similarly, as shown in FIG. 25, when a relatively large amount of data in the middle part of the file 3 having a large file size is cut out, the data is not rearranged, so that the first half of the file after the cut out is removed. The position of the part and the latter part on the media does not change, and it takes time to move (seek) the read head from the first half part to the second half part, causing a situation where data reading is interrupted It is possible to make it.

  As described above, when a data area in which a distance on the medium is separated occurs in one file and it takes time to read the read head, the data is rearranged and the file is edited. In some cases, it is preferable to perform a file combining process or a hollow process using a conventional editing method.

  However, in the case of the conventional editing method, as described above, there must be sufficient continuous free space on the medium in order to perform data rearrangement. Therefore, in the digital video camera of the present invention, when performing a file combining process or a hollowing process, the distance between files to be combined, the distance between data areas at distant positions remaining after the hollowing, Considering the continuous free space on the media, it is automatically determined whether the file combining process and the hollowing process are performed using the method of the present invention, or the file combining process and the hollowing process are performed by the conventional editing method. Can be selected and switched for use.

  FIG. 26 is a flowchart for explaining a file editing method selection process performed in the digital video camera of this embodiment. The processing of the flowchart shown in FIG. 26 is executed by the control unit 20 when an instruction input for performing editing processing is received through the operation input unit 31.

  Upon receiving an instruction input for performing editing processing, the control unit 20 first determines what kind of editing is performed for the received instruction input (step S101). In the determination process of step S101, if the received instruction input is a file division process or a file partial deletion process, the necessary data area portion will not be greatly separated. Using the editing method, the designated file is edited (step S102), and the process shown in FIG. 26 is terminated.

  In the determination process of step S101, if the received instruction input is a file skipping process or a merge process, the necessary data area portion may be greatly separated as described above. The free space of the hard disk 33 is grasped by referring to the information (step S103).

  Then, referring to the information of the file to be edited, the free space of the hard disk 33 grasped in step S103 is secured for a continuous free space sufficient when the conventional editing method for performing the file hollowing process and the combining process is performed. It is determined whether or not it can be performed (step S104). That is, in the determination process in step S104, it is determined whether or not a continuous free area having a capacity equal to or larger than the capacity of the edited file can be secured when the hollowing process or the combining process is performed.

  If it is determined in the determination process in step S104 that a sufficient continuous free area cannot be secured, the hollowing process and the combining process cannot be performed using the conventional editing method. Using the method, editing of the instructed file is executed (step S102), and the processing in FIG. 26 is terminated.

  Further, when it is determined in the determination process in step S104 that a sufficient continuous free space can be secured, a distance to be removed or combined is calculated (step S105). In the process of step S105, the distance between the data areas whose positions on the medium are separated despite the same file is calculated. Therefore, in the case of file hollowing processing, the distance from the tail of the front data area to the beginning of the rear data area, which is divided by the data being hollowed out, is calculated, and file combination In this case, the distance between the two files to be combined (the distance from the tail of the previous file to the head of the subsequent file) is calculated.

  And it is judged whether the distance calculated | required in step S105 is smaller than the predetermined threshold value Y (step S106). The threshold value Y used in this step S106 is a distance that may cause trouble in reading because it takes time to seek the reading head when the distance becomes longer than this.

  If it is determined in step S106 that the distance obtained in step S105 is smaller than the threshold Y, the read head seek does not take time, so the above-described editing method of the present invention is used. Then, the editing process of the instructed file is executed (step S102), and the process shown in FIG.

  Also, in the determination process of step S106, if it is determined that the distance obtained in step S105 is equal to or greater than the threshold Y, it may take time to seek the read head. The editing process for the instructed file is executed using the editing method (step S107), and the process shown in FIG. 26 is terminated.

  In this way, by properly using the editing method of the present invention and the conventional editing method, when the editing method of the present invention is used and when the file hollowing process or the file combining process is performed, it takes time to seek. It is possible to prevent the occurrence of a case where a file is generated and to perform a file hollowing process or a combining process so that the file can be accessed efficiently.

[Application to MPEG (Motion Picture Expert Group) stream]
For example, as shown in FIG. 27, the present invention can also be applied to a case where an MPEG stream composed of image data and audio data formed by compressing data in the MPEG system is recorded as a file on a medium. As shown in FIG. 27A, the MPEG stream is processed in GOP (Group Of Picture) units of 15 pictures each including I pictures, B pictures, and P pictures by data compression.

  In this case, the MPEG stream can be configured in each GOP by inserting padding data, for example, as shown in FIG. Each GOP by adjusting the amount of data in the GOP as shown in FIG. 27C, or by aligning the clusters to be completed (so that the clusters do not cross between the GOPs) or as shown in FIG. Are aligned so that the clusters constituting the network are completed (so that the clusters do not cross between GOPs). The details of the method for aligning the clusters are disclosed in Japanese Patent Application Laid-Open No. 2004-079907.

  Then, as shown in FIGS. 27B and 27C, the MPEG stream is cluster-aligned in the GOP, and is a file composed of GOP1-1 to GOP1-5 as shown in FIG. 1 and GOP2-1 to GOP2-5 are combined to form a new file 1 consisting of GOP1-1 to GOP1-5 and GOP2-1 to GOP2-5. The combination process can be performed by an editing method.

  In this case, as described with reference to FIG. 13D, the FAT information of file 2 for GOP2-1 to GOP2-5 is added to the FAT information of file 1 (step S21), and the directory entry of file 2 is added. By deleting (step S23) and editing the size of the directory entry of file 1 (step S24), as shown in FIG. 28A, GOP1-1 to GOP1-5 and GOP2-1 to GOP2 A new file 1 consisting of −5 can be formed.

  In this case, since the GOP is simply cluster-aligned and the GOP is simply processed, skipping in the cluster does not occur. For this reason, the skipping process of step S22 in FIG. 13D can be omitted.

  Similarly, as shown in FIGS. 27B and 27C, the MPEG stream is cluster-aligned in the GOP, and is a file composed of GOP2-1 to GOP2-10 as shown in FIG. 28B. 2 is divided into two files, a file 2a consisting of GOP2-1 to GOP2-5 and a file 2b consisting of GOP2-6 to GOP2-10. Division processing can be performed.

  In this case, as described with reference to FIG. 14D, first, the name (file name) of the directory entry of the original file 2 is changed to the file 2a (step S41). Next, the control unit 20 controls the hard disk drive 32 to create a new directory entry for the file 2b (step S42). Then, editing such as rewriting the file size and other information of the directory entry for the file 2a provided in the process of step S41 is performed to prepare a directory entry that matches the target file 2a (step S43).

  As a result, as shown in FIG. 28B, the file 2 can be divided to form the file 2a and the file 2b. In this case, since the GOP is simply cluster-aligned and the GOP is simply processed, skipping in the cluster does not occur. For this reason, the skipping process of step S44 in FIG. 14D can be omitted.

  In addition, as shown in FIGS. 27B and 27C, the MPEG stream is cluster-aligned in the GOP, and the file 3 is composed of GOP3-1 to GOP3-10 as shown in FIG. 29A. The tail part of the file 3 is deleted to form a new file 3 made up of GOP3-1 to GOP3-5, or the head part of the file 3 made up of GOP3-1 to GOP3-10 as shown in FIG. Even when deleting and forming a new file 3 composed of GOP 3-6 to GOP 3-10, the partial deletion processing can be performed by the above-described editing method of the present invention.

  In this case, as described with reference to FIG. 20D, first, the FAT information of the part to be deleted is cleared (step S71), and the size of the directory entry of the file 3 is edited, so that A new file 3 made up of GOP3-5 or a new file 3 made up of GOP3-6 to GOP3-10 can be formed.

  Even in this case, since the GOP is simply cluster-aligned and the GOP is simply processed, skipping in the cluster does not occur. For this reason, the skipping process of step S72 in FIG. 20D can be omitted.

  Further, as shown in FIGS. 27B and 27C, the MPEG stream is cluster-aligned in the GOP, and the file 4 is composed of GOP4-1 to GOP4-10 as shown in FIG. 29B. In the case of deleting GOP4-4 to GOP4-6 and forming a new file 4 composed of GOP4-1 to GOP3 and GOP4-7 to GOP4-10, the above-described editing method of the present invention is used to perform the hollowing process. Can do.

  In this case, as described with reference to FIG. 21D, first, the FAT is edited so as to continue from the cluster immediately before being hollowed out to the cluster immediately after being hollowed out (step S91), and then deleted by being hollowed out. The FAT information of the portion to be processed is cleared (step S92), and the size of the directory entry of the file 4 is edited to form a new file 4 composed of GOP4-1 to GOP3 and GOP4-7 to GOP4-10. be able to.

  Even in this case, since the GOP is simply cluster-aligned and the GOP is simply processed, skipping in the cluster does not occur. For this reason, the process for skipping can be omitted in step S71 in FIG. 21D.

  As described above, the present invention can be applied to editing an MPEG stream to be processed in units of GOPs, and various editing processes can be efficiently performed. In addition, in the present invention, there is no processing involving data relocation such as data movement or copying, so there is no concern about free space on the medium, and data reliability is increased. Can be secured.

[Use of AV management information]
When recording and using many data with various attributes such as moving image data, still image data, and audio data on a large-capacity recording medium such as a hard disk, the data can be efficiently managed and used efficiently. In order to achieve this, it is conceivable that only management information is collectively managed in a separate file. The present invention can also be applied to devices and systems that manage only such file management information in a separate file.

  FIG. 30 is a diagram for explaining an overview of this collective management method. As shown in FIG. 30, it is assumed that AV (Audio / Visual) management information 101, a still image file A, a still image file B, and a moving image file C are recorded on the recording medium 10. In the case of this collective management method, as shown by AV management information 101 in FIG. 30, the management information of each image data is managed in a file different from the image data files A, B, and C. The image data file is associated with a predetermined pointer.

  FIG. 31 is a diagram for explaining an example of AV management information. In the case of this example, the AV management information includes a title file 101a, a thumbnail file 101b, and a property file 101c. In each of these files, various information for the image data recorded as the file is held as entry information (registration information).

  Each of the title entries 0, 1, 2,... Registered in the title file 101a is a text input by the user, such as a comment, a memo, a note, etc. for each of the image data stored as a file. Retain data.

  Further, each of the thumbnail entries 0, 1, 2,... Registered in the thumbnail file 101b is reduced image data of an image formed by image data stored as a file, and is not limited to one type, but a plurality of thumbnail entries. It is also possible to have a reduced image.

  Further, each of the property entries 0, 1, 2,... Registered in the property file 101c holds various management information for each of the image data stored as a file. Each property entry includes at least a file pointer Pt, an original recording file flag aa, shooting date / time information bb, and correction date / time information cc, as shown in the property entry n portion in FIG. Is done.

  The file pointer Pt is information for specifying the image data file corresponding to the property entry. The original recording file flag aa indicates whether or not the image data is captured by the digital video camera according to this embodiment and recorded on the recording medium. In the case of this example, when the original recording file flag aa is “1”, it indicates that the file is an image data file taken by the digital video camera of this embodiment, and when it is “0”, It indicates that the file is an image data file not taken by the digital video camera of this embodiment.

  The shooting date / time information bb indicates the shooting date / time of image data captured by the digital video camera of this embodiment and recorded on the recording medium. The correction date / time information cc indicates the date / time when the correction processing of the image data was performed. However, as will be described later, in the case of image data provided from the outside, the correction date / time information cc is used as an acquisition date / time indicating the date / time when the digital video camera acquired the image data. .

  A title entry, a thumbnail entry, and a property entry can be provided as AV management information for each content file such as an image data file or an audio data file. Each image data file is indirectly associated with the title entry and the thumbnail entry via the property entry.

  Therefore, in the case of the example shown in FIG. 31, for still image file A, title entry n, thumbnail entry n, and property entry n are provided as AV management information, and for still image file B, , Title entry 2, thumbnail entry 2, and property entry 2. Similarly, a title entry n + 1, a thumbnail entry n + 1, and a property entry n + 1 are provided for the moving image file C.

  Further, for example, the property file 101c can record the definition of the reproduction order, etc., and the contents of the property file 101c of the AV management information are interpreted by the application, and according to the defined contents. The target image data and audio data can be reproduced. Thereby, for example, a slide show reproduction that continuously reproduces still images can be performed.

  Thus, by providing management information about image data and audio data recorded on a recording medium separately from the image data file and audio data file, the search time and search time for the image data file and audio data file are markedly increased. In addition to being advantageous in that it can be shortened, it is also possible to perform playback in various unconventional manners such as slide show playback.

  Therefore, for example, by referring to the property file information of the AV management information using the shooting date and time as a search key, the target still image file can be quickly found. Further, considering the case where slide show playback of still image data is performed in a predetermined order, as described above, the target still image file can be quickly identified based on the information in the property file 101c. Is possible.

  However, as shown in FIGS. 30 and 31, when AV management information is provided for an image data file, an audio data file, or the like, when these files are divided or edited, The AV management file needs to be recreated. Even in such a case, as described above, when the file is combined or divided by using the directory entry information and the FAT information, the movement of the actual data does not occur. It is relatively easy to create AV management information of files formed by combining and AV management information formed by division based on the original directory entry, FAT information, and original AV management information. Can do.

  That is, the addition, change, and deletion of AV management file information accompanying file editing are performed in the same manner as the addition, change, and deletion of directory entries at the time of editing performed in the digital video camera of the above-described embodiment. Based on the existing information, AV management information about the edited file can be formed. When the system according to the present invention is used, the data recording position is changed by performing the conventional system editing as shown in FIGS. 13A and 14A, and the directory entry, FAT, and AV management information are all changed from the beginning. There is no need to re-create, and even when there is a management file associated with an image data file such as an AV management file, it is possible to easily keep it without destroying the associatedness and relevance thereof. Become.

  As described above, the present invention is realized mainly by the function of the control unit 20 of the digital video camera, and the positioning is software that is operated in the control unit 20. It operates in relation to the “file system” and “device driver”.

  That is, as shown in FIG. 32, when data is recorded on a recording medium (in this embodiment, the hard disk 33), or when data recorded on the recording medium is read and used, A file system (file management program) 52 for managing files on the recording medium and a device driver 53 for controlling the recording medium based on information from the file system exist below the application program 51 serving as a window with the user. To do.

  When various types of data are recorded, data is written by the functions of the file system 52 and the device driver 53. The file system 52 and the device driver 53 that control the writing / reading of data are as follows. Move data by simply using it as it is without changing it, simply updating the information created and managed by the file system or device driver, or adding the necessary information. It is possible to perform non-destructive editing (logical editing) of files without rearrangement such as copying and copying.

  That is, the implementation of the present invention can be implemented by software, and in the same manner as the conventional technology, the configuration of the file system, the device driver, and the recording medium (hard disk) is as described above for the file system. Thus, it is only necessary to add processing such as performing cluster chain concatenation / division processing while avoiding data rearrangement.

  In the embodiment described above, the adding unit and the updating unit are realized by the cooperation of the control unit 20 of the digital video camera and the hard disk driver 32, and the control of the control unit 20 is mainly performed. Therefore, non-destructive editing is realized.

  Further, the present invention can be applied as it is to the above-described embodiment, for example, a file having no header or footer called DV data. However, in the case of a file with a header or footer, it is necessary to deal with the header or footer.

  Therefore, in the case of division, it is necessary to add a footer to the first file and a header to the second file. In this case, since the same file was originally divided, the remaining headers are left in each file. Or footers can be shared, or headers and footers can be ignored. In the case of combining, the footer of the first file and the header of the second file are not necessary, and it is only necessary to skip these.

  In addition, when outputting the edited file to the outside, if necessary, a new header or footer is formed from the remaining header or footer information, and this is added and output, or by combining In the case of a created file, footers and headers that are no longer needed can be deleted and then output to the outside. The processing relating to these headers and footers can also be realized by the function of the control unit 20 or by a program executed by the control unit 20.

  In the above-described embodiment, the case where a hard disk is used as a recording medium has been described as an example. However, the present invention is not limited to this. For example, in order to manage individual files such as MO (Magneto Optical disk), PD (Phase change rewritable disk), Zip, SuperDisk, memory card, etc., detailed information management tables such as directories and storage area management such as FAT The present invention can be applied when using various recording media.

  In the above-described embodiment, the data to be recorded on the recording medium is described as an example of recording audio data such as moving image data, still image data, music, but the present invention is not limited to this. For example, the present invention can be applied to recording text data, program data, and other various data.

  In the above-described embodiment, the file system is described as using FAT, but the present invention is not limited to this. The present invention can be applied when using various file systems other than FAT.

  Further, in the above-described embodiment, as the information related to the editing mode, the information indicating the skipping mode is added to FAT1, and the information indicating the start or end of skipping is added to FAT2. However, it is not limited to this. For example, the information indicating the skipping mode and the information indicating the start or end of the skipping are separated in the part where a valid number such as the upper bit in the starting cluster number field of the directory entry is not input. It is also possible to add as much as possible and use it for non-destructive editing.

  In the above-described embodiment, the case where the present invention is applied to a digital video camera has been described as an example. However, the present invention is not limited to this. For example, the present invention can be applied to a personal computer using a hard disk drive or the like as a recording device, a hard disk device, and other electronic devices capable of recording data on a recording medium such as a hard disk or an MO.

Although the present invention has been described as being applicable to editing of an MPEG stream, the data that can be edited by the present invention is not only the MPEG stream but also data compressed by various data compression methods or data that has not been compressed. It is possible to apply to a file in which various data are recorded.

It is a block diagram for demonstrating the digital video camera to which this invention was applied. It is a figure for demonstrating the state of the hard disk 33 which can be utilized by being initialized according to a file system. It is a figure for demonstrating the state of the hard disk 33 which can be utilized by being initialized according to a file system. It is a figure for demonstrating the partition area | region formed on the hard disk 33, and the partition table which manages this. It is a figure for demonstrating the structure of a directory entry. It is a figure for demonstrating the relationship between FAT and a data area. It is a figure for demonstrating the example of FAT. It is a figure for demonstrating file editing (combination process). It is a figure for demonstrating file editing (combination process). It is a figure for demonstrating file editing (division | segmentation process). It is a figure for demonstrating file editing (division | segmentation process). It is a figure for demonstrating the usage example of the FAT entry of FAT. It is a flowchart for demonstrating file editing (combination process). It is a flowchart for demonstrating file editing (division | segmentation process). It is a flowchart for demonstrating the process in the case of reading the file after editing. It is a figure for demonstrating file editing (partial deletion process (1)). It is a figure for demonstrating file editing (partial deletion process (1)). It is a figure for demonstrating file editing (partial deletion process (2) (sampling process)). It is a figure for demonstrating file editing (partial deletion process (2) (sampling process)). It is a figure for demonstrating file editing (partial deletion process (1)). It is a figure for demonstrating file editing (partial deletion process (2) (sampling process)). It is a figure for demonstrating file editing (application example of a partial deletion process (1)). It is a figure for demonstrating file editing (application example of a partial deletion process (1)). It is a figure for demonstrating generation | occurrence | production of the seek overhead accompanying the process of combining files. It is a figure for demonstrating generation | occurrence | production of the seek overhead accompanying a file hollowing process. It is a flowchart for demonstrating the selection method of the edit system of a file. It is a figure for demonstrating an MPEG stream. 5 is a flowchart for explaining MPEG stream combining processing and division processing. It is a flowchart for demonstrating the partial deletion (1) process of MPEG stream, and the partial deletion (2) (crop-out) process. It is a figure for demonstrating the package management of the data by AV management information. It is a figure for demonstrating AV management information. It is a figure for demonstrating the relationship in the case of implement | achieving this invention by software, and another required program.

Explanation of symbols

DESCRIPTION OF SYMBOLS 11 ... Optical lens part, 12 ... Photoelectric conversion part, 13 ... Camera function control part, 14 ... Image signal processing part, 15 ... LCD (Liquid Crystal Display), 16 ... Image input / output part, 17 ... Audio | voice input / output part, 18 DESCRIPTION OF SYMBOLS ... Audio | voice signal processing part, 19 ... Communication part, 20 ... Control part, 21 ... CPU, 22 ... ROM, 23 ... RAM, 24 ... EEPROM, 31 ... Operation input part, 32 ... Hard disk drive (hard disk device), 33 ... Hard disk , 34 ... Memory card

Claims (6)

Randomly accessible recording medium provided with a detailed information management table for managing detailed information of individual files and a storage area management table for managing the use state of the storage area of each file for each predetermined unit area An information editing device that uses
Receiving means for receiving a partial deletion editing instruction input for deleting a part of a file recorded on the recording medium;
An addition that adds information related to an editing mode as information of the predetermined area unit in the storage area management table corresponding to the editing target position of the target file based on the received partial deletion editing instruction input Means,
An information editing apparatus comprising: update means for updating information in the detailed information management table based on the received editing instruction input. Randomly accessible recording medium provided with a detailed information management table for managing detailed information of individual files and a storage area management table for managing the use state of the storage area of each file for each predetermined unit area An information editing device that uses
Receiving means for receiving an edit instruction input for a file recorded on the recording medium;
Determining means for determining whether or not the editing instruction input received through the receiving means is for instructing combined editing or hollow editing;
When it is determined by the determination means that the edit instruction input is an instruction for combined editing or hollow editing, based on the information on the recording medium, between the data areas at positions separated after editing A calculating means for calculating the distance;
When the distance calculated by the calculating means is smaller than a prescribed value, based on the received editing instruction input, the predetermined area unit in the storage area management table corresponding to the editing target position of the target file Adding means for adding information relating to the editing mode as information of
Updating means for updating information in the detailed information management table based on the received editing instruction input when the distance calculated by the calculating means is smaller than a prescribed value. apparatus. Randomly accessible recording medium provided with a detailed information management table for managing detailed information of individual files and a storage area management table for managing the use state of the storage area of each file for each predetermined unit area An imaging device using
Imaging means for capturing an image of a subject;
Recording means for recording image information captured through the imaging means on the recording medium;
Receiving means for receiving a partial deletion editing instruction input for deleting a part of a file recorded on the recording medium;
An addition that adds information related to an editing mode as information of the predetermined area unit in the storage area management table corresponding to the editing target position of the target file based on the received partial deletion editing instruction input Means,
An image pickup apparatus comprising: an update unit configured to update information in the detailed information management table based on the received edit instruction input. Randomly accessible recording medium provided with a detailed information management table for managing detailed information of individual files and a storage area management table for managing the use state of the storage area of each file for each predetermined unit area An imaging device using
Imaging means for capturing an image of a subject;
Recording means for recording image information captured through the imaging means on the recording medium;
Receiving means for receiving an edit instruction input for a file recorded on the recording medium;
Determining means for determining whether or not the editing instruction input received through the receiving means is for instructing combined editing or hollow editing;
When it is determined by the determination means that the edit instruction input is an instruction for combined editing or hollow editing, based on the information on the recording medium, between the data areas at positions separated after editing A calculating means for calculating the distance;
When the distance calculated by the calculating means is smaller than a prescribed value, based on the received editing instruction input, the predetermined area unit in the storage area management table corresponding to the editing target position of the target file Adding means for adding information relating to the editing mode as information of
An image pickup apparatus comprising: an update unit configured to update information in the detailed information management table based on the received edit instruction input when the distance calculated by the calculation unit is smaller than a specified value. . Randomly accessible recording medium provided with a detailed information management table for managing detailed information of individual files and a storage area management table for managing the use state of the storage area of each file for each predetermined unit area Is a method of editing a file recorded in
A reception step of receiving a partial deletion editing instruction input for deleting a part of the file recorded on the recording medium;
An addition that adds information related to an editing mode as information of the predetermined area unit in the storage area management table corresponding to the editing target position of the target file based on the received partial deletion editing instruction input Steps,
An information editing method comprising: an updating step of updating information in the detailed information management table based on the received editing instruction input. Randomly accessible recording medium provided with a detailed information management table for managing detailed information of individual files and a storage area management table for managing the use state of the storage area of each file for each predetermined unit area Is a method of editing a file recorded in
An accepting step of accepting an edit instruction input for a file recorded on the recording medium;
A determination step of determining whether or not the editing instruction input received in the receiving step is an instruction for combined editing or hollow editing;
In the determination step, when it is determined that the editing instruction input is an instruction for combined editing or hollow editing, based on the information on the recording medium, between the data areas at positions separated after editing A calculation step for calculating a distance;
When the distance calculated in the calculation step is smaller than a specified value, based on the received editing instruction input, the predetermined area unit in the storage area management table corresponding to the editing target position of the target file. As an information, an addition step for adding information related to the editing mode;
An update step of updating information in the detailed information management table based on the received edit instruction input when the distance calculated in the calculation step is smaller than a specified value. .

Images