Extraction of Semantic Coherent Regions Using Bayesian Nearest

Volume 2, Issue 8, August 2012

ISSN: 2277 128X

International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com

Extraction of Semantic Coherent Regions Using Bayesian Nearest Neighbor Search P.Navaneetham*

S.Pannirselvam

Department of Computer Applications, Velalar College of Engg. and Tech., Erode, India

Department of Computer Science, Erode Arts & Science College,Erode, India

Abstract - In image processing, mining of semantic objects from images is one of the most significant and demanding problems in image examination. Nowadays, numerous schemes are there where this type of processing is absolutely desired. A first request of these thoughts is compression where diverse objects are implied with diverse quality which permits the exploitation and communication with the objects in the image. For semantic image segmentation, the common potts model [2] is used for spatial coherency that extends the higher order spatial semantic coherent class labels. However, the extraction of semantic regions is not so obvious and devours more time to develop the semantic regions. To overcome this, in this paper, we are going to present a scheme for extracting and clustering the semantic coherent regions obtained from the semantic connected coherent criteria discussed in the previous paper. The segregated semantic coherent regions are clustered based on Bayesian nearest neighbor search with neighborhood pixels. After clustering the semantic coherent regions of image, the segmentation of semantic regions alone takes place by adapting the cluster object purity obtained through the semantic connected coherent regions criteria. Then the clustered image regions are post processed with linear noise filters. An experimental evaluation is conducted with the set of images to estimate the performance of the proposed extraction of semantic coherent regions using Bayesian nearest neighbor search [ESCRBNN] in terms of cluster object purity, coherent region search efficiency, and computational complexity. Keywords: Image segmentation, semantic coherence, BNN search

I. INTRODUCTION Image segmentation is an expansively considered area with a extensive history. It is, possibly, the most demanding and decisive crisis in image processing and investigation. The principal complexity encountered in image processing is the capability of techniques to haul out semantic objects properly from an image with no previous knowledge. Once a number of semantically prominent and significant regions have been recognized, it is probable to enumerate their locations and spatial organizations correlatively. Abundant methods have previously been proposed for image segmentation, which differ from k-means algorithm to thresholding measures, to heuristic region growing processes, and to the refined hierarchical methods. The crisis of image classification has drained significant consideration in the Computer Vision community. The rigorous attempt of the study community in the previous few years resulted in numerous new approaches for image classification, that evoluted the field rapidly in an only some years. The k-means algorithm, the best recognized and most extensively used clustering technique, is not capable to switch unbalanced lengthened clusters, where one cluster has much more points than an adjacent cluster. In those cases, the k-means algorithm will speciously divide the better cluster into synthetic sub-clusters. Image thresholding methods are also admired owing to their ease and competence. To discover visually semantic coherent segments which have no sufficient mathematic depiction fitting well with individual image system. Therefore, many researchers just establish from the perception of their image discernment and decision method to conclude the semantic coherence of regions. There is a confident recognized similarity among our region coherence and the two measures stated below.

(max ({I ( p)})  min ({I ( p)}))  T , p  R pR

pR

…….. eqn 1 It ensures all the adjacent pixels p of region R to build out whether region R is still rational if a neighborhood pixel p is introduced into it. If (eqn 1) is fulfilled, then the region’s consistency is not damaged and the pixel p is added to the region R. Such a measure is horizontal to an over-segmentation for a province with regularly varying gray value when the change goes beyond the threshold T. Usually, an image segmentation algorithm comprises of the subsequent three vital steps: 1. Simplification: Proposes to eliminate from the creative image all the inappropriate information from the precise application. The most significant object is that this step should not transform the pertinent information and should esteem the mode the image was created. 2. Feature extraction: The precise features of the data determined the segmentation. The variety of features depends on the relevance and preferred segmentation 3. Decision: The ultimate separation is dogged using the features attained. © 2012, IJARCSSE All Rights Reserved

Page | 503

