Abstract
The influence of the scale of a fuzzy membership function used to fuzzify a histogram is analysed. It is shown that for a class of fuzzifying functions it is possible to indicate the limit for fuzzification, at which the mode of the histogram equals the mean of the data accumulated in it. The fuzzification functions for which this appears are: the quadratic function for aperiodic histograms and the cosine square function for periodic ones. The scaled and clipped versions of these functions can be used to control the degree of fuzzification belonging to the interval [0,1]. While the quadratic function is related to the widely known Huber-type clipped mean or the kernel function derived from the Epanechnikov kernel, the clipped cosine square seems to be less known. The indications for using strong or weak fuzzification, according to the value of the fuzzification degree, are justified by examples in two applications: classic Hough transform-based image registration and novel accumulation-based line detection. Typically, the weak fuzzification is recommended. The images used are related to simulation images from teleradiotherapy and to mammographic images.
Similar content being viewed by others
Notes
One reason why ζmax is only the simplified robustness measure is that just one arrangement of outliers is considered for a given ζ, not all the possible ones. Another obvious reason is that only two pairs of registered images will be considered. See [29] for details.
References
Hough PVC (1959) Machine analysis of bubble chamber pictures. In: Proceedings of the international conference on high energy accelerators and instrumentation, CERN
Hough PVC (1962) A method and means for recognizing complex patterns. US Patent 3,069,654
Duda RD, Hart PE (1972) Use of the Hough transform to detect lines and curves in pictures. Commun ACM 15:11–15
Merlin PM, Farber DJ (1975) A parallel mechanism for detecting curves in pictures. IEEE Trans Comput 24:96–98
Kimme C, Ballard D, Sklansky J (1975) Finding circles by an array of accumulators. Commun ACM 18(2):120–122
Sklansky J (1978) On the Hough technique for curve detection. IEEE Trans Comput 27:923–926
Maître H (1985) Un panorama de la transformation de Hough. Trait Signal 2(4):305–317
Illingworth J, Kittler J (1988) A survey of the Hough transform. Comp Vision Graph Image Process 44(1):87–116
Leavers VF (1993) Which Hough transform? CVGIP Image Underst 58:250–264
Aguado AS, Nixon MS, Montiel EM (1998) Parameterizing arbitrary shapes via Fourier descriptors for evidence-gathering extraction. Comput Vision Image Underst 69(2):202–211
Aguado AS, Montiel EM, Nixon MS (2000) Bias error analysis of the Generalised Hough Transform. J Math Imaging Vis 12(1):25–42
Grant MS, Nixon MS, Lewis PH (2002) Extracting moving shapes by evidence gathering. Pattern Recognit 35:1099–1114
Chmielewski L (2006) Detection of non-parametric lines by evidence accumulation: finding blood vessels in mammograms. In: Proceedings of international conference on computer vision and graphics ICCVG 2004, Warsaw, Poland, 22–24 September, 2004. Computational imaging and vision, vol 32. Springer, Berlin Heidelberg New York, pp 373–380
Chmielewski L (2005) Specification of the evidence accumulation-based line detection algorithm. In: Kurzyński M, Woźniak M, Puchała E et al (eds) Proceedings of international conference on computer recognition systems CORES 2005, Rydzyna, Poland, 22–25 May 2005. Volume of Advances in soft computing. Springer, Berlin Heidelberg New York, pp 355–362
Chmielewski L (2005) Scale and direction invariance of the evidence accumulation-based line detection algorithm. In Kurzyński M, Woźniak M, Puchała E et al (eds) Proceedings of international conference on computer recognition systems CORES 2005, Rydzyna, Poland, 22–25 May 2005. Volume of Advances in soft computing. Springer, Berlin Heidelberg New York, pp 363–370
Strauss O (1999) Use the Fuzzy Hough Transform towards reduction of the precision–uncertainty duality. Pattern Recognit 32:1911–1922
Cohen M, Toussaint G (1977) On the detection of structures in noisy pictures. Pattern Recognit 9:95–98
Van Veen T, Grœn F (1981) Discretization errors in the Hough transform. Pattern Recognit 14:137–145
O’Rourke J, Sloan K (1984) Dynamic quantization: two adaptive data structures for multidimensional space. IEEE Trans PAMI 3:266–288
Jolion J, Rozenfeld A (1989) A O(log n) pyramid Hough transform. Pattern Recognit Lett 9:343–349
Thrift P, Dunn S (1983) Approximating point-set images by line segments using a variance of the Hough transform. Comput Vis Graph Image Process 21:383–394
Han JH, Kóczy LT, Poston T (1994) Fuzzy Hough transform. Pattern Recognit Lett 15(7):649–658
Hampel FR, Ronchetii EM, Rousseeuw PJ, Stahel WA (1986) Robust statistics: the approach based on influence functions. Wiley, New York
Rousseeuw PJ, Leroy AM (1987) Robust regression and outlier detection. Wiley, New York
Huber PJ (2003) Robust statistics. Wiley, New York
Silverman BW (1986) Density estimation for statistics and data analysis. Chapman & Hall, London
Scott DW (1992) Multivariate density estimation: theory, practice, and visualization. Wiley, New York
Wand MP, Jones MC (1995) Density estimation for statistics and data analysis. Chapman & Hall, London
Meer P (2004) Robust techniques for computer vision. In: Medioni G, Kang SB (eds) Emerging topics in computer vision. Prentice-Hall, Englewood Cliffs, pp 107–190
Parzen E (1962) On estimation of a probability density function and mode. Ann Math Stat 33:1065–1076
Ratha NK, Karu K, Chen S, Jain AK (1996) A real-time matching system for large fingerprint databases. IEEE Trans PAMI 18(8):799–813. DOI 10.1109/34.531800
Zana F, Klein JC (1999) A multimodal registration algorithm of eye fundus images using vessels detection and Hough transform. IEEE Trans Med Imaging 18(5):419–428. DOI 10.1109/42.774169
Seedahmed G, Martucci L (2002) Automatic image registration using Geometrically Invariant Parameter Space Clustering (GIPSC). In: Proceedings of ISPRS Commission III symposium on photogrammetric computer vision, Graz, Austria, 9–13 September 2002, pp A318–A323
Chmielewski L (2004) Choice of the Hough transform for image registration. In: Nowakowski A, Kosmowski BB (eds) Optical methods, sensors, image processing, and visualization in medicine. Proc SPIE, vol 5505, pp 122–134. DOI 10.1117/12.577912
Mardia KV (1972) Statistics of directional data. Academic, London
Zwiggelaar R, Parr TC, Schumm JE et al (1999) Model-based detection of spiculated lesions in mammograms. Med Image Anal 3(1):39–62
Liu S, Babbs CF, Delp EJ (2001) Multiresolution detection of spiculated lesions in digital mammograms. IEEE Trans Image Process 10(6):874–884
Kegelmeyer WP, Pruneda JM, Bourland PD et al. (1994) Computer-aided mammographic screening for spiculated lesions. Radiology 191:331–337
Kälviäinen H, Hirvonen P, Erkki O (1995) Probabilistic and non-probabilistic Hough transforms: overview and comparisons. Image Vis Comput 13(4):239–252
Gottesfeld Brown L (1992) A survey of image registration techniques. ACM Comput Surv 24(4):325–376
van den Elsen PA, Pol EJD, Viergever MA (1993) Medical image matching—a review with classification. IEEE Eng Med Biol 3:26–39
Lester H, Arrige SR (1999) A survey of hierarchical non-linear medical image registration. Pattern Recognit 32:129–149
Kozińska D, Chmielewski L (2003) Image registration and multimodal data integration (in Polish). In: Chmielewski L, Kulikowski JL, Nowakowski A (eds) Biomedical imaging (in Polish). Akademicka Oficyna Wydawnicza EXIT, Warsaw, pp 127–164
Gilhuijs KGA, van Herk M (1993) Automatic on-line inspection of patient setup in radiation therapy using digital portal images. Med Phys 20(3):667–677
Gilhuijs KGA, El-Gayed AAH, van Herk M, Vijlbrief RE (1993) An algorithm for automatic analysis of portal images: clinical evaluation for prostate treatments. Radiother Oncol 29:261–268
Eilertsen K, Skretting A, Tennvassas TL (1994) Methods for fully automated verification of patient set-up in external beam radiotherapy with polygon shaped fields. Phys Med Biol 39:993–1012
Cai J, Zhou S-Q, Hopkinson J, Saxena AV, Chu J (1996) Alignment of multi-segmented anatomical features from radiation therapy images by using least squares fitting. Med Phys 23(13):2069–2075
Cai J, Chu JCH, Saxena A, Lanzl LH (1998) A simple algorithm for planar image registration in radiation therapy. Med Phys 25(6):824–829
Giraud LM, Pouliot J, Maldague X, Zaccarin A (1998) Automatic setup deviation measurements with electronic portal images for pelvic fields. Med Phys 25(7):1180–1185
Bansal R, Staib LH, Chen Z et al (1998) A novel approach for the registration of 2D portal and 3D CT images for treatment setup verification in radiotherapy. In: Proceedings of 1st international conference on medical image computing and computer-assisted intervention MICCAI 98, Cambridge, Massachusetts, 11–13 October 1998. LNCS, vol 1496. Springer, Berlin Heidelberg New York, pp 1075–1086
Dekker N, Ploeger LS, van Herk M (2001) Evaluation of cost functions for gray value matching of 2D images in radiotherapy. In: Proceedings of 4th international conference on medical image computing and computer-assisted intervention MICCAI 01, Utrecht, The Netherlands, 14–17 October 2001. LNCS, vol 2208. Springer, Berlin Heidelberg New York, pp 1354–1355
Gut P, Chmielewski L, Kukołowicz P, Dabrowski A (2001) Edge-based robust image registration for incomplete and partly erroneous data. In: Proceedings of 9th international conference on computer analysis of images and patterns CAIP 2001, Warsaw, Poland, 5–8 September 2001. LNCS, vol 2124. Springer, Berlin Heidelberg New York, pp 309–316
Chmielewski L, Gut P, Kukołowicz PF, Dabrowski A (2002) Robust feature-based image registration using modified Hausdorff distance measure with the evolving quantile rank. In: Leberl F, Ferko A (eds) Proceedings of east–west vision EWV’02, Graz, Austria, 12–13 September 2002. Austrian Computer Society, pp 23–28
Chmielewski L, Kukołowicz PF, Gut P, Dabrowski A (2002) Assessment of the quality of radiotherapy with the use of portal and simulation images—the method and the software. J Med Inf Technol 3:MI-171–MI-179
Craig T, Sharpe M, Haycocks T et al (2003) Comparison of correction protocols for image-guided radiation therapy. In: Proceedings of 5th international conference on medical image computing and computer-assisted intervention MICCAI 03, Montréal, Canada, 15–18 November 2003. LNCS, vol 2879. Springer, Berlin Heidelberg New York, pp 264–270
Suckling J, Parker J, Dance D et al (1994) The Mammographic Images Analysis Society digital mammogram database. In: Gale AG, Astley SM, Dance DR et al (eds) Digital mammography. Exerpta medica international congress series, vol 1069, pp 375–378. http://www.wiau.man.ac.uk/services/MIAS/MIASweb.html
Whittaker ET, Watson GN (1958) A course of modern analysis, 4th edn. Cambridge University Press, Cambridge
Acknowledgments
The research was financed by the Ministry of Education and Science as the research project no. 3 T11C 050 29 in 2005–2008.
Author information
Authors and Affiliations
Corresponding author
Proofs of the properties
Proofs of the properties
The proofs of the properties presented in the paper are simple and consist solely in straightforward transformations; nevertheless, they seem necessary to justify the statements made.
Proof (of Property 1: Quadratic fuzzifying function) The fuzzifying function according to (9) is convex in the real interval [i min,i max], so (11) has a unique maximum when
Substituting (9) and expanding, one gets
which holds when
This is the formula for the mean of the histogram. □
Proof (of Property 2: Symmetrical fuzzifying function) If the function μ(x), x∈X, X ≡ [i min − i max, i max − i min] can be expanded into a Maclaurin series (see, e.g. [57]), then
or, using an explicit form of the remainder and substituting f(0) = 1, f′(0) = 0 due to the presence of a maximum
All the even-order derivatives are zero for x = 0 due to symmetry. Note (Fig. 4) that in application to the fuzzification of a histogram, X is the domain of f(x) and also the interval to which the real expression θ x belongs. If the derivative f (4)(·) is bounded, i.e.
where κ = θ x, then it is possible to indicate the value of the scale parameter s = s 4 for which the remainder R 4 is arbitrarily small:
After elementary transformations the necessary condition is received:
Then, the membership function (15) is arbitrarily close to the quadratic function (9), with a = − f′′(0)/2!.
Similarly, it can be shown that the derivative of the function (15) is arbitrarily close to the derivative of the quadratic function for a sufficiently large value of s, if the fifth derivative f (5)(·) is bounded, i.e.
To do this it is necessary to differentiate the expression (41) with respect to x. The problem resolves to showing that it is possible to indicate a value of the parameter s = s 5 for which the derivative of the remainder ∂R 4/ ∂x is arbitrarily small:
The upper bound for x is x max, for θ is 1, for f (4)(κ) is c 4 by virtue of (42), and for f (5)(κ) is c 5 by virtue of (45). The moduli can be replaced by their arguments, as the estimations of both addends are positive. It can then be written
Finally, combining with condition (44), one gets
which ends the considerations. Boundedness of the fourth and fifth derivatives is equivalent to the continuity of the function up to the fourth derivative. □
Proof (of Properties 3: Cosine square fuzzifying function, and 4: Intensity of the fuzzy periodic histogram) In the proof the basic properties of the harmonics will be used.
Let us recall the formula (22) for the fuzzy histogram:
and for the fuzzifying function (20):
It holds that \(\cos^2(\beta) = (1/2) \cos (2\beta) + (1/2),\) so the function (49) can be rewritten as
In the process of accumulation, the multiplicative and additive constants change the values of the histogram elements so that these values are systematically affine transformed, which does not change the relations between them. At this point the requirement that the fuzzifying function as well as the histogram values must be non-negative is postponed. What has been called fuzzification can now be treated as mere convolution. In place of (49) the following function will be used:
and the convolution will be
By using the period ratio τ defined by (23) and recalling that ϕ(ξ) is linear in Ξ, one gets
This formulation is equivalent to the summation of harmonics, where H(i) are amplitudes, τ represents the constant frequency, and τϕ(i) represents phases, different for each summand. The sum of harmonics is a harmonic, so (53) can be written as
where the phases are
and the known formulae for addition of harmonics are
Having in mind (54), with the cosine function having the maximum at τϕ(ξ) = β, it can be easily seen that β is the angle measure of the mode of the histogram, and
where ξ(·) = ϕ−1(·).
Returning to the full form of the fuzzifying function (50), the formula (48) can be rewritten as
Finally, H fc(ξ) can be rewritten as
□
Rights and permissions
About this article
Cite this article
Chmielewski, L.J. Fuzzy histograms, weak fuzzification and accumulation of periodic quantities. Pattern Anal Applic 9, 189–210 (2006). https://doi.org/10.1007/s10044-006-0037-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10044-006-0037-7