PARALLEL IMPLEMENTATION OF THE INFORMATIVE AREAS GENERATION METHOD IN THE SPATIAL SPECTRUM DOMAIN

This paper proposes a parallel implementation of th e image informative segments extraction method. The images are segmented in the spatial spectrum do main. The median energy in each selected segment is viewed upon as an area. For purposes of time saving s, a parallel implementation of the algorithm for c alculating the areas is developed. The developed appr o ch to the parallel algorithm implementation is te sted on a high performance multicore computing system. T he experiments have shown that the parallel implementation of the method allows us to obtain a three -fold speedup, which is a good result.


Introduction
Currently computer processing of medical diagnostic images is one of the vital research tools and a way to improve efficiency of early detection of various diseases. Change of the body fluids composition is one of the information-bearing health condition areas [1 -3]. Metabolic change that occurs due to pathological conditions affects the fluid composition; there are numerous changes in the molecular composition of tissues and body fluids. Converting the fluid from one phase state to another is one of the ways to detect such changes. Crystallization is one of the most convenient methods to change the fluid phase. Crystal properties modification is caused by changed physical and chemical properties of a body fluid. The investigation of these properties is the crucial problem of crystal analysis [4]. In medicine, studied crystallograms are the structures formed by salt crystallization caused by body fluid drying.
In clinical practice the crystallogram analysis is based on their images. It is not always possible to visually identify changes in such key crystallogram parameters as predominant bar direction, bar density etc., which contribute to major pathologic signs. Quantified analysis and objectivity are among computer analysis advantages.
The information contained in the image is structurally excessive. It is known that if the parallel bars of certain direction were predominant on the original image, the bars of the same direction would dominate the Fourier transform of an original image. This property can be used to analyze crystallograms [5,6] and other images of branched structure.
The developed method based on discriminatory analysis algorithm is applied to generate the informative areas set, which is used in this paper to identify the characteristics of the initial crystallogram images.
In the article, we propose a parallel implementation of the method to speed up computations.

Informative areas generation method
In this work, the areas are derived from calculation of the total energy on the selected spectrum image ranges. Most part of the spectrum does not contain the information suitable to identify the characteristics of an original image.
If the image function and its Fourier transform F(u, v) are considered in a spatial domain, then the magnitude |F(u, v)| 2 defines an energy spectrum of the image. The energy spectrum of the image can be directly analyzed as a whole or partially.
In this work, we analyzed features derived by calculating the total energy of a selected domain of the spectrum image. The spectrum image in the domain of interest was segmented using a formula: Since the spectral image is symmetric around the center, only half of the image will be used to form up the areas [7,8].
This paper describes the method to extract the informative segments from the spectrum images (in Fig. 1 is shown as a stage of smart area analysis process). The segment informative value was estimated using the criteria of separability of discriminatory analysis algorithm.
The methods based on the discriminative analysis algorithm proved to be a good solution to form up new problemspecified areas [9]. These methods permit to improve the reliability of data classification [10 -12].
The discriminative analysis is used to eliminate the correlation between the areas and consequently to reduce the size of the areas set. The usage of this algorithm allows, on the one hand, to maintain the informativeness of the feature set for classification and, on the other hand, to reduce the number of areas to apply less complicated classification methods and to reduce the classification error value.
An individual separability criterion was calculated for each area based on equation: J=tr( (T) -1 B), where T = B + W, B is between-group scattering matrix, W is intragroup scattering matrix.
The informative areas set is further generated in the following manner: 1. The areas are ranged in the order of decreasing of individual separability criteria values. 2. The initial areas set consists of a feature with the largest criteria. Classification is carried out. 3. Then the area with the next value of separability criterion is added to the set. Classification based on the new set of areas is carried out. 4. Repeat item 3 until all areas are included into the set.
The informative set of areas is the one with classification results yielding the minimum error value. The classification error that defines the number of cases with the classifier acquiring incorrect value is calculated from the equation: ( / ) 100% m n ε = i , -where m is the number of classification errors, n is the total number of images tested.
In this work, with a view of accumulating statistics we utilized crystallographic images of a lachrymal fluid. The images were divided in two classes based on a visual analysis. The training set was composed of 200 samples of 256×256 pixels, containing 100 images of each class. The images under testing had similar parameters, with the samples containing 100 images in each class. Based on this data, image classification was done.

Parallel implementation of the method to generate informative areas
The analysis of the algorithm structure showed that the first stage of areas computing has the maximum computational complexity.
As mentioned above most of the algorithm run time is spent on computing the areas. This stage includes preprocessing of the learning sample, generation of spatial spectrum for each learning image and calculation of the area values. The number of calculations can be reduced if one take into account that the spatial spectrum image is symmetrical relative to its center, and for this reason the areas calculation may and must be performed only on the half of the spatial spectrum image. In order to speed up the algorithm run time this paper will apply task division. This paper will not use an MPI technology but will apply task distribution by threads, that is why the way of splitting the image into tasks is not important. In case of sample pre-processing and spatial spectrum image generation a single image is sent to each thread. Then at the areas calculation stage each thread reveives a separate element -an image segment calculated on the basis of the proposed segmentation. The next task is sent to the thread as soon as it completes handling of the element.
Application of this segmentation pattern allows substantial run-time saving at the first stage of the algorithm. During this resource-intensive stage, such method of tasks segmentation by threads has permitted to achieve the three-fold speedup when four threads were used. The curve in Fig. 1 shows the relation between speedup and the number of areas.
To evaluate the work developed by the implementation performed experiments were performed on personal computer running Windows 7 operating system with Intel Core i5 4460 processor.

Classification results
After classification for all possible segmentations, areas were selected using the developed area selection algorithm. Fig. 2 shows the relation between classification error and the number of areas taken in the descending order of their separability criterion in case of classification with 2-nearest neighbors methods to split into 4 sectors and 8 rings.

Fig. 2. Relation between classification error and the number of areas
Tables 1 show classification error value after selecting the informative area set. The error value selection to be included into the final table is shown above.

Conclusion
This paper presented the method to generate a set of informative local areas of a spatial spectrum in order to classify medical crystallogram images, and an option of parallel implementation of such method. In addition, the research included experimental testing of the developed software implementation, which demonstrated that parallel algorithm implementation provided almost threefold speedup at the areas calculation stage. The next step is to implement parallel computing at the smart area analysis stage in order to improve the informative area set calculation speed.