JP2007133825A - System and method for retrieving photographing position facility, and map data - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To rapidly perform retrieval of a facility in which a photographing position is located. <P>SOLUTION: A system 2 for retrieving a photographing position landmark includes a digital camera 3 and a PC 4. When a photographing unit 5 of the digital camera 3 is operated to perform photographing, a GPS calculation part 10 calculates position data of a current position, and a control part 7 photographed image data in association with the position data in a memory card 8. The CP4 comprises a CPU 11, a ROM 12, a RAM 13 and an LCD 14. THe ROM 12 stores map data divided to a plurality of divided areas at equal intervals with 1° pitch in the parallel direction and 40 minutes (2/3°) in the meridian direction. The map data includes a division area data table, a division area list table, and a landmark data table. The CPU 11 retrieves the map data and selects a landmark of the photographing position based on the position data. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a photographing position facility retrieval system and method for retrieving a facility located at a photographing position, and map data.

  In recent years, a digital camera (for example, a mobile phone with a camera having a GPS function) that uses a GPS (Global Positioning System) positioning system to add and store shooting position data to shot image data has become widespread. ing. Therefore, a technique for specifying a landmark name such as a place name or a building name of a shooting point from position data given to a photograph taken by these cameras has been proposed (see, for example, Patent Document 1 and Patent Document 2). .

  In the portable terminal device, the position information providing system, and the image capturing system disclosed in Patent Document 1, the latitude / longitude of the place name and the facility, the data type, the range polygon (a broken line for representing the shape, and the place name and the facility name are valid ranges) ), And a location information database storing each data of the place name facility name character string. Then, the position information of the shooting point is searched from the position information database based on the latitude and longitude of the shooting point shot by the digital camera, and the landmark name of the shooting point is specified based on the searched information.

