JP2013210684A - Program, device and method for integrating position proximity information - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a technology for allowing integration between position information including time information and proximity information without including the time information.SOLUTION: Proximity information has attributes showing entrance or exit, a generation position of proximity is given to the proximity information, and the proximity information does not include time information. Position information includes the time information. A proximity time set extraction part 11 extracts a proximity time set which is a set of pieces of time information corresponding to the position information whose distance with a generated position is equal to or less than a threshold from position history which is history of the position information for the proximity information in the proximity history. A proximity time estimation part 12 selects the time information to be associated with the proximity information from among the pieces of time information included in the proximity time set so that time corresponding to the respective pieces of proximity information becomes an ascending order, and the total sum of elapsed time from the entrance to the exit becomes minimum or maximum. A history integration part 13 integrates the proximity history and the position history by using the selected time information.

Description

  The present invention relates to a position proximity information integration program, a position proximity information integration device, and a position proximity information integration method for performing position proximity information integration.

  GPS (Global Positioning System) is mounted on various portable information terminals such as mobile phones and smartphones. Thereby, the position history, which is the history of the position information of the person carrying the portable information terminal, can be accumulated as a footprint that the person has moved. A footprint that a person has moved is considered a movement log that is a record of movement.

  On the other hand, the proximity history, which is the history of proximity information obtained by NFC (Near Field Communication), for example, is also considered to be a movement log, although it is discrete. Here, when the portable information terminal held by the user detects the presence of the fixed sensor, information that records the sensor ID of the fixed sensor is referred to as proximity information. For example, a history of approaching or touching a sensor at the time of entry / exit of a building or a ticket gate of a railway is a record of movement of a person although it is skipped. In the proximity history, “entrance” and “entrance” are often paired like a building entrance / exit and a railway ticket gate.

  Since the position history and the proximity history are both movement logs, new information can be obtained if they can be integrated. For example, if the GPS log and the ticket gate history of the railway can be integrated, it can be clarified where the person has moved by the railway, and it can be useful for generating a daily work report for the user. In addition, since the accurate position can generally be known from the proximity history, it is considered useful for correcting the position history.

  Based on the time-series data of the user's location, the user's stationary time zone and moving time zone are classified, the place name and building of the user's location in the stationary time zone are detected, There is known a technology that supports the user's daily report creation by detecting the user's transportation system. It also analyzes time-series information such as the user's position and surrounding voices, estimates the user's behavior from the user's movement speed, movement trajectory, and surrounding noise, and extracts the name of the place where the user is stopped A technique for creating a user action record is known.

JP-A-8-122093 JP-A-10-111877

  The position information generally includes time information. Therefore, if the proximity information includes time information, the position information and the proximity information can be easily integrated by associating the position information having the time information closest to the time information of the proximity information. However, in reality, the proximity information may not include time information.

  For example, as the proximity information, it may be sufficient if the presence / absence of the proximity and the number of times are known, such as the passage history of a railway ticket gate. In this case, time is not required, and time is not included in the proximity information recorded on the portable information terminal or IC card carried by the user.

  For example, consider the travel route shown in FIG. This route is a route that leaves the office, travels from station A to station B by rail, travels to a business destination, travels from station B to station A by rail, and returns to the office. The position information can be obtained sequentially at predetermined time intervals. In this route, proximity information is recorded every time a ticket gate of each station passes, and the proximity history is a passage history of the ticket gates of each station. Further, the positions of the stations A and B can be known in advance.

  In this case, since the proximity information does not include time information, in the integration of the proximity information and the position information, it is assumed that the closest position information in the position information is extracted and associated with each proximity information. However, for example, the position information closest to the station A is associated with both the proximity information at the time of passing the ticket gate and the proximity at the time of passing the return ticket gate, and the proximity information and the position information are correctly associated with each other. I can't. Thus, when the proximity information does not include time information, it is difficult to integrate the proximity history and the position history.

  In one aspect, an object of the present invention is to provide a technique capable of integrating position information including time information and proximity information not including time information.

  In one aspect, the disclosed program causes a computer to function as follows. That is, the program has information about proximity information in a proximity history that is a history of proximity information that has an attribute indicating entry or participation, is given an occurrence position of proximity, and does not include time information to a computer on which the program is installed and executed. , A proximity time set that is a set of time information corresponding to position information whose distance from the generation position is equal to or less than a predetermined threshold is extracted from the position history that is a history of position information including the corresponding time information. The time information associated with the information is such that the time corresponding to each proximity information in the proximity history is in ascending order, and the total elapsed time from entry to entry in the proximity history is minimized or maximized. Processing to select the time information included in the proximity time set and integrate the proximity history and the position history using the selected time information To be executed.

  In one mode, position information including time information and proximity information not including time information can be integrated.

