EP1514077A1 - Procede pour comprimer et decomprimer un flux de donnees - Google Patents

Procede pour comprimer et decomprimer un flux de donnees

Info

Publication number
EP1514077A1
EP1514077A1 EP03752689A EP03752689A EP1514077A1 EP 1514077 A1 EP1514077 A1 EP 1514077A1 EP 03752689 A EP03752689 A EP 03752689A EP 03752689 A EP03752689 A EP 03752689A EP 1514077 A1 EP1514077 A1 EP 1514077A1
Authority
EP
European Patent Office
Prior art keywords
data
compression
attributes
decompression
data element
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP03752689A
Other languages
German (de)
English (en)
Inventor
Arne Friedrichs
Gerd Draeger
Stefan Goss
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Robert Bosch GmbH
Original Assignee
Robert Bosch GmbH
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Robert Bosch GmbH filed Critical Robert Bosch GmbH
Publication of EP1514077A1 publication Critical patent/EP1514077A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction

Definitions

  • the invention is based on a method for compressing data from a data stream.
  • the route data include nodes in the form of waypoint data with edges (paths) in between and associated attributes.
  • the individual nodes of a route corridor are linked to one another in such a way that the smallest possible volume of data is generated.
  • the waypoint data is preferably transmitted sequentially.
  • DE 101 05 897.7 describes a method for exchanging navigation data between a terminal and a control center with segmentation and transmission of partial routes between a starting point and a destination.
  • Offboard navigation devices using this method do not calculate route information autonomously, but rather request it via a suitable (radio) interface from a server, which then transmits it to the navigation device.
  • DE 100 12 441 C2 discloses a method ⁇ m destination entry on a navigation device. To reduce the processing effort, only those target names are included that are in the vicinity of the current location. In addition, the destinations are sorted by distance in a destination name list. Advantages of the invention
  • data of a data stream of different information content in particular route data consisting of topographic nodes (waypoints) and edges (connecting routes) and their attributes (street names, street classes, etc.) are compressed, the degree of compression depending on the information content of the Data is configured to be configurable and the compression takes place by omitting predetermined attributes, limiting the accuracy, for example in terms of coordinate accuracy, or a maximum amount of data is specified with appropriate control of the degree of compression.
  • Optional data fields for example in a predetermined data format for the transmission of route information according to DE 101 06 502.7, can be optimally used.
  • the method according to the invention is advantageously suitable for the compression of route data, but can be applied to all possible data, preferably to data which in its structure consist of graphs, i.e. of polygonal lines with topographical nodes and edges, e.g. Map data, CAD drawings.
  • the compression method according to the invention is used in particular for offboard navigation systems, preferably on a server at a service provider, and the decompression or decryption of the data is preferably carried out on the terminal side or at the client.
  • the compression method can be designed to be strictly sequential, which means that partial data records can be stored or transmitted even during the compression.
  • FIG. 1 shows a sequential processing of a route graph
  • Figure 2 is a block diagram of a compression process using a
  • FIG. 3 the compression of an attribute value
  • Figure 4 shows an example of a route graph.
  • topographical route or map data consist of waypoints (nodes) and streets (edges), which were generated as directional connections between the nodes. Furthermore, the nodes and thus the edges are subject to a sequence which advantageously exists in the case of route data from the starting point towards the destination.
  • Waypoints generally have one or more of the following attributes:
  • Coordinates - unique identifier (ID) Edges generally have one or more of the following attributes:
  • suitable ones of these attributes are those that are optionally transmitted, e.g. IDs or those that have a high level of redundancy, e.g. Street names and route guidance instructions each define an indicator that can take two or more of the following values:
  • Data element is equal to that of the xth element ⁇ index x follows (index) data value of the element follows (explicit).
  • the indicators for each waypoint / edge to be transmitted are advantageously combined to form a bit field.
  • the compressor algorithm has an associative memory 27 (FIG. 2) for each attribute for which an indicator is defined that can take the value index.
  • the algorithm assigns to each attribute value the number of the element (point / edge) with which this value occurs first. So e.g. "Robert-Bosch-Strasse” ⁇ 5, which means that the street name "Robert-Bosch-Strasse” appeared first on the 5th edge.
  • the attribute memory 27 is used as a buffer, created during the compression and subsequently deleted again.
  • the element values in the memory can also be assigned to the attribute values, e.g. 3 if the corresponding attribute value was inserted third in the memory.
  • the compression process 28 is linked directly to the associative memory 27.
  • the input data is the uncompressed route data and the output data is the compressed route data 30.
  • the indicator is determined for each element, in order to then only transfer a reference to the predecessor element or a reference to any other element instead of the value.
  • FIG. 3 The detailed sequence for each individual attribute of a waypoint / edge is described in FIG. 3.
  • it is first checked whether an indicator is defined for an attribute (sequence point 12). If yes, it is checked whether the attribute value is filled or valid (process point 13). If not, an indicator is defined as NV, i.e. the attribute value remains empty (process point 14). Otherwise, it is checked whether the current attribute value is equal to that of the predecessor element (process point 15). If this is the case, the attribute value of this element is defined in the same way as the previous element (process point 16). Otherwise, it is checked whether an "index" is provided as a permissible value for a current indicator (process point 17).
  • process point 18 it is checked whether the corresponding attribute value is available in the associative memory (process point 18). In the positive case, an index is defined for the indicator (process point 19). In the negative case, the attribute value or its element number is saved (process point 20). The indicator is defined as "explicit", that is to say processed uncompressed (process point 21). The indicators for the three cases are then written into the memory after process points 21, 19 and 14 (process points 22, 23 and 24) and subsequently the attribute value written (sequence point 25) or the element number (sequence point 26).
  • the decompression When reading in the same order, the decompression goes through the data sequentially, i.e. iteratively over all waypoints and edges, and stores the individual waypoint and edge elements in a table in the order in which they occur.
  • the degree of decompression is designed to be configurable depending on the information content of the data, taking into account the measures taken during the compression (see description there).
  • Attribute value remains empty or is assigned default value
  • Attribute value of this element is set to that of the element one row before in the table
  • Index i is read from the compressed data and the attribute value is set to that of the nth element entry in the table
  • Attribute value is read from the data without compression.
  • the compression algorithm e.g. can be configured by a client, so that (by the client) the type of compression and / or the degree of compression are specified, whereby data can be saved.
  • the following configuration options are possible individually or in combination:
  • Compression algorithm the compression when the prescribed
  • Criterion aborts, e.g. max x kByte amount of data max x meter length of the main route max x minutes travel time of the main route
  • the method according to the invention can advantageously be combined in one or more of the following methods for reducing the size of the route / map data: Reduction of the coordinate data by generally limiting the coordinate accuracy (resolution of the waypoints) and, if possible, for a waypoint not its absolute coordinates, but its relative distance is transferred / saved as a vector to the previously transmitted waypoint
  • a route graph is shown as an example in FIG. 4:
  • the main route runs from point Pl via edges K1, K2 and K5 to point P6. All three edges have the street name "Robert-Bosch-Strckee" and street class 3.
  • edges K3, K4 which belong to Hildesheimer Straße and are assigned to street class 5.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