Navaneetham et al., International Journal of Advanced Research in Computer Science and Software Engineering 2 (8), August- 2012, pp. 503-510 Region growing methods conversed with spatial repartition of the image feature information. In general, they transmit out better than the threshold techniques for different sets of images. Though, the characteristic region mounting processes are essentially sequential. The regions produced based both on the order in which pixels are observed and on the importance of pixels which are first observed and grouped to explain every new segment. Hierarchical approaches, such as the split-and-merge methods, frequently produce tough objects in segmentation. The province margins have ragged emergence; prolonged, slight, gesture objects are convoluted to separate. These apprehensions pointed out beyond have simulated that the complexity of segmenting an image is important and composite. Moreover, there is no brittle explanation of the idea itself. The only steady categorization of segmentation is the assertion of the crucial aim, recognizing regions of semantic consistency. In this paper, we are going to present a scheme for extracting and clustering the semantic coherent regions obtained from the semantic connected coherent criteria discussed in the previous paper. The segregated semantic coherent regions are clustered in this paper based on Bayesian nearest neighbor search of neighborhood pixels. After clustering the semantic coherent regions of image, the segmentation of semantic regions alone takes place by adapting the cluster object purity obtained through the semantic connected coherent regions criteria. Then the clustered image regions are post processed with linear noise filters. II. LITERATURE REVIEW Image segmentation is a broadly considered part with an extensive history. It is, possibly, the most demanding and serious crisis in image processing and examination. The primary complexity met in image processing is the capability of techniques to mine semantic objects properly from an image with no previous knowledge. The paper [1] offered a connected coherence tree algorithm (CCTA) for image segmentation with no previous information. It intends to discover regions of semantic consistency supported on the proposed -neighbor consistency segmentation measure. More particularly, with an adaptive spatial level and an proper intensity divergence scale, CCTA often attains numerous sets of coherent neighboring pixels which exploit the prospect of being a distinct image contented (counting kinds of composite backgrounds). A new provisional random field (CRF) [2] for semantic segmentation that expands the general Potts representation of spatial coherency with hidden topics, which detain higher-order spatial dealings of segment labels. Particularly, we illustrate how current approaches for creating sets of figure-ground segmentations can be leveraged to create an appropriate graph illustration for this task. The CRF model includes such scheme segmentations as topics [3], representing the combined incidence or deficiency of object classes. In [5], construct on these current developments and present a effortless, but efficient representation for the job of semantic prospect segmentation. The representation is a provisional random field with two sets of arbitrary variables: segments and regions. Flat CRF models, such as [4], are devised on class coursework of super-pixels and castigate diverse labels of neighbors by a pair-wise leveling term. In case of [6], the spatial relation is anticipated from teaching data. [7] In addition believes image features on super-pixels and their straight neighbors. These facial appearances are then divided, important to spatially vigorous decisions [11]. All these methods employ a flat region relation to devise spatial reliability. Hierarchical CRFs in disparity, endorse spatial brand consistency utilizing higher-level entities to combine pixel classes. [9] employs a tree-structured CRF on iteratively developed super-pixels that permits proficient parameter knowledge. Current extensions [8] enhance this hierarchical CRF with higher-order potentials to integrate image-level in sequence and encourage softness amongst many pixels. Our ultimate purpose of the research is to determine visually semantic coherent segments [10] that have no adequate mathematic elucidation appropriate well with human being visual system [12]. Consequently, numerous researchers currently start from the impulse of their visual examination and resolution process to institute the semantic coherence of regions. Hence, in this paper, we present semantic BNN search for extraction of semantic coherent regions. Based on these criteria, ESCRBNN identifies different collections of coherent neighboring pixels which utilize the likelihood of being a discrete physical object. III. PROPOSED EXTRACTION OF SEMANTIC COHERENT REGIONS USING BAYESIAN NEAREST NEIGHBOR SEARCH The proposed effort is efficiently used for identifying and processing the semantic coherent regions of the image are clustered based on Bayesian nearest neighbor search of neighborhood pixels. Then the cluster object purity is evaluated for each semantic coherent region and the segmented regions are extracted in terms of the finest cluster object purity obtained through semantic coherent regions. The proposed extraction of semantic coherent regions using Bayesian nearest neighbor search [ESCRBNN] is worked under two different phases. The architecture diagram of the proposed extraction of semantic coherent regions using Bayesian nearest neighbor search [ESCRBNN] is shown in fig 3.1.

© 2012, IJARCSSE All Rights Reserved

Page | 504

