Abstract: A method includes: acquiring, from a store terminal via a network, limited product information indicating a limited product for which a time available for sale in one branch store corresponding to the store terminal is limited; acquiring, from a communication terminal of a user via the network, i) a request for a purchase menu of affiliated stores and ii) a branch store identifier (ID) specifying one branch store corresponding to a device ID specifying a beacon signal transmitter disposed in the one branch store; generating, based on the limited product information, the request for the purchase menu, and the branch store ID, privileged purchase menu information corresponding to the one branch store; and outputting the privileged purchase menu information to the communication terminal.

Abstract: A three-dimensional data encoding method includes: calculating a prediction residual that is a difference between geometry information of a three-dimensional point included in point cloud data and a predicted value; quantizing the prediction residual using a first quantization parameter; and generating a bitstream including (i) first information indicating the prediction residual quantized, (ii) second information indicating a second quantization parameter, (iii) third information indicating a first difference between the second quantization parameter and the first quantization parameter, (iv) fourth information indicating a first bit count of the first information, and (v) fifth information indicating a second bit count of the fourth information.

Abstract: A picture coding method includes: performing a first derivation process for deriving a first merging candidate which includes a candidate set of a prediction direction, a motion vector, and a reference picture index for use in coding of a current block; performing a second derivation process for deriving a second merging candidate; selecting a merging candidate to be used in the coding of the current block from among the first and second merging candidates; and attaching an index for identifying the selected merging candidate to the bitstream; wherein the first derivation process is performed so that a total number of the first merging candidates does not exceed a predetermined number, and the second derivation process is performed when the total number of the first merging candidates is less than a predetermined maximum number of merging candidates.

Abstract: A three-dimensional data encoding method includes: performing motion compensation on a plurality of encoded point clouds; merging the plurality of encoded point clouds that have been motion compensated to generate a reference point cloud; generating an N-ary tree structure of a current point cloud, where N is an integer greater than or equal to 2; and encoding the N-ary tree structure of the current point cloud using the reference point cloud.

Abstract: A beacon signal transmitter is disposed in a store. A first communication terminal within a reception range of a beacon signal transmitted from the beacon signal transmitter receives the beacon signal. The first communication terminal receives a push notification corresponding to the store from a store management system. The first communication terminal issues, based on the push notification, a request for a purchase menu corresponding to the store. Based on limited product information and the request for the purchase menu, privileged purchase menu information in which a limited product indicated by the limited product information is added to the purchase menu is generated. The privileged purchase menu information is output to the first communication terminal.

Abstract: A three-dimensional data encoding method is a three-dimensional data encoding method of encoding three-dimensional points, and includes: determining a predicted value, based on geometry information of one or more candidate points among encoded three-dimensional points; encoding a prediction residual which is a difference between the predicted value and geometry information of a current three-dimensional point to be encoded among the three-dimensional points; generating a bitstream including the prediction residual encoded; and determining the one or more candidate points, for inter prediction of the current three-dimensional point, based on a referenced three-dimensional point encoded immediately before the current three-dimensional point. The three-dimensional points constitute a prediction tree.

Abstract: A filling rate measurement method includes: obtaining a space three-dimensional model generated by measuring a storage through an opening of the storage using a range sensor facing the storage; obtaining a storage three-dimensional model that is a three-dimensional model of the storage; extracting a target part that is a part of a measurement target in the space three-dimensional model; identifying a line segment indicating a shape of the opening on a two-dimensional image of the opening which is generated; estimating a target three-dimensional model that is a three-dimensional model of the measurement target based on the target part and a three-dimensional coordinate system with respect to the position of the opening on a three-dimensional space identified based on the position of the range sensor, the specific direction, and the shape of the opening; and calculating a filling rate of the measurement target with respect to the storage space.

Abstract: A three-dimensional data encoding method is a method of encoding three-dimensional points each having an attribute information item. The three-dimensional data encoding method includes: assigning each of the three-dimensional points to any one of layers; encoding the attribute information item of each three-dimensional point using the layers; and encoding information indicating a total number of three-dimensional points belonging to each of the layers.

Abstract: A three-dimensional data encoding method includes: determining a total number of layers; when the total number of the layers is greater than 1, selecting, from pieces of attribute information of three-dimensional points, attribute information of a three-dimensional point based on a sampling period according to a data order of the pieces of attribute information of the three-dimensional points, and classifying the pieces of attribute information of the three-dimensional points into layers by assigning a first layer to pieces of attribute information of three-dimensional points selected and a second layer to pieces of attribute information of three-dimensional points non-selected; encoding the pieces of attribute information of the three-dimensional points for each of the layers; and generating a bitstream including the pieces of attribute information encoded, layer-number information, and sampling period information.

Abstract: A three-dimensional data creation method in a client device includes: creating three-dimensional data of a surrounding area of the client device using sensor information that is obtained through a sensor equipped in the client device and indicates a surrounding condition of the client device; estimating a self-location of the client device using the three-dimensional data created; and transmitting the sensor information obtained to a server or an other client device.

