CA1219080A - Method and an apparatus for coding/decoding telewriting signals - Google Patents
Method and an apparatus for coding/decoding telewriting signalsInfo
- Publication number
- CA1219080A CA1219080A CA000431469A CA431469A CA1219080A CA 1219080 A CA1219080 A CA 1219080A CA 000431469 A CA000431469 A CA 000431469A CA 431469 A CA431469 A CA 431469A CA 1219080 A CA1219080 A CA 1219080A
- Authority
- CA
- Canada
- Prior art keywords
- zone
- difference vector
- difference
- quadrant
- signals
- 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
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/03—Arrangements for converting the position or the displacement of a member into a coded form
- G06F3/033—Pointing devices displaced or positioned by the user, e.g. mice, trackballs, pens or joysticks; Accessories therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V30/00—Character recognition; Recognising digital ink; Document-oriented image-based pattern recognition
- G06V30/10—Character recognition
- G06V30/32—Digital ink
- G06V30/333—Preprocessing; Feature extraction
- G06V30/347—Sampling; Contour coding; Stroke extraction
Abstract
Abstract of the Disclosure A difference vector indicating movement of a pen between two adjacent sampled points is divided into macro movement and micro movement components. The macro and micro components are coded independently of each other so as to provide effective coding.
In the case of coding the difference vector, the magnitude of the difference vector is coded in accordance with the types of zones (zone number k) and relative pel address within the zone. In order to improve the coding efficiency, a zone number difference is used instead of the zone number. Furthermore, the direction of the difference vector is expressed by a quadrant which includes this difference vector. In order to further improve the coding efficiency, a quadrant number difference is used instead of the quadrant number.
In the case of coding the difference vector, the magnitude of the difference vector is coded in accordance with the types of zones (zone number k) and relative pel address within the zone. In order to improve the coding efficiency, a zone number difference is used instead of the zone number. Furthermore, the direction of the difference vector is expressed by a quadrant which includes this difference vector. In order to further improve the coding efficiency, a quadrant number difference is used instead of the quadrant number.
Description
$~
TITLE OF THE I~VENTION:
A ~IETHOD AND AN APPARATUS FOR CODING/DECODING
TELEWRITING SIGNALS
BACKGRO~ND O~ THE INV~NTION:
I. Field of the Invention The present invention relates to a method and an apparatus for coding/decoding telewriting signals such as handwriting signals representing handwritten characters and graphics for transmission and display in a telewriting system.
II. Brief Description of the Prior Art A communication system for simultaneously transmitting voice and handwritten information through an ordinary telephone channel is called a telewriting system. The bit rate allowed in transmitting handwriting signals must be maintained at about 300 bits/sec or less unless major degradation in voice quality is permissible. A codin~ method which enables handwriting signal transmission at a rate of 300 bits/sec or less is therefore essential to the telewriting system. The real-time handwriting signals to be transmitted must be sequentially processed by a coding algorithm. Furthermore, a simple, compact encoder must be used since it is built into a telewriting terminal.
Various coding techniques to store line drawing data have been proposed in the fields of picture processing, picture recognitlon, anà _omputer ~t, ~æ~s~s~
graphics. Two coding methods suitable for the telewriting svstem have been conven.ionally known: (l) difl~erential chain encoding (DCE) and (2) modified DPC~I
(MDPCM).
(l) DCE Method In the DCE method, a change in direction of a drawn line i5 coded. A window comprising a 5 x 7 pel matrix is formed such that a pen position matc~ts with the center of the matrix. The movement of the pen across any one of the peripheral 20 pels in the window is detected. An exponent corresponding to the direction of movement of the pen is determined by the pel position crossed by the pen. In a system wherein such exponents are sequentially obtained, a difference between two adjacent exponents is obtained and coded to a variable-length code, thereby encoding the change in direction of the drawn line.
The DCE method has a considerably high coding efficiency when the handwriting speed is slow.
However, when the handwriting speed is increased, the coding efficiency is abruptly decreased. Furthermore, since part of the picture information is omitted by the window, the picture resolution is degraded accordingly.
TITLE OF THE I~VENTION:
A ~IETHOD AND AN APPARATUS FOR CODING/DECODING
TELEWRITING SIGNALS
BACKGRO~ND O~ THE INV~NTION:
I. Field of the Invention The present invention relates to a method and an apparatus for coding/decoding telewriting signals such as handwriting signals representing handwritten characters and graphics for transmission and display in a telewriting system.
II. Brief Description of the Prior Art A communication system for simultaneously transmitting voice and handwritten information through an ordinary telephone channel is called a telewriting system. The bit rate allowed in transmitting handwriting signals must be maintained at about 300 bits/sec or less unless major degradation in voice quality is permissible. A codin~ method which enables handwriting signal transmission at a rate of 300 bits/sec or less is therefore essential to the telewriting system. The real-time handwriting signals to be transmitted must be sequentially processed by a coding algorithm. Furthermore, a simple, compact encoder must be used since it is built into a telewriting terminal.
Various coding techniques to store line drawing data have been proposed in the fields of picture processing, picture recognitlon, anà _omputer ~t, ~æ~s~s~
graphics. Two coding methods suitable for the telewriting svstem have been conven.ionally known: (l) difl~erential chain encoding (DCE) and (2) modified DPC~I
(MDPCM).
(l) DCE Method In the DCE method, a change in direction of a drawn line i5 coded. A window comprising a 5 x 7 pel matrix is formed such that a pen position matc~ts with the center of the matrix. The movement of the pen across any one of the peripheral 20 pels in the window is detected. An exponent corresponding to the direction of movement of the pen is determined by the pel position crossed by the pen. In a system wherein such exponents are sequentially obtained, a difference between two adjacent exponents is obtained and coded to a variable-length code, thereby encoding the change in direction of the drawn line.
The DCE method has a considerably high coding efficiency when the handwriting speed is slow.
However, when the handwriting speed is increased, the coding efficiency is abruptly decreased. Furthermore, since part of the picture information is omitted by the window, the picture resolution is degraded accordingly.
(2) MDPCM Method Unlike the DPCM method wherein coordinate differences dxi ~= Xi ~ Xi-l) yi pen positions sampled at predetermined time intervals are coded, the MDPCM encodes the differences d~i anà
:
12~9~80 d i when the absolute values of the differences dXi and dyi 2re equal to or smaller than a predetermined value d (i.e., 0 < IdXil ~ dmax and G ~ Idyi - max encodes an absolute coordinate point ~x, y) when the absolute values of the difterences dXi and dyi are greater than the predetermined value dmaX (i.e., ¦dXill >
d or ,d i¦ > dmaX). The MDPCM method has a high coding efficiency when the handwriting speed is low.
However, when the handwriting speed is increased, the coding efficiency is decreased with an increase in the amount of data to be processed. Furthermore, a high-resolution image cannot be effectively encoded at a high coding efficiency.
As may be apparent from the above description, depending on the types of telewriting signals, the conventional coding method may not satisfy the condition wherein a voice signal and a handwriting signal are simultaneously transmitted at a bi. rate of 300 bitstsec or less. Therefore, the bit rate must be further decreased.
SUMMARY OF THE INVENTION:
It is an object of the present invention to provide a method and an apparatus for efficiently coding/decoding handwritten information.
In ord~r to achieve the above object of the present invention, there is provided a method for coding a difference (to be referred to as a difference vector signal or simply a difference vector hereinarter) ~219~80 bv inputting a series of coordinate signals indicating a handwritten image and by calculating the difference vector signal between two adjacent coordinate signals, comprising the steps of dividing a change in the difrerence vector into a micro component and a macro component, and independently coding the micro and macro components, thereby providing an effective coding method.
According to the coding method of the present invention, when the difference vectors are expressed in X-Y coordinate points, a plurality of difference vector groups (i.e., zones) are preset such that areas of the zones increase as the X-Y coordinate points are spaced further apart from the origin or the X-Y coordinate system. The macro component of the difference vector is determined by a given zone to which this difference vector belongs. The micro component of the difference vector is determined by a relative pel address in the given zone. The given zone and the corresponding relative pel address are coded.
According to an embodiment of the present invention, the zones are respectively designated by zone numbers sequentially assigned thereto. A given pel position relative to another pel position within 2S the same zone is designated by an intrazone address (i.e., area address) assigned to each of areas into which the zone is equally divided and by a local address assigned to each of the plurality of coordinate positions within each area. The zone number, the area ad~ress and the local address are coded independently of each other.
According to another embodiment o, the present invention, the zones are respectivelv designated by zone numbers sequentially assigned thereto. A pel position relative to another pel position within the same zone is designated by an address (relative pel address) among addresses indicating a plurality of coordinate positions within the zone. A ~one number difference is coded as the information discriminating the zone, and a relative pel address within the zone is coded as the given pel position relative to another pel position.
In order to perform more effective coding, a change in direction of the difference vector is separated: a sign component of the difference vector is separated from the length compoment thereof so as to obtain from the sign a quadrant to which the difference vector belongs. A number is assigned to each quadrant, and a difference between successive difference vectors, that is, a quadrant number difference, is obtained and coded. In this case, the zone is positioned in a single quadrant te.g., the first quadrant) to be called an absolute value zone. Every zone in all the quadrants can be designated by a combination of the given zone and the absolute value zone.
The above and other objects, features and advantages of the present invention will become more apparent from the rollowing description of pre,erred embodiments thereof taken in conjunction ~ith the accompanying drawings.
BRIEF DESCRIPTION OF TE~E DR~WINGS:
Fig. 1 is a representation of zone division and zone designation number in the difference vector space;
Fig. 2 is a graph for explaining the probability of occurrence as a function of the length of the difference vector as a distribution example of coordinate differences of sampled points;
Fig. 3 is a flow chart for explaining a coding algorithm of a first embodiment of the present invention;
Fig. 4 is a graph for explaining line drawing according to the present invention;
Fig. 5 is a graph for explaining zones which contain the difference vectors Dl to D4 (Fig. 4), and their coordinate points;
Fig. 6 is a representation showing octants when the X-Y coordinate plane is divided by four lines y = 0, x = 0, y = x and y = -x;
Fig. 7 is a representation showing four ~uadrants when the X-Y coordinate plane is divided bv two lines y = x and y = -x;
12i9~80 Fig. 8 is a bloc~ diagram of a coding apparatus of the first emhodiment of the present nventlon;
Fig. 9 is a block diagram of a ditferentia~or of the apparatus shown in Fig. 8;
Fig. 10 is a block diagram of a quadrant circuit of the apparatus shown in Fig. 8;
Fig. 11 is a flow chart for explaining a coding algorithm of a second embodiment of the present invention;
Fis. 12 is a graph for explaining zone division and zone designation number according to the coding algorithm of the second embodiment;
Fig. 13 is a flow chart for explaining an algorithm for obtaining a zone number k;
Fig. 14 is a flow chart for explaining an algorithm for obtaining an intrazone relative pel address Bi;
Fig. 15 is a block diagram of a coding apparatus for executing the coding algorithm of the second embodiment; and Figs. 16A to 16E show handwritten information for testing the coding efficiency of the present invention, respectively.
DESCRIPTION OF THE PREFERRED EMBODIMENTS:
First Embodiment In general, characters and graphics are entered using a graphic input device such as a pressure 1~9080 sensitive tablet or a digitizer. Coordinate signals from the graphic input device are sampled at predetermined time intervals, thereby obtaining the following sampled points:
Po~ Pl, P2, .., pf Here assume that each sampled point Pi is expressed using the X-Y coordinates as follows:
Pi = Pi(Xi' Yi) ...tl) for i = 0, 1, 2,..., f where P0 is the starting point and Pf is the end point.
A difference vector Di~xi, ~Yi) is given from the sampled point Pi as follows:
{ ~Xi = Xi ~ Xi 1 ~Yi Yi Yi-l ...(2) lS for i = 1, 2,... , f However, the difference vector Di(0, 0) is excluded.
A quadrant a i which contains the i-th difference vector is obtained. The quadrant ~i is defined on the basis of the signs of the 20 differences or components ~xi and ~Yi-Table 1 i ~Yi ~i ~Xi ' ~Yi >
~Xi < n ~Yi ~
i < ~Yi < 3 . .
~Xi>O ~Yi< ~ d~ .
A quaarant number difference ~i is obtained from the quadrant ~i of the obtained di, erence vectors, as follows:
~ i - 9i ~i-l (mod 1) ...(3) for i = l, 2,... , f where "-" is the congruence sign in mod 4. The quadrant 30 is defined as l for illustrative convenience. Therefore, the quadran~ number difference ~i is one of the values 0, l, 3 and 2. The di~ference vector can be regarded as the vector in the first quadrant since the quadrant number difference is used.
The zone number will be described herein-after. The first quadrant is divided into a plurality of zones in accordance with the distance from the origin, as shown in Fig. l. Each zone is divided into smaller areas Ito be referred to as unit areas hereinafter) each having a predetermined size. Each unit area comprises a 4 x 4 pel matrix.
The zone width increases as a distance between the origin and the zone increases. A remote zone has a greater number of unit areas. The zones are numbered in the order of 0, 1, 2, ..., k,.... The zone numbered as k is called Z(k). The width of the zone Zlk) along the x direction is given as 2k l (for k 0). Furthermore, the x addresses (distances from the origin) of the rightmost and leftmost pel are 4 x ?k - 1 and 4 x 2k l.
The number N(Z(k)) of unit areas included in the zone Z(k) is given as follows:
N~Z(k~) = 3 x (2k-1)2 The difference vector space is divided in accordance with the quadrant number dif.erences, the zones, and the unit areas. Therefore, any difference vector Di is expressed by four fields: ~ai, l~i, Ait and Li (where Q~i is the quadrant number difference, ki is the zone number, Ai is the unit area number or the area address within a given zone, and Li is the pel address (local address) within the unit area.
The quadrant number difference ~ the zone number ki~ the area address Ai and the local address Li may be obtained from the difference vector Di given by equation (2) in the following manner. The quadrant number difference Q~i is obtained from equation (3).
The zone number ki is determined by the following equation:
ki = llog2([K/h3 + 1)31 .,.t5) where h is the length of the side of the unit area and K is given as follows:
K = maX(l~xi~ Yil) .,.(6) where [a] is the largest Gaussian integer which does not exceed a, and ~a~ is the smallest integer which is equal to or greater than a.
The area address Ai is obtained by counting the number of unit areas along the ~ and y directions as follows:
1219(~30 Ai = (AXi ~ AYi) The addresses Axi and AYi or the coordinate point (Axi, Ayi) of the area address Ai are gi~en as follows:
(A~i = [~xi¦/h]
~AYi = [¦~yi¦/h] ...................... (8) where [ ~ is the same Gaussian inteser notation as used in equation (5).
The local address Li is expressed by the addresses or the pel position along the x and y directions within the unit area as follows:
Li = (LXi l LYi) The pel position local addresses Lxi and LYi are given as follows:
,~ Lxi I xi l i ~LYi I Yil Yi ......................... (10) When the difference vector Di is determined as described above, the quadrant number difference ~3i, the zone number ki, the area address Ai and the local address Li are obtained from equations (3), (5), (8) and (10), respectively.
On the other hand, if the quadrant number difference ~i' the zone number ki, the area address Ai and the local address Li are given, the difference vector D. can be readily obtained (i.e., decoding can be performed) from equation (10) as follows:
(l~Xil = L~i + Axi x h il LYi -~ AYi x h ... (11) Further~ore, the quadrant di of the difference vector Di can be obtained from the quadrant number difference ~9i. That is, according to equation ~3), ~i - L~3i + 9i-l (mod ~ ...(12) The signs o~ the components ~xi and ~Yi can be determined in accordance with the quadrant 3i.
In this manner, the values {~i' ki, Ai! Li}
can be obtained from the di,ference vector Di, and vice versa.
The codes assigned to the ¢uadrant number difference ~9i' the zone number ki, the area address Ai and the local address Li will be described. The quadrant number difference Q9i has four states designated by 0, l, 3 and 2. Huffman coding is performed in accordance with the probability of occurrence of the vectors to assign the optimum length code to the quadrant number difference ~i The results are shown in Fig. 2. When the operator draws a figure, the direction of a curve does not greatly change. Therefore, when the quadrant number difference is decreased, a change in direction of the curve is small. Therefore, a variable-length code is assigned such that a short-length code is assigned to a quadrant number difference having a high probability, whereas a long-length code is assigned to a quadrant number difference having a low probability.
8~
Table 2 Code Allocation of Quadrant Number Di~~erence ~gi State Code _ _
:
12~9~80 d i when the absolute values of the differences dXi and dyi 2re equal to or smaller than a predetermined value d (i.e., 0 < IdXil ~ dmax and G ~ Idyi - max encodes an absolute coordinate point ~x, y) when the absolute values of the difterences dXi and dyi are greater than the predetermined value dmaX (i.e., ¦dXill >
d or ,d i¦ > dmaX). The MDPCM method has a high coding efficiency when the handwriting speed is low.
However, when the handwriting speed is increased, the coding efficiency is decreased with an increase in the amount of data to be processed. Furthermore, a high-resolution image cannot be effectively encoded at a high coding efficiency.
As may be apparent from the above description, depending on the types of telewriting signals, the conventional coding method may not satisfy the condition wherein a voice signal and a handwriting signal are simultaneously transmitted at a bi. rate of 300 bitstsec or less. Therefore, the bit rate must be further decreased.
SUMMARY OF THE INVENTION:
It is an object of the present invention to provide a method and an apparatus for efficiently coding/decoding handwritten information.
In ord~r to achieve the above object of the present invention, there is provided a method for coding a difference (to be referred to as a difference vector signal or simply a difference vector hereinarter) ~219~80 bv inputting a series of coordinate signals indicating a handwritten image and by calculating the difference vector signal between two adjacent coordinate signals, comprising the steps of dividing a change in the difrerence vector into a micro component and a macro component, and independently coding the micro and macro components, thereby providing an effective coding method.
According to the coding method of the present invention, when the difference vectors are expressed in X-Y coordinate points, a plurality of difference vector groups (i.e., zones) are preset such that areas of the zones increase as the X-Y coordinate points are spaced further apart from the origin or the X-Y coordinate system. The macro component of the difference vector is determined by a given zone to which this difference vector belongs. The micro component of the difference vector is determined by a relative pel address in the given zone. The given zone and the corresponding relative pel address are coded.
According to an embodiment of the present invention, the zones are respectively designated by zone numbers sequentially assigned thereto. A given pel position relative to another pel position within 2S the same zone is designated by an intrazone address (i.e., area address) assigned to each of areas into which the zone is equally divided and by a local address assigned to each of the plurality of coordinate positions within each area. The zone number, the area ad~ress and the local address are coded independently of each other.
According to another embodiment o, the present invention, the zones are respectivelv designated by zone numbers sequentially assigned thereto. A pel position relative to another pel position within the same zone is designated by an address (relative pel address) among addresses indicating a plurality of coordinate positions within the zone. A ~one number difference is coded as the information discriminating the zone, and a relative pel address within the zone is coded as the given pel position relative to another pel position.
In order to perform more effective coding, a change in direction of the difference vector is separated: a sign component of the difference vector is separated from the length compoment thereof so as to obtain from the sign a quadrant to which the difference vector belongs. A number is assigned to each quadrant, and a difference between successive difference vectors, that is, a quadrant number difference, is obtained and coded. In this case, the zone is positioned in a single quadrant te.g., the first quadrant) to be called an absolute value zone. Every zone in all the quadrants can be designated by a combination of the given zone and the absolute value zone.
The above and other objects, features and advantages of the present invention will become more apparent from the rollowing description of pre,erred embodiments thereof taken in conjunction ~ith the accompanying drawings.
BRIEF DESCRIPTION OF TE~E DR~WINGS:
Fig. 1 is a representation of zone division and zone designation number in the difference vector space;
Fig. 2 is a graph for explaining the probability of occurrence as a function of the length of the difference vector as a distribution example of coordinate differences of sampled points;
Fig. 3 is a flow chart for explaining a coding algorithm of a first embodiment of the present invention;
Fig. 4 is a graph for explaining line drawing according to the present invention;
Fig. 5 is a graph for explaining zones which contain the difference vectors Dl to D4 (Fig. 4), and their coordinate points;
Fig. 6 is a representation showing octants when the X-Y coordinate plane is divided by four lines y = 0, x = 0, y = x and y = -x;
Fig. 7 is a representation showing four ~uadrants when the X-Y coordinate plane is divided bv two lines y = x and y = -x;
12i9~80 Fig. 8 is a bloc~ diagram of a coding apparatus of the first emhodiment of the present nventlon;
Fig. 9 is a block diagram of a ditferentia~or of the apparatus shown in Fig. 8;
Fig. 10 is a block diagram of a quadrant circuit of the apparatus shown in Fig. 8;
Fig. 11 is a flow chart for explaining a coding algorithm of a second embodiment of the present invention;
Fis. 12 is a graph for explaining zone division and zone designation number according to the coding algorithm of the second embodiment;
Fig. 13 is a flow chart for explaining an algorithm for obtaining a zone number k;
Fig. 14 is a flow chart for explaining an algorithm for obtaining an intrazone relative pel address Bi;
Fig. 15 is a block diagram of a coding apparatus for executing the coding algorithm of the second embodiment; and Figs. 16A to 16E show handwritten information for testing the coding efficiency of the present invention, respectively.
DESCRIPTION OF THE PREFERRED EMBODIMENTS:
First Embodiment In general, characters and graphics are entered using a graphic input device such as a pressure 1~9080 sensitive tablet or a digitizer. Coordinate signals from the graphic input device are sampled at predetermined time intervals, thereby obtaining the following sampled points:
Po~ Pl, P2, .., pf Here assume that each sampled point Pi is expressed using the X-Y coordinates as follows:
Pi = Pi(Xi' Yi) ...tl) for i = 0, 1, 2,..., f where P0 is the starting point and Pf is the end point.
A difference vector Di~xi, ~Yi) is given from the sampled point Pi as follows:
{ ~Xi = Xi ~ Xi 1 ~Yi Yi Yi-l ...(2) lS for i = 1, 2,... , f However, the difference vector Di(0, 0) is excluded.
A quadrant a i which contains the i-th difference vector is obtained. The quadrant ~i is defined on the basis of the signs of the 20 differences or components ~xi and ~Yi-Table 1 i ~Yi ~i ~Xi ' ~Yi >
~Xi < n ~Yi ~
i < ~Yi < 3 . .
~Xi>O ~Yi< ~ d~ .
A quaarant number difference ~i is obtained from the quadrant ~i of the obtained di, erence vectors, as follows:
~ i - 9i ~i-l (mod 1) ...(3) for i = l, 2,... , f where "-" is the congruence sign in mod 4. The quadrant 30 is defined as l for illustrative convenience. Therefore, the quadran~ number difference ~i is one of the values 0, l, 3 and 2. The di~ference vector can be regarded as the vector in the first quadrant since the quadrant number difference is used.
The zone number will be described herein-after. The first quadrant is divided into a plurality of zones in accordance with the distance from the origin, as shown in Fig. l. Each zone is divided into smaller areas Ito be referred to as unit areas hereinafter) each having a predetermined size. Each unit area comprises a 4 x 4 pel matrix.
The zone width increases as a distance between the origin and the zone increases. A remote zone has a greater number of unit areas. The zones are numbered in the order of 0, 1, 2, ..., k,.... The zone numbered as k is called Z(k). The width of the zone Zlk) along the x direction is given as 2k l (for k 0). Furthermore, the x addresses (distances from the origin) of the rightmost and leftmost pel are 4 x ?k - 1 and 4 x 2k l.
The number N(Z(k)) of unit areas included in the zone Z(k) is given as follows:
N~Z(k~) = 3 x (2k-1)2 The difference vector space is divided in accordance with the quadrant number dif.erences, the zones, and the unit areas. Therefore, any difference vector Di is expressed by four fields: ~ai, l~i, Ait and Li (where Q~i is the quadrant number difference, ki is the zone number, Ai is the unit area number or the area address within a given zone, and Li is the pel address (local address) within the unit area.
The quadrant number difference ~ the zone number ki~ the area address Ai and the local address Li may be obtained from the difference vector Di given by equation (2) in the following manner. The quadrant number difference Q~i is obtained from equation (3).
The zone number ki is determined by the following equation:
ki = llog2([K/h3 + 1)31 .,.t5) where h is the length of the side of the unit area and K is given as follows:
K = maX(l~xi~ Yil) .,.(6) where [a] is the largest Gaussian integer which does not exceed a, and ~a~ is the smallest integer which is equal to or greater than a.
The area address Ai is obtained by counting the number of unit areas along the ~ and y directions as follows:
1219(~30 Ai = (AXi ~ AYi) The addresses Axi and AYi or the coordinate point (Axi, Ayi) of the area address Ai are gi~en as follows:
(A~i = [~xi¦/h]
~AYi = [¦~yi¦/h] ...................... (8) where [ ~ is the same Gaussian inteser notation as used in equation (5).
The local address Li is expressed by the addresses or the pel position along the x and y directions within the unit area as follows:
Li = (LXi l LYi) The pel position local addresses Lxi and LYi are given as follows:
,~ Lxi I xi l i ~LYi I Yil Yi ......................... (10) When the difference vector Di is determined as described above, the quadrant number difference ~3i, the zone number ki, the area address Ai and the local address Li are obtained from equations (3), (5), (8) and (10), respectively.
On the other hand, if the quadrant number difference ~i' the zone number ki, the area address Ai and the local address Li are given, the difference vector D. can be readily obtained (i.e., decoding can be performed) from equation (10) as follows:
(l~Xil = L~i + Axi x h il LYi -~ AYi x h ... (11) Further~ore, the quadrant di of the difference vector Di can be obtained from the quadrant number difference ~9i. That is, according to equation ~3), ~i - L~3i + 9i-l (mod ~ ...(12) The signs o~ the components ~xi and ~Yi can be determined in accordance with the quadrant 3i.
In this manner, the values {~i' ki, Ai! Li}
can be obtained from the di,ference vector Di, and vice versa.
The codes assigned to the ¢uadrant number difference ~9i' the zone number ki, the area address Ai and the local address Li will be described. The quadrant number difference Q9i has four states designated by 0, l, 3 and 2. Huffman coding is performed in accordance with the probability of occurrence of the vectors to assign the optimum length code to the quadrant number difference ~i The results are shown in Fig. 2. When the operator draws a figure, the direction of a curve does not greatly change. Therefore, when the quadrant number difference is decreased, a change in direction of the curve is small. Therefore, a variable-length code is assigned such that a short-length code is assigned to a quadrant number difference having a high probability, whereas a long-length code is assigned to a quadrant number difference having a low probability.
8~
Table 2 Code Allocation of Quadrant Number Di~~erence ~gi State Code _ _
3 110 Therefore, the overall number of bits required for codes can be decreased.
Table 3 shows the code allocation for the zone number ki.
Table 3 Code Allocation for Zone Number ki .
Zone number Code . , O
Table 3 shows the code allocation for the zone number ki.
Table 3 Code Allocation for Zone Number ki .
Zone number Code . , O
4 11110 .
I . ~.
According to Table 3, a longer code is assigned to a larger zone number. When the zone number is large, the length of the difference vector is great.
1219(~80 Then, the probability of occurrence of such a difference vectors is abruptly decreased as shown in Fig. 2. As a result, the number of bits is decreased in accordance with the code allocation shown in Table 3.
Table ~ shows the code allocation for the area address Ai.
Table 4 Code Allocation for Area Address Ai 1'` _ .
u Axi or AYi Code O O . . .0000 0 . . . 000 1 2 0... 0010 3 0... 0011 4 0... 0100 S O . . .0101 6 0... 0110 . . .
The codes in Table 4 differ in accordance with the zone numbers and have a Z-bit fixed length.
The code of each of the x and y local addresses Lx and Ly of the zone number 2 has a fixed two-bit length.
The code of each of the x and y local addresses Lx and Ly of the zone number 3 has a fixed three-bit length.
It should be noted that no area address code is assigned when Z = 0.
12~9080 Similarly, a small-bit length code is assigned to the area address Ai when the zone number is small.
Therefore, when the difference vector 'nas a high pro~a-bility of occurrence, its bit length is short.
Therefore, the overall coding bit length can be decreased.
Fig. 5 shows the code ~llocation for the local address Li.
Table 5 Code Allocation for Local Address Li Lxi or LYi ¦ Code O O . . . 000~
1 O. . .0001 2 0.. 0010 3 0.. 0011 4 0.. 0101 ..
: .
These codes differ in accordance with the size or the unit areas and have a fixed bit length ~log2h] when one side of the unit area is given as h.
The area address Ai and the local address L~
` 25 are expressed in binary notation by coordinate points respectively within the zone and the unit area.
However, Huffman coding may be utilized for .
.
.
h - lS -optimiza~ion, depending on the probabilitv of occurrence of the difference vectors.
The starting point at the time of "~en down"
and the code for "pen up" wiil be desc-ibed. The starting point can be e~pressed by an absolute coordinate point having a bit length long enough to express the maximum value within the coordinate plane.
An extra code indicating that a ?en has just been up is added to only a final vector D~. However, here a special code is not added to indicate the pen up state:
the difference vector can be used since it does not transmit data of "0". More particularly, the pen up state can be detected under the conditions that the quadrant number difference ~3i = ~ the zone nu~ber ki = 0, the local x address Lx = 0 and the local y address Ly = 0. The above procedures are shown by a flow chart in Fig. 3.
Fig. 5 is a graph showing the zones which contain the difference vectors Dl to D4 in Fig. 4, and the positions of the difference vectors Dl to D4 in the corresponding zones. The components of the stroke drawn in Fig. 4 are given in Table 6.
~Z~9~80 Table 6 Sampled Point ¦ Pl P2 P3 ¦ P4 Pi I(2, 5) 1(5, 6) (10, 8) 1(12, 7) I Dift^erence jDl ID2 3 4 ¦ vector Di I(1, 3) 1(3, 1) (5, 2) ~ ~2, I Quadrant ~ 3 ~ I I --, j i Quadrant ~~ ¦~31 1A ~ 2 1. ~93 ~ t difference A9il 0 0 _ o I -2 Zone (Z) No kl ~ 3 ¦ 4 Area address none none 1 i none Local address (Lxl, Lyl) (Lx2, Ly2) (Lx3, Ly3)j(LX4~ Ly4) l l Li (1, 3) (3, 1) ¦ (1, 2) ¦ (2, 1) I
These components are coded in accordance with the code allocations (Figs. 2 to 5), as will be shown in Table 7.
~Zl~
Table 7 Po _ ~0 Yo _ , Dl 1 ¦ kl ¦ Lxl ¦ Lyl O ¦ O ¦ , i k2 I Lx2 ¦ LY2 O I O ~ 01 .
3 ¦ k3 ¦ AX3 Ay3 ¦ Lx3 ¦ Ly3 O I 101 1 0 101 110 .
~ ¦ k4 ¦ LX4 ¦ Ly4 Pen Up ' _ O O O O O O
It should be noted that the coordinate space comprises a 64 [26) x 64 (26) pel matrix, and that the unit area comprises a 4 x 4 pel matrix.
In the above-mentioned description, the coordinate system has four quadrants. However, as shown in Fig. 6, the coordinate system may have octants.
i In this case, a vector can be expressed as a vector in a single octant.
~g~8~
Alternatively, as shown in Fig; 7, the ~-Y
coordinates may be divided as rollows, in place or the division based only on the difference vector sign.
More particularly, the ~our quadrants ~l' 32' 93 and a;, are given as follows:
al = { (x~ y); y < ~ and y > -x}
a2 = { (x~ y~; y > x and y ~ -x}
93 -- {(x, y); y > x and y < -x}
~ 4 = {(x, y); y < x and y < -x}
The a~ove division of the X-Y coordinates is very effective when the operator tends to draw mostly horizontal or vertical lines.
A coding apparatus for perfor~ing the coding described above will be described with reference to a block diagram thereof shown in Fig. 8.
The coordinate signal consists of a sampled point (xi, Yi) and a flag Z indicating the pen up or pen down state. The coordinate signal is respectively supplied from inputs l, 2 and 3 to a pen up detector 4 and first and second differentiators 5 and 6. When the flag Z is set to indicate the pen up state, the pen up detector 4 produces a stop signal so as to reset the first and second differentiators 5 and 6. In response to the stop signal, a pen up signal generator 7 generates a code a up corresponding to the pen up state and supplies it to a transmitting code control circuit ll. When the flag Z indicates that the 2en up state is switched to the pen down state, the first and second ~Z1~
differentiators 5 and 6 perform subtraction such tha-t ~he first coordi~ate signal which indicates the sampled point (xO, yO) as the initial value and the second coord1nate signal which indicates the sampled point (~1~ Yl) are used to calculate dirrerences ~xO = xl - xO and ~yO = Yl - yO, respectively Similarly, the first and second differentiators 5 and 6 sequentially calculate di,~ferences ~xi = xi - xi_l and ~Yi Yi ~ Yi 1 using the sampled points (xi, Yi) and lxi 1~
Yi 1) supplied from the inputs 2 and 3. Fig. 9 shows a differentiator used as the first or second differen-tiator 5 or 6. This differentiator comprises a one-sample memory 51 and a subtractor 52. The coordinate signal is supplied to an input 53, and differences ~xi and ~Yi appear at an output 5~. The one-sample memory 51 is reset by the stop signal supplied to an input S5.
` A quadrant circuit 8 determines the quadrants 3i of the difference vectors Di = (~xi, ~Yi) respectively from the differentiators 5 and 6 in accordance with the signs of the differences ~xi and ~Yi. Fig. 10 shows a detailed arrangement of the quadrant circuit 8. The quadrant circuit 8 comprises:
sign detectors 83 and 84 which generate signals of logic level "1" when inputs 81 and 8~, respectively, receive a positive or zero signal, and which generate signals of logic level "0" when the inputs 81 and 82, respectively, receive a negative signal; logic circuits 85 to 88 connected to outputs of the sign detectors 83 and 8~ so as to determine the quadrants o_ the difference vectors; and an encoder 89 'or co~ins the determination results to produce a auadran~ signal from its output 80.
A quadrant differentiator ~ calculates the quadrant number difference Q9i by an operation 3i ~ 9i 1 (mod 4). An output signal from the quadrant differentiator 9 is coded by a quadrant number difference encoder 10 so as to have a variable code length. The variable-length code is then supplied to a transmitting buffer memory 19 through the transmitting code control circuit 11.
Absolute value circuits 12 and 13 calculate absolute values ¦Qxi¦ and IQYi¦ of the components Qx and QYi of the difference vector Di, respectively.
These values are supplied to a zone number circuit 14.
The zone circuit 14 compares the absolute values ¦~xi¦ and ¦Qyi¦ of a no-sign difference vector (l~xil, IQYil) and selects the larger value. This larger value is used as the value K so as to calculate . the zone number ki from the following equation:
[log2(¦K/hn + 1)] ki ...113) The zone number ki is coded by a zone number encoder 15 so as to have a variable code length. This ~ variable-length code indicating the zone number ki is ¦; then supplied to the transmi~ting code control circuit i 11.
~1 An area address circuit 16 calculates the area addresses Axi and AYi from the no-sian diLference veCtor ~ Yil) in accordance with operations [~ /hl and ~l~vi~/h]. The area addresses Axi and AYi are supolied to a local address circuit 1 and the t-ansmitting code control circuit 11.
The local address circuit 17 per'orms the operations ~ ~Yi x h and I~Yi¦ - AYi x h- The calculation results are supplied to the transmitting code control circuit 11.
The transmitting code control circuit 11 receives the pen up/down signal, the starting point signal, the quadrant number difference signal, the zone number signal, the area address signal, and the local address signal and transmits the resulting signal in the transmitting code format to the transmitting buffer memory 19. When the above-mentioned coding is performed, the coordinate signal can be transmitted using a short code. These coding procedures are repeated every time a coordinate signal corresponding to the sampled point of the line drawing is entered.
However, several sampled points may be coded in units of strokes.
The transmitted code can be decoded in a reverse manner ~rith respect to the coding process so as to obtain the original coordinate signal.
As described above, the codingldecoding apparatus is not limited to the arrangement in the above embodiment. For example, a microprocessor may be used to per,orm codingldecoding in a sortware manner.
A small change in direction of the difference vectors causes a high probability of the occurrence thereof. A small magnitude of the difference vector causes a high probability of the occurrence thereof.
Therefore, as has been described in the present invention, when the direction of the difference ~ector is coded by the quadrant number difference and the magnitude of the difference vector is coded by the zones, and when these components are coded independently o~ each other, a short code can be assigned to each vector having a high probability of occurrence. As a result, highly efficient coding using a small number of bits can be performed. Furthermore, since each zone is divided into a corresponding number of unit areas, a small change in a difference vector is detected as a change in position thereof within the unit area, thereby providing highly precise position detection.
Furthermore, according to the present invention, the code allocation of the ~one number and the area address expression are independent of the coordinate space. As a result, coding can be perrormed independently of the resolution and si~e of the input device. In addition to this advantage, since an input system and an output system which have different resolutions can be used to detect only the si7e of the ~219(~BO
unit area, proper coding/decoding can be performed.
Tllerefore, a coding system may be designed without considering the specifications of the physical devic~s of the actual input and output systems, resulting in convenience.
SECOND EMBODIMENT
Unlike the first embodiment wherein the zone number is coded to rorm a variable-length code, a zone number difference is coded to form a variable-length code in the second embodiment so as to further improve the coding efficiency.
Fig. 11 is a flow chart for explaining the steps of executing the coding procedures o, the second embodiment. The steps M1 to Mll for obtaining the quadrant number difference ~ai in the second embodiment are substantially the same as the steps Cl to Cll of the first embodiment.
Let i be zero in step Ml. A sampled point Pi is entered in step M2. It is determined in step M3 whether or not the pen has just been up. If NO in step M3, it is then determined in step M4 whether or not the sampled point Pi is the starting point. If YES in step M4 (i.e., i = 0), the coordinate values of the sampled point P0 are produced as the code in step M5. In step M6, let ~0 and ko be 1 and 1, respectively. In step M7, let i be i + 1. Thereafter, the flow returns to step M2. In step M2, the n~xt sampled point Pi is entered.
However, if NO in step M4, the immediately preceding sampled point Pi l is subtracted from the present sampled point Pi in step M8. It is then determined in step M9 whether or not Di = G. If YES in step M9, the flow returns to step M2 and the subsequent sampled point is entered in step M2. However, if NO in step M9, the quadrant 9i which includes the difference vector Di is obtained in step MlO. Thereafter, the quadrant number difference ~3i is calculated in step Mll.
The zone division of the second embodiment slightly differs from that of the first embodiment.
Square zones are used in the second embodiment. The width W(k) of the k-th zone (i.e., one side of the square) is given as follows:
W(k) = h for k = 1¦
= h.2[(k-2)/3] for k > l ) ...(14) where h is the zone width for k = 1, [a] is the Gaussian integer notation. The zone for k = 1 is called the basic zone. The zones are numbered in a counterclockwise order (1, 2, 3,...) as shown in Fig. 12. The k-th zone is given as follows:
1X~
Z(k) = ~ Xl, I ~YI ); < I ~Xj < W(k)-l~
o < I~YI < W(k) - 1} for k = 1 = { ( j~X!, IQYI ); W(k) < I~YI < 2W(k)-1 O < I~YI < W(k) - 1} for k = 3n-1 { ( I ~ X I ~ I ~ Y ¦ ) ; W~k~ < I~X~ < 2W(k) 1 W~k~ < l~yl < 2W(k)-l}
for k = 3n = { (¦~X~ YI ); < I ~XI < W(k)-l W(k) < ¦~Y¦ < 2W(k)-l}
for k = 3n+1 where n = 1, 2, 3, 4,...
...(15) The zcne number ki which includes the no-sign di ference vector Di = (¦~xi¦, ¦~Yi¦) can be obtained in accordance with equations (14) and (15) when the value h is given as a preset value.
Fig. 13 is a flow chart for explaining the steps of calculating the zone number ki. This flow chart is the subroutine for step M12 (calculation of the zone number ki) in Fig. 11. The absolute values l~xl and I~YI are entered in step S1201. The larger value is selected in step S1202.
Let m as a zone number be 1 (initial value) and a value corresponding to n in equations (15) be zero in step S1203. In step S1204, let IA be ~IA/h].
It is then determined in step S1205 whether or not the calculation result [IA/h] in step S120~ becomes zero.
If ~ES in step S1205, it is determined in step S1209 ~2~ 0 whether or not n = 0 at this time. If YES in step Sl~09, the di~ference vector ralls within the basic zone. Therefore, in step S1214, let k be m = 1.
However, if NO in step S1205, let n be n + 1 in step S1206. The data [IA/2] is calculated in step S1207.
It is determined in step S1208 whether or not the obtained data [IA/2] is zero. If NO in step S1208, let n be n + 1 in strp S1206. It is determined again in step S1208 whether or not the calculated result becomes zero after step S1207. The above operation is repeated until [IA/2] becomes zero. When [IA/2] becomes zero, n is determined. It is then determined in step S1209 whether or not n is zero. If NO in step S1209, the value of n indicates the zone group number among the groups each having three zones of the same size with respect to a given distance from the basic zone. In other words, a given value of n corresponds to three zones. After n is set, it is determined that the difference vector belongs to any one of the three zones in steps S1210 to S1212. More particularly, operations [IX/2n l] and [Iyl2n 1] are performed in step S1210 to assign the x and y components IX and IY
of the difference vector in the three zones for n = 1.
In step S1211, let the updated IX and IY be [IX/h]
and [IY/h], respectively. The obtained IX and IY are then set as 1 or 0. In accordance with the combinations of codes 1 and 0, a signal F indicating the specific zone number determined by n for the difference vector is obtained in step S1212. In step S1213, let m be 3 x (n - 1) + F, thereby determining the zone number k = m.
When the zone number ki is determined, the zone number difference ~ki is given by the following equation:
~ ki = ki ~ ki-l ...(16) It should be noted that ko is 1 for the sake of simplicitv.
A relative pel address Bi indicating the relative position of the difference vector Di in the zone is obtained by the following equations except for k = 1:
Bi = (Bx, By) = (¦~xi¦ - W(k), ¦~Yi¦ - W~k~) for Q = 0 ... (17) x~ QYi ¦ - w ( ) ) for Q = 1 ... (18) ( ¦~Xil - W( ), l ~Yil ) for Q = 2 ... (19) where Q - k (mod 3) ... (20) Fig. 14 is a flow chart for explaining the steps of obtaining the relative pel address Bi in the zone in accordance with equations (17) to (20). This flow chart is the subroutine (step M15 far calculation of the relative pel address Bi) of the main routine in Fig. 11. Q is calculated from the zone number k using equation (20) in step S1501. It is then determined in 1219~)8(~
step S1502 which one of equations tl7) to (19) is to be used to calculate the relative pel address 3i in accordance with the obtained Q. Components or addresses Bx and By of the relative pel address Bi are calculated in steps S1503 to S1505.
Rererring again ~o Fig. 11, when the above-mentioned coding is performed and the state changes to the pen up state, it indicates the end of one stroke. This change is monitored in step M16.
When the pen up state is detected, the code 3up is produced in step M17.
The sampled point array {P0, Pl, P2,..., Pf}
corresponding to one stroke of the line drawing is expressed using the difference vectors as follows: {Dor Dl, D2,..., Df}. Each difference vector Di is expressed by the combination {~ai, ~ki, Bi}. The pen up code up is added to the final difference vector Df.
In order to code these components,-a fixed-length code is assigned to the starting point P0 designated as the absolute coordinate point, whereas variable-length codes are assigned to the quadrant number difference ~a and the zone number difference Qk.
Table 8 shows code allocation of the quadrant number difference ~a and the zone number dif erence ~k~
12~ 80 Table 8 Zone Code Table Symbol ¦ Value ¦ Code ~ O ~ 1 ; 1 I 01 3 ', 001 . I
~k ~ -5 0000 0000 l ~ -4 ll 0000 lO
-3 1l 001 -l ll OQOl O
l 0111 2 oOlolO l In the above table, the codes are assigned to the quadrant number difference ~ and the zone number difference ~k independently of each other. However, the codes may be assigned to pairs of a quadrant number difference and a zone number difference in Table 9 as ~ follows.
i ~80 Table 9 Zone Code Table No. ~a ~k I Length Code I
0 pen~ ted ~ 3Up) 3 bit 110 2 3 0 a 0001 3 1l 1 O ds I lill a I o 3 ~. I 0010 1 3 -3 6 l, 1000 01 18 3 2 7 1000 00~
~ 3V
No. ~3¦ ~k Length Code j 2 _3 8 0000 0001 The binary codes are assigned to the relative pel addresses Bi in the zone. Since {W(k)}2 difference vectors are included in the k-th zone, a required number of bits R(k) for specifying the difference vector in the zone can be given as follows:
R(k~ - 21Og2W(k~
= 21Og2h for k = 1 = 21Og2h + 2-[(k-2)/3] for k > 1 ...(21) where ~ ] is the Gaussian integer notation.
As may be apparent from equation (16), when the zone number k is obtained, the minimum number of bits to specify the address of the difference vector in the zone is determined by R(k). When the basic zone width h is taken as a power of two, the code bits assigned by R(k) may not be wasted, thereby providing effective coding~
Fig. 15 is a block diagram of a coding apparatus for performing the coding algorithm of the second embodiment. The coding apparatus of the second embodiment is substantially the same as that of the first embodiment ! except that in the second embodiment a zone number differentiator 20 and a zone number difference encoder 21 are added, and that an intrazone address generator 22 is arranged in place OI the area address circuit 16 and the local address circuit 17 in Fig. 8. The zone number differentiator 20 performs the oper~tion ki ~ ki 1 50 as to obtain the difference jki.
The zone number difference encoder 21 encodes the value of the difference ~ki which is produced by the zone number differentiator 20, in accordance with the allocation of the variable-length codes shown in Table 8. The variable-length code corresponding to the value of the difference ~ki is supplied to the transmitting code control circuit 11. The intrazone address generator 22 generates Q from the zone number k from the zone number circuit 14 in accordance with equation (20). Furthermore, the intrazone address or pel address Bi is calculated using whichever one of the equations (17) to (19) is determined by the value of Q.
The calculated pel address Bi is supplied to the transmitting code control circuit 11. The transmitting code control circuit 11 links the components Po~ Bi and 9up in a predetermined transmission format. Thus obtained codes are sequen-tially supplied to the transmittin~ bu~er memory 19~
The transmitted code can be decoded in a reverse manner with respect to the coding process so as to obtain the original coordinate signal.
As described above, the coding/decoding apparatus is not limited to the arrangement in the above embodiment. For example, a microprocessor may be used to perform coding/decoding in a software manner.
In the method and apparatus for coding the sampled points according to the second embodiment, the same advantages as in the first embodiment are obtained. Furthermore, since the zone number difference signal is coded, more effecti~e coding is performed.
The coding efficiency of line drawings shown in Figs. 16A to 16E of the second embodiment of the present invention is compared with that of the DCE and MDPCM methods. The results are shown in Table 10. As may be apparent from Table 10 below, the efficiency of the coding method of the present invention shows an improvement of about 20% and about 23% respectively as compared with the efficiencies of the DCE and MDPCM
methods.
~2~ 30 Table 10 inc Coding method \ Fig. 16AIFig. 16B Fig. 16CIFig. 16DIFig. 16E
i total bits 15,877 1 14,048 16,256 1 8,072 j iO,018 l -i bit rate 128 ~ 124 132 257 1 139 i (bit/sec) I t- -Zone ratio to 0.73 0.88 0.770.89 0.79 cod- ~CE l , _ ing ratio to0.76 0.79 0.79 0.83 0.70 MDPCM
. _ D OE total bits 21,61815,903 1 21,257 9,087 12,623 !
bit rate 188 149 182 310 132 ¦
M- total bits21,00517,624 20,559 9,75314 ,282 :
DPCM bit rate 170 155 167 310 198 .
.
'~
I . ~.
According to Table 3, a longer code is assigned to a larger zone number. When the zone number is large, the length of the difference vector is great.
1219(~80 Then, the probability of occurrence of such a difference vectors is abruptly decreased as shown in Fig. 2. As a result, the number of bits is decreased in accordance with the code allocation shown in Table 3.
Table ~ shows the code allocation for the area address Ai.
Table 4 Code Allocation for Area Address Ai 1'` _ .
u Axi or AYi Code O O . . .0000 0 . . . 000 1 2 0... 0010 3 0... 0011 4 0... 0100 S O . . .0101 6 0... 0110 . . .
The codes in Table 4 differ in accordance with the zone numbers and have a Z-bit fixed length.
The code of each of the x and y local addresses Lx and Ly of the zone number 2 has a fixed two-bit length.
The code of each of the x and y local addresses Lx and Ly of the zone number 3 has a fixed three-bit length.
It should be noted that no area address code is assigned when Z = 0.
12~9080 Similarly, a small-bit length code is assigned to the area address Ai when the zone number is small.
Therefore, when the difference vector 'nas a high pro~a-bility of occurrence, its bit length is short.
Therefore, the overall coding bit length can be decreased.
Fig. 5 shows the code ~llocation for the local address Li.
Table 5 Code Allocation for Local Address Li Lxi or LYi ¦ Code O O . . . 000~
1 O. . .0001 2 0.. 0010 3 0.. 0011 4 0.. 0101 ..
: .
These codes differ in accordance with the size or the unit areas and have a fixed bit length ~log2h] when one side of the unit area is given as h.
The area address Ai and the local address L~
` 25 are expressed in binary notation by coordinate points respectively within the zone and the unit area.
However, Huffman coding may be utilized for .
.
.
h - lS -optimiza~ion, depending on the probabilitv of occurrence of the difference vectors.
The starting point at the time of "~en down"
and the code for "pen up" wiil be desc-ibed. The starting point can be e~pressed by an absolute coordinate point having a bit length long enough to express the maximum value within the coordinate plane.
An extra code indicating that a ?en has just been up is added to only a final vector D~. However, here a special code is not added to indicate the pen up state:
the difference vector can be used since it does not transmit data of "0". More particularly, the pen up state can be detected under the conditions that the quadrant number difference ~3i = ~ the zone nu~ber ki = 0, the local x address Lx = 0 and the local y address Ly = 0. The above procedures are shown by a flow chart in Fig. 3.
Fig. 5 is a graph showing the zones which contain the difference vectors Dl to D4 in Fig. 4, and the positions of the difference vectors Dl to D4 in the corresponding zones. The components of the stroke drawn in Fig. 4 are given in Table 6.
~Z~9~80 Table 6 Sampled Point ¦ Pl P2 P3 ¦ P4 Pi I(2, 5) 1(5, 6) (10, 8) 1(12, 7) I Dift^erence jDl ID2 3 4 ¦ vector Di I(1, 3) 1(3, 1) (5, 2) ~ ~2, I Quadrant ~ 3 ~ I I --, j i Quadrant ~~ ¦~31 1A ~ 2 1. ~93 ~ t difference A9il 0 0 _ o I -2 Zone (Z) No kl ~ 3 ¦ 4 Area address none none 1 i none Local address (Lxl, Lyl) (Lx2, Ly2) (Lx3, Ly3)j(LX4~ Ly4) l l Li (1, 3) (3, 1) ¦ (1, 2) ¦ (2, 1) I
These components are coded in accordance with the code allocations (Figs. 2 to 5), as will be shown in Table 7.
~Zl~
Table 7 Po _ ~0 Yo _ , Dl 1 ¦ kl ¦ Lxl ¦ Lyl O ¦ O ¦ , i k2 I Lx2 ¦ LY2 O I O ~ 01 .
3 ¦ k3 ¦ AX3 Ay3 ¦ Lx3 ¦ Ly3 O I 101 1 0 101 110 .
~ ¦ k4 ¦ LX4 ¦ Ly4 Pen Up ' _ O O O O O O
It should be noted that the coordinate space comprises a 64 [26) x 64 (26) pel matrix, and that the unit area comprises a 4 x 4 pel matrix.
In the above-mentioned description, the coordinate system has four quadrants. However, as shown in Fig. 6, the coordinate system may have octants.
i In this case, a vector can be expressed as a vector in a single octant.
~g~8~
Alternatively, as shown in Fig; 7, the ~-Y
coordinates may be divided as rollows, in place or the division based only on the difference vector sign.
More particularly, the ~our quadrants ~l' 32' 93 and a;, are given as follows:
al = { (x~ y); y < ~ and y > -x}
a2 = { (x~ y~; y > x and y ~ -x}
93 -- {(x, y); y > x and y < -x}
~ 4 = {(x, y); y < x and y < -x}
The a~ove division of the X-Y coordinates is very effective when the operator tends to draw mostly horizontal or vertical lines.
A coding apparatus for perfor~ing the coding described above will be described with reference to a block diagram thereof shown in Fig. 8.
The coordinate signal consists of a sampled point (xi, Yi) and a flag Z indicating the pen up or pen down state. The coordinate signal is respectively supplied from inputs l, 2 and 3 to a pen up detector 4 and first and second differentiators 5 and 6. When the flag Z is set to indicate the pen up state, the pen up detector 4 produces a stop signal so as to reset the first and second differentiators 5 and 6. In response to the stop signal, a pen up signal generator 7 generates a code a up corresponding to the pen up state and supplies it to a transmitting code control circuit ll. When the flag Z indicates that the 2en up state is switched to the pen down state, the first and second ~Z1~
differentiators 5 and 6 perform subtraction such tha-t ~he first coordi~ate signal which indicates the sampled point (xO, yO) as the initial value and the second coord1nate signal which indicates the sampled point (~1~ Yl) are used to calculate dirrerences ~xO = xl - xO and ~yO = Yl - yO, respectively Similarly, the first and second differentiators 5 and 6 sequentially calculate di,~ferences ~xi = xi - xi_l and ~Yi Yi ~ Yi 1 using the sampled points (xi, Yi) and lxi 1~
Yi 1) supplied from the inputs 2 and 3. Fig. 9 shows a differentiator used as the first or second differen-tiator 5 or 6. This differentiator comprises a one-sample memory 51 and a subtractor 52. The coordinate signal is supplied to an input 53, and differences ~xi and ~Yi appear at an output 5~. The one-sample memory 51 is reset by the stop signal supplied to an input S5.
` A quadrant circuit 8 determines the quadrants 3i of the difference vectors Di = (~xi, ~Yi) respectively from the differentiators 5 and 6 in accordance with the signs of the differences ~xi and ~Yi. Fig. 10 shows a detailed arrangement of the quadrant circuit 8. The quadrant circuit 8 comprises:
sign detectors 83 and 84 which generate signals of logic level "1" when inputs 81 and 8~, respectively, receive a positive or zero signal, and which generate signals of logic level "0" when the inputs 81 and 82, respectively, receive a negative signal; logic circuits 85 to 88 connected to outputs of the sign detectors 83 and 8~ so as to determine the quadrants o_ the difference vectors; and an encoder 89 'or co~ins the determination results to produce a auadran~ signal from its output 80.
A quadrant differentiator ~ calculates the quadrant number difference Q9i by an operation 3i ~ 9i 1 (mod 4). An output signal from the quadrant differentiator 9 is coded by a quadrant number difference encoder 10 so as to have a variable code length. The variable-length code is then supplied to a transmitting buffer memory 19 through the transmitting code control circuit 11.
Absolute value circuits 12 and 13 calculate absolute values ¦Qxi¦ and IQYi¦ of the components Qx and QYi of the difference vector Di, respectively.
These values are supplied to a zone number circuit 14.
The zone circuit 14 compares the absolute values ¦~xi¦ and ¦Qyi¦ of a no-sign difference vector (l~xil, IQYil) and selects the larger value. This larger value is used as the value K so as to calculate . the zone number ki from the following equation:
[log2(¦K/hn + 1)] ki ...113) The zone number ki is coded by a zone number encoder 15 so as to have a variable code length. This ~ variable-length code indicating the zone number ki is ¦; then supplied to the transmi~ting code control circuit i 11.
~1 An area address circuit 16 calculates the area addresses Axi and AYi from the no-sian diLference veCtor ~ Yil) in accordance with operations [~ /hl and ~l~vi~/h]. The area addresses Axi and AYi are supolied to a local address circuit 1 and the t-ansmitting code control circuit 11.
The local address circuit 17 per'orms the operations ~ ~Yi x h and I~Yi¦ - AYi x h- The calculation results are supplied to the transmitting code control circuit 11.
The transmitting code control circuit 11 receives the pen up/down signal, the starting point signal, the quadrant number difference signal, the zone number signal, the area address signal, and the local address signal and transmits the resulting signal in the transmitting code format to the transmitting buffer memory 19. When the above-mentioned coding is performed, the coordinate signal can be transmitted using a short code. These coding procedures are repeated every time a coordinate signal corresponding to the sampled point of the line drawing is entered.
However, several sampled points may be coded in units of strokes.
The transmitted code can be decoded in a reverse manner ~rith respect to the coding process so as to obtain the original coordinate signal.
As described above, the codingldecoding apparatus is not limited to the arrangement in the above embodiment. For example, a microprocessor may be used to per,orm codingldecoding in a sortware manner.
A small change in direction of the difference vectors causes a high probability of the occurrence thereof. A small magnitude of the difference vector causes a high probability of the occurrence thereof.
Therefore, as has been described in the present invention, when the direction of the difference ~ector is coded by the quadrant number difference and the magnitude of the difference vector is coded by the zones, and when these components are coded independently o~ each other, a short code can be assigned to each vector having a high probability of occurrence. As a result, highly efficient coding using a small number of bits can be performed. Furthermore, since each zone is divided into a corresponding number of unit areas, a small change in a difference vector is detected as a change in position thereof within the unit area, thereby providing highly precise position detection.
Furthermore, according to the present invention, the code allocation of the ~one number and the area address expression are independent of the coordinate space. As a result, coding can be perrormed independently of the resolution and si~e of the input device. In addition to this advantage, since an input system and an output system which have different resolutions can be used to detect only the si7e of the ~219(~BO
unit area, proper coding/decoding can be performed.
Tllerefore, a coding system may be designed without considering the specifications of the physical devic~s of the actual input and output systems, resulting in convenience.
SECOND EMBODIMENT
Unlike the first embodiment wherein the zone number is coded to rorm a variable-length code, a zone number difference is coded to form a variable-length code in the second embodiment so as to further improve the coding efficiency.
Fig. 11 is a flow chart for explaining the steps of executing the coding procedures o, the second embodiment. The steps M1 to Mll for obtaining the quadrant number difference ~ai in the second embodiment are substantially the same as the steps Cl to Cll of the first embodiment.
Let i be zero in step Ml. A sampled point Pi is entered in step M2. It is determined in step M3 whether or not the pen has just been up. If NO in step M3, it is then determined in step M4 whether or not the sampled point Pi is the starting point. If YES in step M4 (i.e., i = 0), the coordinate values of the sampled point P0 are produced as the code in step M5. In step M6, let ~0 and ko be 1 and 1, respectively. In step M7, let i be i + 1. Thereafter, the flow returns to step M2. In step M2, the n~xt sampled point Pi is entered.
However, if NO in step M4, the immediately preceding sampled point Pi l is subtracted from the present sampled point Pi in step M8. It is then determined in step M9 whether or not Di = G. If YES in step M9, the flow returns to step M2 and the subsequent sampled point is entered in step M2. However, if NO in step M9, the quadrant 9i which includes the difference vector Di is obtained in step MlO. Thereafter, the quadrant number difference ~3i is calculated in step Mll.
The zone division of the second embodiment slightly differs from that of the first embodiment.
Square zones are used in the second embodiment. The width W(k) of the k-th zone (i.e., one side of the square) is given as follows:
W(k) = h for k = 1¦
= h.2[(k-2)/3] for k > l ) ...(14) where h is the zone width for k = 1, [a] is the Gaussian integer notation. The zone for k = 1 is called the basic zone. The zones are numbered in a counterclockwise order (1, 2, 3,...) as shown in Fig. 12. The k-th zone is given as follows:
1X~
Z(k) = ~ Xl, I ~YI ); < I ~Xj < W(k)-l~
o < I~YI < W(k) - 1} for k = 1 = { ( j~X!, IQYI ); W(k) < I~YI < 2W(k)-1 O < I~YI < W(k) - 1} for k = 3n-1 { ( I ~ X I ~ I ~ Y ¦ ) ; W~k~ < I~X~ < 2W(k) 1 W~k~ < l~yl < 2W(k)-l}
for k = 3n = { (¦~X~ YI ); < I ~XI < W(k)-l W(k) < ¦~Y¦ < 2W(k)-l}
for k = 3n+1 where n = 1, 2, 3, 4,...
...(15) The zcne number ki which includes the no-sign di ference vector Di = (¦~xi¦, ¦~Yi¦) can be obtained in accordance with equations (14) and (15) when the value h is given as a preset value.
Fig. 13 is a flow chart for explaining the steps of calculating the zone number ki. This flow chart is the subroutine for step M12 (calculation of the zone number ki) in Fig. 11. The absolute values l~xl and I~YI are entered in step S1201. The larger value is selected in step S1202.
Let m as a zone number be 1 (initial value) and a value corresponding to n in equations (15) be zero in step S1203. In step S1204, let IA be ~IA/h].
It is then determined in step S1205 whether or not the calculation result [IA/h] in step S120~ becomes zero.
If ~ES in step S1205, it is determined in step S1209 ~2~ 0 whether or not n = 0 at this time. If YES in step Sl~09, the di~ference vector ralls within the basic zone. Therefore, in step S1214, let k be m = 1.
However, if NO in step S1205, let n be n + 1 in step S1206. The data [IA/2] is calculated in step S1207.
It is determined in step S1208 whether or not the obtained data [IA/2] is zero. If NO in step S1208, let n be n + 1 in strp S1206. It is determined again in step S1208 whether or not the calculated result becomes zero after step S1207. The above operation is repeated until [IA/2] becomes zero. When [IA/2] becomes zero, n is determined. It is then determined in step S1209 whether or not n is zero. If NO in step S1209, the value of n indicates the zone group number among the groups each having three zones of the same size with respect to a given distance from the basic zone. In other words, a given value of n corresponds to three zones. After n is set, it is determined that the difference vector belongs to any one of the three zones in steps S1210 to S1212. More particularly, operations [IX/2n l] and [Iyl2n 1] are performed in step S1210 to assign the x and y components IX and IY
of the difference vector in the three zones for n = 1.
In step S1211, let the updated IX and IY be [IX/h]
and [IY/h], respectively. The obtained IX and IY are then set as 1 or 0. In accordance with the combinations of codes 1 and 0, a signal F indicating the specific zone number determined by n for the difference vector is obtained in step S1212. In step S1213, let m be 3 x (n - 1) + F, thereby determining the zone number k = m.
When the zone number ki is determined, the zone number difference ~ki is given by the following equation:
~ ki = ki ~ ki-l ...(16) It should be noted that ko is 1 for the sake of simplicitv.
A relative pel address Bi indicating the relative position of the difference vector Di in the zone is obtained by the following equations except for k = 1:
Bi = (Bx, By) = (¦~xi¦ - W(k), ¦~Yi¦ - W~k~) for Q = 0 ... (17) x~ QYi ¦ - w ( ) ) for Q = 1 ... (18) ( ¦~Xil - W( ), l ~Yil ) for Q = 2 ... (19) where Q - k (mod 3) ... (20) Fig. 14 is a flow chart for explaining the steps of obtaining the relative pel address Bi in the zone in accordance with equations (17) to (20). This flow chart is the subroutine (step M15 far calculation of the relative pel address Bi) of the main routine in Fig. 11. Q is calculated from the zone number k using equation (20) in step S1501. It is then determined in 1219~)8(~
step S1502 which one of equations tl7) to (19) is to be used to calculate the relative pel address 3i in accordance with the obtained Q. Components or addresses Bx and By of the relative pel address Bi are calculated in steps S1503 to S1505.
Rererring again ~o Fig. 11, when the above-mentioned coding is performed and the state changes to the pen up state, it indicates the end of one stroke. This change is monitored in step M16.
When the pen up state is detected, the code 3up is produced in step M17.
The sampled point array {P0, Pl, P2,..., Pf}
corresponding to one stroke of the line drawing is expressed using the difference vectors as follows: {Dor Dl, D2,..., Df}. Each difference vector Di is expressed by the combination {~ai, ~ki, Bi}. The pen up code up is added to the final difference vector Df.
In order to code these components,-a fixed-length code is assigned to the starting point P0 designated as the absolute coordinate point, whereas variable-length codes are assigned to the quadrant number difference ~a and the zone number difference Qk.
Table 8 shows code allocation of the quadrant number difference ~a and the zone number dif erence ~k~
12~ 80 Table 8 Zone Code Table Symbol ¦ Value ¦ Code ~ O ~ 1 ; 1 I 01 3 ', 001 . I
~k ~ -5 0000 0000 l ~ -4 ll 0000 lO
-3 1l 001 -l ll OQOl O
l 0111 2 oOlolO l In the above table, the codes are assigned to the quadrant number difference ~ and the zone number difference ~k independently of each other. However, the codes may be assigned to pairs of a quadrant number difference and a zone number difference in Table 9 as ~ follows.
i ~80 Table 9 Zone Code Table No. ~a ~k I Length Code I
0 pen~ ted ~ 3Up) 3 bit 110 2 3 0 a 0001 3 1l 1 O ds I lill a I o 3 ~. I 0010 1 3 -3 6 l, 1000 01 18 3 2 7 1000 00~
~ 3V
No. ~3¦ ~k Length Code j 2 _3 8 0000 0001 The binary codes are assigned to the relative pel addresses Bi in the zone. Since {W(k)}2 difference vectors are included in the k-th zone, a required number of bits R(k) for specifying the difference vector in the zone can be given as follows:
R(k~ - 21Og2W(k~
= 21Og2h for k = 1 = 21Og2h + 2-[(k-2)/3] for k > 1 ...(21) where ~ ] is the Gaussian integer notation.
As may be apparent from equation (16), when the zone number k is obtained, the minimum number of bits to specify the address of the difference vector in the zone is determined by R(k). When the basic zone width h is taken as a power of two, the code bits assigned by R(k) may not be wasted, thereby providing effective coding~
Fig. 15 is a block diagram of a coding apparatus for performing the coding algorithm of the second embodiment. The coding apparatus of the second embodiment is substantially the same as that of the first embodiment ! except that in the second embodiment a zone number differentiator 20 and a zone number difference encoder 21 are added, and that an intrazone address generator 22 is arranged in place OI the area address circuit 16 and the local address circuit 17 in Fig. 8. The zone number differentiator 20 performs the oper~tion ki ~ ki 1 50 as to obtain the difference jki.
The zone number difference encoder 21 encodes the value of the difference ~ki which is produced by the zone number differentiator 20, in accordance with the allocation of the variable-length codes shown in Table 8. The variable-length code corresponding to the value of the difference ~ki is supplied to the transmitting code control circuit 11. The intrazone address generator 22 generates Q from the zone number k from the zone number circuit 14 in accordance with equation (20). Furthermore, the intrazone address or pel address Bi is calculated using whichever one of the equations (17) to (19) is determined by the value of Q.
The calculated pel address Bi is supplied to the transmitting code control circuit 11. The transmitting code control circuit 11 links the components Po~ Bi and 9up in a predetermined transmission format. Thus obtained codes are sequen-tially supplied to the transmittin~ bu~er memory 19~
The transmitted code can be decoded in a reverse manner with respect to the coding process so as to obtain the original coordinate signal.
As described above, the coding/decoding apparatus is not limited to the arrangement in the above embodiment. For example, a microprocessor may be used to perform coding/decoding in a software manner.
In the method and apparatus for coding the sampled points according to the second embodiment, the same advantages as in the first embodiment are obtained. Furthermore, since the zone number difference signal is coded, more effecti~e coding is performed.
The coding efficiency of line drawings shown in Figs. 16A to 16E of the second embodiment of the present invention is compared with that of the DCE and MDPCM methods. The results are shown in Table 10. As may be apparent from Table 10 below, the efficiency of the coding method of the present invention shows an improvement of about 20% and about 23% respectively as compared with the efficiencies of the DCE and MDPCM
methods.
~2~ 30 Table 10 inc Coding method \ Fig. 16AIFig. 16B Fig. 16CIFig. 16DIFig. 16E
i total bits 15,877 1 14,048 16,256 1 8,072 j iO,018 l -i bit rate 128 ~ 124 132 257 1 139 i (bit/sec) I t- -Zone ratio to 0.73 0.88 0.770.89 0.79 cod- ~CE l , _ ing ratio to0.76 0.79 0.79 0.83 0.70 MDPCM
. _ D OE total bits 21,61815,903 1 21,257 9,087 12,623 !
bit rate 188 149 182 310 132 ¦
M- total bits21,00517,624 20,559 9,75314 ,282 :
DPCM bit rate 170 155 167 310 198 .
.
'~
Claims (18)
1. A method for coding a line drawing, comprising the steps of:
inputting a series of coordinate signals indicating the line drawing;
subtracting every two adjacent coordinate signals among said series of coordinate signals from each other so as to obtain a series of difference vector signals;
determining to which one of a plurality or predetermined zones each of said series of difference vector signals belongs;
determining relative pel positions of said series of difference vector signals in a selected zone;
and coding said selected zone and said relative pel positions within said selected zone independently of each other.
inputting a series of coordinate signals indicating the line drawing;
subtracting every two adjacent coordinate signals among said series of coordinate signals from each other so as to obtain a series of difference vector signals;
determining to which one of a plurality or predetermined zones each of said series of difference vector signals belongs;
determining relative pel positions of said series of difference vector signals in a selected zone;
and coding said selected zone and said relative pel positions within said selected zone independently of each other.
2. A method according to claim 1, wherein said plurality of zones are represented by a plurality of quadrants for classifying a direction component of the difference vector signal and by a plurality of areas solely determined by an absolute value component of the difference vector signal for classifying a magnitude of the difference vector signal.
3. A method according to claim 2, wherein said plurality of quadrants comprise four quadrants obtained by dividing an X-Y coordinate plane by lines y = 0 and x = 0 when an x-direction component and a y-direction component of the difference vector signal are plotted along the X- and Y-axes, respectively.
4. A method according to claim 2, wherein said plurality of quadrants comprises four quadrants obtained by dividing an X-Y coordinate plane by lines y = x and y = -x when an x-direction component and a y-direction component of the difference vector signal are plotted along the X- and Y-axes, respectively.
5. A method according to claim 2, wherein said plurality of quadrants comprise eight octants obtained by dividing an X-Y coordinate plane by lines x = 0, y = 0, v = x and y = -x when an x-direction component and a y-direction component of the difference vector signal are plotted along the X- and Y-axes, respectively.
6. A method according to claim 2, wherein said plurality of quadrants are numbered, a sign component of the difference vector signal is used to determine a quadrant number of one of said plurality of quadrants which includes the difference vector signal, and a selected quadrant number is coded.
7. A method according to claim 2, wherein said plurality of quadrants are numbered, a sign component of the difference vector signal is used to determine a quadrant number of one of said plurality of quadrants which includes the difference vector signal, respectively, and a difference between the quadrant numbers of two adjacent different vector signals is coded to form a variable-length quadrant number difference code.
8. A method according to claim 1, wherein said plurality of predetermined zones are set such that a given zone thereof increases in size in accordance with an increase in an absolute value component of the difference vector signal included in the given zone.
9. A method according to claim 2, wherein said plurality of predetermined zones are set such that a width of a given zone thereof increases in proportion to a power of two in accordance with an increase in the absolute value component of the difference vector signal included in the given zone, and wherein said plurality of predetermined zones are numbered and variable-length codes are assigned thereto beforehand.
10. A method according to claim 2, wherein each of said plurality of zones has a square shape a length of one side of which is increased in proportion to a power of two, and each of said plurality of zones has a zone number.
11. A method according to claim 10, wherein the absolute value component of the difference vector signal which excludes a sign component are used to calculate a zone number of a given zone including the difference vector signal, and the zone number is coded to form a variable-length zone number code.
12. A method according to claim 10, wherein the absolute value component of the difference vector signals which excludes a sign component is used to calculate a zone number of a given zone including the difference vector signal, a difference between the zone numbers of two adjacent difference vector signals is obtained, and an obtained zone number difference is coded to form a variable-length zone number difference code.
13. A method according to claim 2, wherein each of said plurality of zones has at least one unit area having a predetermined size, a relative position of the difference vector signal in a first zone among said plurality of zones is designated by an area address assigned to each of said plurality of unit areas and a local address assigned to a relative pel position within the unit area when said first zone has said plurality of unit areas, and a relative position of the difference vector signal in a second zone among said plurality of zones is designated only by the local address when said second zone has only one of said unit areas.
14. A method according to claim 13, wherein a kth zone Z(k) among said plurality of zones is set to have said unit areas numbering 3 x (2k-1)2 each having a side of length h, and a zone number Zi of the kth zone Z(k) is given as follows:
Zi = ?log2([max([.DELTA.xi¦, ¦.DELTA.yi¦)/h] + 1)?
where ¦.DELTA.xi¦ and ¦.DELTA.yi¦ are the x and y absolute value components of the difference vector signal, [a] is the Gaussian integer notation for indicating a maximum integer of not more than a, and [a] is the Gaussian integer notation for indicating a minimum integer of not larger than a, the area address Ai is designated by a coordinate point (Axi, Ayi) calculated in units of said unit areas along the x- and y-directions so as to define the components Axi and Ayi as follows:
Axi = [¦xi¦/h]
Ayi = [¦yi¦/h], and the local address Li is designated by a coordinate point (Lxi, Lyi) calculated in units of said relative pel addresses along the x- and y-directions so as to define the components Lxi and Lyi as follows:
Lxi = ¦.DELTA.xi¦ - Axi x h Lyi = ¦.DELTA.yi¦ - Ayi x h.
Zi = ?log2([max([.DELTA.xi¦, ¦.DELTA.yi¦)/h] + 1)?
where ¦.DELTA.xi¦ and ¦.DELTA.yi¦ are the x and y absolute value components of the difference vector signal, [a] is the Gaussian integer notation for indicating a maximum integer of not more than a, and [a] is the Gaussian integer notation for indicating a minimum integer of not larger than a, the area address Ai is designated by a coordinate point (Axi, Ayi) calculated in units of said unit areas along the x- and y-directions so as to define the components Axi and Ayi as follows:
Axi = [¦xi¦/h]
Ayi = [¦yi¦/h], and the local address Li is designated by a coordinate point (Lxi, Lyi) calculated in units of said relative pel addresses along the x- and y-directions so as to define the components Lxi and Lyi as follows:
Lxi = ¦.DELTA.xi¦ - Axi x h Lyi = ¦.DELTA.yi¦ - Ayi x h.
15. A method according to claim 14, wherein a zone number of each of said plurality of zones is assigned a variable-length code, the area address is assigned a binary code whose bit length varies in accordance with a size of the zone, and the local address is assigned a fixed-length binary code having a bit length of [log2h].
16. A method according to claim 12, wherein the side of the square of the kth zone is given as W (k) as follows:
...(a) where h is a width of the zone for k = 1 and [ ]
is the Gaussian integer notation, the zone number k is set using inequalities (b) below in accordance with the magnitude of the absolute value component of the difference vector signal:
... (b) the zone number ki is calculated from absolute values (¦.DELTA.xi¦ ,¦.DELTA.yi¦) of the difference vector signal in accordance with the equations (a) and inequalities (b), the difference .DELTA.ki = ki - ki-1 between the zone numbers ki and ki-1 of two adjacent difference vector signals is calculated, and the relative pel address Bi in the zone containing the difference vector signal is calculated by equations (c) and (d) below:
...(c) ? - k (mod 3) ...(d).
...(a) where h is a width of the zone for k = 1 and [ ]
is the Gaussian integer notation, the zone number k is set using inequalities (b) below in accordance with the magnitude of the absolute value component of the difference vector signal:
... (b) the zone number ki is calculated from absolute values (¦.DELTA.xi¦ ,¦.DELTA.yi¦) of the difference vector signal in accordance with the equations (a) and inequalities (b), the difference .DELTA.ki = ki - ki-1 between the zone numbers ki and ki-1 of two adjacent difference vector signals is calculated, and the relative pel address Bi in the zone containing the difference vector signal is calculated by equations (c) and (d) below:
...(c) ? - k (mod 3) ...(d).
17. An apparatus for coding a line drawing, comprising:
an input terminal for receiving a series of coordinate signals indicating the line drawing;
a differentiator for subtracting every two adjacent coordinate signals among said series of coordinate signals from each other so as to produce a series of difference vector signals;
a quadrant circuit for determining a quadrant number of a quadrant of each of said series of difference vector signals;
a quadrant differentiator for subtracting the quadrant numbers of the two adjacent difference vector signals from each other so as to produce a series of quadrant number difference signals;
a zone circuit for sequentially determining a plurality of zones which include said series of difference vector signals in accordance with absolute values thereof:
an area address circuit for sequentially determining unit areas which include said series of difference vector signals, said unit areas constituting said plurality of zones;
a local address circuit for sequentially determining relative pel addresses which correspond to said series of difference vector signals; and an encoder for encoding the quadrant number difference signal, a zone number signal, an area address indicating the unit area corresponding thereto, and a local address indicating the relative pel address corresponding thereto.
an input terminal for receiving a series of coordinate signals indicating the line drawing;
a differentiator for subtracting every two adjacent coordinate signals among said series of coordinate signals from each other so as to produce a series of difference vector signals;
a quadrant circuit for determining a quadrant number of a quadrant of each of said series of difference vector signals;
a quadrant differentiator for subtracting the quadrant numbers of the two adjacent difference vector signals from each other so as to produce a series of quadrant number difference signals;
a zone circuit for sequentially determining a plurality of zones which include said series of difference vector signals in accordance with absolute values thereof:
an area address circuit for sequentially determining unit areas which include said series of difference vector signals, said unit areas constituting said plurality of zones;
a local address circuit for sequentially determining relative pel addresses which correspond to said series of difference vector signals; and an encoder for encoding the quadrant number difference signal, a zone number signal, an area address indicating the unit area corresponding thereto, and a local address indicating the relative pel address corresponding thereto.
18. An apparatus for coding a line drawing, comprising:
an input terminal for receiving a series of coordinate signals indicating the line drawing;
a differentiator for subtracting every two adjacent coordinate signals among said series of coordinate signals from each other so as to produce a series of difference vector signals;
a quadrant circuit for determining a quadrant number of a quadrant of each of said series of difference vector signals;
a quadrant differentiator for subtracting the quadrant numbers of the two adjacent difference vector signals from each other so as to produce a series of quadrant number difference signals;
a zone circuit for sequentially determining a plurality of zones which include said series of difference vector signals in accordance with absolute values thereof;
a zone number differentiator for calculating a difference between the zone numbers of said zones which include the two adjacent difference vector signals so as to obtain a series of zone number difference signal;
a circuit for generating relative addresses of the difference vector signals in the zone; and an encoder for encoding the quadrant number difference signal, the zone number difference signal and the relative address in the zone.
an input terminal for receiving a series of coordinate signals indicating the line drawing;
a differentiator for subtracting every two adjacent coordinate signals among said series of coordinate signals from each other so as to produce a series of difference vector signals;
a quadrant circuit for determining a quadrant number of a quadrant of each of said series of difference vector signals;
a quadrant differentiator for subtracting the quadrant numbers of the two adjacent difference vector signals from each other so as to produce a series of quadrant number difference signals;
a zone circuit for sequentially determining a plurality of zones which include said series of difference vector signals in accordance with absolute values thereof;
a zone number differentiator for calculating a difference between the zone numbers of said zones which include the two adjacent difference vector signals so as to obtain a series of zone number difference signal;
a circuit for generating relative addresses of the difference vector signals in the zone; and an encoder for encoding the quadrant number difference signal, the zone number difference signal and the relative address in the zone.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP113610/1982 | 1982-06-30 | ||
| JP57113610A JPS594382A (en) | 1982-06-30 | 1982-06-30 | Encoding system of drawn picture |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA1219080A true CA1219080A (en) | 1987-03-10 |
Family
ID=14616576
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA000431469A Expired CA1219080A (en) | 1982-06-30 | 1983-06-29 | Method and an apparatus for coding/decoding telewriting signals |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US4597101A (en) |
| EP (1) | EP0098223B1 (en) |
| JP (1) | JPS594382A (en) |
| CA (1) | CA1219080A (en) |
| DE (1) | DE3380536D1 (en) |
Families Citing this family (30)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS59121478A (en) * | 1982-12-27 | 1984-07-13 | Casio Comput Co Ltd | Character recognizing device |
| CH665494A5 (en) * | 1985-04-26 | 1988-05-13 | Battelle Memorial Institute | METHOD FOR THE DIGITAL STORAGE OF AN ANALOG CURVE AND OF TRACING A REPRESENTATIVE CURVE OF THIS ANALOG CURVE. |
| JPS61291418A (en) * | 1985-06-14 | 1986-12-22 | Natl Inst For Res In Inorg Mater | Production of easily sinterable raw material powder of tungsten bronze-type oxide |
| JPS6282486A (en) * | 1985-10-08 | 1987-04-15 | Hitachi Ltd | Recognizing device for online handwritten graphic form |
| US4944023A (en) * | 1987-05-19 | 1990-07-24 | Ricoh Company, Ltd. | Method of describing image information |
| JP2739130B2 (en) * | 1988-05-12 | 1998-04-08 | 株式会社鷹山 | Image processing method |
| FR2645301B1 (en) * | 1989-03-31 | 1994-07-22 | Matra Sep Imagerie Inf | METHOD AND DEVICE FOR TRACKING CARDS |
| US5091975A (en) * | 1990-01-04 | 1992-02-25 | Teknekron Communications Systems, Inc. | Method and an apparatus for electronically compressing a transaction with a human signature |
| US5077802A (en) * | 1991-02-11 | 1991-12-31 | Ecole Polytechnique | Apparatus and method for digitizing and segmenting a handwriting movement based on curvilinear and angular velocities |
| US5101437A (en) * | 1991-02-11 | 1992-03-31 | Ecole Polytechnique | Method and apparatus for comparing a test handwritten signature with a reference signature by using information relative to curvilinear and angular velocities of the signature |
| US5227590A (en) * | 1991-05-17 | 1993-07-13 | Ncr Corporation | Handwriting capture device |
| US5428210A (en) * | 1992-01-10 | 1995-06-27 | National Bancard Corporation | Data card terminal with embossed character reader and signature capture |
| US5222138A (en) * | 1992-08-06 | 1993-06-22 | Balabon Sam D | Remote signature rendering system & apparatus |
| US5463616A (en) * | 1993-01-07 | 1995-10-31 | Advanced Protocol Systems, Inc. | Method and apparatus for establishing a full-duplex, concurrent, voice/non-voice connection between two sites |
| US5452289A (en) * | 1993-01-08 | 1995-09-19 | Multi-Tech Systems, Inc. | Computer-based multifunction personal communications system |
| US5535204A (en) * | 1993-01-08 | 1996-07-09 | Multi-Tech Systems, Inc. | Ringdown and ringback signalling for a computer-based multifunction personal communications system |
| US7082106B2 (en) | 1993-01-08 | 2006-07-25 | Multi-Tech Systems, Inc. | Computer-based multi-media communications system and method |
| US5412161A (en) * | 1993-06-21 | 1995-05-02 | At&T Global Information Solutions Company | Handwriting capture system with segmented digitizer |
| US5577135A (en) * | 1994-03-01 | 1996-11-19 | Apple Computer, Inc. | Handwriting signal processing front-end for handwriting recognizers |
| US5757801A (en) | 1994-04-19 | 1998-05-26 | Multi-Tech Systems, Inc. | Advanced priority statistical multiplexer |
| US5682386A (en) | 1994-04-19 | 1997-10-28 | Multi-Tech Systems, Inc. | Data/voice/fax compression multiplexer |
| US5525764A (en) * | 1994-06-09 | 1996-06-11 | Junkins; John L. | Laser scanning graphic input system |
| US6295378B1 (en) | 1996-02-29 | 2001-09-25 | Sanyo Electric Co., Ltd. | Handwriting stroke information encoder which encodes handwriting stroke information by sampling |
| FR2770952B1 (en) | 1997-11-12 | 2000-01-21 | Adl Systeme Sa | TELE-WRITING DEVICE |
| WO2002091288A1 (en) * | 2001-05-10 | 2002-11-14 | Bijitec Pte Ltd | System and method for compressing stroke-based handwriting and line drawing |
| US20050021824A1 (en) * | 2003-07-09 | 2005-01-27 | Anderson Daryl E. | Systems and methods transmitting graphical data |
| JP4939824B2 (en) * | 2006-03-15 | 2012-05-30 | 富士通株式会社 | Outline font compression method and decoding method |
| US20120173242A1 (en) * | 2010-12-30 | 2012-07-05 | Samsung Electronics Co., Ltd. | System and method for exchange of scribble data between gsm devices along with voice |
| CN105187910B (en) * | 2015-09-12 | 2018-11-06 | 暴风集团股份有限公司 | A kind of method and system of automatic detection video auto-adaptive parameter |
| CN113392828B (en) * | 2021-04-08 | 2024-01-26 | 南通骏星信息科技有限公司 | Encoding and decoding method based on high-resolution dot matrix |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB1171627A (en) * | 1966-10-07 | 1969-11-26 | Post Office | Improvements in or relating to Character Recognition Machines |
| UST930003I4 (en) * | 1972-06-30 | 1975-01-07 | Method for compacting vector generation data | |
| GB1494901A (en) * | 1974-04-30 | 1977-12-14 | Suisse Horlogerie | Data entry and decoding system |
| US3982165A (en) * | 1974-09-10 | 1976-09-21 | The Gerber Scientific Instrument Company | Apparatus for digitizing and plotting |
| US3982227A (en) * | 1975-06-02 | 1976-09-21 | General Electric Company | Pattern recognition machine for analyzing line orientation |
| US4020463A (en) * | 1976-02-27 | 1977-04-26 | Recognition Equipment Incorporated | Apparatus and a method for storage and retrieval of image patterns |
| US4298945A (en) * | 1978-05-12 | 1981-11-03 | Eltra Corporation | Character generating method and apparatus |
| JPS5827551B2 (en) * | 1979-05-18 | 1983-06-10 | 日本電信電話株式会社 | Online handwritten character recognition method |
-
1982
- 1982-06-30 JP JP57113610A patent/JPS594382A/en active Granted
-
1983
- 1983-06-27 EP EP83401323A patent/EP0098223B1/en not_active Expired
- 1983-06-27 DE DE8383401323T patent/DE3380536D1/en not_active Expired
- 1983-06-28 US US06/508,900 patent/US4597101A/en not_active Expired - Lifetime
- 1983-06-29 CA CA000431469A patent/CA1219080A/en not_active Expired
Also Published As
| Publication number | Publication date |
|---|---|
| EP0098223A2 (en) | 1984-01-11 |
| EP0098223B1 (en) | 1989-09-06 |
| US4597101A (en) | 1986-06-24 |
| JPS6340075B2 (en) | 1988-08-09 |
| DE3380536D1 (en) | 1989-10-12 |
| JPS594382A (en) | 1984-01-11 |
| EP0098223A3 (en) | 1987-01-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA1219080A (en) | Method and an apparatus for coding/decoding telewriting signals | |
| Gatos et al. | Skew detection and text line position determination in digitized documents | |
| CN112766008B (en) | Object space pose acquisition method based on two-dimensional code | |
| ES2015393A6 (en) | Document manipulation in a data processing system. | |
| US5933528A (en) | Image processing apparatus | |
| CN103927572B (en) | By coding segment to form the method and apparatus of dot pattern | |
| CN103927575B (en) | By coding pattern to form the method and device of dot pattern | |
| EP0858226B1 (en) | Method and apparatus for encoding a contour of an object by using a vertex inserting technique | |
| US5790701A (en) | Character recognition apparatus using edge images | |
| EP0596280B1 (en) | Method and apparatus for determining the type of an electronically stored image of a document | |
| Chang et al. | An inverse voting algorithm for Hough Transform | |
| Chao | On the size of a cap in PG (n, q) with q even and n≥ 3 | |
| Manis et al. | Optimal piecewise linear approximation of digitized curves | |
| KR102655999B1 (en) | Apparatus and method for detecting distance values per instance object using a stereo camera | |
| JPS609890Y2 (en) | Graphic input device | |
| JP2885476B2 (en) | Image processing method and apparatus | |
| JP2545610B2 (en) | Linear approximation method | |
| Asano et al. | A small-space algorithm for removing small connected components from a binary image | |
| Hung et al. | Linear approximation of quantized thin lines | |
| Minoh et al. | Mesh-oriented line drawings theory (MOLD theory) | |
| CN115936047A (en) | Encoding and decoding method of colorful Chinese-sensible code, electronic equipment and storage medium | |
| Sousa et al. | An Evaluation of 3D-Chain Coding for Transmission of Handwritten Text | |
| JPS5927503B2 (en) | calligraphy communication device | |
| JPH04112385A (en) | Vector approximation system | |
| JP2595496B2 (en) | Character classification method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| MKEX | Expiry |