It is a figure which shows the structural example of the position proximity information integration apparatus by this Embodiment. It is a figure which shows the hardware structural example of the computer which implement | achieves the position proximity information integration apparatus by this Embodiment. It is a figure which shows the example of the position log | history by this Embodiment. It is a figure which shows the example of the proximity | contact history by this Embodiment. It is a figure which shows the example of the sensor list by this Embodiment. It is a figure which shows the example of the proximity log | history containing the positional information by this Embodiment. It is a figure which shows the example of the elapsed time by this Embodiment. It is a figure which shows the example of the integration result of the position history and proximity history by this Embodiment. It is a position proximity information integration process flowchart by the position proximity information integration apparatus of this Embodiment. It is a figure explaining the example of a stay point. It is a figure which shows the structural example of the other position proximity information integration apparatus by this Embodiment. It is a figure which shows the example of the stay point log | history by this Embodiment. It is a position proximity information integration process flowchart by the other position proximity information integration apparatus of this Embodiment. It is a figure which shows the example of the further another position proximity information integration process by this Embodiment. It is a figure explaining the example of a movement path | route.

  Hereinafter, the present embodiment will be described with reference to the drawings.

  FIG. 1 is a diagram illustrating a configuration example of a position proximity information integration device according to the present embodiment.

  A position proximity information integration apparatus 10 shown in FIG. 1 performs position proximity information integration, which is integration of position information and proximity information according to the present embodiment. The position proximity information integration device 10 includes a proximity time set extraction unit 11, a proximity time estimation unit 12, a history integration unit 13, a position history storage unit 14, a proximity history storage unit 15, a sensor list storage unit 16, A position proximity integrated history storage unit 17. The position proximity information integration device 10 operates as a server, for example.

  The proximity history storage unit 15 stores a proximity history that is a history of proximity information used for position proximity information integration according to the present embodiment. The proximity history includes a plurality of proximity histories. Proximity information is information that has an attribute indicating entry or participation in a predetermined area such as a station or a building and does not include time information.

  For example, proximity information may be obtained when a mobile information terminal or an IC card carried by the user senses a sensor fixedly installed on the ticket gate and communicates when the user passes the ticket gate of the station. It is recorded on the terminal or IC card. Then, the proximity history is transmitted from the portable information terminal or the IC card to the position proximity information integration device 10 that is, for example, a server via the network. The position proximity information integration device 10 stores the received proximity history in the proximity history storage unit 15. Accordingly, the proximity information is information that records the sensor ID of the sensor when the portable information terminal or IC card held by the user detects the presence of the sensor. The proximity history may be input from a recording medium.

  The sensor list storage unit 16 stores a sensor list used for position proximity information integration according to the present embodiment. The sensor list includes a plurality of sensor information. The sensor is fixedly provided at the entrance or exit of a station or building, and gives proximity location to proximity information. The position of the sensor can be determined accurately. Actually, as described above, the sensor ID is given to the proximity information, thereby giving the position of the sensor that is the proximity generation position. In addition, it is said that proximity | contact is what a portable information terminal and an IC card sense the sensor provided in the entrance or exit of a station or a building.

  For example, when the user passes the ticket gate of the station, the sensor information is transmitted when the mobile information terminal or IC card carried by the user senses a sensor fixedly installed on the ticket gate and performs communication. It is recorded in the information processing terminal provided. Then, the sensor information is transmitted from the information processing terminal to the position proximity information integration device 10 that is a server, for example, via the network. The position proximity information integration device 10 stores the received sensor information in the sensor list storage unit 16. Therefore, the sensor information is information in which communication is recorded when the portable information terminal or IC card held by the user detects the presence of the sensor and performs communication. The sensor information may be input from a recording medium.

  The position history storage unit 14 stores a position history that is a history of position information used for position proximity information integration according to the present embodiment. The position history includes a plurality of pieces of position information. The position information is information representing a position and includes corresponding time information.

  For example, position information is recorded on a portable information terminal or an IC card by periodically acquiring position information from a GPS satellite. Then, the position history is transmitted from the portable information terminal or the IC card to the position proximity information integration device 10 that is, for example, a server via the network. The position proximity information integration device 10 stores the received position history in the position history storage unit 14. The position history may be input from a recording medium.

  The proximity time set extraction unit 11 reads a proximity history as a history of a plurality of proximity information from the proximity history storage unit 15, reads a sensor list from the sensor list storage unit 16, and records a plurality of position information from the position history storage unit 14. The position history is read.

  Here, as will be described later, the proximity information included in the proximity history read from the proximity history storage unit 15 does not include position information indicating the location where the proximity has occurred. Therefore, the proximity time set extraction unit 11 uses the sensor list read from the sensor list storage unit 16 to indicate the position where the proximity occurs with respect to the proximity information included in the proximity history read from the proximity history storage unit 15. Add information. Thereby, position integrated proximity information can be obtained.

  Since the sensor is fixedly provided at the entrance or exit of the station or building, the position of the sensor can be accurately determined. Therefore, by acquiring the position of the sensor corresponding to the sensor ID included in the proximity information from the sensor list read from the sensor list storage unit 16, it is possible to add the proximity occurrence position to the proximity information. As a result, proximity information having an attribute indicating entry or participation and a proximity occurrence position is given and time information is not included.

  Such position integrated proximity information is not read from the proximity history storage unit 15, but is processed to give a position where proximity occurs. The position integrated proximity information may be stored in the proximity history storage unit 15. At this time, the sensor list storage unit 16 can be omitted.

  The proximity time set extraction unit 11 extracts a proximity time set from the position history for the proximity information in the proximity history. The proximity time set is a set of time information corresponding to position information whose distance from the proximity occurrence position is equal to or less than a threshold value. Here, since the proximity information in the proximity history is actually given the proximity generation position, as a result, the proximity information that has an attribute indicating entry or participation and is given a proximity generation position and does not include time information. Information. The threshold can be determined empirically and is predetermined.

  The proximity time estimation unit 12 selects time information associated with the proximity information from time information included in the proximity time set. At this time, the time information associated with the proximity information is such that the time corresponding to each proximity information in the proximity history is in ascending order and the total elapsed time from entry to entry in the proximity history is minimum or maximum. Selected to be.

  The minimum or maximum is determined by the sensor type. For example, when the sensor is a sensor provided at a ticket gate of a station, the total of elapsed time from entry to entry is selected to be the minimum. If the sensor is a sensor provided at the entrance of the building, the total of elapsed time from entry to entry is selected to be the maximum.

  The proximity time estimation unit 12 continues the sum of the elapsed time from entry to entry for all combinations of proximity information that are consecutive in the order of “entrance” and “participation” in the proximity history. It is obtained by calculating the difference in time of proximity information and calculating the sum. At this time, the proximity time estimation unit 12 uses dynamic programming to select time information that minimizes or maximizes the total elapsed time from entry to entry in the proximity history.

  The history integration unit 13 integrates the proximity history and the position history using the selected time information, generates a position proximity information integration history, and stores it in the position proximity integration history storage unit 17. The position proximity integration history storage unit 17 stores the position proximity information integration history integrated by the history integration unit 13.

  FIG. 2 is a diagram illustrating a hardware configuration example of a computer that realizes the inquiry unit according to the present embodiment.

  A computer 1 that implements the proximity time set extraction unit 11, the proximity time estimation unit 12, the history integration unit 13, and the stay point history extraction unit 24 according to the present embodiment illustrated in FIG. 1 includes, for example, a CPU (Central Processing Unit) 2, A memory 3, a storage device 4, a communication device 5, a medium reading / writing device 6, an input device 7, an output device 8, and the like serving as a main memory are provided. The storage device 4 is an external storage device such as an HDD (Hard Disk Drive) or an auxiliary storage device. The medium reading / writing device 6 is, for example, a CD-R (Compact Disc Recordable) drive or a DVD-R (Digital Versatile Disc Recordable) drive. The input device 7 is, for example, a keyboard / mouse. The output device 8 is a display device such as a display, for example.

  Proximity time set extraction units 11 and 21, proximity time estimation units 12 and 22, history integration units 13 and 23, stay point history extraction unit 24 and proximity time set extraction units 11 and 21, proximity time estimation units 12 and 22, history integration The functional units included in the units 13 and 23 and the stay point history extracting unit 24 can be realized by hardware such as the CPU 2 and the memory 3 included in the computer 1 and a software program. A program that can be executed by the computer 1 is stored in the storage device 4, read into the memory 3 at the time of execution, and executed by the CPU 2.

  The computer 1 can also read a program directly from a portable recording medium and execute processing according to the program. The computer 1 can also sequentially execute processing according to the received program every time the program is transferred from the server computer. Further, this program can be recorded on a recording medium readable by the computer 1.

  In the following, a process when the position history shown in FIG. 3 and the proximity history shown in FIG. 4 are integrated to obtain the position proximity integrated history shown in FIG. 8 will be described.

  FIG. 3 is a diagram illustrating an example of a position history according to the present embodiment.

  The proximity time set extraction unit 11 reads the position history from the position history storage unit 14 as shown in FIG. The read position history includes a plurality of position information. For example, position information is acquired from a GPS satellite every second, and is stored as a position history in the acquired order. The position information includes order information, time information, attribute x, and attribute y.

  The order information i represents the position information of the position information in the position history. The position history records position information in the order in which the position information was acquired. The i-th position information is referred to as position information i. Let I be the number of position information in the position history. Here, it is assumed that I = 500.

  The time information indicates the time when the position information is acquired. The times t, x, and y of the position information i are referred to as t (i), x (i), and y (i). For simplicity, the time is expressed as a relative time so that t (1) = 1. As a result, t (i) = i always holds.

  The attribute x and the attribute y are attributes representing the position. For example, when the position information is obtained from a GPS satellite, the attribute x is longitude and the attribute y is latitude. When latitude and longitude are used as attribute x and attribute y, the method for calculating the distance between the two points is different from the Euclidean distance. However, for the sake of simplicity, the distance between the two points can be calculated using the Euclidean distance. To do. The values of attribute x and attribute y are relative values.

  FIG. 4 is a diagram showing an example of the proximity history according to the present embodiment.

  The proximity time set extraction unit 11 reads the proximity history from the proximity history storage unit 15 as shown in FIG. The read proximity history includes a plurality of proximity information. For example, proximity information is recorded in the proximity history in the order in which proximity occurs each time a portable information terminal or IC card carried by the user approaches a sensor provided on a ticket gate or the like. Proximity information includes order information, proximity ID, and entry / exit attributes.

