TWI245546B - Image binarization method - Google Patents

Image binarization method Download PDF

Info

Publication number
TWI245546B
TWI245546B TW93101106A TW93101106A TWI245546B TW I245546 B TWI245546 B TW I245546B TW 93101106 A TW93101106 A TW 93101106A TW 93101106 A TW93101106 A TW 93101106A TW I245546 B TWI245546 B TW I245546B
Authority
TW
Taiwan
Prior art keywords
value
cumulative
integer
equal
binarization
Prior art date
Application number
TW93101106A
Other languages
Chinese (zh)
Other versions
TW200526017A (en
Inventor
Quen-Zong Wu
Po-Shun Cheng
Original Assignee
Chunghwa Telecom Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chunghwa Telecom Co Ltd filed Critical Chunghwa Telecom Co Ltd
Priority to TW93101106A priority Critical patent/TWI245546B/en
Publication of TW200526017A publication Critical patent/TW200526017A/en
Application granted granted Critical
Publication of TWI245546B publication Critical patent/TWI245546B/en

Links

Landscapes

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

Abstract

The present invention relate s to an image binarization method, comprising: (1) drawing the cumulative histogram of the pixel values by calculating the appearances of all values of al pixels, where the horizontal axis of the cumulative histogram is a sequential arrangement of all the possible values of all pixels, and the vertical axis is the value less than or equal to the cumulative appearances of each value; (2) finding a value between the lowest value and the highest value so as to make the broken line made of the number of times of the appearances of the lowest value, the number of times of the cumulative appearances less than or equal to the value, and the number of times of the cumulative appearances less than or equal to the highest value approximate the cumulative histogram, and defining it the binarization threshold of the pixel value; and (3) converting the pixel value larger than the threshold into high value, and converting the pixel value les than or equal to the threshold into low value so as to obtain the binarized image.

Description

1245546 玖、發明說明: 【發明所屬之技術領域】 本發明係關於一種影像二值化方法,特別是可應用於影像處理系 統與圖形識別系統。 【先前技術】 按,先前技術對於像素數值的二值化,一般係計算所有像素之所 有數值的出現次數以繪出像素數值的柱狀圖(Histogram),該柱狀圖的 横轴是所有像素之所有可能數值由小到大依序排列,縱軸是對每_數 值的出現次數,再從柱狀圖中計算出欲將所有像素之運算結果二值化 所需的臨界值(Threshold),所以很容易因柱狀圖上下起落無跡可循而 無法找到合適之臨界值以致二值化效果不佳而影響影像處理與圖形識 別的準確性。 本案發明人有鑑於上述先前技術於實際施用時的缺失,且積累個 人從事相關產業開發實務上多年之經驗,精心研究,終於研發出一種 影像二值化方法。 【發明内容】 爰是,本發明之主要目的,旨在提供一種影像二值化方法,而可 獲得較佳之影像二值化效果。 本毛明主要係δ十鼻所有像素之所有數值的出現次數以繪出像素數 值的累積柱狀圖(Cumulative histogram),並從累積柱狀圖中計算出 將所有像素數值二值化所需的臨界值(Threshold);因為累積柱狀圖係 呈遞增上升狀態而不會有一般柱狀圖上下起落無跡可循的現象,較易 計算出欲將所有像素之數值二值化所需的臨界值,本發明以逼近法獲 得累積柱狀圖遞增上升轉折或趨緩最明顯的一處做為二值化的臨界 值,可得到較佳的二值化結果。 【實施方式】 级為便於貴審查委員能更進一步對本發明之構造、使用及其特 徵有更深-層,明確、詳實的認識與瞭解,發明人舉出較佳之實施例,1245546 发明 Description of the invention: [Technical field to which the invention belongs] The present invention relates to an image binarization method, and is particularly applicable to image processing systems and pattern recognition systems. [Prior art] According to the prior art, for the binarization of pixel values, the number of occurrences of all values of all pixels is generally calculated to draw a histogram of pixel values. The horizontal axis of the histogram is all pixels. All possible values are arranged in order from small to large. The vertical axis is the number of occurrences of each value. Then the threshold value (Threshold) required to binarize the operation results of all pixels is calculated from the histogram. Therefore, it is easy to affect the accuracy of image processing and pattern recognition because the histogram has no trace up and down and no suitable threshold value can be found, resulting in poor binarization effect. In view of the lack of the above-mentioned prior technology in actual application, the inventors of the present case have accumulated years of experience in the development of related industries, carefully researched, and finally developed an image binarization method. [Summary of the Invention] The main purpose of the present invention is to provide a method of image binarization, which can obtain better image binarization effect. This Maoming mainly refers to the number of occurrences of all the values of all the pixels in the delta ten nose to draw a cumulative histogram of the pixel values, and calculates the required binarization of all the pixel values from the cumulative histogram. Threshold; because the cumulative histogram is increasing, there is no phenomenon that the general histogram can go up and down without traces. It is easier to calculate the threshold required to binarize the values of all pixels. Value, the present invention uses the approximation method to obtain the most obvious one of the cumulative histogram with increasing ascending turning or slowing down as the critical value of binarization, which can obtain better binarization results. [Embodiment] In order for your review committee to further understand the structure, use, and characteristics of the present invention, a clear and detailed knowledge and understanding, the inventor has given a better embodiment,

Claims (1)

1245546 拾、申請專利範圍: 1. 一種影像二值化方法,主要包含以下步驟: 步驟一:將所有像素的數值調整成〇〜255,計算所有像素之所有數值 (〇~255)的出現次數以繪出像素數值的累積柱狀圖 histogram)’該累積柱狀圖的橫轴是所有像素之所有可能數值由小到大依 序排列,縱軸是對每一數值而言小於或等於該數值的累積出現次數; 步驟二:從1到254的所有整數中,計算並比較哪一個整數使得〇的出現 次數、小於或等於該整數的累積出現次數、小於或等於255的累積出現次 數三者所構成的線性折線最逼近累積柱狀圖,將此定為像素數值的二值化 臨界值; 步驟三:將大於臨界值的像素數值轉換成高值、小於或等於臨界值的像素 數值轉換成低值以得到二值化的影像。 2 ·如申請專利範圍第1項所述的影像二值化方法,其中該步驟二中〇、i 到254的某整數、255二者所構成之線性折線的每點座標定義為(i, Li) ’累積柱狀圖包絡線(Envel〇pe line)的每點座標定義為&⑴,則 1到254的整數中使得P &最小者即為像素數值的二值化臨界值。 3·如申請專利範圍第工項所述的影像二值化方法,其中該步驟二中〇、玉 到254的某-整數、255二者所構成之線性折線的每點座標定義為& Li),累積柱狀圖包絡線(Envel〇pe line)的每點座標定義為(i,阳,則 yfe-e)2 1到254的整數中使得,,最小者即為像素數值的二值化臨界值。 4· 一種影像一值化方法,主要包含以下步称·· 步驟- ·將所有像素的數侧整成0〜255,計算所有像素之所有數值 12455461245546 The scope of patent application: 1. An image binarization method, which mainly includes the following steps: Step 1: Adjust the values of all pixels to 0 ~ 255, and calculate the number of occurrences of all the values (0 ~ 255) of all pixels to Draw a cumulative histogram of pixel values (histogram) 'The horizontal axis of the cumulative histogram is that all possible values of all pixels are arranged in order from small to large, and the vertical axis is less than or equal to the value for each value Cumulative number of occurrences; Step 2: From all integers from 1 to 254, calculate and compare which integer makes the number of occurrences of 0, the cumulative number of occurrences less than or equal to the integer, and the cumulative number of occurrences less than or equal to 255. The formed linear polyline is closest to the cumulative histogram, and this is set as the binarization threshold of the pixel value. Step 3: Convert the pixel value greater than the threshold value to a high value, and the pixel value less than or equal to the threshold value to a low value. Value to get a binarized image. 2 · The image binarization method as described in item 1 of the scope of patent application, wherein the coordinates of each point of the linear polyline formed by 0, i, an integer of 254, and 255 in step 2 are defined as (i, Li ) 'Each point of the cumulative histogram envelope (EnvelOpe line) is defined as & ⑴, then the integer of 1 to 254 which makes P & the smallest is the binarization threshold of the pixel value. 3. The method of image binarization as described in the first item of the scope of patent application, wherein the coordinates of each point of the linear polyline formed by 0, a certain integer from yu to 254, and 255 in this step are defined as & Li ), The coordinate of each point of the cumulative histogram envelope line (EnvelOpe line) is defined as (i, yang, yfe-e) 2 In the integer from 1 to 254, the smallest is the binarization of the pixel value Critical value. 4 · An image value method, which mainly includes the following steps: · Steps-· Round the number side of all pixels to 0 ~ 255 and calculate all the values of all pixels 1245546 次數、小於或等於該整數的累積出現次數、 糸積出現百分比; 比較哪一個整數使得0的出現 小於或等於255的累積出現次 數三者所赋猶崎録逼㈣餘㈣,將歧雜讀朗二值化 臨界值; 步驟三:將大於臨界值的像素數值轉換成高值、小於或等於臨界值的像素 數值轉換成低值以得到二值化的影像。 5·如申請專利範圍第4項所述的影像二值化方法,其中該步驟二中〇、i 到254的某一整數、255三者所構成之線性折線的每點座標定義為(i Li),累積柱狀圖包絡線(Envelope line)的每點座標定義為(丨,Ei),則 η ΣΙΑ-尽I 1到254的整數中使得/ 最小者即為像素數值的二值化臨界值。 6·如申請專利範圍第4項所述的影像二值化方法,其中該步驟二中〇、1 到254的某一整數、255三者所構成之線性折線的每點座標定義為(i, Li),累積柱狀圖包絡線(Envelope line)的每點座標定義為(丨,Ei),則 Σ(υ)2 則1到254的整數中使得’ 最小者即為像素數值的二值化臨界The number of times, the cumulative number of occurrences less than or equal to the integer, and the percentage of the occurrence of the product; compare which integer makes the cumulative occurrences of 0 less than or equal to 255. The three are given by Yuzaki Records, and will read miscellaneously. Lang binarization threshold; step three: convert the pixel value greater than the threshold to a high value, and the pixel value less than or equal to the threshold to a low value to obtain a binarized image. 5. The image binarization method as described in item 4 of the scope of patent application, wherein the coordinates of each point of the linear polyline formed by three integers of 0, i to 254, and 255 in step 2 are defined as (i Li ), The coordinate of each point of the envelope line of the cumulative histogram (Envelope line) is defined as (丨, Ei), then η ΣΙΑ-the integer between 1 and 254, where the / minimum is the binarization threshold of the pixel value . 6. The image binarization method as described in item 4 of the scope of patent application, wherein the coordinates of each point of the linear polyline formed by three integers of 0, 1 to 254, and 255 in step 2 are defined as (i, Li), the coordinate of each point of the envelope line of the cumulative histogram (Envelope line) is defined as (丨, Ei), then Σ (υ) 2 is an integer from 1 to 254 such that 'the smallest is the binarization of the pixel value critical
TW93101106A 2004-01-16 2004-01-16 Image binarization method TWI245546B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW93101106A TWI245546B (en) 2004-01-16 2004-01-16 Image binarization method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW93101106A TWI245546B (en) 2004-01-16 2004-01-16 Image binarization method

