In this paper, we discuss about the importance of Image Segmentation for use in Target Detection. There are many ways to segment an Image into Regions. Depending on the Application, an Image segmentation technique is chosen. We compare available segmentation.

Attribution Non-Commercial (BY-NC)

12 views

In this paper, we discuss about the importance of Image Segmentation for use in Target Detection. There are many ways to segment an Image into Regions. Depending on the Application, an Image segmentation technique is chosen. We compare available segmentation.

Attribution Non-Commercial (BY-NC)

- A Survey on parallelization of image segmentation algorithm
- A System for Recognition of Hummed Tunes
- Arth - Real-Time License Plate Recognition ECW07
- video segmentation using memory reduction techniques
- Real Time Detection and Segmentation of Reflectionally Symmetric Objects in Digital Images
- Final Year Mechnical Projects in Chennai
- Poullis Wacv 2008 Vision Based System
- Image Processing
- A Comparison of Shadow Detection Removal and Reconstruction Methods
- An Efficient Segmentation Technique for Machine Printed Devanagiri Script: Both Line &Word Segmentation
- 2005_ISPA_EnhancedFingerprintSegmentation_Alonso
- 2008_ECCV_The Naked Truth_Estimating Human Shape Under Clothing
- Palm Print Recognition Using Local Binary Patt
- 2001.Image Segmentation With Improved Watershed Algorithm
- Analysis
- Time Series 1
- 10.1.1.3.4148
- ICASSP Speech Paper
- kpl
- A Theoretical Study on Partially Automated Method

You are on page 1of 6

Rohit Kamble, Keshav Kaul

Computer Department, Vishwakarma Institute of Information Technology, Pune kamble.rohit@hotmail.com, kaul.keshav@gmail.com

#

ABSTRACT In this paper, we discuss about the importance of Image Segmentation for use in Target Detection. There are many ways to segment an Image into Regions. Depending on the Application, an Image segmentation technique is chosen. We compare available segmentation. Keywords Object detection, Image Segmentation, Region-based Merging

segmentation algorithm is based on the similarities among the pixels with a region, the similarity can be any property of the region or the pixel. For clustering the collection of pixels of image into meaningful groups of region or objects, the region homogeneity is used as an important segmentation criterion. The widely used cut criteria includes normalized cut [6], minimum cut [8], ratio cut [7] and so on. The basic approaches to region segmentation: Region merging Recursively merge regions that are similar.

I. INTRODUCTION

The common problem encountered in Target detection is choosing a suitable approach for isolating different objects from each other with respect to the background. To make the object different and isolate it from rest of the object we simplify and/or changing the representation of the image by enhancing the visual representation of boundaries. This process is called Image Segmentation [1]. Image segmentation is the primary step towards image analysis for object detection, thus image segmentation is an important process in Image detection and recognition, there are various segmentation techniques like edge detection method[1,3], histogram based method[4,5], region growing method[1,2], region splitting method[1,2], clustering method, etc. The segmentation techniques is a technique which is being developed for ages, if we look back in time the segmentation technique like Edge Detection are based on abrupt changes in image intensity or colour, thus salient edges can be detected. However, due to often discontinued and over-detected resulting edges they can only provide candidates for the object boundaries.

Fig.1 Region merging Region Splitting recursively divide regions that are heterogeneous.

Fig. 2 Region splitting Split and merge iteratively split and merge regions. Image Regions and Partitions: Let Rm S denote a region of the image m M. We say that { Rm|m M} partitions the image if For all m not equal to k, Rm Rk = U Rm = S mM Each region Rm has features that characterize it.

The segmentation technique of region-based segmentation consists of region merging and region splitting [2], and split and merge [2]. The region-based

IJSRET @ 2013

International Journal of Scientific Research Engineering & Technology (IJSRET) Volume 2 Issue2 pp 127-132 May 2013 www.ijsret.org ISSN 2278 0882

The advantages of region-based segmentation method: region carries more information in describing the nature of the object rather than each pixel. The number of regions in an image is much fewer than that of the pixels in an image thusly speeding up the process of region merging process. There are two fundamental issues in a region-based merging algorithm: order of merging and the stopping criterion. After focusing on the issues related to region-based merging we can set a predicate, which is defined by sequential probability ratio test (SPRT)[9]. The predicate becomes the merging factor and decides whether to merge the regions obtained by over segmenting of an image.