The order information j represents what number of proximity information in the proximity history the proximity information is. The proximity history records proximity information in the order in which the proximity information was acquired. The j-th proximity information is referred to as proximity information j. Let J be the number of proximity information in the proximity history. Here, J = 4
It is.

  The proximity ID represents the ID of the sensor when the portable information terminal or IC card carried by the user senses the sensor and performs communication, and uniquely identifies the sensor. The proximity ID is acquired from the sensor. Therefore, the proximity ID is an ID of a sensor in which a portable information terminal or an IC card is close. For example, when a user passes a ticket gate of a station, the sensor ID of the ticket gate is stored.

  The entry / exit attribute indicates whether the proximity information is “entrance” or “entrance”. The entry / exit attribute is acquired from the sensor. For example, when the user passes a ticket gate of a station, either “participation” or “entrance” is acquired from the sensor of the ticket gate.

  FIG. 5 is a diagram showing an example of a sensor list according to the present embodiment.

  The proximity time set extraction unit 11 reads the sensor list from the sensor list storage unit 16 as shown in FIG. The read sensor list includes a plurality of pieces of sensor information. The sensor information includes a proximity ID, a type, an attribute x, and an attribute y.

  As described above, the proximity ID uniquely identifies the sensor. Therefore, the proximity ID is the ID of the sensor.

  The type indicates the type of the sensor. The type is determined depending on where it is installed. For example, when a sensor is installed at a ticket gate of a station, the type is a ticket gate. If the sensor is installed at the entrance of the building, the type is building entry / exit.

  The attribute x and the attribute y are attributes indicating the position of the sensor. For example, when the position information is obtained from a GPS satellite, the attribute x is longitude and the attribute y is latitude for calculating the distance to the position information. Other values may be used as the attribute x and the attribute y. The values of attribute x and attribute y are relative values. Note that the attribute x and the attribute y of the sensor information may be referred to as an attribute z and an attribute w, respectively.

  FIG. 6 is a diagram illustrating an example of a proximity history including position information according to the present embodiment.

  The proximity history shown in FIG. 4 does not include location information indicating the location where proximity occurred. Therefore, the proximity time set extraction unit 11 generates position integrated proximity information from the proximity history read from the proximity history storage unit 15 using the sensor list shown in FIG.

  For example, in the proximity history shown in FIG. 4, the proximity ID of the proximity information where j = 1 is 001. Therefore, referring to the sensor list shown in FIG. 5, it can be seen that for the sensor with proximity ID 001, the type is a ticket gate, the attribute x is 300, and the attribute y is 200. Thereby, as shown in FIG. 6, position integrated proximity information in which j = 1 can be generated. Similarly, position integrated proximity information can be generated for other proximity information.

  Next, the proximity time set extraction unit 11 extracts a proximity time set from a position history that is a history of position information. As described above, the proximity time set is a set of time information corresponding to position information whose distance from the generation position is equal to or less than a threshold value. Therefore, first, the proximity time set extraction unit 11 obtains the distance between the position and the proximity information.

  The values of the positions x and y of the proximity information j in FIG. 6 are z (j) and w (j). The distance d (i, j) between the position information i and the proximity information j is calculated by the Euclidean distance expressed by the following equation.

  As described above, the position information corresponding to the proximity information j is selected from the position history. The selected position information is required to satisfy the following three conditions 1-3.

  First, condition 1 will be described. Assuming that the correct position information corresponding to the proximity information j is b (j), it is clear that the distance between the correct position information b (j) and the position where the proximity information j is generated is short. Therefore, if an appropriate threshold T can be set, it is considered that d (b (j), j) <T is satisfied. From the above, the condition 1 to be satisfied by the times a (1),..., A (J) is obtained.

