WO2001088899A2 - Verfahren zum einbringen verborgener information in einen notensatz - Google Patents
Verfahren zum einbringen verborgener information in einen notensatz Download PDFInfo
- Publication number
- WO2001088899A2 WO2001088899A2 PCT/DE2001/001333 DE0101333W WO0188899A2 WO 2001088899 A2 WO2001088899 A2 WO 2001088899A2 DE 0101333 W DE0101333 W DE 0101333W WO 0188899 A2 WO0188899 A2 WO 0188899A2
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- information
- notes
- elements
- geometric
- changed
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10H—ELECTROPHONIC MUSICAL INSTRUMENTS; INSTRUMENTS IN WHICH THE TONES ARE GENERATED BY ELECTROMECHANICAL MEANS OR ELECTRONIC GENERATORS, OR IN WHICH THE TONES ARE SYNTHESISED FROM A DATA STORE
- G10H1/00—Details of electrophonic musical instruments
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10H—ELECTROPHONIC MUSICAL INSTRUMENTS; INSTRUMENTS IN WHICH THE TONES ARE GENERATED BY ELECTROMECHANICAL MEANS OR ELECTRONIC GENERATORS, OR IN WHICH THE TONES ARE SYNTHESISED FROM A DATA STORE
- G10H2210/00—Aspects or methods of musical processing having intrinsic musical character, i.e. involving musical theory or musical parameters or relying on musical knowledge, as applied in electrophonic musical tools or instruments
- G10H2210/031—Musical analysis, i.e. isolation, extraction or identification of musical elements or musical parameters from a raw acoustic signal or from an encoded audio signal
- G10H2210/086—Musical analysis, i.e. isolation, extraction or identification of musical elements or musical parameters from a raw acoustic signal or from an encoded audio signal for transcription of raw audio or music data to a displayed or printed staff representation or to displayable MIDI-like note-oriented data, e.g. in pianoroll format
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10H—ELECTROPHONIC MUSICAL INSTRUMENTS; INSTRUMENTS IN WHICH THE TONES ARE GENERATED BY ELECTROMECHANICAL MEANS OR ELECTRONIC GENERATORS, OR IN WHICH THE TONES ARE SYNTHESISED FROM A DATA STORE
- G10H2240/00—Data organisation or data communication aspects, specifically adapted for electrophonic musical tools or instruments
- G10H2240/011—Files or data streams containing coded musical information, e.g. for transmission
- G10H2240/041—File watermark, i.e. embedding a hidden code in an electrophonic musical instrument file or stream for identification or authentification purposes
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10H—ELECTROPHONIC MUSICAL INSTRUMENTS; INSTRUMENTS IN WHICH THE TONES ARE GENERATED BY ELECTROMECHANICAL MEANS OR ELECTRONIC GENERATORS, OR IN WHICH THE TONES ARE SYNTHESISED FROM A DATA STORE
- G10H2240/00—Data organisation or data communication aspects, specifically adapted for electrophonic musical tools or instruments
- G10H2240/171—Transmission of musical instrument data, control or status information; Transmission, remote access or control of music data for electrophonic musical instruments
- G10H2240/185—Error prevention, detection or correction in files or streams for electrophonic musical instruments
- G10H2240/195—Reed-solomon error detection or correction, i.e. by considering the message symbols as polynomial coefficients
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10H—ELECTROPHONIC MUSICAL INSTRUMENTS; INSTRUMENTS IN WHICH THE TONES ARE GENERATED BY ELECTROMECHANICAL MEANS OR ELECTRONIC GENERATORS, OR IN WHICH THE TONES ARE SYNTHESISED FROM A DATA STORE
- G10H2250/00—Aspects of algorithms or signal processing methods without intrinsic musical character, yet specifically adapted for or used in electrophonic musical processing
- G10H2250/131—Mathematical functions for musical analysis, processing, synthesis or composition
- G10H2250/211—Random number generators, pseudorandom generators, classes of functions therefor
Definitions
- the present invention relates to a method for introducing hidden information into a notation as well as an associated method for reading out this information.
- the main area of application of the invention relates to the protection of the work of a musical notation of classical or contemporary music when it is distributed in paper form or in common electronic representations, such as PDF or graphic files.
- PDF or graphic files For the author or publisher of a musical notation or score, it is important when making this work available to the public that copies of the work that may have been made and possibly manipulated still contain a reference to the author or right holder.
- the present invention provides a suitable method for this.
- claim 20 specifies an apparatus for performing the method according to claim 1.
- a type of digital watermark is introduced into the notation that is not visible to the normal viewer of the notation.
- some of the geometric elements of the musical notation such as baselines, bar lines, note necks or noteheads, are changed in this way according to a predefinable key in their geometric shape and / or their mutual geometric relationship compared to an unmarked representation (the original or original representation) that the changes carry the information to be introduced in digital form and do not reduce the legibility of the typesetting.
- the set of notes modified in this way is then brought into the form of presentation to be disseminated, i.e. Printed on a paper carrier or converted into a corresponding electronic representation, for example a graphic file or a PDF file, and saved.
- the digital watermark introduced in this way into the musical notation or score is also copied in paper form during photocopying and cannot be removed by partial cropping of the copy, scaling, shearing or filtering (e.g. blurring) without the quality to influence the representation to such an extent that the copied score can only be used to a limited extent.
- the score subject to the method according to the invention can be printed on paper as well as suitably duplicated electronically become. Illegally made copies can be clearly assigned to the publisher of the original based on their digital watermark, which is still included.
- the beneficial properties of a digital watermark are its robustness
- the present protection mechanism primarily relates to the setting of the notes themselves and not to the protection of the music conveyed with these notes. It is obvious that another representation can be created from a set piece of music by decrypting the semantic information of the notation and repositioning the piece. Of course, the present method cannot offer any protection against such further processing. In most cases, however, this is of minor importance, since the semantic information, i.e. the music itself, continues to be legally protected material due to the copyright within the limits set therein.
- Some applications of the present method of introducing hidden information or a digital watermark can serve in the copyright protection of the musical notation, as well as the incorporation of hidden comments and information for the authentication of the data belonging to the musical notation or the document itself.
- the predefinable key for introducing the information can be based on two alternative techniques.
- the second technique enables the information brought in to be read out without the aid of the original.
- the information is thus brought into a relative change in the shape or arrangement or another geometric size of the selected geometric element compared to the original
- this information is brought about by changing the geometric shape or the geometric ratio of some geometric elements of a group of elements in the notation.
- the comparison required for reading out takes place in the second method with the respectively remaining geometric elements in the respective group.
- the original is not required for this.
- the changes are made in such a way that the legibility of the typesetting is not reduced. This is to be understood to mean that the lay or professional musician using the musical notation has no difficulty reading this musical notation. Preferably, however, the changes are so small that the reader of the set of notes who reads the set of notes without knowledge of any digital information that may have been introduced does not perceive these changes.
- the grade depends on the amount of information and the grade itself.
- an algorithm can also be used when analyzing the score data, which has an opportunistic approach. The analysis should be based on a vote of the staff. This is necessary to ensure the robustness of the embedded information against clipping.
- a voice is the smallest unit into which a certain amount of information can be introduced without this change being too strongly or even disruptively visible. Much of the information can be brought into these individual voices. Of course, the information can also be found in
- Elements are embedded that use multiple voices (staves) for embedding, such as their spacing.
- staves multiple voices
- an opportunistic approach is to be understood that, depending on the music in question, not all of the input elements are present in one voice, so that the analysis identifies those elements that are present in the given source material and selects the appropriate input elements from them. All Existing or initially listed elements can be used as desired. As an example, only the angle of a neck of music to the vertical is given, which depending on the given key can either carry only 1 bit or - due to different distinguishable angular positions - also several bits of information.
- the information can be introduced as a digital watermark in two design variants.
- a public watermark can be used, which mainly contains copyright information. It is intended to be readable by anyone who has the appropriate readout technology.
- the second design variant consists in the use of a secret watermark. In this case, the embedded information can only be read out if the reader has a special key.
- the watermark should not be embedded in fixed elements or positions in the musical notation.
- the type and position of the contribution should rather be document and / or key-specific.
- the Keys are transmitted to the third party or published in principle.
- the type of input also depends on whether or not the original is available when the information is read out. If the original is available when it is read out, individual elements of the document can be changed compared to the original and can be read out again by comparison with the original. If the original is not available, the amount of information that can be brought in is less. In this case, different elements to be varied must be selected in groups. The marking is then made by changing the proportions of the elements among one another. The characteristics of the elements of the group that differ from the group properties are relevant for reading out.
- each geometrical element can contain one or more bits of the ones to be introduced
- the embedding function or the predefinable key can distribute this information over all elements in the document.
- the distribution can take place, for example, via a random number generator (PRNG), for the initialization of which a separate secret key is used.
- PRNG random number generator
- a key other than that for initializing the random number generator should expediently be used for this. Since it is possible that individual elements cannot be fully extracted from a document during reading, as can be caused, for example, by stains on a photocopy, error-correcting codes such as BCH (Bose-Chaudhuri-Hochquenghem) are preferably used if more than only the pure presence of a marking should be recognized.
- BCH Bose-Chaudhuri-Hochquenghem
- the available bandwidth of the useful signal can be used differently.
- a single code is particularly suitable for longer messages. Even if the use of error-correcting codes is helpful in the detection of the watermark if there are few errors, the information is destroyed if the document is trimmed heavily in the case of a simple code. If you mainly value the robustness of the watermark, a multiple copy should be used. By inserting the same information several times, the document is better protected against errors or cropping. Even if a copy of this information is destroyed by cropping the document, there is an increased likelihood that another copy can be read out almost undamaged. If the bandwidth for the useful signal is large enough, several different watermarks (multiple watermarks) can be embedded with different keys. The bandwidth of the useful signal depends on the amount of suitable geometric elements of the notation that are available for the introduction of the information.
- a suitable device for carrying out the present method consists of means for reading or entering a set of notes, which for example consist of a scanner or a corresponding direct input unit for the set of notes, a device for geometrically analyzing the set of notes for elements suitable for introducing the information and for Introducing the information into the musical notation by changing the suitable or selected geometric elements according to a predefinable key. The change is made by changing the geometric shape and / or the mutual geometric relationship compared to the read or entered representation.
- Means are also provided for outputting the set of notes correspondingly provided with the information. These means can be, for example, in the form of a printer with a resolution of at least 300 dpi or also in the form of a unit for providing a corresponding electronic format for the typesetting.
- the method for reading out the information captures the geometric elements of the set of notes and compares their geometric shape and / or their geometric relationship with one another or with the original set of notes in order to add the information based on these keys from these changes to capture.
- the entire evaluation is preferably carried out on the basis of a raster image of the set of notes, which is possibly generated from a copy in paper form or from a copy of the set of notes available in another electronic representation.
- Figure 1 shows a first example of a change in geometric elements of a musical notation (in
- FIG. 2 shows a second example of a change in geometric elements of a set of notes (in the detail) using the present method
- Figure 3 shows a third example of a change in geometric elements of a set of notes (in the detail) with the present method. Ways of Carrying Out the Invention
- FIG. 1 shows the original in the upper part and the same sequence in the lower part with geometric elements modified according to the present method.
- the note spacing for introducing the information has been changed.
- the distance between the notes g and d ' is slightly increased compared to the original, the distance between d' and f is reduced accordingly.
- the width of the entire sequence is unchanged.
- FIG. 3 shows a sequence with several bars in the same way, above in the original, below in the changed version.
- the position of the bar line in bar 4 along with the note spacing in bar 3 is slightly changed.
- the reading flow is practically undisturbed and the overall width of the section is the same as that of the original.
- a pseudo random number generator PRNG
- PRNG pseudo random number generator
- pseudo-random number generator The selection of the pseudo-random number generator depends primarily on the computing power that can or should be provided for it. Suitable pseudo-random number generators are the algorithms from Blum, Blum and Shub ("A Simple Unpredictable Pseudo-Random Number Generator", SIAM J. Comput., Vol. 15, 364-383 (1987)) and "Yarrow" from Kelsey,
- the information entered must be encrypted, since the basic method for watermarking is to be regarded as publicly known. There is no encryption for a public watermark.
- the user information to be introduced is then provided with an error-correcting code.
- the data to be introduced is divided into small units, depending on how much bits of information each insertion element can hold. In the simplest and most robust case, this is one bit of information per element. Otherwise, by choosing different modification parameters such as different angles or distances, several bits can be encoded in one element.
- the error-correcting code is able to recover the information anyway, even if some elements could not be recognized correctly or if they are completely missing. If the latter case occurs frequently, the Reed-Solomon code is preferably chosen as the error-correcting code, since it is able to deal with such dropouts in the data stream.
- the error-correcting code provides an additional redundancy element that supports reading. In this way, an element can be read even if parts of it have become illegible (e.g. due to stains or the like).
- Watermarks should not be noticed in the highest quality level by professional musicians. It should be in a lower quality when reading the Score at least not to be perceived as significantly disturbing. A print resolution of 300 dpi is sufficient for the use of the method.
- the watermark should always be robust against manipulation up to the point at which the score becomes illegible due to the manipulation (usually after 10 photocopying).
- the watermark removal effort should be high compared to the cost of legally purchasing the product.
- the following information is preferably introduced as a digital watermark in the notation: an "owner code” that identifies the owner and rights holder of the notation; a “musical area code” that defines the musical genre and is assigned to the owner code; a "Service Provider Code” that defines the publisher or distributor; the release date of the set of notes; the title of the piece of music ("Title”); as well as the composer of the piece (“Composer”).
- owner code that identifies the owner and rights holder of the notation
- musical area code that defines the musical genre and is assigned to the owner code
- a "Service Provider Code” that defines the publisher or distributor
- the following bit lengths are proposed for the individual watermark elements, for:
- the only requirement for the content of the watermark is that the individual watermark can be clearly identified; Additional information can be realized by linking to an external database.
- the watermark can be retrieved from the musical notation in different scenarios, three of which are outlined below:
- the document is available electronically in a page description language such as Adobe® PostScript® or Adobe® PDF.
- the document is in paper form and has to be scanned or has been modified accordingly.
- the document is available electronically in a raster format, for example TIFF or JPEG / JFIF.
- scenario 2 requires a step to undo any affine transformations or offsets, since the readout mechanism is based on the geometric properties of the document.
- Scenario 3 requires a process to extract the individual elements of the score; to be able to read the watermark. These elements are lines and shapes and their positioning in the staff. The raster images can easily be of lower quality than the original (caused e.g. by scanning).
- Extracting the watermark is very easy if the original is available for comparison.
- the one to be examined is first
- typical Modifications are scaling, cutting off parts, rotation or shear.
- the baselines will represent the largest number of parallel horizontal lines. It is therefore sufficient to use these lines to restore the orientation of the document in question.
- these elements are called horizontal lines.
- Stems, bar lines, etc. are referred to as vertical lines.
- stems, bar lines, etc. are arranged perpendicular to the baselines. Certain transformations can cause these nominally perpendicular lines to be at an angle other than 90 °. Since both the embedding mechanism and non-affine transformations can influence the angle of the stems, the algorithm for recognizing vertical lines must also consider lines with a certain angle other than 90 ° to be vertical. The following steps depend on whether the original is available for comparison or not. In the simple case when the original is available, the document to be tested only has to be scaled until the differences to the original are minimized. This can be done by applying the line detection algorithm to the original and further comparing it on this line data.
- the subsequent recognition of the embedding elements can then be carried out simply by comparing them with the original. If the original is not available, the recognition process is more difficult and requires that the user data must be introduced as the ratios of individual elements. In this case, scaling to the size of the original is not necessary, since the proportions of the elements (positions among one another, angle or thickness) are independent of the absolute scaling.
- a threshold value method must first be used in order to convert the image into a real two-color image, since the local operators react strongly to changes in intensity for later edge detection.
- Hough transformation for example Robert, Sobel or Canny edge detection (edge detection) (see Canny, FJA, IEEE Trans PAMI 8, 6 ( 1986), 679-698), morphological Operators. Then it is thinned out so that lines are only exactly one pixel thick. This increases the accuracy of the subsequent transformation and reduces the computing power required. Since the simple Hough transformation can only extract lines and other simple shapes, such lines, with the exception of the baselines, have to be segmented additionally. In the present application there is no need to be able to recognize composite components.
- the Hough transformation is described in detail in the specialist literature and is familiar to the person skilled in the art. It can be viewed as a generalized method of recognizing patterns as templates and is typically used to extract edges or curves from images. The Hough transformation can also be used to recognize circles, or generally given shapes.
- H (pm, ⁇ m) H (pm, ⁇ m) + gi.
- the Hough transformation does not differ significantly from the discrete Radon transformation that is typically used for the reconstruction of three-dimensional objects from two-dimensional projections.
- H Local maxima of the pixel intensity H (pm, ⁇ m) serve to identify straight line segments in the original image.
- the Hough transformation is invariant to rotation or translation. Ideally, the definition area of the Hough transformation only has to be searched once for a maximum. In cases where the document contains many patterns of different sizes, it can It may be necessary to first remove the patterns from the image that are clearly identifiable in the histogram and then to repeat the process.
- F (i, j) be the original grayscale image
- All threshold methods work by first creating a histogram over the entire image. The distinction between the two values can then be made manually or automatically. In the case of the triangular threshold method, a straight line is constructed between the maximum in the histogram at brightness bmax and the lowest value bmin.
- Reed-Solomon Codes are block-based error-correcting codes with a wide range of applications in the field of digital communication and storage.
- Reed-Solomon codes are a subset of the BCH codes and are linear block codes.
- a Reed-Solomon code is specified by RS (n, k) with s-bit symbols. The means that the encoder supplements k data symbols from s bits with parity symbols and generates an n-bit code word therefrom. There are n - k parity symbols, each with a length of s bits.
- Reed-Solomon codes are particularly well suited to correct so-called burst errors. These are errors in which several bits in a row are incorrect in one code word.
- the main difficulty with the implementation of Reed-Solomon codes is that commercial processors do not master Galois field arithmetic. For example, the implementation of a Galois field multiplication requires a test for zero, two table lookups, modulo addition and further reverse table lookups.
- the method presented here is particularly suitable for being applied to data in electronic form. Reliable protection against copyright infringement is urgently needed, especially with the ever expanding trade on the Internet.
- the digital watermark introduced with the present method is difficult to remove. It can be stored in encrypted form so that even an attacker who knows the embedding process cannot use the watermark can remove. A blurring of the watermark always goes hand in hand with a considerable loss in quality of the document. However, authorized users of the documents are not affected by the digital watermark.
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP01931413A EP1282894A2 (de) | 2000-05-15 | 2001-04-04 | Verfahren zum einbringen verborgener information in einen notensatz |
CA002405948A CA2405948A1 (en) | 2000-05-15 | 2001-04-04 | Method for integrating hidden information in a set of notes |
JP2001584411A JP2003533919A (ja) | 2000-05-15 | 2001-04-04 | 音符のセット内に秘密情報を一体化するための方法 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE10023759.2 | 2000-05-15 | ||
DE10023759A DE10023759A1 (de) | 2000-05-15 | 2000-05-15 | Verfahren zum Einbringen verborgener Information in einen Notensatz |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2001088899A2 true WO2001088899A2 (de) | 2001-11-22 |
WO2001088899A3 WO2001088899A3 (de) | 2002-06-27 |
Family
ID=7642111
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/DE2001/001333 WO2001088899A2 (de) | 2000-05-15 | 2001-04-04 | Verfahren zum einbringen verborgener information in einen notensatz |
Country Status (6)
Country | Link |
---|---|
US (1) | US20030116627A1 (de) |
EP (1) | EP1282894A2 (de) |
JP (1) | JP2003533919A (de) |
CA (1) | CA2405948A1 (de) |
DE (1) | DE10023759A1 (de) |
WO (1) | WO2001088899A2 (de) |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050030588A1 (en) * | 2003-08-06 | 2005-02-10 | Curtis Reese | Methods and apparatus utilizing embedded data layers |
JP2008277890A (ja) * | 2007-04-25 | 2008-11-13 | Sharp Corp | 画像処理装置 |
US20100147960A1 (en) * | 2008-12-17 | 2010-06-17 | Global Graphics Software Limited | Methods, devices, and systems for printing bar codes |
US9514501B2 (en) | 2013-06-14 | 2016-12-06 | Tencent Technology (Shenzhen) Company Limited | Systems and methods for multimedia-processing |
CN104244112B (zh) * | 2013-06-14 | 2018-12-07 | 腾讯科技(深圳)有限公司 | 一种多媒体处理方法、装置及服务器 |
DE102020119055A1 (de) | 2020-07-20 | 2022-01-20 | Dr. Ing. H.C. F. Porsche Aktiengesellschaft | Verfahren und Vorrichtung zum Eingeben eines kryptologischen Schlüssels |
CN113704221B (zh) * | 2021-11-01 | 2022-02-08 | 佳瑛科技有限公司 | 一种基于分布式环境存储电子文档的方法及系统 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0493091A1 (de) * | 1990-12-27 | 1992-07-01 | Xerox Corporation | Verfahren und System zum Einlassen maschinenlesbarer Daten in Grautonbildern |
EP0766468A2 (de) * | 1995-09-28 | 1997-04-02 | Nec Corporation | Verfahren und Vorrichtung zum Einfügen eines Spreizspektrumwasserzeichens in Multimediadaten |
EP0828372A2 (de) * | 1996-09-04 | 1998-03-11 | Nec Corporation | Spreizspektrumwasserzeichen für integrierte Signalisierung |
US5822432A (en) * | 1996-01-17 | 1998-10-13 | The Dice Company | Method for human-assisted random key generation and application for digital watermark system |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6345104B1 (en) * | 1994-03-17 | 2002-02-05 | Digimarc Corporation | Digital watermarks and methods for security documents |
US6549638B2 (en) * | 1998-11-03 | 2003-04-15 | Digimarc Corporation | Methods for evidencing illicit use of a computer system or device |
US6771820B1 (en) * | 1999-08-12 | 2004-08-03 | Hewlett-Packard Development Company, Lp. | Encoding information within text printed on a page using differing gray or color levels |
-
2000
- 2000-05-15 DE DE10023759A patent/DE10023759A1/de not_active Withdrawn
-
2001
- 2001-04-04 US US10/276,064 patent/US20030116627A1/en not_active Abandoned
- 2001-04-04 CA CA002405948A patent/CA2405948A1/en not_active Abandoned
- 2001-04-04 EP EP01931413A patent/EP1282894A2/de not_active Withdrawn
- 2001-04-04 JP JP2001584411A patent/JP2003533919A/ja not_active Withdrawn
- 2001-04-04 WO PCT/DE2001/001333 patent/WO2001088899A2/de not_active Application Discontinuation
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0493091A1 (de) * | 1990-12-27 | 1992-07-01 | Xerox Corporation | Verfahren und System zum Einlassen maschinenlesbarer Daten in Grautonbildern |
EP0766468A2 (de) * | 1995-09-28 | 1997-04-02 | Nec Corporation | Verfahren und Vorrichtung zum Einfügen eines Spreizspektrumwasserzeichens in Multimediadaten |
US5822432A (en) * | 1996-01-17 | 1998-10-13 | The Dice Company | Method for human-assisted random key generation and application for digital watermark system |
EP0828372A2 (de) * | 1996-09-04 | 1998-03-11 | Nec Corporation | Spreizspektrumwasserzeichen für integrierte Signalisierung |
Also Published As
Publication number | Publication date |
---|---|
US20030116627A1 (en) | 2003-06-26 |
DE10023759A1 (de) | 2001-11-22 |
WO2001088899A3 (de) | 2002-06-27 |
JP2003533919A (ja) | 2003-11-11 |
CA2405948A1 (en) | 2002-10-09 |
EP1282894A2 (de) | 2003-02-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
DE60225385T2 (de) | Autentisches Document und dessen Herstellungsverfahren | |
DE69635512T2 (de) | Verfahren zum Lesen eines zweidimensionalen Strichcodes ohne Taktsignal | |
DE69633553T2 (de) | Verfahren und Vorrichtung zur Einbettung von Daten in einem elektronischen Dokument | |
DE60211307T2 (de) | Mit informationskodierenden grafischen symbolen gedrucktes dokument | |
DE69932167T2 (de) | Zeichenerkennung | |
DE69633809T2 (de) | Verarbeitung von maschinell lesbaren Vordrucken | |
DE69929572T2 (de) | Verfahren zum Lesen eines zweidimensionalen Strichcode ohne Taktsignal und ohne Ränder | |
DE69937044T2 (de) | Technik für mehrfach-wasserzeichen | |
DE69923781T2 (de) | Druck und überprüfung von selbstprüfenden sicherheitsdokumenten | |
DE69634583T2 (de) | System und Verfahren zum Prüfen von Identifizierungskarten | |
DE60215660T2 (de) | Verfahren zum unsichtbaren einbetten und verstecken der daten in soft-copy textdokumenten | |
DE102016207954A1 (de) | Echtzeitkorrelationsmarkierungsbilder für Vorrichtungen mit geringer Speicherkapazität | |
DE102015212255A1 (de) | Erweitern von barcodes mit sekundärkodierung zur fälschungssicherung | |
DE19530829C2 (de) | Verfahren zum elektronischen Wiederauffinden von einem Dokument hinzugefügter Information | |
DE102011076911A1 (de) | Einbettung von Infrarot-Wasserzeichen durch Frequenzmodulation in digitale Dokumente | |
DE2653288A1 (de) | Verfahren und anordnung zur entfernung von vorgebbarer hintergrundinformation aus einem bild | |
DE2826469A1 (de) | Verfahren und einrichtung zur absicherung von dokumenten | |
DE102017206467A1 (de) | Verfahren zur Herstellung eines Sicherheitsmerkmals und zur Authentifizierung eines Sicherheitsmerkmals sowie ein Sicherheitsmerkmal | |
DE112021000371T5 (de) | Digitale bildbearbeitung | |
WO2001088899A2 (de) | Verfahren zum einbringen verborgener information in einen notensatz | |
EP1771813A1 (de) | Rasterdruckdatenspeicher und verfahren zum codieren der daten | |
DE60030603T2 (de) | Vorrichtung zur Bilderkennung mit Verwendung von Teilmustern | |
DE102007050691A1 (de) | Vorrichtungen, Verfahren und Prozess zur stochastischen Markierung und Rückverfolgung von Druckprodukten | |
JP4082448B2 (ja) | 真偽判別可能な印刷物及びその作成方法 | |
DE69907236T2 (de) | Verfahren zur herstellung einer unlösbaren verknüpfung zwischen einem elektronischen dokument und ole objekten |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A2 Designated state(s): CA JP US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A2 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR |
|
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
AK | Designated states |
Kind code of ref document: A3 Designated state(s): CA JP US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A3 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2001931413 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2405948 Country of ref document: CA |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10276064 Country of ref document: US |
|
WWP | Wipo information: published in national office |
Ref document number: 2001931413 Country of ref document: EP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 2001931413 Country of ref document: EP |