JPH0354914B2 - - Google Patents
Info
- Publication number
- JPH0354914B2 JPH0354914B2 JP59154387A JP15438784A JPH0354914B2 JP H0354914 B2 JPH0354914 B2 JP H0354914B2 JP 59154387 A JP59154387 A JP 59154387A JP 15438784 A JP15438784 A JP 15438784A JP H0354914 B2 JPH0354914 B2 JP H0354914B2
- Authority
- JP
- Japan
- Prior art keywords
- correction amount
- ranking
- image signal
- signal level
- pixel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
- 238000004364 calculation method Methods 0.000 claims description 19
- 230000001502 supplementing effect Effects 0.000 claims 1
- 238000000034 method Methods 0.000 description 11
- 238000010586 diagram Methods 0.000 description 5
- 238000009792 diffusion process Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 230000033458 reproduction Effects 0.000 description 4
- 239000011159 matrix material Substances 0.000 description 3
- 230000003044 adaptive effect Effects 0.000 description 2
- 230000002542 deteriorative effect Effects 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Landscapes
- Facsimile Image Signal Circuits (AREA)
Description
【発明の詳細な説明】
産業上の利用分野
本発明は階調画像を２値再生する機能を備えた
画像信号処理装置に関するものである。DETAILED DESCRIPTION OF THE INVENTION Field of Industrial Application The present invention relates to an image signal processing device having a function of reproducing a gradation image in binary.
従来例の構成とその問題点
近年日常業務におけるフアクシミリ利用がます
ます拡大の一途であり、それとともに従来の白黒
２値の他の階調画像の再現に対する要望も強まり
つつある。特に２値による擬似階調再現は表示装
置や記録装置との適応が良いので強く要望されて
いる。Conventional configurations and their problems In recent years, the use of facsimile machines in daily work has been expanding more and more, and at the same time, there has been a growing demand for reproduction of gradation images other than the conventional black and white binary. In particular, pseudo gradation reproduction based on binary values is strongly desired since it is well suited for display devices and recording devices.
これらの擬似階調再現は閾値のマトリクステー
ブルに従つて画像を２値化していく各種デイザ法
が広く使われている。しかしながらこれら従来の
方法は階調再現性を良くする為にはマトリクステ
ーブルを大きくする必要があり、高分解能を得る
為にはマトリクステーブルを小さくしなければな
らないという矛盾があるため階調再現性と高分解
能の両立が困難であつた。特に、階調画像と２値
画像が混在する画像に対してはそのいずれかを犠
牲にせざるをえなくなるという欠点を有してい
た。 For these pseudo gradation reproductions, various dither methods are widely used in which an image is binarized according to a matrix table of threshold values. However, these conventional methods have a contradiction in that in order to improve tone reproducibility, it is necessary to make the matrix table large, and in order to obtain high resolution, the matrix table must be made small. It was difficult to achieve both high resolution. In particular, for images in which a gradation image and a binary image coexist, one of them has to be sacrificed.
さて、分解能と階調性の双方を両立させる方法
として、
Ａ エム．アール．シユレーダ（M.R.
Schroeder）による「平均誤差最小法」（例え
ば［イメージ フロム コンピユータズ、ア
イ・イー・イー・イー スペクトラム］
Image From Computers、IEEE Spectrum
６、1969、66−78）や、
Ｂ アール フロイド（R.Floyd and L.
Steinberg）らによる「誤差拡散法」
（例えば、［アダプテイブ アルゴリズム
フオー スペシヤル グレー スケール エ
ス・アイ・デー シンポジウム ダイジエスト
オブ ペーパーズ］An Adaptive
Algorithm for Spatial Grey Scale、SID
Sympo Digest of Papers、1975、36〜37）
がある。 Now, as a method to achieve both resolution and gradation, A.M. R. Schrader (MR
Schroeder)'s "minimum mean error method" (e.g. Image From Computers, IEEE Spectrum)
6, 1969, 66-78), R.Floyd and L.
Steinberg) et al.'s "Error Diffusion Method" (for example, [Adaptive Algorithm
Four Special Gray Scale S.I.D. Symposium Digest of Papers] An Adaptive
Algorithm for Spatial Gray Scale, SID
Sympo Digest of Papers, 1975, 36-37).
この「平均誤差最小法」は２値化誤差を出力信
号から求めるため、出力画像の画質はあまり良く
ない。 Since this "minimum average error method" calculates the binarization error from the output signal, the quality of the output image is not very good.
一方、「誤差拡散法」は誤差を最小にする基本
的な考え方は「平均誤差最小法」と同一である
が、当該誤差を補正された原画像信号と出力信号
とから求める。この「誤差拡散法」は、
ａ ある特定の濃度レベル領域において、特定の
ドツトパターン（テクスチヤ）の発生や、
ｂ 誤差フイルタ構造により独特の縞模様（うじ
虫状のドツトパターン）となり、視覚的な画質
を低下させる
などの課題があつた。 On the other hand, the "error diffusion method" has the same basic idea of minimizing the error as the "average error minimum method," but the error is determined from the corrected original image signal and the output signal. This "error diffusion method" improves the visual image quality by a) generating a specific dot pattern (texture) in a certain density level area, and b) creating a unique striped pattern (maggot-like dot pattern) due to the error filter structure. There were issues such as lowering the
これらの「平均誤差最小法」や「誤差拡散法」
に代わり、２値化再生時のモワレパターンの抑制
と高分解能特性を有する有力な技術として、特開
昭59−77772号公報に記載の２値化方法がある。
この方法は、近接する複数画素の画像信号レベル
の総和から、黒画素を、当該近接する複数画素の
原画信号レベルの大きい順序に従つて配置し直す
ことから、小さい原画信号レベルは大きな原画信
号レベルに吸収され、結果的に出力画像のドツト
構造は黒画素が寄せ集められて粒状的になり
（「黒画素の寄せ集め効果」）、視覚的に雑音性の高
い再生画像と認識される課題を有している。 These "minimum average error method" and "error diffusion method"
Instead, there is a binarization method described in Japanese Patent Application Laid-open No. 77772/1983 as a promising technique that suppresses moiré patterns during binarization reproduction and has high resolution characteristics.
In this method, black pixels are rearranged from the sum of the image signal levels of adjacent pixels in the order of increasing original image signal levels of the adjacent pixels. As a result, the dot structure of the output image becomes grainy with black pixels gathered together (the ``black pixel gathering effect''), which causes the problem that the reproduced image is visually recognized as having high noise. have.
発明の目的
本発明は、上述した従来技術の課題に鑑み、２
値化時に発生した注目画素の近傍補正を行うこと
で、黒画素の配置順位を制御して、上述した「黒
画素の寄せ集め効果」を抑制し、高分解能かつ緻
密で、滑らかな疑似階調画像を得るとともに、記
憶手段のメモリ容量の削減によりハードウエアの
軽減を図つた画像信号処理装置を提供するもので
ある。Purpose of the Invention In view of the above-mentioned problems of the prior art, the present invention has been made to:
By performing neighborhood correction of the pixel of interest that occurred during conversion, the placement order of black pixels is controlled, the above-mentioned "black pixel gathering effect" is suppressed, and high-resolution, precise, and smooth pseudo gradation is achieved. An object of the present invention is to provide an image signal processing device that can obtain images and also reduce the amount of hardware required by reducing the memory capacity of a storage means.
発明の構成
本発明は、原画像における各画素の再配分画像
信号レベルＵ＋Ｌビツトの上位Ｕビツトを記憶す
る再配分用記憶手段の所定位置における第１の走
査窓内のＭ−１個の画像信号レベルの総和を求
め、その総和の下位Ｌビツトに０を補つた値Su
と、２値化補正量Eaと、再配分補正量Slと、原
画像の画像信号レベルFoとの和
Ｓ＝Su＋Ea＋Sl＋Fo
を求め、次にその和Ｓから
Ｓ＝Ｃ×Ｎ＋Ａ
（ただし、Ｃは所定の画像信号レベル）
なる配分数Ｎと残差Ａを求める配分値演算手段
と、
原画像における各画素の画像信号レベルを記憶
する順位付用記憶手段の、前記第１の走査窓の所
定位置と対応した第２の走査窓内の画素の一部に
近傍補正量Ebを加えたＭ個の画素の画像信号レ
ベルの値により、画素順位を決定する順位決定手
段と、
前記画素順位により前記配分数Ｎの前記所定の
画像信号レベルＣと前記残差Ａと０とを上位Ｕビ
ツトと下位Ｌビツトに分け前記上位Ｕビツトを前
記再配分用記憶手段の前記所定位置における第１
の走査窓内の、再配分済画素を除くＭ−１個の画
素に割り当てるとともに、その再配分済画素には
上位Ｕビツト＋下位Ｌビツトの全ビツトを割り当
て、
一方、前記Ｍ−１個の画素に対応する画像信号
レベルの前記下位Ｌビツトの和を求め、その和を
前記第１の走査窓の前記所定位置からの移動に伴
う新たな再配分補正量Slとして前記配分値演算手
段に送出する再配分手段と、
前記割り当てた画素のうち再配分済画素の画像
信号レベルを二値化画像信号レベルに変換した後
に、その再配分済画素の画像信号レベルと前記再
配分済画素の２値化画像信号レベルとから前記２
値化補正量Eaを演算し、その演算結果を前記第
１の走査窓の上記所定位置からの移動に伴う新た
な２値化補正量Eaとして前記配分値演算手段に
供給するとともに、
前記２値化画像信号レベルを、前記第１の走査
窓の所定位置における求めるべき画素の画像信号
レベルとして出力する２値化補正手段と、
Ueビツトの上位順位付補正量ECUを記憶する補
正量記憶手段の、前記第１の走査窓の所定位置と
対応する第３の走査窓内の画素の近傍の上位順位
付補正量ECUと、Leビツトの下位順位付補正量
ECLから前記近傍補正量Ebと順位付補正量Ecaを
演算し、前記近傍補正量Ebを前記順位決定手段
に与え、さらに前記順位付補正量Ecaと前記順位
付用記憶手段の画素の一部の画像信号レベルと前
記２値化画像信号レベルとから上位順位付補正量
ECUと下位順位付補正量ECLを演算し、その演算結
果である上位順位付補正量ECUを前記第３の走査
窓の前記所定位置からの移動に伴う新たな上位順
位付補正量ECUとして前記補正量記憶手段に供給
するとともに、その演算結果である下位順位付補
正量ECLを前記第３の走査窓の前記所定位置から
の移動に伴う次の下位順位付補正量ECLとして自
己で保持している順位付補正手段と、
前記再配分用記憶手段、前記順位付用記憶手
段、及び補正量記憶手段の記憶領域全域に対して
前記第１、第２、第３の走査窓を所定画素分づつ
移動させる走査窓移動手段とを設けたものであ
る。Structure of the Invention The present invention provides an image processing system that stores M-1 image signals within a first scanning window at a predetermined position of a redistribution storage means that stores the upper U bits of redistributed image signal levels U+L bits of each pixel in an original image. The value Su obtained by calculating the sum of levels and adding 0 to the lower L bits of the sum
, the binarization correction amount Ea, the redistribution correction amount S l , and the image signal level Fo of the original image, S=Su+Ea+S l +Fo, is calculated, and then from the sum S, S=C×N+A (however, C is a predetermined image signal level); a distribution value calculation means for calculating the distribution number N and residual A; and a ranking storage means for storing the image signal level of each pixel in the original image. a ranking determining means for determining a pixel ranking based on the image signal level value of M pixels obtained by adding a neighborhood correction amount Eb to a part of the pixels in a second scanning window corresponding to a predetermined position; The predetermined image signal level C of the distribution number N and the residuals A and 0 are divided into upper U bits and lower L bits, and the upper U bits are stored at the first bit in the predetermined position of the redistribution storage means.
All bits are assigned to M-1 pixels within the scanning window excluding the redistributed pixels, and all bits of the upper U bit + lower L bit are assigned to the redistributed pixel. The sum of the lower L bits of the image signal level corresponding to the pixel is calculated, and the sum is sent to the allocation value calculation means as a new redistribution correction amount S l due to the movement of the first scanning window from the predetermined position. a redistribution means for transmitting, after converting the image signal level of the redistributed pixel among the allocated pixels into a binary image signal level, the image signal level of the redistributed pixel and the two of the redistributed pixel; 2 above from the digitized image signal level.
Calculating a digitization correction amount Ea and supplying the calculation result to the distribution value calculation means as a new binarization correction amount Ea accompanying the movement of the first scanning window from the predetermined position; binarization correction means for outputting the converted image signal level as the image signal level of the pixel to be determined at a predetermined position of the first scanning window; and correction amount storage means for storing the correction amount E CU for higher ranking of Ue bits. , the upper ranking correction amount E CU in the vicinity of the pixel in the third scanning window corresponding to the predetermined position of the first scanning window, and the lower ranking correction amount of the Le bit.
The neighborhood correction amount Eb and the ranking correction amount Eca are calculated from E CL , the neighborhood correction amount Eb is given to the ranking determining means, and the ranking correction amount Eca and some of the pixels in the ranking storage means are calculated. the upper ranking correction amount from the image signal level of and the binarized image signal level.
E CU and the lower ranking correction amount E CL are calculated, and the calculation result, the upper ranking correction amount E CU , is calculated as a new upper ranking correction amount E due to the movement of the third scanning window from the predetermined position. In addition to supplying the correction amount storage means as CU , the lower ranking correction amount E CL which is the calculation result is used as the next lower ranking correction amount E CL accompanying the movement of the third scanning window from the predetermined position. a self-held ranking correction means, and the first, second, and third scanning windows for the entire storage area of the redistribution storage means, the ranking storage means, and the correction amount storage means. A scanning window moving means for moving the image by a predetermined number of pixels is provided.
実施例の説明
第１図は本発明の一実施例における画像信号処
理装置のブロツク図を示すものであ明。本実施例
では前記発明の構成(1)、(2)、(3)におけるＭ個を４
個とし、構成(5)における近傍の順位付補正量Ecは
４個とする説明にしている。DESCRIPTION OF EMBODIMENTS FIG. 1 shows a block diagram of an image signal processing apparatus according to an embodiment of the present invention. In this embodiment, the number M in configurations (1), (2), and (3) of the invention is 4.
In the explanation, it is assumed that the neighboring ranking correction amount E c in configuration (5) is four.
説明の都合上、各画素は次のような記号を付与
している。 For convenience of explanation, each pixel is given the following symbol.
構成(1)、(3)の４個の画素はR00、R01、R10、
R11とし
構成(2)の４個の画素はO00、O01、O10、O11と
し
構成(5)の近傍の順位付補正量Ecの記憶位置は
Ec1、Ec2、Ec3、Ec4とし、新たな順位付補正量Ec
の記憶位置はEc5とする。各画素の画像空間上の
対応位置はR00とO00とEc5が同じ位置に対応する。 The four pixels in configurations (1) and (3) are R 00 , R 01 , R 10 ,
R is 11. The four pixels of configuration (2) are O 00 , O 01 , O 10 , O 11. The storage location of the ranked correction amount E c in the vicinity of configuration (5) is
E c1 , E c2 , E c3 , E c4 and new ranking correction amount E c
The storage location of is E c5 . The corresponding position of each pixel in the image space corresponds to the same position where R 00 , O 00 , and E c5 are the same.
前記各記号グループを走査窓と定義し、R00、
R01、R10、R11を走査窓Wrとし、O00、O01、O10、
O11を走査窓Wpとし、Ec1、Ec2、Ec3、Ec4、Ec5を
走査窓Weとする。第１図において各走査窓はそ
れぞれの対応する記憶手段上を原画像の主走査と
ともに右方向へ移動していくものとする。 Each symbol group is defined as a scanning window, and R 00 ,
R 01 , R 10 , R 11 are scanning windows W r , O 00 , O 01 , O 10 ,
Let O 11 be a scanning window W p , and E c1 , E c2 , E c3 , E c4 , E c5 be a scanning window W e . In FIG. 1, it is assumed that each scanning window moves to the right on its corresponding storage means as the original image is main-scanned.
第１図において、１は原画像を走査し画像信号
レベルを出力する原画像走査手段、２は後述する
再配分手段の出力信号である再配分用画像信号レ
ベルを上位Ｕビツトと下位Ｌビツトに分け前記上
位Ｕビツトを走査窓Wrの３個の画素R01、R10、
R11に入力として記憶し、走査窓Wrの３個の画素
R00、R01、R10の画像信号レベルを出力とする再
配分用記憶手段、３は再配分用記憶手段２の出力
信号である走査窓Wrの３個の画素R00、R01、R10
の画像信号レベルの和を求め、下位ＬビツトにＯ
を補つた値Suと後述する２値化補正手段の出力信
号である２値化補正量Ea原画像走査手段１の出
力信号である原画像の画像信号レベルF0と再配
分補正量Slとを入力として加算した和Ｓから配分
数Ｎと残差Ａを出力する配分値演算手段、４は走
査手段１の出力信号である原画像の画像信号レベ
ルを入力として記憶した走査窓Wpの４個の画素
O00、O01、O10、O11の画像信号レベルを出力と
する順位付用記憶手段、５は順位付用記憶手段４
の出力信号である走査窓Wpの４個の画素O00、
O01、O10、O11の画像信号レベルと後述する順位
付補正手段の出力である近傍補正量Ebを入力と
し、４個の画素の画像信号レベルの比較により画
素順位を決定しそれを出力とする順位決定手段、
６は配分値演算手段３の出力信号である配分数Ｎ
と残差Ａを順位決定手段５の出力信号である画素
順位とを入力として画素順位に応じてＮ個の数の
画像信号レベルの最大値Ｃを残差ＡとＯとの配分
を決定しその再配分用画像信号レベルを上位Ｕビ
ツトと下位Ｌビツトに分け、前記上位Ｕビツトを
前記再配分記憶手段２の走査窓Wrの３個の画素
R01、R10、R11の画像信号レベルと前記再配分画
像信号レベルの下位Ｌビツトの和を新たな再配分
補正量Slとして出力するとともに、前記再配分用
記憶手段２の走査窓WrのR00に対応した再配分済
画素の画像信号レベルは全ビツトを出力とする再
配分手段、７は再配分手段６の出力信号である再
配分済画素の画像信号レベルを入力とし固定閾値
により２値化処理し２値化画像信号レベルとして
出力とすると共に入力画像信号レベルと２値化画
像信号レベルとの差分を２値化補正量Eaとして
出力する２値化補正手段、８は順位付用記憶手段
４の出力信号である走査窓Wpの画素O00の画像信
号レベルと２値化補正手段７の出力信号である２
値化画像信号レベルと後述する補正量記憶手段の
出力信号であるＵビツトの上位順位付補正量ECU
とを入力とし後述する演算により近傍補正量Eb
と新たな上位順位付補正量ECUと下位順位付補正
量ECLとを出力とする順位付補正手段、９は既に
記憶してあるＵビツトの上位順位付補正量ECUを
出力とし順位付補正手段８の出力信号である新た
な上位順位付補正量ECUを記憶する補正量記憶手
段、１０は２値化補正手段７の出力信号である２
値化画像信号レベルを入力とし２値画像を記録ま
たは表示する画像記録・表示手段である。 In FIG. 1, reference numeral 1 indicates an original image scanning means for scanning an original image and outputting an image signal level, and 2 indicates an image signal level for redistribution, which is an output signal of a redistribution means to be described later, to upper U bits and lower L bits. Divide the upper U bits into three pixels R 01 , R 10 , and scan window W r .
Stored as input in R 11 , 3 pixels of scanning window W r
A redistribution storage means outputs the image signal levels of R 00 , R 01 , R 10 , and 3 is an output signal of the redistribution storage means 2. Three pixels R 00 , R 01 , R10
Find the sum of the image signal levels, and add O to the lower L bits.
S u , the binarization correction amount E a which is the output signal of the binarization correction means to be described later 4 is a scanning window W p which stores the image signal level of the original image, which is the output signal of the scanning means 1, as an input . 4 pixels of
Ranking storage means outputs the image signal levels of O 00 , O 01 , O 10 , O 11 5 is ranking storage means 4
The output signals of the four pixels O 00 of the scanning window W p are
The image signal levels of O 01 , O 10 , O 11 and the neighborhood correction amount E b which is the output of the ranking correction means described later are input, and the pixel ranking is determined by comparing the image signal levels of the four pixels. output ranking determining means;
6 is the allocation number N which is the output signal of the allocation value calculation means 3
and the residual A and the pixel ranking which is the output signal of the ranking determining means 5 are input, and the maximum value C of the N number of image signal levels is determined to distribute the residuals A and O according to the pixel ranking. The image signal level for redistribution is divided into upper U bits and lower L bits, and the upper U bits are divided into three pixels of the scanning window Wr of the redistribution storage means 2.
The sum of the image signal levels of R 01 , R 10 , and R 11 and the lower L bits of the redistribution image signal level is output as a new redistribution correction amount S l , and the scanning window W of the redistribution storage means 2 is output. The image signal level of the redistributed pixel corresponding to R 00 of r is determined by the redistribution means that outputs all bits, and 7 is the output signal of the redistribution means 6, which is the image signal level of the redistributed pixel, which is input, and is set to a fixed threshold. Binarization correction means 8 performs binarization processing and outputs the binarized image signal level as a binarized image signal level, and outputs the difference between the input image signal level and the binarized image signal level as a binarization correction amount E a . The image signal level of pixel O00 of the scanning window Wp , which is the output signal of the ranking storage means 4, and 2, which is the output signal of the binarization correction means 7.
The digitized image signal level and the upper-ranked correction amount E CU of U bits which is the output signal of the correction amount storage means to be described later.
As input, the neighborhood correction amount E b is calculated by the calculation described later.
and a new upper ranking correction amount E CU and a new lower ranking correction amount E CL , and 9 outputs the already stored upper ranking correction amount E CU of U bits and performs ranking. Correction amount storage means for storing a new higher ranking correction amount E CU which is the output signal of the correction means 8; 10 is the output signal 2 of the binarization correction means 7;
This is an image recording/display means that receives a digitized image signal level as input and records or displays a binary image.
第２図は本実施例の具体的な回路図で第１図で
示す画像信号処理装置のブロツク図の構成の主要
部である再配分用記憶手段２〜補正量記憶手段９
をマイクロコンピユータで実現したものである。
第２図において１１は原画像走査手段１の出力信
号である原画像の画像信号レベルを入力する入力
端子である。インプツトポート１２はゲートより
構成されており、CPU１３より信号線１４を介
して与えられる選択信号により入力端子１１から
の画像信号レベルをCPU１３へ出力する。ROM
１５にはCPU１３を制御するプログラムが書込
まれており、CPU１３はこのプログラムに従つ
てインプツトポート１２より必要とされる外部デ
ータを取込んだり、あるいはRAM１６との間で
データの授受を行なつたりしながら演算処理し、
必要に応じて処理したデータをアウトプツトポー
ト１７へ出力する。アウトプツトポート１７はラ
ツチ回路より構成されており、信号線１８を介し
てアウトプツトポート１７へ与えられるCPU１
３からの出力ポート指定信号を受けて、そのポー
トにデータを一時記憶する。１９はアウトプツト
ポート１７に一時記憶されているデータを２値化
した画像信号レベルとして画像信号記録・表示手
段１０へ出力する出力端子である。 FIG. 2 is a specific circuit diagram of this embodiment, which is the main part of the block diagram of the image signal processing device shown in FIG.
was realized using a microcomputer.
In FIG. 2, reference numeral 11 denotes an input terminal to which the image signal level of the original image, which is the output signal of the original image scanning means 1, is input. The input port 12 is composed of a gate, and outputs the image signal level from the input terminal 11 to the CPU 13 in response to a selection signal applied from the CPU 13 via a signal line 14. ROM
A program for controlling the CPU 13 is written in 15, and the CPU 13 reads necessary external data from the input port 12 or exchanges data with the RAM 16 according to this program. Process the calculations while
The processed data is output to the output port 17 as necessary. The output port 17 is composed of a latch circuit, and the CPU 1 is applied to the output port 17 via the signal line 18.
3, data is temporarily stored in that port. Reference numeral 19 denotes an output terminal for outputting the data temporarily stored in the output port 17 to the image signal recording/display means 10 as a binary image signal level.
なお、CPU１３、ROM１５、RAM１６は周
知のマイクロコンピユータにより構成することが
できる。 Note that the CPU 13, ROM 15, and RAM 16 can be configured by a well-known microcomputer.
ROM１５に書込まれているプログラムをフロ
ーチヤートで示すと第３図のようになる。以下第
３図に従つて第１図に示した画像信号処理装置の
動作を説明する。 A flowchart of the program written in the ROM 15 is shown in FIG. The operation of the image signal processing apparatus shown in FIG. 1 will be explained below with reference to FIG.
プログラムがスタートすると、まず再配分用記
憶手段２、順位付用記憶手段４、補正量記憶手段
９の内容と２値化補正手段７の２値化補正量Ea
と順位付補正手段８の順位付補正量Ecaと上位順
位付補正量ECUと下位順位付補正量ECLと再配分手
段６の再配分補正量Slを０クリヤし初期設定を行
う（ステツプ１）。次に原画像の画像信号レベル
Fpを配分値演算手段３と順位付用記憶手段４の走
査窓Wpの画素O11に読込む（ステツプ２）。次に
再配分用記憶手段２の走査窓Wr内の３個の画素
R00、R01、R10の画像信号レベルの和を求め、下
位Ｌビツトに０を補つた値Suと２値化補正量Ea
と再配分補正量Slと原画像の画像信号レベルF0と
の和Ｓ（＝Su＋Ea＋Sl＋Fp）を演算し、Ｓ＝Ｃ×
Ｎ＋Ａとなる画像信号レベルの最大値Ｃの配分数
Ｎと残差Ａを演算する（ステツプ３）。次に補正
量記憶手段９の走査窓We内の順位付補正量記憶
位置Ec1、Ec2、Ec3、Ec4の４個のUeビツトの上位
順位付補正量ECUにLeビツトの０を下位に補つた
値の平均値と下位順位付補正量ECLとを加算する
順位付補正量Ecaと係数Kaから近傍補正量Eb（＝
Ka×Eca）を演算する（ステツプ４）。次に順位
付用記憶手段４の走査窓Wpの画素O00の画像信号
レベルに近傍補正量Ebを加算した後、４個の画
素O00、O01、O10、O11の画像信号レベルをそれ
ぞれ比較し大きい順に画素順位を決定する（ステ
ツプ５）。次にステツプ５で求めた画素順位に従
つて、ステツプ３で求めたＮ個の数の画像信号レ
ベルの最大値Ｃと残差ＡとＯとを再配分用記憶手
段２の走査窓Wrの３個の画素R01、R10、R11の画
像信号レベルを上位Ｕビツトと下位Ｌビツトに分
け上位Ｕビツトを記憶し、前記走査窓Wrの画素
R00に対応した再配分済画素の画像信号レベルは
全ビツト出力するとともに、前記走査窓Wrの３
個の画素R01、R10、R11のに対応した前記再配分
画像信号レベルの下位Ｌビツトの和を新たな再配
分補正量Slとする（ステツプ６）。次に再配分用
記憶手段２の再配分済画素R00の画像信号レベル
と前記再配分済画素R00の２値化した画像信号レ
ベルとの差分を次回のステツプ３における２値化
補正量Eaとする（ステツプ７）。次にステツプ４
における順位付補正量Ecaと係数Kbを乗算した値
に走査窓Wp内の画素O00の画像信号レベルを加算
し、その値とステツプ７における２値化画像信号
レベルとの差分を新たな上位順位付補正量ECUお
よび下位順位付補正量ECLとし新たな上位順位付
補正量ECUを走査窓We内の画素Ec5に記憶する
（ステツプ８）。次にステツプ７で２値化した画像
信号レベルを画像記録・表示手段１０へ出力する
（ステツプ９）。次にすべての原画像信号レベルに
対して主走査方向および副走査方向の処理終了判
定をし（ステツプ10）、未終了であれば走査窓の
移動を行い（ステツプ11）ステツプ２より繰返
す。もし終了であれば全原画像信号に対して処理
を完了する。ただし、主走査方向の処理が終了す
る毎にステツプ11において２値化補正量Eaと順
位付補正量Ecaと上位順位付補正量ECUと下位順位
付補正量ECLと再配分補正量Slとを０クリアする。 When the program starts, first, the contents of the redistribution storage means 2, the ranking storage means 4, and the correction amount storage means 9 and the binarization correction amount E a of the binarization correction means 7
, the ranking correction amount E ca of the ranking correction means 8, the upper ranking correction amount E CU , the lower ranking correction amount E CL and the redistribution correction amount S l of the redistribution means 6 are cleared to 0 and initial settings are performed ( Step 1). Next, the image signal level of the original image
F p is read into the pixel O 11 of the scanning window W p of the distribution value calculation means 3 and the ranking storage means 4 (step 2). Next, three pixels within the scanning window Wr of the redistribution storage means 2
The sum of the image signal levels of R 00 , R 01 , and R 10 is calculated, and the lower L bits are supplemented with 0, which is the value S u and the binarization correction amount E a
The sum S (= S u + E a + S l + F p ) of the redistribution correction amount S l and the image signal level F 0 of the original image is calculated, and S = C ×
The distribution number N of the maximum value C of the image signal level that is N+A and the residual error A are calculated (step 3). Next, the L e bit is added to the upper ranked correction amount E CU of the four U e bits at the ranked correction amount storage positions E c1 , E c2 , E c3 , and E c4 within the scanning window W e of the correction amount storage means 9 . The neighborhood correction amount E b ( =
Ka × Eca ) is calculated (Step 4). Next, after adding the neighborhood correction amount E b to the image signal level of the pixel O 00 in the scanning window W p of the ranking storage means 4, the image signals of the four pixels O 00 , O 01 , O 10 , O 11 are added. The levels are compared and the pixel order is determined in descending order (step 5). Next, according to the pixel order obtained in step 5, the maximum value C of the N image signal levels obtained in step 3 and the residuals A and O are stored in the scanning window Wr of the redistribution storage means 2. The image signal levels of the three pixels R 01 , R 10 , and R 11 are divided into upper U bits and lower L bits, and the upper U bits are stored.
The image signal level of the redistributed pixel corresponding to R 00 is outputted for all bits, and the 3rd bit of the scanning window W r is
The sum of the lower L bits of the redistributed image signal levels corresponding to the pixels R 01 , R 10 , and R 11 is set as a new redistributed correction amount S 1 (step 6). Next, the difference between the image signal level of the redistributed pixel R 00 in the redistribution storage means 2 and the binarized image signal level of the redistributed pixel R 00 is calculated as the binarization correction amount E in the next step 3. a (step 7). Next step 4
The image signal level of pixel O00 within the scanning window Wp is added to the value obtained by multiplying the ranking correction amount Eca by the coefficient Kb , and the difference between that value and the binarized image signal level in step 7 is newly calculated. The new upper ranking correction amount E CU and lower ranking correction amount E CL are stored in the pixel E c5 within the scanning window W e (step 8). Next, the image signal level binarized in step 7 is output to the image recording/display means 10 (step 9). Next, the completion of processing in the main scanning direction and the sub-scanning direction is determined for all original image signal levels (step 10), and if the processing has not been completed, the scanning window is moved (step 11) and the process is repeated from step 2. If the processing is completed, the processing is completed for all original image signals. However, each time processing in the main scanning direction is completed, in step 11, the binarization correction amount E a , the ranking correction amount E ca , the upper ranking correction amount E CU , the lower ranking correction amount E CL , and the redistribution correction amount are calculated. Clear S l to 0.
なお上記説明ではマイクロコンピユータにより
再配分記憶手段２〜補正量記憶手段９を実現した
が、これらの手段はそれぞれ論理回路、外部メモ
リ等により実現することもできる。 In the above description, the redistribution storage means 2 to the correction amount storage means 9 are realized by a microcomputer, but each of these means can also be realized by a logic circuit, an external memory, etc.
また、順位補正手段８の順位付補正量Ecaを、
近傍の上位順位付補正量ECUの平均値を上位ビツ
トとし下位順位付補正量ECLを下位ビツトとして
もよい。 Furthermore, the ranking correction amount E ca of the ranking correction means 8 is
The average value of the neighboring higher ranking correction amounts E CU may be used as the upper bits, and the lower ranking correction amount E CL may be used as the lower bits.
さらに順位付補正手段８の係数Kaは１／2n（た
だしｎは正の整数）にすることにより、また係数
Kbは１−１／2m（ただしｍは正の整数）にするこ
とによりマイクロコンピユータで実現した場合に
は演算を容易にすることができ、論理回路で実現
した場合にはハードウエアを軽減することができ
る。 Furthermore, by setting the coefficient K a of the ranking correction means 8 to 1/2 n (where n is a positive integer),
By setting K b to 1-1/2 m (where m is a positive integer), calculations can be made easier when realized using a microcomputer, and hardware can be reduced when realized using a logic circuit. can do.
また、補正量記憶手段のビツト削減のための演
算を順位付補正手段に持たせることにより、再生
画像を劣化させることなく補正量記憶手段のバツ
フアメモリのビツト構成をUe＋LeビツトからUe
ビツトにすることができる。 Furthermore, by providing the ranking correction means with an operation for reducing bits in the correction amount storage means, the bit configuration of the buffer memory of the correction amount storage means can be changed from U e +L e bits to U e without deteriorating the reproduced image.
It can be made into bits.
更に、再配分用記憶手段のビツト削減のための
演算を再配分手段と配分値演算手段に持たせるこ
とにより、再生画像を劣化させることなく再配分
用記憶手段のバツフアメモリのビツト構成をＵ＋
ＬビツトからＵビツトにすることができる。 Furthermore, by providing the redistribution means and the allocation value calculation means with calculations for reducing bits in the redistribution storage means, the bit configuration of the buffer memory of the redistribution storage means can be reduced to U+ without deteriorating the reproduced image.
It is possible to change from L bits to U bits.
発明の効果
以上のように本発明は、原画像の濃度に応じて
再生画像の黒画素密度を決定するとともに、原画
像の濃度変化に応じて注目画素の近傍補正量によ
り黒画素の優先配置を制御することにより、「黒
画素の寄せ集め効果」で発生する再生画素の粒状
性を改善し、高分解能かつ緻密で、滑らかな疑似
階調画像を得ることができ、また記憶手段のメモ
リ容量の削減によりハードウエアの軽減を図るこ
とができる。Effects of the Invention As described above, the present invention determines the black pixel density of a reproduced image according to the density of the original image, and also prioritizes the placement of black pixels by the neighborhood correction amount of the pixel of interest according to the density change of the original image. By controlling this, it is possible to improve the graininess of reproduced pixels that occurs due to the "black pixel gathering effect" and obtain a high-resolution, precise, and smooth pseudo-gradation image, and also to reduce the memory capacity of the storage means. By reducing this, it is possible to reduce the amount of hardware required.
第１図は本発明の一実施例における画像信号処
理装置のブロツク図、第２図は同装置をマイクロ
コンピユータで実現した具体的な回路図、第３図
は本実施例の動作を説明するフローチヤートであ
る。
１……原画像走査手段、２……再配分用記憶手
段、３……配分値演算手段、４……順位付用記憶
手段、５……順位決定手段、６……再配分手段、
７……２値化補正手段、８……順位付補正手段、
９……補正量記憶手段、１０……画像記録・表示
手段、１１……入力端子、１２……インプツトポ
ート、１３……CPU、１４，１８……信号線、
１５……ROM、１６……RAM、１７……アウ
トプツトポート、１９……出力端子。
Fig. 1 is a block diagram of an image signal processing device according to an embodiment of the present invention, Fig. 2 is a specific circuit diagram of the same device realized by a microcomputer, and Fig. 3 is a flowchart explaining the operation of this embodiment. It's a chat. DESCRIPTION OF SYMBOLS 1... Original image scanning means, 2... Storage means for redistribution, 3... Distribution value calculation means, 4... Storage means for ranking, 5... Ranking determining means, 6... Redistribution means,
7... Binarization correction means, 8... Ranking correction means,
9... Correction amount storage means, 10... Image recording/display means, 11... Input terminal, 12... Input port, 13... CPU, 14, 18... Signal line,
15...ROM, 16...RAM, 17...output port, 19...output terminal.
Claims (1)
ルＵ＋Ｌビツトの上位Ｕビツトを記憶する再配分
用記憶手段の所定位置における第１の走査窓内の
Ｍ−１個の画像信号レベルの総和を求め、その総
和の下位Ｌビツトに０を補つた値Suと、２値化
補正量Eaと、再配分補正量Slと、原画像の画像
信号レベルFoとの和 Ｓ＝Su＋Ea＋Sl＋Fo を求め、次にその和Ｓから Ｓ＝Ｃ×Ｎ＋Ａ （ただし、Ｃは所定の画像信号レベル） なる配分数Ｎと残差Ａを求める配分値演算手段
と、 原画像における各画素の画像信号レベルを記憶
する順位付用記憶手段の、前記第１の走査窓の所
定位置と対応した第２の走査窓内の画素の一部に
近傍補正量Ebを加えたＭ個の画素の画像信号レ
ベルの値により、画素順位を決定する順位決定手
段と、 前記画素順位により前記配分数Ｎの前記所定の
画像信号レベルＣと前記残差Ａと０とを上位Ｕビ
ツトと下位Ｌビツトに分け前記上位Ｕビツトを前
記再配分用記憶手段の前記所定位置における第１
の走査窓内の、再配分済画素を除くＭ−１個の画
素に割り当てるとともに、その再配分済画素には
上位Ｕビツト＋下位Ｌビツトの全ビツトを割り当
て、 一方、前記Ｍ−１個の画素に対応する画像信号
レベルの前記下位Ｌビツトの和を求め、その和を
前記第１の走査窓の前記所定位置からの移動に伴
う新たな再配分補正量Slとして前記配分値演算手
段に送出する再配分手段と、 前記割り当てた画素のうち再配分済画素の画像
信号レベルを２値化画像信号レベルに変換した後
に、その再配分済画素の画像信号レベルと前記再
配分済画素の２値化画像信号レベルとから前記２
値化補正量Eaを演算し、その演算結果を前記第
１の走査窓の前記所定位置からの移動に伴う新た
な２値化補正量Eaとして前記配分値演算手段に
供給するとともに、 前記２値化画像信号レベルを、前記第１の走査
窓の所定位置における求めるべき画素の画像信号
レベルとして出力する２値化補正手段と、 Ueビツトの上位順位付補正量ECUを記憶する補
正量記憶手段の、前記第１の走査窓の所定位置と
対応する第３の走査窓内の画素の近傍の上位順位
内補正量ECUと、Leビツトの下位順位付補正量
ECLから前記近傍補正量Ebと順位付補正量Ecaを
演算し、前記近傍補正量Ebを前記順位決定手段
に与え、さらに前記順位付補正量Ecaと前記順位
付用記憶手段の画素の一部の画像信号レベルと前
記２値化画像信号レベルとから上位順位付補正量
ECUと下位順位付補正量ECLを演算し、その演算結
果である上位順位付補正量ECUを前記第３の走査
窓の前記所定位置からの移動に伴う新たな上位順
位付補正量ECUとして前記補正量記憶手段に供給
するとともに、その演算結果である下位順位付補
正量ECLを前記第３の走査窓の前記所定位置から
の移動に伴う次の下位順位付補正量ECLとして自
己で保持している順位付補正手段と、 前記再配分用記憶手段、前記順位付用記憶手
段、及び補正量記憶手段の記憶領域全域に対して
前記第１、第２、第３の走査窓を所定画素分づつ
移動させる走査窓移動手段と を具備した画像信号処理装置。 ２ 順位付補正手段は近傍の上位順位付補正量
ECUにLeビツトの０を下位に補つた値の平均値と
下位順位付補正量ECLとを加算し順位付補正量
Ecaとすることを特徴とする特許請求の範囲第１
項記載の画像信号処理装置。 ３ 順位付補正手段は近傍の上位順位付補正量
ECUの平均値を上位ビツトとし、下位順位付補正
量ECLを下位ビツトとしたものを順位付補正量
Ecaとすることを特徴とする特許請求の範囲第１
項記載の画像信号処理装置。 ４ 順位付補正手段は順位付補正量Ecaに、係数
１／2n（ただし、ｎは正の整数）を乗算して、近
傍補正量Ebを求めることを特徴とする特許請求
の範囲第１項、第２項、第３項いずれか記載の画
像信号処理装置。 ５ 順位付補正手段は順位付補正量Ecaに、係数
１−１／2m（ただし、ｍは正の整数）を乗算して、
順位付用記憶手段の画素の一部の画像信号レベル
を加算しさらに２値化画像信号レベルを減算し
て、新たな上位順位付補正量ECUと下位順位付補
正量ECLとを求めることを特徴とする特許請求の
範囲第１項、第２項、第３項いずれか記載の画像
信号処理装置。[Scope of Claims] 1. M-1 image signals within the first scanning window at a predetermined position of the redistribution storage means for storing the upper U bits of the redistributed image signal level U+L bits of each pixel in the original image. The sum of the sum of the levels, Su, which is obtained by adding 0 to the lower L bits of the sum, the binarization correction amount Ea, the redistribution correction amount S l , and the image signal level Fo of the original image S=Su+Ea+S l +Fo, and then from the sum S, calculate the distribution number N and residual A such that S=C×N+A (where C is a predetermined image signal level); and an image of each pixel in the original image. An image signal of M pixels obtained by adding a neighborhood correction amount Eb to some of the pixels in a second scanning window corresponding to a predetermined position of the first scanning window in a ranking storage means for storing signal levels. a ranking determining means for determining pixel ranking according to the level value; The upper U bits are stored in the first bit in the predetermined position of the redistribution storage means.
All bits are assigned to M-1 pixels within the scanning window excluding the redistributed pixels, and all bits of the upper U bit + lower L bit are assigned to the redistributed pixel. The sum of the lower L bits of the image signal level corresponding to the pixel is calculated, and the sum is sent to the allocation value calculation means as a new redistribution correction amount S l due to the movement of the first scanning window from the predetermined position. a redistribution means for transmitting, after converting the image signal level of the redistributed pixel among the allocated pixels into a binary image signal level, the image signal level of the redistributed pixel and the two of the redistributed pixel; 2 above from the digitized image signal level.
Calculating a digitization correction amount Ea and supplying the calculation result to the distribution value calculation means as a new binarization correction amount Ea accompanying the movement of the first scanning window from the predetermined position; binarization correction means for outputting the converted image signal level as the image signal level of the pixel to be determined at a predetermined position of the first scanning window; and correction amount storage means for storing the correction amount E CU for higher ranking of Ue bits. , the upper ranking correction amount E CU in the vicinity of the pixel in the third scanning window corresponding to the predetermined position of the first scanning window, and the lower ranking correction amount of the Le bit.
The neighborhood correction amount Eb and the ranking correction amount Eca are calculated from E CL , the neighborhood correction amount Eb is given to the ranking determining means, and the ranking correction amount Eca and some of the pixels in the ranking storage means are calculated. the upper ranking correction amount from the image signal level of and the binarized image signal level.
E CU and the lower ranking correction amount E CL are calculated, and the calculation result, the upper ranking correction amount E CU , is calculated as a new upper ranking correction amount E due to the movement of the third scanning window from the predetermined position. In addition to supplying the correction amount storage means as CU , the lower ranking correction amount E CL which is the calculation result is used as the next lower ranking correction amount E CL accompanying the movement of the third scanning window from the predetermined position. a self-held ranking correction means, and the first, second, and third scanning windows for the entire storage area of the redistribution storage means, the ranking storage means, and the correction amount storage means. An image signal processing device comprising: a scanning window moving means for moving the image by a predetermined number of pixels. 2 The ranking correction means uses the nearby upper ranking correction amount
The average value of the values obtained by supplementing E CU with 0 of the Le bit and the lower ranking correction amount E CL is calculated to calculate the ranking correction amount.
Claim 1 characterized in that Eca
The image signal processing device described in . 3 The ranking correction means is the nearby higher ranking correction amount
The ranking correction amount is the average value of E CU as the upper bit and the lower ranking correction amount E CL as the lower bit.
Claim 1 characterized in that Eca
The image signal processing device described in . 4. Claim 1, characterized in that the ranking correction means multiplies the ranking correction amount Eca by a coefficient 1/2 n (where n is a positive integer) to obtain the neighborhood correction amount Eb. , the image signal processing device according to any one of Items 2 and 3. 5 The ranking correction means multiplies the ranking correction amount Eca by a coefficient of 1-1/2 m (where m is a positive integer),
Adding the image signal levels of some of the pixels in the ranking storage means and further subtracting the binarized image signal level to obtain a new upper ranking correction amount E CU and lower ranking correction amount E CL An image signal processing device according to any one of claims 1, 2, and 3, characterized in that:
Priority Applications (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP15438784A JPS6132655A (en) | 1984-07-25 | 1984-07-25 | Picture signal processing device |
| US06/758,961 US4692811A (en) | 1984-07-25 | 1985-07-25 | Apparatus for processing image signal |
| EP85305304A EP0174721B1 (en) | 1984-07-25 | 1985-07-25 | Apparatus for processing image signal |
| DE8585305304T DE3583474D1 (en) | 1984-07-25 | 1985-07-25 | IMAGE SIGNAL PROCESSING DEVICE. |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP15438784A JPS6132655A (en) | 1984-07-25 | 1984-07-25 | Picture signal processing device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPS6132655A JPS6132655A (en) | 1986-02-15 |
| JPH0354914B2 true JPH0354914B2 (en) | 1991-08-21 |
Family
ID=15583019
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP15438784A Granted JPS6132655A (en) | 1984-07-25 | 1984-07-25 | Picture signal processing device |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPS6132655A (en) |
-
1984
- 1984-07-25 JP JP15438784A patent/JPS6132655A/en active Granted
Also Published As
| Publication number | Publication date |
|---|---|
| JPS6132655A (en) | 1986-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US4692811A (en) | Apparatus for processing image signal | |
| US5208684A (en) | Half-tone image processing system | |
| JPH0435105B2 (en) | ||
| EP0206401A1 (en) | Method of enlarging/reducing a dithered image | |
| JPH0354914B2 (en) | ||
| JPH04428B2 (en) | ||
| JPH04429B2 (en) | ||
| JPH0354916B2 (en) | ||
| JPH0354915B2 (en) | ||
| JPH0354917B2 (en) | ||
| JP3287717B2 (en) | Image processing device | |
| JPH0435104B2 (en) | ||
| JPH0435103B2 (en) | ||
| JPH0435102B2 (en) | ||
| JPH0462507B2 (en) | ||
| JPS6349428B2 (en) | ||
| JP2807231B2 (en) | Pixel density conversion method and device | |
| JPH042034B2 (en) | ||
| JPH0351353B2 (en) | ||
| JP2880561B2 (en) | Image processing device | |
| JPH0350960A (en) | Picture signal processing unit | |
| JP2001045287A (en) | Image processor and image processing method | |
| JPH0793684B2 (en) | Image signal processor | |
| JPH02107064A (en) | Picture signal processor | |
| JPS61103370A (en) | Picture signal processor |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EXPY | Cancellation because of completion of term |