Abstract: A device and method for detecting a region of interest on a delivery object. In the method cluster identification data is stored. An item of the cluster identification data represents a cluster of image data items in a training set of image data items. A group of heat maps is stored. A heat map is associated with a cluster represented by the cluster identification data, and provides for cells of a grid a probability distribution for a probability of the cell belonging to a defined region of interest given the number of blobs in the cell. When a new image data item of the delivery object is received, the cluster identification data may be used to associate the input image data item with at least one cluster, and the heat map of the associated cluster to determine at least one region of interest in the image data item.
Abstract: A device and method for detecting a region of interest on a delivery object. In the method cluster identification data is stored. An item of the cluster identification data represents a cluster of image data items in a training set of image data items. A group of heat maps is stored. A heat map is associated with a cluster represented by the cluster identification data, and provides for cells of a grid a probability distribution for a probability of the cell belonging to a defined region of interest given the number of blobs in the cell. When a new image data item of the delivery object is received, the cluster identification data may be used to associate the input image data item with at least one cluster, and the heat map of the associated cluster to determine at least one region of interest in the image data item.
Abstract: A method for searching for an input symbol string, includes receiving (B) an input symbol string, proceeding (C) in a trie data structure to a calculation point indicated by the next symbol, calculating (D) distances at the calculation point, selecting (E) repeatedly the next branch to follow (C) to the next calculation point to repeat the calculation (D). After the calculation (G), selecting the symbol string having the shortest distance to the input symbol string on the basis of the performed calculations. To minimize the number of calculations, not only the distances are calculated (D) at the calculation points, but also the smallest possible length difference corresponding to each distance, and on the basis of each distance and corresponding length difference a reference value is calculated, and the branch is selected (E) in such a manner that next the routine proceeds from the calculation point producing the lowest reference value.
Abstract: An information system including subscriber stations (MS), at least two service sources (2 to 5) providing a respective service to subscriber stations of the system, and an access point (1) arranged to analyze a service request in order to forward the service request to the service source (2) offering the service, the service sources (2 to 5) being arranged to analyze a received service request in order to provide the subscriber station (MS) with the requested service. In order to improve the user friendliness of the system said system further includes a memory (7) for storing service requests which have led to successful identification of the requested service, and an error correction device (6) arranged to correct a received service request by utilizing the service requests stored in the memory (7) if no service source or no service can be identified.
Type:
Grant
Filed:
September 24, 2003
Date of Patent:
June 4, 2013
Assignee:
Syslore Oy
Inventors:
Lauri Loven, Jorkki Hyvonen, Henri Tykka, Jukka Laurila, Hannu Kauppinen, Pasi Salento, Timo Heikkinen