EP0375805B1 - Vektorisationsverfahren - Google Patents

Vektorisationsverfahren Download PDF

Info

Publication number
EP0375805B1
EP0375805B1 EP88121903A EP88121903A EP0375805B1 EP 0375805 B1 EP0375805 B1 EP 0375805B1 EP 88121903 A EP88121903 A EP 88121903A EP 88121903 A EP88121903 A EP 88121903A EP 0375805 B1 EP0375805 B1 EP 0375805B1
Authority
EP
European Patent Office
Prior art keywords
chain code
train
codes
extracting
pixel
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.)
Expired - Lifetime
Application number
EP88121903A
Other languages
English (en)
French (fr)
Other versions
EP0375805A1 (de
Inventor
Ryohei Kumagai
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.)
Yozan Inc
Sharp Corp
Original Assignee
Yozan Inc
Ezel Inc
Sharp Corp
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 Yozan Inc, Ezel Inc, Sharp Corp filed Critical Yozan Inc
Priority to EP88121903A priority Critical patent/EP0375805B1/de
Priority to DE3853885T priority patent/DE3853885T2/de
Priority to US07/292,309 priority patent/US5007098A/en
Publication of EP0375805A1 publication Critical patent/EP0375805A1/de
Application granted granted Critical
Publication of EP0375805B1 publication Critical patent/EP0375805B1/de
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding
    • G06T9/20—Contour coding, e.g. using detection of edges
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V10/00—Arrangements for image or video recognition or understanding
    • G06V10/40—Extraction of image or video features
    • G06V10/46—Descriptors for shape, contour or point-related descriptors, e.g. scale invariant feature transform [SIFT] or bags of words [BoW]; Salient regional features
    • G06V10/469—Contour-based spatial representations, e.g. vector-coding