Abstract: A method acquires, on a basis of a restaurant ID, menu information indicating one or more foods provided by a restaurant over a network from a second server associated with the restaurant corresponding to the restaurant ID, extracts one or more first foods compatible with religion information on a basis of the menu information and the religion information, displays the one or more first foods through a second operation screen, corresponding to the second server, for accepting an order of a food to be provided by the restaurant and displayed on a display of the information terminal of a user, and transmits food order information indicating a food selected from among the one or more first foods and a seat ID to the second server.

Abstract: A three-dimensional data encoding method includes: dividing three-dimensional points included in three-dimensional data into three-dimensional point sub-clouds including a first three-dimensional point sub-cloud and a second three-dimensional point sub-cloud; appending first information indicating a space of the first three-dimensional point sub-cloud to a header of the first three-dimensional point sub-cloud, and appending second information indicating a space of the second three-dimensional point sub-cloud to a header of the second three-dimensional point sub-cloud; and encoding the first three-dimensional point sub-cloud and the second three-dimensional point sub-cloud so that the first three-dimensional point sub-cloud and the second three-dimensional point sub-cloud are decodable independently of each other.

Abstract: A three-dimensional data encoding method includes: encoding a first flag indicating whether a node having a parent node different from a parent node of a current node is to be referred to in encoding of the current node included in an n-ary tree structure of three-dimensional points included in three-dimensional data; selecting a coding table from N coding tables according to occupancy states of neighboring nodes of the current node, and performing arithmetic encoding on information of the current node using the coding table selected, when the first flag indicates that the node is to be referred to; and selecting a coding table from M coding tables according to the occupancy states of the neighboring nodes of the current node, and performing arithmetic encoding on information of the current node using the coding table selected, when the first flag indicates that the node is not to be referred to.

Abstract: A three-dimensional data encoding method includes: generating a bitstream by encoding subspaces included in a current space in which three-dimensional points are included. The bitstream includes encoded data respectively corresponding to the subspaces. In the generating of the bitstream, a list of information about the subspaces is stored in first control information included in the bitstream. The subspaces are respectively associated with identifiers assigned to the subspaces, and the first control information is common to the encoded data. Each of the identifiers assigned to the subspaces respectively corresponding to the encoded data is stored in a header of a corresponding one of the encoded data.

Abstract: A three-dimensional data encoding method includes: encoding geometry information of a plurality of three-dimensional points represented by a tree structure; and generating a bitstream including the geometry information encoded and division number information indicating a total number of divisions of each of a plurality of nodes included in the tree structure. The division number information includes common division number information collectively indicating the total number of divisions of two or more nodes among the plurality of nodes.

Abstract: A three-dimensional data encoding method includes: obtaining three-dimensional points; generating a data unit including one or more prediction trees, using the three-dimensional points; and generating a bitstream including the data unit and control information. The control information includes tree information about the one or more prediction trees, and the tree information includes number information indicating a total number of prediction trees included in the data unit.

Abstract: A method includes acquiring, on a basis of a restaurant ID, menu information indicating one or more foods provided by a restaurant over a network from a second server associated with the restaurant corresponding to the restaurant ID, transmitting identification information stored in an information terminal to a first server and acquiring classification information from the first server on a basis of the identification information, generating a personalized menu for the user corresponding to the classification information on a basis of the menu information and the classification information, displaying the personalized menu through a second operation screen for accepting an order of a food to be provided by the restaurant, the second operation screen being displayed on a display of the information terminal carried by the user, and transmitting food order information indicating the food selected from the personalized menu and a seat ID to the second server.

Abstract: A moving picture coding includes: coding a first flag indicating whether or not temporal motion vector prediction is used; when the first flag indicates that the temporal motion vector prediction is used: coding a first parameter for calculating the temporal predictive motion vector; wherein when the first flag indicates that the temporal motion vector prediction is not used, the first parameter is not coded.

Abstract: A three-dimensional data encoding method includes: obtaining data units each including three-dimensional points; encoding the three-dimensional points included in each of the data units; and generating a bitstream including encoded data obtained by encoding the three-dimensional points. In the encoding: geometry information of three-dimensional points included in a data unit to be encoded is converted into occupancy maps using an N-ary tree; each of the occupancy maps is converted into an index using a table indicating a correspondence relation between occupancy maps and indexes, and the encoded data is generated by encoding the index; the table is updated according to the index resulting from the conversion, and is stored into the memory; and when it is determined that the table stored in the memory is not to be initialized, encoding of a next data unit is started using the table stored in the memory.

Abstract: A three-dimensional data encoding method includes encoding information of a current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data, where N is an integer greater than or equal to 2. In the encoding, first information is encoded, the first information indicating a range for one or more referable neighboring nodes among neighboring nodes spatially neighboring the current node, and the current node is encoded with reference to a neighboring node within the range.