(Condition 1)
When the set S (j) = {t (i) | d (i, j) <T} is called the proximity time set S (j), the time a (j) of the correct position information b (j) is S Included in (j).

  Here, K (j) is the number of times included in S (j). S (j) is in ascending order, and the first time of S (j) is indicated by s (j, l).

  Next, condition 2 will be described. It is clear that the position information is recorded in the same order as the proximity information is generated. Therefore, the time a (1),..., A (J) of the correct answer b (j) of the position information corresponding to the proximity information j must be in ascending order. From the above, the condition 2 to be satisfied by the times a (1),..., A (J) is obtained.

(Condition 2)
The time of the correct answer b (j) of the position information corresponding to the proximity information j satisfies a (1) ≦ a (2) ≦ ... ≦ a (J).

  Next, condition 3 will be described. For example, assume that the sensor type is a ticket gate. The action of entering the ticket gate and leaving the ticket gate can be regarded as moving by using the railway. For example, consider a case where after approaching station A, moving away from station A again and then moving to station B. In this case, the first approach to the station A is not related to the passage of the ticket gate, and it is considered that the passage of the station A is the second time the station A is approached. In such a case where the sensor type is a ticket gate, it is considered natural that the movement time is short. Therefore, it is natural that the elapsed time, which is the time from entering the ticket gate to leaving the ticket gate, is short.

  When all the proximity information is obtained from the same type of sensor, “entrance” and “participation” appear alternately. Therefore, if “entrance” and “participation” do not appear, the proximity information that is “entrance” following the proximity information that is “entrance”, and the proximity information that is “entrance” following the proximity information that is “entrance” Is ignored. As a result, the odd-numbered proximity information becomes “entrance”, and the even-numbered proximity information becomes “participation”.

  In this case, “the elapsed time is short” is expressed by the following Equation 1. Here, J is an even number. This is condition 3 that the times a (1),..., A (J) should satisfy. In condition 3, Equation 1 can be rewritten as Equation 2.

  The proximity time set extraction unit 11 selects the time of the proximity information j from the proximity time set by obtaining times a (1),..., A (J) that satisfy the above three conditions 1 to 3.

  Times a (1),..., A (J) satisfying the above three conditions 1 to 3 can be extracted by various methods. For example, dynamic programming can be used for faster extraction. Therefore, in this example, the proximity time set extraction unit 11 extracts time a (1),..., A (J) satisfying the above three conditions 1 to 3 using dynamic programming. Dynamic programming is a method of recording a solution obtained by calculating a small subproblem in a memory and resolving the problem while reusing the recorded results to solve a larger problem.

  In the following, dynamic programming is described. The above equation 2 can be rewritten into the following equations 3 and 4. Equation 3 corresponds to a partial problem.

  D (j, l) in Equation 3 can be calculated in polynomial time O (JK ^ 2) according to Equation 5 and Equation 6 below. Here, let K be the maximum value of K (j).

  In Equation 6, the value of k that minimizes the value in curly braces {} used when calculating D (j, l) is E (j, l). At this time, satisfying Condition 2 means satisfying s (j, l)> = s (j-1, E (j, l)). Therefore, in Equation 6, k is selected under the condition that s (j, l) <= s (j-1, k) is satisfied.

  Next, how to obtain the times a (1), ..., a (J) will be described.

  If l which minimizes Equation 4 is expressed as l (J), a (J) = s (J, l (J)). In the same manner, l (j-1) = E (j, l (j)) can be sequentially calculated while subtracting j. At this time, since a (j) = s (j, l (j)), time a (1),..., A (J) can be obtained by calculation.

  The procedure for obtaining the times a (1),..., A (J) by the above procedure will be described with reference to FIG. 7 and FIG.

  First, the proximity time set S (1),..., S (4) is obtained from FIGS. Here, assuming that the time information extraction threshold T = 300, the following proximity time sets S (1),..., S (4) are obtained. At this time, K (1) = K (2) = K (3) = K (4) = 100. The numerical values of the proximity time sets S (1),..., S (4) shown below are examples.

  Next, D (j, l) and E (j, l) are sequentially calculated for the proximity time sets S (1),..., S (4) according to Equations 5 and 6.

  When j = 1, D (j, l) and E (j, l) are obtained as follows.

  When j = 2, D (j, l) and E (j, l) are obtained as follows.

  When j = 3, D (j, l) and E (j, l) are obtained as follows.

  When j = 4, D (j, l) and E (j, l) are obtained as follows.

  FIG. 7 is a diagram illustrating an example of elapsed time according to the present embodiment.

  FIG. 7 shows the calculation results of D (j, l) and E (j, l) according to Equations 5 and 6 described above. In FIG. 7, j is the order information of the proximity information, and l is a value determined by Equation 5. A list of D (j, l) and E (j, l) is shown in FIG. In FIG. 7, the value outside the parentheses represents the value of D (j, l), and the value within the parentheses represents the value of E (j, l).

  FIG. 8 is a diagram illustrating an example of a result of integrating the position history and the proximity history according to the present embodiment.

  For example, assume that the following results are obtained by the above calculation. For example, if the minimum value in D (4, l) is found when l = 51, then l (4) = 51 and a (4) = s (4,51) = 401 Is required. For example, if it is found that l (3) = E (4, l (4)) = 100, it is obtained that a (3) = s (3,100) = 350. Similarly, for example, it is required that l (2) = E (3, l (3)) = 1 and a (2) = s (2,1) = 201. Similarly, it is required that, for example, l (1) = E (2, l (2)) = 50 and a (1) = s (1,50) = 150. Such calculation results are obtained in this order.

  Therefore, according to the example of FIG. 8, the time a (j) of the proximity information j = 1, 2, 3, 4 is estimated to be 150, 201, 350, 401. The calculated value is an example. As a result, FIG. 8 can be obtained by combining lines 1, 2, 3, and 4 of the position integrated proximity history shown in FIG. 6 with lines 150, 201, 350, and 401 of the position history shown in FIG. The position history shown in FIG. 3 does not show the 150th line, but it is assumed that position information exists. Thereby, the proximity history and the position history can be integrated.

  FIG. 9 is a flowchart of position proximity information integration processing by the position proximity information integration device of this embodiment.

  The position proximity information integration device 10 receives a position history from a portable information terminal or IC card carried by the user (step S10). The received position history is stored in the position history storage unit 14.

  The position proximity information integration apparatus 10 receives a proximity history from a portable information terminal or IC card carried by the user (step S11). The received proximity history is stored in the proximity history storage unit 15.

  The position proximity information integration device 10 integrates the sensor information and position information of the sensor list read from the sensor list storage unit 16 with the proximity information of the proximity history read from the proximity history storage unit 15 (step S12). Thereby, a position integrated proximity history is generated. Prior to steps S10 and S11, the sensor list is received by the position proximity information integration device 10 from the information processing terminal including the sensors and stored in the sensor list storage unit 16. In step S12, the sensor list is stored in the sensor list storage unit 16. Read out.

  In the position proximity information integration device 10, the proximity time set extraction unit 11 extracts a proximity time set for the proximity information (step S13). Thereafter, the proximity time set extraction unit 11 determines whether the extraction of the proximity time set has been completed for all pieces of proximity information (step S14). If the extraction of the proximity time set has not ended (NO in step S14), the proximity time set extraction unit 11 returns to the process of step S13 and proceeds to the process for the next proximity information.

  When the extraction of the proximity time set is completed (YES in step S14), the proximity time estimation unit 12 estimates the time of the proximity information using dynamic programming (step S15). Thereafter, the proximity time estimation unit 12 determines whether or not the application of the dynamic programming has been completed for all position information included in the proximity time set at that time (step S16). If the application of the dynamic programming has not been completed (NO in step S16), the proximity time estimation unit 12 returns to the process of step S15 and moves to the process for the next position information.

  When the application of the dynamic programming is finished (YES in step S16), the proximity time estimation unit 12 determines whether the time estimation has been completed for all proximity information (step S17). When the time estimation has not ended (NO in step S17), the proximity time estimation unit 12 returns to the process of step S15 and proceeds to the process for the next proximity information.

  When the time estimation is completed (YES in step S17), the history integration unit 13 integrates proximity information into the position history based on the estimated time (step S18). Thereafter, the history integration unit 13 determines whether the integration with the position history has been completed for all proximity information (step S19). If the integration has not ended (NO in step S19), the history integration unit 13 returns to the process of step S18 and moves to the process for the next proximity information. When the integration is completed (YES in step S19), the history integration unit 13 stores the position proximity integration history as a result of the processing in the position proximity integration history storage unit 17, and ends the processing.

  The above is an explanation of an example in which the type in the sensor list is a ticket gate. Since the type in the sensor list represents the proximity type, it will be referred to as the proximity type below.

  When the proximity type is a ticket gate, the movement from the “entry” to the “participation” of the proximity information is a movement. For this reason, in the expressions 1 to 6, by calculating the times a (1),..., A (J) that minimize the elapsed time from “entry” to “entrance”, the proximity history and the position history Can be integrated.

  On the other hand, when the type of proximity is building entry / exit, from “entry” to “entrance” is staying in the building. Therefore, the time a (1),..., A (J) that maximizes the elapsed time from “entry” to “entrance” can be obtained from Equations 1 to 6. Therefore, when the proximity type is building entry / exit, the elapsed time from “entrance” to “entrance” is maximized by replacing the function min with the function max in the above-described formulas 1 to 6. Times a (1),..., A (J) are obtained. Thereby, even when the type of proximity is building entry / exit, the proximity history and the position history can be integrated.

  As described so far, in the position proximity information integration according to the present embodiment, a proximity time set is generated, and the position history and the proximity history are integrated using the generated proximity time set. Thereby, it is possible to integrate the proximity history not including time information with the position history including time information.

  In the following, a stay point history that is a stay point history that is a non-moving time zone is extracted, a proximity time set is generated from the extracted stay point history, and a position history and a proximity history are generated using the generated proximity time set. An example of integrating these will be described.

  FIG. 10 is a diagram illustrating an example of a stay point.

  For example, consider the travel route shown in FIG. This route is a route that leaves the office, travels from station A to station B by rail, travels to a business destination, travels from station B to station A by rail, and returns to the office. In this process, for example, it stays near the station A, stays near the station B, and stays near the business trip destination.

  The stay point is a time zone during which no movement occurs. The staying point is derived from the fact that, for example, when the vehicle is in the vicinity of the ticket gate, or when waiting for the train at the platform, a time zone that does not move before and after passing the ticket gate occurs. Accordingly, one stay point includes a plurality of pieces of position information. Conversely, when multiple location information is represented by a single stay point, the number of stay points can be greatly reduced compared to the number of location information, and position information and proximity information can be integrated at high speed. be able to. In addition, movement by train or walking is not extracted as a stay point from the beginning, and as a result, it is not included in the proximity time set, so the proximity history and position history can be integrated more accurately.

  FIG. 11 is a diagram illustrating a configuration example of another position proximity information integration device according to the present embodiment.

  The position proximity information integration device 20 includes a proximity time set extraction unit 21, a proximity time estimation unit 22, a history integration unit 23, a stay point history extraction unit 24, a position history storage unit 25, and a proximity history storage unit 26. , A sensor list storage unit 27, and a position proximity integration history storage unit 28. The position proximity information integration device 20 operates as a server, for example.

  The position proximity information integration device 20 has basically the same configuration as the position proximity information integration device 10, but differs in that it includes a stay point history extraction unit 24. Therefore, the stay point history extracting unit 24 will be mainly described. The processing executed by the proximity time set extraction unit 21, the proximity time estimation unit 22, and the history integration unit 23 will be described with reference to FIG. The position history stored in the position history storage unit 25 is the same as the position history stored in the position history storage unit 14, and the proximity history stored in the proximity history storage unit 26 is the same as the proximity history stored in the proximity history storage unit 51. Yes, the sensor list stored in the sensor list storage unit 27 is the same as the sensor list stored in the sensor list storage unit 16.

  The stay point history extraction unit 24 extracts a stay point history that is a stay point history by extracting a stay point from position information included in the position history based on the position history. The stay point history includes, for example, a plurality of stay points. One staying point is information representing a plurality of pieces of position information collectively, and has the same data format as the position information.

  The stay point history extraction unit 24 generates a proximity time set using the stay point history, and sets the time information associated with the proximity information in the time information corresponding to the location information of the stay point history included in the proximity time set. Select from. Thereby, the stay point history and the proximity history are associated with each other. At this time, as described above, the time information is selected so as to satisfy the three conditions 1 to 3.

  First, the stay point history extraction unit 24 obtains a stay point history from position information included in the position history using, for example, a piece-wise constant approximation method. Here, the piece-wise constant approximation method can be known from, for example, “I. LazarIDis and S. Mehrotra. Capturing sensor generated time series with quality guarantees. In ICDE 2003”.

  Next, the stay point history extraction unit 24 replaces the stay point with the same data format as one piece of position information in order to generate a proximity time set using the stay point. For this reason, the stay point history extraction unit 24 replaces one value for each stay point for each attribute. For example, an average value is obtained for each attribute of time, x, and y, and each attribute of the stay point is replaced with the obtained average value. For example, if the B-th position information to the E-th position information are extracted as stay points, the time, x, and y attribute values can be replaced by the following expressions.

  The time attribute may be replaced by adopting the minimum value or the maximum value. The information after replacement is called dwell point information.

  The stay point history extraction unit 24 can generate a stay point history including a plurality of stay point information by executing the above processing for each stay point. For example, when ten stay points can be extracted from the position history of FIG. 3, a stay point history as shown in FIG. 12 can be obtained. The stay point history is stored, for example, in a stay point history storage unit.

  FIG. 12 is a diagram showing an example of the stay point history according to the present embodiment.

  The stay point history includes a plurality of stay point information. For example, the stay point information includes order information, time information, attribute x, and attribute y. The order information i represents the number of stay point information in the stay point history. In the stay point history, for example, the stay point information is recorded in the order in which the position information based on the stay point information is acquired. The time information indicates a time representative of the stay point information, and is, for example, the average value described above. The attribute x and the attribute y are attributes representing the position of the staying point, and are, for example, the above average values.

  The stay point information has the same data format as the position information. Therefore, the stay point history has the same data format as the position history. As a result, the position history can be replaced with the stay point history, and the position information can be replaced with the stay point information. Thereby, the proximity history and the position history can be integrated.

  FIG. 13 is a flowchart of position proximity information integration processing by another position proximity information integration device according to the present embodiment.

  The position proximity information integration device 20 receives a position history from a portable information terminal or IC card carried by the user (step S20). The received position history is stored in the position history storage unit 25.

  The position proximity information integration device 20 receives a proximity history from a portable information terminal or IC card carried by the user (step S21). The received proximity history is stored in the proximity history storage unit 26.

  The position proximity information integration device 20 integrates the position information of the sensor list read from the sensor list storage unit 27 with the proximity information of the proximity history read from the proximity history storage unit 26 (step S22). An integrated proximity history is generated. Prior to steps S20 and S21, the sensor list is received by the position proximity information integration device 20 from the information processing terminal including the sensors and stored in the sensor list storage unit 27. In step S22, the sensor list is stored in the sensor list storage unit 27. Read out.

