JP6569887B2 - Data file name assigning apparatus and method, and recording medium recording data file name assigning program - Google Patents

Description

  The present invention is a data file name assigning device, which acquires position information from a global positioning network receiving device (hereinafter referred to as GPS) as a file name for storing data input from an input device, and obtains it from GPS. The present invention relates to a data file name assigning apparatus and method for assigning, as a data file name, a place name such as a place name or a facility name of a position where data is created using position information.

  Digital devices that need to manage a large number of data files, such as digital cameras and tablets with built-in digital cameras, mobile phones, and laptop computers, have become widespread. However, the file name in which the image data is stored is given a serial number or date information when the image data is created, thereby giving the file name to the image data and saving the image data. Since there is no relation between the file name and the stored data such as the place name or the facility, it is difficult to guess the recorded contents of the stored data from the assigned file name.

When a wide-area disaster occurs, images of damage taken by a digital camera are displayed on a map, but this does not necessarily mean that an environment where a personal computer or the Internet can be used is maintained. By identifying the place name and facility name from the file name given to the image data, it is possible to quickly make a decision according to the damage situation so that the shooting location of the image can be inferred from the file name only in an environment where the digital camera can be used. It is necessary to have a working environment.

JP 2012-015896 PR Japanese Laid-Open Patent Publication No. 2005-203994 JP 11-203842 A Patent No. 5458411 JP 2009-94769 A

  The problem to be solved is that, for example, in a device such as a digital camera, there are as many captured image data as the number of captured images. It is a work that spends a lot of time managing data files. In addition to image data, the data manager determines the file name for storing portable measuring instrument data such as text recorded using a laptop computer at the construction site, temperature, vibration, and the like. The purpose is to assign a unified data file name using the name of the place where the data is input and the name of the facility.

  The present invention uses the location information received from GPS as the file name for storing the input data, identifies the place such as the name of the place and facility name where the data is input, and uses the name of the specified place, The most important feature is to give the data file name.

  The data file name assigning apparatus and method according to the present invention determines the data file name from the location information obtained from GPS using the name of the place where the computer and the device with the computer are used, such as the name of the place or the name of the facility. By doing so, there is an advantage that the contents of the data can be inferred from the assigned data file name and can be classified by the place name such as the place name or the facility. When there are many data files, assigning a data file name with a unified name can improve work efficiency and shorten data management work time.

FIG. 1 is an explanatory diagram showing the configuration of the data file name assigning apparatus. Example 1 FIG. 2 is an explanatory diagram showing the facility location area data structure. Example 1 FIG. 3 is an explanatory view showing a definition example of the facility position area data. Example 1 FIG. 4 is an explanatory diagram showing a structure in which the effective area is expanded to the plane coordinates. Example 1 FIG. 5 is an explanatory diagram showing a method of searching for facility location area data and determining a location acquired from GPS. Example 1 FIG. 6 is an explanatory diagram showing a data file name assigning process. Example 1 FIG. 7 is an explanatory diagram showing the configuration of a data file name assigning apparatus applied to a digital camera. (Example 2) FIG. 8 is an explanatory diagram showing the structure of effective area data defined by polygons. (Example 2) FIG. 9 is an explanatory diagram showing a structure in which effective area data defined by polygons is developed on a plane. (Example 2) FIG. 10 is an explanatory diagram showing a method for determining whether a position acquired from GPS is included in a facility position area defined by a polygon. (Example 2)

  The data file name assigning device assigns a data file name for storing the input data from the location information acquired from the GPS, using the name of the place where the data file name assigning device is located or the name of a place such as a facility. It was realized.

  The present invention is applied to, for example, a “data file name assigning apparatus 1” as shown in FIG. The “data file name assigning device 1” obtains latitude / longitude, which is position information where the “data file name assigning device 1” exists, from the “data input unit 2” for inputting data and the GPS. Obtained from “information acquisition unit 3”, “facility location region data recording unit 5” in which the latitude and longitude defining the area of the place where the place name and facility name are located, and “location information acquisition unit 3” Input from “Facility position area data search section 4” and “Data input section 2” for searching in which area defined by “Facility position area data recording section 5” latitude and longitude as position information are included. The data input from the “data input unit 2” is stored in the “recording medium 7” using the names assigned to the areas searched by the “facility location area data search unit 4”. Save to 7 ” That determine the data file name and to implement the data storage consists of "data file name giving section 6".