Image pre-processing can significantly increase the reliability of an optical inspection. Several filter operations which intensify or reduce certain image details enable an easier or faster evaluation. Before the image is used for over segmentation it is pre-processed as followed: 1) Convert to Grey scale 2) Calculate gradient magnitude 3) Removing noise B. Image Over Segmentation After pre-processing the image it is segmented using watershed algorithm [10]. The major drawback of watershed algorithm is that the result is over segmented (i.e. large number of regions are created). To overcome this problem we have a solution flooding from the selected marker [16+] such that only the most important regional minima are saved for segmentation. C. Labelling Labelling is to label the similar regions after using the image over segmentation by watershed algorithm. With these labels, an image is partitioned into a meaningful collection of regions and objects. Now for to make a region meaningful we need to combine the regions with the help of RAG [13]. The RAG (region adjacency graph) is an algorithm which computes the graph of adjacent regions in a labelled image. Each vertex in the graph represents a region and is associated to some attribute of that region. Let G = (V, E) be an undirected graph, Where viV is a set of nodes corresponding to image elements, E is a set of edges connecting the pairs of neighbouring nodes. Each edge (vi, vj) E has a corresponding weight w ((vi,vj)) The region is represented by a component R V The dissimilarity between two neighbouring regions R1, R2 V as the minimum weight edge connecting them. S (R1,R2) = min w ((vi,vj)) v iR 1,vj R2,(vi ,vj)E (1)

Fig. 3 Flow of the Region Merging Algorithm The following steps are involved in the region merging: A. Image Pre-Processing

The RAG basically helps us to initialise the merging of the image; the advantage of RAG is that it can provide a spatial view of the image.

IJSRET @ 2013

International Journal of Scientific Research Engineering & Technology (IJSRET) Volume 2 Issue2 pp 127-132 May 2013 www.ijsret.org ISSN 2278 0882

After we find the RAG, we will find the region merging predicate which will then decide the merging between the pair of regions. D. Region Merging Predicate The merging of the two regions depends upon the two similarity between the two region , after finding out the similarity between the edges of the two regions the data is however not sufficient to merge the two region thus a predicate P, will decide to merging of the regions. The typical region features are given below: 1) Colour Mean RGB value 1-D colour histograms in R, G, and B 3-D colour histogram in (R,G,B) 2) Texture Spatial autocorrelation Joint probability distribution for neighbouring pixels Wavelet transform coefficients 3) Shape Number of pixels Width and height attributes Boundary smoothness attributes Adjacent region labels The recursive region merging Define a distance function between regions . In general, this function has the form dk,l = D(Rk,Rl) 0 Ideally, D (Rk,Rl) is only a function of the feature vectors fk and fl. dk,l = D(fk, fl) 0 Then merge region with minimum distance. Example of Merging Criteria by predicate: Distance between colour means

2 2 dk,l = Nk | k new| + Nl | l new| (2) Nnew Nnew

2 2 dk,l = ( Nk | k new| + Nl | l new| ) (4) Nnew Nnew 2 2 + (Nk | ck cnew| + Nl | cl cnew| ) Nnew Nnew