Navaneetham et al., International Journal of Advanced Research in Computer Science and Software Engineering 2 (8), August- 2012, pp. 503-510

Fig 3.1 Architecture diagram of the proposed ESCRBNN

The first phase is to describe the overview of semantic connected coherence criteria for image segregation. The second phase describes the process of clustering of semantic coherent regions using Bayesian nearest neighbor search of neighborhood pixels. The segmentation regions are extracted from the images based on the cluster object purity obtained through semantic coherent regions. From the fig 3.1, the segmented coherent regions are extracted based on BNN search with neighborhood pixels. The semantic coherent regions are obtained through connected coherent semantic structure criteria and BNN search is used for clustering process based on neighboring pixels obtained in it. Semantic coherent regions are clustered based on Bayesian nearest neighbor search of neighborhood pixels. The segmentation regions are extracted from the images based on the cluster object purity obtained through semantic coherent regions. The clustered image regions are post processed with non linear noise filters. A. Overview of semantic connected coherence criteria Considering the eventual objective of image segmentation stated above, it is reasonable to evaluate the efficiency of semantic connected coherence criteria with respect to its ability of identifying the semantic coherence regions. If a region contains any seed pixel, it’s neighboring pixels in the set are coherent with which must be in the similar region as seed pixel. If the pixels within the similar region are related each other, it is probable that the neighbors of every pixel in this region belong to the similar part. For a reverse case, choose a pixel in a segmented region, whose neighbors frequently belong to other regions. Such a segmentation outcome is ineffective because it conflicts to the conception of image segmentation, i.e., maximizing the within-region relationship and minimizing the between-region relationship. Therefore, we stand out such a reasonable examination with the name of neighbor coherence segmentation. If a current region contains any seed pixel, its neighboring pixels are coherent and must be segmented into the similar region as the seed pixel. More dynamically speaking, the neighbor coherence segmentation describes a transitive relationship. Explicitly, consider x  seed , y  seed and z  seed , if z is one of the neighbors of y while y is one of the neighbors of x, together with its all neighbors is assembled into the similar region as and mutually with its all neighbors is assembled into the similar region as x. In this way, together with its all neighbors is evidently in the similar region as x. The main task is to discover all points concerned in the sequence operation and then shift them all at once into a cluster or region B. BNN search for extraction of semantic coherent regions Semantic segmentation of natural images intends to partition the image into semantically significant regions. Depending on the job, each region symbolizes high-level information for instance entity object illustrations or object parts, kinds of surfaces, or entity class labels. Semantic segmentation is a demanding investigate crisis in computer vision main growth has been completed in the previous decade, creating from three developments: Algorithmic progresses with BNN search in assumption and estimation for these extraction of semantic coherent region process, as well as insights in how to construct these models proficiently has allowed more performance gains. Segmentation and object recognition priors that are self-sufficient of the object class have been urbanized. Integrating such priors into a segmentation form has confirmed to capitulate large performance gains. The process of extraction of semantic coherent regions is shown in fig 3.2.

© 2012, IJARCSSE All Rights Reserved

Page | 505

Navaneetham et al., International Journal of Advanced Research in Computer Science and Software Engineering 2 (8), August- 2012, pp. 503-510

Fig 3.2 Process of extracting semantic coherent regions

Segments are great overlying parts of the image, which we extort using embarrassed parametric min-cuts. Each section is more expected to be consistent with value to the semantic cataloging of the image, but since diverse segments overlie there may subsist various contradicting segments. Regions are slighter entities that dividing the image; employ super pixels to refine these regions. Since regions are diminutive, we can imagine that they are pure in the semantic classification. Yet, regions are classically too diminutive to envelop a complete semantic illustration such as an object. The two primitives are employed into one rational semantic segmentation representation. To that end, segments signify latent topics and regions signify the definite reliable image labeling. The two components are attached by an interface term that contacts semantic labels of regions with hidden segment-level topics. Given a training set of semantic coherent regions extracted using semantic connected coherence criteria allocated each to one of C classes, the classical Bayesian nearest-neighbor procedure is a method that allocates new individuals to the most common class in their neighborhood pixels among the training set, the neighborhood pixels being dined in terms of the covariates. The neighborhood state space of the pixels is defined with the covariates. More officially, based on a training dataset ((b i; ai)) n i=1 where bi ϵ {1,…,Cc} implies the class label of the ith point and ai ϵ Rp is a vector of covariates, an unobserved class bn+1 related with a novel deposit of covariates an+1 is expected by the majority frequent class amongst the nearest neighbors pixels of an+1 in the training set (ai)n i=1. The neighborhood pixels are identified in the space of the covariates ai, specifically,