Publications (2)

Publication Number Publication Date
TW200526017A TW200526017A (en) 2005-08-01
TWI245546B true TWI245546B (en) 2005-12-11

Family

ID=37190140

Family Applications (1)

Application Number Title Priority Date Filing Date
TW93101106A TWI245546B (en) 2004-01-16 2004-01-16 Image binarization method

Country Status (1)

Country Link
TW (1) TWI245546B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103366170B (en) * 2012-04-02 2018-02-06 周口师范学院 Image binaryzation processing unit and its method

Also Published As

Publication number Publication date
TW200526017A (en) 2005-08-01

Similar Documents

Publication Publication Date Title
CN105608454A (en) Text structure part detection neural network based text detection method and system
TW201405440A (en) Form recognition method and device
CN108830269B (en) A method for determining the width of the central axis of Manchu words
CN106643965B (en) Method for accurately identifying liquid level by utilizing template matching
CN102147863B (en) Method for locating and recognizing letters in network animation
CN104700412B (en) A computational method of visual saliency map
CN107169062A (en) A kind of time series symbol polymerization approximate representation method based on whole story distance
CN110766708B (en) Image comparison method based on contour similarity
CN103345743B (en) A kind of image partition method for battery tail end smart flaw detection
CN110189351A (en) A scratch image data augmentation method based on generative adversarial network
CN107369162B (en) Method and system for generating insulator candidate target area
CN111222507B (en) Automatic identification method for digital meter reading and computer readable storage medium
CN105139417A (en) Method for real-time multi-target tracking under video surveillance
CN106815833B (en) A kind of matching process suitable for IC package equipment deformable object
CN106447673A (en) Chip pin extraction method under non-uniform illumination condition
CN107203764B (en) Method and device for recognizing long microblog images
CN112396582A (en) Mask RCNN-based equalizing ring skew detection method
TWI245546B (en) Image binarization method
CN103810287A (en) Image classification method based on topic model with monitoring shared assembly
CN109409373A (en) A kind of character recognition method based on image procossing
CN108492345B (en) Data block dividing method based on scale transformation
CN109670070B (en) An Image Similarity Judgment Method Based on Double Hash
CN103366376B (en) A kind of image characteristic extracting method based on neighborhood dimensional variation
CN109685114B (en) Image similarity judgment method based on pre-screening method and PHash
CN116416598A (en) Traffic sign detection algorithm of lightweight SSD

Legal Events

Date Code Title Description
MM4A Annulment or lapse of patent due to non-payment of fees