the human protein atlas ( hpa ) is a publicly available database with millions of high resolution images showing the spatial distribution of proteins detected by 15,598 different antibodies ( release 9.0 , november 2011 ) in 46 different normal human tissue types and 20 different cancer types , as well as 47 different human cell lines . the data is released together with application - specific validation performed for each antibody , including immunohistochemisty ( ihc ) , western blot analysis , a protein array assay , and , for a large fraction , immunofluorescent - based confocal microscopy images . tissue microarrays ( tma ) provide the possibility to immunohistochemically stain a large number and variety of normal and cancer tissues . specimens containing normal and cancer tissue have been collected and sampled from anonymized paraffin embedded material of surgical specimens , in accordance with approval from the local ethics committee . the images represent a view similar to what is seen in a microscope when examining sections of tissue on glass slides . each antibody in the database has been used for ihc staining of both normal and cancer tissue . ihc has been used increasingly for over four decades , initially for research but now also for diagnosis and assessment of therapeutic biomarkers . ihc relies on the specific binding of an antibody to its corresponding antigen for detection and an enzymatic step where a dye is processed to produce a stain for visualization . a commonly used dye is 3,3-diaminobenzidine ( dab ) , which produces a dark brown stain . hematoxylin staining is unspecific and results in a blue coloring of both cells and extracellular material . however , there is a clear effort to move towards more quantitative and automated methods . with the emergence of digital imaging techniques , digital image analysis has become a promising approach to extract quantitative data from ihc stained samples . most attempts have been made to quantify the amount of certain proteins with diagnostic or prognostic value.[46 ] in these cases , the protein is known and the staining pattern is well - studied . in previous studies , breast tma spots were classified using color and local invariants , and texton histograms . a framework towards an automated analysis of sub - cellular patterns in human protein atlas images yielded 83% accuracy in 45 different tissues . here we describe and compare methods to automatically classify staining patterns of proteins with unknown as well as known localization . since the location of a protein within the cell can be coupled with certain functions , quantitative information on the staining pattern can be used to group proteins and understand the function of unknown proteins . the methods can also be used to quantify the amount of a protein with known staining pattern . here we used various features including gray level co - occurrence matrix ( glcm ) features , complex wavelet co - occurrence matrix ( cwcm ) features , and weighted neighbor distance using compound hierarchy of algorithms representing morphology ( wnd - charm)-inspired features for classifying different cellular staining patterns that is nuclear versus cytoplasmic staining in tma images . the proposed methodologies for computation of cellular features to the classification task are shown in figure 1 . the steps include color deconvolution to separate brown / black and blue cellular regions in the stained breast tma images followed by the computation of various features including gray level co - occurrence matrix ( glcm ) features , complex wavelet co - occurrence matrix ( cwcm ) features and wnd - charm - inspired features as defined below . the extracted features are thereafter fed into two different multivariate classifiers ( support vector machine ( svm ) and linear discriminant analysis ( lda ) classifier ) . block diagram of proposed methods tma images of normal and breast cancer tissue were downloaded from the hpa ( http://www.proteinatlas.org/ ) . a scanscope cs ( aperio , san diego , ca ) digital microscopical scanner was used to digitize each slice at 20x magnification . we selected images from 19 normal breast tissue cores and 10 breast cancer tissue cores and downloaded them from the database in jpeg file format . at the initiation of the project , non - compressed full resolution images in tif ( converted from svs , scanscope virtual slide ) format were retrieved from hpa , but a comparison showed that compression artifacts had minor effect on the performance of the presented classification approaches . each image is 3000  3000 pixels and represents a section of a tissue core composite of two stains ; dab and hematoxylin . we divided each image into small patches of 64  64 pixels , and classified each patch individually as showing background , connective tissue , nuclear or cytoplasmic staining [ figure 2 ] . each core image is divided into 64  64 pixel patches and each patch is classified by the presented methods a color deconvolution scheme is used to transform each image from the red , green , blue ( rgb ) color space to a new space modeled by the spectral properties of hematoxylin ( blue ) and dab ( brown / black ) . since the hematoxylin stain is selectively absorbed by cell nuclei and dab stains by specific binding of an antibody to its corresponding antigen ( i.e. , protein ) , the information from the created hematoxylin and dab channels can be used to distinguish protein localization patterns within the tissue sample . the color deconvolution method converts the rgb space to a new color space comprising hematoxylin ( h ) , dab , and a third  dummy channel created as a vector orthogonal to h and dab . the pre - defined and normalized color stained values for hematoxylin - staining vector [ 0.074510 0.054902 0.337255 ] ; dab - staining vector [ 0.341176 0.101961 0.043137 ] have been obtained from the imagej color deconvolution plug - in . the result after color deconvolution is shown in figure 3 . color deconvolution ; ( a ) original breast core tma image ; ( b ) blue channel after color deconvolution ; ( c ) brown channel after color deconvolution the blue channel corresponds to regions stained with hematoxylin and , in this example image , it is expressed mainly in the nuclei . in that image , most nuclei are also positive and are , therefore , also stained with the brown dab stain , which makes it hard to see the blue stain due to brown being darker and more distinct . also , in the nature of the chosen color deconvolution algorithm , which uses a simple matrix multiplication on the color value , and one of its major drawbacks , is the fact that it will always give some response in very dark regions . hence , some of the dark brown nuclei will always show high response , no matter which deconvolution is used . a commonly used statistical method to examine texture is the gray - level co - occurrence matrix ( glcm ) , previously shown to be useful for tissue texture analysis . glcm considers the spatial relationship of pixels and characterizes the texture of an image by calculating how often pairs of pixel with specific values and spatial relationships occur in an image . we calculated the glcm in each 64  64 patch with inter - pixel distance d = 16 , where four main directions have been used so as to compute the occurrences : 0 , 45 , 90 , and 135. the complex wavelet transform ( cwt ) is a complex valued extension to the standard discrete wavelet transform ( dwt ) . it provides multiresolution , sparse representation , and useful characterization of the structure of an image . the dual - tree complex wavelet transform ( dt - cwt ) requires additional memory , but provides approximate shift invariance , good directional selectivity in two dimensions and extra information in imaginary plane of complex wavelet domain when compared to dwt . dt - cwt calculates the complex transform of a signal using two separate dwt decompositions . since dt - cwt produces complex coefficients for each directional sub - band at each scale , this produces six directionally selective sub - bands for each scale of the two - dimensional dt - cwt at approximately 15 , 45 , and 75. in dyadic decomposition , sub - bands are allowed to be decomposed in both vertical and horizontal directions sequentially , but in anisotropic decomposition sub - bands are allowed to be decomposed only vertically or horizontally . studies have shown that the anisotropic dual - tree complex wavelet transform ( adt - cwt ) provides an efficient representation of directional features in images for pattern recognition applications . ten basis functions are produced in adt - cwt in each level which makes different orientations at the directions of 81 , 63 , 45 , 27 , and  9. this result in a finer analysis of the local high frequency components of images which is characterized by a finer division of high - pass sub - bands as well as edges and contours , which are represented by anisotropic basis functions oriented in different finer directions . here we use an adaptive basis selection method on undecimated adaptive anisotropic dual - tree complex wavelet transform ( uaadt - cwt ) . the textural features uniformity , entropy , dissimilarity , contrast , correlation , homogeneity , autocorrelation , cluster shade , cluster prominence , max . probability , sum of squares , sum average , sum variance , sum entropy , difference variance , difference entropy , information measures of correlation-1 , information measures of correlation-2 , inverse difference normalized , inverse difference moment normalized are extracted with inter - pixel distance d = 16 , from the 64  64 pixel patches of the tissue images using the standard expressions derived in for the following features extraction techniques ( i ) glcm features : from color delineated blue and brown / black stains channels ( 20 + 20 = 40 features ) and ( ii ) cwcm features : each feature is computed by taking the absolute value of the real and imaginary part of complex co - efficient in four main directions ( 0 , 45 , 90 , and 135 ) for three decomposition levels . finally , for each feature , the mean value over the three decomposition levels is computed for the dt - cwt ( 60 blue channel + 60 brown / black channel = 120 features ) and uaadt - cwt ( 60 blue channel + 60 brown / black channel = 120 features ) . it can model nonlinear relationships , which is useful in practical applications . in svm , a nonlinear input data set is converted into a high dimensional linear feature space via kernels for the non - linear case . a svm classifier with linear kernel is used in the training and testing phase for the classification task using the library for support vector machine ( lib - svm ) tool box with svm parameters -s 0 ( svm type : 0 for c - svc ) , -g ( number of features ) , -r 0 ( coefficient in kernel function ) , -c 1.0 ( parameter c of c - svc ) , -e 0.0010 ( tolerance of termination criterion ) , -p 0.1 ( epsilon value ) . pca - lda - charm  is an algorithm initially inspired by ilya goldberg 's wnd - charm , a whole - image - based classifier . the principle of the original algorithm is to extract features on the whole image ( without segmenting the interesting parts ) , weighting the features depending on their information content , and then classifying them using a modified version of the k - nearest neighbor classifier . the feature vector is built  hierarchically  : it is composed of different kinds of global features ( texture descriptors , edge descriptors , histograms , moments , etc . ) that are computed on the raw image , on several transformed version of the raw image ( fourier transform , wavelet transform , and chebyshev transform ) , and eventually on compound - transformed version of the image ( wavelet - fourier transform , chebyshev - fourier transform ) . pca - lda - charm is using the same idea of building a vector composed of whole - image features . the feature vector is not composed of the exact same elements as the one proposed by ilya goldberg in the original wnd - charm , but the same  groups  of features are present ( texture features , edge features , histograms , transforms . , ) . since the datasets are represented as sets of features in a high - dimensional space and a more robust classification framework than the one suggested in was desired , principal component analysis ( pca ) was used as a pre - processing step to reduce the dimensionality of the feature space , and then a subset of the pca - transformed features was classified using linear discriminant analysis ( lda ) as suggested in . the subset of principal components used for classification was chosen as the minimal number of strongest principal components required to explain at least 98% of the variance in the original data . tma images of normal and breast cancer tissue were downloaded from the hpa ( http://www.proteinatlas.org/ ) . a scanscope cs ( aperio , san diego , ca ) digital microscopical scanner was used to digitize each slice at 20x magnification . we selected images from 19 normal breast tissue cores and 10 breast cancer tissue cores and downloaded them from the database in jpeg file format . at the initiation of the project , non - compressed full resolution images in tif ( converted from svs , scanscope virtual slide ) format were retrieved from hpa , but a comparison showed that compression artifacts had minor effect on the performance of the presented classification approaches . each image is 3000  3000 pixels and represents a section of a tissue core composite of two stains ; dab and hematoxylin . we divided each image into small patches of 64  64 pixels , and classified each patch individually as showing background , connective tissue , nuclear or cytoplasmic staining [ figure 2 ] . each core image is divided into 64  64 pixel patches and each patch is classified by the presented methods a color deconvolution scheme is used to transform each image from the red , green , blue ( rgb ) color space to a new space modeled by the spectral properties of hematoxylin ( blue ) and dab ( brown / black ) . since the hematoxylin stain is selectively absorbed by cell nuclei and dab stains by specific binding of an antibody to its corresponding antigen ( i.e. , protein ) , the information from the created hematoxylin and dab channels can be used to distinguish protein localization patterns within the tissue sample . the color deconvolution method converts the rgb space to a new color space comprising hematoxylin ( h ) , dab , and a third  dummy channel created as a vector orthogonal to h and dab . the pre - defined and normalized color stained values for hematoxylin - staining vector [ 0.074510 0.054902 0.337255 ] ; dab - staining vector [ 0.341176 0.101961 0.043137 ] have been obtained from the imagej color deconvolution plug - in . the result after color deconvolution is shown in figure 3 . color deconvolution ; ( a ) original breast core tma image ; ( b ) blue channel after color deconvolution ; ( c ) brown channel after color deconvolution the blue channel corresponds to regions stained with hematoxylin and , in this example image , it is expressed mainly in the nuclei . in that image , most nuclei are also positive and are , therefore , also stained with the brown dab stain , which makes it hard to see the blue stain due to brown being darker and more distinct . also , in the nature of the chosen color deconvolution algorithm , which uses a simple matrix multiplication on the color value , and one of its major drawbacks , is the fact that it will always give some response in very dark regions hence , some of the dark brown nuclei will always show high response , no matter which deconvolution is used . a commonly used statistical method to examine texture is the gray - level co - occurrence matrix ( glcm ) , previously shown to be useful for tissue texture analysis . glcm considers the spatial relationship of pixels and characterizes the texture of an image by calculating how often pairs of pixel with specific values and spatial relationships occur in an image . once the glcm is constructed , statistical measures are extracted from the matrix . we calculated the glcm in each 64  64 patch with inter - pixel distance d = 16 , where four main directions have been used so as to compute the occurrences : 0 , 45 , 90 , and 135. the complex wavelet transform ( cwt ) is a complex valued extension to the standard discrete wavelet transform ( dwt ) . it provides multiresolution , sparse representation , and useful characterization of the structure of an image . the dual - tree complex wavelet transform ( dt - cwt ) requires additional memory , but provides approximate shift invariance , good directional selectivity in two dimensions and extra information in imaginary plane of complex wavelet domain when compared to dwt . dt - cwt calculates the complex transform of a signal using two separate dwt decompositions . since dt - cwt produces complex coefficients for each directional sub - band at each scale , this produces six directionally selective sub - bands for each scale of the two - dimensional dt - cwt at approximately 15 , 45 , and 75. in dyadic decomposition , sub - bands are allowed to be decomposed in both vertical and horizontal directions sequentially , but in anisotropic decomposition sub - bands are allowed to be decomposed only vertically or horizontally . studies have shown that the anisotropic dual - tree complex wavelet transform ( adt - cwt ) provides an efficient representation of directional features in images for pattern recognition applications . ten basis functions are produced in adt - cwt in each level which makes different orientations at the directions of 81 , 63 , 45 , 27 , and  9. this result in a finer analysis of the local high frequency components of images which is characterized by a finer division of high - pass sub - bands as well as edges and contours , which are represented by anisotropic basis functions oriented in different finer directions . here we use an adaptive basis selection method on undecimated adaptive anisotropic dual - tree complex wavelet transform ( uaadt - cwt ) . the textural features uniformity , entropy , dissimilarity , contrast , correlation , homogeneity , autocorrelation , cluster shade , cluster prominence , max . probability , sum of squares , sum average , sum variance , sum entropy , difference variance , difference entropy , information measures of correlation-1 , information measures of correlation-2 , inverse difference normalized , inverse difference moment normalized are extracted with inter - pixel distance d = 16 , from the 64  64 pixel patches of the tissue images using the standard expressions derived in for the following features extraction techniques ( i ) glcm features : from color delineated blue and brown / black stains channels ( 20 + 20 = 40 features ) and ( ii ) cwcm features : each feature is computed by taking the absolute value of the real and imaginary part of complex co - efficient in four main directions ( 0 , 45 , 90 , and 135 ) for three decomposition levels . finally , for each feature , the mean value over the three decomposition levels is computed for the dt - cwt ( 60 blue channel + 60 brown / black channel = 120 features ) and uaadt - cwt ( 60 blue channel + 60 brown / black channel = 120 features ) . it can model nonlinear relationships , which is useful in practical applications . in svm , a nonlinear input data set is converted into a high dimensional linear feature space via kernels for the non - linear case . a svm classifier with linear kernel is used in the training and testing phase for the classification task using the library for support vector machine ( lib - svm ) tool box with svm parameters -s 0 ( svm type : 0 for c - svc ) , -g ( number of features ) , -r 0 ( coefficient in kernel function ) , -c 1.0 ( parameter c of c - svc ) , -e 0.0010 ( tolerance of termination criterion ) , -p 0.1 ( epsilon value ) . a commonly used statistical method to examine texture is the gray - level co - occurrence matrix ( glcm ) , previously shown to be useful for tissue texture analysis . glcm considers the spatial relationship of pixels and characterizes the texture of an image by calculating how often pairs of pixel with specific values and spatial relationships occur in an image . once the glcm is constructed , statistical measures are extracted from the matrix . we calculated the glcm in each 64  64 patch with inter - pixel distance d = 16 , where four main directions have been used so as to compute the occurrences : 0 , 45 , 90 , and 135. the complex wavelet transform ( cwt ) is a complex valued extension to the standard discrete wavelet transform ( dwt ) . it provides multiresolution , sparse representation , and useful characterization of the structure of an image . the dual - tree complex wavelet transform ( dt - cwt ) requires additional memory , but provides approximate shift invariance , good directional selectivity in two dimensions and extra information in imaginary plane of complex wavelet domain when compared to dwt . dt - cwt calculates the complex transform of a signal using two separate dwt decompositions . since dt - cwt produces complex coefficients for each directional sub - band at each scale , this produces six directionally selective sub - bands for each scale of the two - dimensional dt - cwt at approximately 15 , 45 , and 75. in dyadic decomposition , sub - bands are allowed to be decomposed in both vertical and horizontal directions sequentially , but in anisotropic decomposition sub - bands are allowed to be decomposed only vertically or horizontally . studies have shown that the anisotropic dual - tree complex wavelet transform ( adt - cwt ) provides an efficient representation of directional features in images for pattern recognition applications . ten basis functions are produced in adt - cwt in each level which makes different orientations at the directions of 81 , 63 , 45 , 27 , and  9. this result in a finer analysis of the local high frequency components of images which is characterized by a finer division of high - pass sub - bands as well as edges and contours , which are represented by anisotropic basis functions oriented in different finer directions . here we use an adaptive basis selection method on undecimated adaptive anisotropic dual - tree complex wavelet transform ( uaadt - cwt ) . the textural features uniformity , entropy , dissimilarity , contrast , correlation , homogeneity , autocorrelation , cluster shade , cluster prominence , max . probability , sum of squares , sum average , sum variance , sum entropy , difference variance , difference entropy , information measures of correlation-1 , information measures of correlation-2 , inverse difference normalized , inverse difference moment normalized are extracted with inter - pixel distance d = 16 , from the 64  64 pixel patches of the tissue images using the standard expressions derived in for the following features extraction techniques ( i ) glcm features : from color delineated blue and brown / black stains channels ( 20 + 20 = 40 features ) and ( ii ) cwcm features : each feature is computed by taking the absolute value of the real and imaginary part of complex co - efficient in four main directions ( 0 , 45 , 90 , and 135 ) for three decomposition levels . finally , for each feature , the mean value over the three decomposition levels is computed for the dt - cwt ( 60 blue channel + 60 brown / black channel = 120 features ) and uaadt - cwt ( 60 blue channel + 60 brown / black channel = 120 features ) . it can model nonlinear relationships , which is useful in practical applications . in svm , a nonlinear input data set is converted into a high dimensional linear feature space via kernels for the non - linear case . a svm classifier with linear kernel is used in the training and testing phase for the classification task using the library for support vector machine ( lib - svm ) tool box with svm parameters -s 0 ( svm type : 0 for c - svc ) , -g ( number of features ) , -r 0 ( coefficient in kernel function ) , -c 1.0 ( parameter c of c - svc ) , -e 0.0010 ( tolerance of termination criterion ) , -p 0.1 ( epsilon value ) . pca - lda - charm  is an algorithm initially inspired by ilya goldberg 's wnd - charm , a whole - image - based classifier . the principle of the original algorithm is to extract features on the whole image ( without segmenting the interesting parts ) , weighting the features depending on their information content , and then classifying them using a modified version of the k - nearest neighbor classifier . the feature vector is built  hierarchically  : it is composed of different kinds of global features ( texture descriptors , edge descriptors , histograms , moments , etc . ) that are computed on the raw image , on several transformed version of the raw image ( fourier transform , wavelet transform , and chebyshev transform ) , and eventually on compound - transformed version of the image ( wavelet - fourier transform , chebyshev - fourier transform ) . pca - lda - charm is using the same idea of building a vector composed of whole - image features . the feature vector is not composed of the exact same elements as the one proposed by ilya goldberg in the original wnd - charm , but the same  groups  of features are present ( texture features , edge features , histograms , transforms . , ) . since the datasets are represented as sets of features in a high - dimensional space and a more robust classification framework than the one suggested in was desired , principal component analysis ( pca ) was used as a pre - processing step to reduce the dimensionality of the feature space , and then a subset of the pca - transformed features was classified using linear discriminant analysis ( lda ) as suggested in . the subset of principal components used for classification was chosen as the minimal number of strongest principal components required to explain at least 98% of the variance in the original data . in order to compare the different feature extraction and classification approaches , 1,057 patches were manually selected from the total of 61,354 patches from 29 core images . the patches were selected to represent comparably clear examples of each of the four classes : background - 193 patches , connective tissue - 462 patches , cytoplasmic staining - 200 patches , and nuclear staining - 202 patches . each of the 1,057 patches was manually / visually classified as showing nucleus stain , cytoplasmic stain , connective tissue or background . this classification result was used as ground truth for evaluation of the automated methods . to evaluate the ground truth , the classification was performed by a different expert , and a second time by the first expert . the inter - observer accuracy was 92% and the intra - observer accuracy 96% as shown in figure 4 . venn diagram for visual scoring of 1,057 patches by two different experts glcm , adt - cwt , and uaadt - cwt co - occurrence features were extracted from each of the 1,057 patches . the waikato environment for knowledge analysis ( weka ) data mining tool used to select the optimal features for the classifier task using half the samples of each class as input . based on the greedy hill - climbing algorithm implemented in weka , 9 , 18 , and 19 features were selected from glcm , adt - cwt , and uaadt - cwt features , respectively . we used five combinations of features for training the classifier : 9 glcm features , 18 dtcwt features , 19 udtcwt features , the combination of glcm + dtcwt features ( 9 + 18 = 27 ) , and the combination glcm + udtcwt features ( 9 + 19 = 28 ) . the pca - lda - charm feature vector was composed of 661 elements from various feature  groups ( edges features , texture features , histograms , moments , and transforms or the image ) extracted using cellprofiler . we used the k - fold cross validation method ( with k = 10 ) to assess classification efficiency for each of the compared methods . the accuracy of each combination of features and classifier is defined as the ratio of the number of samples correctly classified to the total number of samples tested , as presented in table 1 . the pca - lda - charm shows a result ( 90% accuracy ) similar to that of the inter - observer variability ( 92% accuracy ) . classification result using different features ( where n - nucleus stains , c - cytoplasmic stains , t - connected tissue , b - background ) the methods proposed in this paper are general in the sense that they are trained for a variety of features that are not specific for a certain type of objects . using only traditionally used features such as glcm gives low accuracy [ table 1 ] . however , we have obtained good results on this dataset by using combinations of glcm and wavelets ( glcm + uaadt - cwt ) and texture features , edge features , histograms , transforms , etc . , ( wnd - charm ) . in this study , we have shown that the ability of the undecimated anisotropic dt - cwt , which provides distinguished textural features in both positive and negative frequencies resulted in different orientated sub - bands at each scale . also , this proposed method is considerably less complex than previous attempts at producing features . some of the wnd - charm - inspired features are complicated to interpret , and might not generalize well to other cases , and will , thus , require a new training step . the 1,057 patches used in the experiments were selected to represent comparably clear examples of each of the four classes . the goal is of course to have a method that performs well when applied to arbitrary patches ( that , for example , contains more than one class ) from core images and our initial experiments show that we can obtain reasonable good results for some of the methods . this is true for both automatic and manual classification , and correlates with the increasing diversity within the class . for the nuclear class the stain should be located mainly in the nucleus ; however , some weaker stain may also be present in the cytoplasm . for patches with cytoplasmic stain the stain may only be present in the cytoplasm , however , due to the sectioning , the cytoplasm may cover the nucleus , which can appear to be stained . furthermore in the core , there might be unspecific binding of antibody in the connective tissue resulting in a brown stain in between cells , which is neither nuclear nor cytoplasmic . in this study , these patches have been classified as cytoplasmic , however , in future work the classes may have to be revised to accommodate for this staining pattern . we have encountered the variation in staining pattern and intensity between patches for a single antibody within a core . however , repeated immunostaining of the same material will inevitably exhibit variations due to variability in the steps in the staining process . in future work , we will explore variations in the staining process in more detail by analyzing repeated staining and sibling antibodies raised against the same protein . we will also implement and test methods for normalization of contrast and intensity as the samples we process show a large amount of variability . note that in this report , we use low - level image features to classify patches based on the biological content in the patches . the patches are extracted from 29 core images , each with similar noise and artifacts . a previous study has shown that some classification method , that use low - level image features for patch classification , give similar results when applied to the original patches ( from fluorescence microscopy images ) compared to when applied to the original patches with the biological content removed . in this paper , we assume that the patches within a core are independent in terms of staining pattern and intensity as well as noise and artifacts . further experiments are needed to verify that this assumption holds . moreover , since we used different classifiers ( svm and lda ) for the different approaches , further investigation is needed to examine the impact of the choice of methods for feature selection and classification . we can conclude that both human experts and the proposed automated methods have difficulties discriminating between nuclear and cytoplasmic staining patterns . however , the proposed glcm + udtcwt features and the pca - lda - charm , which combine many different classes of features such as glcm and wavelet , have accuracy similar to that of a human expert .
background : the human protein atlas ( hpa ) is an effort to map the location of all human proteins ( http://www.proteinatlas.org/ ) . it contains a large number of histological images of sections from human tissue . 
 tissue micro arrays ( tma ) are imaged by a slide scanning microscope , and each image represents a thin slice of a tissue core with a dark brown antibody specific stain and a blue counter stain . 
 when generating antibodies for protein profiling of the human proteome , an important step in the quality control is to compare staining patterns of different antibodies directed towards the same protein . 
 this comparison is an ultimate control that the antibody recognizes the right protein . in this paper , we propose and evaluate different approaches for classifying sub - cellular antibody staining patterns in breast tissue samples.materials and methods : the proposed methods include the computation of various features including gray level co - occurrence matrix ( glcm ) features , complex wavelet co - occurrence matrix ( cwcm ) features , and weighted neighbor distance using compound hierarchy of algorithms representing morphology ( wnd - charm)-inspired features . 
 the extracted features are used into two different multivariate classifiers ( support vector machine ( svm ) and linear discriminant analysis ( lda ) classifier ) . before 
 extracting features , we use color deconvolution to separate different tissue components , such as the brownly stained positive regions and the blue cellular regions , in the immuno - stained tma images of breast tissue.results:we present classification results based on combinations of feature measurements . the proposed complex wavelet features and the wnd - charm features have accuracy similar to that of a human expert.conclusions:both human experts and the proposed automated methods have difficulties discriminating between nuclear and cytoplasmic staining patterns . 
 this is to a large extent due to mixed staining of nucleus and cytoplasm . 
 methods for quantification of staining patterns in histopathology have many applications , ranging from antibody quality control to tumor grading .