The “data input unit 2” in FIG. 1 is an input device such as a CCD image sensor of a digital camera, for example. Further, it may be a digital recording device for inputting sound. It may be an input device consisting of a pointing device such as a keyboard or mouse used to acquire data by operating a computer. Corresponding to the input data, the input data is “Facilities Location Area Data Search” in FIG. Any device that can output to “4” can be widely applied.

The “location information acquisition unit 3” in FIG. 1 is a GPS device for acquiring location information composed of numerical data of latitude and longitude of a place where the “data file name assigning device 1” exists. Alternatively, the “position information acquisition unit 3” may be a data file stored in a recording medium of a device that outputs position information or an external device. As the device that outputs the position information, the location information recorded in the storage medium of the installed device without using the GPS from the device installed in a specific place is “the facility location area data search unit 4”. Any device may be used as long as it has a function capable of outputting data to.

The “facility location area data recording unit 5” is facility location area data in which the facility location area data shown in FIG. 2 is defined in advance. The “facility location area data recording unit 5” in FIG. 1 may acquire the facility location area data from a server connected via the Internet, and the “facility location area data search unit 4” can refer to the facility location area data. As long as it is in a state, it may take any form. FIG. 2 shows a structure for defining one location by facility location area data. R1 in FIG. 2 defines, as “valid region connection information”, a positive integer including zero indicating the nesting depth indicating the inclusion status of the region. When the nesting depth R1 = 0, it indicates that it is the uppermost area and does not belong to another area. In the case of R1 = n (n> 0), this indicates that the region is included in a region having a nest depth of (n−1).

R2 in FIG. 2 defines the longitude where the place such as the place name or the facility name indicated by the facility position area data exists, and R3 defines the latitude of the place. In the first embodiment, R4 in FIG. 2 defines the radius of a circle centered on the coordinate point (R2, R3) on the XY plane where the X axis is longitude and the Y axis is latitude, and is indicated by a circumscribed rectangle of the circle. Defined area is defined as the facility location area. This indicates that a place such as a place name or a facility name indicated by the facility position area data exists in the facility position area defined by R2, R3, and R4. The effective area data may define a plurality of coordinate points to define an effective area of a polygon. R5 in FIG. 2 defines names corresponding to places such as place names and facility names existing in the facility location area defined by R2, R3, and R4. R6 in FIG. 2 indicates the number stored in the “storage medium 7” in FIG. 1 by defining an integer of 0 as an initial value and using the name of R5 as the data file name.

  FIG. 3 is a definition example of the facility location area data of FIG. 2, and shows the facility location area data defined in advance in the “facility location area data recording unit 5” of FIG. The facility location area data in FIG. 3 shows one facility location area data in one horizontal row. FIG. 3 shows a state where nine facility position area data D1 to D9 are defined. The facility location area data is defined in the order of D1, D2, D3, D4, D5, D6, D7, D8, and D9, and refers to the data in the defined order. In R1 to R6 in FIG. 3, the vertical items correspond to R1 to R6 in the “facility location area data structure” in FIG.

In FIG. 3, R1 defines the depth of nesting that indicates the inclusion state of the facility location area defined by R2, R3, and R4. R2 to R6 use symbols to describe a clear explanation, but are actually defined by numerical values or character strings that define the information shown in FIG. The facility position area data D1 indicates a facility position area that is a place having the name PN1 with a coordinate defined by longitude KD1 and latitude indicated by ID1 as a center coordinate and defined by a circumscribed rectangle of a circle having a radius CR1. Yes.

