Method and device for analyzing particles

Abstract: When a fluid containing a mixture of different kinds of particles, such as blood, is passed through a particle detector such as a flow cytometer to measure various characteristics of each particle and the measurements of two characteristics of each particle and the measurements of two characteristics are plotted in two-dimensional rectangular co-ordinates, for example, the resultant dots tend to separate into groups (clusters) corresponding to the kinds of the particles. This invention relates to a method and a device for presuming information regarding the position of center of gravity, variance number of dots and the like of each cluster by learning and, based upon this information, presuming a specific cluster or category to which each measured particle should belong from the corresponding measurements of the particles, and it executes such information processing by a fuzzy clustering technique using a neural network.

Description: BACKGROUND OF THE INVENTION This invention relates to a method and a device for analyzing plural kinds of particles intermixed with each other, by presuming the kind of each particle from measurements of specific characteristics thereof and counting the number of particles belonging to each kind and, especially, to a system for presuming the kind of each particle as detected based upon distribution data obtained by using a neural network and previously applied- information of the respective characteristics of a number of particles thereto to cause it to learn their states of distribution. While the above-mentioned particle analyzing device is useful, for example, as a blood-coropuscle analyzer for classifying and counting blood-corpuscles in blood, such device is disclosed, for example, in JP-A-3131756. In this prior art device, predetermined characteristic values (hereinunder generalized as "characteristic parameters") of blood-corpuscles belonging to plural kinds (hereinunder generalized as "categories") are applied to an input layer of a neural network of the error back-propagation type to cause it to learn supervisedly their states of distribution and, thereafter, the characteristic parameters of each particle as detected are supplied to the input layer to cause it to presume the group (hereinunder referred to as "cluster") or the category to which the particle is to belong, that is, to effect a clustering operation, based upon the resultant data of learning. However, this device has a disadvantage in that it may erroneously classify a particle of an unlearnt cetegory into a learnt category when the characteristic parameters of such particle of unlearnt category are applied and, moreover, it requires a long learning time when the distribution of characteristic parameters are complicated, since it uses a neural network of the error back-propagation type. A further neural network approach to blood corpuscle analysis is disclosed in Fu L. et al. "A Hybrid System Approach to Multivariate Analysis of Flow Cytometry Data", pages 315-324, Procs Fifth Annual IEEE Symposium on Computer-Based Medical Systems, 14-17 June 1992. Herein a neural network algorithm known as Real Time Adaptive Clustering is used to perform clustering of a data space representing blood corpuscle types. Following clustering of the data a statistical evaluation is undertaken, and a frequency of the membership of each corpuscle cluster can be found. The prior art thus places a total reliance on a neural network to perform the data clustering, and this presents a number of drawbacks. Firstly, since the neural network is both non-linear and self-aggregating it becomes very difficult to figure out what the real clustering procedure actually is. Further, the prior art reports that the approach could lead in some test cases to random clustering, wherein a random arbitrary number of clusters were formed regardless of the number of corpuscle types in the sample. Accordingly, an object of this invention is to provide a method and a device for clustering spatial distribution data developed by analyzing particles which can effect an accurate clustering operation within a short time regardless of an abnormal or complicated distribution of the present parameters. Further, the invention provides for a known resulting number of clusters, corresponding to various known types of particle which may be present in a sample. SUMMARY OF THE INVENTION The method and device of this invention are arranged to apply a time-sequence of measured data consisting of plural characteristic parameters to a pre-analyzer such as a neural network at the same time as converting them into distribution data in a characteristic parameter space, and presume cluster information such as center of gravity of the cluster of each category from the distribution data for accurately clustering the detected particle based upon the presumed initial cluster informations. More particularly, a mixture cf a number cf particles belonging to plural categories is supplied to a particle detecting device such as a flow cytometer to successively measure predetermined characteristic parameters of each particle and the measured values are converted into distribution data of a predetermined characteristic parameter space. At the same time, the measured values are sequentially supplied to a pre-analyzer such as a neural network having an input layer which includes at least neurons respectively corresponding to the above-mentioned characteristic parameters and an output layer which includes at least neurons respectively corresponding to expected categories to execute unsupervised learning vector quantization for presuming cluster informations including canter-of-gravity vector information of the clusters respectively corresponding to the above-mentioned categories. Following the generation of this initial presumed cluster information, the above-mentioned distribution data are clustered by the clustering method or device of the present invention in accordance with the presumed cluster informations which are used as a basis for the clustering. Following clustering, the particle memberships of each cluster can be found. These and other features and functions of this invention will be described in more detail below about a preferred embodiment thereof with reference to the accompanying drawings, in which FIG. 1 is a block diagram showing the configuration of an embodiment of the particle analyzing device according to this invention; FIGS. 2a and 2b are explanatory diagrams of a blood corpuscle detecting method in a blood-corpuscle detecting device in the embodiment of FIG. 1; FIG. 3 is a block diagram showing internal configuration of an analyzing device in the embodiment of FIG. 1; FIG. 4 is a diagram showing an example of distribution data formed by data converting means in FIG. 3; FIG. 5 is an explanatory diagram of an example of the configuration of a neural network in FIG. 3 and a function thereof; FIG. 6 is a flow chart showing canter-of-gravity calculating and particle counting operations in clustering means in FIG. 3; FIG. 7 is an explanatory diagram of domain division in the operations of FIG. 6; FIG. 8 is an explanatory diagram of measurement of the distance from a detected particle to the center of gravity of each particle cluster in the operations of FIG. 6; FIGS. 9a and 9b are diagrams showing an example of distribution data of normal blood-corpuscles and a result of clustering thereof; FIGS. 10a and 10b are diagrams showing an example of distribution data of abnormal blood-corpuscles and a result of clustering thereof; and FIGS. 11a and 11b are diagrams showing another example of distribution data of abnormal blood-corpuscles and a results of clustering thereof. Thoughout the drawings, same reference numerals are given to corresponding constitutional elements. DESCRIPTION OF PREFERRED EMBODIMENT FIG. 1 shows an overall configuration of a blood-corpuscle classifying and counting device as a preferred embodiment of the particle analyzing device of this invention. As shown, the device includes a blood-corpuscle detector 2, a signal amplifier 4, an analog-to-digital (A/D) convertor 6, an analyzing device 8 and a display device 10. The blood-corpuscle detector 2 is a well-known device such as flow cytometer and, when a blood specimen including leukocytes only which are separated by preliminary treatment such as dilution and addition of hemolyzing agent, for example, is supplied thereto, it detects blood-corpuscles one by one and sequentially produces electric signals respectively indicative of predetermined characteristics of the respective blood-corpuscles. For instance, when the blood specimen is passed through a fine passageway which can pass the blood-corpuscles one by one and a d.c. current and a high frequency a.c. current are flowed across the passageway at the same time, the d.c. current results in a signal proportional to the size of the cytoplasm of each blood-corpuscle since the d.c. current is shut out by the cytoplasm 12 as shown in FIG. 2a. In contrast, the high frequency a.c. current penetrates the cytoplasm 12 of low density and low impedance and is shut out by only a nucleus or granule 14 of high density and high impedance as shown in FIG. 2b and, therefore, it results in a signal relating to the density and size of the nucleus or granule. Thus, measured values of two kinds of characteristic parameter are obtained from each blood-corpuscle. These two kinds of output signal of the blood-corpuscle detector 2 are amplified by the amplifier 4 of well-known type and then converted into digital signals by the A/D convertor 6. In this embodiment, both digital signals are respectively quantized into 256 channels in total from channel No. 0 to No. 255. These two kinds of quantized signals obtained from the respective blood-corpuscles will be hereinunder referred to as data X(x 1 , x 2 ) consisting of a characteristic parameter x 1 indicative of the above-mentioned d.c. component and a characteristic parameter x 2 indicative of the above-mentioned a.c. component. The data X is then supplied to the analyzing device 8 which is essential to the invention. The analyzing device 8 is composed of a personal computer, microcomputer or microprocessor and functionally includes data processing means 16, a neural network 18 and clustering means 20 as shown in FIG. 3. The data X are supplied successively to the data converting means 16 and neural network 18. The data X are converted by the data converting means 16 into distribution data F(x 1, x 2 ) in a two-dimensional space as shown in FIG. 4 having the characteristic parameters x 1 and x 2 as two variables thereof. Since the characteristic parameters x 1 and x 2 are quantized respectively into 256 channels as described above, this space of distribution consists of 256x256 basic elements in total, each of which stores the number of blood-corpuscles having their characteristic parameters x 1 and x 2 belonging to two corresponding channels. For example, FIG. 4 shows that the number of blood-corpuscles whose signal has a d.c. component x1 belonging to channel No. 1 and an a.c. component x 2 belonging to channel No. 2 is six and, in other words, F(1, 2) = 6. Since the leukocytes include various blood-corpuscles such as lymphocytes, monocytes, granulocytes and likes having different values of the characteristic parameters, the distribution data of FIG. 4 tend to form clusters of the respective kinds of blood-corpuscles. The neural network 18 serves to presume the center of gravity, variances and the number of corpuscles of each cluster based upon the input data X. As shown in FIG. 5, the neural network 18 includes an input layer having two neurons 22 and 24 respectively corresponding to the above-mentioned two characteristic parameter inputs x 1 and x 2 and an output layer having five neurons 26, 28, 30, 32 and 34 respectively corresponding to expected five classification categories, namely, those of lymphocytes, monocytes, granulocytes, ghost corpuscles (unhemolized blood-platelets and erythrocytes) and other corpuscles (unripe blood-corpuscles and likes). The neuron 22 in the input layer for the characteristic parameter x 1 is connected to the neurons 26, 28, 30, 32 and 34 of the output layer with weights W 11 , W 12 , W 13 , W 14 and W 15 , respectively, and the input layer neuron 24 for the characteristic parameter x 2 is connected to the output layer neurons 26, 28, 30, 32 and 34 with weights W 21 , W 22 , W 23 , W 24 and W 25 , respectively. If arbitrary values are initially given to the weights W 11 , W 12 , W 13 , W 14 , W 15 , W 21 , W 22 , W 23 , W 24 and W 25 and part or all of the data X to the input layer neurons 22 and 24, the neural network 18 commences a learning operation based upon a method of unsupervised vector quantization. The method of vector quantization is described in detail, for example, in "Neural Networks for Signal Processing", published by Prentice-Hall International Editions. While the neural network 18 learns a probability density function of the input data X, the above-mentioned weights W 11 to W 15 and W 21 to W 25 are updated gradually and finally obtained weight vectors V 1 (weights W 11 and W 21 ), V 2 (weights W 12 and W 22 ), V 3 (weights W 13 and W 23 ), V 4 (weights W 14 and W 24 ) and V 5 (weights W 15 and W 25 ) indicate presumed positions of the centers of gravity of the clusters of lymphocytes, monocytes, granulocytes, ghost corpuscles and other corpuscles in the distribution data F(x 1 , x 2 ) respectively. In the case of normal specimen, the weight vector V 5 may be left unchanged from its initial value. Upon completion of learning, the neural network 18 can presume the number of blood-corpuscles of each kind from relatively few input data since it has learnt the probability density function of the input data. More specifically, counters respectively corresponding to the lymphocytes, monocytes, granulocytes, ghost corpuscles and other corpuscles are provided and their counts are assemed as m 1 , m 2 , m 3 , m 4 and m 5 . When a certain datum X 1 consists of d.c. and a.c. components x 11 and x 21 , the values of (x 11 -W 11 ) 2 +(x 21 -W 21 ) 2 , (x 11 -W 12 ) 2 +(x 21 -W 22 ) 2 , (x 11 -W 13 ) 2 +(x 21 -W 23 ) 2 , (x 11 -W 14 ) 2 +(x 21 -W 24 ) 2 and (x 11 -W 15 ) 2 +(x 21 -W 25 ) 2 are calculated respectively. In other words, the distances between signal and weight vectors d n = ∥ x 1 -W n ∥ are sought, where n =1, ... 5 and W n = (W 1n , W 2n ) . The least one of these distances is selected. For example, when the distance d 1 or (x 11 -W 11 ) 2 +(x 21 -W 21 ) 2 is the least, the count of the corresponding lymphocyte counter is incremented by one. Similar calculations are executed on the other data supplied sequentially thereafter and the least distances are selected to increment the corresponding counters one by one. Then, the finally obtained counts m 1 to m 5 of the respective counters give the ratio of the presumed numbers of blood-corpuscles belonging to the respective categories, if the respective clusters of the blood-corpuscles are same in distribution. In the case of normal specimen, m 5 may be absent and, therefore, the corresponding cluster is not assemed to exist when m 5 is less than a predetermined value. When the numbers of blood-corpuscles are presumed, the data belonging to the respective categories are stored and the variances of the corpuscles in the respective clusters are calculated on the basis thereof. For example, when X 1 (x 11 , x 21 ), X 3 (x 13 , x 23 ) and X 7 (x 17 , x 27 ) are stored as the data belonging to the lymphocyte category, the presumed variance s 1 of the lymphocytes is calculated by dividing the sum of total square deviations of x 11 , x 13 and x 17 from their mean value and total square deviations of x 21 , x 23 and x 27 from their mean value by the number of corpuscles. Presumed variances s 2 , s 3 , s 4 and s 5 of the other categories are similarly obtained. In this case also, s 5 need not be calculated if the specimen is normal. The blood classifying and counting operation might be completed with the above presumed numbers of corpuscles m n only if the corpuscles belonging to the respective categories have exhibited the same distribution, the presumed numbers m n and variances s n (n = 1,...5) as obtained above are of approximate values since their distributions are not always same in practice. Therefore, the clustering means 20 clusters the distribution data F(x 1 , x 2 ) obtained from the data converting means 16 by using these approximate values and the presumed centers of gravity V n (n = 1,...5) of the respective clusters, which were calculated previously. The operation of the clustering means 20 will be described below with reference to the flow chart of FIG. 6. Initial division of the distribution data F(x 1 , x 2 ) is carried out first, after a memory value K indicating the number of iterations is set to one (step S1). In this initial division, the distribution of the basic elements in the distribution data of FIG. 4 is divided into four fixed domains A 1 , A 2 , A 3 and A 4 in which the lymphocytes, monocytes, granulocytes and ghost corpuscles are probably distributed respectively, as shown in FIG. 7, regardless of the number of corpuscles stored in each element. In this case, no domain is established for the other corpuscles. Denoting the clusters of lymphocytes, monocytes, granulocytes, ghost corpuscles and other corpuscles with C 1 , C 2 , C 3 , C 4 and C 5 , respectively, the membership values of the blood-corpuscles existing in the above fixed domains A 1 , A 2 , A 3 and A 4 to the respective clusters C 1 , C 2 , C 3 and C 4 are assumed as all one (1). The blood-corpuscles belonging to the cluster C 5 are undetermined. The domain A 0 in FIG. 7 is a domain having undetermined memberships to all clusters C 1 to C 5 . The initial centers of gravity are determined next (step S2). In this case, assuming the other corpuscles to exist also and using the center-of-gravity vectors presumed by the neural network 18, the initial center-of-gravity positions of the respective clusters C 1 , C 2 , C 3 , C 4 and C 5 are determined at (x G11 , x G21 ), (x G12 , x G22 ), (x G13 , x G23 ), (x G14 , x G24 ) and (x G15 , x G25 ), respectively. Next, membership values of the corpuscles which are not included in any of the fixed domains A 1 , A 2 , A 3 and A 4 , that is, the corpuscles distributing in the domain A 0 of FIG. 7, to the clusters C 1 , C 2 , C 3 , C 4 and C 5 are calculated respectively (step S3). To this end, the distance L from each blood-corpuscle in the domain A 0 to the center of gravity of each cluster is calculated first. This distance is not an Euclidean distance and it is defined as the minor radius of an ellipse 38 having its center positioned at the center of gravity (x G1n , x G2n ) and its major axis inclined by an angle  n with respect to the X 1 -axis of FIG. 7 and passing the corpuscle 36 in question, as shown in FIG. 8 where the suffix n is omitted for simplicity. The angle  n has a value which is previously selected experientially for each cluster C n . The reason why the distance L is so defined is that the actual distributions of all clusters are substantially elliptic in shape. Thus, all corpuscles lying on the same ellipse should be same in distance from the center of gravity and would have the same membership to the cluster C n as described below. The distance L can be calculated as follows. If new co-ordinate axes X 1 '' and X 2 '' are established along the major and minor axes of the ellipse 38 and the minor and major radii of the ellipse are expressed with L and kL (k is a proportional constant) respectively, the point 36 x 1 '', x 2 '') on the ellipse is given by the following equation: x '' 1 kL 2 + x '' 2 L 2 =1 It is solved as follows as looking for the minor radius L. L= x '' 1 2 k 2 +x'' 2 2 As is understood from FIG. 8, the relation between the coordinate (x 1 '', x 2 '') and the original co-ordinate (x 1 , x 2 ) of the point 36 is given by the following equations. x'' 1 = cos  n (x 1 - x G1n ) + sin  n (x 2 - x G2n ) x'' 2 = -sin  n (x 1 - x G1n ) + cos  n (x 2 - x G2n ) By applying the equations 3 and 4 to the equation 2 and using the inclination angle  n of each cluster, the distance L n(36) from the blood-corpuscle 36 to the center of gravity of each cluster C n is calculated. Then, using the presumed cluster C n which are obtained from the neural network 18 as described above, the membership U n(36) of the corpuscle 26 to the cluster C n is given by the following equation. U n(36) = R n(36) / n R n(36) where R n(36) = m n s n /L n(36) 2 , (n = 1,2,...5) The above equestions are based upon such an idea in that the membership is not only inversely proportional to the square distance to the center of gravity of each cluster, but also proportional to the number of corpuscles and the standard deviation of the cluster. The memberships of each blood-corpuscle in the domain A 0 to the respective clusters C n are calculated as above and each blood corpuscle is deemed to belong to the respective clusters C n at rates or weights corresponding to its memberships U n . The positions of the centers of gravity of the respective clusters are corrected taking such weights of each blood-corpuscle with respect thereto into consideration. In other words, the weighted centers of gravity are calculated (step S4). The co-ordinates x G1n ' and x G2n ' of the weighted center of gravity of the cluster C n are given by the following equations. x G1n ' = i j U nij ·N ij ·i / i j U nij ·N ij x G2n ' = i j U nij ·N ij ·j / i j U nij ·N ij where i and j are quantized channel numbers of the characteristic parameters X 1 and X 2 of the distribution data F(x 1 , x 2 ) of FIG. 4 and both of them take such values as 0, 1, 2, ... 255 in this embodiment. U nij is a membership of the basic element belonging to channel Nos. i and j and N ij is the number of blood-corpuscles in this element. After calculating the weighted center of gravity of each cluster as above, it is compared with the corresponding initial center of gravity to judge whether the difference D therebetween is equal to or less than a predetermined value D 0 or not (step S5). The value of D 0 may be zero, for example. If D is not greater than D 0 in any cluster, the distances from each blood-corpuscle to respective clusters are not ascertained yet and it is deemed that no membership of this blood-corpuscle to that cluster is decided clearly. In this case, the initial center of gravity of each cluster is updated with the calculated weighted center of gravity and it is judged whether the stored number of iterations K is equal to a predetermined value K 0 or not (step S6) . If not, the value of K is incremented by one (step S7) and step S3 is resumed for repeating the same operation as updating the center of gravity. If K=K 0 is achieved during such repetition, such words as "ANALYSIS IMPOSSIBLE" are displayed by the display device 10 to finish the processing (step S8). On the other hand, if D≦D 0 is achieved in step S5, the memberships of each blood-corpuscle to all clusters have been ascertained and, therefore, the number of the blood-corpuscles in each cluster is calculated based thereupon (step S9). This calculation is executed by either one of two methods as the under. In the first method, the cluster corresponding to the greatest membership of each blood-corpuscle in the domain A 0 is designated as a cluster to which that blood-corpuscle belongs. For example, when a certain basic element contains ten blood-corpuscles and the memberships U 1 , U 2 , U 3 , U 4 and U 5 of these corpuscles to the clusters C 1 , C 2 , C 3 , C 4 and C 5 of lymphocytes, monocytes, granulocytes, ghost corpuscles and other corpuscles are 0.95, 0.03, 0.02, 0.00 and 0.00, respectively, all of these ten corpuscles are designated as belonging to the lymphocyte cluster C 1 . This method is suitable in such a case in that a blood-corpuscle in question exhibits an especially large membership to specific one of the clusters and the clusters are clearly separated. On the other hand, in the second method, the blood-corpuscles in each basic element are shared to the respective clusters at the rate of memberships. For example, when the basic element in question contains ten blood-corpuscles and the memberships U 1 , U 2 , U 3 , U 4 and U 5 of these corpuscles are 0.2, 0.5, 0.3, 0.0 and 0.0, respectively, the memberships other than U 4 and U 5 are close to each other and it appears that the clusters C 1 , C 2 and C 3 are partially overlapping. If all of ten corpuscles are shared only to the monocyte cluster of the greatest membership in accordance with the first method in this case, a large counting error may be caused. Therefore, in accordance with proportional distribution based upon the memberships, two, five, three, zero and zero corpuscles are shared respectively to the clusters C 1 , C 2 , C 3 , C 4 and C 5 . This method is effective when the distribution patterns of the respective clusters overlap partially as above. Thus, the clusters to which each blood-corpuscle belongs are decided and the number of corpuscles of each cluster is calculated. Since in this embodiment, the final center of gravity of each cluster and the major and minor radii of the ellipse representing spread of its distribution are calculated as described above, it is possible to compare these values with their normal values to diagnose their deviation from the normal values, that is, a state of health. Next, the description will be made about a result of actual execution of this embodiment using a commercially available thirty-two bit personal computer as the analyzing device 8. FIGS. 9a and 9b show scattergrams of a normal specimen and FIGS. 10a, 10b, 11a and 11b show scattergrams of two abnormal specimens. FIGS. 9a, 10a and 11a show their distribution data F(x 1 , x 2 ) before clustering and FIGS. 9b, 10b and 11b show those after clustering. Both normal and abnormal specimens are correctly clustered in this embodiment. TABLE 1 show the centers of gravity presumed by the neural network 18 and the centers of gravity finally decided by the succeeding clustering operation, based upon the distribution data F(x 1 , x 2 ) of specimen Nos. 1, 2 and 3 of FIGS. 9a, 10a and 11a. Both are substantially approximate to each other and utility of presumption using the neural network 18 is understood therefrom. TABLE 2 shows the variances presumed by the neural network 18 and the variances finally decided by the clustering operation, based upon the same distribution data. Although some difference appears therebetween, the presumption has come nearly true. TABLE 3 shows the numbers of times of operation needed for calculation of the final center of gravity through the clustering operation of the data of the above specimen Nos. 1, 2 and 3, when the presumption by the neural network 18 is used and when it is not used. Although there is no difference between the both in the case of normal specimen No. 1, the neural network shows much less values in the case of abnormal specimen Nos. 2 and 3 and, especilly, no good result is obtained without use of the neural network in the case of abnormal specimen No. 3. (Variance) Ghost C4 Lympho C1 Mono C2 Granulo C3 Others C5 Specimen P F P F P F P F P F No.1(Normal) 68 66 124 123 432 425 696 693 --- --- No.2(Abnormal) 38 43 134 127 540 1029 1050 1137 --- --- No.3(Abnormal) 61 72 183 152 361 3320 705 788 455 569 (P: Presumed; F: Final) (Number of operations) Specimen Presumed Not presumed No.1(Normal) 2 times 2 times No.2(Abnormal) 2 times 4 times No.3(Abnormal) 2 times 4 times The above embodiment is presented for illustrative purposes only. It should be obvious to those skilled in the art that various modifications and variations can be made, for example, the particles to be subjected to the inventive analysis need not always be blood-corpuscles, but may be any other kind of particles such as powdered material. In some of such other particles, the above-mentioned distance to the center of gravity may be an Euclidean distance. Moreover, instead of the above-mentioned d.c. and a.c. impedances as the characteristic parameters of the particles, other characteristic signals such as scattered light and fluorescent intensities may be used. Using three or more characteristic parameters, a data distribution in a space of three or higher dimension may be handled. While the center of gravity, the number of particles and the variances of each cluster are used as the object of presumption by the neural network, the center of gravity may be used alone or together with the number of particles. Furthermore, the configuration of the neural network may be modified arbitrarily. When the number of categories is large, for example, a suppressive coupling may be inserted between the neurons of the output layer so that, when a specific neuron is excited, the neighbouring neurons are suppressed in response thereto.