Definitions

  • the present invention relates to a vectorizing method according to the preamble part of claim 1.
  • the vector type data particularly the peripheral vector data is useful because it is smaller in volume than the raster data, as well as easily rotatable and changeable in size.
  • Vector data is defined by a train of a part of boundary pixels of a configuration.
  • the qualilty of the reappeared configuration depends on the selection of boundary pixels.
  • the reappearance quality is very important because the products value mainly depends on the reappearance quality.
  • a conventional vectorizing method comprises angular calculations between pairs of boundary pixels of a configuration. Since the angular calculation is floating point calculation, it takes a long time to select boundary pixels.
  • EP-A-0 090 395 discloses a method and apparatus for automatically processing visual images electronically so as to permit intelligent machine analysis of the image content.
  • a special distributed logic system architecture facilitates rapid real time image analysis and the production of reaction control signals in a high speed production line environment, for example.
  • Dedicated decision logic is employed to determine in a single microinstruction cycle whether a detected corner point of the image should be linked to another already linked chain of such corner points so as to define part of a closed edge contour of the image under examination.
  • Freeman's chain code consists of the number from “0” to “7”; “0” means rightward, “1” upper rightward, “2” upward, “3” upper leftward, “4" leftward, “5" down leftward, “6” downward and “7” down rightward.
  • Each chain code indicates the direction from one boundary pixel towards the next boundary pixel when boundary pixels are traced in one rotational direction, successively.
  • Fig. 2 there is shown a configuration F.
  • the start point is to be found, first.
  • the upper left pixel a is first found in the configuration F.
  • Chain code is generated anticlockwisely from the start point along the boundary. Each chain code indicates the direction to the following pixel from the current pixel.
  • the current pixel means the pixel to which chain code is to be given at that time.
  • Fig. 2 is a chain code diagram indicating chain code on each boundary pixel when the boundary is traced in anticlockwise direction.
  • the last pixel b adjacent to the start pixel a is given the chain code indicating the direction toward the pixel a.
  • a line I with a width of one pixel.
  • the line is traced toward the free end first, then is traced backwardly from the free end. Therefore, one pixel is given two different chain codes.
  • Chain code train in Fig. 2 is "66000766002222244444", which indicates a vertical downward line by "66”, a horizontal rightward line by “00”, a vertical upward line by "22” and horizontal leftward line by "44".
  • the start pixel a, the pixel c1, on the right angle convex corner beneath the pixel a, the pixel c2 on the right angle concave corner rightward from the pixel c1, the pixel c3 on the right angle convex corner beneath the pixel c2, the pixel c4 on the right angle convex corner rightward from the pixel c3 and the pixel c5 on the right angle convex corner above the pixel c4 should be extracted as vector points from the boundary pixels above. While the pixel on the right angle convex corner follows at least two pixels with the same chain code less by "2" than the chain code of the former.
  • corner point c2 on the right angle concave corner should be extracted as a vector point, the corner has no chain code because it is not a boundary pixel. This is one difficulty in vectorizing. The solution of this difficulty according to the present invention is described later.
  • Chain code is ordinarily generated by tracing the boundary in the anticlockwise direction with respect to the outer boundary. It may be possible to trace the boundary in the clockwise direction. With respect to the inner boundary, the tracing direction should be opposite to the tracing direction relative to the outer boundary, in order to define the boundary as either outer or inner boundary.
  • the chain code k′ of the following pixel is as follows;
  • the right angle concave corner always consists of one vertical line and one horizontal line, as shown in Figs 7 (a), 8(a), 9(a) and 10(a).
  • Fig. 7 (a) shows a corner open downwardly as well as leftwardly.
  • the chain code train advances "...007" on the horizontal line toward the corner point a, then changes "66" on the vertical line.
  • the last two chain codes on the horizontal line together with the first chain code on the vertical line define the right angle corner.
  • the chain codes defining right angle corner are "076". It means that there exists a left-and downwardly opening right angle corner when the chain codes "076" are included in the chain code train.
  • Fig. 7 (b) shows a chain code diagram in which the chain code train in Fig. 7 (a) is changed according to the present invention.
  • the last chain code on the horizontal line is changed from “7" to "0” and a new chain code “6" is appended after the changed chain code. Therefore, the chain code train "076" is modified to be "0066".
  • the last chain code c on the horizontal line indicates the corner point a
  • the chain code on the corner point indicates the first pixel d on the vertical line.
  • Fig. 8 (a) shows a right-and downwardly opening right angle corner.
  • the chain code train on the vertical line advances "...221" toward the corner point a.
  • the chain code train advances "00".
  • the right angle corner is defined by the last two chain codes b and c on the vertical line as well as the first chain code d on the horizontal line.
  • This chain code train is "210". It means that there exists a down-and rightwardly opening right angle corner when the chain code train includes the chain codes "210".
  • Fig. 8 (b) shows a chain code diagram in which the chain code train in Fig. 8 (a) is changed according to the present invention.
  • the last chain code c on the horizontal line is changed from “1" to "2” and a new chain code "0" is appended after the changed chain code. Therefore, the chain code train "210" is modified to be "2200".
  • the last chain code c on the horizontal line indicates the corner point a
  • the chain code on the corner point a indicates the first pixel d on the horizontal line.
  • Fig. 9 (a) shows a up-and leftwardly opening right angle corner.
  • the chain code train on the vertical line advances "...665" toward the corner point a.
  • the chain code train advances "44" on the horizontal line.
  • This right angle corner is defined by the last two chain codes b and c on the horizontal line as well as the first chain code d on the vertical line.
  • This chain code train is "654". It means that there exists a left-and upwardly opening right angle corner when the chain code train includes the chain codes "654".
  • Fig. 9 (b) shows a chain code diagram in which the chain code train in Fig. 9 (a) is changed according to the present invention.
  • the last chain code c on the vertical line is changed from "5" to "6” and a new chain code "4" is appended after the changed chain code. Therefore, the chain code train "654" is modified to be "6644".
  • the last chain code c on the horizontal line indicates the corner point a
  • the chain code on the corner point a indicates the first pixel d on the vertical line.
  • Fig. 10 (a) shows a right-and upwardly opening right angle corner.
  • the chain code train on the vertical line advances "...443" toward the corner point a.
  • the chain code train advances "22" on the horizontal line.
  • This right angle corner is defined by the last two chain codes b and c on the horizontal line as well as the first chain code d on the vertical line.
  • This chain code train is "432". It means that there exists a right-and upwardly opening right angle corner when the chain code train includes the chain codes "432".
  • Fig. 10 (b) shows the modification.
  • the last two chain code c on the horizontal line is changes from “3" to "4" and a new chain code "2" is given to the corner point.
  • the chain code train "432" is modified to be "4422".
  • the last chain code c on the horizontal line indicates the corner point a and the chain code on the corner point indicates the first pixel d on the vertical line.
  • the processing above is processing for outer boundary.
  • the processing for inner boundary is described hereinafter.
  • Fig. 12 (a) shows a chain code diagram of an inner boundary.
  • the chain code train is "0007666544432221".
  • the right angle corners are defined by the chain codes “076”, “654", "432” or "210", similarly to the outer right angles corner.
  • the chain code trains are processed or modified similarly to the outer boundary, that is, "076” is changed to “0066”, “654" is changed to “6644”, “432” is changed to “4422” and "210” is changed to "2200", as shown in Fig. 8.
  • the corner points a1, a2, a3 and a4 are given new chain codes, and the chain codes to which the corner points follow are changed from “7” to "0", “5" to "6", “3” to "4" or "1” to "2".
  • the right angle corner is detected by successive chains of three codes.
  • stepwise boundary consisting of fine steps in Fig. 18, it may be better to reappear the boundary as a straight line. Therefore, it is possible to make a judgement of right angle corner only when there exists a continuous straight line longer than a predetermined length at both ends of the 3 chain codes mentioned above.
  • a chain code train "00766" is deemed to define a right angle corner so as to be changed to "000666" (fig. 7).
  • Fig. 14 (a) shows a chain code diagram in which clockwise chain code train is given to the configuration same as that in Fig. 8.
  • the right angle corner is defined by the chain codes "456”.
  • Fig. 14 (b) shows a modification of chain code train, from "456" to "4466". By the modification, the right angle corner can be clearly reappeared.
  • Fig. 15 (a) shows a chain code diagram in which clockwise chain code train is given to the configuration same as that in Fig. 9.
  • the right angle corner is defined by the chain codes "012”.
  • Fig. 15 (b) shows a modification of chain code train, from “012" to "0022". By the modification, the right angle corner can be clearly reappeared.
  • Fig. 16 (a) shows a chain code diagram in which clockwise chain code train is given to the configuration same as that in Fig. 10.
  • the right angle corner is defined by the chain codes "234".
  • Fig. 16 (b) shows a modification of chain code train, for "234" to "2244". By the modification, the right angle corner can be clearly reappeared.
  • Fig. 17 shows a processing for a inner boundary or a hole.
  • the inner boundary is given the chain code train in opposite direction to that of outer boundary.
  • the chain code train is "5666700012223444".
  • the last chain code of the train is deemed to be continuous to the first thereof, similarly to the first embodiment.
  • the chain code trains defining the right angle corner are same as that of outer boundary.
  • the chain code trains are "234", "456", "012” and “670", which are to be modified to "2244", "4466", "0022” and “6600", respectively. By this modification, the right angle corners are clearly reappeared.
  • the start point has to be found first.
  • the start point can be defined by the neighbor pixels in the relationship with the scan line direction.
  • the boundary pixel which does not have upper and left neighbors can be defined as the start point of the chain code on the outer boundary, as shown in Fig. 19.
  • the boundary pixel a with lower left neighbor but without lower neighbor can be defined as the start point of the chain code on the inner boundary, as shown in Fig. 20.
  • the chain code train on the inner boundary can be also generated according to the algorithms for outer boundary.
  • the following chain code can be determined by searching boundary pixel anticlockwisely from the direction of the chain code (k-1).
  • the direction in which the boundary pixel is found first is the direction corresponding to the chain code of the pixel.
  • the search begins from the direction of the chain code (k-2).
  • This algorithm is efficient because the total chain code train is generated by tracing the boundary pixels once.
  • the algorithm is effective for filling holes because the outer boundary and inner boundary are distinguished from each other.
  • the pixel of chain code “k′” can be extracted as a vector point when the relationship between k and k′ is as follows : k ⁇ k′ and k′ ⁇ (k-1)
  • the pixel of the chain code "k′ " in the following chain code train should be extracted as a vector point. k, (k-1), (k-1), ..., (k-1), k′ where, k′ ⁇ k-1.
  • start point a is omitted according to the chain code train to which the start point follows.
  • connecting point b should be extracted as a vector point.
  • a chain code train of constant chain codes defines a straight line in geometrical meaning. When two straight lines with different inclinations from each other are connected at the end points with each other, as shown in Fig. 24, both straight lines should be reappeared.
  • a line of chain code train "5, 5, " is followed by a line of chain code train “6, 6, ".
  • the start point of the line of chain code "5" is a and the end point thereof is b.
  • Fig. 25 shows a one pixel concavity after a straight line of chain code "5".
  • the bottom point of the concavity can be extracted, by extracting a pixel with a chain code different from and after the constant chain codes defining a straight line.
  • Fig. 26 shows a two pixels straight line after a straight line with a chain code less by "1" than that of the first straight line.
  • the chain code train may be explained as follows; k, k, ..., k, k-1, k′ where, k′ ⁇ k-1
  • the pixel a of the chain code "k-1" should be omitted from vector points.
  • the next pixel b of the chain code k′ should be extracted as a vector point, as is mentioned concerning Figs 22 and 23.
  • Fig. 27 shows a chain code diagram of a boundary consisting of two straight lines.
  • the first line has chain codes of "5" and the second line has chain codes "4".
  • the start point b of the second line should be extracted as a vector point.
  • the pixel corresponding to the underlined chain code should be extracted in the following chain code train.
  • the configuration in Fig. 30 has the inclination opposite to the configuration of Fig. 28.
  • the chain code trains "443" are repeatedly generated.
  • the configuration in Fig. 31 has the inclination opposite to the configuration of Fig. 29.
  • the chain code trains "001" are repeatedly generated.
  • the start point of the first step and the end point of the last step may be extracted as vector points so that the configuration is approximated as a straight line.
  • the configuration in Fig. 32 has repeated chain code trains of "665".
  • the configuration in Fig. 33 has repeated chain code trains of "667".
  • the configuration in Fig. 34 has repeated chain code trains of "223".
  • the configuration in Fig. 35 has repeated chain code trains of "221".
  • the generalized rules are also applicable to vectorizing of a hole.
  • the chain code train is generated clockwisely, oppositely to the above, the chain code changes in the chain code train should be reversely understood, that is, the increment and decrement are reversed.
  • vector data can be easily be generated without complex angular calculation.
  • a high quality configuration can be reappeared from the vector data.