N n n1  {1  i  n; d (ai , an1 )  d (an1 ) ( n) }

….. eqn 2

Where d (an+1) – distance vector to an+1 Through the identification of neighborhood pixels covariates, the clustering process is done efficiently done by adapting BNN. After clustering the semantic coherent regions, BNN search is extensively used which constructs the search based on neighborhood pixels. Then the segmented regions are extracted from the clustered part of the image based on the cluster object purity. The level of the cluster object purity decides the finest clustered semantic regions in the given input image. The purity of a clustering solution done through BNN search with semantic coherent regions is the average precision of the clusters relative to their best matching classes. For a single cluster S j, purity is defined as the ratio of the number of objects in the dominant cluster to the total number of objects,

Purity ( S j ) 

1 max( Lij ) … eqn 3 S j i 1,..,k , j i

Where Lij is the number of objects from class Ri into cluster Sj, and |Sj| is the number of objects in cluster Sj. To evaluate the total purity of entire cluster k, the average of cluster wise purities are weighted by cluster size as,

Overallpurity 

1 n

k

 j 1

max ( Lij ) -- Eqn 4

i 1, 2 ,...,k , j  i

The above equations are used to estimate the level of cluster object purity of each clusters clustered through BNN search with neighborhood pixels through semantic coherent regions. Through the cluster object purity, the segmentation regions are extracted from the cluster for further process.

IV. EXPERIMENTAL EVALUATION To evaluate our proposed extraction of semantic coherent regions using Bayesian nearest neighbor search scheme, experimentally bring out extensive evaluations with presented Scheme, ESCRBNN. The proposed ESCRBNN scheme is implemented in MATLAB. The collected works of natural images is obtained for the evaluation of ESCRBNN. The natural images are more complicated in that they embraced extensive discrepancies in scale, substance look, lighting conditions, and antenna noise. ESCRBNN segments the natural images into abundant spatially rational groups of pixels analogous to physically object in the standard world. With a less facts regarding the image, it is practically difficult to achieve the exceptional semantic segmentation for an unsupervised method to retrieve the semantic

© 2012, IJARCSSE All Rights Reserved

Page | 506

Navaneetham et al., International Journal of Advanced Research in Computer Science and Software Engineering 2 (8), August- 2012, pp. 503-510 coherent regions. But the proposed ESCRBNN has succeeded in doing this job by adapting the Bayesian nearest neighbor search with neighboring pixels. ESCRBNN initial work on the semantic connected coherence criteria for the image segregation. Semantic coherent regions are clustered based on Bayesian nearest neighbor search of neighborhood pixels. The segmentation regions are extracted from the images based on the cluster object purity obtained through semantic coherent regions. Tiny objects spread over the great background in an arbitrary manner. Even though the existing potts model approach has formed magnificent outcomes for these complex images, the intrinsic systematical assumption is too tricky to understand for non experts. It will thwart its widespread appliance to other types of images. The proposed method ESCRBNN, however, contains a Bayesian Nearest neighbor search criterion for clustering the semantic coherent regions which is simple to understand and realize through the cluster object purity. As a result, our ESCRBNN scheme flexibly deals with all kind of images. The performance of the proposed extraction of semantic coherent regions using Bayesian nearest neighbor search scheme is measured in terms of i) cluster object purity, ii) coherent region search efficiency, and iii) Computational complexity V. RESULTS AND DISCUSSION The experiments are taken over with the sample set of input natural image. Semantic coherent regions are clustered based on Bayesian nearest neighbor search of neighborhood pixels. After obtaining the cluster object purity of the given input image, semantic coherent regions are identified and processed through segmented portions of the image. Semantic coherent regions of the given input image are clustered based on Bayesian nearest neighbor search of neighborhood pixels and identified the neighborhood segmentation based pixels. Perceptually explained appropriate substances in the image and such regions are set by combining all coherent pixels. Thus, it is important to begin what type of image pixels is rational. Automatically, it is supportive to consider of the observation coherence in terms of the strength difference between nearby contiguous pixels. The below table and graph describes the performance of the proposed extraction of semantic coherent regions using Bayesian nearest neighbor search scheme. Table 5.1 No. of clusters vs. Cluster object purity