In the position proximity information integration device 20, the stay point history extracting unit 24 extracts stay point history by extracting stay point information from the position information (step S23).
The proximity time set extraction unit 21 extracts a proximity time set for the proximity information using the stay point history (step S24). Thereafter, the proximity time set extraction unit 21 determines whether the extraction of the proximity time set has been completed for all pieces of proximity information (step S25). If the extraction of the proximity time set has not ended (NO in step S25), the proximity time set extraction unit 21 returns to the process of step S24 and proceeds to the process for the next proximity information.

  When the extraction of the proximity time set is completed (YES in step S25), the proximity time estimation unit 22 estimates the time of the proximity information using dynamic programming (step S26). Thereafter, the proximity time estimation unit 22 determines whether the application of the dynamic programming has been completed for all the stay point information included in the proximity time set at that time (step S27). If the application of the dynamic programming has not been completed (NO in step S27), the proximity time estimation unit 22 returns to the process of step S26 and moves to the process for the next position information.

  When the application of the dynamic programming is completed (YES in step S27), the proximity time estimation unit 22 determines whether the time estimation has been completed for all proximity information (step S28). When the time estimation is not completed (NO in step S28), the proximity time estimation unit 22 returns to the process of step S26 and proceeds to the process for the next proximity information.

  When the time estimation ends (YES in step S28), the history integration unit 23 integrates proximity information into the position history based on the estimated time (step S29). Thereafter, the history integration unit 23 determines whether the integration with the position history has been completed for all proximity information (step S30). If the integration has not ended (NO in step S30), the history integration unit 23 returns to the process of step S28 and moves to the process for the next proximity information. When the integration is completed (YES in step S30), the history integration unit 23 stores the position proximity integration history as a result of the processing in the position proximity integration history storage unit 28, and ends the process.

  As described so far, in the position proximity information integration of the present embodiment, the stay point history is generated, and the position history and the proximity history are integrated using the generated stay point history. Thereby, it is possible to integrate the proximity history not including time information with the position history including time information.

  In the following, a case will be described in which the proximity information type is not one type and the proximity history includes a plurality of types of proximity information as described above.

  FIG. 14 is a diagram illustrating an example of still another position proximity information integration process according to the present embodiment.

  For example, it is assumed that a sensor list including the proximity history shown in FIG. 14A and the proximity type shown in FIG. 14B is given. In this case, the proximity history includes a plurality of types of proximity information such as “ticket gate” and “building entry / exit”.

  In this case, for each type of proximity, the elapsed time from “entrance” to “entrance” is obtained, and the elapsed time is multiplied by a predetermined coefficient to obtain the total elapsed time. Therefore, the position / proximity information integration device 10 or 20 determines the pair of all the proximity information pairs in which “entrance” and “participation” in the same proximity type are consecutive in this order in the proximity history. After calculating the time difference of the proximity information, and multiplying the obtained difference by the proximity coefficient, the sum of the differences is obtained. The proximity coefficient is determined according to whether the proximity type “entry” to “entry” can be regarded as movement or stay. The proximity coefficient is “−1” when it can be regarded as movement, and “1” when it can be regarded as staying.

  For example, in the case shown in FIGS. 14A and 14B, the proximity type of the proximity information of j = 1 is a ticket gate, and its entry / exit attribute is “entrance”. Therefore, “entrance” corresponding to this entrance / exit attribute “entrance” is considered to be proximity information in which the proximity type is the same at the ticket gate and j = 4. Similarly, the proximity type of the proximity information in which j = 2 is building entry / exit, and its entry / exit attribute is “entrance”. Therefore, “entrance” corresponding to this entrance / exit attribute “entrance” is considered to be proximity information of j = 3 in which the type of proximity is the same for entrance and exit of the building.

  Therefore, it is appropriate to calculate the elapsed time separately for the proximity information j = 1 and proximity information j = 4, and the proximity information j = 2 and the proximity information pair j = 3. is there. Also, the proximity coefficient, which is a coefficient determined according to the type of proximity, is “1” when representing movement from “entrance” to “participation” for various types, and is “−1” when representing stay. This is because when the type from “entrance” to “participation” represents movement, the shorter the elapsed time, the better. When the type from “admission” to “participation” represents residence, the longer the elapsed time, the better. Represent. Therefore, when the type of proximity is a ticket gate, since “entrance” to “participation” represents movement, the sum of elapsed time is minimized. Also, when the type of proximity is building entry / exit, since “entrance” to “participation” indicate stay, the total elapsed time is maximized.

  From the above, Equation 2 described above can be rewritten as Equation 7. Note that I (j) is the proximity ID of the jth proximity information, and w (I (j)) is the proximity coefficient of the proximity ID. The proximity coefficient is determined by the type of proximity shown in FIG. Also, e (j) is the j-th proximity information entry / exit attribute. For example, from FIG. 14A, the proximity ID of the first proximity information is 001, and from FIG. 14B, the type of proximity ID = 001 is a ticket gate. Therefore, w (I (1)) = 1. Further, from FIG. 14A, e (1) = input.

  Similarly, Expression 3, Expression 5, and Expression 6 can be rewritten as Expression 8, Expression 9, and Expression 10.

  By calculating the times a (1),..., A (J) according to these equations, the proximity history and the position history can be integrated.

  As described above, in the position proximity information integration according to the present embodiment, the position history and the proximity history are integrated for a plurality of types of proximity information. This makes it possible to integrate proximity histories that do not include a plurality of types of time information with position histories that include time information.

  Although the present embodiment has been described above, the present invention can naturally be modified in various ways within the scope of the gist thereof.

  For example, in the present embodiment, an example is shown in which the proximity history includes proximity information having an attribute indicating entry or participation, but the present invention is not limited to this. For example, the proximity history may include proximity information that does not have an entry / exit attribute indicating entry or exit.

  At this time, the position / proximity information integration device 10 or 20 sets the odd-numbered proximity information in the proximity history as proximity information having an “entry” attribute, and the even-numbered proximity information as proximity information having an “entry” attribute. Select time information associated with proximity information. This is because when the types in the sensor list are the same, that is, when the types of proximity information are the same, “entrance” and “entrance” are paired, and the odd number is “entrance”. This is because there is a high possibility that the even number is "participation". Thereby, it is possible to integrate the proximity history not including time information with the position history including time information.