Claims (26)

  1. Verfahren zum Vektorisieren gespeicherter Randdaten einer Konfiguration, die in einem aus Pixel bestehenden Bild enthalten ist mit folgenden Schritten:
    a) Erzeugen eines ursprünglichen Zuges aus Chain Codes, wobei der Wert der Codes die Randpixel der Konfiguration spezifiziert;
    wobei das Verfahren gekennzeichnet ist durch folgende Schritte:
    b) Identifizieren vorbestimmter Muster aus Codewerten in dem ursprünglichen Zug von Chain Codes, wobei die vorbestimmten Muster rechtwinklige konkave Ecken der Konfiguration definieren und wobei es eine durchgehend gerade Linie an beiden Enden der rechtwinkligen konkaven Ecken gibt, welche eine vorbestimmte Mindestlänge aufweist;
    c) Erzeugen eines veränderten Zuges von Codes durch Modifizieren der vorgegebenen Muster der Codewerte, so daß jedem Eckpunktpixel, welcher keinen Chain Code in dem ursprünglichen Zug von Chain-Codes aufwies, da er kein Randpixel war, ein Chain-Codewert zugewiesen wird;
    d) Extrahieren von Vektorpunkten, die die Grenzen der Konfiguration definieren, aus dem veränderten Zug von Codes entsprechend bestimmter Codekombinationen in dem veränderten Zug erfolgen.
  2. Verfahren nach Anspruch 1, bei dem die Codes Freeman-Chain Codes sind.
  3. Verfahren im Gegenuhrzeigersinn nach Anspruch 2, bei dem der Schritt des Extrahierens von Vektorpunkten den Schritt des Extrahierens eines Pixels entsprechend dem Chain Code k2 in einem Chain Code-Zug von "k1, k2, k3", welcher in dem veränderten Zug von Codes enthalten ist, wenn k2≠k1-1 und k1≠k2, k2≠k3, k3≠k1 ist, aufweist.
  4. Verfahren im Gegenuhrzeigersinn nach Anspruch 2, bei dem der Schritt des Extrahierens von Vektorpunkten einen Schritt zum Extrahieren eines Pixels entsprechend dem Chain Code k3 in dem Chain Code-Zug von "k1, k2, k3", wie er in dem veränderten Zug von Codes enthalten ist, enthält, wobei k2≠k1-1 und k1≠k2, k2≠k3, k3≠k1 gilt.
  5. Verfahren im Gegenuhrzeigersinn nach Anspruch 2, bei dem der Schritt des Extrahierens von Vektorpunkten einen Schritt des Extrahierens eines Pixels entsprechend dem Chain Code k2 in einem Chain Code-Zug von "k1, k1,..., k1, k2, k3", wie er in dem veränderten Zug von Codes enthalten ist, einschließt, wobei k1≠k2, k2≠3, k3≠k1, k2≠k1-1 gilt.
  6. Verfahren im Gegenuhrzeigersinn nach Anspruch 2, bei dem der Schritt des Extrahierens einen Schritt des Extrahierens eines Pixels entsprechend dem Chain Code k3 in einem Chain Code-Zug von "k1, k1,..., k1, k2, k3", wie er in dem veränderten Zug von Codes enthalten ist, einschließt, wobei k1≠k2, k2≠k3, k3≠k1, k2≠k1-1 gilt.
  7. Verfahren im Gegenuhrzeigersinn nach Anspruch 2, bei dem der Schritt des Extrahierens von Vektorpunkten den Schritt des Extrahierens eines Pixels entsprechend dem ersten Chain Code k2 in einem Chain Code-Zug von "k1, k2, k2,..., k2, k3", wie er in dem veränderten Zug von Codes enthalten ist, einschließt, wobei k1≠k2, k2≠k3, k3≠k1 und k2≠k1-1 gilt.
  8. Verfahren im Gegenuhrzeigersinn nach Anspruch 2, bei dem der Schritt des Extrahierens von Vektorpunkten einen Schritt des Extrahierens eines Pixels entsprechend dem Chain Code k3 in dem Chain Code-Zug von "k1, k2, k2,..., k2, k3", wie er in dem veränderten Zug von Codes enthalten ist, einschließt, wobei k1≠k2, k2≠k3, k3≠k1 und k2≠k1-1 git.
  9. Verfahren im Gegenuhrzeigersinn nach Anspruch 2, wobei der Schritt des Extrahierens von Vektorpunkten einen Schritt des Extrahierens eines Pixels entsprechend dem ersten Chain Code von k2 in dem Chain Code-Zug "k1, k1,..., k1, k2, k2 ..., k2, k3", wie er in dem veränderten Zug von Codes enthalten ist, einschließt, wobei k1≠k2, k2≠k3, k3≠k1 gilt.
  10. Verfahren im Gegenuhrzeigersinn nach Anspruch 2, wobei der Schritt des Extrahierens von Vektorpunkten einen Schritt des Extrahierens von Pixeln entsprechend dem ersten Chain Code k beim ersten und letzten Auftreten einer sich in dem ursprünglichen Zug von Codes wiederholenden Chain Code-Kombination von "k, k, ..., k, k-1" einschließt.
  11. Verfahren im Gegenuhrzeigersinn nach Anspruch 2, wobei der Schritt des Extrahierens von Vektorpunkten einen Schritt des Extrahierens von Pixeln entspechend einem Chain Code k+l beim ersten und letzten Auftreten einer sich wiederholenden Chain Code-Kombination von "k, k,..., k, k+1", wie sie wiederholt in dem ursprünglichen Zug von Codes enthalten ist, einschließt.
  12. Verfahren im Uhrzeigersinn nach Anspruch 2, bei dem der Schritt des Extrahierens von Vektorpunkten einen Schritt des Extrahierens eines Pixels entsprechend dem Chain Code k2 in einem Chain Code-Zug von "k1, k2, k3", welcher in dem veränderten Zug von Codes enthalten ist, wenn k2≠k1+1 und k1≠k2, k2≠k3, k3≠k1 ist, enthält.
  13. Verfahren im Uhrzeigersinn nach Anspruch 2, bei dem der Schritt des Extrahierens von Vektorpunkten einen Schritt zum Extrahieren eines Pixels entsprechend dem Chain Code k3 in den Chain Code-Zug von "k1, k2, k3", wie er in dem veränderten Zug von Codes enthalten ist, enthält, wobei k2≠k1+1 und k1≠k2, k2≠k3, k3≠k1 gilt.
  14. Verfahren im Uhrzeigersinn nach Anspruch 2, bei dem der Schritt des Extrahierens von Vektorpunkten einen Schritt des Extrahierens eines Pixels entsprechend dem Chain Code k2 in einem Chain Code-Zug von "k1, k1,..., k1, k2, k3", wie er in dem veränderten Zug von Codes enthalten ist, einschließt, wobei k1≠k2, k2≠k3, k3≠k1, k2≠k1+1 gilt.
  15. Verfahren im Uhrzeigersinn nach Anspruch 2, bei dem der Schritt des Extrahierens einen Schritt des Extrahierens eines Pixels entsprechend dem Chain Code k3 in einem Chain Code-Zug von "k1, k1 ..., k1, k2, k3", wie er in dem veränderten Zug von Codes enthalten ist, einschließt, wobei k1≠k2, k2≠k3, k3≠k1, k2≠k1+1 gilt.
  16. Verfahren im Uhrzeigersinn nach Anspruch 2, bei dem der Schritt des Extrahierens von Vektorpunkten den Schritt des Extrahierens eines Pixels entsprechend dem ersten Chain Code k2 in einem Chain Code-Zug von "k1, k2, k2,..., k2, k3", wie er in dem veränderten Zug von Codes enthalten ist, einschließt, wobei k1≠k2, k2≠k3, k3≠k1 und k2≠k1+1 gilt.
  17. Verfahren im Uhrzeigersinn nach Anspruch 2, bei dem der Schritt des Extrahierens von Vektorpunkten einen Schritt des Extrahierens eines Pixels entsprechend dem Chain Code k3 in dem Chain Code-Zug von "k1, k2, k2,..., k2, k3", wie er in dem veränderten Zug von Codes enthalten ist, einschließt, wobei k1≠k2, k2≠k3, k3≠k1 und k2≠k1+1 gilt.
  18. Verfahren im Uhrzeigersinn nach Anspruch 2, wobei der Schritt des Extrahierens von Vektorpunkten ein Schritt des Extrahierens von Pixeln entsprechend dem ersten Chain Code k beim ersten und letzten Auftreten einer wiederholenden Chain Code-Kombination von "k, k,..., k, k-1", wie er wiederholt in dem ursprünglichen Zug von Codes enthalten ist, einschließt.
  19. Verfahren im Uhrzeigersinn nach Anspruch 2, wobei der Schritt des Extrahierens von Vektorpunkten einen Schritt des Extrahierens von Pixeln entspechend einem Chain Code k+1 beim ersten und letzten Auftren einer sich wiederholenden Chain Code-Kombination von "k, k,..., k, k+1", wie sie wiederholt in dem ursprünglichen Zug von Codes enthalten ist, einschließt.
  20. Verfahren nach Anspruch 1, bei dem der Schritt des Erzeugens eines ursprünglichen Zugs von Codes folgende Schritte einschließt:
    Erzeugen eines ursprünglichen Zugs von Codes für einen äußeren Rand in einer ersten Umlaufrichtung um die Konfiguration; und
    Erzeugen eines ursprünglichen Zugs von Codes für einen inneren Rand der Konfiguration in einer entgegengesetzten Umlaufrichtung gegenüber der für den äußeren Rand.
  21. Verfahren nach Anspruch 1, bei dem der Schritt des Erzeugen eines ursprünglichen Zugs von Codes einen Schritt mit einschließt, bei dem ein Pixel beurteilt wird, um festzustellen, ob dieser ein Startpunkt des ursprünglichen Zugs von Codes ist, in dem seine Nachbarpixel bewertet werden.
  22. Verfahren nach Anspruch 21, bei dem der Schritt des Beurteilen eines Pixels den Schritt des Definierens eines Randpixels mit weder oberen noch linken Nachbarn als Startpunkt des ursprünglichen Zugs von Codes auf dem äußeren Rand mit einschließt, wenn die Abtastung von links nach rechts und von oben nach unten verläuft.
  23. Verfahren nach Anspruch 21, bei dem der Schritt des Beurteilen eines Pixels den Schritt des Definierens eines Randpixels mit einem linken Nachbarn, jedoch ohne einen unteren Nachbar, als Startpunkt des ursprünglichen Zugs von Codes auf dem inneren Rand mit einschließt, wenn die Abtastung nach rechts und von oben nach unten erfolgt.
  24. Verfahren nach Anspruch 1, bei dem der Schritt des Erzeugens eines ursprünglichen Zugs von Codes folgende Schritte aufweist:
    Erzeugen von Codes entsprechend einem Umlaufsinn um die Konfiguration; und
    Suchen von Randpixeln, die zu einem Pixel benachbart sind, und deren ein Code in gleicher Umlaufrichtung wie bei der Erzeugung des ursprünglichen Zugs von Codes gegeben wird.
  25. Verfahren nch Anspruch 24, wobei
    der Zug von Codes aus Freeman-Chain Codes besteht;
    dem Pixel, dem ein Chain Code gegeben wird, sich in einem Abstand k von dem ursprünglichen Pixel befindet; und
    der Suchschritt von der Richtung (k-1) beginnt, wenn k eine gerade Anzahl ist.
  26. Verfahren nach Anspruch 24, wobei der Zug von Codes aus Freeman-Codes besteht;
    der Pixel, dem ein Chain Code zugewiesen wird, in Richtung k von dem vorhergehenden Pixel liegt; und
    der Suchschritt von der Richtung (k-2) beginnt, wenn k eine ungerade Zahl ist.