Where Nk = |Rk| , k = 1 xs Nk sRk ck = 1 s Nk sRk Rnew = Rk Rl , Nnew = Nk + Nl cnew = Nkck + Nlcl Nnew N new = kk + Nll Nnew There exists another way to find the consistency by the consistency test of cues [14]. The algorithm for consistency test of cues is: P0(x|0) and P1(x|1) are the distributions of visual cues, Ia and Ib are the average colour of sampled data in a and b regions respectively. Ia+b is the average values of the sample, SI is the covariance matrix of the regions, 1 and 2 are scalar parameters, A and B are the upper limit and lower limit of the likelihood ratio[12], and are the probability of the decision error. Present 1; Let 2 =1, =0.05, =0.05; Compute parameters: N0: be a constant greater than max{E{ | 0}, E{ | 1}}; A=log (1-)/, B=log (1-); P0(x| 0), P1(x| 1) are computed using: {P0(x|0) = 1exp(-(Ib-Ia+b)TSI-1(Ib-Ia+b)) (5) {P0(x|1) = 1-2exp(-(Ib-Ia)TSI-1(Ib-Ia)) Input: a pair of neighbouring regions.

2 2 dk,l = Nk | ck cnew| + Nl | cl cnew| (3) Nnew Nnew

IJSRET @ 2013

International Journal of Scientific Research Engineering & Technology (IJSRET) Volume 2 Issue2 pp 127-132 May 2013 www.ijsret.org ISSN 2278 0882

Output: the decision D that the two regions are consistent (D=1) or inconsistent (D=0). 1) Set evidence accumulator and the trials counter n to be 0. 2) Randomly choose m pixels in each of the pair of regions, where m equals the half size of the region. 3) Calculate the distributions of visual cues x using Eq. (5) based on these pixels. 4) Update the evidence accumulator = + log P0( xi|0) P1(xi| 1) 5) If nN0 If A, return D=1 (consistent) If B, return D=0 (inconsistent) If n>N0 If 0, return D=1 (consistent) If <0, return D=0 (inconsistent) 6) Go back to step 2. After we find the region merging predicate we merge the regions together, there are different ways to merge the regions like Recursive merging algorithm [15], statistical merging algorithm [11], dynamic region merging algorithm [14], etc. 1) Recursive merging algorithm Define a distance function between regions dk,l = D(f(Rk), f(Rl)) > 0 Repeat until |M| = 1 { Determine the minimum distance regions (k, l) = arg min {dk,l} k,lM Merge the minimum distance regions Rk Rk Rl MM {l } (6)

2) Dynamic region merging segmentation: Input: the initially over segmented image S0. Output: region merging result. 1) Set i=0. 2) For each region in segmentation Si, use Algorithm 1 to check the value of predicate P with respect to its neighbouring regions. 3) Then merge the pairs of neighbouring regions whose predicate P is true, such that segmentation Si+1 is constructed. 4) Go back to step 2 until Si+1 = Si. 5) Return Si.

III.

RESULTS

Fig. 5 Result after segmenting the Example (1) Image by dynamic region merging

IJSRET @ 2013

IV.

CONCLUSIONS

Thus we conclude this paper by describing briefly about the different techniques of region merging and its implementation. We also discussed about the various ways of finding the predicate for the region merging like the consistency test of cue used in dynamic region merging and distance between color means, region center, etc. Fig. 6 Example (2) Image of an landscape

REFERENCES

[1] Linda G. Shapiro and George C. Stockman (2001): Computer Vision, pp 279-325, New Jersey, PrenticeHall, ISBN 0-13-030796-3 [2] M. Petrou and P. Bosdogianni, Image Processing the Fundamentals, Wiley, UK, 2004. [3] J. Canny. A Computational Approach to Edge Detection, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, pp. 679-698, 1986. [4] Arifin, A.Z., Asano A., 2004. Image Thresholding by Histogram Segmentation Using Discriminant Analysis. In: Proceedings of Indo-nesiaJapan Joint Scientific Symposium 2004: IJJSS04, pp. 169174 [5] Cheng, H.D., Jiang, X.H., Wang, J., 2002. Color image segmentation based on homogram thresholding and region merging. Pattern Recognition 35, 373393 [6] J. Shi and J. Malik. Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI) 2000. [7] S. Wang, J. M. Siskind. Image Segmentation with Ratio Cut, IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(6):675-690, 2003. [8] Z. Wu and R. Leahy. An optimal graph theoretic approach to data clustering Theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence. November 1993. [9] A. Wald. Sequential Analysis. Wiley Publications in Statistics, Third ed. Wiley, 1947. [10] S. Beucher. Watershed, hierarchical segmentation and waterfall algorithm. In Mathematical Morphology and Its Applications to Image Processing. Boston, MA: Kluwer, 1994, pp. 69-76. [11] Nock, Richard and Nielsen, Frank (November 2004). "Statistical Region Merging". Retrieved January 1, 2013. [12] Wilks, S. S. (1938). "The Large-Sample Distribution of the Likelihood Ratio for Testing Composite Hypotheses". The Annals of Mathematical Statistics9: 6062. doi:10.1214/aoms/1177732360

Fig. 7 Result after segmenting the Example (2) Image by dynamic region merging

Fig. 9 Result after segmenting the Example (3) Image by Statistical Region Merging

IJSRET @ 2013

[13] A. Trmeau and P. Colantoni. Regions adjacency graph applied to color image segmentation. IEEE Transactions on Image Processing. Vol. 9, pp. 735-744, 2000. [14] B. Peng, L. Zhang and D. Zhang, Automatic Image Segmentation by Dynamic Region Merging, IEEE T rans. Image Processing, vol. 12, no. 12, pp. 3592-3605, 2011. [15]http://homepages.inf.ed.ac.uk/rbf/CVonline/LOCAL _COPIES/MARBLE/medium/segment/recurse.htm [16] B. Marcotegui, S. Beucher. Fast implementation of waterfall based on graphs. Volume 30 of Computational Imaging and Vision, pages 177-186. Springer-Verlag, Dordrecht, (2005).