The radius defined in R4 of the facility location area data in FIG.
CR1>CR2>CR3> CR4,
CR5>CR6>CR7>CR8> CR9
It is also defined as a magnitude relationship between

  FIG. 4 shows a state where the facility location area data defined in FIG. 3 is expanded on the XY plane where the X axis is longitude and the Y axis is latitude. The hatched portion of the rectangular area D3 in FIG. 4 exists outside the rectangular area D2. C3 indicates the center coordinates (KD3, ID3) of D3. When such area data exists, since C3 exists in the rectangular area of D2, D3 is defined as being in the area of D2. The depth of nesting defined in R1 in FIG. 3 indicates the above-described state, the depth of nesting of D2 is defined as 1, the depth of nesting of D3 is defined as 2, and the effective area of D3 is the effective area of D2. It is present within.

  5 acquires the location information GP1 of latitude / longitude from the facility location area data D1 to D9 defined in FIG. 3 and the “location information acquisition unit 3” of FIG. 1, and the X axis is longitude and the Y axis is latitude. The state expanded to the XY plane is shown. The longitude of GP1 is PX, and the latitude of GP1 is PY.

  The “facility position area data search unit 4” in FIG. 1 searches which area of the facility position area data in FIG. 3 in which the position GP1 acquired from the “position information acquisition unit 3” is defined in advance. The size and position of the area defined in FIG. 3 are shown in FIG.

The position GP1 in FIG.
(KD1-CR1) ≦ PX ≦ (KD1 + CR1) and (ID1-CR1) ≦ PY ≦ (ID1 + CR1)
If the above condition is satisfied, it can be determined that GP1 exists in the region D1. The above determination is performed on the facility position area data of D1 to D9.

If it is determined that the position GP1 is outside the area of the facility position area data D5, it is known from the nesting depth of FIG. 3 that D6 to D9 exist in the facility position area of D5. There is no need to determine whether the position GP1 exists in the area for the facility position area data. From this, it is possible to determine whether it exists in the facility position area defined by the facility position area data at high speed by considering the depth of nesting.

The position GP1 exists in the facility position area of D3 and D4, but the nesting depth is both 2 and the same value. In this case, the area where the facility position area is small is determined as the area where GP1 exists. Since the radius of the circle is defined in the “effective area data R4”, the area having the smaller radius has the smaller area of the facility position area. Therefore, from the condition of CR3> CR4, D4 is determined as the facility position area where GP1 exists. it can. Therefore, it can be determined that the position GP1 exists in the facility position area of D1, D2, and D4. If CR3 and CR4 have the same value, an area where the distance between the center coordinate of the facility position area and GP1 is close is determined as an area including GP1. When the distance to the center is the same value, it is determined that the last defined region D4 that satisfies the condition is a region including GP1. When the above determination is performed on the facility position area data D1 to D9, in the definition example of FIG. 5, when the above determination is performed on the facility position areas D1 to D9, the position GP1 is the facility position area data D1. It can be determined that it exists in the area of D2, D3, and D4 and is outside the area of the facility position area data D5, D6, D7, D8, and D9.

The “facility location area data search unit 4” in FIG. 1 has the maximum value of the nesting depth based on the condition of CR1>CR2>CR3> CR4 from the effective area data of the facility location area including the position GP1 in FIG. 1 is added to the number of NO4 that is “number R6 with file name” of D4. The nesting depth values defined in R1 in FIG. 3 are arranged in ascending order from a small value to a large value, and places such as place names and facility names defined in the facility area data D1, D2, and D4 From the name corresponding to the position GP1, the character strings of PN1, PN2, PN4, and NO4 and the data input from the “input unit 2” in FIG. 6 ”.
If the facility location area data searched in the past exists in the storage memory, it is determined by the above method whether the location information acquired from GPS is included in the facility location area saved in the storage memory, and saved in the storage memory. If the position GP1 acquired from the GPS is included in the facility position area, the facility area position area stored in the storage memory without performing the facility position area data search for determining the inclusion status of the area. Is applied as a region in which GP1 is included, and 1 is added to the number of “number of file names assigned” corresponding to R6 in FIG. 2 of the facility region data having the maximum nesting depth. When the previous facility area data is not stored in the storage memory and the position information acquired from GPS is not included in the facility position area stored in the storage memory, the “facility position area data search unit 4” ”, PN1, PN2, PN4, and NO4 are stored in the storage memory and used to determine whether the position information acquired from the next GPS is within the searched facility location area.