In addition, in the camera device and the shooting position information display method disclosed in Patent Document 2, a map is divided into a vertical direction and a horizontal direction, mesh numbers are assigned to a plurality of meshes that are the divided ranges, and landmarks positioned in each mesh Is stored in correspondence with the mesh number. Then, based on the latitude / longitude of the shooting point taken by the camera, the mesh that the shooting point is included in is searched, and the landmark name of the shooting point is specified from the searched mesh.
JP 2003-209886 A Japanese Patent Laid-Open No. 2001-157098

  However, in Patent Document 1, the position information of the shooting point is searched from the position information database based on the latitude and longitude of the shooting point, and a position far from the shooting point (for example, Hokkaido when shooting in Tokyo) ) Is also searched as a search target, and there is a problem that the time required for the search becomes long. Further, in Patent Document 2, when searching for which mesh the shooting point is included in, all meshes are searched as search targets, so there is a problem that the time required for the search becomes long.

  The present invention has been made to solve the above-described problem, and an object thereof is to provide a shooting position facility search system and method, and map data, which can quickly search for a facility where the shooting position is located. To do.

  In order to achieve the above object, a photographing position facility retrieval system according to the present invention includes a photographing means, a position data acquisition means for obtaining position data of a photographing position in accordance with photographing by the photographing means, and a photographing photographed by the photographing means. A digital camera having imaging data storage means for storing image data and imaging position data acquired by the position data acquisition means in association with each other; a plurality of divided areas obtained by dividing the map area at equal intervals in the parallel and meridian directions Map data storage means for storing map data having area data for each of the plurality of area data and facility data of facilities located in each area; and the map data based on the shooting position data And a facility search means for searching facility data of the facility where the imaging position is located. The means includes searching the area data of the divided area including the shooting position among the plurality of divided areas, and then including the shooting position of the facility data provided in the area data obtained by the search. The facility data of the facility is searched. Examples of the map data include map data such as a world map, a Japan map, a Kanto region map, and a Kansai region map. Examples of the facility include an amusement park, a station, and a school.

  The facility data preferably includes facility name data, facility area data, and facility latitude / longitude data. The facility area data preferably stores the facility area as a polygonal area corresponding to the shape of the facility.

  Furthermore, it is preferable that the facility data has facility expansion area data that is larger in all directions than the facility area. Moreover, it is preferable that the said facility data has memorize | stored the data of the inclusion relationship with the other facility located in a facility.

  Furthermore, it is preferable to provide a related data storage unit that stores the captured image data and the facility data searched by the facility search unit in association with each other. Moreover, it is preferable to provide a display means for displaying a search result of the facility search means.

  In addition, the shooting position facility search method of the present invention acquires position data of a shooting position, stores the acquired shooting position data, and based on the shooting position data, map regions in latitude and longitude directions, etc. Facility data of a facility where the photographing position is located from map data having region data of a plurality of divided regions divided into intervals and facility data of a facility provided for each of the plurality of region data and located in each region The facility data provided in the area data obtained by searching after the area data of the divided area including the imaging position among the plurality of divided areas is searched. The facility data of the facility including the shooting position is searched.

  Further, the facility data preferably includes facility name data, facility area data, and facility latitude / longitude data. The facility area data preferably stores the facility area as a polygonal area corresponding to the shape of the facility.

  Furthermore, it is preferable that the facility data has facility expansion area data that is larger in all directions than the facility area. Moreover, it is preferable that the said facility data has memorize | stored the data of the inclusion relationship with the other facility located in a facility.

  Further, the map data of the present invention is map data used when searching facility data of a facility where the photographing position is located based on the position data of the photographing position, and the map area is arranged in the latitude direction and the meridian direction. It has area data of a plurality of areas divided at equal intervals, and facility data of facilities provided for each of the plurality of area data and located in each area.

  The facility data preferably includes facility name data, facility area data, and facility latitude / longitude data. Furthermore, the facility area data preferably stores the facility area as a polygonal area corresponding to the shape of the facility.

  Moreover, it is preferable that the said facility data have the facility expansion area | region data larger in all directions than the area | region of a facility. Furthermore, it is preferable that the facility data stores data on an inclusive relationship with other facilities located in the facility.

  According to the photographing position facility retrieval system of the present invention, the photographing means, the position data obtaining means for obtaining the position data of the photographing position in accordance with the photographing by the photographing means, the photographed image data photographed by the photographing means and the position data obtaining means. A digital camera having shooting data storage means for storing the acquired shooting position data in association with each other; area data of a plurality of divided areas obtained by dividing the map area at equal intervals in the latitude direction and the meridian direction; and a plurality of area data Map data storage means storing map data having facility data of facilities located in each area provided for each; searching facility data of facilities where the shooting position is located from the map data based on the shooting position data And a facility location search system comprising: a facility location search system comprising: After searching the area data of the area, since the facility data of the facility including the shooting position among the facility data provided in the area data obtained by the search is searched, the facility where the shooting position is located, that is, which It is possible to quickly find out if the photo was taken at the facility.

  Moreover, since the facility data includes facility name data, facility area data, and facility latitude / longitude data, it is possible to search for a facility where the shooting position is located even more quickly.

  Furthermore, since the facility area data stores the facility area as a polygonal area corresponding to the shape of the facility, the landmark relating to the shooting position can be retrieved more accurately.

  Further, according to the photographing position facility search method of the present invention, the position data of the photographing position is acquired, the acquired photographing position data is stored, and the map area is set in the latitude direction and the meridian direction based on the photographing position data. Search the facility data of the facility where the shooting position is located from the map data having the region data of the plurality of divided regions divided into intervals and the facility data of the facility provided for each of the plurality of region data and located in each region An imaging position facility searching method for performing imaging of facility data provided in area data obtained by searching for area data of a divided area including an imaging position among a plurality of divided areas. Since the facility data of the facility including the position is retrieved, it is possible to quickly retrieve the facility where the photographing position is located, that is, which facility has photographed.

  Further, according to the map data of the present invention, the map data is used when searching the facility data of the facility where the shooting position is located based on the position data of the shooting position, and the map area is represented by the latitude direction and the meridian direction. The area data of a plurality of areas divided at equal intervals and the facility data of the facilities that are provided for each of the plurality of area data and are located in each area. It is possible to quickly search for whether or not the picture was taken.

  As shown in FIG. 1, a photographing position landmark retrieval system (photographing position facility retrieval system) 2 that implements the present invention includes a digital camera 3 and a personal computer (hereinafter, PC) 4.

  The digital camera 3 includes a known photographing unit (photographing means) 5 including a shutter button and a photographing lens, a GPS unit (position data obtaining means) 6 that measures the current position and acquires the position data, and a control unit 7. A memory card (photographing data storage means) 8 for storing photographed image data is detachably set. The GPS unit 6 includes an antenna 9 and a GPS calculation unit 10. The antenna 9 receives radio waves from GPS satellites orbiting the earth. The received radio wave is sent to the GPS calculation unit 10. The GPS calculation unit 10 stores a calculation program for calculating position data (latitude / longitude) of the current position based on the input radio wave.

  When shooting is performed by operating the shooting unit 5, a program activation signal is output from the control unit 7 to the GPS calculation unit 10, and the GPS calculation unit 10 activates the calculation program and is based on radio waves input from the antenna 9. The position data (latitude / longitude) of the current position is calculated, and the calculated position data is sent to the control unit 7. Then, the control unit 7 stores the captured image data and the position data input from the GPS calculation unit 10 in the memory card 8 in association with each other. Instead of associating the image data with the position data, a position data storage area for storing the position data may be provided in the image data, and the position data may be stored in the position data storage area.

  The PC 4 includes a CPU (facility search means) 11, a ROM (map data storage means) 12, a RAM (related data storage means) 13, and an LCD (display means) 14. The ROM 12 stores approximate Japanese map data. As schematically shown in two dimensions in FIG. 2, this map data includes a range (map area) of a start latitude 30 °, a start longitude 128 °, an end latitude 46 °, and an end longitude 147 ° in the direction of the latitude. This is map data of a map divided into a plurality of divided areas (divided regions) at equal intervals at a pitch of 40 minutes (2/3 °) in the meridian direction.

  The map data includes a divided area data table shown in FIG. 3 and a divided area list table shown in FIG. In the divided area data table, the length of one divided area in the meridian direction (= 1 °), the length of one divided area in the parallel direction (= 2/3 °), the number of divided areas in the meridian direction ( = 19), the number of divided areas in the latitude direction (= 24), the starting point latitude (= 30 °) of the map, and the starting point longitude (= 128 °) of the map are stored.

  In the divided area list table, data of the starting point latitude and starting point longitude of all divided areas is stored. The map data is composed of 456 divided areas from the hatched divided area A (0, 0) in FIG. 2 which is the starting point of the map to the divided area A (18, 23) which is the end point of the map. The numerical values in parentheses indicate the number of divided areas from the divided area A (0, 0) in the meridian direction, and the numerical values on the right side indicate the divided area A ( This indicates the number of divided areas from (0, 0). For example, the divided area A (10, 15) is the tenth divided area from the divided area A (0, 0) in the meridian direction and the fifteenth divided area from the divided area A (0, 0) in the latitude direction.

  2 to 4, in order to avoid cluttering the drawing, map data is arranged so that one divided area is 1 ° in the latitude direction and 40 minutes (2/3 °) in the meridian direction. Although it is divided at equal intervals, it is actually divided at a finer pitch. For example, one divided area is preferably about 10 km in the parallel direction and about 10 km in the meridian direction. Depending on the size, the number of divided areas in the meridian direction and the number of divided areas in the parallel direction are changed.

  As shown in FIG. 5, the map data includes, for each of a plurality of divided areas, ID numbers and landmarks assigned to major landmarks (amusement parks, stations, schools, etc.) located in the divided areas. A landmark data table (facility data) in which data of each section of the name (LM name), landmark area coordinates (LM area coordinates), extended width, rectangular area coordinates, parent data, and child data is stored is included. ing. That is, the LM name section stores LM name data as facility name data, and the LM area coordinate section stores facility area data and LM area coordinate data as facility latitude / longitude data. In the present embodiment, an embodiment in which an α amusement park is located in the divided area A (11, 8) and a β ferris wheel and a γ roller coaster are located in the α amusement park will be described.

  The extension width section stores an extension width (for example, m units) that is expanded in four directions from the LM area coordinates to form rectangular area coordinates. In this embodiment, the expansion width of the α amusement park is set to 5 m, the expansion width of the β ferris wheel is set to 3 m, and the expansion width of the γ roller coaster is set to 3 m. The length of the extended width can be changed as appropriate.

  The α amusement park has ID number = 100, the β ferris wheel has ID number = 101, and the γ roller coaster has ID number = 102. Since the β Ferris wheel and γ roller coaster are located within the α amusement park, the parent-child relationship (inclusion relationship) of these landmarks is that when the α amusement park is the parent, the β ferris wheel and γ roller coaster are the α amusement park. Become a child of the earth. Therefore, the child data section of α amusement park stores “101, 102” which is the ID number of β Ferris wheel and γ roller coaster, and the parent data section of β Ferris wheel and γ roller coaster contains α amusement park. The ground ID number “100” is stored.

  FIG. 6 is a plan view schematically showing the area data of the α amusement park in two dimensions. The α amusement park is a landmark formed in a pentagon shape and indicates the latitude and longitude of the five vertices. Data of each coordinate ((αx1, αy1) (αx2, αy2) (αx3, αy3) (αx4, αy4) (αx5, αy5)) is stored in the LM area coordinate section (see FIG. 5) of the landmark data table. ing. An area surrounded by a line passing through these five apexes is an α amusement park LM area. The area expanded from the α amusement park by the extended width (5m) to the four sides becomes the α amusement park expansion area, and is further formed in a rectangular shape with lines passing through the apex in the latitude and meridian directions of the α amusement park expansion area. This area becomes the α amusement park rectangular area. The data of each coordinate ((Rαx1, Rαy1) (Rαx2, Rαy2) (Rαx3, Rαy3) (Rαx4, Rαy4)) indicating the latitude and longitude of the four vertices of the α amusement park rectangular area is the rectangular area of the landmark data table. It is stored in the coordinate section (see FIG. 5).

  FIG. 7 is a plan view showing area data of the β ferris wheel provided in the α amusement park. The β ferris wheel is a landmark formed in a quadrangular shape, and each coordinate ((βx1, βy1) (βx2, βy2) (βx3, βy3) (βx4, βy4)) indicating the latitude and longitude of the four vertices. Is stored in the LM area coordinate section (see FIG. 5) of the landmark data table. An area surrounded by a line passing through these four vertices is a β Ferris wheel LM area. The area that is extended from the β Ferris wheel by the extended width (3 m) is the β Ferris wheel extended area, and is further formed in a rectangular shape with lines passing through the apex in the latitude and meridian directions of the β Ferris wheel extended area. This area becomes the β Ferris wheel rectangular area. The data of each coordinate ((Rβx1, Rβy1) (Rβx2, Rβy2) (Rβx3, Rβy3) (Rβx4, Rβy4)) indicating the latitude and longitude of the four vertices of the β Ferris wheel rectangular area is a rectangular area of the landmark data table. It is stored in the coordinate section (see FIG. 5).

  FIG. 8 is a plan view showing the area data of the γ roller coaster provided in the α amusement park. The γ roller coaster is a landmark formed in a hexagonal shape, and the latitude and longitude of the six vertices are shown. The data of each coordinate shown ((γx1, γy1) (γx2, γy2) (γx3, γy3) (γx4, γy4) (γx5, γy5) (γx6, γy6)) is the LM area coordinate section (see FIG. 5). An area surrounded by a line passing through these six vertices is a γ roller coaster LM area. The area extended from the γ roller coaster by the extended width (3 m) in all directions becomes the γ roller coaster expansion area, and is further formed in a rectangular shape with lines passing through the vertices in the latitude and meridian directions of the γ roller coaster expansion area. This area becomes the γ roller coaster rectangular area. Data of coordinates ((Rγx1, Rγy1) (Rγx2, Rγy2) (Rγx3, Rγy3) (Rγx4, Rγy4) (Rγx5, Rγy5 (Rγx5, Rγy5)) indicating the latitude and longitude of the four vertices of the γ roller coaster rectangular area Are stored in the rectangular area coordinate section (see FIG. 5) of the landmark data table.

  As described above, the landmark data table stores the LM area coordinate data and the extended width data of each landmark. Accordingly, the landmark data table is larger in all directions than the landmark area. The landmark extension area data is stored.

  As shown in FIG. 1, the PC 4 includes a CPU 11, a RAM 13, and an LCD 14 in addition to the ROM 12. When the memory card 8 is connected to the CPU 11, the image data stored in the memory card 8 and the position data associated with the image data (for example, input position = P1 (latitude = 35.7 °, longitude = 139.7 ° )) Is sent to the CPU 11. In response to the input of position data, the CPU 11 searches the ROM 12 and selects a divided area including the input position from all the divided areas of the map data stored in the ROM 12. The memory card 8 and the CPU 11 are connected by taking out the memory card 8 from the digital camera 3 and inserting it into the memory card insertion slot of the PC 4.

  As a search method for the divided areas, the latitude (= 30 °) of the map is subtracted from the latitude (= 35.7 °) of the input position P1, and the numerical value (= 5.7 °) obtained by subtraction is 1 Divide by the length of the divided area in the direction of the parallel line (= 2/3 °), and round down the decimal point of the numerical value (= 8.55) obtained by the division. The numerical value (= 8) obtained in this way is a numerical value indicating the number of divided areas from the starting point divided area (hatched divided area in FIG. 2) in the latitude direction.

  Also, the starting point longitude (= 128 °) of the map is subtracted from the longitude (= 139.7 °) of the input position P1, and the numerical value (= 11.7 °) obtained by the subtraction is displayed in the meridian direction of the one divided area. Divide by the length (= 1 °) and round off the decimal point of the numerical value (= 11.7) obtained by the division. The numerical value (= 11) thus obtained is a numerical value indicating the number of divided areas from the start point divided area (hatched divided area in FIG. 2) in the meridian direction. When the input position data is the input position P1 (latitude = 35.7 °, longitude = 139.7 °), the eighth from the start point division area in the latitude direction and the eleventh from the start point division area in the meridian direction It becomes a divided area. As described above, since the divided area including the input position is searched by the calculation formula using the input position data (latitude / longitude), the input position data and all the divided areas (456) are compared and input. The time required for the search can be shortened as compared with the search for the divided area including the position.

  When the search for the divided areas is completed, the CPU 11 next searches for landmarks. At this time, the CPU 11 searches for the landmark only in the divided area A (11, 8) searched (selected) as described above. In the present embodiment, a case will be described in which the input position P1 (latitude = 35.7 °, longitude = 139.7 °) is a position in a β ferris wheel in an α amusement park.

  The CPU 11 searches for landmarks in the divided area A (11, 8) and selects a rectangular area (one or more) including the input position P1. In the case of the input position P1, an α amusement park rectangular area and a β ferris wheel rectangular area are selected as search results.

  Next, the CPU 11 calculates the distance L (distance Lα, distance Lβ) from the input position P1 to the α amusement park LM area and the β ferris wheel LM area. First, it is determined whether the input position P1 is a position in each LM area by a polygon internal / external determination method which is a known determination method. Here, when it is determined that the input position P1 is a position in the LM area, the above-described distance L = 0 (zero). On the other hand, when it is determined that the input position P1 is not in the LM area, the shortest distance from the input position P1 to each side forming the LM area is the distance L. The input position P1 is a position in the β ferris wheel in the α amusement park, and the distance L to the α amusement park LM area is Lα1 = 0 (zero), and the distance Lβ1 = 0 to the β ferris wheel LM area.

  Then, the CPU 11 determines whether or not there is a landmark where the distance L = 0. When the CPU 11 determines that there is a landmark with the distance L = 0 (α amusement park, β ferris wheel), the parent data is obtained from the landmark with the distance L = 0 (α amusement park, β ferris wheel). The landmark (β ferris wheel) in which the ID number as parent data is stored in the section is specified, and the landmark (α amusement park) of the ID number stored in the parent data section of the specified landmark (β ferris wheel) (Land) is deleted from the selected landmarks (α amusement park, β ferris wheel) and the landmarks are selected. Thereby, the landmark at the input position P1 (latitude = 35.7 °, longitude = 139.7 °) is selected as the β ferris wheel.

  Next, the CPU 11 outputs the LM name data of the finally selected landmark (β ferris wheel) to the LCD 14 and displays the LM name (β ferris wheel) on the LCD 14 (for example, “ The imaging point is the β Ferris wheel ”), and the image data associated with the input position data and the LM name data of the finally selected landmark (β Ferris wheel) are associated with each other and stored in the RAM 13.

  Further, as shown in FIG. 6, when the input position data (input position P2) is position data indicating the inside of the extended area outside the α amusement park (it is determined that there is no landmark where the distance L = 0) ( In the case of L> 0), the CPU 11 selects the α amusement park as the search result for the landmark having the rectangular area including the input position P2. Next, a distance L from the input position P2 to the α amusement park LM area stored in the LM area coordinate section is calculated and calculated as a distance Lα2. Then, the CPU 11 determines whether or not the distance L (distance Lα2) and the expansion width stored in the expansion width section of the α amusement park in the landmark data table satisfy the relationship of distance L ≦ expansion width. . When the distance L is the distance Lα2, it is determined that the distance L ≦ the expansion width, and the α amusement park is finally selected as a landmark to be selected. Then, the CPU 11 outputs the LM name data of the finally selected landmark (α amusement park) to the LCD 14 and displays the LM name (α amusement park) on the LCD 14 (for example, “ The imaging point is α amusement park ”), and the image data associated with the input position data and the LM name data of the finally selected landmark (α amusement park) are associated with each other and stored in the RAM 13.

  If the input position is P2, and the distance (distance Lα2) ≦ expansion width, the LM name data of the landmark is entered in order from the input position P2 (α amusement park, β ferris wheel, γ roller coaster). , The LM name (α amusement park, β ferris wheel, γ roller coaster) is displayed on the LCD 14 (for example, “the shooting point of this image is α amusement park, β ferris wheel, γ roller coaster The image data associated with the input position data and the LM name data of the landmark (α amusement park, β ferris wheel, γ roller coaster) are associated with each other and stored in the RAM 13. Also good.

  As shown in FIG. 6, when the input position data (input position P3) is position data indicating the inside of the rectangular area outside the extended area, the CPU 11 has a land having a rectangular area including the input position P3. Α amusement park is selected as the search result of the mark. Next, a distance L from the input position P3 to the LM area of the α amusement park stored in the LM area coordinate section is calculated and calculated as a distance Lα3. Then, the CPU 11 determines whether or not the relationship of distance L ≦ extended width is satisfied. When distance L = distance Lα3, it is determined that distance L ≦ expansion width is not satisfied, and α amusement park is not selected as a landmark to be finally selected. That is, it is determined that the input position P3 (shooting point) is not within the landmark. In this case, the CPU 11 outputs data indicating that “the shooting point is not within the main landmark” to the LCD 14, and the LCD 14 indicates that “the shooting point of this image is not within the main landmark”. At the same time, the image data is stored in the RAM 13 in association with data indicating that the shooting point of the image is not within the main landmark.

  The operation of the photographing position landmark retrieval system 2 configured as described above will be described with reference to the flowchart of FIG. When shooting is performed with the digital camera 3 (step (hereinafter referred to as S) 1), a program activation signal is input from the control unit 7, and the GPS calculation unit 10 activates the calculation program to generate radio waves input from the antenna 9. Based on this, position data (latitude / longitude) of the current position is calculated (S2), and the calculated position data is sent to the control unit 7. Then, the control unit 7 stores the captured image data and the position data input from the GPS calculation unit 10 in the memory card 8 in association with each other.

  When the memory card 8 is connected to the CPU 11, the image data stored in the memory card 8 and position data associated with the image data (for example, input position = P1 (latitude = 35.7 °, longitude = 139.7 °)). ) Is sent to the CPU 11 (S3). In response to the input of position data, the CPU 11 searches the ROM 12 and selects a divided area A (11, 8) including the input position P1 from all the divided areas of the map data stored in the ROM 12. (S4).

  When the search and selection of the divided areas are completed, the CPU 11 searches for landmarks in the divided areas A (11, 8), and selects a rectangular area including the input position P1 (S5). In the case of the input position P1, an α amusement park rectangular area and a β ferris wheel rectangular area are selected as search results.

  Next, the CPU 11 calculates the distance L (distance Lα, distance Lβ) from the input position P1 to the α amusement park LM area and the β ferris wheel LM area (S6).

  Then, the CPU 11 determines whether or not there is a landmark where the distance L = 0 (zero) (S7). When the CPU 11 determines that there is a landmark with the distance L = 0 (α amusement park, β ferris wheel), the parent data is obtained from the landmark with the distance L = 0 (α amusement park, β ferris wheel). The landmark (β ferris wheel) in which the ID number as parent data is stored in the section is specified, and the landmark (α amusement park) of the ID number stored in the parent data section of the specified landmark (β ferris wheel) (Land) is deleted from the selected landmarks (α amusement park, β ferris wheel) and the landmarks are selected (S8). Thereby, the landmark including the input position P1 is selected as a β ferris wheel (S9).

  Next, the CPU 11 displays the LM name (β ferris wheel) on the LCD 14 and displays the image data associated with the input position data and the LM name data of the finally selected landmark (β ferris wheel). The data is stored in the RAM 13 in association with each other (S10).

  On the other hand, when the CPU 11 determines whether or not there is a landmark having the distance L = 0 (zero) (S7) (L> 0) (input) At the position P2), the CPU 11 selects the α amusement park as a search result for the landmark including the input position P2.

  Next, the CPU 11 calculates a distance L (= distance Lα2) from the input position P2 to the α amusement park LM area, and determines whether or not the relationship of distance L (distance Lα2) ≦ extended width is satisfied (S11). ). When it is determined that the distance L (distance Lα2) ≦ the expansion width, the landmark at the input position P2 is selected as an α amusement park (S9).

  Then, the CPU 11 displays the LM name (α amusement park) on the LCD 14 and associates the image data associated with the input position data with the LM name data of the finally selected landmark (α amusement park). Is stored in the RAM 13 (S10).

  On the other hand, when it is determined that the relationship of distance L ≦ extended width is satisfied (S11), the determination distance L ≦ extended width is not satisfied (input position P3, distance L = distance Lα3). It is determined that there is no landmark including the position P3 (S12). Then, the CPU 11 displays on the LCD 14 “the shooting location is not within the main landmark” and associates the image data with the data indicating that “the shooting location is not within the main landmark”, and the RAM 13 (S10).

  As described above, since the divided area including the input position is searched by the calculation formula using the input position data (latitude / longitude), the input position data and all the divided areas (456) are compared and input. The time required for the search can be shortened as compared with the search for the divided area including the position.

  Further, the landmark data table includes LM area coordinate data, extended width data, and rectangular area coordinate data, and even when shooting within the extended width range, the input position is searched as a landmark. Even if the accuracy of the map data and GPS calculation function are low and an error occurs, if the error is within the extension range, the error is absorbed and the landmark of the input position is searched correctly. be able to. In addition, if the image data taken outside the landmark (for example, α amusement park) with α amusement park in the background is also taken within the range of the expansion width, the shooting position should be selected as α amusement park. Can do.

  Furthermore, since the CPU 11 displays the LM name finally selected (searched) on the LCD 14, the user can easily grasp the landmark of the shooting position. Further, since the CPU 11 associates the image data associated with the input position data with the LM name data of the finally selected landmark and stores it in the RAM 13, the image data is read after being stored in the RAM 13. It is possible to know the shooting position of the image data only. Further, when the LM name data of a plurality of landmarks are associated with one image data and stored in the RAM 13, after the storage, the user selects one of the plurality of landmarks and selects the selected landmark. The LM name data and the image data may be associated with each other and stored in the RAM 13.

  In the above embodiment, the photographing position landmark search system 2 is configured by the digital camera 3 and the PC 4. However, the present invention is not limited to this, and for example, the CPU 11, ROM 12, RAM 13, and LCD 14 are provided in the digital camera 3. In this case, the photographing position landmark search system 2 can be configured only by the digital camera 3.

  In the above embodiment, the captured image data and the position data input from the GPS calculation unit 10 are stored in the memory card 8, but the present invention is not limited to this, and the digital camera 3 is provided with a RAM. The above data may be stored in this RAM.

  Further, in the above embodiment, the map data is stored in the ROM 12, but the PC 4 may be provided with a communication unit that can be connected to a map data server that stores the map data via the Internet. CPU11 connects to a map data server via a communication part and the internet, and searches the map data in a map data server.

