# Grayscale area openings and closings, their efficient implementation and applications

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Proc. EURASIP Workshop on Mathematical Morphology and its Applications to Signal Processing, Barcelona, Spain, pp , May Grayscale area openings and closings, their efficient implementation and applications Luc Vincent Xerox Imaging Systems 9 Centennial Drive, Peabody MA 01960, USA Abstract The filter that removes from a binary image its connected components with area smaller than a parameter is called area opening. From a morphological perspective, this filter is an algebraic opening, and it can be extended to grayscale images. The properties of area openings and their dual area closings are recalled. In particular, it was proved in [13] that the area opening of parameter of an image I is the supremum of the grayscale images that are smaller than I and whose regional maxima are of area greater than or equal to. This theorem is at the basis of an efficient algorithm for computing grayscale area openings and closings. Its implementation involves scanning pixels in an order that depends both on their location and value. For this purpose, the use of pixel heaps is proposed. This data structure is shown to be both efficient and low in memory requirements. In addition, it can be used in the computation of various other complex morphological transforms. The use of these area openings and closings is illustrated on image filtering and segmentation tasks 1 Notations, Definitions In this paper, the binary images or sets under study are subsets of a connected compact set M IR 2 called the mask. Similarly, grayscale images are mappings from M to IR. For simplicity, only the 2-D case is considered here, but the notions and algorithms discussed generalize to arbitrary dimensions. By area is meant the Lebesgue measure in IR 2. B denotes the morphological opening with respect to structuring element B. Let us first recall the notion of connected openings [9, 10]: Definition 1 The connected opening C x (X) of a set X M at point x 2 M is the connected component of X containing x if x 2 X and ; otherwise. The area opening a can then be defined on subsets of M as follows [13]: Definition 2 (binary area opening) Let X M and 0. The area opening of parameter of X is given by a (X) =fx 2 X j Area(C x(x)) g: (1) Intuitively, if (X i ) i2i denote the connected components of X, a (X) is equal to the union of the X i s with area greater than or equal to : a (X) = [ fxi j i 2 I;Area(X i ) g: (2) An example of binary area opening is shown in Fig. 1. Note on this image that, by definition, the connected components of the original image are either removed, or entirely preserved. Figure 1: original image; binary area opening. Obviously, a is increasing, idempotent, and antiextensive. It is therefore an algebraic opening [6, 9, 10]. Its dual binary area closing can be defined as follows: Definition 3 The area closing of parameter 0 of X M is given by: a (X) =[a (XC )] C : where X C denotes the complement of X in M, i.e. the set M n X (n denoting the set difference operator). As the dual of the area opening, the area closing fills in the holes of X whose area is strictly smaller than the size parameter.

2 As shown in [13], the growth of these transformations makes it possible to extend them to grayscale images: Definition 4 (grayscale area opening) For a mapping f : M,! IR, the area opening a (f) is given by: or: ( a (f ))(x) =supfh f(x) j x 2 a (T h(f ))g; (3) ( a (f ))(x) =supfh f(x) j Area( x(t h (f))) g: In this definition, T h (f) stands for the threshold of f at value h, i.e: T h (f) =fx 2 M j f(x) hg: (4) In other words, to compute the area opening of f, the area openings a (T h(f)) of the thresholds T h (f ) of f are considered. Since a is increasing, Y X =) a (Y ) a(x). Thus, the fa (T h(f))g h2ir are a decreasing sequence of sets which by definition constitute the threshold sets of the transformed mapping a (f ). By duality, one similarly extends the concept of area closing to mappings from M to IR. These area openings and closings for grayscale images are typical examples of flat increasing mappings (also called stack mappings) [10]. Their geometric interpretation is relatively simple: unlike dynamics-based openings [2], which remove structures based on their contrast, grayscale area openings remove from an image all the light structures that are smaller than the size parameter, i.e., based on their area (number of pixels). Area closings have the same effect on dark structures. Theorem 8 below provides a more refined interpretation of this intuitive interpretation. Similarly, it can be proved that the area closing of parameter is equal to the infimum of all the closings with connected structuring elements of area greater than or equal to. In the discrete domain, any connected set of area greater than or equal to 2 IN contains a connected set of area equal to. The theorem can thus be made more specific as follows: Corollary 1 Let Z 2 be the discrete plane equipped with e.g., 4- or 8-connectivity. For X 2 Z 2 \ M and 2 IN, a (X) = [ fb (X)jB 2 Z 2 connected ; Area(B) =g: Theorem 5 is easily extended to grayscale as follow: Proposition 6 Let f : M,! IR, be an upper semicontinuous mapping [8, pp ]. The area opening of f is given by: a (f) = _ S2A S (f ): (6) A dual proposition can be stated for grayscale area closings. The previous proposition leads to a different understanding of area openings (respectively closings). As a maximum of openings with all possible connected elements of area greater than or equal to a given, it can be seen as adaptive: at every location, the (connected) structuring element adapts its shape [1] to the image structure so as to remove as little as possible (see Fig. 2). 2 Properties In this section, a completely different interpretation of area openings and closings is given. For more details, including proofs, refer to [13]. A well-known theorem by Matheron states that a translation-invariant algebraic opening is the supremum of all the morphological openings B that are smaller than or equal to [6]. In the particular case of area openings, a more precise characterization of these morphological openings can be given: Theorem 5 Denoting by A the class of the subsets of M which are connected and whose area is greater than or equal to, the following equation holds: a = [ B2A B : (5) Figure 2: Local shape of an adaptive structuring element when centered at the pixel shown in black in the left image. 3 Relation with Regional Extrema A third and more geometric interpretation of area openings is provided in this section (only openings are dealt with here, the dual case of the closings being easy to derive). Theorem 8 below is at the basis of the algorithm

3 proposed in section 4, so its proof will be given. Let usfirst recall the notion of maximum on a mapping [8, page 445]. Definition 7 Let f be an upper semi-continuous (u.s.c.) mapping from M to IR. A (regional) maximum of f at level h 2 IR is a connected component M of T h (f ) such that 8h 0 >h; T h 0 \ M = ;: (7) The following theorem can now be stated: Theorem 8 Let f be a u.s.c. mapping from M to IR, 0. Denoting M the class of the u.s.c. mappings g : M 7,! IR such that any maximum M of g is of area greater than or equal to, a (f) =supfg f j g 2M g: (8) Proof: Let g 2M, g f, andleth 2 IR. Let A be an arbitrary connected component of T h(g). Since g is u.s.c., A is a compact set and therefore, there exists x 2 A such that g(x) =maxfg(y) j y 2 Ag. Let h = g(x) 0 and B = C x(t h 0(g)). B is obviously a maximum of g at altitude h 0. Indeed, if there existed a y 2 B such that g(y) > h 0,we would have y 62 0 A (the maximal value of g on A is h), and thus A A [ B T h(g). Furthermore, A [ B is connected as the union of two connected sets with non-empty intersection, which would be in contradiction with the fact that A is a connected component of T h(g). B is therefore a maximum at altitude h 0 of g and B A. Since by hypothesis, Area(B), we therefore have Area(A). Thus, for every h 2 IR, (T a h(g)) = T h(g). Besides, T h(g) T h(f). Therefore, by growth of, a (T a h(g)) = T h(g) (T a h(f)). This being true for every threshold, we conclude that g (f). a Conversely, 8h 2 IR, any connected component A of T h((f)) a is of area. Thus, all the maxima of (f) a are of area. It follows that (f) a 2M and (antiextensivity) (f) a f, which completes the proof. ut 4 Computation of Area Openings and Closings Computing area openings in binary images is a straightforward matter: after a labelling of the connected components, the histogram of the image provides the area of each of its components. The too small ones are then removed. However, things are rather more complicated in the grayscale case: Obviously, applying definition 2 and computing a (I) for every threshold of the original grayscale image I then piling up the resulting binary images is a much too computationally expensive operation. Furthermore, its time complexity increases exponentially with the number of bits per pixel::: Similarly, following proposition 6, the computation of all the possible openings with all the possible connected structuring elements with pixels becomes an impossible task as soon as is greater than 4 or 5. Indeed, the number of possible structuring elements becomes tremendous! Note however that an approximate algorithm based on such principles was proposed for 8 [1]. It is however stillvery slow, inaccurate and the constraint 8 does not leave area openings and closings enough punch for most applications. Instead, the algorithm introduced now is based on the third interpretation given for grayscale area openings, namely that formalized in theorem 8. The general principle of the proposed algorithm is to successively consider all the maxima m of the image; for each m, a local threshold around it is progressively lowered until its area becomes larger than the parameter. Inother words, an iso-intensity line is drawn around m and its intensity is decreased until the enclosed region is of area. Denoting by I be the original grayscale image, the successive steps of the proposed algorithm are as follows: Extract the regional maxima of I. For this step, refer to [14, 12, 2]). For each regional maximum m of I, do the following:, If the area of this maximum is larger than, go to the next maximum., Recursively scan the neighbors of m, indecreasing order of their gray value, until either of the following two condition is fulfilled:? the number of pixels scanned is larger than, Area(m)? the next pixel on the ordered list of pixels to be visited has a gray value larger than the gray-level of the current pixel., Give all the corresponding pixels of I (including pixels belonging to m) the gray value of the last pixel visited. In this algorithm, the second condition deals with the case of several (say n) regional maxima of I getting merged into one maximum of J (see Fig. 3a). In such cases, we avoid to scan this new maximum n times by preventing a scanning to proceed when it would lead to other maxima of I. This rule also correctly deals with the case of maxima of small area located next to a large and brighter area. Notice that in order for this method to work, the algorithm has to proceed in a sequential manner [12], i.e., modify the original image after the processing of each maximum! If the maxima of I were to be processed as above, but in a parallel fashion, then the

4 algorithm would have to be iterated until convergence in order to properly deal with hierarchically organized maxima of the kind of Fig. 3b λ Figure 3: set of maxima that get merged into one by area opening; hierarchy of maxima. The sensitive point of this implementation is the recursive ordered scanning of the neighbors of each maximum. Since the neighboring pixels of the current region have to be processed in decreasing order of gray-level, a simple queue of pixel pointers cannot be used [12]. One has to use a structure which keeps track of the priority level (i.e., gray-level) of each pixel. So-called hierarchical queues [7] constitute one approach, but have rather large memory requirements: for an image with M different gray-levels, one would have to allocate as much as M arrays of size, which is completely irrealistic for large values of and images with, say, 12 significant bits. Instead, we propose to use data structures that have classically been used in sorting and searching algorithms, namely priority queues or heaps [3]. A pixel heap is basically a balanced binary tree of pixel pointers which satisfies the heap condition: the grayscale value of any heap pixel is larger than the value of its children. Among other operations that can be performed on a heap, the operations of:, inserting a new pixel, removing the pixel with largest value can be executed in time O(log(N )), N being the number of elements in the heap. These two operations each involve the scanning of at most one full branch of the tree in order to preserve its balanced state as well as the heap condition. An example of insertion of a new element is shown in Fig. 4. In the present algorithm, the use of a pixel heap is particularly appropriate. Its memory requirements (array of pointers of size ) are negligible compared to what a hierarchical queue would need! Equally negligible is the speed gain provided by these queues. The heap implementation of the algorithm described above on a Sun Sparc Station 2 computes area openings of size 100 on a image in less than 3 seconds on average! Adapting it to area closings is a straightforward task. λ Figure 4: Insertion of a new pixel of value 7 in the pixel heap. Modified nodes are shown in gray. 5 Applications 5.1 Image filtering tasks It was mentioned earlier that area openings can be seen as morphological openings with structuring elements that adapt their shape to the underlying image structure. This clearly is important for some filtering tasks. Consider for example Fig. 5a, which is a microscopy image of a metallic alloy. It is corrupted by some black noise that one may wish to remove. In order to do so without damaging the inter-grain separating lines, a standard method consists of using a minimum of linear closings: one expects that the separating lines are straight enough that they will be preserved at least for one orientation of the linear structuring element. This operation is followed by a dual grayscale reconstruction [4, 14] that reconnects the inter-grains lines that may have been broken by the process. The result is shown in Fig. 5b. 9 Figure 5: Original image; minimum of linear closings followed by dual grayscale reconstruction. The problem with this method is that in order to assure a correct preservation of the separating lines, a large number of linear elements with different orientations may be needed. This increases the computational com-

5 plexity of the algorithm while still requiring that the inter-grains lines be straight enough in places. If these lines wiggle too much, they will also be removed. Both these speed and accuracy deficiencies can be addressed by using an area closing instead. An area closing of Fig. 5a is shown in Fig. 6a. At first sight, the difference between this image and Fig. 5b is not striking. However, a pixelwise algebraic difference of these images followed by a thresholding extracts the inter-grains zones that have been better preserved by the area closing. This shows that the adaptive structuring element of the area closing has played a decisive role. Notice in particular that the better preserved zones are mostly oriented in non vertical, horizontal or diagonal directions. Besides, the computation time of the area closing is far inferior to that of the closing-reconstruction. Figure 6: Area closing of Fig. 5a; zones where the area closing outperforms the closing-reconstruction. Another example of these useful filtering capabilities is shown in Fig Fig. 7a is a noisy image of fibers, where the black noise needs to be removed while preserving the fibers at best, even the thinnest ones. Once again, the filter that was experimentally found to be best suited for this task is an area closing (see Fig. 7b). It considerably simplifies the image, thus making the automatic extraction of its fibers easier. In summary, grayscale area openings and closings are particularly suited to filtering tasks where thin and elongated image structures have to be preserved. They can be applied in a relatively systematic fashion, are fast, and usually outperform more standard morphological filtering techniques. Moreover, as described in [13], they can be combined into other kinds of filters, like area Alternating Sequential Filters [8, 13]. In addition, area openings/closings yield filtered images that do not have the boxy look sometimes observed when using, e.g., openings/closings with squares: they have nice detailpreserving capabilities. 1 Image provided by Hugues Talbot, Ecole des Mines de Paris. Figure 7: Noisy image of fibers; area closing of. 5.2 Use of area openings and closings for image segmentation Just as with classic openings and closings, one can very well perform top-hats [8] with area openings and closings. This allows the straightforward extraction of small light or dark structures regardless of their shape. As an example, let us consider Fig. 8a, an angiographic image of eye blood vessels where microaneurisms have to be detected. The latter are: small and light disconnected from the network of the blood vessels, predominantly located on the dark areas of the image, i.e. here, the central region. The algebraic difference between an area opening (of size larger than any possible aneurism) and the original image itself can be called area top-hat and is is shown in Fig. 8b. The aneurisms are clearly visible in this image, and no blood vessel remain. Figure 8: Angiography of eye blood vessels with microaneurisms; area top-hat. Here, in order to finish the segmentation, more work is necessary: one has to account for the fact that aneurisms are primarily located in dark areas of the image. A solution to this is proposed in [13], and the aneurisms finally extracted are shown in Fig. 9.

6 References Figure 9: Extracted microaneurisms. 6 Conclusions In this paper, three different interpretations have been provided for the area opening (resp. closing) of parameter of a grayscale image I: definition as a flat mapping from the binary area opening supremum of all the morphological openings with connected structuring elements of area larger than or equal to the size parameter supremum of all the grayscale images that are smaller than I and whose regional maxima are of area greater than or equal to. While the first two interpretations do not translate into viable algorithms, the third one leads to a very efficient implementation of these transformations. The practical use of grayscale area openings and closings was reviewed on a few examples. These operations were shown to be particularly suited to the filtering of noisy images of thin and elongated structures like fibers. Moreover, they can be used for image segmentation via the proposed area top-hat. Last but not least, the use of a pixel heap for morphological algorithms was introduced. Pixel heaps are both efficient and low in terms of memory requirements. They allow to recursively scan the neighbors of a set of pixels with decreasing (resp. increasing) gray-level, and therefore play a key-role in the proposed area opening algorithm. They also lead to very efficient implementations of a good number of other grayscale morphological algorithms, like:, watersheds (algorithm derived from [15]), grayscale reconstruction [14], morphological dynamics [2], Euclidean skeletons and bisectors [11]. The description of these new methods will constitute the topics of future publication. [1] F. Cheng and A. Venetsanopoulos. Fast, adaptive morphological decomposition for image compression. In 25th Annual Conference on Information Sciences and Systems, pages 35 40, [2] M. Grimaud. A new measure of contrast: Dynamics. In SPIE Vol. 1769, Image Algebra and Morphological Image Processing III, pages , San Diego CA, July [3] D. E. Knuth. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, [4] C. Lantuéjoul and F. Maisonneuve. Geodesic methods in quantitative image analysis. Pattern Recognition, 17(2): , [5] P. Maragos and R. Schafer.Morphological filters part ii: their relations to median, order-statistics, and stack filters. IEEE Trans.on Acoustics, Speechand Signal Processing, 35(8): , Aug [6] G. Matheron. Random Sets and Integral Geometry. John Wiley and Sons, New York, [7] F. Meyer. Algorithme ordonné de ligne de partage des eaux. note, Ecole des Mines, CMM, [8] J. Serra. Image Analysis and Mathematical Morphology. Academic Press, London, [9] J. Serra, editor. Image Analysis and Mathematical Morphology, Volume 2: Theoretical Advances. Academic Press, London, [10] J. Serra and L. Vincent. An overview of morphological filtering. Circuits, Systems and Signal Processing, 11(1):47 108, Jan [11] H. Talbot and L. Vincent. Euclidean skeletons and conditional bisectors. In SPIE Vol. 1818, Visual Communications and Image Processing, pages , Boston, MA, Nov [12] L. Vincent. Morphological algorithms. In E. R. Dougherty, editor, Mathematical Morphology in Image Processing, pages Marcel-Dekker, Inc., New York, Sept [13] L. Vincent. Morphological area openings and closings for grayscale images. In NATO Shape in Picture Workshop,pages ,Driebergen, The Netherlands, Sept [14] L. Vincent. Morphological grayscale reconstruction in image analysis: Applications and efficient algorithms. IEEE Transactions on Image Processing, 2(2): , Apr [15] L. Vincent and P. Soille. Watersheds in digital spaces: an efficient algorithm based on immersion simulations. IEEE Trans. Pattern Anal. Machine Intell., 13(6): , June 1991.

### Market Stock Decisions Based on Morphological Filtering

Market Stock Decisions Based on Morphological Filtering Pere Marti-Puig, R. Reig-Bolaño, J. Bajo, and S. Rodriguez * Abstract. In this paper we use a nonlinear processing technique based on mathematical

### Face detection is a process of localizing and extracting the face region from the

Chapter 4 FACE NORMALIZATION 4.1 INTRODUCTION Face detection is a process of localizing and extracting the face region from the background. The detected face varies in rotation, brightness, size, etc.

### CS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992

CS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992 Original Lecture #6: 28 January 1991 Topics: Triangulating Simple Polygons

### Clustering & Visualization

Chapter 5 Clustering & Visualization Clustering in high-dimensional databases is an important problem and there are a number of different clustering paradigms which are applicable to high-dimensional data.

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### Structure of Measurable Sets

Structure of Measurable Sets In these notes we discuss the structure of Lebesgue measurable subsets of R from several different points of view. Along the way, we will see several alternative characterizations

### The Basics of Graphical Models

The Basics of Graphical Models David M. Blei Columbia University October 3, 2015 Introduction These notes follow Chapter 2 of An Introduction to Probabilistic Graphical Models by Michael Jordan. Many figures

### Morphological segmentation of histology cell images

Morphological segmentation of histology cell images A.Nedzved, S.Ablameyko, I.Pitas Institute of Engineering Cybernetics of the National Academy of Sciences Surganova, 6, 00 Minsk, Belarus E-mail abl@newman.bas-net.by

### An Efficient Implementation of Max Tree with Linked List and Hash Table

An Efficient Implementation of Max Tree with Linked List and Hash Table Xiaoqiang Huang, Mark Fisher, Dan Smith School of Computing Sciences, University of East Anglia, Norwich, NR4 7TJ, UK (xq.huang@uea.ac.uk,

### No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

### Jump-Miss Binary Erosion Algorithm

Jump-Miss Binary Erosion Algorithm Anderson Fraiha Machado and Ronaldo Fumio Hashimoto Institute of Mathematics and Statistics of University of Sao Paulo, SP, Brazil dandy@ime.usp.br and ronaldo@ime.usp.br

### Chapter 15 Introduction to Linear Programming

Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of

### Binary Image Analysis

Binary Image Analysis Segmentation produces homogenous regions each region has uniform gray-level each region is a binary image (0: background, 1: object or the reverse) more intensity values for overlapping

### Theorem 5. The composition of any two symmetries in a point is a translation. More precisely, S B S A = T 2

Isometries. Congruence mappings as isometries. The notion of isometry is a general notion commonly accepted in mathematics. It means a mapping which preserves distances. The word metric is a synonym to

### Analecta Vol. 8, No. 2 ISSN 2064-7964

EXPERIMENTAL APPLICATIONS OF ARTIFICIAL NEURAL NETWORKS IN ENGINEERING PROCESSING SYSTEM S. Dadvandipour Institute of Information Engineering, University of Miskolc, Egyetemváros, 3515, Miskolc, Hungary,

### Mathematics for Economics (Part I) Note 5: Convex Sets and Concave Functions

Natalia Lazzati Mathematics for Economics (Part I) Note 5: Convex Sets and Concave Functions Note 5 is based on Madden (1986, Ch. 1, 2, 4 and 7) and Simon and Blume (1994, Ch. 13 and 21). Concave functions

### An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

### Integrating Benders decomposition within Constraint Programming

Integrating Benders decomposition within Constraint Programming Hadrien Cambazard, Narendra Jussien email: {hcambaza,jussien}@emn.fr École des Mines de Nantes, LINA CNRS FRE 2729 4 rue Alfred Kastler BP

### Super-resolution method based on edge feature for high resolution imaging

Science Journal of Circuits, Systems and Signal Processing 2014; 3(6-1): 24-29 Published online December 26, 2014 (http://www.sciencepublishinggroup.com/j/cssp) doi: 10.11648/j.cssp.s.2014030601.14 ISSN:

### A New Robust Algorithm for Video Text Extraction

A New Robust Algorithm for Video Text Extraction Pattern Recognition, vol. 36, no. 6, June 2003 Edward K. Wong and Minya Chen School of Electrical Engineering and Computer Science Kyungpook National Univ.

### Course 221: Analysis Academic year , First Semester

Course 221: Analysis Academic year 2007-08, First Semester David R. Wilkins Copyright c David R. Wilkins 1989 2007 Contents 1 Basic Theorems of Real Analysis 1 1.1 The Least Upper Bound Principle................

### Sets and functions. {x R : x > 0}.

Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.

### 5. Binary objects labeling

Image Processing - Laboratory 5: Binary objects labeling 1 5. Binary objects labeling 5.1. Introduction In this laboratory an object labeling algorithm which allows you to label distinct objects from a

Tracking Moving Objects In Video Sequences Yiwei Wang, Robert E. Van Dyck, and John F. Doherty Department of Electrical Engineering The Pennsylvania State University University Park, PA16802 Abstract{Object

### A Note on Maximum Independent Sets in Rectangle Intersection Graphs

A Note on Maximum Independent Sets in Rectangle Intersection Graphs Timothy M. Chan School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1, Canada tmchan@uwaterloo.ca September 12,

### SUPERVISED AUTOMATIC HISTOGRAM CLUSTERING AND WATERSHED SEGMENTATION. APPLICATION TO MICROSCOPIC MEDICAL COLOR IMAGES

Image Anal Stereol 2003;22:113-120 Original Research Paper SUPERVISED AUTOMATIC HISTOGRAM CLUSTERING AND WATERSHED SEGMENTATION. APPLICATION TO MICROSCOPIC MEDICAL COLOR IMAGES OLIVIER LEZORAY LUSAC EA

### Monotone Partitioning. Polygon Partitioning. Monotone polygons. Monotone polygons. Monotone Partitioning. ! Define monotonicity

Monotone Partitioning! Define monotonicity Polygon Partitioning Monotone Partitioning! Triangulate monotone polygons in linear time! Partition a polygon into monotone pieces Monotone polygons! Definition

Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650

### By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

This material is posted here with permission of the IEEE Such permission of the IEEE does not in any way imply IEEE endorsement of any of Helsinki University of Technology's products or services Internal

### 24. The Branch and Bound Method

24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no

### Binary Image Scanning Algorithm for Cane Segmentation

Binary Image Scanning Algorithm for Cane Segmentation Ricardo D. C. Marin Department of Computer Science University Of Canterbury Canterbury, Christchurch ricardo.castanedamarin@pg.canterbury.ac.nz Tom

### Support Vector Machines with Clustering for Training with Very Large Datasets

Support Vector Machines with Clustering for Training with Very Large Datasets Theodoros Evgeniou Technology Management INSEAD Bd de Constance, Fontainebleau 77300, France theodoros.evgeniou@insead.fr Massimiliano

### Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization

Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative

### ON FIBER DIAMETERS OF CONTINUOUS MAPS

ON FIBER DIAMETERS OF CONTINUOUS MAPS PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Abstract. We present a surprisingly short proof that for any continuous map f : R n R m, if n > m, then there

### High School Algebra 1 Common Core Standards & Learning Targets

High School Algebra 1 Common Core Standards & Learning Targets Unit 1: Relationships between Quantities and Reasoning with Equations CCS Standards: Quantities N-Q.1. Use units as a way to understand problems

### Threshold Logic. 2.1 Networks of functions

2 Threshold Logic 2. Networks of functions We deal in this chapter with the simplest kind of computing units used to build artificial neural networks. These computing elements are a generalization of the

### Planar Tree Transformation: Results and Counterexample

Planar Tree Transformation: Results and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen s University Kingston, Ontario, Canada K7L 3N6 Abstract We consider the problem

### d(f(g(p )), f(g(q))) = d(g(p ), g(q)) = d(p, Q).

10.2. (continued) As we did in Example 5, we may compose any two isometries f and g to obtain new mappings f g: E E, (f g)(p ) = f(g(p )), g f: E E, (g f)(p ) = g(f(p )). These are both isometries, the

### Canny Edge Detection

Canny Edge Detection 09gr820 March 23, 2009 1 Introduction The purpose of edge detection in general is to significantly reduce the amount of data in an image, while preserving the structural properties

### Ch9 Morphological Image Processing

Ch9 Morphological Image Processing 9.1 Preliminaries 9.1.1 Some Basic Concepts form Set Theory If every element of a set A is also an element of another set B, then A is said to be a subset of B, denoted

### Convex analysis and profit/cost/support functions

CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m

### Automated System for Computationof Burnt Forest Region using Image Processing

International Journal of Computer Sciences and Engineering Open Access Research Paper Volume-4, Special Issue-1 E-ISSN: 2347-2693 Automated System for Computationof Burnt Forest Region using Image Processing

### Modelling, Extraction and Description of Intrinsic Cues of High Resolution Satellite Images: Independent Component Analysis based approaches

Modelling, Extraction and Description of Intrinsic Cues of High Resolution Satellite Images: Independent Component Analysis based approaches PhD Thesis by Payam Birjandi Director: Prof. Mihai Datcu Problematic

### Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### 15.062 Data Mining: Algorithms and Applications Matrix Math Review

.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

### Euler Vector: A Combinatorial Signature for Gray-Tone Images

Euler Vector: A Combinatorial Signature for Gray-Tone Images Arijit Bishnu, Bhargab B. Bhattacharya y, Malay K. Kundu, C. A. Murthy fbishnu t, bhargab, malay, murthyg@isical.ac.in Indian Statistical Institute,

### METHODS TO ESTIMATE AREAS AND PERIMETERS OF BLOB-LIKE OBJECTS: A COMPARISON

MVA'94 IAPR Workshop on Machine Vision Applications Dec. 13-1 5, 1994, Kawasaki METHODS TO ESTIMATE AREAS AND PERIMETERS OF BLOB-LIKE OBJECTS: A COMPARISON Luren Yang, Fritz Albregtsen, Tor Lgnnestad and

### Arrangements And Duality

Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,

### Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

### IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING 1 0196-2892/\$26.00 2010 IEEE

IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING 1 Morphological Attribute Profiles for the Analysis of Very High Resolution Images Mauro Dalla Mura, Student Member, IEEE, Jón Atli Benediktsson, Fellow,

### Section 3.7. Rolle s Theorem and the Mean Value Theorem. Difference Equations to Differential Equations

Difference Equations to Differential Equations Section.7 Rolle s Theorem and the Mean Value Theorem The two theorems which are at the heart of this section draw connections between the instantaneous rate

### Section 1.1. Introduction to R n

The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to

### Combining an Alternating Sequential Filter (ASF) and Curvelet for Denoising Coronal MRI Images

Contemporary Engineering Sciences, Vol. 5, 2012, no. 2, 85-90 Combining an Alternating Sequential Filter (ASF) and Curvelet for Denoising Coronal MRI Images Mohamed Ali HAMDI Ecole Nationale d Ingénieur

### Topology and Convergence by: Daniel Glasscock, May 2012

Topology and Convergence by: Daniel Glasscock, May 2012 These notes grew out of a talk I gave at The Ohio State University. The primary reference is [1]. A possible error in the proof of Theorem 1 in [1]

### MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem

MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, and

### Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1

Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing

### A Direct Numerical Method for Observability Analysis

IEEE TRANSACTIONS ON POWER SYSTEMS, VOL 15, NO 2, MAY 2000 625 A Direct Numerical Method for Observability Analysis Bei Gou and Ali Abur, Senior Member, IEEE Abstract This paper presents an algebraic method

### Image Processing with. ImageJ. Biology. Imaging

Image Processing with ImageJ 1. Spatial filters Outlines background correction image denoising edges detection 2. Fourier domain filtering correction of periodic artefacts 3. Binary operations masks morphological

### Face Recognition using Principle Component Analysis

Face Recognition using Principle Component Analysis Kyungnam Kim Department of Computer Science University of Maryland, College Park MD 20742, USA Summary This is the summary of the basic idea about PCA

### Two General Methods to Reduce Delay and Change of Enumeration Algorithms

ISSN 1346-5597 NII Technical Report Two General Methods to Reduce Delay and Change of Enumeration Algorithms Takeaki Uno NII-2003-004E Apr.2003 Two General Methods to Reduce Delay and Change of Enumeration

### Methodology for Emulating Self Organizing Maps for Visualization of Large Datasets

Methodology for Emulating Self Organizing Maps for Visualization of Large Datasets Macario O. Cordel II and Arnulfo P. Azcarraga College of Computer Studies *Corresponding Author: macario.cordel@dlsu.edu.ph

### FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM

International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT

### Categorical Data Visualization and Clustering Using Subjective Factors

Categorical Data Visualization and Clustering Using Subjective Factors Chia-Hui Chang and Zhi-Kai Ding Department of Computer Science and Information Engineering, National Central University, Chung-Li,

### Metric Spaces. Chapter 1

Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence

### Tree-representation of set families and applications to combinatorial decompositions

Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### An Adaptive Index Structure for High-Dimensional Similarity Search

An Adaptive Index Structure for High-Dimensional Similarity Search Abstract A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with

### Compact Representations and Approximations for Compuation in Games

Compact Representations and Approximations for Compuation in Games Kevin Swersky April 23, 2008 Abstract Compact representations have recently been developed as a way of both encoding the strategic interactions

### Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

### The Application of Association Rule Mining in CRM Based on Formal Concept Analysis

The Application of Association Rule Mining in CRM Based on Formal Concept Analysis HongSheng Xu * and Lan Wang College of Information Technology, Luoyang Normal University, Luoyang, 471022, China xhs_ls@sina.com

### Metric Spaces. Chapter 7. 7.1. Metrics

Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

### Advanced Image Compression on the Basis of Fuzzy Transforms

University of Ostrava Institute for Research and Applications of Fuzzy Modeling Advanced Image Compression on the Basis of Fuzzy Transforms Irina Perfilieva, Viktor Pavliska, Marek Vajgl, Bernard De Baets

### HSI BASED COLOUR IMAGE EQUALIZATION USING ITERATIVE n th ROOT AND n th POWER

HSI BASED COLOUR IMAGE EQUALIZATION USING ITERATIVE n th ROOT AND n th POWER Gholamreza Anbarjafari icv Group, IMS Lab, Institute of Technology, University of Tartu, Tartu 50411, Estonia sjafari@ut.ee

### PowerTeaching i3: Algebra I Mathematics

PowerTeaching i3: Algebra I Mathematics Alignment to the Common Core State Standards for Mathematics Standards for Mathematical Practice and Standards for Mathematical Content for Algebra I Key Ideas and

### Thresholding technique with adaptive window selection for uneven lighting image

Pattern Recognition Letters 26 (2005) 801 808 wwwelseviercom/locate/patrec Thresholding technique with adaptive window selection for uneven lighting image Qingming Huang a, *, Wen Gao a, Wenjian Cai b

### A Method of Caption Detection in News Video

3rd International Conference on Multimedia Technology(ICMT 3) A Method of Caption Detection in News Video He HUANG, Ping SHI Abstract. News video is one of the most important media for people to get information.

### Determining optimal window size for texture feature extraction methods

IX Spanish Symposium on Pattern Recognition and Image Analysis, Castellon, Spain, May 2001, vol.2, 237-242, ISBN: 84-8021-351-5. Determining optimal window size for texture feature extraction methods Domènec

### Overview of Math Standards

Algebra 2 Welcome to math curriculum design maps for Manhattan- Ogden USD 383, striving to produce learners who are: Effective Communicators who clearly express ideas and effectively communicate with diverse

### The Role of Size Normalization on the Recognition Rate of Handwritten Numerals

The Role of Size Normalization on the Recognition Rate of Handwritten Numerals Chun Lei He, Ping Zhang, Jianxiong Dong, Ching Y. Suen, Tien D. Bui Centre for Pattern Recognition and Machine Intelligence,

### Social Media Mining. Data Mining Essentials

Introduction Data production rate has been increased dramatically (Big Data) and we are able store much more data than before E.g., purchase data, social media data, mobile phone data Businesses and customers

### A Learning Based Method for Super-Resolution of Low Resolution Images

A Learning Based Method for Super-Resolution of Low Resolution Images Emre Ugur June 1, 2004 emre.ugur@ceng.metu.edu.tr Abstract The main objective of this project is the study of a learning based method

### Removal of Noise from MRI using Spectral Subtraction

International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 3 (2014), pp. 293-298 International Research Publication House http://www.irphouse.com Removal of Noise

### CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

### Problem Set. Problem Set #2. Math 5322, Fall December 3, 2001 ANSWERS

Problem Set Problem Set #2 Math 5322, Fall 2001 December 3, 2001 ANSWERS i Problem 1. [Problem 18, page 32] Let A P(X) be an algebra, A σ the collection of countable unions of sets in A, and A σδ the collection

### Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College

Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem Senior Exercise in Mathematics Jennifer Garbett Kenyon College November 18, 010 Contents 1 Introduction 1 Primitive Lattice Triangles 5.1

### Friendly Medical Image Sharing Scheme

Journal of Information Hiding and Multimedia Signal Processing 2014 ISSN 2073-4212 Ubiquitous International Volume 5, Number 3, July 2014 Frily Medical Image Sharing Scheme Hao-Kuan Tso Department of Computer

### DYNAMIC DOMAIN CLASSIFICATION FOR FRACTAL IMAGE COMPRESSION

DYNAMIC DOMAIN CLASSIFICATION FOR FRACTAL IMAGE COMPRESSION K. Revathy 1 & M. Jayamohan 2 Department of Computer Science, University of Kerala, Thiruvananthapuram, Kerala, India 1 revathysrp@gmail.com

### Load Balancing and Switch Scheduling

EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load

### ESIEE Paris International Master of Computer Science DMC (Diplôme National de Master) Official program for years 2016 to 2018

ESIEE Paris International Master of Computer Science DMC (Diplôme National de Master) Official program for years 2016 to 2018 International Master of Computer Science DMC DMC Programme The DMC programme

### Novel Automatic PCB Inspection Technique Based on Connectivity

Novel Automatic PCB Inspection Technique Based on Connectivity MAURO HIROMU TATIBANA ROBERTO DE ALENCAR LOTUFO FEEC/UNICAMP- Faculdade de Engenharia Elétrica e de Computação/ Universidade Estadual de Campinas

### This chapter describes set theory, a mathematical theory that underlies all of modern mathematics.

Appendix A Set Theory This chapter describes set theory, a mathematical theory that underlies all of modern mathematics. A.1 Basic Definitions Definition A.1.1. A set is an unordered collection of elements.

### Introduction. Chapter 1

1 Chapter 1 Introduction Robotics and automation have undergone an outstanding development in the manufacturing industry over the last decades owing to the increasing demand for higher levels of productivity

### Course 421: Algebraic Topology Section 1: Topological Spaces

Course 421: Algebraic Topology Section 1: Topological Spaces David R. Wilkins Copyright c David R. Wilkins 1988 2008 Contents 1 Topological Spaces 1 1.1 Continuity and Topological Spaces...............

### The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

### FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it

### Induction Problems. Tom Davis November 7, 2005

Induction Problems Tom Davis tomrdavis@earthlin.net http://www.geometer.org/mathcircles November 7, 2005 All of the following problems should be proved by mathematical induction. The problems are not necessarily

### North Carolina Math 2

Standards for Mathematical Practice 1. Make sense of problems and persevere in solving them. 2. Reason abstractly and quantitatively 3. Construct viable arguments and critique the reasoning of others 4.