The “data file name assigning unit 6” in FIG. 1 acquires the character strings PN1, PN2, PN4, and NO4 input from the “facility location area data search unit 4” and the data input from the “data input unit 2”. A “recording medium 7” in FIG. 1 is a recording medium that stores data input from the “data input unit 2”. The “data file name assigning unit 6” assigns a character string obtained by connecting PN1, PN2, PN4, and NO4 to a file name and a file identifier, and writes and stores the input data as “recording medium 7”. For example, when the file identifier is image data, the file identifier such as bmp or jpg is determined depending on the data format for storing the image data. When PN1 = “JPN”, PN2 = “Tokyo”, PN4 = “Tokyo Station”, NO4 = 1 and the file identifier = “bmp”, “JPN Tokyo-Tokyo Station 0001.bmp” is set. In order to clarify the distinction of names, for example, by inserting a delimiter such as the underline character “_” between PN1 and PN2, between PN2 and PN4, and between PN4 and NO4, “JPN_Tokyo A file name such as “_Tokyo Station_0001.bmp” may be given.

  FIG. 6 is a flowchart showing the data file name assigning process. Data is input in S1. If the input operation is completed in S2, the process is stopped. If the process is not terminated in S2, the process of S3 is performed. In S3, position information is acquired from “GPS13”, and it is determined whether it exists in the previously determined facility position area. If the position information acquired from “GPS13” exists in the previously determined facility position area in S4, the process proceeds to S6. By omitting unnecessary processing in the processing, the processing speed is increased. When the position information acquired from “GPS13” does not exist in the previously determined facility position area, the process of S5 is performed. In S5, the “facility location area data 14” is searched, and the area included in the location information acquired from “GPS13” is searched. The retrieved result is stored in the storage memory in S6. In step S6, 1 is added to the stored number of data file names of the facility location region data stored in S6, and the data is stored in the stored number of data file names of the corresponding facility location region data in “facility location region data 14”. The search result stored in S6 is used as the facility position area determined last time in S3. In S7, the name of the facility location area saved in the storage memory in S6 and the number of saved data file names are used to assign a data file name for saving the data input in S1, and the "data file 15" is stored. Save to the medium and return to S1.

  FIG. 7 shows an example of “a data file name assigning device 16 applied to a digital camera”. The “digital camera 17” is applied as the input unit of the first embodiment. Example 2 shows an example in which the vertex coordinates of a polygon are defined in R4 which is “effective area data” in FIG.

  The “digital camera 17” in FIG. 7 outputs the digital image data captured by the digital camera to the “facility location area data search unit 19”. The “position information acquisition unit 18” is a GPS for acquiring numerical data of latitude and longitude of a place where the “data file name assigning device 16 applied to the digital camera” exists.

The “facility location area data recording unit 20” is facility location area data in which the facility location area data shown in FIG. 2 is defined in advance. As in the first embodiment, R1 in FIG. 2 in the second embodiment defines the nesting depth as an integer. R2 is the longitude that is the center of the facility location area, and R3 is the latitude that is the center of the facility location area. R4 is composed of a plurality of numerical data in which the number of vertices and the vertex coordinates of the polygon that defines the contour of the facility position area are defined.