It is a functional block diagram which shows the electric constitution of the imaging position landmark search system which implemented this invention. It is a top view which shows the map area | region of map data. It is explanatory drawing of a division area data table. It is explanatory drawing of a division area list table. It is explanatory drawing of a landmark data table. It is a top view which shows the map area | region of alpha amusement park. It is a top view which shows the map area | region of (beta) ferris wheel. It is a top view which shows the map area | region of (gamma) roller coaster. It is a flowchart which shows the flow of a process of the imaging position landmark search system of this invention.

Explanation of symbols

2 Shooting location landmark search system (shooting location facility search system)
3 Digital camera 4 PC
5 Shooting unit (shooting means)
6 GPS unit (position data acquisition means)
7 Control unit 8 Memory card (shooting data storage means)
11 CPU (facility search means)
12 ROM (map data storage means)
13 RAM (related data storage means)
14 LCD (display means)

Claims (17)

A photographing unit, a position data obtaining unit that obtains position data of a photographing position in accordance with photographing by the photographing unit, and association between photographing image data photographed by the photographing unit and photographing position data obtained by the position data obtaining unit; A digital camera having photographing data storage means for storing
Stores map data having area data of a plurality of divided areas obtained by dividing a map area at equal intervals in the latitude direction and the meridian direction, and facility data provided for each of the plurality of area data and located in each area Map data storage means,
A facility search means for searching facility data of a facility where the shooting position is located from the map data based on the shooting position data, and a shooting position facility search system comprising:
The facility search means searches the area data of the divided area including the imaging position among the plurality of divided areas, and then the imaging position of the facility data provided in the area data obtained by the search. A facility for searching a photographing location, wherein facility data of a facility including the object is searched.   The imaging location facility search system according to claim 1, wherein the facility data includes facility name data, facility area data, and facility latitude / longitude data.   3. The photographing location facility retrieval system according to claim 2, wherein the facility region data stores a facility region as a polygonal region corresponding to the shape of the facility.   The imaging location facility search system according to any one of claims 1 to 3, wherein the facility data includes facility extension region data that is larger in all directions than the facility region.   5. The photographing position facility search system according to claim 1, wherein the facility data stores inclusive data with other facilities located in the facility.   6. The photographing position facility retrieval system according to claim 1, further comprising associated data storage means for associating and storing the photographed image data and the facility data retrieved by the facility retrieval means. .   The imaging position facility search system according to any one of claims 1 to 6, further comprising display means for displaying a search result of the facility search means. Get the position data of the shooting position,
Storing the acquired shooting position data;
Based on the photographing position data, area data of a plurality of divided areas obtained by dividing the map area at equal intervals in the latitude direction and the meridian direction, and facility data of facilities provided for each of the plurality of area data And a shooting location facility search method for searching facility data of a facility where the shooting location is located from map data having:
After searching the area data of the divided area including the imaging position among the plurality of divided areas, the facility of the facility including the imaging position of the facility data provided in the area data obtained by the search A shooting location facility searching method characterized by searching data.   9. The photographing location facility search method according to claim 8, wherein the facility data includes facility name data, facility area data, and facility latitude / longitude data.   10. The photographing location facility retrieval method according to claim 9, wherein the facility region data stores a facility region as a polygonal region corresponding to the shape of the facility.   11. The photographing position facility retrieval method according to claim 8, wherein the facility data includes facility expansion area data that is larger in all directions than the facility area.   12. The photographing position facility searching method according to claim 8, wherein the facility data stores data of an inclusive relationship with other facilities located in the facility. Map data used when searching facility data of a facility where the shooting position is located based on the position data of the shooting position,
A plurality of area data obtained by dividing the map area at equal intervals in the latitude direction and the meridian direction; and facility data provided for each of the plurality of area data and located in each area. Map data.   14. The map data according to claim 13, wherein the facility data includes facility name data, facility area data, and facility latitude / longitude data.   The map data according to claim 14, wherein the facility area data stores a facility area as a polygonal area corresponding to the shape of the facility.   The map data according to any one of claims 13 to 15, wherein the facility data includes facility expansion area data that is larger in all directions than the area of the facility.   The map data according to any one of claims 13 to 16, wherein the facility data stores inclusive data with other facilities located in the facility.

Images