IJSRET @ 2013

- A Survey on parallelization of image segmentation algorithmUploaded byInternational Journal for Scientific Research and Development - IJSRD
- A System for Recognition of Hummed TunesUploaded byfabi_kuleff
- Arth - Real-Time License Plate Recognition ECW07Uploaded bysweety401
- video segmentation using memory reduction techniquesUploaded byGandham Rajesh
- Real Time Detection and Segmentation of Reflectionally Symmetric Objects in Digital ImagesUploaded bywai_li_8
- Final Year Mechnical Projects in ChennaiUploaded byThirumal Krishnan
- Poullis Wacv 2008 Vision Based SystemUploaded byfernandovaras2005
- Image ProcessingUploaded byManoj Kumar
- A Comparison of Shadow Detection Removal and Reconstruction MethodsUploaded byIJSTE
- An Efficient Segmentation Technique for Machine Printed Devanagiri Script: Both Line &Word SegmentationUploaded byInternational Organization of Scientific Research (IOSR)
- 2005_ISPA_EnhancedFingerprintSegmentation_AlonsoUploaded byLuz TP
- 2008_ECCV_The Naked Truth_Estimating Human Shape Under ClothingUploaded bycherryjiao1986
- Palm Print Recognition Using Local Binary PattUploaded byAnkur Gupta
- 2001.Image Segmentation With Improved Watershed AlgorithmUploaded bySathish Kumar
- AnalysisUploaded bySailendra Kumar
- Time Series 1Uploaded byMayank Mittal
- 10.1.1.3.4148Uploaded bySiêu Văn Trùm
- ICASSP Speech PaperUploaded byZahoor Ahmad Khan
- kplUploaded byKoratala Harsha
- A Theoretical Study on Partially Automated MethodUploaded byInternational Journal of Research in Engineering and Technology
- Medical Image Segmentation Using Deformable Models and Local Fitting BinaryUploaded bytirumala.sri1
- IMAGE PROCESSING BASED GIRTH MONITORING AND RECORDING SYSTEM FOR RUBBER PLANTATIONSUploaded bysipij
- remote.pdfUploaded byManjunath HS
- Implementation of a Parallel and Pipelinedwatershed Algorithm OnUploaded byAnonymous uspYoqE
- Full Paper ISPRS v6Uploaded byJigg Pelayo
- Computer Vision Ch16Uploaded byLee RickHunter
- Alvarez Eccv 12Uploaded bycseteaniko
- RrrrrrUploaded bySanjay Shelar
- Superpixel-Based PolSAR Images Change DetectionUploaded byWesley George
- Chapter 3Uploaded byQue Samaon

