Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
JPH0453354B2 - - Google Patents
[go: Go Back, main page]

JPH0453354B2 - - Google Patents

Info

Publication number
JPH0453354B2
JPH0453354B2 JP60079874A JP7987485A JPH0453354B2 JP H0453354 B2 JPH0453354 B2 JP H0453354B2 JP 60079874 A JP60079874 A JP 60079874A JP 7987485 A JP7987485 A JP 7987485A JP H0453354 B2 JPH0453354 B2 JP H0453354B2
Authority
JP
Japan
Prior art keywords
block
halftone
pixels
signal
scanning direction
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
JP60079874A
Other languages
Japanese (ja)
Other versions
JPS61238176A (en
Inventor
Hisashi Ibaraki
Makoto Kobayashi
Hiroshi Ochi
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NTT Inc
Original Assignee
Nippon Telegraph and Telephone Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nippon Telegraph and Telephone Corp filed Critical Nippon Telegraph and Telephone Corp
Priority to JP60079874A priority Critical patent/JPS61238176A/en
Priority to DE8686400020T priority patent/DE3686821T2/en
Priority to EP86400020A priority patent/EP0187724B1/en
Priority to US06/817,046 priority patent/US4722008A/en
Publication of JPS61238176A publication Critical patent/JPS61238176A/en
Publication of JPH0453354B2 publication Critical patent/JPH0453354B2/ja
Granted legal-status Critical Current

Links

Landscapes

  • Image Processing (AREA)
  • Facsimile Image Signal Circuits (AREA)

Description

【発明の詳細な説明】 (1) 発明の属する分野の説明 本発明は、文字中間調、網点等の混在原稿を走
査して得られる中間調フアクシミリ信号を、符号
化に適した中間調信号に処理し変換する中間調フ
アクシミリ信号処理方法に関するものである。
[Detailed Description of the Invention] (1) Description of the field to which the invention pertains The present invention converts a halftone facsimile signal obtained by scanning an original containing halftone characters, halftone dots, etc. into a halftone signal suitable for encoding. The present invention relates to a halftone facsimile signal processing method for processing and converting halftone facsimile signals.

(2) 従来の技術の説明 我々のまわりにある中間調やカラー画の大部分
は網点写真を利用した印刷物である。網点写真は
印刷分野において原稿の濃淡を表現するために使
われるもので、インクのドツトの大小で人間の眼
に濃淡を感じさせるものである。現在写真のよう
な濃淡を含む印刷物のほとんどに網点写真が用い
られ、インクドツトの周期も非常に細かいものか
ら粗いものまで様々なものが使われている。この
ような周期性を持つたドツトの集合である印刷物
をフアクシミリなどで走査する場合、通常の写真
などの原稿の場合には階調変化がサンプル密度に
くらべ十分大きいために隣接画素間で階調の変化
が小さいが、網点写真ではサンプル密度とほぼ同
程度の密度を持つ微小黒ドツトの集合であるため
に得られた画信号はほぼ1画素毎に激しく階調が
変化する。文字・写真等の網点を含まない画信号
においては、画信号を輪郭や文字部等の階調変化
の激しい部分とそれ以外の階調変化の穏やかな部
分に分けてから平均化処理等を行い、精細性を損
なうことなしに冗長度を除いているが、網点等を
含んだ画信号に対しては先に述べた網点部分の階
調変化の性質のため、十分に冗長度を除く平均化
が困難であり、処理後の画信号も通常の写真のよ
うな階調変化を前提としている既存の符号化方式
とは適合性が悪いという欠点があつた。
(2) Explanation of conventional technology Most of the halftone and color paintings around us are printed materials using halftone photographs. Halftone photographs are used in the printing field to express the shading of manuscripts, and the size of the ink dots gives the impression of shading to the human eye. Currently, halftone photographs are used for most of the printed materials that contain shading, such as photographs, and the period of ink dots varies from very fine to coarse. When scanning printed matter, which is a collection of dots with such periodicity, using a facsimile machine, etc., in the case of documents such as ordinary photographs, the gradation changes are sufficiently large compared to the sample density, so the gradation changes between adjacent pixels. However, in a halftone photograph, since the image signal is a collection of minute black dots having a density approximately equal to the sample density, the obtained image signal has a sharp change in gradation almost for each pixel. For image signals that do not include halftone dots, such as text and photographs, the image signal is divided into areas with sharp gradation changes such as outlines and characters, and other areas with gentle gradation changes, and then averaging processing is performed. However, for image signals that include halftone dots, due to the nature of gradation changes in halftone dots, it is necessary to remove redundancy without sacrificing definition. It has the disadvantage that it is difficult to average the data, and that it is not compatible with existing encoding methods, which assume that the image signal after processing changes in gradation like a normal photograph.

(3) 発明の目的 本発明は、これらの欠点を解決するため、画信
号中の網点部分を簡単な処理で識別し、その後、
精細性を損なうことなしに符号化に適した中間調
信号に変換処理する中間調フアクシミリ信号処理
方法に関するものであり、以下図面を用いて詳細
に説明する。
(3) Purpose of the Invention In order to solve these drawbacks, the present invention identifies halftone dots in an image signal through simple processing, and then
The present invention relates to a halftone facsimile signal processing method for converting into a halftone signal suitable for encoding without impairing definition, and will be described in detail below with reference to the drawings.

(4) 発明の構成および作用の説明 具体例として、1つの実施態様の場合について
図を用い、詳細に説明する。
(4) Description of structure and operation of the invention As a specific example, one embodiment will be described in detail using figures.

第1図は、網点および中間調部分の輪郭等を識
別するため、隣接ブロツクとの平均信号レベル差
を求めるためのブロツクの位置の一例である。図
中、P0,PA,PBは各ブロツクの平均信号レベル
を表し、|P0−PA|または|P0−PB|の一方でも
あらかじめ定められた値より大きい場合にはP0
を平均信号レベルとして持つブロツクを輪郭部分
と判定する。たとえば、この輪郭判定のしきい値
を4とすれば、 |P0−PA|=|6−12|=6≧4 となり、第1図の場合、P0を持つブロツクは輪
郭と判定される。この判定の結果、輪郭と判定さ
れたブロツクでは、ブロツク内の画素を平均信号
レベルP0より小さい画素と大きい画素とのグル
ープに分け、それぞれのグループの平均信号レベ
ルP1,P2を求め、それぞれのグループの画素の
信号レベルをそれぞれP1,P2でおきかえる。ま
た、輪郭ではないと判定されたブロツクの中で
も、文字部等ではまだ階調変化が激しく精細性を
保存すべきブロツクが残つている。そのため、ブ
ロツク内で階調変化の激しいブロツクを識別する
必要がある。第2図は周期的な濃度変化を持つ画
像を4画素四方の大きさを持つブロツクで見た場
合のブロツク内のレベル変化の一例を模式的に書
いたものである。図中、黒い部分は比較的濃度レ
ベルの高い画素、白い部分は比較的濃度レベルの
低い画素を表している。その他にも様々なパター
ンがあるがここでは省略している。第2図に示す
パターンではブロツク内の階調変化の値が大きい
ものであるが、これらのパターンのうち、図中の
番号で(1,3)、(3,1)、(1,4)、(4,
1)のパターンは、文字・線画等において出現し
やすいものであり、精細性を保存すべきであり、
逆に番号(i,j)の大きいパターンは従来技術
の説明で述べた符号化等に悪影響を及ぼす網点の
パターンであり、輪郭部分でなければ階調変化が
大きくても平均化処理を行う必要がある。
FIG. 1 shows an example of the position of a block for determining the average signal level difference between adjacent blocks in order to identify the contours of halftone dots and halftone portions. In the figure, P 0 , P A , and P B represent the average signal level of each block. If either |P 0 −P A | or |P 0 −P B | is larger than a predetermined value, P 0
A block having an average signal level of is determined to be a contour portion. For example, if the threshold value for contour determination is 4, |P 0 −P A |=|6−12|=6≧4, and in the case of Figure 1, the block with P 0 is determined to be a contour. Ru. As a result of this determination, for a block determined to be a contour, the pixels within the block are divided into groups of pixels whose average signal level is smaller than P 0 and pixels whose average signal level is larger than P 0 , and the average signal levels P 1 and P 2 of each group are calculated. The signal levels of the pixels in each group are replaced by P 1 and P 2 , respectively. Furthermore, among the blocks that are determined not to be contours, there are still blocks such as text portions that have severe gradation changes and whose fineness should be preserved. Therefore, it is necessary to identify blocks in which the gradation changes drastically within the block. FIG. 2 schematically shows an example of level changes within a block when an image with periodic density changes is viewed as a block with a size of four pixels square. In the figure, black parts represent pixels with a relatively high density level, and white parts represent pixels with a relatively low density level. There are various other patterns, but they are omitted here. The patterns shown in Figure 2 have large gradation changes within the block, but among these patterns, the numbers in the figure are (1, 3), (3, 1), (1, 4). ,(4,
The pattern 1) is likely to appear in characters, line drawings, etc., and its fineness should be preserved.
On the other hand, patterns with large numbers (i, j) are halftone dot patterns that have a negative effect on encoding, etc., as described in the explanation of the conventional technology, and averaging processing is performed even if there is a large gradation change unless it is an outline part. There is a need.

第3図Aはブロツク内の画素を以後の処理にお
いて主走査方向にアクセスする順番の一例を示
し、第3図Bは同じく副走査方向にアクセスする
順番の一例を示したものである。第2図のような
濃度レベルの分布を持つたブロツク内の画素を第
3図のようなあらかじめ決められた順番で主走査
方向と副走査方向とにアクセスし、連続する2つ
の画素のレベル差を算出する。l番目にアクセス
した画素のレベルをLl、l+1番目の画素のレベ
ルをLl+1とすると、その差は Dl=Ll−Ll+1 となる。同様にl+1番目の画素とl+2番目の
画素のレベル差は Dl+1=Ll+1−Ll+2 となる。連続するDK,DK+1の正/負の変化に注
目すると第3図の順番では第2図の番号(i,
j)が大きいもの程、正から負、負から正への変
化の回数が主走査方向と副走査方向ともに大きく
なる。第2図の16個のレベルパターンに対し、そ
れぞれ第3図の順番で主走査方向と副走査方向と
にアクセスした結果得られたレベル差の信号にお
いて、主走査方向と副走査方向との正/負の変化
の回数〔主走査方向の変化の回数、副走査方向の
変化の回数〕を示したものが第4図である。ただ
し、第4図に示した変化の回数には、第3図に示
したアクセスの順番の4から5、8から9、12か
ら13における変化の回数は計測していない。図か
ら判るように(1,1)のブロツクでは、主走査
方向、副走査方向ともに1回も正/負の変化がな
いのに対し、即ち〔0,0〕であるのに対し、
(4,4)のブロツクでは主走査方向、副走査方
向ともに12回も変化がある。この回数に着目すれ
ばブロツク中の濃度分布の複雑さを検出すること
ができる。例えば、第2図の例で(2,2)、
(2,3)、(2,4)、(3,2)、(3,3)、(
3,
4)、(4,2)、(4,3)、(4,4)の9種類の
パターンを網点に起因するものとして識別しよう
とするとき、第4図から例えば正/負変化の回数
が主走査方向、副走査方向ともに4回をしきい値
とすれば、主走査方向、副走査方向ともに4回以
上のブロツクとして識別することができる。そこ
で、輪郭等でないと判定されたブロツクに対して
先の網点識別を行い、網点と識別されたブロツク
では、ブロツク内の各々の画素を隣接画素間で信
号レベル差が小さくなるようにいくつかの信号レ
ベルで置きかえる。即ち平均信号レベルP0の近
傍の値をもつ複数の信号レベルP0′,P0″,……で
置きかえる。勿輪すべての画素を平均信号レベル
P0で置きかえてもよい。この場合には上記いく
つかの信号レベルが1つの信号レベルP0である
と考えればよい。網点と判定されなかつたブロツ
クでは、ブロツク内の最大信号レベルLmaxと最
小信号レベルLminを求め、その差(Lmax−
Lmin)を求める。その差(Lmax−Lmin)があ
らかじめ定められた値より、大きければ、そのブ
ロツクを文字部分等と判定し、輪郭等と同様にブ
ロツク内の画素をP1,P2でおきかえる。また、
(Lmax−Lmin)があらかじめ定められた値より
小さければ、ブロツク内の画素を平均信号レベル
P0でおきかえる。たとえば、第5図のような信
号レベルのブロツクに対して、階調差に対するし
きい値を100とすれば、このブロツクでは、
Lmax=140、Lmin=30で Lmax−Lmin=110100 となり、ブロツク内の画素は、P0=80以下の画
素ではP1=40で、P0より大きい画素はP2=120で
おきかえられ図のように変換処理される。
FIG. 3A shows an example of the order in which pixels within a block are accessed in the main scanning direction in subsequent processing, and FIG. 3B similarly shows an example of the order in which they are accessed in the sub-scanning direction. Pixels in a block with density level distribution as shown in Figure 2 are accessed in the main scanning direction and sub-scanning direction in a predetermined order as shown in Figure 3, and the level difference between two consecutive pixels is calculated. Calculate. Assuming that the level of the l-th pixel accessed is Ll and the level of the l+1-th pixel is Ll +1 , the difference is Dl = Ll - Ll +1 . Similarly, the level difference between the l+1st pixel and the l+2nd pixel is Dl +1 =Ll +1 -Ll +2 . Paying attention to the successive positive/negative changes of D K and D K+1 , in the order of Figure 3, the numbers (i,
The larger j) is, the greater the number of changes from positive to negative and from negative to positive in both the main scanning direction and the sub-scanning direction. In the signal of the level difference obtained as a result of accessing the 16 level patterns in Fig. 2 in the main scanning direction and the sub-scanning direction in the order shown in Fig. 3, the difference between the main scanning direction and the sub-scanning direction is determined. FIG. 4 shows the number of negative changes (number of changes in the main scanning direction, number of changes in the sub-scanning direction). However, the number of changes shown in FIG. 4 does not include the number of changes from 4 to 5, 8 to 9, and 12 to 13 in the access order shown in FIG. As can be seen from the figure, in the block (1, 1), there is no positive/negative change even once in both the main scanning direction and the sub-scanning direction, that is, [0, 0].
In the block (4, 4), there are 12 changes in both the main scanning direction and the sub-scanning direction. By focusing on this number of times, the complexity of the concentration distribution in the block can be detected. For example, in the example in Figure 2 (2, 2),
(2,3), (2,4), (3,2), (3,3), (
3,
4), (4,2), (4,3), and (4,4) as being caused by halftone dots, from Figure 4, for example, the number of positive/negative changes. If the threshold value is 4 times in both the main scanning direction and the sub-scanning direction, it is possible to identify the block as having occurred 4 times or more in both the main scanning direction and the sub-scanning direction. Therefore, the previous halftone dot identification is performed on blocks that are determined not to be contours, etc., and for blocks that are identified as halftone dots, each pixel in the block is divided into several pixels so that the difference in signal level between adjacent pixels is reduced. Replace it with that signal level. In other words, it is replaced with multiple signal levels P 0 , P 0 ″, etc. having values near the average signal level P 0. All pixels of course are replaced with the average signal level P 0
May be replaced with P 0 . In this case, the above-mentioned several signal levels may be considered as one signal level P0 . For blocks that are not determined to be halftone dots, find the maximum signal level Lmax and minimum signal level Lmin within the block, and calculate the difference (Lmax -
Find Lmin). If the difference (Lmax - Lmin) is larger than a predetermined value, the block is determined to be a character part, etc., and the pixels in the block are replaced with P 1 and P 2 in the same way as for contours. Also,
If (Lmax−Lmin) is smaller than a predetermined value, the pixels in the block are set to the average signal level.
Replace with P 0 . For example, if the threshold value for the tone difference is set to 100 for a signal level block as shown in Fig. 5, then for this block,
When Lmax = 140 and Lmin = 30, Lmax - Lmin = 110100, and the pixels in the block are replaced with P 1 = 40 for pixels below P 0 = 80, and P 2 = 120 for pixels larger than P 0 , as shown in the figure. The conversion process is as follows.

第6図は本発明の一実施例である。1は中間調
フアクシミリ信号の入力端子である。2は信号メ
モリであつて入力端子1から入力される信号を1
ブロツク分あるいは複数ブロツク分格納する。3
は平均信号レベル算出器であつて信号メモリ2か
らの信号により、ブロツク内平均を算出し、レジ
スタに送る。平均信号レベルレジスタ41,42
と1ブロツクライン遅延器43との値から減算器
51,52でそれぞれ|P0−PA|、|P0−PB|が
算出される。その値により、輪郭等判定回路6
で、ブロツクの画素をP1,P2で置換するかどう
かを判定する。判定回路6において輪郭等でない
と判定された場合には、メモリアドレスコントロ
ーラ7により信号メモリ2から信号が呼びださ
れ、信号レジスタ81,82に送られる。減算器
9により隣接画素間の差が算出され、差信号レジ
スタ101,102に送られる。正/負変化検出
器11により、正/負の変化を検出し、その結果
がカウンタセレクタ12により主、副走査方向カ
ウンタ131,132に送られ、カウンタは正/
負変化が検出されたことを示す信号が入力した時
のみ動作する。網点判定器14ではカウンタ13
1,132の値により網点部分の判定を行う。最
大値検出器156と最小値検出器157とでは、
ブロツク内の最大値と最小値とをそれぞれ検出
し、減算器16でそれらの差を求める。文字等判
定回路17では網点判定器14の結果が網点でな
いと判定された場合に減算器1の値により文字部
かどうかの判定を行う。
FIG. 6 shows an embodiment of the present invention. 1 is an input terminal for a halftone facsimile signal. 2 is a signal memory which stores the signal input from input terminal 1 as 1.
Store a block or multiple blocks. 3
is an average signal level calculator which calculates the intra-block average based on the signal from the signal memory 2 and sends it to the register. Average signal level registers 41, 42
|P 0 -P A | and |P 0 -P B | are calculated by subtractors 51 and 52 from the values of and 1-block line delay device 43, respectively. Based on the value, the contour etc. judgment circuit 6
Then, it is determined whether to replace the pixels of the block with P 1 and P 2 . If the determination circuit 6 determines that it is not a contour or the like, the memory address controller 7 reads out the signal from the signal memory 2 and sends it to the signal registers 81 and 82. The difference between adjacent pixels is calculated by the subtracter 9 and sent to difference signal registers 101 and 102. The positive/negative change detector 11 detects a positive/negative change, and the counter selector 12 sends the result to the main and sub-scanning direction counters 131 and 132.
It operates only when a signal indicating that a negative change has been detected is input. In the halftone dot judge 14, the counter 13
The halftone dot area is determined based on the value of 1,132. In the maximum value detector 156 and minimum value detector 157,
The maximum value and minimum value within the block are respectively detected, and a subtracter 16 calculates the difference between them. In the character determination circuit 17, when it is determined that the result of the halftone dot determination device 14 is not a halftone dot, it is determined based on the value of the subtractor 1 whether or not it is a character portion.

比較器18では、ブロツク平均信号レベルと各
画素との大小関係を比較し、P1算出回路191
とP2算出回路192とによりP1,P2の平均値を
算出する。また、画素情報メモリ20にはどの画
素がP1に含まれ、どの画素がP2に含まれるかを
示す情報が格納され、信号レベル置換回路21で
は、判定情報をもとにブロツク内の信号レベルの
置換処理が行われ、出力端子22に処理信号が出
力される。
The comparator 18 compares the magnitude relationship between the block average signal level and each pixel, and calculates the P1 calculation circuit 191.
and P 2 calculation circuit 192 calculate the average value of P 1 and P 2 . Further, the pixel information memory 20 stores information indicating which pixels are included in P1 and which pixels are included in P2 , and the signal level replacement circuit 21 converts the signals in the block based on the determination information. Level replacement processing is performed, and a processed signal is output to the output terminal 22.

(5) 効果の説明 以上説明したように、本発明にれば、簡単な処
理で精細性を損なうことなく中間調フアクシミリ
信号を符号化に適した信号に変換処理することが
できる。なお、説明では4×4画素の正方領域に
したが、もちろんこれ以外の画素数、形状でも問
題ない。また、網点識別部分において、画素のア
クセスの順番やアクセスする画素数を変えること
により識別処理を簡易化できる。なお、この網点
識別においてあらかじめ決められた信号レベルに
よつて変化を計測すれば画信号の雑音等の影響を
受けにくくなる。この変化を計測するための信号
レベルは、全ブロツクで一定値とすることも、ブ
ロツクごとに変えることもできる。例えば、この
変化を計測するための信号レベルを各ブロツクの
平均レベルとすることもでき、この場合にはl番
目にアクセスされた画素が平均レベルより小で、
l+1番目にアクセスされた画素が平均レベルよ
り大の時、またはその逆に、l番目が大でl+1
番目が小の時に変化があるとする。このように、
各ブロツクの平均レベルを用いた場合には、原稿
の部分的な濃淡の違いに追従し、精度良く網点領
域を識別できる。また説明では、信号レベル差の
小さなブロツクでは、平均信号レベルP0で全て
の画素を置き換え、信号レベル差の大きなブロツ
クでは平均値より小さい画素のグループの平均
P1と大きい画素のグループの平均P2で置き換え
ているが、もちろん、これ以外の信号レベルで置
き換えることもできる。また、置き換える信号レ
ベルの数をかえてもよい。
(5) Description of Effects As described above, according to the present invention, it is possible to convert a halftone facsimile signal into a signal suitable for encoding through simple processing without impairing definition. In the description, a square area of 4×4 pixels is used, but of course other numbers of pixels and shapes may be used. Further, in the halftone dot identification portion, the identification process can be simplified by changing the order of pixel access and the number of pixels to be accessed. Note that if the change in halftone dot identification is measured using a predetermined signal level, it will be less susceptible to the effects of image signal noise and the like. The signal level for measuring this change can be set to a constant value for all blocks, or can be changed for each block. For example, the signal level for measuring this change can be the average level of each block, in which case the lth accessed pixel is lower than the average level,
When the l+1th accessed pixel is larger than the average level, or vice versa, if the lth accessed pixel is larger and l+1
Suppose that there is a change when the number is small. in this way,
When the average level of each block is used, it is possible to follow the difference in local shading of the document and identify the halftone dot area with high accuracy. In addition, in the explanation, in blocks with small signal level differences, all pixels are replaced with the average signal level P 0 , and in blocks with large signal level differences, the average of the group of pixels smaller than the average value is replaced.
Although P 1 is replaced by the average P 2 of a group of large pixels, it is of course possible to replace it with other signal levels. Furthermore, the number of signal levels to be replaced may be changed.

なお、本文のように、P0とP1,P2で置換した
場合に、P0で置き換えられた画素とP1で置き換
えられた画素に“0”を、P2で置き換えられた
画素に“1”を割り当てれば、フアクシミリ信号
をP0,P1,P2の階調情報とその画素がP0,P1
P2のどれで表されているかを示す“0”と“1”
の分解能情報に分けることがき、階調情報と分解
能情報に分けることができ、階調情報と分解能情
報をそれぞれ符号化することにより、効率良くフ
アクシミリ信号を伝送することも可能になる。
As shown in the main text, when P 0 is replaced with P 1 and P 2 , "0" is added to the pixel replaced by P 0 and the pixel replaced by P 1 , and "0" is added to the pixel replaced by P 2 . If "1" is assigned, the facsimile signal is converted into gradation information of P 0 , P 1 , P 2 and its pixels are P 0 , P 1 ,
“0” and “1” indicate which of P 2 is represented.
It can be divided into gradation information and resolution information, and by encoding the gradation information and resolution information respectively, it is also possible to efficiently transmit facsimile signals.

また、符号化の効率をさらに向上させるために
は、P1,P2で置き換えられるブロツクにおいて、
P1に置き換えられる画素数、またはP2に置き換
えられる画素数が、あらかじめ決められた値より
小さい場合には、そのブロツクをP0に置き換え
ることにしたり、P1,P2に置き換えられること
になつているブロツクのP0が、P0の取り得るレ
ベル範囲内できわめて大きい場合や、きわめて小
さい場合はそのブロツクをP0で置き換えること
にすればよい。
In addition, in order to further improve the encoding efficiency, in the blocks replaced by P 1 and P 2 ,
If the number of pixels replaced by P 1 or the number of pixels replaced by P 2 is smaller than a predetermined value, the block is replaced with P 0 or replaced with P 1 and P 2 . If P 0 of a corresponding block is extremely large or extremely small within the possible level range of P 0 , that block can be replaced with P 0 .

【図面の簡単な説明】[Brief explanation of drawings]

第1図はブロツク内平均信号レベルの値の差を
求めるブロツクの位置を示した図、第2図はブロ
ツク内の濃度変化の一例を模式的に示した図、第
3図はブロツク内の画素を読み出す順番の一例を
示した図、第4図は、第2図の濃度変化を第3図
の順番で処理した場合の濃度変化の回数を示した
図、第5図はブロツク内の信号レベルをP1,P2
で置き換えた場合を示した図、第6図は本発明の
一実施例を示す。 1…入力端子、2…中間調フアクシミリ信号メ
モリ、3…ブロツク内平均信号レベル算出器、4
1,42…平均信号レベル値レジスタ、43…平
均信号レベル値1ブロツクライン遅延器、51,
52…減算器、6…輪郭等判定回路、7…メモリ
アドレスコントローラ、81,82…信号レジス
タ、9…減算器、101,102…差信号レジス
タ、11…正/負変化検出器、12…カウンタセ
レクタ、131…主走査方向カウンタ、132…
副走査方向カウンタ、14…網点判定器、156
…ブロツク内最大値検出器、157…ブロツク内
最小値検出器、16…減算器、17…文字等判定
回路、18…比較器、191…P1算出回路、1
92…P2算出回路、20…画素情報メモリ、2
1…信号レベル置換回路、22…処理信号出力端
子を表す。
Figure 1 is a diagram showing the position of the block for which the difference in the average signal level within the block is calculated, Figure 2 is a diagram schematically showing an example of the density change within the block, and Figure 3 is a diagram showing the positions of the pixels within the block. FIG. 4 is a diagram showing an example of the order in which the signals are read out. FIG. 4 is a diagram showing the number of density changes when the density changes in FIG. 2 are processed in the order shown in FIG. 3. FIG. P 1 , P 2
FIG. 6 shows an embodiment of the present invention. 1... Input terminal, 2... Halftone facsimile signal memory, 3... Intra-block average signal level calculator, 4
1, 42...Average signal level value register, 43...Average signal level value 1 block line delay device, 51,
52... Subtractor, 6... Contour etc. determination circuit, 7... Memory address controller, 81, 82... Signal register, 9... Subtractor, 101, 102... Difference signal register, 11... Positive/negative change detector, 12... Counter Selector, 131...Main scanning direction counter, 132...
Sub-scanning direction counter, 14...halftone dot judge, 156
...Maximum value detector in block, 157...Minimum value detector in block, 16...Subtractor, 17...Character etc. judgment circuit, 18...Comparator, 191... P1 calculation circuit, 1
92... P2 calculation circuit, 20...pixel information memory, 2
1 represents a signal level replacement circuit, 22 represents a processed signal output terminal.

Claims (1)

【特許請求の範囲】 1 網点部分が存在する可能性のある原稿を走査
して得られる中間調フアクシミリ信号を複数画素
からなるブロツクに分割して処理する中間調フア
クシミリ信号処理方法において、 ブロツク内のあらかじめ決められた空間的に連
続する2つの画素間のいくつかのペアについて、
その2画素間の信号レベルの変化を計測し、それ
らのうち主走査方向に連続しているペア間だけの
計測量の和と、副走査方向に連続しているペア間
だけの計測量の和を算出し、それらをそれぞれあ
らかじめ決められている値と比較し、その結果で
画面上のそのブロツクのある位置が網点部分であ
るかを識別し、 網点と判定されたブロツクでは、ブロツク内の
各々の画素を隣接画素間で信号レベル差が小さく
なるようにいくつかの信号レベルで置き換えし、 網点と判定されなかつたブロツクでは、ブロツ
ク内の信号レベルを利用する処理を行う ことを特徴とする中間調フアクシミリ信号処理方
法。
[Scope of Claims] 1. In a halftone facsimile signal processing method in which a halftone facsimile signal obtained by scanning a document in which halftone dots may exist is divided into blocks each consisting of a plurality of pixels and processed, For some pairs between two predetermined spatially consecutive pixels,
The change in signal level between those two pixels is measured, and the sum of the measured amounts only between the pairs that are continuous in the main scanning direction and the sum of the measured amounts only between the pairs that are continuous in the sub-scanning direction are measured. is calculated, and compared with each predetermined value. Based on the results, it is determined whether the position of the block on the screen is a halftone dot. If the block is determined to be a halftone dot, the Each pixel in the block is replaced with a number of signal levels so that the signal level difference between adjacent pixels is small, and for blocks that are not determined to be halftone dots, processing is performed using the signal level within the block. A halftone facsimile signal processing method.
JP60079874A 1985-01-10 1985-04-15 Half tone facsimile signal processing system Granted JPS61238176A (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
JP60079874A JPS61238176A (en) 1985-04-15 1985-04-15 Half tone facsimile signal processing system
DE8686400020T DE3686821T2 (en) 1985-01-10 1986-01-07 HALFTONE IMAGE PROCESSING DEVICE.
EP86400020A EP0187724B1 (en) 1985-01-10 1986-01-07 Halftone picture processing apparatus
US06/817,046 US4722008A (en) 1985-01-10 1986-01-08 Halftone picture processing apparatus

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP60079874A JPS61238176A (en) 1985-04-15 1985-04-15 Half tone facsimile signal processing system

Publications (2)

Publication Number Publication Date
JPS61238176A JPS61238176A (en) 1986-10-23
JPH0453354B2 true JPH0453354B2 (en) 1992-08-26

Family

ID=13702368

Family Applications (1)

Application Number Title Priority Date Filing Date
JP60079874A Granted JPS61238176A (en) 1985-01-10 1985-04-15 Half tone facsimile signal processing system

Country Status (1)

Country Link
JP (1) JPS61238176A (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2875531B2 (en) * 1988-03-15 1999-03-31 キヤノン株式会社 Image processing device

Also Published As

Publication number Publication date
JPS61238176A (en) 1986-10-23

Similar Documents

Publication Publication Date Title
KR920007152B1 (en) Method and device for picture decision
US4821334A (en) Image processing apparatus
EP0187724B1 (en) Halftone picture processing apparatus
US4996603A (en) Image processing system
JP2000163594A (en) Image pattern detection method and apparatus
JPH04354470A (en) Picture processing method, scanning/printing system for executing said method and picture selector for said scanning/printing system
US7636180B2 (en) Methods and apparatus for smoothing text outlines
JPH1056569A (en) Image processing method and apparatus
US5611023A (en) Apparatus and method for processing two-tone image data so as to smooth and magnify image
JPH0666884B2 (en) Halftone photo area identification method
JP3807891B2 (en) Image information area discrimination method and apparatus
JPH0453354B2 (en)
JPS62147860A (en) Halftone facsimile signal processing system
JP3479161B2 (en) Image processing device
US5970169A (en) Method and apparatus for image enhancement
JP2001119575A (en) Image processing device
JPH10173930A (en) Image output device
JPH05153393A (en) Image processing device
JP2521744B2 (en) Image processing device
JPH04207575A (en) Image processor
JPH03113582A (en) Character background processing device
JPS6032475A (en) Image processing device
JPS61161870A (en) Identifying system of dot-photograph area
JPH0820103A (en) Halftone image output method
JPS6032474A (en) Image processing device

Legal Events

Date Code Title Description
LAPS Cancellation because of no payment of annual fees