Computational Medical Imaging Analysis Chapter 5: Processing and Analysis
|
|
- Regina Susanna Howard
- 6 years ago
- Views:
Transcription
1 Computational Medical Imaging Analysis Chapter 5: Processing and Analysis Jun Zhang Laboratory for Computational Medical Imaging & Data Analysis Department of Computer Science University of Kentucky Lexington, KY Chapter 5: CS689 1
2 5.1a: Challenges in Comprehending Information in Biomedical Images Image enhancement and restoration Automated and accurate segmentation of structures and features of interest Automated and accurate registration and fusion of multimodality or multispectral information Classification of image content, namely tissue characterization and typing Quantitative measurement of image properties and features, including a discussion of the meaning of image measurement Chapter 5: CS689 2
3 5.2a: Image Enhancement and Restoration Image enhancement methods attempt to improve the quality of an image We can make certain features in the image more recognizable or prominent Examples are amplification of edges or reduction of noise to increase the contrast between regions of an image It is also possible to increase the visibility of features at a certain scale or with a certain spectral signature Chapter 5: CS689 3
4 5.2b: Tradeoffs in Detail and Noise There is an inherent tradeoff between amplifying detail and reducing noise when applying image enhancement techniques Procedures that enhance visibility of detail also increase the noise; and conversely, procedures that applied to reduce noise also reduce detail. (Denosing usually makes edge blurred) Many techniques have been developed to achieve image enhancement using both linear and nonlinear techniques (such as PDE based denosing techniques) Chapter 5: CS689 4
5 5.2c: Histogram Operations The histogram of an image is a function that relates the number of pixels in an image to the range of brightness values of those pixels Normally a 2D graph, with abscissa showing the number of pixels and ordinate showing the brightness values Any point on the graph indicates the number of pixels in the image that have the same brightness level It usually has one or more peaks and valleys that corresponds to the gray levels of the image that are most common and least common throughout the image Chapter 5: CS689 5
6 5.2d: Histogram Illustration Chapter 5: CS689 6
7 5.2e: Use of Histogram The global statistical manipulation of image gray scale values is based on histogram matching Evaluation of histograms can reveal that some brightness (gray) levels may be underutilized as far as efficient display is concerned Histogram equalization is a response to such an evaluation and refers to spreading out or stretching the gray levels so that they are all used as evenly as possible This manipulation can take the full advantage of the display system, may alter the original data Chapter 5: CS689 7
8 5.2f: Histogram of A Mosaic Chapter 5: CS689 8
9 5.2g: Histogram of A Scene Chapter 5: CS689 9
10 5.2h: Histogram Equalization Histogram flattening or equalization uses some ideal flat histogram shape for histogram matching, which will maximize contrast in the image If the flattening step is used to preserve contrast while moving from a high-resolution gray scale to a lower resolution gray scale, this wasted gray scale will tend to cause loss of detail A slight modification of histogram flattening that effectively limits the maximum slope of the two cumulative functions can be used to transmit maximum information content in the low-resolution image Chapter 5: CS689 10
11 5.2i: Illustration of Histogram Equalization Original image Original histogram Equalized image Histogram of equalized image Chapter 5: CS689 11
12 5.3a: Spatial Filtering Spatial filtering involves the replacement of image values at each voxel location with some function of that pixel and its neighbors A linear filter (convolution) uses a weighted sums and is reversible A simple filter is to replace each pixel by the computed mean or average of itself and its eight closest neighbors The size of the neighborhood (kernel of the convolution) may vary for different effect Chapter 5: CS689 12
13 5.3b: Spatial Filtering (II) The most common goal of pixel averaging is to reduce noise in the image An accompanying result is smoothed or blurred edges in the image Blurring and computation time increase with increase in the size of the neighborhood (kernel) To highlight differences between pixels in an image, each pixel may be replaced by the differences between itself and the mean of its neighborhood. This is unsharp masking for edge enhancement Chapter 5: CS689 13
14 5.3c: Spatial Filtering (I) Original Kernel size 5x5 Chapter 5: CS689 14
15 5.3d: Spatial Filtering (II) Kernel size 9x9 Kernel size 15x15 Chapter 5: CS689 15
16 5.3e: Unsharp Masking Chapter 5: CS689 16
17 5.3f: Unsharp Masking with Scales Chapter 5: CS689 17
18 5.3g: Unsharp Masking Illustration Original blurred Mean filter Kernel 3x3 Edge enhanced image Chapter 5: CS689 18
19 5.4a: Frequency Filtering Many advanced image enhancement techniques are developed in the Fourier domain Fourier s theorem states that any waveform (including the 2D and 3D spatial waveforms that are images) can be expressed as the sum of sinusoidal basis functions at varying frequencies, amplitudes, and relative phases Reducing image noise, enhancing image contrast and edge definition, and other types of operations can be performed on the Fourier transform of an image Chapter 5: CS689 19
20 5.4b: Advantages of Frequency Filtering Operations in frequency space can often be faster than spatial convolution, especially if the convolution mask (region) is large (speed of filtering) Frequency filtering permits certain operations that are problematic in the spatial domain, such as enhancing or suppressing specific frequencies in the image High frequencies in an image can be suppressed using a low-pass frequency filter. This will suppress noise in the image, but also image detail Chapter 5: CS689 20
21 5.4c: Low-pass Filter (I) Original image Blurred image with Gaussian noise Chapter 5: CS689 21
22 5.4d: Low-Pass Filter (II) Low-pass filter with cut-off frequency 0.3 Low-pass filter with cut-off frequency 0.5 Chapter 5: CS689 22
23 5.4e: High-Pass Filtering High-pass filter enhances the high frequencies in the image, and increases both detail and noise Frequency domain filtering may selectively enhance or suppress periodic patterns in the image or judicious selection of frequency filter functions, which is called band-pass filtering Chapter 5: CS689 23
24 5.4f: High Frequency Filtering High frequency filter with cut-off at 0.5 Applied to a clone image Image produced with Sobel operator Chapter 5: CS689 24
25 5.5a: Image Restoration Linear system theory is based on the supposition of linear relationships among all components of an imaging system, a reasonable assumption over the normal range of modern medical imaging systems Linear system can be completely characterized by their response to impulse functions, which are finite amount of electrical energy occurring over zero time The impulse response (point-spread function, or psf) can be used to predict the output of the system to any arbitrary input by the process of convolution, essentially replacing each of the points in an image with its appropriately scaled impulse response Chapter 5: CS689 25
26 5.5b: Deconvolution The highest frequencies or sharpest details of an image are generally degraded or lost It is possible to use the point-spread function to mathematically deblur or sharpen an image (deconvolution) The process of debluring an image is different from image enhancement Enhancement is to make certain things sharper or more prominent, deconvolution is to restore the image to more exactly represent its original object Chapter 5: CS689 26
27 5.5c: Methods of Deconvolution Knowing psf is the key for successful deconvolution Psf can be measured empirically, theoretically estimated, or make reasonable estimates of it on the fly from the acquired data Wiener filter minimizes mean-squared-error between the true object and the restoration of the object Iterative nonlinear restoration techniques are usually better Blind deconvolution is used when the measurement of the psf is difficult or tedious Chapter 5: CS689 27
28 5.5d: Deconvolution (Example) Turbulences on the surface of Jupiter: original and restored Chapter 5: CS689 28
29 5.6a: Image Segmentation Segmentation is spatial partitioning of an image into its constituent parts, or isolating specific objects in an image Segmentation is often confused with and used interchangeably with classification Image classification means identifying what an object in the image is, or what type of object each pixel belongs to Segmentation: manual, automatic, semiautomatic (assisted manual) Chapter 5: CS689 29
30 5.6b: Manual Segmentation Manual segmentation involves interactive delineation of the structure boundary in an image by a trained operator This is often the most accurate approach if an expert is doing the work and is not fatigued or hampered by limiting interface devices The drawbacks are time consuming, error prone, subjectively biased, and not reproducible. Multiple operators and images from different scanners increase the variability of the defined borders Chapter 5: CS689 30
31 5.6c: Manual Segmentation (Example) Chapter 5: CS689 31
32 5.6d: Draw Contour Chapter 5: CS689 32
33 5.7a: Thresholding (Semiautomatic Segmentation) A gray scale range is chosen that represents the object of interest. Voxels that are within the gray scale are set to one, all other voxels are set to zero The technique is successful if the specified gray scale is unique to and encompasses the entire object of interest The threshold range can be determined interactively with a side-by-side display of the gray scale and thresholded images Chapter 5: CS689 33
34 5.7b: Color Image Thresholding Chapter 5: CS689 34
35 5.7c: Thresholding using Histogram Histogram can be used to select threshold values A value at the minimum between the two peaks of a bimodal histogram is often used as a threshold value It is advisable to blur (smooth) the image before histogram thresholding Visually selecting the threshold values is usually the best, but not reproducible Chapter 5: CS689 35
36 5.7d: Example of Histogram Thresholding Chapter 5: CS689 36
37 5.8a: Region Growing An image or volume can be divided into regions based on associated regional characteristics, such as homogeneity of gray scale The most basic form of region growing is based solely on thresholding Connectivity criteria can be combined with thresholding to produce more powerful region growing performance A pixel is connected if it satisfies the thresholding condition and is connected to the seed pixel at a specified number of sides and/or corners Chapter 5: CS689 37
38 5.8b: Seeded Region Growing Chapter 5: CS689 38
39 5.8c: Region Growing in a Diffusion Weighted Image Chapter 5: CS689 39
40 5.9a: Mathematical Morphology Mathematical morphology involves a convolution-like process using various shaped kernels, called structuring elements The structuring elements are mostly symmetric: squares, rectangles, and circles Most popular morphological operations are erode, dilate, open, and close The operations can be applied iteratively in selected order to effect a powerful process Chapter 5: CS689 40
41 5.9b: Erode Functions Erode function is a reducing operation. It removes noise and other small objects, breaks thin connections between objects, removes an outside layer from larger objects, and increases the size of holes within an object For binary images, any pixel that is set (1) and has a neighbor that is not set (0), is set to 0 The minimum function is the equivalence of an erosion The neighbors considered are defined by the structuring element Chapter 5: CS689 41
42 5.9c: Illustration of Erosion Function Erosion with a 3x3 square structuring element Chapter 5: CS689 42
43 5.9c: Example of Erode Function Input image Eroded image Chapter 5: CS689 43
44 5.9d: Erosion Example Input image Eroded image Chapter 5: CS689 44
45 5.10a: Dilation Function The dilate function can be thought of as an enlarging function, the reverse of erode For any binary data, any 0 pixel that has a 1 neighbor, where the neighborhood is defined by the structuring element is set to 1 For gray scale data, the dilate is a maximum function The dilation fills small holes and cracks and adds layers to objects in a binary image Chapter 5: CS689 45
46 5.10b: Example of Dilation Input image Dilated image Chapter 5: CS689 46
47 5.10c: Dilated Image Input image Dilated image Chapter 5: CS689 47
48 5.11a: Erosion Dilation Functions Erode and dilate are essentially inverse operations, they are often applied successively to an image volume An erosion followed by a dilation is called an open A morphological open will delete small objects and break thin connections without loss of surface layers A dilation followed by an erosion is called close The close operation fills small holes and cracks in an object and tends to smooth the border of an object Chapter 5: CS689 48
49 5.11b: Example of Open Operation Input image Opened image Chapter 5: CS689 49
50 5.11c: Example of Open Operation Input image Opened image Chapter 5: CS689 50
51 5.11d: Example of Close Operation Input image Closed image Chapter 5: CS689 51
52 5.11e: Example of Close Operation Input image Closed image Chapter 5: CS689 52
53 5.11f: An Automated Segmentation (a)original image, (b) thresholding, (c) erosion, (d) dilation, (e) closing, (f) mask rendering, (g) volume rendering Chapter 5: CS689 53
54 5.12a: Active Contours (Snakes) Segmenting an object in an image with active contours involves minimizing a cost function based on certain properties of the desired object boundary and contrast in the image Smoothness of the boundary curve and local gradients in the image are usually considered Snake algorithms search the region about the current point and iteratively adjust the points of the boundary until an optimal, low cost boundary is found It may get caught in a local minimum (initial guess) Chapter 5: CS689 54
55 5.12b: Example of A Snake Algorithm Initial contour in green, yellow is intermediate contour Final contour converged in 25 iterations Chapter 5: CS689 55
56 5.12c: Active Contour with Level-Set Method Chapter 5: CS689 56
57 5.13a: Image Registration Registration in biomedical image sciences means brining into spatial alignment separately acquired images of the same object When accurately registered, each separate image will have the same coordinate system and a given voxel in one image will represent the same physical volume as the corresponding voxel in another image Interpolation is usually involved in the resampling and/or reformatting process Chapter 5: CS689 57
58 5.13b: Registration and Fusion Registration is required for multispectral analysis or classification of image features from different images recorded over time and/or fused from different modalities Image fusion means the actual combining into a single image of information from registered multiple images Fused displays can be accomplished using various combinations of color, gray scales, transparency, etc Chapter 5: CS689 58
59 5.13b*: Example of Registration MRI + SPECT MRI SPECT Chapter 5: CS689 59
60 3.13b*: Co-Registration Coregistered SPECT-MRI image. The SPECT image was pasted in opaque mode on the top of black-and-white MRI image, which provides an anatomical template Chapter 5: CS689 60
61 5.13c: Steps in Image Registration Feature extraction Pairing of corresponding features Calculation of transformation parameters Performing the transformation Calculation of transformation parameters is the most challenging part of the process It may involve optimization of a prescribed cost function achieved by iterating the solution Both rigid body and elastic types of transformation are possible Chapter 5: CS689 61
62 5.13d: Transformations In rigid body transformation, all the points and objects in an image are assumed to move as a whole and do not move relative to each other Translation and rotation are the only motions Affine transformation maps straight lines to straight lines and preserve parallel lines, but angles between these lines can change Projective transformations involve registering different dimensional spaces, e.g., registering 3D images to 2D images Chapter 5: CS689 62
63 5.13e: Rigid Body Registration Rigid body registration between two individuals Chapter 5: CS689 63
64 5.14a: Unimodal Registration The reconstruction of 3D structures from microscope images of serial sections requires precise realignment of each sections to its neighbors Unimodal registration is within the same imaging modality Volumetric unimodality registration is required to use medical images quantitatively to study disease progression, monitor patient response to treatment, and evaluate surgical performance for quality control Patient motion artifacts may occur for serial sections Chapter 5: CS689 64
65 5.14b: Composite Images Un-registered 20 MRI scans of the same slice of an MS patient. Note that the location and orientation differences Chapter 5: CS689 65
66 5.14c: Composite Images Registered The same images registered. Each of the scans is aligned, and the changes in lesions can easily be tracked over time Chapter 5: CS689 66
67 5.14d: Intra-Patient Registration Chapter 5: CS689 67
68 5.15a: Multimodal Registration By combining information contained in multiple images of complementary modalities, synergism is achieved as voxel-by-voxel tissue characteristics can be determined with greater subtlety and precision The relation of structure to function can be revealed by combining structural and functional images Color analysis is a commonly encountered example of multiple band data in which the bands are inherently coregistered Chapter 5: CS689 68
69 5.15b: Fusion of CT and MRI (Liver) Red: fused MRI and CT. Top-right: MRI, Lower-right: CT The red part is from the CT image, the green part is from the MRI image Chapter 5: CS689 69
70 5.15c: Fused Image from CT and PET Left: CT image. Middle: PET image. Right: fused image CT is used as background, and PET image as the blue color Chapter 5: CS689 70
71 Registration Quality and Error Metric Corresponding points: The most straightforward registration error metric is the mean Euclidean distance between corresponding points in both images. It exhibits a global minimum at the point of perfect registration, and to increase monotonically with increased rigid misregistration The corresponding points may be determined by attaching extrinsic fiducial markers rigidly patient bony structures, or by expert identification of intrinsic anatomic landmarks Chapter 5: CS689 71
72 Landmarks for Registration Four points used for registration. The center of the trachea cross-section on slice A and the centers of the cross-sections of sternum, trachea, and vertebra in slice B Chapter 5: CS689 72
73 Corresponding Surfaces Corresponding image surfaces are used for intra- and intermodality registration They can be simple isosurfaces or carefully chosen hand-segmented contours The selected surfaces must correspond, and rigid structures are preferable to soft tissues as surface features Surface-based metrics have greater number of coordinate points involved and are complete lack of correspondence information Chapter 5: CS689 73
74 Example of Surface Registration Original right lung Initial surface registration After 25 iterations Surface is in red Chapter 5: CS689 74
75 Corresponding Image Features For intramodality registration, the mean squared error between corresponding image voxels has the required minimum at the point of proper registration We can minimize the normalized standard deviation of the gray values of voxels in one image that correspond to voxels of a single gray value in the other The joint entry among images can be minimized, or, the mutual information among the images can be maximized Chapter 5: CS689 75
76 Corresponding Feature Registration PET image shows tumor, CT image shows location Chapter 5: CS689 76
77 Search Strategy An optimization method is used to optimize the cost function, once a registration feature (surface, point, voxel) is determined The dimensionality of search space is high (6 DOF for 3D rigid registration, with higher DOF for increasing severity of elasticity) Effective optima search strategies include gradient descent, Powell s method, simplex They involve iterative testing of trial orientations to detect local extrema of the evaluative function Chapter 5: CS689 77
78 Optima Search Methods Gradient descent methods require the calculation of complex local gradient of error function for search direction and step size Powell s method conducts a bounded golden interval search in one DOF, and iterates to other DOF until convergence Simplex method is a set of (N+1) trial orientations for rapid estimation of the direction of the greatest gradient, without computational burden of gradient computation Chapter 5: CS689 78
79 Registration of Ultrasound and SPECT Registered image of heart from ultrasound and SPECT images Chapter 5: CS689 79
80 Confounding Factors Gray scale inhomogeneity can cause the segmented shape of an object surface used for registration to not coincide exactly The drift in voxel size over time may be an important confounding factor for longitudinal MRI studies Accurate intermodality scale factors are often difficult to calculate Scale space searches must be carefully bounded, and their results may be suspect, particularly if volumetric difference measures are made from the registered images Chapter 5: CS689 80
81 Registration Error Source Target Registered Error before registration Error after registration Chapter 5: CS689 81
82 Evaluating and Validating Image Registration Translating and rotating a copy of an image volume by known amounts and then registering that copy to the original The best-case accuracy of the algorithm can be assessed as the correct solution is known Additive noise can be added to simulate realworld conditions, gray scale remapping can be applied to simulate intermodal applications Parts of the copy can be erased to simulate partially overlapping scans Chapter 5: CS689 82
83 Evaluating and Validating Image Registration (Clinical Setting) An expert can grade registration for quality This relates algorithm s performance directly to the currently used gold standard Multiple experts can improve repeatability, but residual error below visual detection may exist Phantom (suitable materials and geometric features) experiments can be used to isolate sources of error Patient images with attached markers provide the most complete validation of rigid registration algorithms applied to real data Chapter 5: CS689 83
84 6.1a: Multispectral Classification A number of separate measurements are collected for each sample in a multispectral data set Each sample is vector values, such as RGB images, a CT image and an MR image of the same part of a patient s body Individual channels (or bands) may allow different distinctions to be made about each pixel in the image Chapter 5: CS689 84
85 6.1b: Multispectral Imaging Technique Infrared image Visible Image Multispectral image Chapter 5: CS689 85
86 6.1c: Multispectral MRI Classification 48 hour old stroke in a two year old. a) T2-W MRI, b) manually classified from T2-weighted MRI, c) Automatically classified MR multispectral image Chapter 5: CS689 86
87 6.2a: Methods The goal of multispectral classification is to accurately and quickly identify scene objects with a minimum of operator intervention by taking advantage of the additional information available in multispectral images Entire images are analyzed in multispectral space and their pixels labeled as belonging to spectral and information classes in feature space Pixels in the classified image are assigned class numbers and typically color coded to visualize the classification results in the form of a thematic map Chapter 5: CS689 87
88 6.2b: Multispectral Brain Image Normal MRI of teenage female with sickle cell disease. a) T2-weighted MRI. b) manually classified from T2-weighted MRI. c) automatically classified MR multispectral image Chapter 5: CS689 88
89 6.2c: Image Space and Preprocessing Bands should be selected to enhance the contrast and segmentability of the features of interest Principal component analysis can be used to transform the multispectral data into a new spectral coordinate system that enhances feature contrasts Pixel data is remapped into a new spectral space such that the most variance is in band 1, next most in band 2, etc. Data from each band must be spatially registered 3D data may require denoise to ensure consistency Chapter 5: CS689 89
90 6.2d: Unsupervised Classification Unsupervised classifiers require no prior knowledge of feature characteristics but attempt to identify features in multispectral space Pixels associated with the clusters are assigned to classes in feature space Unsupervised classification allows the automatic identification of spectral clusters, may illustrate spectral classes to be used or to be segmented in supervised classifiers The spectral classes can be used to generate multispectral signatures of classes in feature space Chapter 5: CS689 90
91 6.2e: Supervised Classification Supervised classifiers require training samples taken to be representative pixels of features to be identified in the feature space It depends on expert-defined training samples known to belong to specified feature space classes Pixels are classified and assigned values in feature space on the basis of some criteria for how similar they are to previously identified pixels in the training samples Examples like k-means algorithm Chapter 5: CS689 91
92 6.2f: Multispectral Space Histogram values of certain range may be taken as belonging to a class in feature space A bimodal histogram may be suggestive of two classes in feature space A scattergram can be used to visualize clusters in multispectral space for two spectral bands The scattergram is not good for visualizing more than two spectral bands Chapter 5: CS689 92
93 6.2g: Multispectral Visualization Chapter 5: CS689 93
94 6.3f: Histogram Inference Chapter 5: CS689 94
95 6.3a: Unsupervised Algorithms Unsupervised classifiers have the potential to be more reproducible as no expert is needed to identify pixels Some parameters may be required, e.g., the number of output classes, criteria for starting a new class, number of iterations, uncertainty of class boundaries, or other stopping criteria Many data mining algorithms can be applied for supervised and unsupervised classifications, may be tailored for medical image classifications The question is how to prepare medical image data for the data mining algorithms Chapter 5: CS689 95
96 6.3b: The Chain Method It is a basic squared-error type of classifier using the Euclidean distance in feature space as the metric It can be used as an initial classifier to find out class centroids for more advanced methods The first pixel is set to be in a class by itself and becomes the centroid for that class Subsequent pixels are assigned to an existing class if close enough, otherwise a new class is started Class centriods are updated every time a new pixel is added to a class A centroid is a mean value of the pixels in that class Chapter 5: CS689 96
97 6.3c: The Isodata Method Isodata method is initialized with a set of starting class centroids. Updates are performed as in the Chain method Isodata with merge adds the additional refinement of providing a threshold of change for classes to merge when close enough, or split as they grow Small clusters are either discarded or merged with the closest larger clusters Chapter 5: CS689 97
98 6.4a: Supervised Algorithms Supervised classifiers require the expert guidance of a set of known classes and their characteristics Training samples may be a set of selected pixels from the input data being classified or a predetermined set of standard spectral signatures for the classes to be identified Supervised classifiers are more popular than unsupervised classifiers Chapter 5: CS689 98
99 6.4b: Statistical Classifiers The maximum likelihood or Gaussian classifier algorithm calculates the class centers in feature space for the training samples The directions of the principal components of the feature values and the standard deviations along each spectral components are computed A pixel is classified by computing its probability of belonging to each class, and is assigned to the most likely class Accuracy of classification depends on a good estimate of mean vector and covariance matrix for each class in the feature space Chapter 5: CS689 99
100 6.4c: Neural Network Neural Network classifier builds a standard feedforward neural network and trains it on the class samples The number of input nodes is the number of bands The number of output nodes is the number of defined classes in the training samples The number of hidden nodes is set heuristically Neural network classifies all of feature space by drawing nonlinear boundaries between the classes and train and run quickly with a limited number of classes Chapter 5: CS
101 6.4d: Parzen Windows Classifier Also known as probabilistic neural network It builds up sophisticated estimates of the underlying probability distribution of each class from the individual training samples It draws near-optimal boundaries that approach Bayes optimal It is more computation intensive, but is often the best for complex distributions of sample points Chapter 5: CS
102 6.4e: Euclidean Distance Classifiers When training data is limited, it is difficult to get a good estimate of the mean vector Distance information-based classifiers may be better Minimum distance or nearest neighbor classifiers assign unknown pixels to the class of sample that is closest in feature space Think about the k-means algorithm or the k nearest neighbor algorithm Chapter 5: CS
103 6.4f: Drawbacks of Distance Classifiers Covariance data is not used in minimum distance algorithms, spectral clustering is assumed to spread evenly in the spectral domain Elongated and asymmetric classes having more variation in a particular band are not well modeled with minimum distance methods Input bands should be scaled to the same dynamic range Chapter 5: CS
104 6.5a: Spatial and Feature Context Spatial context and contextual clues can be used to produce more accurate classification A pixel is more likely to be neighbor to pixels of its own class than to be isolated A single pixel of healthy tissue is unlikely surrounded by malignant tissues Contextual information can be incorporated into a classification algorithm, or applied as a filter after classification Chapter 5: CS
105 6.5b: Iterative Refinements An estimate of the likelihood for each class is calculated for each class in statistically based classifiers This information can be used during iterative relaxation where initial or previous classification of pixels with low classification confidence is reconsidered Relaxation can be iterated until no more pixels are classified or the number of changed pixels is below a specified threshold Chapter 5: CS
106 6.6a: Verification of Feature Maps Thematic map verification involves verifying that pixels are correctly labeled Empirical verification involves comparing sample pixels from the thematic map to the reference data An error matrix can be calculated as a simple ratio for each class of the number of pixels correctly and incorrectly classified Multispectral volumetric analysis of brain MRI can show significant deviation from normal values Each clinical problem with multispectral analysis will require its own protocol to select parameters to enhance segmentation of structures of interest Chapter 5: CS
107 6.7a: Feature Space Applied Classification results are presented in two main ways A thematic map in which pixels are color coded to identify components of the scene A numeric report based on pixel counts for each class Multispectral classification can be a valuable tool for object segmentation, particularly for objects consisting of many small disconnected components Chapter 5: CS
108 6.7b Classification Applications Segmented objects can be used for objectoriented volume rendering Object volume is easily calculated from pixel counts This can be used to detect and measure tumor size and brain volume Time series studies have measured response of tumor volume to therapy, as well as changes due to aging Chapter 5: CS
109 6.7c Clinical Applications Detection of malignancies in biospy specimens Measuring tumor response to radiotherapy Detection of multiple sclerosis We need to develop computer based automatic procedures that have high level confidence of accuracy, before they can be applied in clinical situations They have to be tested with many clinical studies and with large population groups before they can be approved for clinical use Chapter 5: CS
Digital Image Processing
Digital Image Processing Third Edition Rafael C. Gonzalez University of Tennessee Richard E. Woods MedData Interactive PEARSON Prentice Hall Pearson Education International Contents Preface xv Acknowledgments
More informationIntroduction to Medical Image Processing
Introduction to Medical Image Processing Δ Essential environments of a medical imaging system Subject Image Analysis Energy Imaging System Images Image Processing Feature Images Image processing may be
More informationFundamentals of Digital Image Processing
\L\.6 Gw.i Fundamentals of Digital Image Processing A Practical Approach with Examples in Matlab Chris Solomon School of Physical Sciences, University of Kent, Canterbury, UK Toby Breckon School of Engineering,
More informationMR IMAGE SEGMENTATION
MR IMAGE SEGMENTATION Prepared by : Monil Shah What is Segmentation? Partitioning a region or regions of interest in images such that each region corresponds to one or more anatomic structures Classification
More information8/3/2017. Contour Assessment for Quality Assurance and Data Mining. Objective. Outline. Tom Purdie, PhD, MCCPM
Contour Assessment for Quality Assurance and Data Mining Tom Purdie, PhD, MCCPM Objective Understand the state-of-the-art in contour assessment for quality assurance including data mining-based techniques
More informationEE795: Computer Vision and Intelligent Systems
EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 WRI C225 Lecture 04 130131 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Histogram Equalization Image Filtering Linear
More informationNorbert Schuff VA Medical Center and UCSF
Norbert Schuff Medical Center and UCSF Norbert.schuff@ucsf.edu Medical Imaging Informatics N.Schuff Course # 170.03 Slide 1/67 Objective Learn the principle segmentation techniques Understand the role
More informationBiometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)
Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong) References: [1] http://homepages.inf.ed.ac.uk/rbf/hipr2/index.htm [2] http://www.cs.wisc.edu/~dyer/cs540/notes/vision.html
More informationComputational Medical Imaging Analysis Chapter 4: Image Visualization
Computational Medical Imaging Analysis Chapter 4: Image Visualization Jun Zhang Laboratory for Computational Medical Imaging & Data Analysis Department of Computer Science University of Kentucky Lexington,
More informationBiomedical Image Analysis. Mathematical Morphology
Biomedical Image Analysis Mathematical Morphology Contents: Foundation of Mathematical Morphology Structuring Elements Applications BMIA 15 V. Roth & P. Cattin 265 Foundations of Mathematical Morphology
More informationModern Medical Image Analysis 8DC00 Exam
Parts of answers are inside square brackets [... ]. These parts are optional. Answers can be written in Dutch or in English, as you prefer. You can use drawings and diagrams to support your textual answers.
More informationImage Registration. Prof. Dr. Lucas Ferrari de Oliveira UFPR Informatics Department
Image Registration Prof. Dr. Lucas Ferrari de Oliveira UFPR Informatics Department Introduction Visualize objects inside the human body Advances in CS methods to diagnosis, treatment planning and medical
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spring 2014 TTh 14:30-15:45 CBC C313 Lecture 10 Segmentation 14/02/27 http://www.ee.unlv.edu/~b1morris/ecg782/
More informationBabu Madhav Institute of Information Technology Years Integrated M.Sc.(IT)(Semester - 7)
5 Years Integrated M.Sc.(IT)(Semester - 7) 060010707 Digital Image Processing UNIT 1 Introduction to Image Processing Q: 1 Answer in short. 1. What is digital image? 1. Define pixel or picture element?
More informationC E N T E R A T H O U S T O N S C H O O L of H E A L T H I N F O R M A T I O N S C I E N C E S. Image Operations II
T H E U N I V E R S I T Y of T E X A S H E A L T H S C I E N C E C E N T E R A T H O U S T O N S C H O O L of H E A L T H I N F O R M A T I O N S C I E N C E S Image Operations II For students of HI 5323
More informationImage Segmentation. Ross Whitaker SCI Institute, School of Computing University of Utah
Image Segmentation Ross Whitaker SCI Institute, School of Computing University of Utah What is Segmentation? Partitioning images/volumes into meaningful pieces Partitioning problem Labels Isolating a specific
More informationCS443: Digital Imaging and Multimedia Binary Image Analysis. Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University
CS443: Digital Imaging and Multimedia Binary Image Analysis Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University Outlines A Simple Machine Vision System Image segmentation by thresholding
More informationCOMPUTER AND ROBOT VISION
VOLUME COMPUTER AND ROBOT VISION Robert M. Haralick University of Washington Linda G. Shapiro University of Washington A^ ADDISON-WESLEY PUBLISHING COMPANY Reading, Massachusetts Menlo Park, California
More informationImage Segmentation. Ross Whitaker SCI Institute, School of Computing University of Utah
Image Segmentation Ross Whitaker SCI Institute, School of Computing University of Utah What is Segmentation? Partitioning images/volumes into meaningful pieces Partitioning problem Labels Isolating a specific
More informationBiomedical Image Processing
Biomedical Image Processing Jason Thong Gabriel Grant 1 2 Motivation from the Medical Perspective MRI, CT and other biomedical imaging devices were designed to assist doctors in their diagnosis and treatment
More informationAn Automated Image-based Method for Multi-Leaf Collimator Positioning Verification in Intensity Modulated Radiation Therapy
An Automated Image-based Method for Multi-Leaf Collimator Positioning Verification in Intensity Modulated Radiation Therapy Chenyang Xu 1, Siemens Corporate Research, Inc., Princeton, NJ, USA Xiaolei Huang,
More informationPROCESS > SPATIAL FILTERS
83 Spatial Filters There are 19 different spatial filters that can be applied to a data set. These are described in the table below. A filter can be applied to the entire volume or to selected objects
More informationImage Segmentation and Registration
Image Segmentation and Registration Dr. Christine Tanner (tanner@vision.ee.ethz.ch) Computer Vision Laboratory, ETH Zürich Dr. Verena Kaynig, Machine Learning Laboratory, ETH Zürich Outline Segmentation
More informationMachine Learning for Medical Image Analysis. A. Criminisi
Machine Learning for Medical Image Analysis A. Criminisi Overview Introduction to machine learning Decision forests Applications in medical image analysis Anatomy localization in CT Scans Spine Detection
More informationFunctional MRI in Clinical Research and Practice Preprocessing
Functional MRI in Clinical Research and Practice Preprocessing fmri Preprocessing Slice timing correction Geometric distortion correction Head motion correction Temporal filtering Intensity normalization
More informationCHAPTER 2. Morphometry on rodent brains. A.E.H. Scheenstra J. Dijkstra L. van der Weerd
CHAPTER 2 Morphometry on rodent brains A.E.H. Scheenstra J. Dijkstra L. van der Weerd This chapter was adapted from: Volumetry and other quantitative measurements to assess the rodent brain, In vivo NMR
More informationSegmentation of Images
Segmentation of Images SEGMENTATION If an image has been preprocessed appropriately to remove noise and artifacts, segmentation is often the key step in interpreting the image. Image segmentation is a
More informationObject Identification in Ultrasound Scans
Object Identification in Ultrasound Scans Wits University Dec 05, 2012 Roadmap Introduction to the problem Motivation Related Work Our approach Expected Results Introduction Nowadays, imaging devices like
More informationSPM8 for Basic and Clinical Investigators. Preprocessing. fmri Preprocessing
SPM8 for Basic and Clinical Investigators Preprocessing fmri Preprocessing Slice timing correction Geometric distortion correction Head motion correction Temporal filtering Intensity normalization Spatial
More informationAutomated segmentation methods for liver analysis in oncology applications
University of Szeged Department of Image Processing and Computer Graphics Automated segmentation methods for liver analysis in oncology applications Ph. D. Thesis László Ruskó Thesis Advisor Dr. Antal
More informationEXAM SOLUTIONS. Image Processing and Computer Vision Course 2D1421 Monday, 13 th of March 2006,
School of Computer Science and Communication, KTH Danica Kragic EXAM SOLUTIONS Image Processing and Computer Vision Course 2D1421 Monday, 13 th of March 2006, 14.00 19.00 Grade table 0-25 U 26-35 3 36-45
More informationDIGITAL IMAGE ANALYSIS. Image Classification: Object-based Classification
DIGITAL IMAGE ANALYSIS Image Classification: Object-based Classification Image classification Quantitative analysis used to automate the identification of features Spectral pattern recognition Unsupervised
More informationSpectral Classification
Spectral Classification Spectral Classification Supervised versus Unsupervised Classification n Unsupervised Classes are determined by the computer. Also referred to as clustering n Supervised Classes
More information1 Introduction Motivation and Aims Functional Imaging Computational Neuroanatomy... 12
Contents 1 Introduction 10 1.1 Motivation and Aims....... 10 1.1.1 Functional Imaging.... 10 1.1.2 Computational Neuroanatomy... 12 1.2 Overview of Chapters... 14 2 Rigid Body Registration 18 2.1 Introduction.....
More informationDEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING DS7201 ADVANCED DIGITAL IMAGE PROCESSING II M.E (C.S) QUESTION BANK UNIT I 1. Write the differences between photopic and scotopic vision? 2. What
More informationBasic fmri Design and Analysis. Preprocessing
Basic fmri Design and Analysis Preprocessing fmri Preprocessing Slice timing correction Geometric distortion correction Head motion correction Temporal filtering Intensity normalization Spatial filtering
More informationImage Processing Fundamentals. Nicolas Vazquez Principal Software Engineer National Instruments
Image Processing Fundamentals Nicolas Vazquez Principal Software Engineer National Instruments Agenda Objectives and Motivations Enhancing Images Checking for Presence Locating Parts Measuring Features
More informationImage Processing. Bilkent University. CS554 Computer Vision Pinar Duygulu
Image Processing CS 554 Computer Vision Pinar Duygulu Bilkent University Today Image Formation Point and Blob Processing Binary Image Processing Readings: Gonzalez & Woods, Ch. 3 Slides are adapted from
More informationMEDICAL IMAGE ANALYSIS
SECOND EDITION MEDICAL IMAGE ANALYSIS ATAM P. DHAWAN g, A B IEEE Engineering in Medicine and Biology Society, Sponsor IEEE Press Series in Biomedical Engineering Metin Akay, Series Editor +IEEE IEEE PRESS
More informationRegion-based Segmentation
Region-based Segmentation Image Segmentation Group similar components (such as, pixels in an image, image frames in a video) to obtain a compact representation. Applications: Finding tumors, veins, etc.
More informationCHAPTER-4 LOCALIZATION AND CONTOUR DETECTION OF OPTIC DISK
CHAPTER-4 LOCALIZATION AND CONTOUR DETECTION OF OPTIC DISK Ocular fundus images can provide information about ophthalmic, retinal and even systemic diseases such as hypertension, diabetes, macular degeneration
More informationSegmenting Lesions in Multiple Sclerosis Patients James Chen, Jason Su
Segmenting Lesions in Multiple Sclerosis Patients James Chen, Jason Su Radiologists and researchers spend countless hours tediously segmenting white matter lesions to diagnose and study brain diseases.
More informationClassification of Subject Motion for Improved Reconstruction of Dynamic Magnetic Resonance Imaging
1 CS 9 Final Project Classification of Subject Motion for Improved Reconstruction of Dynamic Magnetic Resonance Imaging Feiyu Chen Department of Electrical Engineering ABSTRACT Subject motion is a significant
More informationEPI Data Are Acquired Serially. EPI Data Are Acquired Serially 10/23/2011. Functional Connectivity Preprocessing. fmri Preprocessing
Functional Connectivity Preprocessing Geometric distortion Head motion Geometric distortion Head motion EPI Data Are Acquired Serially EPI Data Are Acquired Serially descending 1 EPI Data Are Acquired
More informationComputational Neuroanatomy
Computational Neuroanatomy John Ashburner john@fil.ion.ucl.ac.uk Smoothing Motion Correction Between Modality Co-registration Spatial Normalisation Segmentation Morphometry Overview fmri time-series kernel
More informationSECTION 5 IMAGE PROCESSING 2
SECTION 5 IMAGE PROCESSING 2 5.1 Resampling 3 5.1.1 Image Interpolation Comparison 3 5.2 Convolution 3 5.3 Smoothing Filters 3 5.3.1 Mean Filter 3 5.3.2 Median Filter 4 5.3.3 Pseudomedian Filter 6 5.3.4
More informationCHAPTER 3 IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN
CHAPTER 3 IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN CHAPTER 3: IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN Principal objective: to process an image so that the result is more suitable than the original image
More informationLecture 4: Spatial Domain Transformations
# Lecture 4: Spatial Domain Transformations Saad J Bedros sbedros@umn.edu Reminder 2 nd Quiz on the manipulator Part is this Fri, April 7 205, :5 AM to :0 PM Open Book, Open Notes, Focus on the material
More informationGlobal Journal of Engineering Science and Research Management
ADVANCED K-MEANS ALGORITHM FOR BRAIN TUMOR DETECTION USING NAIVE BAYES CLASSIFIER Veena Bai K*, Dr. Niharika Kumar * MTech CSE, Department of Computer Science and Engineering, B.N.M. Institute of Technology,
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spatial Domain Filtering http://www.ee.unlv.edu/~b1morris/ecg782/ 2 Outline Background Intensity
More informationThe organization of the human cerebral cortex estimated by intrinsic functional connectivity
1 The organization of the human cerebral cortex estimated by intrinsic functional connectivity Journal: Journal of Neurophysiology Author: B. T. Thomas Yeo, et al Link: https://www.ncbi.nlm.nih.gov/pubmed/21653723
More informationRIGID IMAGE REGISTRATION
RIGID IMAGE REGISTRATION Duygu Tosun-Turgut, Ph.D. Center for Imaging of Neurodegenerative Diseases Department of Radiology and Biomedical Imaging duygu.tosun@ucsf.edu What is registration? Image registration
More informationSupplementary methods
Supplementary methods This section provides additional technical details on the sample, the applied imaging and analysis steps and methods. Structural imaging Trained radiographers placed all participants
More informationTopic 6 Representation and Description
Topic 6 Representation and Description Background Segmentation divides the image into regions Each region should be represented and described in a form suitable for further processing/decision-making Representation
More informationRT_Image v0.2β User s Guide
RT_Image v0.2β User s Guide RT_Image is a three-dimensional image display and analysis suite developed in IDL (ITT, Boulder, CO). It offers a range of flexible tools for the visualization and quantitation
More informationThe Insight Toolkit. Image Registration Algorithms & Frameworks
The Insight Toolkit Image Registration Algorithms & Frameworks Registration in ITK Image Registration Framework Multi Resolution Registration Framework Components PDE Based Registration FEM Based Registration
More informationK-Means Clustering Using Localized Histogram Analysis
K-Means Clustering Using Localized Histogram Analysis Michael Bryson University of South Carolina, Department of Computer Science Columbia, SC brysonm@cse.sc.edu Abstract. The first step required for many
More informationOperators-Based on Second Derivative double derivative Laplacian operator Laplacian Operator Laplacian Of Gaussian (LOG) Operator LOG
Operators-Based on Second Derivative The principle of edge detection based on double derivative is to detect only those points as edge points which possess local maxima in the gradient values. Laplacian
More informationImage Processing, Analysis and Machine Vision
Image Processing, Analysis and Machine Vision Milan Sonka PhD University of Iowa Iowa City, USA Vaclav Hlavac PhD Czech Technical University Prague, Czech Republic and Roger Boyle DPhil, MBCS, CEng University
More informationTechnical aspects of SPECT and SPECT-CT. John Buscombe
Technical aspects of SPECT and SPECT-CT John Buscombe What does the clinician need to know? For SPECT What factors affect SPECT How those factors should be sought Looking for artefacts For SPECT-CT Issues
More informationProf. Fanny Ficuciello Robotics for Bioengineering Visual Servoing
Visual servoing vision allows a robotic system to obtain geometrical and qualitative information on the surrounding environment high level control motion planning (look-and-move visual grasping) low level
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spring 2014 TTh 14:30-15:45 CBC C313 Lecture 03 Image Processing Basics 13/01/28 http://www.ee.unlv.edu/~b1morris/ecg782/
More informationData: a collection of numbers or facts that require further processing before they are meaningful
Digital Image Classification Data vs. Information Data: a collection of numbers or facts that require further processing before they are meaningful Information: Derived knowledge from raw data. Something
More informationTumor Detection and classification of Medical MRI UsingAdvance ROIPropANN Algorithm
International Journal of Engineering Research and Advanced Technology (IJERAT) DOI:http://dx.doi.org/10.31695/IJERAT.2018.3273 E-ISSN : 2454-6135 Volume.4, Issue 6 June -2018 Tumor Detection and classification
More informationPart 3: Image Processing
Part 3: Image Processing Image Filtering and Segmentation Georgy Gimel farb COMPSCI 373 Computer Graphics and Image Processing 1 / 60 1 Image filtering 2 Median filtering 3 Mean filtering 4 Image segmentation
More informationChapter 3: Intensity Transformations and Spatial Filtering
Chapter 3: Intensity Transformations and Spatial Filtering 3.1 Background 3.2 Some basic intensity transformation functions 3.3 Histogram processing 3.4 Fundamentals of spatial filtering 3.5 Smoothing
More informationImage Segmentation. Shengnan Wang
Image Segmentation Shengnan Wang shengnan@cs.wisc.edu Contents I. Introduction to Segmentation II. Mean Shift Theory 1. What is Mean Shift? 2. Density Estimation Methods 3. Deriving the Mean Shift 4. Mean
More informationMEDICAL IMAGE COMPUTING (CAP 5937) LECTURE 4: Pre-Processing Medical Images (II)
SPRING 2016 1 MEDICAL IMAGE COMPUTING (CAP 5937) LECTURE 4: Pre-Processing Medical Images (II) Dr. Ulas Bagci HEC 221, Center for Research in Computer Vision (CRCV), University of Central Florida (UCF),
More informationSPM8 for Basic and Clinical Investigators. Preprocessing
SPM8 for Basic and Clinical Investigators Preprocessing fmri Preprocessing Slice timing correction Geometric distortion correction Head motion correction Temporal filtering Intensity normalization Spatial
More informationSpatio-Temporal Registration of Biomedical Images by Computational Methods
Spatio-Temporal Registration of Biomedical Images by Computational Methods Francisco P. M. Oliveira, João Manuel R. S. Tavares tavares@fe.up.pt, www.fe.up.pt/~tavares Outline 1. Introduction 2. Spatial
More informationMultimodality Imaging for Tumor Volume Definition in Radiation Oncology
81 There are several commercial and academic software tools that support different segmentation algorithms. In general, commercial software packages have better implementation (with a user-friendly interface
More informationMedicale Image Analysis
Medicale Image Analysis Registration Validation Prof. Dr. Philippe Cattin MIAC, University of Basel Prof. Dr. Philippe Cattin: Registration Validation Contents 1 Validation 1.1 Validation of Registration
More informationEE 701 ROBOT VISION. Segmentation
EE 701 ROBOT VISION Regions and Image Segmentation Histogram-based Segmentation Automatic Thresholding K-means Clustering Spatial Coherence Merging and Splitting Graph Theoretic Segmentation Region Growing
More informationRegistration-Based Segmentation of Medical Images
School of Computing National University of Singapore Graduate Research Paper Registration-Based Segmentation of Medical Images by Li Hao under guidance of A/Prof. Leow Wee Kheng July, 2006 Abstract Medical
More informationVivekananda. Collegee of Engineering & Technology. Question and Answers on 10CS762 /10IS762 UNIT- 5 : IMAGE ENHANCEMENT.
Vivekananda Collegee of Engineering & Technology Question and Answers on 10CS762 /10IS762 UNIT- 5 : IMAGE ENHANCEMENT Dept. Prepared by Harivinod N Assistant Professor, of Computer Science and Engineering,
More informationLearning-based Neuroimage Registration
Learning-based Neuroimage Registration Leonid Teverovskiy and Yanxi Liu 1 October 2004 CMU-CALD-04-108, CMU-RI-TR-04-59 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Abstract
More informationMutual Information Based Methods to Localize Image Registration
Mutual Information Based Methods to Localize Image Registration by Kathleen P. Wilkie A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Master of
More informationSupervised vs. Unsupervised Learning
Clustering Supervised vs. Unsupervised Learning So far we have assumed that the training samples used to design the classifier were labeled by their class membership (supervised learning) We assume now
More informationMorphological Image Processing
Morphological Image Processing Binary image processing In binary images, we conventionally take background as black (0) and foreground objects as white (1 or 255) Morphology Figure 4.1 objects on a conveyor
More informationIs deformable image registration a solved problem?
Is deformable image registration a solved problem? Marcel van Herk On behalf of the imaging group of the RT department of NKI/AVL Amsterdam, the Netherlands DIR 1 Image registration Find translation.deformation
More informationDetection of Edges Using Mathematical Morphological Operators
OPEN TRANSACTIONS ON INFORMATION PROCESSING Volume 1, Number 1, MAY 2014 OPEN TRANSACTIONS ON INFORMATION PROCESSING Detection of Edges Using Mathematical Morphological Operators Suman Rani*, Deepti Bansal,
More informationWhere are we now? Structural MRI processing and analysis
Where are we now? Structural MRI processing and analysis Pierre-Louis Bazin bazin@cbs.mpg.de Leipzig, Germany Structural MRI processing: why bother? Just use the standards? SPM FreeSurfer FSL However:
More informationCHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION
CHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION 6.1 INTRODUCTION Fuzzy logic based computational techniques are becoming increasingly important in the medical image analysis arena. The significant
More informationProstate Detection Using Principal Component Analysis
Prostate Detection Using Principal Component Analysis Aamir Virani (avirani@stanford.edu) CS 229 Machine Learning Stanford University 16 December 2005 Introduction During the past two decades, computed
More informationThe Anatomical Equivalence Class Formulation and its Application to Shape-based Computational Neuroanatomy
The Anatomical Equivalence Class Formulation and its Application to Shape-based Computational Neuroanatomy Sokratis K. Makrogiannis, PhD From post-doctoral research at SBIA lab, Department of Radiology,
More informationx' = c 1 x + c 2 y + c 3 xy + c 4 y' = c 5 x + c 6 y + c 7 xy + c 8
1. Explain about gray level interpolation. The distortion correction equations yield non integer values for x' and y'. Because the distorted image g is digital, its pixel values are defined only at integer
More informationNIH Public Access Author Manuscript Proc Soc Photo Opt Instrum Eng. Author manuscript; available in PMC 2014 October 07.
NIH Public Access Author Manuscript Published in final edited form as: Proc Soc Photo Opt Instrum Eng. 2014 March 21; 9034: 903442. doi:10.1117/12.2042915. MRI Brain Tumor Segmentation and Necrosis Detection
More informationPerception. Autonomous Mobile Robots. Sensors Vision Uncertainties, Line extraction from laser scans. Autonomous Systems Lab. Zürich.
Autonomous Mobile Robots Localization "Position" Global Map Cognition Environment Model Local Map Path Perception Real World Environment Motion Control Perception Sensors Vision Uncertainties, Line extraction
More informationMathematical Morphology and Distance Transforms. Robin Strand
Mathematical Morphology and Distance Transforms Robin Strand robin.strand@it.uu.se Morphology Form and structure Mathematical framework used for: Pre-processing Noise filtering, shape simplification,...
More informationBroad field that includes low-level operations as well as complex high-level algorithms
Image processing About Broad field that includes low-level operations as well as complex high-level algorithms Low-level image processing Computer vision Computational photography Several procedures and
More informationSISCOM (Subtraction Ictal SPECT CO-registered to MRI)
SISCOM (Subtraction Ictal SPECT CO-registered to MRI) Introduction A method for advanced imaging of epilepsy patients has been developed with Analyze at the Mayo Foundation which uses a combination of
More information2: Image Display and Digital Images. EE547 Computer Vision: Lecture Slides. 2: Digital Images. 1. Introduction: EE547 Computer Vision
EE547 Computer Vision: Lecture Slides Anthony P. Reeves November 24, 1998 Lecture 2: Image Display and Digital Images 2: Image Display and Digital Images Image Display: - True Color, Grey, Pseudo Color,
More informationRobot vision review. Martin Jagersand
Robot vision review Martin Jagersand What is Computer Vision? Computer Graphics Three Related fields Image Processing: Changes 2D images into other 2D images Computer Graphics: Takes 3D models, renders
More informationMedical Image Registration by Maximization of Mutual Information
Medical Image Registration by Maximization of Mutual Information EE 591 Introduction to Information Theory Instructor Dr. Donald Adjeroh Submitted by Senthil.P.Ramamurthy Damodaraswamy, Umamaheswari Introduction
More informationPerformance Evaluation of the TINA Medical Image Segmentation Algorithm on Brainweb Simulated Images
Tina Memo No. 2008-003 Internal Memo Performance Evaluation of the TINA Medical Image Segmentation Algorithm on Brainweb Simulated Images P. A. Bromiley Last updated 20 / 12 / 2007 Imaging Science and
More informationAn Introduc+on to Mathema+cal Image Processing IAS, Park City Mathema2cs Ins2tute, Utah Undergraduate Summer School 2010
An Introduc+on to Mathema+cal Image Processing IAS, Park City Mathema2cs Ins2tute, Utah Undergraduate Summer School 2010 Luminita Vese Todd WiCman Department of Mathema2cs, UCLA lvese@math.ucla.edu wicman@math.ucla.edu
More informationEdge and local feature detection - 2. Importance of edge detection in computer vision
Edge and local feature detection Gradient based edge detection Edge detection by function fitting Second derivative edge detectors Edge linking and the construction of the chain graph Edge and local feature
More informationCHAPTER 6 DETECTION OF MASS USING NOVEL SEGMENTATION, GLCM AND NEURAL NETWORKS
130 CHAPTER 6 DETECTION OF MASS USING NOVEL SEGMENTATION, GLCM AND NEURAL NETWORKS A mass is defined as a space-occupying lesion seen in more than one projection and it is described by its shapes and margin
More informationidentified and grouped together.
Segmentation ti of Images SEGMENTATION If an image has been preprocessed appropriately to remove noise and artifacts, segmentation is often the key step in interpreting the image. Image segmentation is
More informationMedical Image Registration
Medical Image Registration Submitted by NAREN BALRAJ SINGH SB ID# 105299299 Introduction Medical images are increasingly being used within healthcare for diagnosis, planning treatment, guiding treatment
More information