L'invention concerne un procédé permettant de comprimer et décomprimer des données contenant différentes informations, par ex. des noeuds et des arêtes topographiques, ainsi que leurs attributs. Le niveau de compression est formé de manière configurable en fonction de la teneur des informations. Pour assurer la compression, les attributs sont supprimés, l'exactitude de l'information topographique est limitée ou le niveau de compression est régulé sur la base d'une quantité maximale prédéfinie de données.
EP03752689A 2002-05-15 2003-02-14 Procede pour comprimer et decomprimer un flux de donnees Withdrawn EP1514077A1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE10221774A DE10221774A1 (de) 2002-05-15 2002-05-15 Verfahren zum Komprimieren und Dekomprimieren von Daten eines Datenstromes
DE10221774 2002-05-15
PCT/DE2003/000446 WO2003098151A1 (fr) 2002-05-15 2003-02-14 Procede pour comprimer et decomprimer un flux de donnees

Publications (1)

Publication Number Publication Date
EP1514077A1 true EP1514077A1 (fr) 2005-03-16

Family

ID=29285458

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03752689A Withdrawn EP1514077A1 (fr) 2002-05-15 2003-02-14 Procede pour comprimer et decomprimer un flux de donnees

Country Status (4)

Country Link
EP (1) EP1514077A1 (fr)
JP (1) JP2005525763A (fr)
DE (1) DE10221774A1 (fr)
WO (1) WO2003098151A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4683014B2 (ja) 2007-06-25 2011-05-11 株式会社デンソー 経路案内装置、道路地図データ作成装置及び道路地図データ作成方法
DE102010063330A1 (de) * 2010-12-17 2012-06-21 Bayerische Motoren Werke Aktiengesellschaft Verfahren und Vorrichtung zum Komprimieren von Routendaten

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5848373A (en) * 1994-06-24 1998-12-08 Delorme Publishing Company Computer aided map location system
JPH08320648A (ja) * 1995-05-24 1996-12-03 Matsushita Electric Ind Co Ltd ナビゲーション装置
DE69732546T2 (de) * 1996-05-16 2006-01-12 Matsushita Electric Industrial Co., Ltd., Kadoma Strassenkarteninformationswiedergabevorrichtung, Aufzeichnungsmedium und Übertragungsverfahren
US6006232A (en) * 1997-10-21 1999-12-21 At&T Corp. System and method for multirecord compression in a relational database
WO2000031663A1 (fr) * 1998-11-24 2000-06-02 Matsushita Electric Industrial Co., Ltd. Structure de données d'un fichier cartographique numérique

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO03098151A1 *

