DOCSLIB.ORG

A Review of Image Segmentation Using Clustering Methods

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Review of Image Segmentation Using Clustering Methods International Journal of Applied Engineering Research ISSN 0973-4562 Volume 13, Number 5 (2018) pp. 2484-2489 © Research India Publications. http://www.ripublication.com A Review of Image Segmentation using Clustering Methods Sandeep Kumar Dubey Department Computer Science and Engineering Shri Ramswaroop Memorial Group of Professional Colleges -SRMGPC, Lucknow, India. Dr.Sandeep Vijay Department of Electronics and Electrical Engineering ICFAI University, Dehradun, India. Pratibha Department of Electronics and Electrical Engineering Ambalika Institute of Management and Technology -AIMT, Lucknow, India Abstract Division is an expansive term, covering a wide assortment of issues and of strategies. We have gathered a delegate set of thoughts in this paper. These strategies manage various types of informational collection: some are expected for pictures, some are proposed for video successions and some are planned to be connected to tokens put holders that demonstrate the nearness of a fascinating example, say a spot or a speck or an edge point. While externally these strategies may appear to be very changed, there is a solid likeness among them. Every strategy endeavours to get a minimized portrayal of its informational index utilizing some type of model of similitude .One regular perspective of division is that we are endeavouring to figure out which parts of an informational collection normally "has a place together". This paper surveys Figure 1: Steps of Segmentation the picture division strategies in view of grouping. From the surveys unmistakably grouping assumes an imperative part in picture division. Picture partition doling out a level to each pixel in a picture to such an extent that pixels with a similar name share certain Keywords: Image Segmentation, Video Segmentation, qualities. Cluster technique, K-means, Fuzzy C-means, Hierarchical clustering, Mixture of Gaussians, Artificial neural network Clustering is the undertaking of collection an arrangement of clustering articles such that items in a similar gathering (called a cluster) are more comparative (in some sense or another) to each other than to those in dissimilar gatherings (groups). Bunch INTRODUCTION examination itself isn't one particular calculation, yet the general assignment to be unraveled. It can be accomplished by Image segmentation can be defined as the arrangement of all different calculations that vary essentially in their idea of what the picture elements or pixels in an image into dissimilar constitutes a group and how to effectively discover them. clusters that demonstrate similar features. Segmentation Prominent ideas of bunches incorporate gatherings with little involves partitioning an image into groups of pixels which are separations among the group individuals, thick zones of the uniform with respect to some norm. Diverse gatherings must information space, interims or specific measurable not meet each other and adjoining bunches must be circulations. Grouping can thusly be detailed as a multi-target heterogeneous. Picture division is considered as an imperative enhancement issue. Group examination all things considered fundamental operation for important investigation and isn't a programmed task, yet an iterative procedure of understanding of picture obtained. It is a basic and information revelation or intuitive multi-target progression fundamental part of a picture investigation or potentially that includes trial and disappointment. It is frequently design acknowledgment framework, and is a standout among important to change information pre processing and the most troublesome undertakings in picture preparing, which demonstrate parameters until the point when the outcome decides the nature of the last division. accomplishes the coveted properties. 2484 International Journal of Applied Engineering Research ISSN 0973-4562 Volume 13, Number 5 (2018) pp. 2484-2489 © Research India Publications. http://www.ripublication.com CLASSIFICATION OF IMAGE CLUSTERING: Brief Review of the Previous Work : Image clustering identifies with content-based picture Pillai et al [4] proposes picture steganography strategy which recovery frameworks. It empowers the usage of proficient bunches the picture into different portions and conceals recovery calculations and the production of an easy to use information in each of the section. A mix of cryptographic and interface to the database. There are several clustering bunching procedures has been utilized alongside techniques: steganography. This gives significantly more prominent security as the encryption key is likewise obscure to the assailant. Mathur et al [13] proposes fuzzy based edge location utilizing K-means bunching strategy. The K-means bunching approach is utilized as a part of producing different gatherings which are then contribution to the mamdani fuzzy deduction framework. Reproduction comes about speak to that the K-means grouping strategy for the age of edge parameters in the fuzzy based framework enhances the edge picture for MRI picture. Yadav et al [3] proposes a neoteric picture division procedure has been encircled, which is remained on shade of the picture utilizing an unsupervised K-means clustering. The proposed method empowers compelling fragment of the hued picture iteratively in light of the necessity. Utilizing this approach it is Figure 2: Classification of Image Segmentation anything but difficult to picture the outcomes and examine the specific question in the picture. Different Clustering Methods: Vu, H. N et al [7] proposes a technique which comprises of three phases preprocessing which enhances differentiation of In order to perform image clustering, we initially need to pick grayscale picture, multi-level thresholding for isolating literary a portrayal space and after that to utilize a proper separation area from non-printed protest, for example, illustrations, measure (closeness measure), to coordinate amongst pictures pictures, and complex foundation, and heuristic channel, and group focuses in the chose portrayal space. The picture recursive channel for content restricting in printed district. grouping is then performed in an administered procedure, Proposed procedure has accomplished similar outcomes utilizing human intercession or in an unsupervised procedure, contrasted with the other understood content extraction depending on the likeness between the pictures and the strategy, which demonstrate the effectiveness and favorable different bunch focuses. circumstances if there should arise an occurrence of genuine record picture. K-Means Nabeel, F.et al [9] proposes a basic, decreased multifaceted nature and proficient picture division and combination K-means is one of the simplest unsupervised learning approach. It improves the division procedure of hued pictures algorithms that explain the well known clustering problem. by combination of histogram based K-means bunches in The method takes after a straightforward and simple approach different shading spaces. The pixels in the re-quantized to characterize a given informational collection through a shading spaces are bunched into classes utilizing the K-means specific number of groups (expect k clusters) settled from the (Euclidean Distance) method. earlier. The primary thought is to characterize k centroids, one for each group. These centroids ought to be set shrewdly as a Ayech, M. W.et al [6] proposes a weighted element space and result of various area causes diverse outcome. In this way, the a straightforward arbitrary examining ink-implies clustering better decision is to put them however much as could for THz picture division. In this paper endeavor to gauge the reasonably be expected far from each other. The subsequent normal focuses, select the pertinent highlights and their scores, stage is to take each guide having a place toward a given and group the watched pixels of THz pictures. Thus informational index and associate it to the closest centroid. At accomplishing the best smallness inside groups, the best the point when no point is waiting, the initial step is finished segregation of highlights, and the best exchange off between and an early group age is finished. Presently we need to re- the clustering precision and the low computational cost. figure k new centroids as bury centers of the packs coming to G. C. Ngo et al [2] proposes a novel way to deal with fruition due to the past progress. After we have these k new recognize 0.3 mm breaks in photos taken at a separation of 1 centroids, another coupling must be done between comparable m from the surface. Separating and morphological operations educational list centers and the nearest new centroid. A circle are connected to the picture to make the splits more has been made. In view of this circle we may see that the k discernable from the foundation. We isolate break applicants centroids change their zone all around requested until the from whatever is left of the picture utilizing division. point that the moment that no more changes are done. By the day's end centroids don't move any more. 2485 International Journal of Applied Engineering Research ISSN 0973-4562 Volume 13, Number 5 (2018) pp. 2484-2489 © Research India Publications. http://www.ripublication.com Exploratory outcomes exhibit the adequacy of the proposed shadow Region division and Criminisi Algorithm for filling technique. the shadow area. Fuzzy C-Means Hierarchical clustering The most admired algorithm in the fuzzy clustering is the The idea of hierarchical clustering is to develop a pecking
Load more