FIG. 8 shows a structure for defining the number of vertices and vertex coordinates of a polygon in R4 which is “effective area data” in FIG. W in FIG. 8 indicates the width of the facility position area in a state where the facility position area is expanded on the XY plane where the X axis is longitude and the Y axis is latitude, and H indicates the height of the facility position area. AN defines the number of polygon vertices defined as the facility location area. When the number of vertices of the polygon defined as the facility position area is n, AK1 indicates the first longitude of the polygon, and AD1 indicates the first latitude of the polygon. AKn indicates the nth longitude of the polygon, and ADn indicates the nth latitude of the polygon. As in the first embodiment, R5 and R6 define place names such as place names and facility names in R5, and define zero as an initial value in R6.

  FIG. 9 shows the structure of the effective area data shown in FIG. 8. The number of vertices is defined as AN = 6 and a polygon defining six vertices is expanded on the XY plane where the X axis is longitude and the Y axis is latitude. 6 polygons are shown. The vertices of the polygon are P1, P2, P3, P4, P5, and P6, the parentheses indicate the longitude and latitude of P1 to P6, and the black circles indicate the positions of the vertices.

  GP1 in FIG. 9 indicates the position of latitude / longitude which is the position information of “data file name assigning device 16 applied to digital camera” output from “position information acquisition unit 18” in FIG. It shows that the longitude of GP1 is GK1, and the latitude is GD1.

  FIG. 10 shows a method for determining whether GP1 shown in FIG. 9 is present in a region defined by a polygon. The intersection point between the straight line L1 passing through GP1 and parallel to the X axis and the straight line connecting the vertices forming the polygon is calculated. In the example of FIG. 10, the intersection of the straight line P1-P2, the straight line P2-P3, the straight line P3-P4, the straight line P4-P5, the straight line P5-P6, the straight line P6-P1, and the straight line L1 calculate. Intersection coordinates can be calculated by solving a linear equation passing through two points and a simultaneous equation of a straight line passing through one point parallel to the X axis. Since this calculation is a basic calculation method of geometric calculation, detailed description is omitted.

K1, K2, K3, and K4 in FIG. 10 indicate intersections of a straight line L1 that passes through GP1 and is parallel to the X axis and a straight line that connects the vertices that form a polygon. The position of K4 is shown. From the X coordinate of GP1 and the X coordinate of the intersection, the intersection in FIG. 10 is an intersection having X coordinates smaller than GK1, which is the X coordinate of GP1, and is three locations K1, K2, and K3, which is larger than GK1. The intersection having coordinates is one location of K4. When there are one or more intersections at both ends of the point GP1 and the number of intersection points smaller than GK1, which is the X coordinate of GP1, is odd, or the number of intersection points having an X coordinate larger than GK1 is odd, The point GP1 exists inside the polygon, and the point GP1 exists outside the polygon under conditions other than the above. Even when passing through the vertex, since the vertex is the start point or end point of two straight lines of the polygon, if there are two intersections, it can be determined that the point GP1 is inside the polygon. When a polygon side has the same inclination as L1 (a parallel line with L1) and overlaps L1, the above-described condition is satisfied by setting the start point and end point of the polygon side as intersections. The same result can be obtained even if the intersection calculation between the line passing through GP1 and parallel to the Y axis and the polygon is performed. The method of determining whether a point is included in the polygon is a known method in geometry.

