EP1471456A2 - Method and apparatus for finding optimal threshold for image segmentation - Google Patents

Method and apparatus for finding optimal threshold for image segmentation Download PDF

Info

Publication number
EP1471456A2
EP1471456A2 EP20040252083 EP04252083A EP1471456A2 EP 1471456 A2 EP1471456 A2 EP 1471456A2 EP 20040252083 EP20040252083 EP 20040252083 EP 04252083 A EP04252083 A EP 04252083A EP 1471456 A2 EP1471456 A2 EP 1471456A2
Authority
EP
European Patent Office
Prior art keywords
value
gray level
entropy
max
minimum
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
EP20040252083
Other languages
German (de)
French (fr)
Other versions
EP1471456A3 (en
Inventor
Yong-Shik Shin
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Pantech Co Ltd
Original Assignee
Pantech 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 Pantech Co Ltd filed Critical Pantech Co Ltd
Publication of EP1471456A2 publication Critical patent/EP1471456A2/en
Publication of EP1471456A3 publication Critical patent/EP1471456A3/en
Ceased legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00Image analysis
    • G06T7/10Segmentation; Edge detection
    • G06T7/11Region-based segmentation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00Image analysis
    • G06T7/10Segmentation; Edge detection
    • G06T7/136Segmentation; Edge detection involving thresholding
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06VIMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V10/00Arrangements for image or video recognition or understanding
    • G06V10/20Image preprocessing
    • G06V10/28Quantising the image, e.g. histogram thresholding for discrimination between background and foreground patterns

Definitions

  • the present invention relates to a method and apparatus for finding a threshold for image segmentation; and, more particularly, to a method and apparatus for finding the optimal threshold for image segmentation in image recognition.
  • the optimal threshold can be found easily based on a bimodal type histogram distribution graph and in above case, it is located at a lowest point of histogram distribution curve. There are many methods introduced for finding the optimal threshold.
  • a first method is stochastic method to find the optimal threshold. That is, a histogram distribution of an image is assumed as the bimodal type and a gray level having the minimum sum of variance is select as the optimal threshold.
  • a second method finds the optimal threshold based on the Shannon entropy. A gray level having the minimum entropy is selected as the optimal threshold.
  • an object of the present invention to provide a method for effectively finding an optimal threshold for image segmentation of an image having multi thresholds by analyzing entropy characteristic of image based on a fixed point iteration and fuzzy entropy.
  • a method for finding a threshold value in image segmentation including the steps of: a) gaining histogram distribution of an image; b) computing entropy values corresponding to gray levels in the histogram; and c) gaining a minimum entropy value corresponding to the gray level as the threshold value by using a fixed point iteration FPI based on the computed entropy values.
  • a histogram distribution of an image is obtained at step 201.
  • Entropies of gray levels are computed at step S202.
  • a gray level of minimum entropy is gained by using the fixed point iteration (FPI) based on the computed entropy value at step S203.
  • the entropy of the gray level is computed by measuring fuzzy entropy of corresponding gray level.
  • fuzzy entropy is explained in detail.
  • an average gray level ⁇ 0 of a background can be expressed as following equation 2 and an average gray level ⁇ I of an object can be expressed as following equation 3.
  • the average gray levels ⁇ I and ⁇ o can be considered as target values of the threshold value T . That is, the fuzziness can be expressed as a difference between gray level of a pixel (x,y) and a gray level of a region including the corresponding gray level. Therefore, the difference of gray levels is smaller, as larger as the fuzziness is. Gray levels of all pixels in an image for a threshold T must have certain fuzziness either to an object or background.
  • the fuzziness of a pixel can be expressed as following equation.
  • a constant K is defined as G max -G min and the fuzziness is selected between 0.5 to 1.
  • Fig. 3 shows fuzziness according to the constant K .
  • fuzziness can be generally considered as a fuzziness of fuzzy set and there are various entropy-equations disclosed for computing fuzzy entropy. If the entropy equation of one independent variable is expanded to 2 dimensional image region then entropies of the image I can be expressed as following table 1.
  • a gray level of minimum entropy is obtained by using a fixed point iteration (FPI) method at step S203.
  • FPI fixed point iteration
  • Fig. 4 is a graph showing gray level distribution curve for obtaining a gray level of minimum entropy in accordance with a preferred embodiment of the present invention.
  • Fig. 5 is a flowchart for explaining the step S203 in Fig. 2 for gaining a gray level corresponding to the minimum entropy by using FPI in accordance with a preferred embodiment of the present invention.
  • step 501 possible optimal threshold values P i for obtaining a gray level of minimum entropy are obtained based on the graph of Fig. 4.
  • gray levels are sequentially obtained from left to right P i .
  • an optimal threshold of gray level having minimum entropy is obtained by comparing entropy values of gray levels of P i .
  • Fig. 6 is a flowchart for explaining step 501 of Fig. 5 in detail.
  • initial values of g min , g max , G min , G max , Pi and g cal are set as follows.
  • g min is set as possible minimum gray level by selecting a lowest value of a gray level distribution curve on Fig. 4
  • g max is set as possible maximum gray level by selecting a highest value of a gray level distribution curve on Fig. 4.
  • G max is set as equal to g max and G min is set as equal to g min .
  • P i is set to mid point of g max and g min as (g max + g min )/2.
  • g cal is set as equal to p i .
  • entropy values E (g min) , E (g max ) and E (g cal ) of g min , g max and g cal are computed.
  • E (g min ) is higher than E (g cal )
  • the value of g temp is changed to the value of g min and the value of g fix is set to G max at step 604.
  • new temporal values g temp and g fix are set as follows at step 604.
  • E(g min ) is equal or less than E (g cal )
  • the value of g temp is changed to the value of g max and the value of g fix is set to G min at step 605.
  • new temporal values g temp and g fix are set as follows at step 605.
  • g mid is computed by (g fix + g temp )/2 and E mid is computed by (E (g temp ) + E(g fix ))/2 at step 606.
  • p i+1 is computed by using a linear equation f with (g temp , 0) and (g mid , E(g mid )) and E i+1 is set to E (p i+1 ).
  • step 609 if there are identical two p i s, it is ended, and at step 610, if there are not identical two p i s, g temp is set to p i+1 and g cal is newly determined by (g temp +g fix )/2, E(g min ) is set to E i+1 and g temp is set to P i+1 .
  • steps 602 and 608 are ponderedly performed. For helping to understand steps for obtaining optimal threshold of Fig. 6, pseudo code is shown in below table.
  • the present invention can quickly find the optimal threshold value by analyzing entropy characteristic of image based on a segmentation completion condition and a fixed point iteration.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Multimedia (AREA)
  • Image Analysis (AREA)
  • Image Processing (AREA)
  • Facsimile Image Signal Circuits (AREA)