EP88121903A 1988-12-30 1988-12-30 Vektorisationsverfahren Expired - Lifetime EP0375805B1 (de)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP88121903A EP0375805B1 (de) 1988-12-30 1988-12-30 Vektorisationsverfahren
DE3853885T DE3853885T2 (de) 1988-12-30 1988-12-30 Vektorisationsverfahren.
US07/292,309 US5007098A (en) 1988-12-30 1988-12-30 Vectorizing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP88121903A EP0375805B1 (de) 1988-12-30 1988-12-30 Vektorisationsverfahren

Publications (2)

Publication Number Publication Date
EP0375805A1 EP0375805A1 (de) 1990-07-04
EP0375805B1 true EP0375805B1 (de) 1995-05-24

Family

ID=8199731

Family Applications (1)

Application Number Title Priority Date Filing Date
EP88121903A Expired - Lifetime EP0375805B1 (de) 1988-12-30 1988-12-30 Vektorisationsverfahren

Country Status (3)

Country Link
US (1) US5007098A (de)
EP (1) EP0375805B1 (de)
DE (1) DE3853885T2 (de)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4254337A1 (de) 2023-01-17 2023-10-04 University of Maribor Verfahren zur kodierung und dekodierung binärer bilder unter verwendung von kettenkoden

Families Citing this family (140)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE68920144T2 (de) * 1989-10-12 1995-06-29 Ibm Anzeigesystem.
US5265173A (en) * 1991-03-20 1993-11-23 Hughes Aircraft Company Rectilinear object image matcher
US5568566A (en) * 1991-11-25 1996-10-22 Kabushiki Kaisha Toshiba Drawing processing apparatus
EP0553762B1 (de) * 1992-01-27 2000-05-03 Canon Kabushiki Kaisha Bildverarbeitungs-Verfahren und Vorrichtung
US5380428A (en) * 1992-04-22 1995-01-10 Product Research & Development Pump for reverse osmosis system
US5418862A (en) * 1992-08-10 1995-05-23 United Parcel Service Of America Method and apparatus for detecting artifact corners in two-dimensional images
US5362796A (en) 1993-08-09 1994-11-08 Isp Investments Inc. Molded crosslinked vinyl lactam polymer gel and method of preparation
JPH0749927A (ja) * 1993-08-09 1995-02-21 Nireco Corp パターン認識方法
EP0650287B1 (de) * 1993-10-26 2004-03-10 Canon Kabushiki Kaisha Bildverarbeitungsverfahren und -gerät
US5600733A (en) * 1993-11-01 1997-02-04 Kulicke And Soffa Investments, Inc Method for locating eye points on objects subject to size variations
US5577134A (en) * 1994-01-07 1996-11-19 Panasonic Technologies, Inc. Method and apparatus for encoding a segmented image without loss of information
JP2918465B2 (ja) * 1994-11-14 1999-07-12 大日本スクリーン製造株式会社 画像処理方法
US6005680A (en) 1995-04-04 1999-12-21 Canon Information Systems, Inc. Method for capturing a document image, a scanner using the method and a document image management system using the scanner
US6041137A (en) * 1995-08-25 2000-03-21 Microsoft Corporation Radical definition and dictionary creation for a handwriting recognition system
KR100203266B1 (ko) * 1996-07-09 1999-06-15 윤종용 윤곽선복호화장치
US5969317A (en) * 1996-11-13 1999-10-19 Ncr Corporation Price determination system and method using digitized gray-scale image recognition and price-lookup files
US6310970B1 (en) * 1998-06-24 2001-10-30 Colorcom, Ltd. Defining surfaces in border string sequences representing a raster image
US6324300B1 (en) * 1998-06-24 2001-11-27 Colorcom, Ltd. Defining color borders in a raster image
US6226400B1 (en) 1998-06-24 2001-05-01 Colorcom, Ltd. Defining color borders in a raster image by identifying and breaking contrast ties
US8645137B2 (en) 2000-03-16 2014-02-04 Apple Inc. Fast, language-independent method for user authentication by voice
US7069108B2 (en) 2002-12-10 2006-06-27 Jostens, Inc. Automated engraving of a customized jewelry item
MXPA06012036A (es) * 2004-04-19 2011-06-16 Jostens Inc Sistema y metodo para alisar imagenes tridimensionales.
US8677377B2 (en) 2005-09-08 2014-03-18 Apple Inc. Method and apparatus for building an intelligent automated assistant
CN100403769C (zh) * 2006-04-29 2008-07-16 北京北大方正电子有限公司 一种在排版过程中进行图像勾边的方法
JP4829835B2 (ja) * 2006-06-12 2011-12-07 キヤノン株式会社 画像処理装置、画像処理方法、コンピュータプログラム、及びコンピュータ読み取り可能な記憶媒体
US9318108B2 (en) 2010-01-18 2016-04-19 Apple Inc. Intelligent automated assistant
MX2009007745A (es) 2007-01-18 2009-12-01 Jostens Inc Sistema y metodo para generar instrucciones para personalizar.
WO2008112796A1 (en) 2007-03-12 2008-09-18 Jostens, Inc. Method for embellishment placement
US8977255B2 (en) 2007-04-03 2015-03-10 Apple Inc. Method and system for operating a multi-function portable electronic device using voice-activation
US9330720B2 (en) 2008-01-03 2016-05-03 Apple Inc. Methods and apparatus for altering audio output signals
US8996376B2 (en) 2008-04-05 2015-03-31 Apple Inc. Intelligent text-to-speech conversion
US10496753B2 (en) 2010-01-18 2019-12-03 Apple Inc. Automatically adapting user interfaces for hands-free interaction
US20100030549A1 (en) 2008-07-31 2010-02-04 Lee Michael M Mobile device having human language translation capability with positional feedback
US9959870B2 (en) 2008-12-11 2018-05-01 Apple Inc. Speech recognition involving a mobile device
US10241644B2 (en) 2011-06-03 2019-03-26 Apple Inc. Actionable reminder entries
US9858925B2 (en) 2009-06-05 2018-01-02 Apple Inc. Using context information to facilitate processing of commands in a virtual assistant
US10241752B2 (en) 2011-09-30 2019-03-26 Apple Inc. Interface for a virtual digital assistant
US10706373B2 (en) 2011-06-03 2020-07-07 Apple Inc. Performing actions associated with task items that represent tasks to perform
US9431006B2 (en) 2009-07-02 2016-08-30 Apple Inc. Methods and apparatuses for automatic speech recognition
US10705794B2 (en) 2010-01-18 2020-07-07 Apple Inc. Automatically adapting user interfaces for hands-free interaction
US10679605B2 (en) 2010-01-18 2020-06-09 Apple Inc. Hands-free list-reading by intelligent automated assistant
US10553209B2 (en) 2010-01-18 2020-02-04 Apple Inc. Systems and methods for hands-free notification summaries
US10276170B2 (en) 2010-01-18 2019-04-30 Apple Inc. Intelligent automated assistant
WO2011089450A2 (en) 2010-01-25 2011-07-28 Andrew Peter Nelson Jerram Apparatuses, methods and systems for a digital conversation management platform
US8682667B2 (en) 2010-02-25 2014-03-25 Apple Inc. User profiling for selecting user specific voice input processing information
US8977377B2 (en) 2010-02-25 2015-03-10 Jostens, Inc. Method for digital manufacturing of jewelry items
US10762293B2 (en) 2010-12-22 2020-09-01 Apple Inc. Using parts-of-speech tagging and named entity recognition for spelling correction
US9262612B2 (en) 2011-03-21 2016-02-16 Apple Inc. Device access using voice authentication
US8977059B2 (en) * 2011-06-03 2015-03-10 Apple Inc. Integrating feature extraction via local sequential embedding for automatic handwriting recognition
US10057736B2 (en) 2011-06-03 2018-08-21 Apple Inc. Active transport based notifications
US8994660B2 (en) 2011-08-29 2015-03-31 Apple Inc. Text correction processing
US9208265B2 (en) 2011-12-02 2015-12-08 Jostens, Inc. System and method for jewelry design
US10134385B2 (en) 2012-03-02 2018-11-20 Apple Inc. Systems and methods for name pronunciation
US9483461B2 (en) 2012-03-06 2016-11-01 Apple Inc. Handling speech synthesis of content for multiple languages
US9280610B2 (en) 2012-05-14 2016-03-08 Apple Inc. Crowd sourcing information to fulfill user requests
US9721563B2 (en) 2012-06-08 2017-08-01 Apple Inc. Name recognition system
US9495129B2 (en) 2012-06-29 2016-11-15 Apple Inc. Device, method, and user interface for voice-activated navigation and browsing of a document
US9576574B2 (en) 2012-09-10 2017-02-21 Apple Inc. Context-sensitive handling of interruptions by intelligent digital assistant
US9547647B2 (en) 2012-09-19 2017-01-17 Apple Inc. Voice-based media searching
US9582615B2 (en) 2013-01-16 2017-02-28 Jostens, Inc. Modeling using thin plate spline technology
EP2954514B1 (de) 2013-02-07 2021-03-31 Apple Inc. Sprachtrigger für einen digitalen assistenten
US9368114B2 (en) 2013-03-14 2016-06-14 Apple Inc. Context-sensitive handling of interruptions
US10652394B2 (en) 2013-03-14 2020-05-12 Apple Inc. System and method for processing voicemail
AU2014233517B2 (en) 2013-03-15 2017-05-25 Apple Inc. Training an at least partial voice command system
WO2014144579A1 (en) 2013-03-15 2014-09-18 Apple Inc. System and method for updating an adaptive speech recognition model
WO2014197334A2 (en) 2013-06-07 2014-12-11 Apple Inc. System and method for user-specified pronunciation of words for speech synthesis and recognition
US9582608B2 (en) 2013-06-07 2017-02-28 Apple Inc. Unified ranking with entropy-weighted information for phrase-based semantic auto-completion
WO2014197336A1 (en) 2013-06-07 2014-12-11 Apple Inc. System and method for detecting errors in interactions with a voice-based digital assistant
WO2014197335A1 (en) 2013-06-08 2014-12-11 Apple Inc. Interpreting and acting upon commands that involve sharing information with remote devices
US10176167B2 (en) 2013-06-09 2019-01-08 Apple Inc. System and method for inferring user intent from speech inputs
DE112014002747T5 (de) 2013-06-09 2016-03-03 Apple Inc. Vorrichtung, Verfahren und grafische Benutzerschnittstelle zum Ermöglichen einer Konversationspersistenz über zwei oder mehr Instanzen eines digitalen Assistenten
KR101809808B1 (ko) 2013-06-13 2017-12-15 애플 인크. 음성 명령에 의해 개시되는 긴급 전화를 걸기 위한 시스템 및 방법
AU2014306221B2 (en) 2013-08-06 2017-04-06 Apple Inc. Auto-activating smart responses based on activities from remote devices
USD789228S1 (en) 2013-11-25 2017-06-13 Jostens, Inc. Bezel for a ring
US10725650B2 (en) * 2014-03-17 2020-07-28 Kabushiki Kaisha Kawai Gakki Seisakusho Handwritten music sign recognition device and program
US9620105B2 (en) 2014-05-15 2017-04-11 Apple Inc. Analyzing audio input for efficient speech and music recognition
US10592095B2 (en) 2014-05-23 2020-03-17 Apple Inc. Instantaneous speaking of content on touch devices
US9502031B2 (en) 2014-05-27 2016-11-22 Apple Inc. Method for supporting dynamic grammars in WFST-based ASR
US10078631B2 (en) 2014-05-30 2018-09-18 Apple Inc. Entropy-guided text prediction using combined word and character n-gram language models
US9760559B2 (en) 2014-05-30 2017-09-12 Apple Inc. Predictive text input
US9734193B2 (en) 2014-05-30 2017-08-15 Apple Inc. Determining domain salience ranking from ambiguous words in natural speech
US9715875B2 (en) 2014-05-30 2017-07-25 Apple Inc. Reducing the need for manual start/end-pointing and trigger phrases
AU2015266863B2 (en) 2014-05-30 2018-03-15 Apple Inc. Multi-command single utterance input method
US9430463B2 (en) 2014-05-30 2016-08-30 Apple Inc. Exemplar-based natural language processing
US9633004B2 (en) 2014-05-30 2017-04-25 Apple Inc. Better resolution when referencing to concepts
US10170123B2 (en) 2014-05-30 2019-01-01 Apple Inc. Intelligent assistant for home automation
US9785630B2 (en) 2014-05-30 2017-10-10 Apple Inc. Text prediction using combined word N-gram and unigram language models
US9842101B2 (en) 2014-05-30 2017-12-12 Apple Inc. Predictive conversion of language input
US10289433B2 (en) 2014-05-30 2019-05-14 Apple Inc. Domain specific language for encoding assistant dialog
US9338493B2 (en) 2014-06-30 2016-05-10 Apple Inc. Intelligent automated assistant for TV user interactions
US10659851B2 (en) 2014-06-30 2020-05-19 Apple Inc. Real-time digital assistant knowledge updates
US10446141B2 (en) 2014-08-28 2019-10-15 Apple Inc. Automatic speech recognition based on user feedback
US9818400B2 (en) 2014-09-11 2017-11-14 Apple Inc. Method and apparatus for discovering trending terms in speech requests
US10789041B2 (en) 2014-09-12 2020-09-29 Apple Inc. Dynamic thresholds for always listening speech trigger
US9646609B2 (en) 2014-09-30 2017-05-09 Apple Inc. Caching apparatus for serving phonetic pronunciations
US9886432B2 (en) 2014-09-30 2018-02-06 Apple Inc. Parsimonious handling of word inflection via categorical stem + suffix N-gram language models
US10074360B2 (en) 2014-09-30 2018-09-11 Apple Inc. Providing an indication of the suitability of speech recognition
US10127911B2 (en) 2014-09-30 2018-11-13 Apple Inc. Speaker identification and unsupervised speaker adaptation techniques
US9668121B2 (en) 2014-09-30 2017-05-30 Apple Inc. Social reminders
US10552013B2 (en) 2014-12-02 2020-02-04 Apple Inc. Data detection
US9711141B2 (en) 2014-12-09 2017-07-18 Apple Inc. Disambiguating heteronyms in speech synthesis
US9865280B2 (en) 2015-03-06 2018-01-09 Apple Inc. Structured dictation using intelligent automated assistants
US10567477B2 (en) 2015-03-08 2020-02-18 Apple Inc. Virtual assistant continuity
US9721566B2 (en) 2015-03-08 2017-08-01 Apple Inc. Competing devices responding to voice triggers
US9886953B2 (en) 2015-03-08 2018-02-06 Apple Inc. Virtual assistant activation
US9899019B2 (en) 2015-03-18 2018-02-20 Apple Inc. Systems and methods for structured stem and suffix language models
US9842105B2 (en) 2015-04-16 2017-12-12 Apple Inc. Parsimonious continuous-space phrase representations for natural language processing
US10083688B2 (en) 2015-05-27 2018-09-25 Apple Inc. Device voice control for selecting a displayed affordance
US10127220B2 (en) 2015-06-04 2018-11-13 Apple Inc. Language identification from short strings
US10101822B2 (en) 2015-06-05 2018-10-16 Apple Inc. Language input correction
US10255907B2 (en) 2015-06-07 2019-04-09 Apple Inc. Automatic accent detection using acoustic models
US11025565B2 (en) 2015-06-07 2021-06-01 Apple Inc. Personalized prediction of responses for instant messaging
US10186254B2 (en) 2015-06-07 2019-01-22 Apple Inc. Context-based endpoint detection
US10747498B2 (en) 2015-09-08 2020-08-18 Apple Inc. Zero latency digital assistant
US10671428B2 (en) 2015-09-08 2020-06-02 Apple Inc. Distributed personal assistant
US9697820B2 (en) 2015-09-24 2017-07-04 Apple Inc. Unit-selection text-to-speech synthesis using concatenation-sensitive neural networks
US11010550B2 (en) 2015-09-29 2021-05-18 Apple Inc. Unified language modeling framework for word prediction, auto-completion and auto-correction
US10366158B2 (en) 2015-09-29 2019-07-30 Apple Inc. Efficient word encoding for recurrent neural network language models
US11587559B2 (en) 2015-09-30 2023-02-21 Apple Inc. Intelligent device identification
US10691473B2 (en) 2015-11-06 2020-06-23 Apple Inc. Intelligent automated assistant in a messaging environment
US10049668B2 (en) 2015-12-02 2018-08-14 Apple Inc. Applying neural network language models to weighted finite state transducers for automatic speech recognition
US10223066B2 (en) 2015-12-23 2019-03-05 Apple Inc. Proactive assistance based on dialog communication between devices
US10446143B2 (en) 2016-03-14 2019-10-15 Apple Inc. Identification of voice inputs providing credentials
US9934775B2 (en) 2016-05-26 2018-04-03 Apple Inc. Unit-selection text-to-speech synthesis based on predicted concatenation parameters
US9972304B2 (en) 2016-06-03 2018-05-15 Apple Inc. Privacy preserving distributed evaluation framework for embedded personalized systems
US10249300B2 (en) 2016-06-06 2019-04-02 Apple Inc. Intelligent list reading
US10049663B2 (en) 2016-06-08 2018-08-14 Apple, Inc. Intelligent automated assistant for media exploration
DK179309B1 (en) 2016-06-09 2018-04-23 Apple Inc Intelligent automated assistant in a home environment
US10490187B2 (en) 2016-06-10 2019-11-26 Apple Inc. Digital assistant providing automated status report
US10067938B2 (en) 2016-06-10 2018-09-04 Apple Inc. Multilingual word prediction
US10586535B2 (en) 2016-06-10 2020-03-10 Apple Inc. Intelligent digital assistant in a multi-tasking environment
US10509862B2 (en) 2016-06-10 2019-12-17 Apple Inc. Dynamic phrase expansion of language input
US10192552B2 (en) 2016-06-10 2019-01-29 Apple Inc. Digital assistant providing whispered speech
DK179415B1 (en) 2016-06-11 2018-06-14 Apple Inc Intelligent device arbitration and control
DK179049B1 (en) 2016-06-11 2017-09-18 Apple Inc Data driven natural language event detection and classification
DK201670540A1 (en) 2016-06-11 2018-01-08 Apple Inc Application integration with a digital assistant
DK179343B1 (en) 2016-06-11 2018-05-14 Apple Inc Intelligent task discovery
US10593346B2 (en) 2016-12-22 2020-03-17 Apple Inc. Rank-reduced token representation for automatic speech recognition
DK179745B1 (en) 2017-05-12 2019-05-01 Apple Inc. SYNCHRONIZATION AND TASK DELEGATION OF A DIGITAL ASSISTANT
DK201770431A1 (en) 2017-05-15 2018-12-20 Apple Inc. Optimizing dialogue policy decisions for digital assistants using implicit feedback

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5619657B2 (de) * 1973-09-10 1981-05-08
GB1517869A (en) * 1976-12-20 1978-07-12 Ibm Image encoding apparatus
JPS5851388A (ja) * 1981-09-22 1983-03-26 Ricoh Co Ltd 方向コ−ド割付け方法
EP0090395B1 (de) * 1982-03-31 1990-08-29 General Electric Company Verfahren und Gerät zur Sehbildverarbeitung und zur Eckpunktsortierung in einem Sehbild-Verarbeitungssystem
JPS5930179A (ja) * 1982-08-10 1984-02-17 Agency Of Ind Science & Technol パタ−ンの線分近似方式
GB8311813D0 (en) * 1983-04-29 1983-06-02 West G A W Coding and storing raster scan images
US4628532A (en) * 1983-07-14 1986-12-09 Scan Optics, Inc. Alphanumeric handprint recognition
JPS60136892A (ja) * 1983-12-26 1985-07-20 Hitachi Ltd オンライン手書き図形認識装置
JPS6282486A (ja) * 1985-10-08 1987-04-15 Hitachi Ltd オンライン手書き図形認識装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4254337A1 (de) 2023-01-17 2023-10-04 University of Maribor Verfahren zur kodierung und dekodierung binärer bilder unter verwendung von kettenkoden