Using W and H in FIG. 8, GP1 is centered on the longitude and latitude (R2, R3) shown in FIG. 2, the width in the X-axis direction is W, and the height in the Y-axis direction is H. It is determined whether GP1 is included in the rectangular area. In order to determine whether GP1 is present in a rectangle whose center coordinates are known and whose width and height are known, the vertex coordinates of the rectangle can be calculated from the center coordinates, width W and height H of the rectangle. The maximum and minimum values of the X and Y coordinates of the rectangular vertex are obtained, and the X coordinate of GP1 is within the range of the minimum and maximum X coordinates of the rectangular vertex, and the Y coordinate of GP1 is the rectangular vertex. If the value is within the range between the minimum value of the Y coordinate and the maximum value of the Y coordinate, it can be determined that GP1 is included in the rectangular region. Therefore, the condition that GP1 is included in a rectangular area having (R2, R3) as the central coordinates, the width in the X-axis direction is W, and the height in the Y-axis direction is H is:
(Minimum value of the X coordinate of the vertex constituting the polygon) ≦ GK1 ≦ (Maximum value of the X coordinate of the vertex constituting the polygon) and (Minimum value of the Y coordinate of the vertex constituting the polygon) ≦ GD1 ≦ ( (Maximum Y coordinate of vertices constituting a polygon)
Can be shown. Only when it is included in the rectangular area, unnecessary calculations can be avoided by performing the intersection calculation with the sides of the polygon.

The facility location area defined by the polygon defines the outline of the area. From this, it can be determined that the polygonal area has the maximum nesting depth and is the area including GP1.

  By defining zero for AN of the number of vertices n in FIG. 8 and defining the radius of the effective area to W of the width of the effective area, the circumscribed rectangle of the circle is defined as the facility position area. From this, it is possible to define a polygon and a circumscribed rectangle area of a circle together, so the facility location area can be defined with a small amount of data, and the contour of complicated terrain can be defined by a polygon. Because it can, you can define the exact place name and location of the facility. If the facility location area defined by the circumscribed rectangle and polygon of the circle has the same nesting depth, the area defined by the polygon defines the contour of the place, so it is defined by the polygon. It can be determined that the facility location area that has been set is the area in which GP1 is included. By using the method shown in “Example 1” for the area including GP1, the name corresponding to the place such as the place name or the facility name of the facility position area data satisfying the inclusion condition is concatenated as the name of the place corresponding to the position GP1. The character string and the image data input from the digital camera are output to the “data file name assigning unit 21” in FIG.

The “data file name assigning unit 21” in FIG. 7 is the same as the “data file name assigning unit 6” in FIG. 1, and the “recording medium 22” in FIG. 7 is the same as the “recording medium 7” in FIG. is there. By the method of “Example 1”, it is possible to assign a data file name for storing image data in “recording medium 22”.

  Since the place name and the facility name are given to the data file name, the photo data used for civil engineering work can be managed by the file name. Since there are many models that can take a picture with a digital camera, a smartphone, a tablet, or the like, the photographer can specify the place where the picture was taken only by the file name. Measuring devices such as temperature and vibration record measurement positions in recorded data, and the name of the file to be saved is determined by the measurer. When managing data files, the file name can be determined in the same way even if the measurer is different by assigning the data file name with the location and facility name, so the unified data file It becomes a name and management becomes easy. When a wide-area disaster occurs, images of damage taken by a digital camera are displayed on a map, but this does not necessarily mean that an environment where a personal computer or the Internet can be used is maintained. By identifying the place name and facility name from the file name given to the image data, if the environment can be used with a digital camera, the location where the image was taken is estimated from the file name, making a judgment that is appropriate for the damage situation. It becomes possible to implement quickly.

DESCRIPTION OF SYMBOLS 1 Data file name assignment apparatus 2 Data input part 3 Position information acquisition part 4 Facility position area data search part 5 Facility position area data recording part 6 Data file name assignment part 7 Recording medium 8 Facility position area data structure 9 Facility position area data Example of data definition 10 Structure in which effective area is expanded to plane coordinate 11 Method of searching facility location area data and determining position acquired from GPS 12 Data file name assigning process 13 GPS for acquiring position information
14 Pre-defined facility location area data 15 Recording medium for storing input data 16 Data file name assigning device applied to digital camera 17 Digital camera 18 Location information acquisition unit of data file name assigning device applied to digital camera 19 Digital camera Facility location area data search unit of data file name assigning device applied to 20 Facility location area data recording unit of data file name assigning device applied to digital camera 21 Data file name assigning unit of data file name assigning device applied to digital camera 22 Recording medium of data file name assigning device applied to digital camera 23 Structure of effective area data defined by polygon 24 Structure of expanding effective area data defined by polygon on plane 25 Position acquired from GPS is polygon Defined facility location Way to determine is included in the pass

Claims (3)

Means for inputting data to be stored in a data file, means for acquiring position information where a data file name assigning device exists from GPS, means for recording facility location area data in which place names and facility names are defined in advance, and GPS Search means for specifying the location of the acquired location information from the facility location area data, means for concatenating names such as pre-defined place names and facility names to the searched facility location area data, and providing a data file name A data file name assigning device comprising: means for storing the recorded data in a recording medium with a file name assigned. The search means for specifying the location information acquired from the GPS from the facility location area data determines a nesting state in which the location information acquired from the GPS is included in a predefined facility location area. Item 2. A data file name assigning device according to Item 1. The location information acquired from the GPS is a location such as a place name or a facility name defined in the facility location area data according to the dependency relationship of the included area from the nested state of the facility position area included in the predefined facility position area The data file name assigning device according to claim 1, wherein the data file name is assigned by concatenating the names of the two.

Images