- A Systematic Literature Review on Network Attacks, Classification and Models for Anomaly-based Network Intrusion Detection SystemsUploaded byijsret
- Thermal analysis on Characterization of Polycaprolactone (PCL) – Chitosan Scaffold for Tissue EngineeringUploaded byijsret
- On JAM of Triangular Fuzzy Number MatricesUploaded byijsret
- CONSRUCTION OF A DIRECT SOLAR DRYER FOR PERISHABLE FARM PRODUCTSUploaded byijsret
- CHANGES IN ANTI OXIDANT ENZYME ACTIVITIES IN Pseudomonas syringae pv syringae (BACTERIAL BROWN SPOT) INFECTED SEEDLINGS OF Vigna radiata L.Uploaded byijsret
- A Review of Matrix multiplication in Multicore Processor using Interconnection NetworkUploaded byijsret
- Design and Manufacture of Carbon-free CarUploaded byijsret
- A Review on Data De-Duplication Techniques for Managing Data into CloudUploaded byijsret
- A Review of Large-Scale RDF Document Processing in Hadoop MapReduce FrameworkUploaded byijsret
- An Approach to Bug Triage: A ReviewUploaded byijsret
- An Augmented Anomaly-Based Network Intrusion Detection Systems Based on Neural NetworkUploaded byijsret
- A Review on Natural Fibre Polymer CompositesUploaded byijsret
- A DISTINCT METHOD TO FIND THE CRITICAL PATH AND TOTAL FLOAT UNDER FUZZY ENVIRONMENTUploaded byijsret
- SOURCE IDENTIFICATION FOR ANONYMOUS ATTACKS WITH DETERMINISTIC PACKET MARKINGUploaded byijsret
- Comparative Study and Review on Object Oriented Design MetricsUploaded byijsret
- MECHANICAL AND FRACTURE TOUGHNESS ANALYSIS OF WOVEN CARBON FIBRE REINFORCED EPOXY COMPOSITESUploaded byijsret
- Solving a Decision Making Problem Using Weighted Fuzzy Soft MatrixUploaded byijsret
- Echo Cancellation System in VOIP using MATLABUploaded byijsret
- A Review on Fingerprint Detection and Recognization TechniquesUploaded byijsret
- A Review on Face Detection and Recognization TechniquesUploaded byijsret
- Experimental Investigation and Numerical Simulation of Marble Dust Filled Aramid Fibre Reinforced Epoxy Composite for Wind Turbine Blade ApplicationUploaded byijsret
- Automated Personalized Face Detection using Viola DetectorUploaded byijsret
- AUGMENTATION HEAT TRANSFER IN A CIRCULAR TUBE USING CONICAL RING AND TWISTED TAPE INSERTUploaded byijsret
- Demographic Differences in Postgraduate Students’ Attitudes and Use of ICT Facilities in Rivers State University of Science and Technology, Port HarcourtUploaded byijsret
- BLENDING BEHAVIOR OF COTTON AND POLYESTER FIBERS ON DIFFERENT SPINNING SYSTEMS IN RELATION TO PHYSICAL PROPERTIES OF BLENDED YARNSUploaded byijsret
- NUMERICALLY INVESTIGATING EFFECTS OF CHANNEL ANGLE, FRICTION AND RAM VELOCITY ON STRAIN HOMOGENEITY IN ECAPUploaded byijsret
- Comparison of workpiece geometry and its effects on ECAP process by FEAUploaded byijsret
- Content Based Image Retrieval using Color featureUploaded byijsret
- STRATEGIES OF EFFECTIVE TEACHING AND LEARNING PRACTICAL SKILLS IN TECHNICAL AND VOCATIONAL TRAINING PROGRAMMES IN NIGERIAUploaded byijsret

- Abstract Post TensionUploaded byDe Silva Shmapk
- Gamblers RuinUploaded byKarioca No Rio
- Gegn8502 Iss 1Uploaded bymkashkooli_scribd
- Hip Radiology UchUploaded byAdriana Pavalache
- D845GLVA ProductGuide EnglishUploaded byjaijak
- Dynamic Analysis & Optimization of Prestressed Concrete Box Girder Bridge SuperstructureUploaded byIJRASETPublications
- A3 Conc. Classification.pdfUploaded byUsman Afzal
- Intel Core i5 PptUploaded byjeet1111
- Casino 3Uploaded byaconnel
- Human Nails as a Biomarker of Element ExposureUploaded byM S Rihawy
- Uranium Corporation of India LimitedUploaded byAbhishek Azad
- Spine Beam - SCHEME 4.xlsUploaded byEdi Obrayan
- Lung Sound and Harrison StaffUploaded byBianca Oprisan
- HP / Compaq Quick Troubleshooting GuideUploaded byRAM_Arbeitsspeicher
- 01 Rainflow Cycle Counting a Historical Perspective4Uploaded byVictor Pugliese
- DSP Lect 11 Iir DesignUploaded bySayyeda Umbereen
- LSH Nov Lunch Menu.docxUploaded bySpartanSpirit
- PAPER (2)Uploaded byNiraj Mishra
- Solution Assignment 1st WeekUploaded byAbhishek Kumar
- chapter 1Uploaded bysoontobengineer
- Infectious Disease & Hum Hst - HLTH 150 Z1 - Course SyllabusUploaded byContinuing Education at the University of Vermont
- RenaultUploaded byrohitmahato10
- Microchips MCP3912-19 Energy AFEs_Press Release_clean VersionUploaded byKelvin Cooper
- Paint Application Specifications and Guides - Commentary on Paint Application.pdfUploaded byMarcos Leite
- Cost AccountingUploaded byFahad Mohiuddin Ahmed
- NARRATIVE-REPORT-OJT.docxUploaded byAdjahCarreon
- Conbextra_EP300Uploaded byabhay_joshi2002
- Adtran Span Tree Config GuideUploaded bySk Abdul Latief
- Career Research WorksheetUploaded byTiffany
- 2020 Tsa Catalogue DigitalUploaded byAnonymous 41I2MkV3Z

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.