No. of clusters

Cluster object purity (%) Proposed ESCRBNN Existing Potts’ model 25 12 36 23 49 31 60 40 68 46

2 4 6 8 10

The above table (table 5.1) describes the cluster object purity of the semantic coherent regions in the given image. The effect of the proposed extraction of semantic coherent regions using Bayesian nearest neighbor search scheme is compared with an existing potts model.

Fig 5.1 No. of clusters vs. Cluster object purity

Fig 5.1 describes the cluster object purity based on number of clusters formed with semantic coherent regions. In the proposed ESCRBNN, using semantic connected coherent criteria, the semantic coherent regions are segregated. The BNN search is applied to the semantic coherent regions based on the presence of neighborhood pixels. Then the segmented regions are extracted using cluster object purity obtained through semantic coherent regions. Based on cluster object purity, the clustering efficiency is identified. The cluster object purity is evaluated in the equation specified in eqn © 2012, IJARCSSE All Rights Reserved

Page | 507

Navaneetham et al., International Journal of Advanced Research in Computer Science and Software Engineering 2 (8), August- 2012, pp. 503-510 3. Compared to an existing potts model [2] of spatial coherency with hidden topics, which confine higher-order spatial dealings of section labels, the proposed extraction of semantic coherent regions using Bayesian nearest neighbor search scheme provides the finest cluster object purity and the variance is 25-35% high in the proposed ESCRBNN. Table 5.2 No. of coherent regions vs. semantic coherent search efficiency

No. of coherent regions

Semantic coherent search efficiency Proposed ESCRBNN Existing Potts’ model 24 15 36 22 50 31 62 42 75 50

20 40 60 80 100

Semantic coherent search efficiency

The above table (table 5.2) describes the semantic coherent regions search efficiency for the given image. The effect of the proposed extraction of semantic coherent regions using Bayesian nearest neighbor search scheme is compared with an existing potts model.

80 70 60 50 40 30 20 10 0 0

20

40

60

80

100

120

No. of coherent regions Proposed ESCRBNN

Existing Potts' model

Fig 5.2 No. of coherent regions vs. semantic coherent search efficiency

Fig 5.2 describes the semantic coherent search efficiency based on the number of coherent regions presented for clustering process. In the proposed ESCRBNN, since the cluster object purity is high, the semantic coherent regions are clustered using BNN search and the regions are identified in a reliable manner. The segmentation regions are extracted from the images based on the cluster object purity obtained through semantic coherent regions. Through the cluster object purity, the semantic coherent regions are extracted from the images for image segmentation. Compared to an existing potts model of coherency with hidden topics, which confine higher-order spatial dealings of section labels, the proposed extraction of semantic coherent regions using Bayesian nearest neighbor search scheme provides the finest search efficiency and the variance is 25-35% high in the proposed ESCRBNN. Table 5.3 No. of clusters vs. Computational complexity

No. of clusters 2 4 6 8 10

Computational complexity Proposed ESCRBNN Existing Potts’ model 5 15 3 10 6 13 2 12 8 14

The above table (table 5.3) describes the computational time and work consumed for performing the desired scheme. The effect of the proposed extraction of semantic coherent regions using Bayesian nearest neighbor search scheme is compared with an existing potts model. Fig 5.3 describes the computational complexity raises based on number of clusters with the semantic coherent regions. Based on number of clusters formed for the semantic coherent regions, the computational complexity raised for the cluster formation is less in the proposed extraction of semantic coherent regions using Bayesian nearest neighbor search scheme, since it consumes less time and less work to perform the extraction of semantic coherent regions. Compared to an existing potts model of coherency with hidden topics, which confine higher-order spatial dealings of section labels, the proposed extraction of semantic coherent regions using Bayesian nearest neighbor search scheme