Abstract

A method and apparatus for finding the optimal threshold for image segmentation in image recognition is disclosed. The method includes the steps of: a) gaining histogram distribution of an image; b) computing entropy values corresponding to gray levels in the histogram; and c) gaining a minimum entropy value corresponding to the gray level as the threshold value by using a fixed point iteration FPI based on the computed entropy values.

Description

    Field of the Invention
  • The present invention relates to a method and apparatus for finding a threshold for image segmentation; and, more particularly, to a method and apparatus for finding the optimal threshold for image segmentation in image recognition.
  • Description of Related Arts
  • Generally, a process of finding the optimal threshold for the image segmentation is fundamental and important process in the image recognition. The process of recognition is necessary to distinguish an object from a background of an image.
  • The optimal threshold can be found easily based on a bimodal type histogram distribution graph and in above case, it is located at a lowest point of histogram distribution curve. There are many methods introduced for finding the optimal threshold.
  • A first method is stochastic method to find the optimal threshold. That is, a histogram distribution of an image is assumed as the bimodal type and a gray level having the minimum sum of variance is select as the optimal threshold. A second method finds the optimal threshold based on the Shannon entropy. A gray level having the minimum entropy is selected as the optimal threshold. There is also another method using fuzziness during computing entropy of image. This method selects a gray level having minimum fuzziness as the optimal threshold.
  • Fig. 1 is a flowchart explaining a conventional method for finding the optimal threshold. Referring to Fig. 1, at step S101, a histogram distribution of an image is computed. Entropies of all gray levels distributed in the histogram are computed at step S102. All computed entropies are compared one another and a gray level having the lowest entropy is selected at step 103. However, a process time of the conventional method is increased in proportion to a resolution of image and the number of entropies to be computed. Furthermore, in case of an image having multi thresholds, a condition of segmentation completion may not be computed by the conventional method.
  • Summary of the Invention
  • It is, therefore, an object of the present invention to provide a method for effectively finding an optimal threshold for image segmentation of an image having multi thresholds by analyzing entropy characteristic of image based on a fixed point iteration and fuzzy entropy.
  • In accordance with an aspect of the present invention, there is provided a method for finding a threshold value in image segmentation, the method including the steps of: a) gaining histogram distribution of an image; b) computing entropy values corresponding to gray levels in the histogram; and c) gaining a minimum entropy value corresponding to the gray level as the threshold value by using a fixed point iteration FPI based on the computed entropy values.
  • Brief Description of the Drawing(s)
  • The above and other objects and features of the present invention will become apparent from the following description of the preferred embodiments given in conjunction with the accompanying drawings, in which:
  • Fig. 1 is a flowchart explaining a conventional method for finding the optimal threshold;
  • Fig. 2 is a flowchart for explaining a method for finding the optimal threshold for image segmentation in accordance with a preferred embodiment of the present invention;
  • Fig. 3 is a graph showing a fuzziness according to a constant k in accordance with a preferred embodiment of the present invention;
  • Fig. 4 is a graph showing gray level distribution curve for obtaining a gray level of minimum entropy in accordance with a preferred embodiment of the present invention;
  • Fig. 5 is a flowchart for explaining the step S203 in Fig. 2 for gaining a gray level corresponding to the minimum entropy by using FPI in accordance with a preferred embodiment of the present invention; and
  • Fig. 6 is a flowchart for explaining step 501 of Fig. 5 in detail.
  • Detailed Description of the Invention
  • Other objects and aspects of the invention will become apparent from the following description of the embodiments with reference to the accompanying drawings, which is set forth hereinafter.
  • Fig. 2 is a flowchart for explaining a method for finding the optimal threshold for image segmentation in accordance with a preferred embodiment of the present invention.
  • Referring to Fig. 2, a histogram distribution of an image is obtained at step 201. Entropies of gray levels are computed at step S202. After computing entropy value at step S202, a gray level of minimum entropy is gained by using the fixed point iteration (FPI) based on the computed entropy value at step S203.
  • In the step S202, the entropy of the gray level is computed by measuring fuzzy entropy of corresponding gray level. Hereinafter, the computation of fuzzy entropy is explained in detail.
  • If there is an M x N size of image I having L gray levels, a gray level of pixel (x,y) is defined as I(x,y) and µ I (Ii,j ) represents fuzziness of gray scale of pixel (x,y). Therefore, the image I can be expressed as following equation. I = {(Iij, µ I (Iij ))}    , wherein 0 ≤ µI (Ii,j ) ≤ 1;i = 0,1,..., M-1; j = 0,1,..., N-1
  • If a gray level g has a frequency of generation h(g) in entire image I then an average gray level µ0 of a background can be expressed as following equation 2 and an average gray level µ I of an object can be expressed as following equation 3.
    Figure 00050001
    Figure 00050002
  • The average gray levels µI and µo can be considered as target values of the threshold value T. That is, the fuzziness can be expressed as a difference between gray level of a pixel (x,y) and a gray level of a region including the corresponding gray level. Therefore, the difference of gray levels is smaller, as larger as the fuzziness is. Gray levels of all pixels in an image for a threshold T must have certain fuzziness either to an object or background. The fuzziness of a pixel can be expressed as following equation.
    Figure 00060001
  • In a meantime, when a gray level of a certain pixel is included in a specific region, the fuzziness must to be more than 0.5 to a corresponding set. Therefore, a constant K is defined as Gmax-Gmin and the fuzziness is selected between 0.5 to 1. Fig. 3 shows fuzziness according to the constant K.
  • Also, fuzziness can be generally considered as a fuzziness of fuzzy set and there are various entropy-equations disclosed for computing fuzzy entropy. If the entropy equation of one independent variable is expanded to 2 dimensional image region then entropies of the image I can be expressed as following table 1.
    Figure 00070001
  • Specially, the absolute value of entropy is increased in a range of [0, 0.5] and the value of entropy is decreased in a region of [0.5, 1]. In a meantime, if fuzziness of all gray level included in the image are about 0.5 then entropy E(I) has 1 as the maximum value.
  • After obtaining entropy values at step S202, a gray level of minimum entropy is obtained by using a fixed point iteration (FPI) method at step S203.
  • Fig. 4 is a graph showing gray level distribution curve for obtaining a gray level of minimum entropy in accordance with a preferred embodiment of the present invention.
  • Referring to Fig. 4, obtaining a gray level of minimum entropy is explained hereinafter.
  • Fig. 5 is a flowchart for explaining the step S203 in Fig. 2 for gaining a gray level corresponding to the minimum entropy by using FPI in accordance with a preferred embodiment of the present invention.
  • At step 501, possible optimal threshold values Pi for obtaining a gray level of minimum entropy are obtained based on the graph of Fig. 4.
  • After obtaining the Pi, gray levels are sequentially obtained from left to right Pi.
  • At step 503, an optimal threshold of gray level having minimum entropy is obtained by comparing entropy values of gray levels of Pi.
  • Fig. 6 is a flowchart for explaining step 501 of Fig. 5 in detail.
  • Referring to Figs. 6 and, at step 601, initial values of gmin, gmax, Gmin, Gmax, Pi and gcal are set as follows. gmin is set as possible minimum gray level by selecting a lowest value of a gray level distribution curve on Fig. 4, and gmax is set as possible maximum gray level by selecting a highest value of a gray level distribution curve on Fig. 4. And Gmax is set as equal to gmax and Gmin is set as equal to gmin. Also, Pi is set to mid point of gmax and gmin as (gmax + gmin)/2.
  • Furthermore, gcal is set as equal to pi. After initializing initial values, at step 602, entropy values E (gmin), E (gmax) and E (gcal) of gmin, gmax and gcal are computed.
  • After computing entropy values E (gmin), E (gmax) and E(gcal), , E (gmin) and E (gmax) are compared at step 603.
  • If E (gmin) is higher than E (gcal), the value of gtemp is changed to the value of gmin and the value of gfix is set to Gmax at step 604. By changing values and not influencing to value of Gmax and Gmin, new temporal values gtemp and gfix are set as follows at step 604.
  • If E(gmin) is equal or less than E (gcal), the value of gtemp is changed to the value of gmax and the value of gfix is set to Gmin at step 605. By changing values and not influencing to value of Gmax and Gmin, new temporal values gtemp and gfix are set as follows at step 605.
  • After changing value of gtemp or gfix according to the comparison result and Pi is set to gmid, gmid is computed by (gfix + gtemp)/2 and Emid is computed by (E (gtemp) + E(gfix))/2 at step 606.
  • At step 607, pi+1 is computed by using a linear equation f with (gtemp, 0) and (gmid, E(gmid)) and Ei+1 is set to E (pi+1). The linear equation f is f(g) = ag+b.
  • After computing Pi+1, it is compared with any two of previous pi at step 608.
  • At step 609, if there are identical two pis, it is ended, and at step 610, if there are not identical two pis, gtemp is set to pi+1 and gcal is newly determined by (gtemp+gfix)/2, E(gmin) is set to Ei+1 and gtemp is set to Pi+1. After setting new value for gcal, steps 602 and 608 are reputedly performed. For helping to understand steps for obtaining optimal threshold of Fig. 6, pseudo code is shown in below table.
    Figure 00100001
    Figure 00110001
  • As mentioned above, the present invention can quickly find the optimal threshold value by analyzing entropy characteristic of image based on a segmentation completion condition and a fixed point iteration.
  • While the present invention has been described with respect to certain preferred embodiments, it will be apparent to those skilled in the art that various changes and modifications may be made without departing from the scope of the invention as defined in the following claims.