Also Published As

Publication number Publication date
WO2003098151A1 (fr) 2003-11-27
DE10221774A1 (de) 2003-11-27
JP2005525763A (ja) 2005-08-25

Similar Documents

Publication Publication Date Title
DE10162359B4 (de) Verfahren zur Bereitstellung von Routendaten für ein Navigationsgerät
EP1224645B2 (fr) Procede de codage et de decodage d'objets dans un reseau de voies de circulation
DE112010004633T5 (de) Fahrzeugmontierte Bildverarbeitungsvorrichtung und Reisehilfevorrichtung
EP0941533B1 (fr) Procede et terminal pour l'attribution spatiale d'informations se rapportant a un emplacement
DE102015206519A1 (de) Aktualisierung von Kartendaten einer Navigationsvorrichtung für Fahrzeuge
DE102011003152A1 (de) Kartendaten, Verfahren zum Erstellen derselben, Datenprodukt, das dieselben enthält, Speichermedium, das dieselben enthält, und Navigationsvorrichtung, die dieselben verwendet
DE4230299B4 (de) Verfahren zur Ortung eines Landfahrzeuges
DE10137632A1 (de) Verfahren und System zum Auffinden eines Ortes in einer digitalen Karte
EP3317612A1 (fr) Procédé et dispositif pour télécharger des données d'un véhicule à moteur
EP1514077A1 (fr) Procede pour comprimer et decomprimer un flux de donnees
DE112011105117T5 (de) Navigationsvorrichtung
DE102012212815B4 (de) Verfahren zur Auswahl und Aufbereitung von Verkehrsinformationen
DE102006013297B4 (de) Verfahren zum Betrieb eines Navigationssystems
WO2017220307A1 (fr) Mise à jour d'une carte numérique
DE112011105119T5 (de) Relationsinformationserzeugungsverfahren und Relationsinformationserzeugungsvorrichtung
WO2008119585A2 (fr) Procédé pour établir un répertoire de sections de rues, procédé pour déterminer toutes les sections de routes comprises dans une zone de recherche et programme informatique
DE102019002775A1 (de) Verfahren zur rasterbasierten Georeferenzierung und zur ldentifizierung einzelner Rasterelemente
DE102019002594A1 (de) Verfahren zur Aktualisierung einer optimalen Routenführung
EP1362220B1 (fr) Procede pour transferer des donnees d'itineraire
DE112011105115T5 (de) Navigationsvorrichtung
EP1979837A1 (fr) Procede et dispositif pour la sortie de jeux de données
DE102016219258A1 (de) Aktualisierung einer digitalen Karte
EP2362185A2 (fr) Méthode de commande d'un système de navigation
DE102022214329A1 (de) Verfahren und Vorrichtung zum Aktualisieren und Bereitstellen einer Karte
DE102022207651A1 (de) Erstellen eines logischen Wegenetzes in Parkräumen

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20041215

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO

DAX Request for extension of the european patent (deleted)
RBV Designated contracting states (corrected)

Designated state(s): DE FR GB SE

17Q First examination report despatched

Effective date: 20100625

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20100901