Patents by Inventor Andreas Hutter

Andreas Hutter has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20050287948
    Abstract: The present invention relates to the description of a data stream having data stream subdomains, which can be referenced and classified, and a data stream syntax. According to the present invention, the data stream subdomains are referenced and classified by division into at least one respective class of a classification, whereby the classification is at least partially independent of the syntax of the data stream.
    Type: Application
    Filed: April 23, 2003
    Publication date: December 29, 2005
    Inventors: Herman Hellwagner, Jorg Heuer, Andreas Hutter, Harald Kosch, Christian Timmerer
  • Publication number: 20050182778
    Abstract: Methods and devices are provided for encoding/decoding structured documents, particularly XML documents, wherein a bit stream or part of a bit stream is produced from a schema as a function of a metaschema with the aid of an encoding method. According to the present invention, at least one of the following optimization processes is carried out: separation of anonymous types from element declarations and attribute declarations and encoding as own type, the type definition thereof being instantiated in the schema definition as a top level element; normalization of the syntax trees on the encoder side; replacement of the character strings of type names; and transmission of information for the inheritance tree. The decoding takes such optimization processes into account and conversely produces a schema from the bit stream.
    Type: Application
    Filed: July 7, 2003
    Publication date: August 18, 2005
    Inventors: Jorg Heuer, Andreas Hutter, Ulrich Niedermeier
  • Publication number: 20040193581
    Abstract: The invention relates to a method serves to encode textual paths for indexing and querying structured, for example, XML-based documents and serves to execute and improved filtering of binarily represented XML documents. A development of the method results in all indices being identical even in the event that a polymorphism is inserted therein. When storing these textual paths for indexing or querying, only one smaller volume of data has to be stored or transmitted. A comparison of this data can also subsequently ensure more rapidly during a query since the volume of data to be compared is smaller.
    Type: Application
    Filed: December 29, 2003
    Publication date: September 30, 2004
    Inventors: Andreas Heuer, Andreas Hutter
  • Publication number: 20040186841
    Abstract: The invention is essentially based on, in the schema definition, which is known to the encoder and to the decoder or transmitted from the encoder to the decoder, specifying information for calculating code concerning the elements or data types contained in the name subspace and enabling this information to be clearly assigned in this manner to each code in the name subspace. Only a portion of the entire name space including the number of the elements or data types lacking for the code calculation have to be transmitted for the configuration of a code which generally means a significantly smaller volume of data than the volume of data that would be required for the entire name space. In addition, the code tables are smaller than in entirely known name spaces which requires less storage space in the codec and enables a faster encoding and decoding.
    Type: Application
    Filed: December 29, 2003
    Publication date: September 23, 2004
    Inventors: Jorg Heuer, Andreas Hutter, Ulrich Niedermeier
  • Publication number: 20040171957
    Abstract: Useful information is transmitted by means of a UWB signal from a sender comprising a UWB signal modulator and a send antenna to a receiver comprising a receive antenna and detection and demodulation means for discriminating the useful information in the signal received at the receive antenna. In the receiver, the signal received at the receive antenna is compared to a first power threshold value and transmission of the received signal to the detection/demodulation means is blocked if the power level of the received signal exceeds the first threshold value.
    Type: Application
    Filed: February 27, 2004
    Publication date: September 2, 2004
    Inventors: John Farserotu, Andreas Hutter, Johannes Gerrits, Alexandre Pollini
  • Publication number: 20040139393
    Abstract: The invention is essentially characterized in that two different schema branch codes are used, whereby one of the two is utilized far more frequently and, as a consequence, effects a compression. The schema branch code and position code are combined, and the bit length for the schema branch code is transmitted therewith. This results in simplifying the search function in such a manner that the first part, alone, specifies the type of the referenced element and that an improvement in the extensibility is achieved based on a schema version number to be transmitted and on firmly prescribed extension strategies that are also familiar to the decoder.
    Type: Application
    Filed: October 20, 2003
    Publication date: July 15, 2004
    Inventors: J?ouml;rg Heuer, Andreas Hutter, Ulrich Niedermeier
  • Publication number: 20040107297
    Abstract: The aim of the invention is to encode string-based data types, which have for example a tree-type structure, in such a way that signal bits (flags) for optional sections and/or for length information concerning the codes that are of variable length are placed in a defined sequence at the beginning of the created bitstream, thus accelerating the search for data by means of a sorting process and bit mask queries. The invention also relates to a more efficient encoding of the #position field by, among other things, the assignment of code fragments for each group of regular expressions.
    Type: Application
    Filed: January 27, 2004
    Publication date: June 3, 2004
    Inventors: Jorg Heuer, Andreas Hutter, Ulrich Niedermeier
  • Publication number: 20030095595
    Abstract: To allow an individual picture (1) which comprises picture values (3) grouped together into blocks (2) to be quickly compressed with good picture quality, the picture values (3) are quantized block by block by a quantization factor, with the data volume represented by quantized picture values (3) dropping as the quantization factor rises. After the picture values (3) in a block (2) have been quantized, an actual data volume is determined which corresponds to that data volume represented by the last block (2) quantized which is related to the number of picture values (3) in the last block (2) quantized, and a target data volume is determined which corresponds to that volume of storage space which is available for the picture values (3) still to be quantized and which is related to the number of picture values (3) still to be quantized. If the actual data volume is larger than the target data volume the quantization factor is raised, and vice versa.
    Type: Application
    Filed: November 20, 2002
    Publication date: May 22, 2003
    Applicant: Infineon Technologies AG
    Inventors: Andreas Hutter, Klaus Illgner-Fehns, Robert Kutka
  • Publication number: 20030059119
    Abstract: According to the invention, at least one image region is selected from each temporally preceding image that is considered, and the associated image information is stored with an item of allocation information. At least one mixed image is formed from the item of image information while taking the respective item of allocation information into account. The mixed image is used within the scope of a motion estimation, of a motion compensation or of an error masking for an image.
    Type: Application
    Filed: October 15, 2002
    Publication date: March 27, 2003
    Inventors: Ralf Buschmann, Gero Base, Andreas Hutter, Robert Kutka, Norbert Oertel, Juergen Pandel