Claims (6)

  1. A method for finding a threshold value in image segmentation, the method comprising the steps of:
    a) gaining histogram distribution of an image;
    b) computing entropy values corresponding to gray levels in the histogram; and
    c) gaining a minimum entropy value corresponding to the gray level as the threshold value by using a fixed point iteration FPI based on the computed entropy values.
  2. A method as recited in claim 1, wherein the step c) includes the steps of:
    c-1) obtaining a plurality of possible optimal thresholds;
    c-2) obtaining entropy values of gray levels corresponding to the obtained possible optimal thresholds; and
    c-3) obtaining the threshold value by comparing entropy values and selecting minimum entropy value.
  3. A method as recited in claim 2, wherein each of the possible optimal thresholds is obtained by obtaining a value of possible maximum gray level having maximum entropy value, a value of possible minimum gray level having minimum entropy value and obtaining possible optimal threshold by adding two values of the possible maximum gray level and the possible minimum gray level and dividing the sum of addition by half.
  4. A method as recited in claim 3, wherein the possible optimal thresholds are obtained by changing one of the value of the possible maximum gray level and the value of the possible minimum gray level according to comparison of entropy values of the possible maximum gray level, the possible minimum gray level and obtained optimal threshold and by newly obtaining a possible optimal threshold based on the changed values of the possible maximum gray level and the value of the possible minimum gray level.
  5. A method as recited in claim 2. wherein the step c-1) includes the steps of:
    c-i) obtaining an initial possible optimal threshold, an initial possible maximum gray level having maximum entropy value and an initial possible minimum gray level having minimum entropy value by setting Gmin to have the initial possible minimum gray level, setting Gmax to have the initial possible maximum gray level, setting gmin and gmax to have identical values Gmin and Gmax, respectively for not influencing change of value of Gmin and Gmax, setting Pi to have the initial possible optima threshold by computing equation Pi =((gmin + gmax)/2) and setting gcal to have the identical value of Pi;
    c-ii) obtaining entropy values E (gmin) , E (gmax) and E(gcal) of gmin, gmax, and gcal;
    c-iii) comparing E(gmin) and E(gcal);
    c-iv) if E(gmin) is higher than E(gcal) as a result of comparison of step c-iii), changing the value of gmin to have the value of gcal and not changing the value of gmax by setting a value of gtemp to have the value of gmin and setting a value of gfix to have the value of Gmax;
    c-v) if E(gmin) is equal or less than E(gcal) as a result of comparison of step c-iii), changing the value of gmax to have the value of gcal and not changing the value of gmin by setting a value of gtemp to have the value of gmax and setting a value of gfix to have the value of Gmin;
    c-vi) obtaining new possible optimal threshold pi based on changed value of gmin and gmax by an equation as: Pi = (gfix + gtemp)/2;
    c-vii) obtaining pi+1 by using a linear equation f with (gtemp, 0), wherein the f is f(g)=ag+b, a = gtemp and b is 0 and by equation as pi+1 = f -1(E(pi)) ;
    c-viii) comparing pi+1 with previously obtained pis;
    c-ix) if there are not identical two Pis, determining next possible optimal threshold by setting gtemp to have the value of pi+1 and setting gcal to have a value of (gtemp + gfix)/2, and reputedly performing steps c-ii) to c-viii); and
    c-x) if there are identical any two Pis, selects the threshold value by comparing entropy values of corresponding Pis and selecting Pi having minimum entropy value as the threshold value.
  6. Apparatus for finding a threshold value in image segmentation, the said apparatus comprising:
    (a) means for gaining a histogram distribution of an image;
    (b) means for computing entropy values corresponding to grey levels in a histogram; and
    (c) means for gaining a minimum entropy value corresponding to a grey level as a threshold value; whereby the said minimum entropy value is gained by using a fixed point interaction based on computed entropy values.