Recommended publications
  • Image Segmentation Using K-Means Clustering and Thresholding
    International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395 -0056 Volume: 03 Issue: 05 | May-2016 www.irjet.net p-ISSN: 2395-0072 Image Segmentation using K-means clustering and Thresholding Preeti Panwar1, Girdhar Gopal2, Rakesh Kumar3 1M.Tech Student, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra, Haryana 2Assistant Professor, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra, Haryana 3Professor, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra, Haryana ------------------------------------------------------------***------------------------------------------------------------ Abstract - Image segmentation is the division or changes in intensity, like edges in an image. Second separation of an image into regions i.e. set of pixels, pixels category is based on partitioning an image into regions in a region are similar according to some criterion such as that are similar according to some predefined criterion. colour, intensity or texture. This paper compares the color- Threshold approach comes under this category [4]. based segmentation with k-means clustering and thresholding functions. The k-means used partition cluster Image segmentation methods fall into different method. The k-means clustering algorithm is used to categories: Region based segmentation, Edge based partition an image into k clusters. K-means clustering and segmentation, and Clustering based segmentation, thresholding are used in this research
    [Show full text]
  • Computer Vision Segmentation and Perceptual Grouping
    CS534 A. Elgammal Rutgers University CS 534: Computer Vision Segmentation and Perceptual Grouping Ahmed Elgammal Dept of Computer Science Rutgers University CS 534 – Segmentation - 1 Outlines • Mid-level vision • What is segmentation • Perceptual Grouping • Segmentation by clustering • Graph-based clustering • Image segmentation using Normalized cuts CS 534 – Segmentation - 2 1 CS534 A. Elgammal Rutgers University Mid-level vision • Vision as an inference problem: – Some observation/measurements (images) – A model – Objective: what caused this measurement ? • What distinguishes vision from other inference problems ? – A lot of data. – We don’t know which of these data may be useful to solve the inference problem and which may not. • Which pixels are useful and which are not ? • Which edges are useful and which are not ? • Which texture features are useful and which are not ? CS 534 – Segmentation - 3 Why do these tokens belong together? It is difficult to tell whether a pixel (token) lies on a surface by simply looking at the pixel CS 534 – Segmentation - 4 2 CS534 A. Elgammal Rutgers University • One view of segmentation is that it determines which component of the image form the figure and which form the ground. • What is the figure and the background in this image? Can be ambiguous. CS 534 – Segmentation - 5 Grouping and Gestalt • Gestalt: German for form, whole, group • Laws of Organization in Perceptual Forms (Gestalt school of psychology) Max Wertheimer 1912-1923 “there are contexts in which what is happening in the whole cannot be deduced from the characteristics of the separate pieces, but conversely; what happens to a part of the whole is, in clearcut cases, determined by the laws of the inner structure of its whole” Muller-Layer effect: This effect arises from some property of the relationships that form the whole rather than from the properties of each separate segment.
    [Show full text]
  • Image Segmentation Based on Histogram Analysis Utilizing the Cloud Model
    Computers and Mathematics with Applications 62 (2011) 2824–2833 Contents lists available at SciVerse ScienceDirect Computers and Mathematics with Applications journal homepage: www.elsevier.com/locate/camwa Image segmentation based on histogram analysis utilizing the cloud model Kun Qin a,∗, Kai Xu a, Feilong Liu b, Deyi Li c a School of Remote Sensing Information Engineering, Wuhan University, Wuhan, 430079, China b Bahee International, Pleasant Hill, CA 94523, USA c Beijing Institute of Electronic System Engineering, Beijing, 100039, China article info a b s t r a c t Keywords: Both the cloud model and type-2 fuzzy sets deal with the uncertainty of membership Image segmentation which traditional type-1 fuzzy sets do not consider. Type-2 fuzzy sets consider the Histogram analysis fuzziness of the membership degrees. The cloud model considers fuzziness, randomness, Cloud model Type-2 fuzzy sets and the association between them. Based on the cloud model, the paper proposes an Probability to possibility transformations image segmentation approach which considers the fuzziness and randomness in histogram analysis. For the proposed method, first, the image histogram is generated. Second, the histogram is transformed into discrete concepts expressed by cloud models. Finally, the image is segmented into corresponding regions based on these cloud models. Segmentation experiments by images with bimodal and multimodal histograms are used to compare the proposed method with some related segmentation methods, including Otsu threshold, type-2 fuzzy threshold, fuzzy C-means clustering, and Gaussian mixture models. The comparison experiments validate the proposed method. ' 2011 Elsevier Ltd. All rights reserved. 1. Introduction In order to deal with the uncertainty of image segmentation, fuzzy sets were introduced into the field of image segmentation, and some methods were proposed in the literature.
    [Show full text]
  • Image Segmentation with Artificial Neural Networs Alongwith Updated Jseg Algorithm
    IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-ISSN: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 4, Ver. II (Jul - Aug. 2014), PP 01-13 www.iosrjournals.org Image Segmentation with Artificial Neural Networs Alongwith Updated Jseg Algorithm Amritpal Kaur*, Dr.Yogeshwar Randhawa** M.Tech ECE*, Head of Department** Global Institute of Engineering and Technology Abstract: Image segmentation plays a very crucial role in computer vision. Computational methods based on JSEG algorithm is used to provide the classification and characterization along with artificial neural networks for pattern recognition. It is possible to run simulations and carry out analyses of the performance of JSEG image segmentation algorithm and artificial neural networks in terms of computational time. A Simulink is created in Matlab software using Neural Network toolbox in order to study the performance of the system. In this paper, four windows of size 9*9, 17*17, 33*33 and 65*65 has been used. Then the corresponding performance of these windows is compared with ANN in terms of their computational time. Keywords: ANN, JSEG, spatial segmentation, bottom up, neurons. I. Introduction Segmentation of an image entails the partition and separation of an image into numerous regions of related attributes. The level to which segmentation is carried out as well as accepted depends on the particular and exact problem being solved. It is the one of the most significant constituent of image investigation and pattern recognition method and still considered as the most challenging and difficult problem in field of image processing. Due to enormous applications, image segmentation has been investigated for previous thirty years but, still left over a hard problem.
    [Show full text]
  • A Review on Image Segmentation Clustering Algorithms Devarshi Naik , Pinal Shah
    Devarshi Naik et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 5 (3) , 2014, 3289 - 3293 A Review on Image Segmentation Clustering Algorithms Devarshi Naik , Pinal Shah Department of Information Technology, Charusat University CSPIT, Changa, di.Anand, GJ,India Abstract— Clustering attempts to discover the set of consequential groups where those within each group are more closely related to one another than the others assigned to different groups. Image segmentation is one of the most important precursors for image processing–based applications and has a crucial impact on the overall performance of the developed systems. Robust segmentation has been the subject of research for many years, but till now published work indicates that most of the developed image segmentation algorithms have been designed in conjunction with particular applications. The aim of the segmentation process consists of dividing the input image into several disjoint regions with similar characteristics such as colour and texture. Keywords— Clustering, K-means, Fuzzy C-means, Expectation Maximization, Self organizing map, Hierarchical, Graph Theoretic approach. Fig. 1 Similar data points grouped together into clusters I. INTRODUCTION II. SEGMENTATION ALGORITHMS Images are considered as one of the most important Image segmentation is the first step in image analysis medium of conveying information. The main idea of the and pattern recognition. It is a critical and essential image segmentation is to group pixels in homogeneous component of image analysis system, is one of the most regions and the usual approach to do this is by ‘common difficult tasks in image processing, and determines the feature. Features can be represented by the space of colour, quality of the final result of analysis.
    [Show full text]
  • Markov Random Fields and Stochastic Image Models
    Markov Random Fields and Stochastic Image Models Charles A. Bouman School of Electrical and Computer Engineering Purdue University Phone: (317) 494-0340 Fax: (317) 494-3358 email [email protected] Available from: http://dynamo.ecn.purdue.edu/»bouman/ Tutorial Presented at: 1995 IEEE International Conference on Image Processing 23-26 October 1995 Washington, D.C. Special thanks to: Ken Sauer Suhail Saquib Department of Electrical School of Electrical and Computer Engineering Engineering University of Notre Dame Purdue University 1 Overview of Topics 1. Introduction (b) Non-Gaussian MRF's 2. The Bayesian Approach i. Quadratic functions ii. Non-Convex functions 3. Discrete Models iii. Continuous MAP estimation (a) Markov Chains iv. Convex functions (b) Markov Random Fields (MRF) (c) Parameter Estimation (c) Simulation i. Estimation of σ (d) Parameter estimation ii. Estimation of T and p parameters 4. Application of MRF's to Segmentation 6. Application to Tomography (a) The Model (a) Tomographic system and data models (b) Bayesian Estimation (b) MAP Optimization (c) MAP Optimization (c) Parameter estimation (d) Parameter Estimation 7. Multiscale Stochastic Models (e) Other Approaches (a) Continuous models 5. Continuous Models (b) Discrete models (a) Gaussian Random Process Models 8. High Level Image Models i. Autoregressive (AR) models ii. Simultaneous AR (SAR) models iii. Gaussian MRF's iv. Generalization to 2-D 2 References in Statistical Image Modeling 1. Overview references [100, 89, 50, 54, 162, 4, 44] 4. Simulation and Stochastic Optimization Methods [118, 80, 129, 100, 68, 141, 61, 76, 62, 63] 2. Type of Random Field Model 5. Computational Methods used with MRF Models (a) Discrete Models i.
    [Show full text]
  • Segmentation of Brain Tumors from MRI Images Using Convolutional Autoencoder
    applied sciences Article Segmentation of Brain Tumors from MRI Images Using Convolutional Autoencoder Milica M. Badža 1,2,* and Marko C.ˇ Barjaktarovi´c 2 1 Innovation Center, School of Electrical Engineering, University of Belgrade, 11120 Belgrade, Serbia 2 School of Electrical Engineering, University of Belgrade, 11120 Belgrade, Serbia; [email protected] * Correspondence: [email protected]; Tel.: +381-11-321-8455 Abstract: The use of machine learning algorithms and modern technologies for automatic segmen- tation of brain tissue increases in everyday clinical diagnostics. One of the most commonly used machine learning algorithms for image processing is convolutional neural networks. We present a new convolutional neural autoencoder for brain tumor segmentation based on semantic segmenta- tion. The developed architecture is small, and it is tested on the largest online image database. The dataset consists of 3064 T1-weighted contrast-enhanced magnetic resonance images. The proposed architecture’s performance is tested using a combination of two different data division methods, and two different evaluation methods, and by training the network with the original and augmented dataset. Using one of these data division methods, the network’s generalization ability in medical diagnostics was also tested. The best results were obtained for record-wise data division, training the network with the augmented dataset. The average accuracy classification of pixels is 99.23% and 99.28% for 5-fold cross-validation and one test, respectively, and the average dice coefficient is 71.68% and 72.87%. Considering the achieved performance results, execution speed, and subject generalization ability, the developed network has great potential for being a decision support system Citation: Badža, M.M.; Barjaktarovi´c, in everyday clinical practice.
    [Show full text]
  • GPU-Based Multi-Volume Rendering of Complex Data in Neuroscience and Neurosurgery
    DISSERTATION GPU-based Multi-Volume Rendering of Complex Data in Neuroscience and Neurosurgery ausgeführt zum Zwecke der Erlangung des akademischen Grades eines Doktors der technischen Wissenschaften unter der Leitung von Ao.Univ.Prof. Dipl.-Ing. Dr.techn. Eduard Gröller, Institut E186 für Computergraphik und Algorithmen, und Dipl.-Ing. Dr.techn. Markus Hadwiger, VRVis Zentrum für Virtual Reality und Visualisierung, und Dipl.-Math. Dr.techn. Katja Bühler, VRVis Zentrum für Virtual Reality und Visualisierung, eingereicht an der Technischen Universität Wien, bei der Fakultät für Informatik, von Dipl.-Ing. (FH) Johanna Beyer, Matrikelnummer 0426197, Gablenzgasse 99/24 1150 Wien Wien, im Oktober 2009 DISSERTATION GPU-based Multi-Volume Rendering of Complex Data in Neuroscience and Neurosurgery Abstract Recent advances in image acquisition technology and its availability in the medical and bio-medical fields have lead to an unprecedented amount of high-resolution imaging data. However, the inherent complexity of this data, caused by its tremendous size, complex structure or multi-modality poses several challenges for current visualization tools. Recent developments in graphics hardware archi- tecture have increased the versatility and processing power of today’s GPUs to the point where GPUs can be considered parallel scientific computing devices. The work in this thesis builds on the current progress in image acquisition techniques and graphics hardware architecture to develop novel 3D visualization methods for the fields of neurosurgery and neuroscience. The first part of this thesis presents an application and framework for plan- ning of neurosurgical interventions. Concurrent GPU-based multi-volume ren- dering is used to visualize multiple radiological imaging modalities, delineating the patient’s anatomy, neurological function, and metabolic processes.
    [Show full text]
  • Fast Re-Rendering of Volume and Surface Graphics by Depth, Color, and Opacity Buffering
    Fast Re-Rendering of Volume and Surface Graphics by Depth, Color, and Opacity Buffering The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Bhalerao, Abhir, Hanspeter Pfister, Michael Halle, and Ron Kikinis. 2000. Fast re-rendering of volume and surface graphics by depth, color, and opacity buffering. Medical Image Analysis 4(3): 235-251. Published Version doi:10.1016/S1361-8415(00)00017-7 Citable link http://nrs.harvard.edu/urn-3:HUL.InstRepos:4726199 Terms of Use This article was downloaded from Harvard University’s DASH repository, and is made available under the terms and conditions applicable to Other Posted Material, as set forth at http:// nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of- use#LAA Medical Image Analysis (1999) volume ?, number ?, pp 1–34 c Oxford University Press Fast Re-Rendering Of Volume and Surface Graphics By Depth, Color, and Opacity Buffering Abhir Bhalerao1 , Hanspeter Pfister2, Michael Halle3 and Ron Kikinis4 1University of Warwick, England. Email: [email protected] 2Mitsubishi Electric Research Laboratories, Cambridge, MA. E-mail: pfi[email protected] 3Media Laboratory, MIT, Cambridge. E-mail: [email protected] 4Surgical Planning Laboratory, Brigham and Women’s Hospital and Harvard Medical School, Boston. E-mail: [email protected] Abstract A method for quickly re-rendering volume data consisting of several distinct materials and intermixed with moving geometry is presented. The technique works by storing depth, color and opacity information, to a given approximation, which facilitates accelerated rendering of fixed views at moderate storage overhead without re-scanning the entire volume.
    [Show full text]
  • BAE-NET: Branched Autoencoder for Shape Co-Segmentation
    BAE-NET: Branched Autoencoder for Shape Co-Segmentation Zhiqin Chen1, Kangxue Yin1, Matthew Fisher2, Siddhartha Chaudhuri2,3, and Hao Zhang1 1Simon Fraser University 2Adobe Research 3IIT Bombay Abstract We treat shape co-segmentation as a representation learning problem and introduce BAE-NET, a branched au- toencoder network, for the task. The unsupervised BAE- NET is trained with a collection of un-segmented shapes, using a shape reconstruction loss, without any ground-truth labels. Specifically, the network takes an input shape and encodes it using a convolutional neural network, whereas the decoder concatenates the resulting feature code with a point coordinate and outputs a value indicating whether the point is inside/outside the shape. Importantly, the decoder is branched: each branch learns a compact representation for one commonly recurring part of the shape collection, e.g., airplane wings. By complementing the shape recon- Figure 1. Unsupervised co-segmentation by BAE-NET on the lamp struction loss with a label loss, BAE-NET is easily tuned for category from the ShapeNet part dataset [64]. Each color denotes one-shot learning. We show unsupervised, weakly super- a part labeled by a specific branch of our network. vised, and one-shot learning results by BAE-NET, demon- strating that using only a couple of exemplars, our net- single input. Representative approaches include SegNet [3] work can generally outperform state-of-the-art supervised for images and PointNet [42] for shapes, where the net- methods trained on hundreds of segmented shapes. Code is works are trained by supervision with ground-truth segmen- available at https://github.com/czq142857/BAE-NET.
    [Show full text]
  • Rendering and Interaction in Co-Operative 3-D Image Analysis
    Rendering and interaction in co-operative 3-d image analysis Klaus Toennies, Manfred Hinz, Regina Pohle Computer Vision Group, ISG, Department of Informatics, Otto-von-Guericke-Universitaet Magdeburg, P.O. Box 4120, D-39016 Magdeburg, Germany ABSTRACT Most interactive segmentation methods are defined at a 2-d level requiring sometimes ex- tensive interaction when the object of interest is difficult to be outlined by simple means of segmentation. This may become tedious if the data happens to be a 3-d scene of which a part of the differentiating features of a structure is buried in 3-d contextual information. We pro- pose a concept of extending interactive or semi-automatic segmentation to 3-d where coher- ence information may be exploited more efficiently. A non-analysed scene may be evaluated using volume rendering techniques with which the user interacts to extract the structures that he or she is interested in. The approach is based on a concept of a co-operative system that communicates with the user for finding the best rendition and analysis. Within the concept we present a new method of estimating rendering parameters if the object of interest is only par- tially analysed. Keywords: segmentation, image analysis, 3-d rendering, volume rendering, transfer function 1. INTRODUCTION Image segmentation is needed in medical image analysis in applications that range from computer-aided diagnosis to computer-guided surgery. Segmentation often includes part of the analysis because it may focus on extracting a specific object from the background or cate- gorising each object in a two- or three-dimensional scene.
    [Show full text]
  • Chapter 4 SEGMENTATION
    Chapter 4 SEGMENTATION Image segmentation is the division of an image into regions or categories, which correspond to di®erent objects or parts of objects. Every pixel in an image is allocated to one of a number of these categories. A good segmentation is typically one in which: ² pixels in the same category have similar greyscale of multivariate values and form a connected region, ² neighbouring pixels which are in di®erent categories have dissimilar values. For example, in the muscle ¯bres image (Fig 1.6(b)), each cross-sectional ¯bre could be viewed as a distinct object, and a successful segmentation would form a separate group of pixels corresponding to each ¯bre. Similarly in the SAR image (Fig 1.8(g)), each ¯eld could be regarded as a separate category. Segmentation is often the critical step in image analysis: the point at which we move from considering each pixel as a unit of observation to working with objects (or parts of objects) in the image, composed of many pixels. If segmentation is done well then all other stages in image analysis are made simpler. But, as we shall see, success is often only partial when automatic segmentation algorithms are used. However, manual intervention can usually overcome these problems, and by this stage the computer should already have done most of the work. This chapter ¯ts into the structure of the book as follows. Segmentation algorithms may either be applied to the images as originally recorded (chapter 1), or after the application of transformations and ¯lters considered in chapters 2 and 3.
    [Show full text]