Claims: A particle analyzing method for clustering spatial distribution data developed by analyzing a mixture of particles belonging to a plurality of categories, to thereby count the number of particles belonging to respective ones of a plurality of categories; said method including the step of clustering said spatial distribution data with presumed centers of gravity, said method being characterized by the steps of: (a) initially dividing said spatial distribution data into fixed domains (A1, A2, A3 and A4) in which particles of said respective categories are probably distributed, the membership values of particles existing in the respective fixed domains (A1, A2, A3 and A4) to the respective clusters (C1, C2, C3 and C4) being set to predetermined values; (b) determining initial centers of gravity of said respective clusters on the basis of said presumed centers of gravity; (c) calculating the distances from each particle in a domain (AO) outside said fixed domains (A1, A2, A3 and A4) to the centers of gravity of said respective clusters (C1, C2, C3 and C4) to thereby calculate the membership values Un of that particle existing in said outside domain (AO) to said respective clusters (C1, C2, C3 and C4); (d) calculating weighted centers of gravity of said respective clusters (C1, C2, C3 and C4), taking the memberships of each particle to said respective clusters into consideration; (e) comparing the calculated weighted center of gravity of each cluster with the corresponding center of gravity before the calculation to judge whether the difference (D) therebetween in each cluster is equal to or smaller than a predetermined value; (f) updating the centers of gravity of said respective clusters with the calculated weighted centers of gravity if said difference (D) is greater than said predetermined value in any one of said clusters; (g) repeating the steps (c) through (f), using the updated centers of gravity; (h) if the center-of-gravity differences (D) in all of said clusters are judged to be equal to or smaller than said predetermined value in step (e), calculating the number of particles in each cluster on the basis of the memberships of each particle to the respective clusters; and (i) displaying a message on a display device and finish the processing if the center-of-gravity difference (D) in any one of said clusters is judged to be greater than said predetermined value in step (e) even after steps (c) through (f) are repeated a predetermined number of times; said presumed centers of gravity being calculated from part of measurement data used in developing said spatial distribution data. The particle analyzing method according to Claim 1 wherein said presumed centers of gravity are calculated by a neural network. The particle analyzing method according to Claim 1 wherein the step of developing said spatial distribution data and the step of calculating said presumed centers of gravity are carried out in parallel. A particle analyzing device for clustering spatial distribution data developed by analyzing a mixture of particles belonging to a plurality of categories, to thereby count the number of particles belonging to respective ones of a plurality of categories; said device including clustering means for said spatial distribution data which uses presumed centers of gravity, said device being characterized by: (a) means for initially dividing said spatial distribution data into fixed domains (A1, A2, A3 and A4) in which particles of said respective categories are probably distributed, said means setting, to predetermined values, the membership values of particles existing in the respective fixed domains (A1, A2, A3 and A4) to the respective clusters (C1, C2, C3 and C4); (b) means for determining initial centers of gravity of said respective clusters on the basis of said presumed centers of gravity; (c) means for calculating the distances from each particle in a domain (AO) outside said fixed domains (A1, A2, A3 and A4) to the centers of gravity of said respective clusters (C1, C2, C3 and C4) to thereby calculate the membership values Un of that particle existing in said outside domain (AO) to said respective clusters (C1, C2, C3 and C4); (d) means for calculating weighted centers of gravity of said respective clusters (C1, C2, C3 and C4), taking the memberships of each particle to said respective clusters into consideration; (e) means for comparing the calculated weighted center of gravity of each cluster with the corresponding center of gravity before the calculation to judge whether the difference (D) therebetween in each cluster is equal to or smaller than a predetermined value; (f) means for updating the centers of gravity of said respective clusters with the calculated weighted centers of gravity if said difference (D) is greater than said predetermined value in any one of said clusters; (g) means for repeating the processing by said means (c) through (f) in the named order, using the updated centers of gravity; (h) means for calculating the number of particles in each cluster on the basis of the membership values of each particle to the respective clusters when the center-of-gravity differences (D) in all of said clusters are judged to be equal to or smaller than said predetermined value by said means (e); and (i) means for displaying a message on a display device and finish the processing if the center-of-gravity difference (D) in any one of said clusters is judged to be greater than said predetermined value by said means (e) even after the processing by said means (c) through (f) is repeated in the named order a predetermined number of times, said presumed centers of gravity being calculated from part of measurement data used in developing said spatial distribution data. The particle analyzing device according to Claim 4 wherein said presumed centers of gravity are calculated by a neural network. The particle analyzing device according to Claim 4 wherein said means for developing said spatial distribution data and said means for calculating said presumed centers of gravity are operated in parallel.

Inventors: ASANO KAORU, KUBO KIMIYO, ASANO, KAORU, KUBO, KIMIYO
Applicants: SYSMEX CORP, SYSMEX CORPORATION
Application year: 1993
Main classification: G01N33
IPC codes: G01N15, G06F15, G06N3, G01N33, G06N99