EP04252083A 2003-04-21 2004-04-07 Method and apparatus for finding optimal threshold for image segmentation Ceased EP1471456A3 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR1020030025048A KR100553431B1 (en) 2003-04-21 2003-04-21 Method for concluding threshold for image division
KR2003025048 2003-04-21

Publications (2)

Publication Number Publication Date
EP1471456A2 true EP1471456A2 (en) 2004-10-27
EP1471456A3 EP1471456A3 (en) 2006-05-17

Family

ID=32960246

Family Applications (1)

Application Number Title Priority Date Filing Date
EP04252083A Ceased EP1471456A3 (en) 2003-04-21 2004-04-07 Method and apparatus for finding optimal threshold for image segmentation

Country Status (4)

Country Link
US (1) US7336826B2 (en)
EP (1) EP1471456A3 (en)
KR (1) KR100553431B1 (en)
CN (1) CN1540576A (en)

Families Citing this family (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100372361C (en) * 2005-03-16 2008-02-27 中国科学院沈阳自动化研究所 Extration method of real time floating threshold
US7512574B2 (en) * 2005-09-30 2009-03-31 International Business Machines Corporation Consistent histogram maintenance using query feedback
CN101029824B (en) * 2006-02-28 2011-10-26 东软集团股份有限公司 Method and apparatus for positioning vehicle based on characteristics
WO2008024081A1 (en) * 2006-08-24 2008-02-28 Agency For Science, Technology And Research Methods, apparatus and computer-readable media for image segmentation
CN101727656B (en) * 2008-10-31 2012-03-28 李德毅 Image segmenting method based on data field
TWI405145B (en) * 2008-11-20 2013-08-11 Ind Tech Res Inst Pixel region-based image segmentation method, system and machine-readable storage medium
KR101029217B1 (en) * 2009-10-01 2011-04-12 영남대학교 산학협력단 Method of generating inverse synthetic aperture radar image compensating rotational motion of target and apparatus thereof
CN102608162B (en) * 2012-02-20 2013-08-21 首都师范大学 Threshold segmentation method for ultrasonic infrared thermograph
CN103578095A (en) * 2012-07-24 2014-02-12 南京理工大学 Multi-threshold-value segmentation method based on gray level histogram
CN103065304B (en) * 2012-12-25 2015-02-11 北京农业信息技术研究中心 Two-dimensional fuzzy entropy based adhesive material partition method
CN104700416B (en) * 2015-03-23 2017-08-29 河海大学常州校区 The image segmentation threshold that view-based access control model understands determines method
CN106611417B (en) * 2015-10-20 2020-03-31 佳能株式会社 Method and device for classifying visual elements into foreground or background
CN107025651B (en) * 2017-04-25 2019-06-28 苏州德威尔卡光电技术有限公司 The determination method and device of laser cleaning energy
CN109657682B (en) * 2018-11-29 2022-02-11 国网河北省电力有限公司电力科学研究院 Electric energy representation number identification method based on deep neural network and multi-threshold soft segmentation
CN110827299B (en) * 2019-11-07 2022-12-09 陕西师范大学 Image segmentation method based on Harris eagle optimization algorithm
CN113888450A (en) 2020-07-02 2022-01-04 中强光电股份有限公司 Image segmentation method and electronic device
KR102638903B1 (en) * 2021-12-21 2024-02-22 공주대학교 산학협력단 Apparatus and method for vision analyzing surface fine abrasive particle of abrasive tool
CN114937055B (en) * 2022-03-31 2024-05-03 厦门市虹约产品设计有限公司 Image self-adaptive segmentation method and system based on artificial intelligence

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5671290A (en) * 1991-09-27 1997-09-23 E. I. Du Pont De Nemours And Company Method and system of separately identifying clumped homogeneous objects in an image

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2154169A1 (en) * 1993-01-19 1994-08-04 Pieter Vonk Cleaning composition
JPH07230549A (en) 1994-02-21 1995-08-29 Nec Corp Image processor and its method
JPH08235355A (en) 1995-02-28 1996-09-13 Minolta Co Ltd Picture processor
KR100505510B1 (en) 2000-04-19 2005-08-04 주식회사 디지트리얼테크놀로지 A Method of Region Adaptive Subband Image Coding

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5671290A (en) * 1991-09-27 1997-09-23 E. I. Du Pont De Nemours And Company Method and system of separately identifying clumped homogeneous objects in an image

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
CHENG H D ET AL: "Threshold selection based on fuzzy c-partition entropy approach - A Tutorial" PATTERN RECOGNITION, ELSEVIER, KIDLINGTON, GB, vol. 31, no. 7, 31 July 1998 (1998-07-31), pages 857-870, XP004130993 ISSN: 0031-3203 *
H. MAÎTRE: "Le Traitement des images" 2003, HERMÈS SCIENCE PUBLICATIONS , PARIS , XP002371384 * page 29 - page 32 * *
JOE D. HOFFMAN: "Numerical Methods for Enigneers and Scientists" 2001, MARCEL DEKKER, INC. , NEW YORK , XP002371385 * page 141 - page 144 * *
KAPUR J N ET AL: "A NEW METHOD FOR GRAY-LEVEL PICTURE THRESHOLDING USING THE ENTROPY OF THE HISTOGRAM" COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, ACADEMIC PRESS, DULUTH, MA, US, vol. 29, no. 3, 1 March 1985 (1985-03-01), pages 273-285, XP000566411 *
SAHOO P K ET AL: "SURVEY OF THRESHOLDING TECHNIQUES" COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, ACADEMIC PRESS, DULUTH, MA, US, vol. 41, no. 2, 1 February 1988 (1988-02-01), pages 233-260, XP000000250 *
XIPING LUO ET AL: "ICM method for multi-level thresholding using maximum entropy criterion" PROCEEDINGS OF ICIAP '99 - 10TH INTERNATIONAL CONFERENCE ON IMAGE ANALYSIS AND PROCESSING, VENICE, ITALY, 27 September 1999 (1999-09-27), XP002371391 *

Also Published As

Publication number Publication date
KR100553431B1 (en) 2006-02-20
EP1471456A3 (en) 2006-05-17
CN1540576A (en) 2004-10-27
KR20040091271A (en) 2004-10-28
US20040208367A1 (en) 2004-10-21
US7336826B2 (en) 2008-02-26

Similar Documents

Publication Publication Date Title
EP1471456A2 (en) Method and apparatus for finding optimal threshold for image segmentation
US7046850B2 (en) Image matching
JP4795473B2 (en) Image processing apparatus and control method thereof
CN115908154B (en) Video later-stage particle noise removing method based on image processing
CN109416749B (en) Image gray scale classification method and device and readable storage medium
EP0624981B1 (en) Motion vector detecting circuit
CN112215856A (en) Image segmentation threshold determination method and device, terminal and storage medium
US20050163380A1 (en) Method and apparatus for detecting the location and luminance transition range of slant image edges
JP5089797B2 (en) Image processing apparatus and control method thereof
US20050078884A1 (en) Method and apparatus for interpolating a digital image
JP2003162719A (en) Detection of pattern in digital image
US20060110038A1 (en) Image processing
US20100239019A1 (en) Post processing of motion vectors using sad for low bit rate video compression
US9106926B1 (en) Using double confirmation of motion vectors to determine occluded regions in images
JP2007157112A (en) Method for recognizing iris by utilizing analysis of cumulative sum basis transition and apparatus thereof
KR100548206B1 (en) Digital image processor and a method processing thereof
JP2006521740A (en) Motion vector determination method
US20150279039A1 (en) Object detecting apparatus and method
Quweider et al. Grey level reduction for segmentation, threshholding and binarisation of images based on optimal partitioning on an interval
JP7427398B2 (en) Image processing device, image processing method, image processing system and program
CN109285172B (en) Method, device and equipment for calculating straight line parameters in image and readable storage medium
EP1309185A1 (en) Image noise detection
KR20040015002A (en) Prioritizing in segment matching
KR20060121801A (en) Method of image compression for video decoding based on motion compensation
CN115909055A (en) High-dynamic SAR image angle inverse identification method

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL HR LT LV MK

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL HR LT LV MK

17P Request for examination filed

Effective date: 20061114

AKX Designation fees paid

Designated state(s): DE FR GB

17Q First examination report despatched

Effective date: 20070226

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20091215