© 2012, IJARCSSE All Rights Reserved

Page | 508

Navaneetham et al., International Journal of Advanced Research in Computer Science and Software Engineering 2 (8), August- 2012, pp. 503-510

Compuational complexity

provides the finest complexity based on computing the semantic coherent regions and the variance is 20-30% less in the proposed ESCRBNN.

16 14 12 10 8 6 4 2 0 0

2

4

6

8

10

12

No. of clusters Proposed ESCRBNN

Existing Potts' model

Fig 5.3 No. of clusters vs. Computational complexity

From the work, it is being observed that the ESCRBNN correctly finds the tiny object and achieves better results, although the number of regions is identical or similar. While ESCRBNN guarantee to find the best solution for extraction of segmented images, it practically performs quite well. It appears that ESCRBNN outperforms potts’ model which provides low level efficiency constantly. VI. CONCLUSION In this paper, we have introduced an extraction of semantic coherent regions using Bayesian nearest neighbor search scheme for image clustering process. Initially, ESCRBNN have performed the semantic connected coherence criteria for the image segregation at first. Then Bayesian nearest neighbor search of neighborhood pixels have been used to cluster the semantic coherent regions. Based on the cluster object purity obtained through semantic coherent regions, the segmentation regions have extracted from the images. The clustered image regions are post processed with non linear noise filters. Experimentation is carried out on collection of natural images to evaluate the performance of the proposed extraction of semantic coherent regions using Bayesian nearest neighbor search [ESCRBNN]. Performance metrics used in the evaluation of ESCRBNN are semantic coherent pixel size, purity levels of the cluster, segmented coherent region search efficiency, and computational complexity. REFERENCES [1]

Jundi Ding, Runing Ma et. Al., “A Scale-Based Connected Coherence Tree Algorithm for Image Segmentation”, IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 17, NO. 2, FEBRUARY 2008

[2]

Christoph Dann1, Peter Gehler et. Al., “Pottics – The Potts Topic Model for Semantic Image Segmentation”, in Proc. of the 34th DAGM-Symposium, 2012.

[3]

Batra, D., Sukthankar, R., Chen, T.: Learning class-specific affinities for image labelling. In: CVPR (2008)

[4]

Carreira, J., Li, F., Sminchisescu, C.: Object Recognition by Sequential Figure-Ground Ranking. IJCV August (2011)

[5]

Carreira, J., Sminchisescu, C.: Constrained parametric min-cuts for automatic object segmentation. In: CVPR. pp. 3241–3248 (2010)

[6]

Fulkerson, B., Vedaldi, A., Soatto, S.: Class segmentation and object localization with superpixel neighborhoods. In: ICCV (2009)

[7]

Nowozin, S., Lampert, C.: Structured Learning and Prediction in Computer Vision. Foundations and Trends in Computer Graphics and Vision 6(3-4), 185–365 (2011)

[8]

Pantofaru, C., Schmid, C.: Object recognition by integrating multiple image segmentations. In: ECCV. Springer (2008)

© 2012, IJARCSSE All Rights Reserved

Page | 509

Navaneetham et al., International Journal of Advanced Research in Computer Science and Software Engineering 2 (8), August- 2012, pp. 503-510 [9]

A. Achim, E. E. Kuruoglu, and J. Zerubia, “SAR image filtering based on the heavy-tailed Rayleigh model,” IEEE Trans. Image Process., vol. 15, no. 9, pp. 2686–2693, Sep. 2006.

[10]

P. Kohli, J. Rihan, M. Bray, and P. H. S. Torr, “Simultaneous segmentation and pose estimation of humans using dynamic graph cuts,” Int. J. Comput. Vis., vol. 79, no. 3, pp. 285–298, 2008.

[11]

V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, and C. Rother, “Probabilistic fusion of stereo with color and contrast for bilayer segmentation,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 28, no. 9, pp. 1480–1492, Sep. 2006.

[12]

Yan Nei Law, Hwee Kuan Lee, and Andy M. Yip, “A Multiresolution Stochastic Level Set Method for Mumford– Shah Image Segmentation” IEEE transactions on image processing, vol. 17, no. 12, december 2008.

© 2012, IJARCSSE All Rights Reserved

Page | 510