TWI331306B - Method and system for separating an image signal into a set of image planes, machine accessible medium and method and system for dynamically thresholding an image signal - Google Patents
Method and system for separating an image signal into a set of image planes, machine accessible medium and method and system for dynamically thresholding an image signal Download PDFInfo
- Publication number
- TWI331306B TWI331306B TW93100002A TW93100002A TWI331306B TW I331306 B TWI331306 B TW I331306B TW 93100002 A TW93100002 A TW 93100002A TW 93100002 A TW93100002 A TW 93100002A TW I331306 B TWI331306 B TW I331306B
- Authority
- TW
- Taiwan
- Prior art keywords
- signal
- minimum
- maximum
- image
- module
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims description 52
- 238000000926 separation method Methods 0.000 claims description 38
- 238000012545 processing Methods 0.000 claims description 23
- 239000013598 vector Substances 0.000 description 64
- 238000005070 sampling Methods 0.000 description 36
- 230000011218 segmentation Effects 0.000 description 34
- 238000010586 diagram Methods 0.000 description 20
- 230000000875 corresponding effect Effects 0.000 description 18
- 238000007906 compression Methods 0.000 description 17
- 230000006835 compression Effects 0.000 description 17
- 230000008569 process Effects 0.000 description 17
- 230000006870 function Effects 0.000 description 14
- 238000001514 detection method Methods 0.000 description 11
- 230000000694 effects Effects 0.000 description 10
- 238000010606 normalization Methods 0.000 description 7
- 238000012886 linear function Methods 0.000 description 6
- 238000012935 Averaging Methods 0.000 description 5
- 238000001914 filtration Methods 0.000 description 5
- 238000005259 measurement Methods 0.000 description 5
- 238000009877 rendering Methods 0.000 description 4
- 238000012546 transfer Methods 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000011156 evaluation Methods 0.000 description 3
- 239000000835 fiber Substances 0.000 description 3
- 238000004519 manufacturing process Methods 0.000 description 3
- 230000004044 response Effects 0.000 description 3
- 230000000007 visual effect Effects 0.000 description 3
- VOXZDWNPVJITMN-ZBRFXRBCSA-N 17β-estradiol Chemical compound OC1=CC=C2[C@H]3CC[C@](C)([C@H](CC4)O)[C@@H]4[C@@H]3CCC2=C1 VOXZDWNPVJITMN-ZBRFXRBCSA-N 0.000 description 2
- 101100191136 Arabidopsis thaliana PCMP-A2 gene Proteins 0.000 description 2
- 101100048260 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) UBX2 gene Proteins 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000014509 gene expression Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 101100346764 Mus musculus Mtln gene Proteins 0.000 description 1
- 241000239226 Scorpiones Species 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 239000003086 colorant Substances 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 238000013144 data compression Methods 0.000 description 1
- 230000008030 elimination Effects 0.000 description 1
- 238000003379 elimination reaction Methods 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000011045 prefiltration Methods 0.000 description 1
- 230000000644 propagated effect Effects 0.000 description 1
- 210000001747 pupil Anatomy 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000010076 replication Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000008054 signal transmission Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
Landscapes
- Image Analysis (AREA)
Description
1331306 玖、發明說明:· (一) 發明所屬之技術領域 本發明有關一種文件之多重光栅內容呈現之分隔方法及 系統,且更特別地有關一種使得影像信號分離成爲一,袓影 像平面之方法及其系統。 (二) 先前技術 文件之MRC呈現是多樣性。其提供呈現彩色影像及彩色 或單色本文之功能。MRC呈現使得能使用”多重平面” (multiple "planes")用於表現文件內容之目的。MRC呈現在 市場上變得日益重要。其已建立爲主要彩色傳真標準。 在MRC呈現中,影像以多於一個影像平面來表現。文件 之MRC呈現的主要優點,在提供儲存、傳輸及製作大數位 彩色文件之有效率方式。本方法使用人類視覺系統之性質 ,其在高對比邊緣所在來區別小彩色變動之能力明顯地降 低。邊緣資料大致上和平順地變動之彩色資訊分離,而且 在其中稱爲選擇平面(selector plane)之一平面中編碼(可以 高於每一像素1個位元之析像度)。在小心分離之後,各種 平面可使用具有良好壓縮及同時地高品質之標準壓縮法 (諸如JPEG及G4)來單獨地壓縮。 所需要一種方法及系統,用於有效率地使得影像分離成 一組平面,使得MRC呈現之優點可完全地發揮。 (三) 發明內容 本發明揭示一種使得影像信號分離成爲一組影像平面之 方法及其系統。系統包含最小·最大模組、動態臨限模組及 -5- 1331306 分離模組。輯小:最大模組接收影像信號,搜索在影像信號 中現有像素上中心處的至少一個視窗內的最小値及最大値 。動態臨限模組根據自最小-最大模組所接收個別最小値及 最大値和現有像素,來計算用於視窗之個別指示値,來表 示現有像素對個別臨限平面之距離及方向,而且根據指示 値來輸出控制信號。分離模組以包括在至少影像平面中其 一之現有像素表示,而根據控制信號來使得影像信號分離 成一組影像平面。 (四)實施方式 本發明提供一種用於分離影像信號成爲一組影像平面之 方法及系統。影像信號表示數位掃描文件。影像平面適用 於數位掃描文件之混合光柵內容(MRC)呈現。 第1圖表示一般MRC呈現。呈現包含多到四個獨立平面 :前景(foreground)、背景(background)、選擇(selector)及 提示(Rendering hints)。在最一般情形中,在更高位階可能 有多重前景及選擇對。然而,在多數應用例中,呈現限制 在3或4個平面。背景平面典型地使用於儲存連續色調資 訊(continuous tone information),諸如圖像及/或平滑變動 之背景顏色。選擇平面通常保持本文之影像(二進位)以及 其他邊緣資訊(即,行項目圖繪(line art drawing))。前景平 面通常保持對應本文及/或行項目之顏色。然而,MRC呈現 僅規範平面及其關連壓縮方法。既沒有限制也沒有強化各 平面之內容。各平面之內容可以M RC呈現之實施來適當地 定義。 -6- 1331306 MRC結構也充許第四個平面,指示平面,其使用於傳送 關於文件內容之多加資訊。例如,提示平面可携帶有ICC (國際彩色協會)提示,其識別在頁上各種物件之最佳顏色 匹配方式。 前景及背景平面定義爲兩個全彩(L、a、b)平面。選擇平 面定義爲二進位(1個位元深)平面。提示平面典型地限制在 8位元平面。其一範例之MRC呈現規範前景及背景將以 JPEG來壓縮,而且選擇平面以ITU-G4來壓縮(標準第4組 傳真壓縮(standard Group 4 facsimile compression))。提示 平面視爲選擇性,但是如果使用,類似Lemp el-Zev-Welch 方法之壓縮方法可使用於其壓縮。通常,前景、背景、選 擇及提示平面等可以全部有不同析像度,而且,不需要保 持原源輸入析像度。 用於由其成分(即,平面)來組合回到”分段"MCR影像之 方法’是經由選擇平面"面罩"來傾倒前景彩色到背景平面 之上面’如此,在這些位置處重寫(overwrite)背景平面以 前的內容。另言之,組合是在前景及背景資訊間根據選擇 平面的二進位控制信號以逐一像素方式(〇n pixel by pixel b a s i s )來多工化而獲得。例如,如果選擇値是1,則使用前 景之內容:否則(即,對於選擇値=〇)使用背景之內容。多 工作業以逐一像素方式來反覆實施直到定義全部輸出像素 爲止。 文件之MR C呈現的主要優點,在提供一種有效率方法來 儲存、傳送及製作大數位彩色文件。本方法使區塊人類視 1331306 覺系統之性質/其在高對比邊緣所在來區別小彩色變動之 能力明顯地降低。邊緣資訊通常和平滑變動彩色資訊分離 ,而在選擇平面來編碼(可在高於每一源像素1個選擇抽樣 之析像度)。在謹慎分離後,各個平面可使用具有良好壓縮 及同時高品質之標準壓縮方法(諸如JPEG及G4)來獨立地 壓縮。 本發明之分段系統(segmentation system)使用於使得進 入之影像分離成適用於影像之MRC呈現的三個或以上平 面。 第2圖表示本發明分段系統之方塊圖示。分段系統200 包含最小-最大模組2 0 2、動態臨限模組2 0 4及分離模組2 0 6 。最小-最大模組202接收影像信號DSC,搜索在影像信號 中之像素上中心處一組視窗內的最小値及最大値。動態臨 限模組204根據所接收自最小·最大模組之最小値及最大値 以及現有像素,計算各視窗之個別指示値,來表示現有像 素對個別臨限値平面之距離及方向,而且根據指示値來輸 出控制信號。分離模組2 0 6根據控制信號,以包括在至少 影像平面之其一內現有像素的呈現,來分離影像信號成爲 一組影像平面。 第3圖表示分段系統200之其一實施例300的方塊圖示。 對於分段系統300之最佳性能,輸入信號DSC'必需沒有 原掃描影像之多數原中頻半色調圖型(mid frequency halftone pattern)。這些半色調頻率典型以使得輸入影像先 行通過去除據選系統(De-screen systen)來消除。然而,在 1331306 某些情形中,,諸如用於淸除P D L (頁面說明語言)列印,輸 入信號已知沒有有問題之半色調頻率。在此情形中,不需 要去除濾選作業,而且,乾淨之輸入信號可直接地進給到 分段系統內。 爲易於說明,在本文中之分段系統300的說明中,源輸 入影像DSC以及前景FG及背景BG輸出假設全部是全彩(L 、a、b)平面’而選擇平面SEL輸出是二進位(1-位元)。當 然這些假設將不詮釋爲本發明應用例之限制。 通常,前景 '背景及選擇平面相對輸入信號DSC可全部 在不同析像度。例如,前景及背景平面典型地是自原輸入 析像度來向下抽樣(down-sampled)(用於更佳壓縮),而選擇 平面典型地向上抽樣(用於更佳邊緣品質)。向上或向下抽 樣之量可在軟體控制下完全地程式規劃。 分段系統300當可選擇預估頻率半色調權重(halftone weight)HTW 及全彩超模糊(full color Super Blur)BLR_A 信號有效用時,也可接收及使用該兩信號。這些可選擇信· 號可以諸如在同時待審專利申請案中所述之去除濾選或濾 波系統來產生。可選擇全彩超模糊blr_a信號可以具有很 大濾波範圍(filtering span)(即,很低截斷頻率)之濾波器來 低通濾波影像源信號來產生。可選擇預估頻率半色調權重 HTW在下文中參考第18圖、第19圖及第20圖來詳細說 明。 分段系統3 0 0包含最小·最大模組3 1 0、動態臨限模組3 2 0 及分離模組3 3 0。 -9- 1331306 最小-最方模組3 1 0包含:相關性最小-最大方塊E 1、相 關性最小-最大子抽樣方塊E2及兩個相關性最小-最大方塊 E3、E4。最小·最大模組310接收輸入影像信號DSC(三維) ,計算及輸出兩組最大値及最小値向量(Μ X、Μ η)'(Μ X、 Μ Ν ),各組對應不同視窗。 動態臨限模組3 2 Ο接收輸入影像信號D S C及來自最小_ 最大模組310之向量(Μχ、Μη)、(Mx、MN)’而且根據自 最小-最大模組所接收個別最小値及最大値以及現有像素 來計算各視窗之個別指示値,表示現有像素相對個別臨限 平面之距離及方向,而且根據指示値來輸出控制信號GRS 到分離模組3 3 0。可選擇控制信號SEG、ENH也可輸出。 當可選擇預估頻率半色調權重HTW及全彩超模糊BLR_A 信號有效用時,動態臨限模組3 2 0也接收兩者信號。 分離模組330包含選擇邏輯方塊E6、邊緣處理方塊E7 、FG/BG分離方塊E8及FG/BG淸除方塊E9。分離模組330 接收影像信號DSC,來自最小-最大模組310之向量Mx、 Μη、控制信號GRS及來自動態臨限模組3 2 0之可選擇控制 信號SEG、ENH,而且輸出3個信號BG、FG' SEL,其分 別地對應影像DSC之MRC呈現的背景、前景及選擇平面 等。 相關性最小-最大方塊El接收輸入影像信號DSC,而且 搜索在有關現有像素上中心處之5 X 5視窗內的最小値(向量) Μη及最大値(向量)Mx。向量Μη及Mx表示在5x5像素之 視窗前後關係(window context)內的最小値及最大値。這些 -10- 1331306 向量之意義,在下文中將詳細說明。 相關性最小-最大子-抽樣方塊E2接收輸入影像信號DSC ,而且在各非重疊 8x8 視窗(non-overlapping 8x8 window) 內搜索最小及最大亮度値(luminance value),而且也在這些 位置處提供所對應色度値(chroma value)。以使用非重疊 8 X 8視窗,相關性最小·最大子·抽樣方塊E2在各方向中以 8之因數來子抽樣最小-最大値,如此,使得全部頻帶寬減 少64之因數。然後,所子抽樣之輸出進給到兩個相關性最 小-最大方塊E3及E4,其在包含有關現有像素之原(在子-抽樣前)8x8視窗上中心處的9x9視窗上,來搜索最小値及 最大値向量MN及Mx。如此,MN及MX向量對應來自非 重疊8 X 8視窗之全部最小値中的最小値及全部最大値中的 最大値。由於子-抽樣(以8)效應,所以9x9視窗實際上對 應7 2 X 7 2像素之視窗前後關係。當然大寫字母使用於向量 MN及MX來使得其等區別向量Μη及Mx(方塊E1之輸出) ,而且顯示其等表示在7 2x72像素之較大視窗前後關係中 的全部最小値及最大値。 兩組最小値及最大値向量(Mn ' Mx)及(MN、MX)進給到 動態臨限模組320。動態臨限模組320輸出單色8-位元信 號GRS,其偏差零交點表示在選擇平面中邊緣的位置。此 外,動態臨限模組也可產生可選擇二進位控制信號SEG及 可選擇8_位元分段強化控制ENH。可選擇二進位控制信號 S EG提供外部裝置(類似越權開關(override switch)),來控 制分離模組330之FG/BG分離方塊E8的分段作業(見方程 1331306 式(14)至(20))/可選擇8-位元分段強化控制ENH提供所施 加強化量到FG/BG分離方塊E8 » 選擇邏輯方塊E6接收來自動態臨限模組3 2 0之8·位元 灰度選擇信號(Gray Selector Signal)GRS’以加倍析像度來 使得其向上抽樣,然後使得其在零交點處臨限處來產生二 進位選擇平面輸出SEL。對於高品質本文及行項目複製, 選擇平面典型地保持在兩倍輸入析像度(對600dpi輸入之 1 200dpi),雖然在軟體控制下可程式規劃甚至更高比例(在 其一實施例中達到8倍輸入析像度)。 但是在不需要很高品質之應用例中,選擇平面可在和輸 入信號DSC相同之析像度。邊緣處理方塊E7接收高析像 度選擇輸出SEL,而且計算有關現有(低析像度)像素上中 心處之5x5(高析像度)視窗內的ON及OFF(導通及不導通) 像素數量。邊緣處理方塊E7輸出2-位元信號SEE。如果在 5x5視窗內側之全部輸入像素是不導通(OFF)(對應5x5定 背景區),則S EE信號設定在0。同樣地,如果在視窗內側 之全部輸入像素是導通(ON)(對應3x3定前景區),則SEE 信號設定在3。如果3x3視窗分別地多數是背景(白色)或多 數是前景(黑色),則SEE輸出設定在〗或2。 FG/BG分離方塊E8接收所要分段之全彩源信號DSC、來 自相關性最小·最大方塊E 1之全彩最小値及最大値向量Μη 、Μχ、來自邊緣處理方塊Ε7之SEE信號、可選擇分段信 號SEG及來自動態臨限模組3 2 0之強化控制信號ENH。 FG/BG分離方塊E8實施MRC分段,來產生前景及背景資 1331306 訊,而且分別地產生兩個全彩輸出TFgr及Bgr做爲前景及 * 背景平面之槪略預估値。 FG/BG淸除方塊E9在槪略前景及後景預估値Fgr及Bgr 實施多加處理過程,來產生最終前景及背景輸出FG及BG 。多加處理過程稍微延伸前景及背景値超過邊緣,而且以 適當値來塡充在前景及背景平面內未定義之像素。本處理 過程目的在防止後續抽樣及】PRG壓縮所導致人爲誤値 (artifact),而且在尙未定義像素中充塡獲致良好JPEG壓縮 比値之値。 在FG/BG淸除方塊E9內側之多加邏輯(見第14圖之拼 塊標纖(Tile Tag)方塊E7),也監測前景及背景輸出値來檢 測及旗標幾乎是全黑或全白的拼塊。與其說由此拼塊來編 碼成爲輸出檔案,不如說當檢測到此拼塊時使用及參照特 定拼塊標記。如此以消除重覆地使得通用全白或全黑拼塊 來編碼之需要,而增加全部壓縮比値》 下文中將詳細說明最小-最大模組3 1 0內所包括之方塊。 相關性最小-最大方塊EI在有關現有像素上中心處之5x5 視窗內尋找亮度分量L之最大及最小値,而且在這些位置 處輸出全彩(亮度及色度)値》所謂相關性最小·最大値是指 其僅亮度之單一分量上而不是在影像信號DSC之全部三個 分量上來搜索最小及最大値。一旦發現最小及最大亮度之 位置,則也在這些位置處來輸出色度分量(a、b)。 相關性最小-最大方塊El輸出兩個全彩(L、a、b)信號 Mn = (LMn' aMn、bMn)及 Mx = (LMx、aMx、bwx)之向量,分別 -13- 1331306 地對應在5 x 5視窗內之最小及最大値。輸出μ η及Μ x具有 和輸入信號DSC相同之像素比率。 第4圖說明相關性最小-最大方塊E1之作業。DSC亮度資 料之內容首先在有關現有像素上中心處之5x5亮度視窗內 尋找’來發現最小及最大L値之位置。如果最小或最大L 値不是唯一(即,如果有多於一個位置具有相同最小或最大 値)’則使用先發現之一個位置。本搜索過程之輸出是具有 最小及最大L値以其在5x5視窗內相對位置的唯一對(LMn 、L Μ X ) ° 然後,相關性最小-最大方塊Ε 1使用相對位置資訊來指 標在兩個對應5x5色度視窗內之對應色度(a、b)分量,而 且回復在這些位置處之色度値。如此,最大L値L μ x之相 對位置使用來定址5x5色度視窗,而且回復在本位置處之 色度對(chroma pair)(aMx、bMx)。三個値(LMx、aMx、bMx) —起形成來自相關性最小-最大方塊E 1之輸出Mx。同樣地 ’最小L値LMn之相對位置使用來定址5x5色度視窗,而 且回復在本位置處之色度對(aMx、bMx)。三個値(LMx、aMx 、bMx)形成相關性最小-最大方塊El之輸出。 相關性最小-最大方塊Ε 1之實施,可以利用正在實施之 作業順序性(sequential nature of operation)及作業型式(最 小-最大)來大幅地加速。例如,因爲作業進行到後續像素 ’所以已知先前像素之極値(即,最大値及最小値)及對應 位置。因爲現有5 x5視窗大幅地重疊先前視窗,所以追踪 先前視窗內容,相關性最小-最大方塊Ε 1必需僅分類在先 -14- 1331306 前視窗任一側上L値的最新及最舊5 χ 1行。中心3 x 5區是 先前視窗及現有視窗所共有,而且在先前視窗之先前最小 及最大値的新位址位置是在相對其等先前位置之快速掃描 方向中的偏置1處。先前最小及最大値比較在L値之最新 行中的値,而產生新最大及最小L値。 第5圖圖示相關性最小-最大子-抽樣方塊E 2。方塊E 2 接收全彩(L ' a、b)輸入信號DSC,而且產生兩個全彩子-抽樣最小及最大値輸出502及504»方塊E2在非重疊8x8 視窗上搜索最小及最大亮度値。然後,最小及最大亮度値 之位置使用來指標色度視窗,而回復在這些位置之色度値。 以使用非重疊8 X 8視窗,相關性最小-最大子·抽樣方塊 E 2在各方向中,以8之因數來有效益地子-抽樣最小及最 大輸出(其已產生而具有滑動視窗使用來替代非重疊視窗) ,因而,使得全部輸出資料比率減少64之因數。 最小輸出504對應在包含有關現有像素之8x8視窗內輸 入信號D S C的最小亮度値L M N以及在最小亮度位置處所對 應色度(a、b)値(aMIN、bMIN)所形成二個値(LmiN、aMIN' bMlN) 。同樣地,最大輸出5 0 2對應在包含有關現有像素之8 x 8 視窗內輸入信號DSC的最大亮度値LMAX及在最大亮度値 處所對應色度(a、b)値(aMAX、bMAX)所形成三個値(Lmax、 aMAx' bMAX)。如果最小或最大亮度値不是唯—(即,如果 有多於一個位置具有相同最大及最小値),則使用首先發現 之其一値。 子·抽樣作業以在高速掃描方向中使得現有像素位置向 -15- 1331306 前移動8(而且,在到達行之端時,即在慢速掃描方向中向 前8行)而保持非重疊視窗條件來獲得。 相關性最小·最大子-抽樣方塊E2之8倍(縮寫爲8χ)減小 倍數(在各維方向中),是根據前景及背景平面所期望之子-抽樣量(通常子-抽樣2之因數)來設計。對於其更高輸出影 像品質(例如’如具有PDL輸入影像之情形),其期望完全 不要子-抽樣前景及背景輸出。在此情形中,較小量子-抽 樣因數(即僅4Χ)將替代上述8χ因數來應用。如果將應用4 之子-抽樣因數(用於各方向),則使用4x4非重疊視窗。 相關性最小-最大子-抽樣方塊Ε 2連同兩個相關性最小-最大單元Ε3及Ε4來使用,而產生類似相關性最小-最大方 塊Ε1之最小-最大分析,但是涵蓋更大區前後關係(如72χ 72像素比較5x5像素),而且以更粗略析像度來減少整體頻 帶寬。 如第6圖圖示如本發明系統其一實施例中所使用相關性 最大方塊Ε 3及相關性最小方塊Ε 4之功能。 相關性最大方塊Ε3接收來自相關性最小-最大子-抽樣方 塊Ε2之全彩相關最大輸出5 02,在有關現有像素上中心處 之9x9亮度視窗中來搜索信號5 02的亮度資料內容,而發 現最大L値之位置。如果最大L値不是唯一(即,如果有多 於一個位置具有相同最大値),則使用其中第一次所發現的 —個位置。本搜索過程之輸出是在9x9視窗內最大値Lmx 以及其相對位置。 然後,相關性最大方塊E3使用LMAX之相對位置資訊, -16· 1331306 來指標在兩個對應9x9色度視窗內的對應色度(a、b)分量 ,而且回復在本位置處之色度値。如此,最大匕値LMX之 相對位置使用來定址9x9色度視窗,而且回復在本位置之 色度對(&MX、bwx)(如第6圖所不)。三個値(Lmx、aMx、bvix) 形成相關性最大方塊E3之輸出。 相關性最小方塊E4接收來自相關性最小-最大子-抽樣方 塊E2之全彩相關最小輸出5 04,在有關現有像素上中心處 9x9亮度視窗內搜索信號504之亮度信號內容,而發現最 小L値之位置。如果最小L値不是唯一(即,如果有多於一 個位置具有相同最小値),則使用其中第一次所發現的一個 位置。搜索過程之輸出是在9x9視窗內之最小値LMN及其 相對位置。 然後,相關性最小方塊E4使用LMN之相對位置資訊,來 指標在兩個對應9x9色度視窗內之對應色度(a、b)分量, 而且回復在本位置之色度値。如此,最小L値LMN之相對 位置使用來定址9x9色度視窗,而且回復在本位置之色度 對(aMN、bMN)(如第6圖所示)。三個値(Lmn、aMN、bMN)形 成相關性最小方塊E4之輸出MN。 以應用相關性最小方塊E4到相關性最小-最大子-抽樣方 塊E2之相關性最小輸出5 〇4,相關性最小作業有效地延伸 到更大區而提供相關性最小分析(MN是自方塊E2所接收 最小値中的最小値)。同樣地,相關性最大方塊有效地提供 相關最大値分析到延伸區(MX是自方塊E2所接收最大値 中之最大値)。因爲輸入502及5〇4在各方向中已以8之因 1331306 數來子-抽樣(如比較輸入影像DSC之原像素析像度),各相 關性最小値MN及最大値MX之等效視窗在原像素析像度 時是7 2 X 7 2像素。 動態臨限模組3 20施加調適性臨限値到輸入原信號DSC ,來產生單色8-位元灰度信號GRS輸出,其中零交點表示 在選擇平面之邊緣。動態臨限模組3 2 0使用來自5 X 5細微-及9x9粗略析像度視窗之兩組最小/最大値(Μη、Mx)及(MN 、MX),而且當半色調權重預估HTW及超模糊BLR —A信 號有效時,其也可接收兩者信號。動態臨限模組320產生 灰度選擇信號GRS、—進位分段信號SEG及8 -位元信號 ENH,其使用來傳送所施加在FG/BG分離方塊E8之分段 強化量。 第7圖表示前後關係區之三個有效用選擇:有關現有像 素區之單一像素區、5x5高析像度視窗W1及9x9粗略析像 度視窗W 2。記得9 X 9視窗前後關係W 2對應在各方向中以 8來子-抽樣之72x72像素視窗。在9x9粗析像度視窗W2 之各正方塊(像素)表示8 X 8原像素視窗(即在原像素析像度 之像素)中之極値。動態臨限模組3 2 0在決定灰度選擇信號 GRS之過程中’使用這三個預定前後關係區。BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method and system for separating multiple raster content presentations of a document, and more particularly to a method for separating image signals into a single image plane and Its system. (ii) The MRC presentation of prior technical documents is diversity. It provides the ability to render color images and color or monochrome text. The MRC presentation enables the use of "multiple planes" (multiple "planes") for the purpose of representing the contents of a file. MRC presentations are becoming increasingly important in the marketplace. It has been established as the primary color fax standard. In an MRC presentation, images are represented in more than one image plane. The main advantage of the MRC of the document is the efficient way to store, transfer and produce large digital files. This method uses the nature of the human visual system, which significantly reduces the ability to distinguish small color variations at the edge of high contrast. The edge data is roughly separated from the color information that changes smoothly and smoothly, and is encoded in one of the planes called the selector plane (which can be higher than the resolution of 1 bit per pixel). After careful separation, the various planes can be individually compressed using standard compression methods (such as JPEG and G4) with good compression and simultaneous high quality. What is needed is a method and system for efficiently separating images into a set of planes so that the advantages presented by the MRC can be fully utilized. (C) SUMMARY OF THE INVENTION The present invention discloses a method and system for separating image signals into a set of image planes. The system consists of a minimum and maximum module, a dynamic threshold module and a -5-1331306 split module. Small: The largest module receives the image signal and searches for the minimum and maximum 内 in at least one window at the center of the existing pixel in the image signal. The dynamic threshold module calculates the individual indications for the window according to the individual minimum and maximum 値 and the existing pixels received from the min-max module to indicate the distance and direction of the existing pixels to the individual threshold planes, and according to Indication 値 to output a control signal. The separation module includes an existing pixel representation included in at least the image plane, and separates the image signal into a set of image planes according to the control signal. (4) Embodiments The present invention provides a method and system for separating image signals into a set of image planes. The image signal represents a digital scan file. The image plane is suitable for mixed raster content (MRC) rendering of digital scanned files. Figure 1 shows a general MRC presentation. The rendering contains up to four independent planes: foreground, background, selector, and rendering hints. In the most general case, there may be multiple prospects and pairs of choices at higher levels. However, in most applications, the presentation is limited to 3 or 4 planes. The background plane is typically used to store continuous tone information, such as images and/or smooth varying background colors. The selection plane usually maintains the image (binary) and other edge information (ie, line art drawing). The foreground plane usually maintains the color of this and/or line items. However, MRC presents only the canonical plane and its associated compression method. There is no restriction or enhancement of the content of each plane. The content of each plane can be appropriately defined by the implementation of the M RC presentation. -6- 1331306 The MRC structure also allows for a fourth plane, the indicator plane, which is used to convey information about the contents of the file. For example, the cue plane can carry an ICC (International Color Association) cue that identifies the best color matching method for the various items on the page. The foreground and background planes are defined as two full-color (L, a, b) planes. The selection plane is defined as a binary (1 bit deep) plane. The cue plane is typically limited to an 8-bit plane. An example of the MRC presentation specification foreground and background will be compressed by JPEG, and the selection plane will be compressed by ITU-G4 (standard group 4 facsimile compression). The hint plane is considered selective, but if used, a compression method like the Lemp el-Zev-Welch method can be used for its compression. Usually, the foreground, background, selection, and cue planes all have different resolutions, and there is no need to maintain the original input resolution. The method used to combine back to the "segmentation" MCR image by its composition (ie, plane) is to dump the foreground color above the background plane via the selection plane "mask" so that it is heavy at these locations Overwrite the previous content of the background plane. In other words, the combination is obtained by multiplexing the foreground and background information according to the binary control signal of the selection plane by 〇n pixel by pixel basis. If the choice 値 is 1, the foreground content is used: otherwise (ie, for the selection 値=〇), the content of the background is used. The multi-worker is implemented in a pixel-by-pixel manner until all output pixels are defined. MR C presentation of the file The main advantage is to provide an efficient way to store, transfer and produce large digital color files. This method significantly reduces the ability of the block human to view the nature of the 1331306 system/the ability to distinguish small color variations at the edge of high contrast. Edge information is usually separated from smooth varying color information and encoded in the selection plane (can be higher than 1 per source pixel) Selecting the resolution of the samples. After careful separation, the individual planes can be independently compressed using standard compression methods (such as JPEG and G4) with good compression and high quality. The segmentation system of the present invention is used. The image is separated into three or more planes suitable for the MRC presentation of the image. Figure 2 shows a block diagram of the segmentation system of the present invention. The segmentation system 200 includes a minimum-maximum module 2 0, dynamic Limiting module 2 0 4 and separating module 2 0 6. The minimum-maximum module 202 receives the image signal DSC and searches for the minimum and maximum chirps in a set of windows at the center of the pixel in the image signal. The group 204 calculates individual indications of each window according to the minimum and maximum 値 and the existing pixels received from the minimum and maximum modules, and indicates the distance and direction of the existing pixels to the individual threshold planes, and outputs according to the indications. Control signal. The separation module 206 separates the image signal into a group of images according to the control signal by including the existing pixels in at least one of the image planes. Figure 3 shows a block diagram of an embodiment 300 of the segmentation system 200. For optimal performance of the segmentation system 300, the input signal DSC' must have no majority of the original intermediate frequency halftone pattern of the original scanned image ( Mid frequency halftone pattern) These halftone frequencies are typically such that the input image is first removed by De-screen systen. However, in some cases, 1331306, such as for removing PDL (page description language) Print, the input signal is known to have no problem halftone frequencies. In this case, there is no need to remove the filtering operation, and the clean input signal can be fed directly into the segmentation system. For ease of illustration, in the description of the segmentation system 300 herein, the source input image DSC and the foreground FG and background BG output hypotheses are all full color (L, a, b) planes' and the selection plane SEL output is binary ( 1-bit). Of course, these assumptions are not to be construed as limiting the application of the invention. In general, the foreground 'background and selection planes may all be at different resolutions relative to the input signal DSC. For example, the foreground and background planes are typically down-sampled (for better compression) from the original input resolution, while the selection plane is typically upsampled (for better edge quality). The amount of sampling up or down can be completely programmed under software control. The segmentation system 300 can also receive and use the two signals when the predictive frequency halftone weight HTW and the full color Super Blur BLR_A signal are available. These selectable signals can be generated, for example, by a filter removal or filtering system as described in the co-pending patent application. The full-color ultra-blurred brr_a signal can be selected to have a very large filtering span (ie, a very low cutoff frequency) filter to produce a low pass filtered image source signal. The estimated frequency halftone weight HTW can be selected in detail hereinafter with reference to Figs. 18, 19, and 20. The segmentation system 300 includes a minimum and maximum module 3 1 0, a dynamic threshold module 3 2 0 and a separation module 3 3 0. -9- 1331306 The minimum-most square module 3 1 0 contains: minimum correlation - maximum block E 1 , minimum correlation - maximum sub-sample block E2 and two correlation minimum - maximum blocks E3, E4. The minimum and maximum module 310 receives the input image signal DSC (three-dimensional), calculates and outputs two sets of maximum and minimum 値 vectors (Μ X, η η)' (Μ X, Μ Ν ), and each group corresponds to a different window. The dynamic threshold module 3 2 receives the input image signal DSC and the vector (Μχ, Μη, (Mx, MN)' from the minimum_maximum module 310 and receives the individual minimum and maximum according to the minimum-maximum module.値 and the existing pixels to calculate the individual indications of each window, indicating the distance and direction of the existing pixels relative to the individual threshold planes, and outputting the control signal GRS to the separation module 333 according to the indication 。. The control signals SEG and ENH can also be selected for output. When the predictive frequency halftone weight HTW and the full color hyperblur BLR_A signal are selected for use, the dynamic threshold module 320 also receives both signals. The separation module 330 includes a selection logic block E6, an edge processing block E7, an FG/BG separation block E8, and an FG/BG division block E9. The separation module 330 receives the image signal DSC, the vector Mx, the Μη, the control signal GRS from the minimum-maximum module 310, and the selectable control signals SEG, ENH from the dynamic threshold module 3 2 0, and outputs 3 signals BG. , FG' SEL, which respectively corresponds to the background, foreground and selection plane of the MRC of the image DSC. The minimum correlation-maximum block El receives the input image signal DSC and searches for the minimum 向量(vector) Μη and the maximum 値(vector) Mx within the 5 X 5 window at the center of the existing pixel. The vectors Μη and Mx represent the minimum and maximum 値 in the window context of 5x5 pixels. The meaning of these -10- 1331306 vectors will be explained in detail below. The correlation minimum-maximum sub-sampling block E2 receives the input image signal DSC and searches for the minimum and maximum luminance values in each non-overlapping 8x8 window, and also provides the location at these locations. Corresponds to the chroma value. To use a non-overlapping 8 X 8 window, the correlation minimum and maximum sub-sampling block E2 subsamples the minimum-maximum 以 by a factor of 8 in each direction, thus reducing the overall frequency bandwidth by a factor of 64. Then, the output of the subsample is fed to two correlation minimum-maximum blocks E3 and E4, which are searched for on the 9x9 window at the center of the 8x8 window on the original (before the sub-sampling) of the existing pixel.値 and the maximum 値 vector MN and Mx. Thus, the MN and MX vectors correspond to the smallest 値 of all the smallest 値 from the non-overlapping 8 X 8 window and the largest 全部 of all the largest 値. Due to the sub-sampling (with 8) effect, the 9x9 window actually corresponds to the window context of 7 2 X 7 2 pixels. Of course, uppercase letters are used in vectors MN and MX to distinguish them from vector Μη and Mx (output of block E1), and display all of the minimum and maximum 表示 in the larger window context of 7 2x72 pixels. The two sets of minimum and maximum 値 vectors (Mn ' Mx) and (MN, MX) are fed to the dynamic threshold module 320. The dynamic threshold module 320 outputs a monochrome 8-bit signal GRS whose deviation zero crossing indicates the position of the edge in the selection plane. In addition, the dynamic threshold module can also generate a selectable binary control signal SEG and an optional 8_bit segmentation enhancement control ENH. The binary control signal S EG can be selected to provide an external device (like an override switch) to control the segmentation of the FG/BG separation block E8 of the separation module 330 (see Equations 1331306 (14) to (20). ) / Optional 8-bit segmentation enhancement control ENH provides the applied enhancement to the FG/BG separation block E8 » Select logic block E6 receives the 8-bit grayscale selection signal from the dynamic threshold module 3 2 0 ( Gray Selector Signal) The GRS' is upsampled by doubling the resolution and then caused it to be at the zero crossing to produce a binary selection plane output SEL. For high quality text and line item replication, the selection plane typically remains at twice the input resolution (1 200 dpi for 600 dpi input), although programmable under software control even higher ratios (in one embodiment) 8 times input resolution). However, in applications where high quality is not required, the selection plane can be at the same resolution as the input signal DSC. The edge processing block E7 receives the high resolution selection output SEL and calculates the number of ON and OFF (on and off) pixels in the 5x5 (high resolution) window at the center of the existing (low resolution) pixel. The edge processing block E7 outputs a 2-bit signal SEE. If all input pixels on the inside of the 5x5 window are not (OFF) (corresponding to 5x5 fixed background area), the S EE signal is set to zero. Similarly, if all of the input pixels on the inside of the window are ON (corresponding to the 3x3 fixed foreground area), the SEE signal is set at 3. If the 3x3 window is mostly background (white) or mostly foreground (black), the SEE output is set to 〖 or 2. The FG/BG separation block E8 receives the full color source signal DSC to be segmented, the full color minimum and maximum 値 vector Μη from the correlation minimum and maximum block E1, Μχ, the SEE signal from the edge processing block Ε7, and optionally The segmentation signal SEG and the enhancement control signal ENH from the dynamic threshold module 320. The FG/BG separation block E8 implements the MRC segmentation to generate the foreground and background 1331306, and separately generates two full-color outputs TFgr and Bgr as the foreground and *background planes. FG/BG eliminates the block E9 to implement the multi-processing process in the foreground and background estimates 値Fgr and Bgr to generate the final foreground and background output FG and BG. The multi-processing process extends the foreground and background slightly beyond the edges, and the appropriate pixels are used to fill undefined pixels in the foreground and background planes. The purpose of this process is to prevent artifacts caused by subsequent sampling and PRG compression, and to achieve good JPEG compression ratio in undefined pixels. In addition to the logic inside the FG/BG division block E9 (see Tile Block E7 in Figure 14), the foreground and background output are also monitored to detect and the flag is almost black or all white. Block. Rather than coding this block into an output file, it is better to use and refer to a specific tile mark when this tile is detected. This is done to eliminate the need to repeatedly encode the universal white or all black tiles, and increase the overall compression ratio. The blocks included in the min-max module 310 will be described in detail below. Correlation Minimum - The maximum square EI looks for the maximum and minimum 亮度 of the luminance component L in the 5x5 window at the center of the existing pixel, and outputs full color (brightness and chrominance) at these positions. The so-called correlation is the smallest and the largest.値 means that it searches for the minimum and maximum 仅 on only a single component of the luminance rather than on all three components of the image signal DSC. Once the locations of the minimum and maximum brightness are found, the chrominance components (a, b) are also output at these locations. Correlation Minimum - Maximum Block El outputs two full color (L, a, b) signals Mn = (LMn' aMn, bMn) and Mx = (LMx, aMx, bwx) vectors, respectively -13-1331306 The smallest and largest 5 in the 5 x 5 window. The outputs μ η and Μ x have the same pixel ratio as the input signal DSC. Figure 4 illustrates the operation of the minimum correlation-maximum block E1. The content of the DSC brightness data is first found in the 5x5 brightness window at the center of the existing pixel to find the minimum and maximum L値 positions. If the minimum or maximum L 値 is not unique (ie, if more than one location has the same minimum or maximum 値) then use one of the locations found first. The output of this search process is the only pair with the smallest and largest L値 relative position in the 5x5 window (LMn, L Μ X ) ° Then, the correlation is the smallest - the largest block Ε 1 uses relative position information to indicator in two Corresponds to the corresponding chrominance (a, b) components in the 5x5 chrominance window, and restores the chromaticity 値 at these locations. Thus, the relative position of the largest L 値 L μ x is used to address the 5x5 chromaticity window and to restore the chroma pair (aMx, bMx) at this position. The three turns (LMx, aMx, bMx) together form the output Mx from the least correlation-maximum block E1. Similarly, the relative position of the 'minimum L値LMn' is used to address the 5x5 chrominance window and to restore the chrominance pair (aMx, bMx) at this position. The three 値 (LMx, aMx, bMx) form the minimum correlation - the output of the largest square El. The implementation of the minimum-maximum block Ε 1 can be substantially accelerated by the sequential nature of operation and the type of operation (minimum-maximum) being implemented. For example, since the job proceeds to subsequent pixels', the extremes of the previous pixels (i.e., the maximum and minimum 値) and the corresponding positions are known. Since the existing 5 x5 window greatly overlaps the previous window, the previous window content is tracked, and the correlation is minimal - the largest square Ε 1 must be classified only on the first - 14 - 1331306 front side of the front window on the front side of the L値 latest and oldest 5 χ 1 Row. The center 3 x 5 zone is common to both the previous window and the existing window, and the previous minimum and maximum new address locations in the previous window are offset 1 in the fast scan direction relative to their previous positions. The previous minimum and maximum 値 compares the 値 in the latest row of L値, resulting in new maximum and minimum L値. Figure 5 illustrates the correlation minimum-maximum sub-sampling block E2. Block E 2 receives the full color (L ' a, b) input signal DSC and produces two full color - sample minimum and maximum output 502 and 504 » block E2 to search for minimum and maximum brightness 在 on non-overlapping 8x8 windows. Then, the position of the minimum and maximum brightness 値 is used to index the chromaticity window, and the chromaticity at these positions is restored. To use a non-overlapping 8x8 window, the correlation minimum-maximum sub-sampling block E2 is beneficially sub-sampled minimum and maximum output in all directions in a direction of 8 (which has been generated with sliding window usage) Instead of non-overlapping windows), thus reducing the overall output data ratio by a factor of 64. The minimum output 504 corresponds to a minimum brightness 値LMN containing an input signal DSC in an 8x8 window with respect to an existing pixel and two 値(LmiN, aMIN) formed by the corresponding chromaticity (a, b) 値 (aMIN, bMIN) at the minimum brightness position. ' bMlN) . Similarly, the maximum output 5 0 2 corresponds to the maximum luminance 値LMAX of the input signal DSC in the 8 x 8 window containing the existing pixel and the chromaticity (a, b) 値 (aMAX, bMAX) corresponding to the maximum luminance 値. Three 値 (Lmax, aMAx' bMAX). If the minimum or maximum brightness is not unique—i.e., if more than one location has the same maximum and minimum 値, then the first one found is used. Sub-sampling operation to move the existing pixel position to -15 - 1331306 before the high-speed scanning direction (and, when reaching the end of the line, that is, 8 lines ahead in the slow scanning direction) while maintaining the non-overlapping window condition Come to get. Correlation minimum·maximum sub-sampling block E2 8 times (abbreviated as 8χ) Decrement multiple (in each dimension), is the expected sub-sample size according to the foreground and background plane (usually the factor of sub-sampling 2) To design. For its higher output image quality (e.g., if there is a PDL input image), it is expected that there is no sub-sampling foreground and background output at all. In this case, a smaller quantum-sampling factor (i.e., only 4 Χ) will be applied instead of the above 8χ factor. If the sub-sampling factor of 4 is used (for each direction), a 4x4 non-overlapping window is used. The correlation minimum-maximum sub-sampling block Ε 2 is used along with two correlation minimum-maximum units Ε3 and Ε4, resulting in a minimum-maximum analysis of the correlation-minimum-maximum block Ε1, but covering the larger-area context ( For example, 72χ72 pixels compare 5x5 pixels), and the overall frequency bandwidth is reduced by a more rough resolution. Figure 6 illustrates the function of the correlation maximum block Ε 3 and the correlation minimum block Ε 4 used in an embodiment of the system of the present invention. The correlation maximum block 接收3 receives the full color correlation maximum output 052 from the correlation minimum-maximum sub-sampling block Ε2, and searches for the luminance data content of the signal 052 in the 9x9 luminance window at the center of the existing pixel, and finds The position of the largest L値. If the maximum L値 is not unique (i.e., if there is more than one location with the same maximum 値), then the first location found in it is used. The output of this search process is the maximum 値Lmx and its relative position within the 9x9 window. Then, the correlation maximum block E3 uses the relative position information of LMAX, -16· 1331306 to index the corresponding chromaticity (a, b) components in the two corresponding 9x9 chromaticity windows, and restores the chromaticity at the position 値. Thus, the relative position of the largest 匕値LMX is used to address the 9x9 chrominance window and to restore the chrominance pair (&MX, bwx) at this location (as shown in Figure 6). The three 値 (Lmx, aMx, bvix) form the output of the largest correlation block E3. The correlation minimum block E4 receives the full color correlation minimum output 504 from the correlation minimum-maximum sub-sampling block E2, searching for the luminance signal content of the signal 504 within the 9x9 luminance window at the center of the existing pixel, and finding the minimum L値The location. If the minimum L値 is not unique (i.e., if more than one location has the same minimum 値), then one of the locations found first is used. The output of the search process is the smallest 値LMN in the 9x9 window and its relative position. Then, the correlation minimum block E4 uses the relative position information of the LMN to index the corresponding chrominance (a, b) components in the two corresponding 9x9 chromaticity windows, and returns the chromaticity 値 at the local position. Thus, the relative position of the smallest L 値 LMN is used to address the 9x9 chrominance window and to return the chrominance pair (aMN, bMN) at this location (as shown in Figure 6). The three 値 (Lmn, aMN, bMN) form the output MN of the least correlated block E4. With the application correlation minimum block E4 to the correlation minimum-maximum sub-sampling block E2, the correlation minimum output 5 〇4, the correlation minimum operation effectively extends to a larger area to provide a correlation minimum analysis (MN is from block E2) The smallest 値 of the smallest received 値). Similarly, the maximum correlation block effectively provides the relevant maximum 値 analysis to the extension (MX is the largest 値 of the largest 接收 received from block E2). Because the inputs 502 and 5〇4 have been sub-sampled by 8 factor 1331306 in each direction (such as comparing the original pixel resolution of the input image DSC), the equivalent window of each correlation minimum MN and maximum 値 MX At the original pixel resolution, it is 7 2 X 7 2 pixels. The dynamic threshold module 3 20 applies an adaptive threshold to the input original signal DSC to produce a monochrome 8-bit gray signal GRS output, where the zero crossing is indicated at the edge of the selection plane. The dynamic threshold module 320 uses two sets of minimum/maximum 値(Μη, Mx) and (MN, MX) from the 5 X 5 fine- and 9x9 coarse resolution windows, and when the halftone weight is estimated by HTW and Ultra-blurred BLR—When the A signal is active, it can also receive both signals. The dynamic threshold module 320 generates a grayscale selection signal GRS, a carry segmentation signal SEG, and an 8-bit signal ENH, which are used to transmit the segment enhancement amount applied to the FG/BG separation block E8. Figure 7 shows three effective choices for the context area: a single pixel area for the existing pixel area, a 5x5 high resolution window W1, and a 9x9 coarse resolution window W2. Remember that the 9 X 9 window context W 2 corresponds to a 72x72 pixel window with 8 samples in each direction. The positive squares (pixels) in the 9x9 coarse resolution window W2 represent the extremes of the 8 x 8 original pixel window (i.e., the pixel of the original pixel resolution). The dynamic threshold module 320 uses the three predetermined contexts during the determination of the grayscale selection signal GRS.
當在5x5視窗W1及9x9視窗W2兩者內沒有存在對比活 動時(在下文說明),使用單一像素(現有像素)區,在本情形 中’僅使得輸入信號DSC之亮度臨限,而且沒有使用色度 分量(a、b)。不然,5x5高析像度及9x9粗略析像度區之組 合使用來根據視窗之活動程度而追踪及分段輸入信號DSC -18- 1331306 。在5x5視窗內之活動表示在該視窗存在影像邊緣。在9χ9 視窗內之活動表示邊緣正接近小視窗或正離開小視窗。如 此’大9x9視窗作用爲一種預看特徵(look ahead feature) 。其也提供其中曾有邊緣之歷史。如此,允許SEE信號之 適當設定(在下文將說明)。大9x9視窗可以做爲相同目的 之其他實施例來替代。在下文中將根據視窗內活動程度來 說明追保及分段輸入信號DSC的作業。 第8圖表示動態臨限模組320之一實施例方塊圖示。本 實施例包含三個邏輯方塊810、820、830及決定模組840。 三個邏輯方塊810、820、830分別對應第7圖所示三個 可能前後關係視窗,即,單一像素區、5x5高析像度視窗 W 1及9 X 9粗略析像度視窗W 2。 多工器MUX可選擇及傳送這些輸出中之一作爲最終 GRS輸出信號。選擇可根據2-位元信號SEL以逐一像素方 式來交換。用於各輸入之實際選擇編碼圖示在第8圖之輸 入箭頭右側。 對於單一像素前後關係之情形,輸入信號DSC之亮度分 量所偏差僅使用加法器815來自其減去預定8-位元常數 THR。THR之値儲存在可程式規劃暫存器內,使得其可調 整來適應感測器校準。對涵蓋全9-位元亮度範圍之理想平 衡輸入信號DSC,THR通常設定在THR= 128,以便DSC亮 度偏差使得輸入信號GRS具有〇平均及輸入信號在半値交 叉臨限。然而,因爲人類視覺系統之對數響應,所以可見 臨限値也會斜離中心。 -19- 1331306 此外,掃描器響應在整個動態範圍來變動,或甚至不會 涵蓋全8-位元範圍。例如,峰値亮度値以最亮媒體反射率 (brightest media reflectance)來決定,而且感測器之黑色決 定在低亮度之輸出。臨限暫存器THR之値可近似地調整來 證明上述考量,而且更佳地匹配所期望GRS響應。總之, 僅使用輸入信號DSC之亮度分量用於本偏差(biasing)。 邏輯方塊82 0使用來定址第7圖所示9x9粗略析像度視 窗前後關係W2。邏輯方塊8 2 0之輸入分別是來自相關性最 大及最小方塊E3及E4之全彩粗最小値MN及最大値MX 。記得這些値是以8之因數在兩方向中來子-抽樣相關性最 小·最大方塊E1的輸出,然後,搜索在9x9視窗上之最小 値及最大値(即,最小値中之最小値及最大値中之最大値) «邏輯方塊8 20之作業相當於實施下述兩個向量X及Y之 比例點積(scaled dot product): 輸出 8 2 8 = <X,Y> ; · ( 1 ) 其中<X,Y>是兩個向量χ及γ之比例點積; <X,Y> = (XL,Xa,Xb)(YL,Ya,Yb)t = XLYL + XaYa + XbYb ; (2) 其中When there is no contrast activity in both the 5x5 window W1 and the 9x9 window W2 (described below), a single pixel (existing pixel) area is used, in this case 'only the brightness of the input signal DSC is limited and not used Chromatic components (a, b). Otherwise, a combination of 5x5 high resolution and 9x9 coarse resolution regions is used to track and segment the input signal DSC -18-1331306 based on the activity level of the window. Activity within a 5x5 window indicates that there is an image edge in the window. Activity in the 9χ9 window indicates that the edge is approaching the small window or is leaving the small window. Thus the 'large 9x9 window acts as a look ahead feature. It also provides a history in which there has been an edge. Thus, the appropriate setting of the SEE signal is allowed (described below). Large 9x9 windows can be substituted for other embodiments for the same purpose. The operation of chasing and segmenting the input signal DSC will be described below based on the degree of activity in the window. Figure 8 shows a block diagram of one embodiment of a dynamic threshold module 320. This embodiment includes three logic blocks 810, 820, 830 and a decision module 840. The three logic blocks 810, 820, and 830 respectively correspond to the three possible context windows shown in Fig. 7, that is, a single pixel area, a 5x5 high resolution window W 1 and a 9 X 9 coarse resolution window W 2 . The multiplexer MUX can select and transmit one of these outputs as the final GRS output signal. The selection can be exchanged pixel by pixel according to the 2-bit signal SEL. The actual selection code for each input is shown to the right of the input arrow in Figure 8. For the case of a single pixel context, the deviation of the luminance component of the input signal DSC is subtracted from the predetermined 8-bit constant THR using the adder 815. The THR is stored in a programmable plan register so that it can be adjusted to accommodate sensor calibration. For an ideal balanced input signal DSC covering the full 9-bit luminance range, THR is typically set at THR = 128 so that the DSC luminance deviation causes the input signal GRS to have a mean value and the input signal to cross the threshold. However, because of the logarithmic response of the human visual system, it is visible that the threshold is also skewed away from the center. -19- 1331306 In addition, the scanner response varies over the entire dynamic range, or even does not cover the full 8-bit range. For example, the peak brightness 値 is determined by the brightest media reflectance, and the black of the sensor is determined to be at a low brightness output. The threshold of the threshold register THR can be adjusted approximately to demonstrate the above considerations, and better match the desired GRS response. In summary, only the luminance component of the input signal DSC is used for this biasing. Logic block 82 0 is used to address the 9x9 coarse resolution view window context W2 shown in FIG. The input of the logic block 820 is the full color coarse minimum MN and the maximum 値 MX from the most relevant and smallest blocks E3 and E4, respectively. Remember that these 来 are in the two directions with a factor of 8 - the minimum sampling correlation - the output of the largest square E1, and then search for the minimum and maximum 値 on the 9x9 window (ie, the smallest and largest of the smallest 値) The largest 値 in the 値) «The operation of the logic block 8 20 is equivalent to the implementation of the following two vectors X and Y scaled dot product: output 8 2 8 = <X,Y>; ( 1 ) Where <X,Y> is the proportional dot product of two vectors χ and γ; <X,Y> = (XL,Xa,Xb)(YL,Ya,Yb)t = XLYL + XaYa + XbYb ; (2 ) among them
^MX ~^MN X = MX-MN= aMX~aMN ; (3)^MX ~^MN X = MX-MN= aMX~aMN ; (3)
Pmx ~bMN _ 及 (4)Pmx ~bMN _ and (4)
Y = DSC-(MX + MN)/2= a~(aMX + aMN)/2 .b~(bMx )/2 . 在方程式(4)中之(L、a、b)値是對應輸入信號DSC之彩 -20- 1331306 色分量。在方程式(3)中之X向量是最大値MX及最小値 MN間之向量差。在方程式(4)中之γ向量是輸入信號dSc 減去最小値MN及最大値MX之平均値,平均値是在mn 及MX間之3D中點(midpoint)。取這兩個向量之比例點積 ’輸出和離平面之相對距離成比例,其垂直於X向量及在 半途相交。因爲搜索後之資訊是零交叉之位置,所以不需 要點積之精確大小。因此,結果以2 5 6 (向右移位8 )之位意 因數來相除,而比例回到適合8 -位元範圍。 然而,因爲邏輯方塊820輸出(到多工器848)有時仍可溢 過8 -位元範圍(以約3或1 . 5位元之因數),所以如果其大 於255,則可使用多加邏輯方塊來限制邏輯方塊820在255。 在粗略析像度9 X 9視窗內全部對比大小X 9之標量測量 (scalar measure),是以在加總方塊829內之向量X的三個 分量絕對値相加來產生: X9 = Lx+ | ax | + | bx | =Lmx-L MN+ I ^ΜΧ-δΜΝ I + I bMX-bMN | : (5) 參照方程式(5),不需要取亮度分量L之絕對値,因爲L 限定在正値範圍[〇·.255]»用於邏輯方塊820之方程式(Π 至(5)的實施是順向(straight forward)。參照第8圖之邏輯 方塊820,第一之兩個加法器821、823以一個分量一個分 量方式來實施3x1輸入信號MX' MN之向量和及差。處理 加總之加法器82 1也將結果除以2(將其向右位移1個位虞) 來獲得符號□ /2所示之平均値。加法器82 3輸出向量差X (在方程式(3)中所定義)到方塊8 2 9。方塊8 2 9計算向量X 之三個分量的絕對値總和,而且產生對比大小X9。加法器 -21- 1331306 825以實施輸入信號DSC及來自加法器821之輸出兩者間 的向量差,來計算方程式(4)中之向量Y。然後,X及γ向 量分量以逐一像素方式相乘-相加在一起,來形成在點積方 塊827中之點積。方塊827之輸出828以方程式(1)及(2) 來說明。 第16圖是方程式(1)至(4)之圖表說明。在第16圖中,三 維空間之原點(origin)假設在左手側上,如所示。向量MX ' MN分別表示三維點MX及MN。現有影像像素以向量DSC 來表示。如圖示說明,向量X = (MX-MN)及向量Y是根據方 程式(3)及(4)之向量運算來產生。値ch表示取X及Y之點 積的結果。値是Y投影在X上。値也顯示向量Y對平面 Pi所表示點之距離及"方向"。平面?!在X之中點處正交向 量X = MX-MN。以向量Y所表示點之方向,意即點是否在 平面P!之上或之下。平面P!表示臨限平面。指示値(^表 示在臨限之後,現有影像像素DSC是否在臨限平面之上或 之下,即’是否更接近MX或MN,而且是多近。指示値 d !允許關於現有像素分段所做決定。例如,如果臨限像素 很接近MX (分別地MN),則可決定現有像素包括在前景平 面(分別地背景平面)內。如果臨限像素太接近臨限平面, 則可決定現有像素包括在前景及背景平面兩者內^ 參照第8圖,邏輯方塊830使用來定址第7圖所示5x5 高析像度視窗前後關係W1。邏輯方塊830之輸入是來自相 關性最小-最大模組E 1之全彩最小及最大値μ η、Μ X。邏 輯方塊8 3 0之運算來形成比例點積和上述邏輯方塊820相 -22- 1331306 同。 邏輯方塊830之運算等同於實施下述兩個向量之比例點 積: (6) ⑺ 輸出 8 3 8 = <Χ·, Y) 其中<Χ、Υ·>是在兩個向量X·及Υ'間之比例點積 <X', Y^-CXL'.Xa'.Xb'KYL.Ya'.Yb'^XL'YL'+Xa'Ya'+Xb'Yb'; 其中 X ' = Μ X - Μ η;Y = DSC-(MX + MN)/2= a~(aMX + aMN)/2 .b~(bMx )/2 . (L, a, b) in equation (4) is the corresponding input signal DSC Color -20- 1331306 color component. The X vector in equation (3) is the vector difference between the maximum 値 MX and the minimum 値 MN. The gamma vector in equation (4) is the average 値 of the input signal dSc minus the minimum 値MN and the maximum 値MX, and the average 値 is the 3D midpoint between mn and MX. The proportional dot product of these two vectors is output proportional to the relative distance from the plane, which is perpendicular to the X vector and intersects halfway. Since the information after the search is a zero-crossing position, the exact size of the product is not required. Therefore, the result is divided by the bit factor of 2 5 6 (shifted to the right by 8), and the ratio returns to the 8-bit range. However, because the logic block 820 output (to the multiplexer 848) can sometimes overflow the 8-bit range (a factor of about 3 or 1.5 bits), if it is greater than 255, then multiple logic can be used. The block is to limit the logic block 820 to 255. The scalar measure of the total contrast size X 9 in the coarse resolution 9 X 9 window is generated by adding the absolute components of the vector X of the vector X in the summation block 829: X9 = Lx+ | ax | + | bx | =Lmx-L MN+ I ^ΜΧ-δΜΝ I + I bMX-bMN | : (5) With reference to equation (5), it is not necessary to take the absolute 値 of the luminance component L because L is limited to the positive range [ 〇·.255]»The equation for the logic block 820 (the implementation of Π to (5) is straight forward. Referring to the logic block 820 of Figure 8, the first two adders 821, 823 are one The component is implemented in a component mode to implement the vector sum and difference of the 3x1 input signal MX' MN. The processing adder 82 1 also divides the result by 2 (shifts it to the right by 1 bit 来) to obtain the symbol □ /2 The average 値. The adder 82 3 outputs a vector difference X (defined in equation (3)) to a block 8 2 9. The block 8 2 9 calculates the absolute 値 sum of the three components of the vector X and produces a contrast size X9. Adder-21-1331306 825 calculates the vector difference between the input signal DSC and the output from the adder 821. The vector Y in equation (4). Then, the X and γ vector components are multiplied one by one by pixel - add together to form the dot product in dot product block 827. The output 828 of block 827 is given by equation (1) And (2) to illustrate. Figure 16 is a graphical illustration of equations (1) to (4). In Figure 16, the origin of the three-dimensional space is assumed to be on the left-hand side, as shown. Vector MX ' MN denotes three-dimensional points MX and MN, respectively. The existing image pixels are represented by a vector DSC. As illustrated, the vector X = (MX-MN) and the vector Y are generated according to the vector operations of equations (3) and (4).値ch represents the result of taking the dot product of X and Y. 値 is the Y projection on X. 値 also shows the distance of the vector Y to the point represented by the plane Pi and the "direction". plane?! at the point in X Orthogonal vector X = MX-MN. The direction of the point represented by the vector Y, meaning whether the point is above or below the plane P!. The plane P! represents the threshold plane. The indication 値 (^ indicates after the threshold, Whether the existing image pixel DSC is above or below the threshold plane, ie 'whether it is closer to MX or MN, and how close. Indicates 値d ! Allow The decision is made on the existing pixel segment. For example, if the threshold pixel is very close to MX (MN, respectively), then it can be determined that the existing pixel is included in the foreground plane (respectively the background plane). If the threshold pixel is too close to the threshold plane Then, it can be determined that the existing pixels are included in both the foreground and the background plane. Referring to FIG. 8, the logic block 830 is used to address the 5x5 high resolution window context W1 shown in FIG. The input to logic block 830 is the minimum and maximum 値μ η, Μ X from the correlation minimum-maximum module E1. The operation of the logic block 830 to form a proportional dot product is the same as the above logic block 820 phase -22- 1331306. The operation of logic block 830 is equivalent to implementing a proportional dot product of the following two vectors: (6) (7) Output 8 3 8 = <Χ·, Y) where <Χ,Υ·> is in two vectors X· And the ratio of dot to 'X', Y^-CXL'.Xa'.Xb'KYL.Ya'.Yb'^XL'YL'+Xa'Ya'+Xb'Yb'; where X ' = Μ X - Μ η;
Lmx — LMn °Mx ~ aMn Pmx - (8)Lmx — LMn °Mx ~ aMn Pmx - (8)
及 ~ + ^Mn ) / 2] / 2 (9) Y' = DSC-[BLR_A + (Mx + Mn)/2]/2= a — \aA +(aMx +awn)/2]/2 b-[bA +(bMl +bMn)/2]/2 在方程式(9)中之(L、a、b)値是輸入信號DSC之對應彩 色分量。在方程式(8)中之向量X’是最大向量Mx及最小向 量Μη間的向量差。在方程式(9)中之向量Y’,是輸入信號 DSC減去最小Μη及最大Mx値之平均値,平均値是在Μη 及Mx間之3 D中點處。以取這兩個向量之比例點積,輸出 和離垂直於^向量及在其半途交叉之平面的相對距離成比 例。因爲搜索後資訊是零交叉之位置,所以不需要點積之 精確大小。因此,結果除以2 5 6之位意因數來比例回到適 用8位元範圍。 然而’因爲邏輯方塊830輸出偶爾仍然溢過8-位元範圍 (約3或1.5位元之因數),如果其大於255,則多加邏輯方 塊可使用來限制邏輯方塊830輸出在255。 •23· 1331306 用於在細微析像度5 x5視窗W 1 (第7圖)內整個對比大小 X 5之標量測量,是以加總方塊8 3 0內向量X'之三個分量的 絕對値加在一起所產生: X5=Lx'+ | ax' | + | bx' I =Lmx-Lmn+ | aMX-aMN I + I bMx-bMN | ; (10) 參照方程式(10),不需要取亮度分量L之絕對値,因爲L 限制在正値範圍[0..25 5]。用於邏輯方塊8 3 0之方程式(6) 至(1〇)的實施是順向地。參照第8圖之邏輯方塊830,第一 之兩個加法器83]、833以一個分量一個分量方式來實施 3x1輸入信號Μχ、Μη之向量和及差。處理加總之加法器 _ 83 1也以2除以結果(使得其向右位移1個位置),來獲得如 符號□ /2所示之平均値。加法器8 3 3輸出向量差Χ'(在方程 式(8)中所定義)到方塊839。方塊839計算向量X'之三個分 量的絕對値和,而產生對比大小Χ5。加法器8 3 5以實施輸 入信號DSC及加法器834之輸出兩者間的向量差,來計算 方程式(9)之向量Y'。然後,X’及Y·向量分量1以一個元素一 個元素地相乘及相加在一起,而形成點積方塊837之點積 。方塊837之輸出以方程式(6)及(7)來說明。 隹 重要在注意邏輯方塊830之架構不同於邏輯方塊820, 在於具有相加臨限偏差特徵(added threshold bias feature) ,其當超模糊參考信號BLR_A有效用時,使得臨限値推到 BLR_A( = La、aA、bA)來強化黑或亮細線。這以平均超模糊 信號BLR_A及平均之Μχ及Μη値來獲得而形成替代性Y1 向量,如方程式(9)所示。 第17圖是方程式(6)至(9)之圖表圖示。在第17圖中,三 -24- !3313〇6 維空間之原點假設在左手側上,如圖示。向量Mx、Μη分 別地表示三維點Μχ及Μη。現有影像像素以向量DSC來表 示。超模糊參考信號BLR_A以向量BLR_A來表示。如圖 不,如量Χ’ = (Μχ-Μη)及向量Y’是根據方程式(8)及(9)自向 量運算來獲得。値6表示取X,及γ·之點積的結果。値也 表示以向量Y,對平面P2所表示點之距離及"方向,,。平面 P2在離中點一小量之點處來正交向量χ_Μχ_ΜΝ。本量表示 前述段落中討論添加臨限偏差特徵。以向量γ,所示點之,, 方向’意即本點是在平面P2之上或之下。平面p2表示臨 限平面。指示値表示在臨限之後現有影像像素D S C是否在 臨限平面之上或之下,即,是否其更接近MX或MN,而且 是多少量。指示値h允許關於現有像素之分段所要做的決 定。例如,如果臨限像素很接近MX(分別地Μη),則可決 定現有像素包括在前景平面(分別地,背景平面)。如果臨 限像素太接近臨限平面,則可決定現有像素包括在前景及 後景平面兩者內》 參照第8圖’決定模組84〇接收來自邏輯方塊810之輸 出818、來自邏輯方塊820之輸出828及對比大小輸出Χ9 、及來自輸出方塊830之輸出838及對比大小輸出Χ5。 決定模組840包含比較器邏輯方塊846、多工器84 8、強 化編碼方塊850及比較器852。決定模組840也包括兩個 參數片段線性函數方塊842及844,其當自除去濾選系統 之半色調權重信號HTW有效用時,來處理半色調權重信號 HTW。 -25- 1331306 比較器邏輯8 4 6接收對比大小輸出X5及X9,輸出選擇 信號SEL來控制多工器84 8之輸出GRS,而且輸出致能信 號ΕΝΑ來控制強化邏輯8 5 0之強化信號ENH。當來自去除 濾選系統之HTW有效用,在預估HTW已通過參數化片段 線性函數方塊842之後,比較器邏輯8 4 6也可使用8-位元 半色調權重頻率預估HTW。 當然以前述最小·最大運算之定義,較大9x9 (子-抽樣)視 窗W2之對比大小必需等於或大於較小5x5高析像度視窗 W 1之對比大小。換言之: X5 (11) 這是由於包括較小視窗之較大視窗之事實,所以比較更 小視窗,則最大値只可更大而最小値更小。更進一步,由 於分段過程自一個像素至另一像素來處理(在快速掃描方 向中),所以X 5對比値保持8個連續像素相同,直到次一 像素交叉8x8視窗邊界進入次一非交疊視窗。另一方面, Xs對比値可以一個像素一個像素之方式來改變。這種行爲 是因爲以相關性最小-最大子-抽樣方塊E2來實施8x子-抽 樣。 第9圖表示比較器邏輯846實施例之方塊圖示。兩個對 比大小量測値X5及X9分別地經由比較器904、902來比 較信號STH,而分別產生選擇位元SEL0、SEL]。位元SEL0 及SEL1形成2 -位元選擇信號SELECT。如果半色調權重 HTW有效用’STH通過分段線性函數方塊842來產生STH 。否則,STH設定在預定値。然後,兩個位元SEL0及 -26- l33!3〇6 SEl1以反及閘(NAND gate)906來組合在一起來產1-位元 強化致能信號ΕΝΑ。 第1 0圖表示比較器邏輯之等效真値表。如果較大9x9 (子-抽樣)視窗W 2之對比量測値X 9小於S Τ Η,則不管較小 5x5視窗W1之對比量測値,SEL1位元淸除而SELEC信號 是〇或1。如此造成多工器8 4 8來選擇單一像素前後關係 輸出818(第8圖)。然而,如果在較大9x9視窗W2內有一 些活動,但不在較小5x5視窗W1之內,則SELEC信號設 定等於2(二進位"10")。如此造成多工器848選擇在邏輯方 塊820之輸出82 8。如果兩個視窗顯示相當大對比之大小 ,則SELEC信號設定在3,導致邏輯方塊830之輸出838 (對應5 X 5高析像度視窗)以多工器8 4 8來選擇。此外,當 SELEC信號是3時,二進位致能信號ΕΝΑ導通(turn on)。 信號ΕΝ A使用來使得強.化方塊8 5 0致能,而輸出分段.強化 信號ENH。 參照第8圖,強化編碼方塊8 5 0也使用線性函數之半色 調權重頻率預估HTW來產生ENH信號,其控制所要施加 在FG/BG分離方塊E8之分段強化量(第3圖)。HTW信號 進給到參數化片段線性函數方塊’8 4 4,其應用片段線性函 數EEN到信號HTW,而且輸出所獲得信號到強化編碼方塊 850。來自比較器邏輯方塊846之二進位強化致能信號ΕΝΑ 使用來選通(gating)(即,致能)強化信號ENH如下。如果 ΕΝΑ=1 ’貝!J方塊8 44輸出信號通過到輸出ΕΝΗ ;否則,全 部ΕΝΗ位元強制爲零(去能)。8-位元ΕΝΗ輸出信號傳送所 -27- 1331306 要施加在FG/BG分離方塊E8之分段強化量。 參照第8圖,比較器8W比較可選擇半色調權重HTW及 預定臨限THRSEG,而產生可選擇二進位信號SEG。可選擇 二進位信號提供一種裝置來控制FG/BG分離方塊E8之分 段功能。當HTW大於THRSEG時,二進位信號SEG導通。 當SEG導通時,在FG/BG分離方塊E8之分段根據方程式 (1 4)、(1 5)、(1 6)、(1 7)來實施。當 HTW 小於或等於 THRseg 時,二進位信號SEG不導通。當SEG不導通時,在FG/BG 分離方塊E8之分段根據方程式(18)、(19)、(20)來實施。 8-位元THRSEG之値可經由暫存器來可程式規劃。 參照第3圖,選擇邏輯方塊E6轉換8-位元灰度選擇輸 入GRS成爲二進位選擇平面輸出SEL,其對輸入影像信號 DSC可具有不同析像度。對高品質之本文及行項目(line art) ,二進位選擇輸出典型地保持比較背景及前景平面更高之 析像度。例如,實施例300使用二倍析像度,使得對標準 6 0 0dpi掃描器,二進位SEL信號之輸出析像度通常設定在 120 0dpi。選擇邏輯方塊E6插置灰度選擇輸入信號GRS到 更高析像度,而且臨限所獲得插置信號來產生形成選擇平 面之二進位輸出SEL。 第Π圖表示選擇邏輯方塊E6之方塊圖示。選擇邏輯方 塊E6包含插置器1102及比較器1104。插置器1102使用 二維雙線性插置法,來使得8-位元灰度選擇輸入信號GRS 插置在灰度定義域內。插置因數可在軟體控制下來程式規 劃。在第11圖(及第3圖)所示實施例1101中,插置因數 -28- 1331306 設定在2x之系統初始設定(default setting)。來自插置器 1 102之信號進給到比較器Π04’其使得其相對値TSL·來臨 限,而且輸出所獲得二進位輸出做爲選擇信號s E L。臨限 TSL之値儲存在可程式規劃之暫存器內’使得其可自文件 之一個頁面來改變到另一頁面。對跨越全8 -位元亮度範圍 之理想灰度選擇信號GRS ’値通常設定在中點TSL = 0,來 臨限中途通過之輸入信號。然而,如上所述,對在方塊8 1 0 之信號THR(第8圖),實際TSL値可設定不同,使得補償 掃描器感測器之實際動態範圍及/或人類視覺系統之性質。 _ 注意現有2x插置因數,二進位SEL輸出資料速率在各方 向中快如2倍影像信號DSC。意即,對每一8-位元輸入GRS 樣本,選擇邏輯方塊E6產生四個二進位輸出SEL樣本。 重要在注意向量符號使用於輸出SEL,來表示更高輸出 析像度。當輸出SEL仍視爲二進位(即,假設僅是〇或1 之値)時’各進入GRS輸入在輸出時,產生四個選擇位元 (假設正常2X插置因數)。輸出資料速率是一半輸入速率, 因爲一個8-位元値轉換成4個1-位元値。 · 參照第3圖,邊緣處理方塊E7接收高析像度選擇輸出, 而且計算在有關現有像素上中心處5 x 5高析像度視窗內之 致能及去能像素的數量。邊緣處理方塊E7輸出2 -位元信 號S E E。如果在視窗內側之全部輸入像素爲〇 (對應定3 x 3 原輸入析像度背景區),則S EE信號設定在〇。同樣地,如 果在視窗內側之全部輸入像素是1 (對應定3 χ 3原輸入信號 前景區)’則SEE信號設定在3。此外,如果3x3視窗之內 -29- 1331306 容分別地多數背景(白色)或多數前景(黑色),則SEE信號 設定在1或2。 第1 2圖說明邊緣處理方塊E7之功能。方塊E7之作業如 下所述。邊緣處理方塊接收二進位選擇信號SEL做爲輸入 ,其相對源輸入信號(source input signaI)DSC具有更高析 像度(通常2x)。邊緣處理方塊E7保持3x3像素前後關係視 窗W3在源輸入析像度時中心在有關現有像素處。因爲選 擇信號是2倍原析像度,所以在3 x3像素視窗W 3之元素 保持如第1 2圖所示四個高析像度二進位S EL樣本。較粗線 表示原DSC析像度,其對應在高析像度定義域內之6x6-像素前後關係視窗β然而,僅使用5 X 5高析像度像素區W 4 之點內容(以虛線所示);在W 3及W 4間之區不包含在邊緣 處理。 5x5析像度前後關係W4設計,來檢測近接有關現有像素 之潛在邊緣。視窗圖型W4使用2高析像度像素之全前後 關係,其延伸在現有像素之下及在其右邊,但是僅一個高 析像度像素延伸到其上或到其左右邊。視窗圖型防止任何 邊緣重疊鄰近像素,即,沒有關連多數較低析像度之潛在 邊緣位置能檢測多於一次以上。第〗2圖表示在有關現有視 窗內4x4可能邊緣位置。 邊緣處理方塊Ε7計數現有在5><5高析像區W4內所導通 之高析像度像素之數量。本數量範圍可在〇至25。其映像 到邊緣處理方塊之輸出2-位元信號See如下所述: l.SEE = 0,如果5x5計數是〇(沒有發現前景像素); -30- 1331306 2.SEE=1,如果計數是在包含(多數背景像素)之範圍[1..12]; 3. SEE = 2,如果計數是在包含(多數前景像素)之範圍[13.24]; 4.SEE = 3,如果計數是25(僅發現前景像素); 2-位元輸出信號SEE傳送到FG/BG分離方塊E8。注意 信號是在原輸入析像度(典型地600dpi),雖然選擇信號是 在2倍原輸入析像度之更高析像度(例如,1 200dpi)。 FG/BG分離方塊E8使得輸入影像信號DSC分離成爲前 景及背景平面。方塊使用來自相關性最小-最大方塊E 1之 全彩最小値及最大値(Μη、Mx)輸出及來自邊緣處理方塊E7 之2-位元選擇邊緣計數信號SEE。此外,FG/BG分離方塊 也可經由自動態臨限模組3 20所接收之分段強化控制信號 ENH來強化邊緣之升高(lifting) »如上所述,在FG/BG分 離方塊E8之分段過程是可以選擇二進位信號SEG來控制。 FG/ΒΘ分離方塊E8分別地輸出前景及背景輸出之兩個全 彩粗略初始預估Fgr及Bgr。後續模組,FG/BG方塊E9, 進一步處理預估Fgr及Bgr來產生最終前景及背景輸出。 FG/BG分離方塊E8接收所要分段之全彩原信號DSC,而 產生Fgr及Bgr輸出中之其一或有時兩者之値。FG/BG分 離方塊E8保留零亮度及色度(L = a = b = 0)之特別編碼,來表 示在前景預估Fgr或後景預估Bgr內之空(未定義)像素。 因爲處理過程繼續在整個頁面,所以一些前景及背景像素 將保持未定義。然後,FG/BG淸除方塊小心地充塡用於這 些未定義像素之値來保持低壓縮,而避免可能後續子·抽樣 及JPEG壓縮之人爲誤値(artifacts)。 -31- 1331306 第13圖說明FG/BG分離方塊E8所使用決定範圍’來分 離影像信號成爲背景及前景平面》FG/BG分離方塊使用來 自邊緣處理方塊E7之二進位選擇邊緣計數信號SEE的値 ,來決定是否使用背景或前景或兩者。如果SEE 2 1 ’則使 用前景;而如果S EE各2,則使用背景。因爲這兩個情形沒 有相互互斥,所以當1SSEES2時,同時使用前景及背景 兩者。 下述兩個全彩量(目的將在下文說明)定義如下: FGD = LIM[DSC + (Mn-DSC)(ENH/2 5 5 )] ; (12) 籲 BGD = LIM[DSC + (Mx-DSC)(ENH/25 5)]; (13) 其中DSC是全彩輸入信號,Μη及Mx是來自相關性最小-最大方塊E 1之相關性最小及最大輸出,而ENH是來自動 態臨限模組3 2 0之8-位元分段強化信號。極限函數LIM使 用來限制用於各分量之8-位元範圍[1 ..25 5 ]的結果’因而排 除所保留用於標識未決定像素之零的特別編碼。注意因爲 DSC及Μη或Mx是全彩(L、a、b)向量,所以運算是在3D 空間。 _ 對於在分段期間來使用前景之情形中,即,當SEE= { 1 、2、3}及SEG=1時,·輸出Fgr値決定爲:And ~ + ^Mn ) / 2] / 2 (9) Y' = DSC-[BLR_A + (Mx + Mn)/2]/2= a — \aA +(aMx +awn)/2]/2 b- [bA + (bMl + bMn) / 2] / 2 In the equation (9), (L, a, b) 値 is the corresponding color component of the input signal DSC. The vector X' in equation (8) is the vector difference between the maximum vector Mx and the minimum vector Μη. The vector Y' in equation (9) is the average 値 of the input signal DSC minus the minimum Μη and the maximum Mx値, and the average 値 is at the 3 D midpoint between Μη and Mx. Taking the proportional product of the two vectors, the output is proportional to the relative distance perpendicular to the ^ vector and the plane crossing halfway. Since the post-search information is a zero-crossing position, the exact size of the dot product is not required. Therefore, the result is divided by the value factor of 2 5 6 to the applicable 8-bit range. However, because the logic block 830 output occasionally overflows the 8-bit range (a factor of about 3 or 1.5 bits), if it is greater than 255, the multi-plus logic block can be used to limit the logic block 830 output to 255. •23· 1331306 The scalar measurement for the entire contrast size X 5 in the fine resolution 5 x5 window W 1 (Fig. 7) is the absolute 値 of the three components of the vector X' in the total square 8 3 0 Add together: X5=Lx'+ | ax' | + | bx' I =Lmx-Lmn+ | aMX-aMN I + I bMx-bMN | ; (10) Refer to equation (10), no need to take the luminance component The absolute value of L is because L is limited to the positive range [0..25 5]. The implementation of equations (6) through (1〇) for logic block 830 is forward. Referring to logic block 830 of Fig. 8, the first two adders 83], 833 implement the vector sum and difference of the 3x1 input signals Μχ, Μη in one component by one component. The processing adder _ 83 1 also divides the result by 2 (so that it is shifted to the right by 1 position) to obtain an average 値 as indicated by the symbol □ /2. The adder 8 3 3 outputs a vector difference Χ ' (defined in equation (8)) to block 839. Block 839 calculates the absolute sum of the three components of vector X' to produce a contrast size of Χ5. The adder 803 calculates the vector Y' of equation (9) by performing a vector difference between the input signal DSC and the output of the adder 834. Then, X' and Y·vector components 1 are multiplied and added together by one element to form a dot product of the dot product block 837. The output of block 837 is illustrated by equations (6) and (7). It is important to note that the logic block 830 architecture differs from the logic block 820 in that it has an added threshold bias feature that pushes the threshold to BLR_A when the hyper-fuzzy reference signal BLR_A is active. La, aA, bA) to strengthen black or bright thin lines. This is obtained by averaging the super-fuzzy signal BLR_A and the mean Μ and Μη値 to form an alternative Y1 vector, as shown in equation (9). Figure 17 is a graphical representation of equations (6) through (9). In Fig. 17, the origin of the three-24-!3313〇6-dimensional space is assumed to be on the left-hand side as shown. The vectors Mx and Μη represent the three-dimensional point Μ and Μη, respectively. Existing image pixels are represented by a vector DSC. The super-fuzzy reference signal BLR_A is represented by a vector BLR_A. As shown in the figure, the quantity Χ' = (Μχ-Μη) and the vector Y' are obtained from the vector operation according to equations (8) and (9).値6 indicates the result of taking the dot product of X and γ·.値 also represents the vector Y, the distance to the point represented by the plane P2 and the "direction,. The plane P2 is orthogonal to the vector χ_Μχ_ΜΝ at a small point from the midpoint. This quantity represents the addition of the threshold deviation feature discussed in the previous paragraph. With the vector γ, the point shown, the direction ' means that the point is above or below the plane P2. Plane p2 represents a finite plane. The indication 値 indicates whether the existing image pixel D S C is above or below the threshold plane after the threshold, i.e., whether it is closer to MX or MN, and how much. Indicates that 値h allows decisions about the segmentation of existing pixels. For example, if the threshold pixel is very close to MX (spectively Μη), then it can be determined that the existing pixel is included in the foreground plane (respectively, the background plane). If the threshold pixel is too close to the threshold plane, then the existing pixel can be determined to be included in both the foreground and background planes. Referring to Figure 8, the decision module 84 receives the output 818 from the logic block 810 from the logic block 820. Output 828 and contrast size output Χ9, and output 838 from output block 830 and contrast size output Χ5. Decision block 840 includes comparator logic block 846, multiplexer 84 8 , enhanced code block 850, and comparator 852. Decision block 840 also includes two parametric segment linear function blocks 842 and 844 that process the halftone weight signal HTW when the halftone weight signal HTW is removed from the filter system. -25- 1331306 Comparator logic 8 4 6 receives the contrast size outputs X5 and X9, outputs the selection signal SEL to control the output GRS of the multiplexer 84 8 , and outputs the enable signal ΕΝΑ to control the enhancement signal EN 5 of the enhancement logic EN 5 . When the HTW from the removal filter system is active, after the estimated HTW has passed the parameterized segment linear function block 842, the comparator logic 8.4 can also use the 8-bit halftone weight frequency to estimate the HTW. Of course, with the definition of the aforementioned minimum and maximum operations, the contrast size of the larger 9x9 (sub-sampling) view window W2 must be equal to or greater than the contrast size of the smaller 5x5 high resolution window W1. In other words: X5 (11) This is due to the fact that larger windows are included in smaller windows, so the smaller ones can be larger, smaller and smaller. Furthermore, since the segmentation process is processed from one pixel to another (in the fast scan direction), the X 5 contrast is kept the same for 8 consecutive pixels until the next pixel intersects the 8x8 window boundary into the next non-overlapping Windows. On the other hand, the Xs contrast can be changed by one pixel by one pixel. This behavior is due to the implementation of 8x sub-sampling with the correlation minimum-maximum sub-sampling block E2. Figure 9 shows a block diagram of an embodiment of comparator logic 846. The two comparison magnitude measurements 値X5 and X9 compare the signals STH via comparators 904, 902, respectively, to generate select bits SEL0, SEL], respectively. Bits SEL0 and SEL1 form a 2-bit select signal SELECT. If the halftone weight HTW is effectively 'STH, the piecewise linear function block 842 is used to generate the STH. Otherwise, the STH is set at the predetermined time. Then, two bits SEL0 and -26-l33!3〇6 SEl1 are combined by a NAND gate 906 to produce a 1-bit enhancement enable signal ΕΝΑ. Figure 10 shows the equivalent truth table of the comparator logic. If the contrast measurement 値X 9 of the larger 9x9 (sub-sampling) window W 2 is less than S Τ Η, the SEL1 bit is removed and the SELEC signal is 〇 or 1 regardless of the contrast measurement of the smaller 5x5 window W1. This causes the multiplexer 8 4 8 to select a single pixel context output 818 (Fig. 8). However, if there is some activity in the larger 9x9 window W2, but not within the smaller 5x5 window W1, the SELEC signal setting is equal to 2 (binary "10"). The multiplexer 848 is thus caused to select the output 82 8 of the logic block 820. If the two windows display a fairly large contrast size, the SELEC signal is set at 3, resulting in the output 838 of the logic block 830 (corresponding to the 5 X 5 high resolution window) being selected by the multiplexer 804. In addition, when the SELEC signal is 3, the binary enable signal is turned on. The signal ΕΝ A is used to enable the strong block 805 to be enabled, and the output segment is to strengthen the signal ENH. Referring to Fig. 8, the enhancement coding block 850 also uses the half-tone weighted frequency prediction HTW of the linear function to generate an ENH signal which controls the amount of segmentation enhancement to be applied to the FG/BG separation block E8 (Fig. 3). The HTW signal is fed to the parameterized segment linear function block '8 4 4, which applies the segment linear function EEN to the signal HTW, and outputs the obtained signal to the enhanced coding block 850. The binary carry enhancement signal 来自 from comparator logic block 846 is used to gating (i.e., enable) the boost signal ENH as follows. If ΕΝΑ=1 ‘Bei! J block 8 44 outputs the signal to the output ΕΝΗ; otherwise, all the bits are forced to zero (de-energize). 8-bit ΕΝΗ output signal transmission -27- 1331306 The amount of segmentation enhancement to be applied to the FG/BG separation block E8. Referring to Fig. 8, comparator 8W compares the selectable halftone weight HTW and the predetermined threshold THRSEG to produce a selectable binary signal SEG. The binary signal can be selected to provide a means to control the segmentation function of the FG/BG separation block E8. When the HTW is greater than THRSEG, the binary signal SEG is turned on. When the SEG is turned on, the segmentation of the FG/BG separation block E8 is performed according to equations (1 4), (1 5), (1 6), (17). When the HTW is less than or equal to THRseg, the binary signal SEG is not turned on. When the SEG is not conducting, the segmentation of the FG/BG separation block E8 is performed according to equations (18), (19), (20). The 8-bit THRSEG can be programmed via the scratchpad. Referring to Fig. 3, selection logic block E6 converts the 8-bit grayscale selection input GRS into a binary selection plane output SEL which may have different resolutions for the input image signal DSC. For high quality text and line art, the binary selection output typically maintains a higher resolution than the background and foreground plane. For example, embodiment 300 uses a double resolution such that for a standard 60 dpi scanner, the output resolution of the binary SEL signal is typically set at 120 0 dpi. The logic block E6 is selected to interpolate the grayscale selection input signal GRS to a higher resolution, and the interpolated signal is obtained to produce a binary output SEL forming a selection plane. The figure shows the block diagram of the selection logic block E6. The selection logic block E6 includes an interleaver 1102 and a comparator 1104. The interpolator 1102 uses a two-dimensional bilinear interpolation method to interpolate the 8-bit gray scale selection input signal GRS within the gray scale domain. The interpolation factor can be programmed under software control. In the embodiment 1101 shown in Fig. 11 (and Fig. 3), the interpolation factor -28 - 1331306 is set at a system default setting of 2x. The signal from the interposer 1 102 is fed to the comparator Π04' such that it is opposite to the 値TSL·, and the resulting binary output is output as the selection signal s E L . The Threshold TSL is stored in a programmable scratchpad so that it can be changed from one page of the file to another. The ideal gradation selection signal GRS' 跨越 across the full 8-bit luminance range is typically set at the midpoint TSL = 0 to pass the input signal midway through. However, as noted above, for the signal THR (Fig. 8) at block 810, the actual TSL can be set differently to compensate for the actual dynamic range of the scanner sensor and/or the nature of the human visual system. _ Note that the existing 2x interpolation factor, the binary SEL output data rate is as fast as 2x image signal DSC in all directions. That is, for each 8-bit input GRS sample, the selection logic block E6 produces four binary output SEL samples. It is important to note that the vector symbol is used in the output SEL to indicate a higher output resolution. When the output SEL is still considered a binary (ie, assuming only 〇 or 1), each of the incoming GRS inputs is output, producing four select bits (assuming a normal 2X insertion factor). The output data rate is half the input rate because an 8-bit 値 is converted to four 1-bit 値. • Referring to Figure 3, edge processing block E7 receives the high resolution selection output and calculates the number of enabled and deactivated pixels in the 5 x 5 high resolution window at the center of the existing pixel. The edge processing block E7 outputs a 2-bit signal S E E . If all input pixels on the inside of the window are 〇 (corresponding to the 3 x 3 original input resolution background area), the S EE signal is set to 〇. Similarly, if all input pixels on the inside of the window are 1 (corresponding to the 3 χ 3 original input signal foreground area), the SEE signal is set at 3. In addition, if the -29- 1331306 within the 3x3 window has a majority of background (white) or most foreground (black), the SEE signal is set at 1 or 2. Figure 12 illustrates the function of edge processing block E7. The operation of block E7 is as follows. The edge processing block receives the binary selection signal SEL as an input having a higher resolution (typically 2x) relative to the source input signal (DSC). Edge processing block E7 maintains a 3x3 pixel context window W3 centered at the relevant pixel at the source input resolution. Since the selection signal is 2 times the original resolution, the elements of the 3 x 3 pixel window W 3 maintain the four high resolution binary S EL samples as shown in Fig. 12. The thicker line indicates the original DSC resolution, which corresponds to the 6x6-pixel context window β in the high resolution domain. However, only the point content of the 5 X 5 high resolution pixel area W 4 is used (in dotted lines) Show); the area between W 3 and W 4 is not included in the edge processing. The 5x5 resolution context W4 design detects near potential edges of existing pixels. The window pattern W4 uses the full context of the 2 high resolution pixels, which extend below and to the right of the existing pixels, but only one high resolution pixel extends onto it or to its left and right sides. The window pattern prevents any edges from overlapping adjacent pixels, i.e., the potential edge positions that are not associated with most of the lower resolutions can be detected more than once. Figure 2 shows a possible 4x4 edge position within the existing window. The edge processing block Ε7 counts the number of high resolution pixels that are currently turned on in the 5<5 high resolution area W4. This number can range from 〇 to 25. The output of the image-to-edge processing block 2-bit signal See is as follows: l.SEE = 0, if the 5x5 count is 〇 (no foreground pixels are found); -30- 1331306 2. SEE=1, if the count is Contains (most background pixels) the range [1..12]; 3. SEE = 2, if the count is in the range of inclusion (most foreground pixels) [13.24]; 4.SEE = 3, if the count is 25 (only found The foreground pixel); the 2-bit output signal SEE is transmitted to the FG/BG separation block E8. Note that the signal is at the original input resolution (typically 600dpi), although the selection signal is at a higher resolution of 2 times the original input resolution (for example, 1 200dpi). The FG/BG separation block E8 separates the input image signal DSC into a foreground and background plane. The block selects the edge count signal SEE using the full-color minimum and maximum 値 (Μη, Mx) outputs from the correlation minimum-maximum block E1 and the 2-bit from edge processing block E7. In addition, the FG/BG split block can also enhance edge lifting via the segmentation enhancement control signal ENH received from the dynamic threshold module 3 20 » as described above, in the FG/BG split block E8 The segment process can be controlled by selecting the binary signal SEG. The FG/ΒΘ separation block E8 outputs two full-color rough initial estimates Fgr and Bgr of the foreground and background outputs, respectively. The subsequent module, FG/BG block E9, further processes the estimated Fgr and Bgr to produce the final foreground and background output. The FG/BG split block E8 receives the full color original signal DSC to be segmented, and produces one or both of the Fgr and Bgr outputs. The FG/BG separation block E8 retains a special code of zero luminance and chrominance (L = a = b = 0) to represent an empty (undefined) pixel within the foreground estimate Fgr or the foreground estimate Bgr. Because the processing continues on the entire page, some foreground and background pixels will remain undefined. The FG/BG erasure block is then carefully charged for these undefined pixels to maintain low compression while avoiding artifacts that may be subsequent subsampling and JPEG compression. -31- 1331306 Figure 13 illustrates the decision range 'to separate the image signal into the background and foreground plane' used by the FG/BG separation block E8. The FG/BG separation block uses the binary selection edge count signal SEE from the edge processing block E7. To decide whether to use the background or foreground or both. If SEE 2 1 ' is used, the foreground is used; if S EE is 2, the background is used. Because these two situations are not mutually exclusive, when 1SSEES2, both foreground and background are used. The following two full-color quantities (the purpose of which will be explained below) are defined as follows: FGD = LIM[DSC + (Mn-DSC)(ENH/2 5 5 )] ; (12) Call BGD = LIM[DSC + (Mx- DSC)(ENH/25 5)]; (13) where DSC is a full color input signal, Μη and Mx are the least correlation and minimum output from the correlation minimum-maximum block E1, and ENH is from the dynamic threshold mode Group 3 2 0-bit segmentation enhancement signal. The limit function LIM is used to limit the result for the 8-bit range [1 ..25 5 ] for each component' thus excludes the special code reserved for identifying the zero of the undetermined pixel. Note that because DSC and Μη or Mx are full-color (L, a, b) vectors, the operation is in 3D space. _ For the case where the foreground is used during the segmentation, that is, when SEE = { 1 , 2, 3} and SEG = 1, the output Fgr is determined as:
Fgr = FGD,如果 SEG = 1 及 SEE = {1,2,3} ; (14)Fgr = FGD if SEG = 1 and SEE = {1, 2, 3}; (14)
Fgr = 0 ·如果 SEG=1 及 SEE = 0 ; (15) 當控制信號SEG導通(SEG=1)時’而沒有使用前景(即’ 當SEE = 0)時,前景像素値按照方程式(15)以設定其値在特 別編碼Fgr = 0(用於全部三個分量)來標識爲未定義。注意, -32- 1331306 在其一實施例中,ENH延伸到9_位元呈現,而且其値以1 來增量而允許以2 5 6來替代2 5 5之規格化,因而,以簡單 向左移位8個位置來替代不必要之除算(divisi〇n)0 如在方程式(14)及(12)所示,視以8-位元信號ENH所示 分段強化量而定’前景預估Fgr値插置在現有輸入信號値 D S C及相關性最小-最大方塊e 1之最小値Μ η兩者間。當 ΕΝΗ = 0時,則不實施強化,而且輸出將設定在輸入信號 Fgr = DSC。如上所述’這是—種普通情形,除非在5χ5細 微析像度視窗W 1及9x9粗略析像度視窗W2兩者內有足夠 _ 對比活動。等效地,當ΕΝΗ = 25 5 (對應最大強化)時,輸出 將設定在最小値信號Fgr = Mn。這通常表示像素緊鄰邊緣之 情形’其中較佳地以儘可能地如鄰接像素之最小値(0 =黑色) 所產生而使得前景塗抹更黑來強化邊緣。通常,分段強化 之量ΕΝ Η可在上述兩個極値間來變動,而且輸出前景値將 對應地權重在D S C及Μ η値兩者之間。 同樣地,對在分段期間使用背景之情形,即,當SEG= 1 及SEE{0,1,2}時,輸出Bgr値以下述方程式來決定: 鲁Fgr = 0 · If SEG=1 and SEE = 0; (15) When the control signal SEG is on (SEG=1) 'without foreground (ie 'When SEE = 0), the foreground pixel is according to equation (15) It is identified as undefined by setting its special code Fgr = 0 (for all three components). Note that -32- 1331306 In one embodiment, the ENH extends to the 9_bit representation, and the 値 is incremented by 1 to allow the 251 to be normalized by 256, thus, with a simple Shift 8 positions to replace the unnecessary division (divisi〇n)0. As shown in equations (14) and (12), depending on the amount of segmentation enhancement indicated by the 8-bit signal ENH, the foreground is expected. The estimated Fgr is interposed between the existing input signal 値DSC and the minimum -η of the correlation minimum-maximum block e1. When ΕΝΗ = 0, no enhancement is performed and the output is set to the input signal Fgr = DSC. As described above, this is a common case unless there is enough _ contrast activity in both the 5χ5 fine resolution windows W 1 and the 9x9 coarse resolution window W2. Equivalently, when ΕΝΗ = 25 5 (corresponding to maximum enhancement), the output will be set to the minimum chirp signal Fgr = Mn. This typically represents the case where the pixel is in close proximity to the edge' where it is preferably made as far as possible as the smallest pupil of the adjacent pixel (0 = black) to make the foreground blacker to strengthen the edge. In general, the amount of segmentation enhancement 变动 can vary between the two poles, and the output foreground 値 will be correspondingly weighted between D S C and Μ η 。. Similarly, for the case where the background is used during segmentation, that is, when SEG = 1 and SEE {0, 1, 2}, the output Bgr is determined by the following equation:
Bgr = BGD,如果 SEG = 1 及 SEE={0,1,2} ; (16)Bgr = BGD if SEG = 1 and SEE={0,1,2} ; (16)
Bgr = 0-如果 SEE = 3; (17) 輸出Bgr値將在和分段強化量ENH成比例之輸入DSC 及Mx値間來變動,如方程式(13)所產生。方程式(16)類似 方程式(14),除了使用最大値Mx替代最小値Μη以外(見方 程式(12)及(13))及SEE之不同範圍。使用Μχ用於Bgr輸 出將使得其變成視覺上更亮而不是更暗,如同前使用Mn 1331306 用於前景預估Fgr之情形。 而且,如方程式(1 7 )及所對應(1 5)所示’當沒有使用背景 時,背景値以設定其値在特定編碼Bgr = 0(用於全部二個分 量(L、a、b))來標識做爲未定義。 在可選擇分段控制不導通(即’ SEG = 0)之情形中’背景任 意地設定爲特定編碼,而不管輸入像素値:Bgr = 0 - if SEE = 3; (17) The output Bgr 値 will vary between the input DSC and Mx 成 proportional to the segmentation enhancement ENH, as generated by equation (13). Equation (16) is similar to equation (14) except that the maximum 値Mx is used instead of the minimum 値Μη (see equations (12) and (13)) and the different ranges of SEE. Using Μχ for Bgr output will make it visually brighter rather than darker, as was the case with Mn 1331306 used for foreground estimation of Fgr. Moreover, as shown in equation (17) and corresponding (15), 'when no background is used, the background is set to 値 at a specific code Bgr = 0 (for all two components (L, a, b) ) to identify as undefined. In the case where the segmentation control is not conductive (i.e., 'SEG = 0), the background is arbitrarily set to a specific code regardless of the input pixel:
Bgr = 0,如果 SEG = 0; (18) 而且前景設定在下列其中之一:Bgr = 0 if SEG = 0; (18) and the foreground is set to one of the following:
Fgr = BGD > 如果 SEG = 0 及 SEE={0,1} (19)Fgr = BGD > If SEG = 0 and SEE={0,1} (19)
Fgr = FGD > 如果 SEG = 0 及 SEE={2,3} (20) 視SEE之値而定,方程式(18)、(19)、(20)表示背景總是 設定在特別未定義標識Bgr = 〇,而且前景取方程式(12)或 (1 3)之權重前景或後景像素的値。如果SEE={0,〗},則使用 背景,否則使用前景。 重要在注意本情形之SEE的範圍,其中可選擇分段控制 不導通,其不同於方程式(14)至(17)所使用。在此,如果多 數像素是前景{SEE={0,1 }},則前景値僅設定在FGD,或如 果多數是背景{SEE={2,3}}則在BGD。 自FG/BG分離方塊E8之輸出是兩個局部充塡全彩平面 Fgr及Bgr。在離開選擇平面SEL之邊緣,視其爲亮或暗而 定’典型地僅有前景及後景輸出之一包含現有像素顏色(可 強化)。然而’接近邊緣之資訊可同時地以前景及後景通道 來携帶。 FG/BG方塊E9在粗略前景及背景預估Fgr及Bgr實施多 -34- 1331306 加處理過程’而產生最終前景及背景輸出FG及BG〇FG/BG 淸除方塊E9所實施處理過程稍微延伸超過邊緣之前景及 背景値’而且也在前景及後景平面內來充塡未定義像素。 本處理過程之目的在防止會由於後續子-抽樣及資料壓縮 (諸如JPEG)所導致人工誤値,而且充塡未定義像素來獲得 良好壓縮比例。 在FG/BG淸除方塊E9內側之邏輯也監測前景及後景輸 出値,來檢測及旗標定全黑或全白拼塊。與其編碼自此拼 塊之輸出成爲輸出資料流,不如使用及參考特定拼塊標識 所需要次數。這將消除需要來反覆地編碼通用全白或白黑 拼塊,而增加整個壓縮比。 第1 4圖表示FG/BG淸除方塊E9之實施例方塊圖示。實 施例包含兩個擴大方塊F 1、F 2、兩個平均方塊F 3 ' F 4、兩 個充塡/子-抽樣方塊F5 ' F6及拼塊旗標方塊F7。 膨脹方塊(Dilate block)Fl及F2使得前景及背景之預定 內容擴充2個像素。實施2個像素之擴充在預期後續2χ子 -抽樣;其他擴充大小可使用於不同子-抽樣因數。目的在 增加前景及後景重疊在邊緣上,使得結果對進一步子-抽樣 不敏感。 第15圖說明膨脹方塊F1及F2之膨脹作業的效用。區 ]5〇4表示預定像素。區1502表示未預定像素。在膨脹作 業之後,預定像素之區擴充到也涵蓋區1506,而且未定義 像素之區縮減到區1508。 膨脹方塊之作業以使用低通濾波器Fz_n來獲得。η後綴 -35- 1331306 表示濾波器係數之數量。在其一實施例中,使用2維5x5 三角濾波器Fz_5。z後綴表示此濾波器自總規格化權重 (total normalization weight)來消除任何零項。 總Fz_n濾波器方程式如下所示: 輸出値: (21) 其中au是2D輸入値,Wij是2D濾波器係數,而δ(&ϋ) 定義如下: 5(ajj)=l,如果 ajj#0;否則 5(ajj) = 0; (22) _ 自方程式(21)可見,Fz_n濾波器不同於規則濾波器,其 中總權重不再恰是習知規格化常數。因爲具有零値之輸入像 素數量沒有預先知道,而必需保持持續用於權重之累加器 。同時,濾波器迴路正在作業,如果所對其輸入値是非零 ,則累加器之內容以現有濾波器係數之値來增加。因爲總 權重沒有固定及預知,所以濾波器輸出之最終規格化視總 權重値而定。然而,仍然可以使用具有乘數選擇之預定乘 法表用於可能總權重値,而避免在方程式(2)之除算作業。 ® 使用特定Fz_n濾波器之目的,在消除所標示爲未定義而 具有特定零標識之任何像素來使得濾波輸出受污染。因爲 特定零標識値選擇爲零,所以未定義像素沒有響應方程式 (17)之分子。然而,這些未定義像素之數量必需追踪以便 保持分母正確。 當隨時在膨脹方塊F1(或F2)之Fz_5濾波器的已過濾輸 出是非零時(即,至少一個像素在有關現有像素上中心處之 -36- 1331306 5x5視窗內,或完全地定義),其替代使用於未定義像素之 特定零標識。注意在膨脹方塊FI、F2之Fz_5濾波器的已 過濾輸出僅使用於前已定義像素,而且僅影響在邊緣緊鄰 之兩個像素區內的像素。 參照第14圖’平均方塊F3及F4使得己膨脹前景及背景 値之非零內容經由J P E G M C U (最小値編碼單元)方塊來平 均。迨些方塊具有用於非子-抽樣輸出之16x16大小,而且 假如輸出在各方向中以2之因數來子-抽樣,則是32x32。 再次,小心地實施平均化來排除因而使得結果偏差之任何 未定義像素。平均化作業可以使用Fz_n濾波器但是具有定 單一權重而不是三角形狀之相同方式來看。方塊平均在固 定非重疊JPEG MCU方塊柵上實施。 充塡/子-抽樣方塊F5及F6以自F3及F4單元所接收已 平均背景及前景値,來分別地替代在已膨脹背景及前景通 道內之任何其他未定義像素。以這些已替代平均値,壓縮 比改善而且進一步大幅地防止JPEG -振鈴(ringing)人工誤 値。因爲背景及前景通道典型地子-抽樣,所以充塡/子-抽 樣方塊F5及F6也如所需地實施子-抽樣作業,而且輸出背 景及前景信號BG、FG。 拼塊標纖方塊F7監測在拼塊上之前景及背景通道之値 ,而且旗標有效地具有全白及白黑値之任何拼塊。拼塊大 小可程式規劃,但是典型之値在64x64至512x512像素間 來變動。如果在拼塊內之各及每像素的絕對色度値(即,|a| 及丨b|兩者)小於已知臨限値,而且亮度大於已知臨限,則拼 -37- 1331306 塊將視爲全白。同樣地,如果絕對色度値(即,|a丨及|b I兩者) 以及亮度値全部小於已知臨限値,則拼塊將視爲全黑。上 述三個臨限値可使用暫存器來程式規劃。 下文說明如何可自半色調預估模組來產生可選擇信號 HTW。 半色調預估模組使用來量測在包圍有關現有像素之小區 內的頻率及半色調權重。半色調預估模組之輸入是原信號 DSC及來自低通濾波器(即,具有3個係數)之輸出BLR_3 。這輸入兩者是全彩(L、a、b)信號》 半色調預估模組產生兩個單色(信號-通道)輸出信號FRQ 及HTW,分別地表示預估頻率及半色調權重。各該信號以 8-位元呈現來表示,HTW表示在半色調之區內的信心度。 如果HTW小(低信心),則活動分段(active segmentation) 不導通來防止各及每一半色調點之升高。 第1 8圖是半色調預估模組之實施例的方塊圖示。 如第1 8圖所示,半色調預估模.組之實施例包含二個分離 頻率檢測通道同時地作業,其輸出在最後步驟時結合在一 起來產生半色調權重。各頻率通道包含最小-最紋理(texture) 檢測器(C2及D2)跟著串列平均濾波器。多數平均濾波器也 同時以2之因數來子-抽樣資料,使得峰値頻帶寬大幅地減 小。僅在最後,資料向上抽樣回到原析像度。 第1 8圖之符號是以描繪各種方塊以點線來連接做爲匹 配對(沒有實際連接),來強調在兩頻率通道間之相似性。 匹配對方塊以相同方塊號碼來表示,具有開頭字母C用 1331306 於原頻率通道,及D用於模糊頻率通道。因此,匹配對以 (Cn、Dn)來表示,而 η=[2,._·,9]。 用於各方塊名稱之符號如下所述:第一號碼(底線)表示 所使用視窗之大小;第二號碼跟隨斜線表示在方塊內側各 方向中實施子-抽樣之量。因而,例如,所標示Β_3/2之濾 波器表示模糊(低通)濾波器Β具有3x3視窗大小,其輸出 在兩方向中以2之因數來子-抽樣(即,用於每一2x2 = 4輸 入像素僅傳送一個輸出)》 下文中更詳細說明半色調預估模組中所包括各方塊。 子-抽樣單元D 1以省略輸入之每一相隔像素及行來使得 資料率減少4之因數《子-抽樣僅在模糊頻率通道D內有需 要。全析像度頻率通道C不需要子-抽樣。SS/2單元之輸入 是來自小低通濾波器之全彩(L、a、b)輸出信號BLR_3"SS/2 單元之輸出是全彩(L、a、b)信號。較佳子-抽樣方法是在 子-抽樣之前先施加簡單預先濾波,以便消除潛在頻率混淆 問題。 兩個完全相同最小-最大檢測模組C2 ' D2使用來發現在 輸入信號中之峰値及各値,以計算每單位區之峰値及谷値 的數量,來獲得局部頻率之量測。 各該兩個最小·最大單元取全彩(L、a、b)信號做爲輸入 。當根據下文所述邏輯,彩色分量中其一之中心像素是在 相對其8個鄰値之極値(峰値或谷値)時各單元使用3 X 3視 窗來顯示。 各彩色分量在其自已3x3視窗獨立地檢測。來自各最小· -39- 1331306 最大檢測單元之輸出是2 -位元信號,顯示在極値狀態之彩 色分量的總數量。本數量可變動自0(沒有彩色分量在極値 處)到3 (全部彩色分量在極値處)。當一個或兩個彩色分量 是在極値處時,沒有區別那一個是在極値處;僅輸出在極 値處之全部分量數量。 第1 9圖表示最小-最大檢測結構。對各彩色分量,包圍 中心像素(有關現有像素)之8個像素的外環(outer ring)先 行分析。8個外環像素進一步劃分成二組各4個像素如第 1 9圖所示。外環之分隔成爲二組有用於在檢測直線分段做 爲半色調中減少錯誤警報的可能性(因爲最常遇到之半色 調典型地分類爲叢聚點(clustered dots)或行據選(line-screen)) 〇 對各組’在組之構成中來比較像素値而獨立地決定在各 組內之最小及最大値: A ma3( = max(Aij);整個(i,j)屬於組 A ; (23) A min = min(Aij);整個(i,j)屬於組 A ; (24) B max = max(Bij);整個(isj)屬於組 B ; (25) B min = min(Bij);整個(i,j)屬於組 B ; (26) 然後, 整個外環對比由上述値來計算 Δ ring = max(Amax,Bmax)-miii(Amin,B min) * (27)Fgr = FGD > If SEG = 0 and SEE={2,3} (20) Depending on the SEE, equations (18), (19), (20) indicate that the background is always set to the special undefined identifier Bgr = 〇, and the foreground is the weight of the foreground or background pixels of equation (12) or (1 3). If SEE={0,〗}, the background is used, otherwise the foreground is used. It is important to note the scope of the SEE in this case where the segmentation control is not conductive, which is different from the equations (14) to (17). Here, if the majority of the pixels are the foreground {SEE={0,1 }}, the foreground 値 is set only in FGD, or if most of the background {SEE={2, 3}} is at BGD. The output from the FG/BG separation block E8 is two partial full-color planes Fgr and Bgr. At the edge of the selection plane SEL, depending on whether it is bright or dark, 'typically only one of the foreground and background outputs contains the existing pixel color (which can be enhanced). However, information near the edge can be carried simultaneously in the foreground and back view channels. FG/BG block E9 in the rough foreground and background estimates Fgr and Bgr implementation multi-34-1331306 plus processing 'and produce final prospects and background output FG and BG 〇 FG / BG 方块 block E9 implementation process slightly extended The edge front and background 値 'and also fill the undefined pixels in the foreground and back planes. The purpose of this process is to prevent manual errors due to subsequent sub-sampling and data compression (such as JPEG), and to fill undefined pixels to achieve a good compression ratio. The logic inside the FG/BG erasure block E9 also monitors the foreground and background output 値 to detect and flag all black or all white tiles. Instead of encoding and exporting the output from this block to the output stream, it is better to use and reference the number of times the specific tile is identified. This will eliminate the need to repeatedly encode generic all white or white and black tiles, increasing the overall compression ratio. Figure 14 is a block diagram showing an embodiment of the FG/BG erasure block E9. The embodiment comprises two expansion blocks F1, F2, two average squares F3'F4, two charge/sub-sample blocks F5'F6 and a tile flag block F7. Dilate blocks F1 and F2 expand the foreground and background content by 2 pixels. Implementing an expansion of 2 pixels is expected in subsequent 2 dice-sampling; other extended sizes can be used for different sub-sampling factors. The purpose is to increase the foreground and the background overlap on the edge, making the result insensitive to further sub-sampling. Figure 15 illustrates the utility of the expansion operation of the expansion blocks F1 and F2. Area] 5〇4 represents a predetermined pixel. A region 1502 represents an unscheduled pixel. After the expansion operation, the area of the predetermined pixel is expanded to also cover area 1506, and the area of the undefined pixel is reduced to area 1508. The operation of the expansion block is obtained using the low pass filter Fz_n. The η suffix -35- 1331306 indicates the number of filter coefficients. In one embodiment, a 2-dimensional 5x5 triangular filter Fz_5 is used. The z suffix indicates that this filter removes any zeros from the total normalization weight. The total Fz_n filter equation is as follows: Output 値: (21) where au is the 2D input 値, Wij is the 2D filter coefficient, and δ(&ϋ) is defined as follows: 5(ajj)=l, if ajj#0 Otherwise 5(ajj) = 0; (22) _ As can be seen from equation (21), the Fz_n filter is different from the regular filter, where the total weight is no longer exactly the conventional normalization constant. Since the number of input pixels with zero 没有 is not known in advance, it is necessary to keep the accumulator that is continuously used for weights. At the same time, the filter loop is operating, and if its input 値 is non-zero, the contents of the accumulator are increased by the 滤波器 of the existing filter coefficients. Since the total weight is not fixed and predictable, the final normalization of the filter output depends on the total weight. However, it is still possible to use a predetermined multiplication table with multiplier selection for the possible total weight 値, while avoiding the division operation in equation (2). ® For the purpose of using a specific Fz_n filter, the filtered output is contaminated by eliminating any pixels marked as undefined and having a specific zero identification. Since the specific zero flag 値 is chosen to be zero, the undefined pixel does not respond to the numerator of equation (17). However, the number of these undefined pixels must be tracked in order to keep the denominator correct. When the filtered output of the Fz_5 filter of the expansion block F1 (or F2) is non-zero at any time (ie, at least one pixel is within the -36-1331306 5x5 window at the center of the existing pixel, or completely defined), Instead of a specific zero identifier for undefined pixels. Note that the filtered output of the Fz_5 filter in the expansion blocks FI, F2 is only used for the previously defined pixels and only affects the pixels within the two pixel regions immediately adjacent to the edge. Referring to Figure 14 'average blocks F3 and F4, the non-zero content of the expanded foreground and background 平 is averaged via the J P E G M C U (minimum 値 coding unit) block. These blocks have a size of 16x16 for non-sub-sampled output, and 32x32 if the output is sub-sampled by a factor of two in all directions. Again, the averaging is carefully performed to exclude any undefined pixels that would otherwise bias the results. The averaging job can be viewed in the same way as the Fz_n filter but with a single weight instead of a triangular shape. The block average is implemented on a fixed non-overlapping JPEG MCU block grid. The 塡/sub-sampling blocks F5 and F6 replace the average background and foreground 自 from the F3 and F4 units to replace any other undefined pixels in the expanded background and foreground channels, respectively. With these alternatives, the compression ratio is improved and the JPEG-ringing manual error is further greatly prevented. Since the background and foreground channels are typically sub-sampled, the charge/sub-sample blocks F5 and F6 also perform sub-sampling operations as desired, and output background and foreground signals BG, FG. The block standard fiber block F7 monitors the front view and the background channel on the block, and the flag effectively has any block of all white and white black. The block size is programmable, but typically varies from 64x64 to 512x512 pixels. If the absolute chromaticity 値 (ie, |a| and 丨b|) of each and every pixel in the tile is less than the known threshold, and the brightness is greater than the known threshold, then the block is -37- 1331306 Will be considered all white. Similarly, if the absolute chroma 値 (ie, both |a 丨 and |b I ) and the luminance 値 are all less than the known threshold 拼, the tile will be considered completely black. The above three thresholds can be programmed using a scratchpad. The following describes how the selectable signal HTW can be generated from the halftone estimation module. The halftone estimation module is used to measure the frequency and halftone weights in cells surrounding the existing pixels. The input to the halftone estimation module is the original signal DSC and the output BLR_3 from the low pass filter (ie, having 3 coefficients). This input is a full color (L, a, b) signal. The halftone estimation module produces two monochromatic (signal-channel) output signals FRQ and HTW, representing the estimated frequency and halftone weight, respectively. Each of the signals is represented by an 8-bit representation, and HTW represents the confidence in the halftone region. If the HTW is small (low confidence), the active segmentation is not turned on to prevent the rise of each and every halftone point. Figure 18 is a block diagram of an embodiment of a halftone estimation module. As shown in Fig. 18, the embodiment of the halftone prediction mode group includes two separate frequency detecting channels operating simultaneously, the outputs of which are combined in the final step to produce halftone weights. Each frequency channel contains a minimum-most texture detector (C2 and D2) followed by a tandem averaging filter. Most averaging filters also subsample the data by a factor of two, resulting in a significant reduction in peak-to-peak bandwidth. At the end, the data is sampled back to the original resolution. The symbol in Figure 18 is to depict the various blocks connected by dotted lines as a pair (no actual connection) to emphasize the similarity between the two frequency channels. The matching pair block is represented by the same block number, with the initial letter C being 1331306 in the original frequency channel, and D being used in the fuzzy frequency channel. Therefore, the matching pair is represented by (Cn, Dn), and η = [2, ._·, 9]. The symbols used for the names of the blocks are as follows: the first number (bottom line) indicates the size of the window used; the second number follows the slash to indicate the amount of sub-sampling performed in each direction inside the block. Thus, for example, the filter labeled Β3/2 represents a fuzzy (low-pass) filter Β having a 3x3 window size, the output of which is sub-sampled by two factors in both directions (ie, for each 2x2 = 4 The input pixel only transmits one output)) The blocks included in the halftone estimation module are explained in more detail below. The sub-sampling unit D 1 reduces the data rate by a factor of 4 by omitting each pixel and row of the input. Sub-sampling is only required in the fuzzy frequency channel D. The full resolution frequency channel C does not require sub-sampling. The input to the SS/2 unit is the full-color (L, a, b) output signal from the small low-pass filter. The output of the BLR_3"SS/2 unit is a full-color (L, a, b) signal. The preferred sub-sampling method is to apply a simple pre-filtering before sub-sampling to eliminate potential frequency aliasing problems. Two identical minimum-maximum detection modules C2'D2 are used to find the peaks and enthalpies in the input signal to calculate the number of peaks and valleys per unit area to obtain a local frequency measurement. Each of the two minimum and maximum units takes a full color (L, a, b) signal as an input. When the central pixel of one of the color components is at a limit (peak or valley) relative to its eight neighbors according to the logic described below, each unit is displayed using a 3 X 3 view window. Each color component is independently detected in its own 3x3 window. The output from each of the minimum · -39 - 1331306 maximum detection units is a 2-bit signal that shows the total number of color components in the extreme state. The number can vary from 0 (no color component at extremes) to 3 (all color components are at extremes). When one or two color components are at the extremes, there is no difference that is at the pole; only the total number of components at the pole is output. Figure 19 shows the minimum-maximum detection structure. For each color component, the outer ring of 8 pixels surrounding the center pixel (about the existing pixel) is analyzed first. The eight outer loop pixels are further divided into two groups of four pixels as shown in Fig. 19. The separation of the outer rings into two groups has the potential to reduce false alarms in detecting straight line segments as halftones (since the halftones most commonly encountered are typically classified as clustered dots or row selections ( Line-screen)) 〇 For each group 'in the composition of the group to compare the pixels 値 and independently determine the minimum and maximum 在 in each group: A ma3 ( = max (Aij); the whole (i, j) belongs to the group A; (23) A min = min(Aij); the whole (i, j) belongs to group A; (24) B max = max(Bij); the whole (isj) belongs to group B; (25) B min = min( Bij); the whole (i, j) belongs to group B; (26) Then, the whole outer ring is compared by the above 値 to calculate Δ ring = max(Amax, Bmax)-miii(Amin, B min) * (27)
其次測試Δη ng値來了解是否有外環之任何對比。不管中 心像素値’如果Δηng値小於或等於預定小臨限T2,則輸出 設定在〇(不是極値點): 如果(ΔΗηε$ T2) ’ 則回轉(〇) ; (28) -40- 1331306 另一方面,如果在外環內有充分活動(sufficient activity) (如所示外環對比>T2),則實施兩個測試來了解中心像素値 是否在相對外環値之極値處。如果中心像素値Χ(大幅地) 大於任一組之最大像素値,則其定義爲在峰値處: 如果[(Amax + S<X)及(Bmax$ X)],則回轉(1) ; (29) 其中S是外環對比,以對比定標參數(contrast scaling parameter)C 來比例: S-△ring/C, (30) 在其一實施例中,對比定標參數C設定在等於8。定標 參數C之實際値是在輸入處之信號雜訊比的函數。期望來 保持C値做爲最小-最大檢測單元之類屬參數(generic parameter)。C値可限制在2冪次數,使得其可如算術移位 地來實施’而節省需要實施每一像素之除法運算。 同樣地’如果中心像素値X(相當地)小於來自組A或B 之最小像素値,其將定義在各値處: 如果[(Ami^X + S)及(Bming X)],回轉(1) ; (3 1) 方程式(29)及(31)決定兩個條件,其中來自3x3檢測視窗 之輸出設定在1;在全部其他情形中,輸出將設定在〇。 在第二實施例中,如果中心像素値χ(相當地)大於任一組 之最大像素値,則其將定義在峰値處: 如果[(Amax + NTH<X)及(Bmax$ X)],回轉(1) ; (2 9 A) 其中Nth是雜訊臨限,定義爲: NTH =雜訊偏差+(雜訊因數χχ)/256 其中雜訊偏差及雜訊因數是調整參數(tuning parameter)。 -41- 1331306 同樣地’如果中心像素値x(相當地)小於來自組A或B 之最小像素値,則其將定義爲在各値處: 如果[(Amin>X + NTH)及(B„Hn2 X)],回轉(1) ; (31A) 方程式(29A)及(31A)決定兩個條件,其中來自3x3檢測 視窗之輸出設定在I;在全部其他情形中,輸出將設定在〇 °注意在第二實施例中,不需計算整個外環對比。 最後’各彩色分量經由其自已分離之3x3視窗來獨立地 處理。然後,彩色分量之三個二進位輸出加在一起,來形 成最小-最大檢測模組之最後2-位元輸出。 兩個最小-最大檢測輸出C2及D2分別地進給到串列濾波 器鏈(cascaded fi Iter chain)C3-C6 及 D3-D6。第一濾波器單 元C3及D3在兩個鏈之間是不同,但是除此之外,後續單 元C4-C6及D4-D6是全部完全相同。 第一濾波器單元C3接收來自高析像度最小·最大檢測單 元C2之2-位元輸出。輸入經由F_7/4濾波器來濾波,該濾 波器在其一實施例中是7x7對稱、三角形及可分離濾波器 。/4符號表示濾波器F_7/4在兩方向中也以4以因數來子-抽樣已濾波的輸出。意即濾波器F_7/4對每一四個輸出像 素及每一四行僅產生一個輸出像素,因而,有效地使得資 料頻帶寬減小1 6之因數。 因爲第一濾波器單元C3之輸入限制在2-位元(而不是8 位元),所以濾波器之輸出以不同2冪次數(即2)來定標結 果而規格化。定標冪次保留設計參數。在第一規格化之後 ,然而,結果已定標來適用8-位元之範圍,使得從本點之 -42· 1331306 後,後續濾波使用8-位呈現系統。 第二鏈前置濾'波器單元D3在兩架構不同於C3。第一, F 一 5/2濾波器在各方向中僅以2之因數(而不是4)來子-抽樣 輸入。意即,波器對每一相隔輸入像素及每—相隔行僅 產生一個輸出像素,因而,有效地使得資料頻帶寬來減少 4之因數。因爲子-抽樣因數較小,結果地濾波器之跨越範 圍可自7(對C3)來減小到5(對D3)。在其一實施例中,F_5/2 之規格化因數決定爲29。注意來自兩個前置濾波器單元C3 及D3之輸出(現在8-位元寬)兩者在二維中以4來子-抽樣 ,或原輸入頻帶寬之1/16的相同析像度。這是因爲在上鏈 中之C3單元的F_7Μ濾波器以4來子-抽樣資料,同時在 下鏈中之SS/2及F_5/2單元D3的組合獲得整個輸出速率 匹配C3之輸出速率。 來自濾波器單元C3及D3之兩個輸出進一步分別地經由 三個多加及完全相同之單元C4-C6及D4-D6來濾波。各該 6個濾波器單元也以在兩個方向中以2之因數來子-抽樣資 料的F_3/2濾波器(具有係數1-2-1)處理其個別輸入信號。 注意各該濾波器具有1 +2+ 1 =4之總權重,因而可以簡單算 術向右移位2來替代規格化除算而簡化實施作業。 因爲各濾波器單元也以2之因數來子·抽樣其個別輸入信 號,所以在C6及D6濾波器單元之個別輸出處的信號在各 方向中實際上以32之因數來子-抽樣(或在頻帶寬中減少 1 0 2 4 次)。 其次兩個濾波器單元C7及D7是特定濾波器單元,標示 -43- 1331306 爲Fz_5濾波器。Z後綴表示消除來自總規格化權重之任何 零項的濾波器。一般Fz_n濾波器方程式如下所示: 輸出値 Σ< Σμ>.. * δ (a,. (32) 其中aij是2D輸入値,wu是2D濾波器係數’而且S(aij) 定義如下之函數: 5(aij)= 1,如果 aij#0 ;否則 3(aij) = 0 ; (33)Next, test Δη ng値 to see if there is any comparison of the outer ring. Regardless of the central pixel 値 'if Δηng値 is less than or equal to the predetermined small threshold T2, the output is set at 〇 (not the extreme point): If (ΔΗηε$ T2) ' then turn (〇); (28) -40- 1331306 On the one hand, if there is sufficient activity in the outer ring (as shown by outer ring contrast > T2), then two tests are performed to see if the central pixel is at the extreme outer ring. If the center pixel 値Χ (substantially) is larger than the largest pixel 任一 of any group, it is defined as at the peak: If [(Amax + S<X) and (Bmax$ X)], then turn (1); (29) where S is the outer loop contrast, in proportion to the contrast scaling parameter C: S-Δring/C, (30) In one embodiment, the comparison calibration parameter C is set equal to 8 . Scaling The actual 値 of parameter C is a function of the signal-to-noise ratio at the input. It is desirable to maintain C値 as a generic parameter of the minimum-maximum detection unit. C値 can be limited to a power of two, so that it can be implemented as an arithmetic shift' while saving the division operation required to implement each pixel. Similarly, 'if the central pixel 値X (equivalently) is smaller than the smallest pixel 来自 from group A or B, it will be defined at each :: If [(Ami^X + S) and (Bming X)], turn (1 (3 1) Equations (29) and (31) determine two conditions, where the output from the 3x3 detection window is set to 1; in all other cases, the output will be set to 〇. In the second embodiment, if the center pixel 値χ (equivalently) is larger than the maximum pixel 任一 of any group, it will be defined at the peak: if [(Amax + NTH<X) and (Bmax$ X)] , Swing (1); (2 9 A) where Nth is the noise threshold, defined as: NTH = noise deviation + (noise factor χχ) / 256 where the noise deviation and noise factor are tuning parameters (tuning parameter ). -41- 1331306 Similarly - if the central pixel 値x (equivalently) is smaller than the smallest pixel 来自 from group A or B, it will be defined at each :: if [(Amin>X + NTH) and (B„ Hn2 X)], Swing (1); (31A) Equations (29A) and (31A) determine two conditions, where the output from the 3x3 detection window is set to I; in all other cases, the output will be set at 〇° Note In the second embodiment, it is not necessary to calculate the entire outer loop comparison. Finally, each color component is processed independently by its own separated 3x3 window. Then, the three binary outputs of the color components are added together to form a minimum - The last 2-bit output of the largest detection module. The two minimum-maximum detection outputs C2 and D2 are fed to the cascaded fi Iter chain C3-C6 and D3-D6, respectively. The cells C3 and D3 are different between the two chains, but otherwise, the subsequent cells C4-C6 and D4-D6 are all identical. The first filter unit C3 receives the minimum and maximum detection unit from the high resolution. 2-bit output of C2. The input is filtered by the F_7/4 filter, which The waver is in one embodiment a 7x7 symmetrical, triangular and separable filter. The /4 symbol indicates that the filter F_7/4 also sub-samples the filtered output in four directions in both directions. F_7/4 produces only one output pixel for each of the four output pixels and each of the four rows, thus effectively reducing the data bandwidth by a factor of 16. Since the input of the first filter unit C3 is limited to the 2-bit Yuan (instead of 8-bit), so the output of the filter is normalized by scaling the result with a different power of two (ie 2). The scaling power retains the design parameters. After the first normalization, however, the result is The calibration is applied to the 8-bit range, so that after the -42·1331306 of this point, the subsequent filtering uses the 8-bit rendering system. The second chain prefiltering filter unit D3 is different from C3 in the two architectures. First, the F-5/2 filter is sub-sampled input in only 2 factors (instead of 4) in each direction. That is, the waver produces only one output pixel for each input pixel and every interlaced line. Therefore, effectively making the data bandwidth bandwidth reduce the factor of 4. Because of the sub- The sample factor is small, and the span of the resulting filter can be reduced from 7 (for C3) to 5 (for D3). In one embodiment, the normalization factor of F_5/2 is determined to be 29. Note that from two The outputs of the pre-filter units C3 and D3 (now 8-bit wide) are both sub-sampled in two dimensions, or the same resolution of 1/16 of the original input bandwidth. This is because The F_7 Μ filter of the C3 unit in the upper chain obtains the output rate of the entire output rate matching C3 by combining the sub-sampling data with the SS/2 and the F_5/2 unit D3 in the lower chain. The two outputs from filter units C3 and D3 are further filtered separately via three more identical and identical units C4-C6 and D4-D6. Each of the six filter units also processes its individual input signals with an F_3/2 filter (having a coefficient of 1-2-1) sub-sampled in two directions in two directions. Note that each of the filters has a total weight of 1 + 2 + 1 = 4, so that it can be easily shifted to the right by 2 to replace the normalized division and simplify the implementation. Since each filter unit also samples its individual input signals by a factor of 2, the signals at the individual outputs of the C6 and D6 filter units are actually sub-sampled in each direction by a factor of 32 (or Reduced by 1 0 2 4 times in the frequency bandwidth). The next two filter units C7 and D7 are specific filter units, indicating -43- 1331306 as the Fz_5 filter. The Z suffix represents a filter that eliminates any zero term from the total normalized weight. The general Fz_n filter equation is as follows: Output 値Σ<Σμ>.. * δ (a,. (32) where aij is the 2D input 値, wu is the 2D filter coefficient' and S(aij) defines the following function: 5(aij)= 1, if aij#0; otherwise 3(aij) = 0; (33)
如自方程式(3 2)可見,和規則濾波器(regular filter)之差 異在於總權重不再僅是已知規格化常數。因爲具有零値之 輸入像素沒有事先知悉,所以持續用於權重之累加器必需 保持。同時,濾波器迴路作業,如果所對應輸入値是非零 ,累加器之內容以現有濾波器係數之値來增加。 因爲總權重沒有固定而且未預先知悉,所以濾波器輸出 之最後規格化視總權重之値而定。然而,使用具有選擇用 於可能總權重値之預定乘法表,可避免在方程式(3 2)之除 法運算。As can be seen from equation (32), the difference from the regular filter is that the total weight is no longer just a known normalization constant. Since the input pixels with zero turns are not known in advance, the accumulator that continues to be used for weights must be maintained. At the same time, the filter loop operates. If the corresponding input 値 is non-zero, the contents of the accumulator are increased by the 滤波器 of the existing filter coefficients. Since the total weight is not fixed and is not known in advance, the final normalization of the filter output depends on the total weight. However, the division operation in equation (32) can be avoided by using a predetermined multiplication table with a choice of possible total weights.
使用特定Fz_5濾波器之目的,在於即使當濾波器非常接 近到邊緣時,也獲得可靠頻率及半色調權重預估。 兩個MX_5模組C8及D8在5x5視窗內搜索最大値,而 且輸出最大値。 各該兩個插置模組C9及D10以32之因數來將信號插置 (即,向上抽樣),使得其回復到原析像度。各插置單元實 施雙線性插置,基本上對各4個原像素來產生3 2x3 2個像 素。雙線性插置之段差大小(step size)是原像素光栅之1/32。 -44- 1331306 半色調模組HTW接收兩個標示爲FRQ及FRQ_B之插置 單元的輸出來做爲輸入。半色調權重模組使得來自各輸入 之貢獻値相加在一起,如下所示: HTW = HTWh + HTWl ; (34) 其中 HTWh = (FRQ_Th)*SFh 如果 FRQ>TH ; 0 否則; (35) HTWL=(FRQ_B_TL)*SFL 如果 FRQ_B>TL ; 0 否則;(36) 其中TH及TL是兩個預定臨限値,而SFH及SFL分別地是 原(高)及已濾波(低)頻率FRQ及FRQ_B之兩個預定比例因 數(scale factor)。 多加邏輯確保HTW値限定在不超過所允許[0,25 5]之8-位元範圍。 第20圖是方程式(34)、(35)、(3 6)及多加邏輯限制HTW 値在所允許範圍之限幅作用(clipping effect)的圖示說明。 所標示"LA"之區表示行項目區(line art region)。如第20 圖所示·,一個特別彩色濾選圖型如同其頻率自高至中至低 地改變而改變位置自如所示之HFHT至MFHT至LFHT。因 爲在2D繪圖上軌跡所示曲線是凸出型,所以其不可能以單 獨遵照FRQ或FRQ_B來區別濾選頻率。 在上述說明中,本發明實施例之元件可以硬體、韌體、 軟體及其任何組合來獲得。用語硬體大致指具有實體結構 之元件,諸如電子、電磁、光學、電光、機器、電子機器 零件等。用語軟體大致指邏輯結構、方法、程序、程式、 路徑、過程、運算、公式、函數、表示式等。用語韌體大 -45- 1331306 致指邏輯結構 '方法、程序、程式、路徑、過程、運算' 公式、函數、表示式等’即以硬體結構來獲得及實施(即, 快閃記憶體、僅讀記憶體(R Ο Μ )、可抹除R 〇 Μ)。軔體之實 例可包括微編碼、可寫入控制儲存' 微程式化結構。當以 軟體或韌體來實施時,本發明實施例之元件基本上是實施 所必要任務之編碼分段。軟體/朝體可包括實施在本發明之 其一實施例所述作業的實際編碼 '或仿效或模擬作業之編 碼。程式或編碼分段可以儲存處理器或可機器式存取媒體 內’或以載波所實施之電腦資料信號或載波所調變之信號 經由傳輸媒體來傳送。”處理器可讀取或可存取媒體”或”可 機器式取讀或可存取媒體”可包括可儲存、傳送或轉換資訊 之任何媒體。處理器可讀取或可機器式存取媒體之實例包 括電子電路、半導體記憶體裝置、僅讀記憶體(ROM)、可 抹除ROM(EROM)、軟碟機、硬碟(CD)ROM'光碟、硬碟、 光纖媒體、射頻(RF)鏈路等。電腦資料信號可包括可經由 傳輸媒體諸如電子網路通道 '光纖、空氣、電磁RF鏈路來 傳播之任何信號。編碼分段可經由電腦網路諸如網際網路 、網內網路來下載。可機器存取媒體可以製作項目(article of manufacture)來實施。可機器存取媒體可包括資料,其 當以機器來存取時,使得機器來實施下文所述作業。可機 器存取媒體也可包括其內建之程式編碼。程式編碼可包括 實施本發明上述所說明作業之可機器讀取編碼。用語"編碼" 在此指所編碼用於可機器讀取目的之任何形式資訊。因此 ’其可包括程式、編碼 '資料 '檔案等。 -46- 1331306 本發明實施例之全部或部份可以硬體、軟體或韌體或其 任何組合來獲得。硬體、軟體或韌體元件可具有相互耦接 之數個模組。硬體模組以機器、電氣、光學、電磁或任何 實體連接來耦接到另一模組。軟體模組以函數、程序 '方 法、子程式或子例行程序調用(subroutine call)、轉移(jump) 、鍵路、爹數 '可變數及自變量傳送(parameter,variable, argument passing、函數返回(function return)等來幸禹至丨J 另一 模組。軟體模組耦接到另一模組來接收變數、參數、自變 量、指示符號等’及/或來產生或通過結果,更新可變數' 指示符號等。軔體模組以上述硬體及軟體耦接方法之任何 組合來耦接到另一模組。硬體、軟體或韌體模組可耦接任 何另一硬體 '軟體或韌體模組中之其一。模組也可以是軟 體驅動器或和在平台上作業系統互動之介面。模組也可是 硬體驅動器來架構、設定、初始、傳送及接收資料來回於 硬體裝置。裝備或系統可包括硬體、軟體或韌體模組之任 何組合。 本發明之一實施例可以說明爲一種方法或過程,其通常 敘述爲流程圖、流程圖示、結構圖示或方塊圖示。雖然任 何這些敘述可說明作業爲一種順序過程,但是許多作業可 以平行或倂行地實施。此外,作業次序可重新安排。當其 作業完成時,過程終止。過程可對應一種方法、一種程式 、一種程序、一種生產或製造之方法等。 (五)圖式簡單說明 第1圖是說明用於文件之MRC結構; -47- 1331306 +第2圖表示本發明系統之方塊圖示; 第3圖表示本發明系統實施例之方塊圖示; 第4圖說明本發明系統之其一實施例中所使用相關性最 小-最大方塊E 1之功能; 第5圖說明本發明系統之其一實施例中所使用相關性最 小-最大子抽樣方塊E 2之功能; 第6圖說明本發明系統之其一實施例中所使用相關性最 大方塊E3及相關性最小方塊E4的功能; 第7圖說明動態臨限模組之其一實施例所使用的兩個視 窗前後關係(window context); 第8圖表示動態臨限模組之其一實施例的方塊圖示; 第9圖表示動態臨限模組之其一實施例中所包括比較器 邏輯方塊之實施; 第10圖表示第9圖比較器邏輯方塊之真値表; 第1 1圖表示動態臨限模組之其一實施例中所包括選擇 邏輯模態之實施; 第1 2圖說明在分離模組中所包括邊緣處理方塊之功能 圖示; 第1 3圖說明分離模組所使用來使得影像信號分離成爲 背景及前景平面之決定値域(decision range); 第14圖表示分離模組之其一實施例中所包括FG/BG淸 除(cleanup)方塊的其一實施方塊圖示; 第1 5圖說明分離模組其一實施例中所包括FG/BG淸除 方塊之其一實施所使用膨脹作業(dilate operation)圖示; 第16圖是方程式(1)至(4)之圖表說明圖示; -48- 1331306 第17圖是方程式(6)至(9)之圖表說明圖示; 第1 8圖是半色調評估模組之範例結構圖示; 第I 9圖表示第1 8圖半色調評估模組中所包括最小_最大 檢測模組使用之最小·最大檢測作法圖示;及 第2 0圖表示半色調評估模組中所包括半色調權重模組 實施之方程式圖示。 主要部分之代表符號說明 200,300 分段系統 202,310 最小-最大模組 2 04,3 2 0 臨限模組 2 0 6,3 3 0 分離模組 502 最大輸出 504 最小輸出 818,828,838 輸出 820,830 邏輯方塊 821,823,825 加法器 827,837 點積方塊 831,833,834,835 加法器 840 決定模組 846 比較器邏輯 848 多工器 850 強化編碼方塊 8 5 2,902,904,1 1 04 比較器 1102 插置器 1 502,1 504,1 506,1 508 區The purpose of using a particular Fz_5 filter is to obtain reliable frequency and halftone weight estimates even when the filter is very close to the edge. The two MX_5 modules C8 and D8 search for the maximum 値 in the 5x5 window, and the maximum output is 値. Each of the two interposer modules C9 and D10 interpolates (i.e., upsamples) the signal by a factor of 32 such that it returns to the original resolution. Each of the interpolating units performs bilinear interpolation, and substantially 3 2 x 3 2 pixels are generated for each of the 4 original pixels. The step size of the bilinear interpolation is 1/32 of the original pixel grating. -44- 1331306 The halftone module HTW receives the outputs of two interleaved units labeled FRQ and FRQ_B as inputs. The halftone weighting module adds the contributions from each input together as follows: HTW = HTWh + HTWl; (34) where HTWh = (FRQ_Th) * SFh if FRQ > TH; 0 Otherwise; (35) HTWL =(FRQ_B_TL)*SFL if FRQ_B>TL; 0 otherwise; (36) where TH and TL are two predetermined thresholds, and SFH and SFL are the original (high) and filtered (low) frequencies FRQ and FRQ_B, respectively The two predetermined scale factors. Multiple logic ensures that the HTW is limited to an 8-bit range that does not exceed the allowed [0, 25 5]. Figure 20 is a graphical illustration of the clipping effects of equations (34), (35), (3 6), and multiple plus logic limits HTW 所 in the allowed range. The area marked "LA" indicates the line art region. As shown in Figure 20, a special color filter pattern changes its position from HFHT to MFHT to LFHT as its frequency changes from high to medium to low. Since the curve shown on the 2D plot is convex, it is not possible to distinguish the filter frequency by simply following FRQ or FRQ_B. In the above description, the elements of the embodiments of the present invention can be obtained by hardware, firmware, soft body, and any combination thereof. The term hardware generally refers to components having a physical structure, such as electronic, electromagnetic, optical, electro-optic, mechanical, electronic machine parts, and the like. The term software refers to logical structures, methods, programs, programs, paths, procedures, operations, formulas, functions, expressions, and so on. The terminology firmware -45- 1331306 refers to the logical structure 'methods, procedures, programs, paths, procedures, operations 'formulas, functions, expressions, etc.' that are obtained and implemented in a hardware structure (ie, flash memory, Read only memory (R Ο Μ ), erase R 〇Μ). Examples of scorpions may include micro-encoded, writable control storage 'micro-stylized structures. When implemented in software or firmware, the elements of embodiments of the present invention are basically coded segments that perform the necessary tasks. The software/body may include the actual code ' or the code of the emulation or simulation work performed to perform the work described in one embodiment of the present invention. The program or code segment can be transmitted via the transmission medium by means of a processor or a machine-accessible medium or a signal modulated by a computer data signal or carrier carried out by a carrier. "Processor readable or accessible media" or "machine readable or accessible media" may include any medium that can store, transfer or convert information. Examples of processor readable or machine readable media include electronic circuitry, semiconductor memory devices, read only memory (ROM), erasable ROM (EROM), floppy disk, hard disk (CD) ROM' Disc, hard disk, fiber media, radio frequency (RF) links, etc. The computer data signal can include any signal that can be propagated via a transmission medium such as an electronic network channel 'fiber, air, electromagnetic RF link. Code segments can be downloaded via a computer network such as the Internet or an intranet. Machine accessible media can be implemented by making an article of manufacture. The machine-accessible medium can include material that, when accessed by a machine, causes the machine to perform the operations described below. The machine access medium can also include its built-in program code. The program code may include machine readable code that implements the operations described above in the present invention. The term "code" is used herein to mean any form of information that is encoded for machine-readable purposes. Therefore, it can include programs, coded 'data' files, and so on. -46- 1331306 All or a portion of the embodiments of the invention may be obtained in the form of a hardware, a soft body or a tough body or any combination thereof. The hardware, software or firmware components can have a plurality of modules coupled to each other. The hardware modules are coupled to another module by mechanical, electrical, optical, electromagnetic or any physical connection. The software module is called by function, program 'method, subroutine or subroutine call (subroutine call), jump (jump), key path, parameter 'variable number and argument transfer (parameter, variable, argument passing, function return) (function return) and so on to another module. The software module is coupled to another module to receive variables, parameters, arguments, indicators, etc. and/or to generate or pass results, update can be Variable 'indicator, etc. The body module is coupled to another module by any combination of the above hardware and software coupling methods. The hardware, software or firmware module can be coupled to any other hardware 'soft body Or one of the firmware modules. The module can also be a software driver or an interface that interacts with the operating system on the platform. The module can also be a hardware driver to structure, set up, initialize, transmit and receive data back and forth to the hardware. Apparatus or system may comprise any combination of hardware, software or firmware modules. An embodiment of the invention may be described as a method or process, which is generally described as a flowchart, a flowchart, and a structure. Or block diagrams. While any of these statements may indicate that the job is a sequential process, many jobs may be implemented in parallel or limp. In addition, the job order may be rearranged. When the job is completed, the process terminates. The process may correspond to a method , a program, a program, a method of production or manufacturing, etc. (5) Brief description of the drawing Figure 1 is a diagram illustrating the MRC structure for the file; -47-1331306 + Figure 2 shows a block diagram of the system of the present invention Figure 3 is a block diagram showing an embodiment of the system of the present invention; Figure 4 is a diagram showing the function of the correlation minimum-maximum block E 1 used in an embodiment of the system of the present invention; Figure 5 is a diagram showing the system of the present invention. The function of the correlation minimum-maximum sub-sample block E2 used in an embodiment; FIG. 6 illustrates the function of the correlation maximum block E3 and the correlation minimum block E4 used in one embodiment of the system of the present invention; The figure illustrates two window contexts used by one embodiment of the dynamic threshold module; FIG. 8 shows a block of an embodiment of the dynamic threshold module. Figure 9 shows the implementation of the comparator logic block included in one embodiment of the dynamic threshold module; Figure 10 shows the true table of the comparator logic block of Figure 9; Figure 1 shows the dynamic threshold An embodiment of the module includes an implementation of a selection logic mode; FIG. 2 illustrates a functional diagram of an edge processing block included in the separation module; and FIG. 3 illustrates a separation module used to cause an image The signal separation becomes a decision range of the background and the foreground plane; FIG. 14 shows an implementation block diagram of the FG/BG cleanup block included in one embodiment of the separation module; The figure illustrates a dilate operation diagram used in one implementation of the FG/BG elimination block included in an embodiment of the separation module; FIG. 16 is a diagram illustrating the equations of equations (1) to (4) ; -48- 1331306 Figure 17 is a graphical illustration of equations (6) through (9); Figure 18 is an example structural diagram of a halftone evaluation module; Figure I9 shows a halftone of Figure 18. The smallest _max detection module included in the evaluation module The small maximum detection method diagram; and Fig. 20 shows the equation diagram of the implementation of the halftone weight module included in the halftone evaluation module. Representative symbols for the main part 200,300 segmentation system 202,310 min-max module 2 04,3 2 0 threshold module 2 0 6,3 3 0 separation module 502 maximum output 504 minimum output 818,828,838 output 820,830 logic block 821,823,825 adder 827,837 dot product block 831,833,834,835 adder 840 decision module 846 comparator logic 848 multiplexer 850 enhanced coding block 8 5 2,902,904,1 1 04 comparator 1102 interposer 1 502,1 504,1 506,1 508 area
-49--49-
Claims (1)
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US10/188,277 US6859204B2 (en) | 2002-07-01 | 2002-07-01 | Dynamic threshold system for multiple raster content (MRC) representation of documents |
| US10/188,157 US6987882B2 (en) | 2002-07-01 | 2002-07-01 | Separation system for Multiple Raster Content (MRC) representation of documents |
| US10/188,249 US7031518B2 (en) | 2002-07-01 | 2002-07-01 | Segmentation method and system for Multiple Raster Content (MRC) representation of documents |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| TW200523817A TW200523817A (en) | 2005-07-16 |
| TWI331306B true TWI331306B (en) | 2010-10-01 |
Family
ID=45074640
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| TW93100002A TWI331306B (en) | 2002-07-01 | 2004-01-02 | Method and system for separating an image signal into a set of image planes, machine accessible medium and method and system for dynamically thresholding an image signal |
Country Status (1)
| Country | Link |
|---|---|
| TW (1) | TWI331306B (en) |
-
2004
- 2004-01-02 TW TW93100002A patent/TWI331306B/en not_active IP Right Cessation
Also Published As
| Publication number | Publication date |
|---|---|
| TW200523817A (en) | 2005-07-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6987882B2 (en) | Separation system for Multiple Raster Content (MRC) representation of documents | |
| CA2433307C (en) | Segmentation method and system for multiple raster content (mrc) representation of documents | |
| EP0863484B1 (en) | Image processing method and apparatus | |
| US6859204B2 (en) | Dynamic threshold system for multiple raster content (MRC) representation of documents | |
| US7242802B2 (en) | Segmentation method and system for Multiple Raster Content (MRC) representation of documents | |
| JP3868654B2 (en) | Image processing device | |
| JP4907060B2 (en) | Priority PDL segmentation to generate a 2-bit selector | |
| EP1436980B1 (en) | Reduction of chromatic bleeding artifacts in images | |
| US7356183B2 (en) | Segmentation method and system for multiple raster content (MRC) representation of documents | |
| JP4226484B2 (en) | Method and system for improving weak selector signal of mixed raster signal | |
| US8111918B2 (en) | Segmentation for three-layer mixed raster content images | |
| US7269294B2 (en) | Foreground erosion method and system for Multiple Raster Content (MRC) representation of documents | |
| US7456982B2 (en) | Segmentation method and system for multiple raster content (MRC) representation of documents | |
| TWI331306B (en) | Method and system for separating an image signal into a set of image planes, machine accessible medium and method and system for dynamically thresholding an image signal | |
| JP5118171B2 (en) | Segmentation method and system for multi-raster content (MRC) representation of documents | |
| JP3914796B2 (en) | Image processing device | |
| JPH09270911A (en) | Image forming device | |
| JP2001257901A (en) | Image processing device | |
| JPH11355573A (en) | Image processing device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| MM4A | Annulment or lapse of patent due to non-payment of fees |