Also Published As

Publication number Publication date
EP0375805A1 (de) 1990-07-04
DE3853885D1 (de) 1995-06-29
US5007098A (en) 1991-04-09
DE3853885T2 (de) 1995-09-14

Similar Documents

Publication Publication Date Title
EP0375805B1 (de) Vektorisationsverfahren
Amo et al. Road extraction from aerial images using a region competition algorithm
US5859929A (en) System for character preserving guidelines removal in optically scanned text
Smith Computer processing of line images: A survey
Cheung et al. An Arabic optical character recognition system using recognition-based segmentation
EP1380986B1 (de) System und Verfahren zum Analysieren einer Bildkontur mittels Bearbeitung durch einen Sobel-Operator
US5033104A (en) Method for detecting character strings
US4843630A (en) Method of bridging between contour elements in an image
US4630308A (en) Character reader
WO1997008649A1 (en) Drawing pixmap to vector conversion
CN110021024A (zh) 一种基于lbp和链码技术的图像分割方法
WO1997020285A9 (en) System for character preserving guideline removal in optically scanned text
CN109101854A (zh) 一种多条形码定位方法
Ramer Extraction of line structures from photographs of curved objects
Stiene et al. Contour-based object detection in range images
Eikvil et al. Tools for interactive map conversion and vectorization
Gamba et al. Perceptual grouping for symbol chain tracking in digitized topographic maps
Ramel et al. A structural representation adapted to handwritten symbol recognition
Privitera et al. A system for scanning and segmenting cursively handwritten words into basic strokes
Gangyi et al. Approach to lane departure detection
Cung et al. Multiscale edge detection and classification in range images
Rosin et al. Detection of Circular Arcs in Images.
JP2615153B2 (ja) 切断分離を伴う文字認識方法
JPS5850078A (ja) 文字認識装置
JP2683026B2 (ja) 線図形ベクトル化装置

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

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): BE DE FR GB IT NL SE

17P Request for examination filed

Effective date: 19900801

17Q First examination report despatched

Effective date: 19930402

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: EZEL INC.

Owner name: SHARP KABUSHIKI KAISHA

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: EZEL INC.

Owner name: SHARP KABUSHIKI KAISHA

RAP3 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SHARP KABUSHIKI KAISHA

Owner name: EZEL INC.

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): BE DE FR GB IT NL SE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.

Effective date: 19950524

Ref country code: BE

Effective date: 19950524

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 19950524

REF Corresponds to:

Ref document number: 3853885

Country of ref document: DE

Date of ref document: 19950629

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Effective date: 19950824

ET Fr: translation filed
NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
RAP2 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: SHARP KABUSHIKI KAISHA

Owner name: YOZAN INC.

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
REG Reference to a national code

Ref country code: FR

Ref legal event code: TP

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

REG Reference to a national code

Ref country code: GB

Ref legal event code: IF02

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

REG Reference to a national code

Ref country code: FR

Ref legal event code: CD

Ref country code: FR

Ref legal event code: TP

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20071227

Year of fee payment: 20

Ref country code: FR

Payment date: 20071210

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20071231

Year of fee payment: 20

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20081229

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20081229