DESCRIPTION OF SYMBOLS 10, 20 Position proximity information integration device 11, 21 Proximity time set extraction unit 12, 22 Proximity time estimation unit 13, 23 History integration unit 14, 25 Position history storage unit 15, 26 Proximity history storage unit 16, 27 Sensor list storage unit 17, 28 Position proximity integrated history storage unit 24 Residence point history extraction unit

Claims (7)

Computer
For the proximity information in the proximity history that is a history of proximity information that has an attribute indicating entry or participation and is given a proximity occurrence position and does not include time information, from the position history that is the history of position information including the corresponding time information, Extracting a proximity time set that is a set of time information corresponding to position information whose distance from the generation position is equal to or less than a predetermined threshold;
The time information associated with the proximity information is such that the time corresponding to each proximity information in the proximity history is in ascending order, and the total elapsed time from entry to entry in the proximity history is minimum or maximum. So as to select from the time information included in the proximity time set,
A position proximity information integration program for executing a process of integrating the proximity history and the position history using the selected time information. In the process of selecting time information associated with the proximity information, dynamic programming is used to select time information that minimizes or maximizes the total elapsed time from entry to entry in the proximity history. The position proximity information integration program according to claim 1, wherein: In addition to the computer,
Based on the position history, a process for extracting a stay point history that is a stay point history that is a non-moving time zone is executed,
In the process of selecting the time information associated with the proximity information, the proximity time set is generated using the stay point history, and the time information associated with the proximity information is set as each proximity information in the proximity history. Corresponding to the location information of the staying point history included in the proximity time set so that the corresponding times are in ascending order and the total elapsed time from entry to entry in the proximity history is minimum or maximum The position proximity information integration program according to claim 1, wherein the position proximity information integration program is selected from time information. The proximity history includes a plurality of types of proximity information,
In the process of selecting time information associated with the proximity information, for each type, obtain an elapsed time from entry to entry, and obtain the sum by multiplying the elapsed time by a predetermined coefficient. The position proximity information integration program according to any one of claims 1 and 3. The proximity history includes proximity information having no attribute indicating entry or participation,
In the process of selecting time information associated with the proximity information, odd-numbered proximity information in the proximity history is set as proximity information having an entry attribute, and even-numbered proximity information is set as proximity information having an entry attribute. The position proximity information integration program according to claim 1, wherein the position proximity information integration program is performed. For the proximity information in the proximity history that is a history of proximity information that has an attribute indicating entry or participation and is given a proximity occurrence position and does not include time information, from the position history that is the history of position information including the corresponding time information, A proximity time set extraction unit that extracts a proximity time set that is a set of time information corresponding to position information whose distance from the occurrence position is equal to or less than a predetermined threshold;
The time information associated with the proximity information is such that the time corresponding to each proximity information in the proximity history is in ascending order, and the total elapsed time from entry to entry in the proximity history is minimum or maximum. A proximity time estimation unit that selects from time information included in the proximity time set,
A position proximity information integration device, comprising: a history integration unit that integrates the proximity history and the position history using the selected time information. Computer
For the proximity information in the proximity history that is a history of proximity information that has an attribute indicating entry or participation and is given a proximity occurrence position and does not include time information, from the position history that is the history of position information including the corresponding time information, Extracting a proximity time set that is a set of time information corresponding to position information whose distance from the generation position is equal to or less than a predetermined threshold;
The time information associated with the proximity information is such that the time corresponding to each proximity information in the proximity history is in ascending order, and the total elapsed time from entry to entry in the proximity history is minimum or maximum. So as to select from the time information included in the proximity time set,
Using the selected time information, a process of integrating the proximity history and the position history is executed.

Images