Erlend Hodneland, University of Bergen Automated detection of TNT in cell images.

Slides:



Advertisements
Similar presentations
Segmentation by Morphological Watersheds
Advertisements

A Graph based Geometric Approach to Contour Extraction from Noisy Binary Images Amal Dev Parakkat, Jiju Peethambaran, Philumon Joseph and Ramanathan Muthuganapathy.
Computational Biology, Part 23 Biological Imaging II Robert F. Murphy Copyright  1996, 1999, All rights reserved.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Chapter 9: Morphological Image Processing
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Tutorial # 10 Morphological Operations I8oZE.
Chapter 5 Raster –based algorithms in CAC. 5.1 area filling algorithm 5.2 distance transformation graph and skeleton graph generation algorithm 5.3 convolution.
1Ellen L. Walker Edges Humans easily understand “line drawings” as pictures.
Thresholding Otsu’s Thresholding Method Threshold Detection Methods Optimal Thresholding Multi-Spectral Thresholding 6.2. Edge-based.
Chapter 9 Morphological Image Processing. Preview Morphology: denotes a branch of biology that deals with the form and structure of animals and planets.
Chapter 10 Image Segmentation.
Canny Edge Detector.
Canny Edge Detector1 1)Smooth image with a Gaussian optimizes the trade-off between noise filtering and edge localization 2)Compute the Gradient magnitude.
Chapter 10 Image Segmentation.
Image segmentation based on edge and corner detectors Joachim Stahl 04/21/2005.
CS 376b Introduction to Computer Vision 04 / 14 / 2008 Instructor: Michael Eckmann.
Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.
E.G.M. PetrakisBinary Image Processing1 Binary Image Analysis Segmentation produces homogenous regions –each region has uniform gray-level –each region.
Yuan March 10, 2010 Automatic Solar Filaments Segmentation.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Lecture 5. Morphological Image Processing. 10/6/20152 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of animals.
MATHEMATICAL MORPHOLOGY I.INTRODUCTION II.BINARY MORPHOLOGY III.GREY-LEVEL MORPHOLOGY.
Chapter 9.  Mathematical morphology: ◦ A useful tool for extracting image components in the representation of region shape.  Boundaries, skeletons,
Discrete Images (Chapter 7) Fourier Transform on discrete and bounded domains. Given an image: 1.Zero boundary condition 2.Periodic boundary condition.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
DEVELOPMENT OF ALGORITHM FOR PANORAMA GENERATION, AND IMAGE SEGMENTATION FROM STILLS OF UNDERVEHICLE INSPECTION Balaji Ramadoss December,06,2002.
© by Yu Hen Hu 1 ECE533 Digital Image Processing Image Segmentation.
Digital Image Processing Chapter 9: Morphological Image Processing 5 September 2007 Digital Image Processing Chapter 9: Morphological Image Processing.
Image Processing Edge detection Filtering: Noise suppresion.
Edges. Edge detection schemes can be grouped in three classes: –Gradient operators: Robert, Sobel, Prewitt, and Laplacian (3x3 and 5x5 masks) –Surface.
Gianni Ramponi University of Trieste Images © 2002 Gonzalez & Woods Digital Image Processing Chapter 9 Morphological Image.
Detection of nerves in Ultrasound Images using edge detection techniques NIRANJAN TALLAPALLY.
Image Segmentation and Morphological Processing Digital Image Processing in Life- Science Aviad Baram
Chapter 10 Image Segmentation.
Chapter 10, Part II Edge Linking and Boundary Detection The methods discussed in the previous section yield pixels lying only on edges. This section.
Mathematical Morphology Mathematical morphology (matematická morfologie) –A special image analysis discipline based on morphological transformations of.
3D Digital Cleansing Using Segmentation Rays Authors: Sarang Lakare, Ming Wan, Mie Sato and Arie Kaufman Source: In Proceedings of the IEEE Visualization.
1 Eye Detection in Images Introduction To Computational and biological Vision Lecturer : Ohad Ben Shahar Written by : Itai Bechor.
Mathematical Morphology
References Books: Chapter 11, Image Processing, Analysis, and Machine Vision, Sonka et al Chapter 9, Digital Image Processing, Gonzalez & Woods.
Digital Image Processing
CS654: Digital Image Analysis
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
1 Mathematic Morphology used to extract image components that are useful in the representation and description of region shape, such as boundaries extraction.
Morphological Image Processing Robotics. 2/22/2016Introduction to Machine Vision Remember from Lecture 12: GRAY LEVEL THRESHOLDING Objects Set threshold.
 Mathematical morphology is a tool for extracting image components that are useful in the representation and description of region shape, such as boundaries,
Course 5 Edge Detection. Image Features: local, meaningful, detectable parts of an image. edge corner texture … Edges: Edges points, or simply edges,
Digital Image Processing Lecture 17: Segmentation: Canny Edge Detector & Hough Transform Prof. Charlene Tsai.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
TOPIC 12 IMAGE SEGMENTATION & MORPHOLOGY. Image segmentation is approached from three different perspectives :. Region detection: each pixel is assigned.
Machine Vision ENT 273 Hema C.R. Binary Image Processing Lecture 3.
ECE472/572 - Lecture 14 Morphological Image Processing 11/17/11.
Lecture(s) 3-4. Morphological Image Processing. 3/13/20162 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of.
Chapter 6 Skeleton & Morphological Operation. Image Processing for Pattern Recognition Feature Extraction Acquisition Preprocessing Classification Post.
Computer Vision Computer Vision based Hole Filling Chad Hantak COMP December 9, 2003.
Detection of nerves in Ultrasound Images using edge detection techniques NIRANJAN TALLAPALLY.
Grid-Based Genetic Algorithm Approach to Colour Image Segmentation Marco Gallotta Keri Woods Supervised by Audrey Mbogho.
Mathematical Morphology
Chapter 10 Image Segmentation
Game Theoretic Image Segmentation
Detection of discontinuity using
Computer Vision Lecture 12: Image Segmentation II
Maximally Stable Extremal Regions
Binary Image processing بهمن 92
Maximally Stable Extremal Regions
Digital Image Processing
CS654: Digital Image Analysis
Automated Detection and Analysis of Ca2+ Sparks in x-y Image Stacks Using a Thresholding Algorithm Implemented within the Open-Source Image Analysis Platform.
Morphological Operators
Presentation transcript:

Erlend Hodneland, University of Bergen Automated detection of TNT in cell images.

Erlend Hodneland, University of Bergen Automated detection of TNT in cell images.

Erlend Hodneland, University of Bergen Automated detection of TNTs(Tunnelling NanoTubes) in cell images

Erlend Hodneland, University of Bergen Automated detection of TNTs(Tunnelling NanoTubes) in cell images Erlend Hodneland, Arvid Lundervold, Xue-Cheng Tai, Steffen Gurke, Amin Rustom, Hans-Hermann Gerdes.

Erlend Hodneland, University of Bergen 3D session at fluorescence microscope Dimension : 520x688x40 Dimension : 520x688x40 Better resolution in xy plane than in z direction. Better resolution in xy plane than in z direction.

Erlend Hodneland, University of Bergen Two image channels The channels appear from biological stainings of sample. The stainings are photo sensible to specific wavelengths and accumulate in certain compartmens of the cells.

Erlend Hodneland, University of Bergen First channel displaying cell borders and TNTs

Erlend Hodneland, University of Bergen Gaussian noise and undesired structures

Erlend Hodneland, University of Bergen Video of image stack

Erlend Hodneland, University of Bergen Second channel displaying cell cytoplasma

Erlend Hodneland, University of Bergen Biological relevance of TNTs TNTs are until recently unknown cell structures. TNTs are until recently unknown cell structures. Play a role in cell to cell communication. Play a role in cell to cell communication. Transport of virus? Transport of virus? Spread of cancer? Spread of cancer? Virus moving? Cell 1Cell 2

Erlend Hodneland, University of Bergen Automated detection of TNTs A very challenging problem due to large variability between images. A very challenging problem due to large variability between images. The basis methods are built up around The basis methods are built up around Zerocross and Canny edgedetectors. Zerocross and Canny edgedetectors. Morphology incl. Watershed segmentation, binary filling, dilation, erosion, closing and opening. Morphology incl. Watershed segmentation, binary filling, dilation, erosion, closing and opening.

Erlend Hodneland, University of Bergen Morhpological operators* *Serra, J 1982, Image analysis and mathematical morphology., Academic Press.

Erlend Hodneland, University of Bergen Morhpological operators* *Serra, J 1982, Image analysis and mathematical morphology., Academic Press.

Erlend Hodneland, University of Bergen Morhpological operators* *Serra, J 1982, Image analysis and mathematical morphology., Academic Press.

Erlend Hodneland, University of Bergen Morhpological operators* *Serra, J 1982, Image analysis and mathematical morphology., Academic Press.

Erlend Hodneland, University of Bergen Morhpological operators* *Serra, J 1982, Image analysis and mathematical morphology., Academic Press.

Erlend Hodneland, University of Bergen Step #1 : Find cellular regions Using canny edge detector to find borders of cells. Using canny edge detector to find borders of cells. Edge detectors create lots of broken parts, we need to combine these parts. Edge detectors create lots of broken parts, we need to combine these parts.

Erlend Hodneland, University of Bergen Step #1 : Find cellular regions Use morphological closing and dilation to combine edges into closed regions. Use morphological closing and dilation to combine edges into closed regions. Dilation and closing

Erlend Hodneland, University of Bergen Step #1 : Find cellular regions Use morphological filling to fill closed regions. Use morphological filling to fill closed regions. Cells shown as white, filled regions. Cells shown as white, filled regions. Filling

Erlend Hodneland, University of Bergen Step #1 : Find cellular regions 3-D representation of binary cell image. 3-D representation of binary cell image. Combine All planes.

Erlend Hodneland, University of Bergen Step #2 Find important edges in cell border channel The first channel displays TNTs and cell borders. The first channel displays TNTs and cell borders. TNTs have low intensities compared to cell borders but they have a large gradient. TNTs have low intensities compared to cell borders but they have a large gradient.

Erlend Hodneland, University of Bergen Step #2 Find important edges in cell border channel Remove edges inside cells. Remove edges inside cells.

Erlend Hodneland, University of Bergen Watershed segmentation A segmentation procedure specially designed for images with natural minima. A segmentation procedure specially designed for images with natural minima. A reliable segmentation method, but it needs suitable minima regions as input for the region growing. A reliable segmentation method, but it needs suitable minima regions as input for the region growing. Background Cell

Erlend Hodneland, University of Bergen Watershed segmentation Pathwise criterion of Watershed lines W: Pathwise criterion of Watershed lines W: For all A i (a,b), min(W(a,b)) ≥ min(A i (a,b)) ”Moving on the top of the hill” a b Region 1 Region 2 Region 3 min(Ai(a,b)) min(W(a,b))

Erlend Hodneland, University of Bergen Watershed segmentation The minima seeding regions are extremely important and decide where the watershed lines will appear. The minima seeding regions are extremely important and decide where the watershed lines will appear. Minima regions Minima imposed on image

Erlend Hodneland, University of Bergen Watershed segmentation Results improve when the minima seeding regions are close to the crest of the desired structures. Results improve when the minima seeding regions are close to the crest of the desired structures Watershed image, {1,2 … 7} The boundaries of cells

Erlend Hodneland, University of Bergen Watershed segmentation Results improve when the minima seeding regions are close to the crest of the desired structures. Results improve when the minima seeding regions are close to the crest of the desired structures Watershed image, {1,2 … 7} The boundaries of cells

Erlend Hodneland, University of Bergen Step #3 Watershed segmentation to find crest of structures from edges TNTs are thin and narrow, approximately 3- 4 pixles wide ( nm). TNTs are thin and narrow, approximately 3- 4 pixles wide ( nm). 1 1 TNT

Erlend Hodneland, University of Bergen Step #3 Watershed segmentation to find crest of structures from edges Problem : The structures from the edge image are not always continuous and they are not marking the crest of the structure. Problem : The structures from the edge image are not always continuous and they are not marking the crest of the structure. Solution : Use watershed segmentation to create connected lines on the crest of the high intensity structures. Solution : Use watershed segmentation to create connected lines on the crest of the high intensity structures.

Erlend Hodneland, University of Bergen Step #3 Watershed segmentation to find crest of structures from edges Problem : The structures from the edge image are not always continuous and they are not marking the crest of the structure. Problem : The structures from the edge image are not always continuous and they are not marking the crest of the structure. 1 TNT 1

Erlend Hodneland, University of Bergen Step #3 Watershed segmentation to find crest of structures from edges Important: TNTs can cross several planes. Important: TNTs can cross several planes. Therefore we use a projection in 3-D  2-D to include the whole TNT. Therefore we use a projection in 3-D  2-D to include the whole TNT. All projections are ranging over the same planes as the structure we investigate. All projections are ranging over the same planes as the structure we investigate. Cell 2 x y z Cell 1 TNT 10 20

Erlend Hodneland, University of Bergen Step #3 Watershed segmentation to find crest of structures from edges Plane 10 Plane 11 Plane 12 Plane 13

Erlend Hodneland, University of Bergen Step #3 Watershed segmentation to find crest of structures from edges Using the maximum projection of the structure from the edge image to take advantage of 3-D information. Using the maximum projection of the structure from the edge image to take advantage of 3-D information. 1 TNT Maximum projection and closing

Erlend Hodneland, University of Bergen Step #3 Watershed segmentation to find crest of structures from edges We use information from the segmentation of cells to construct minima regions to seed the Watershed segmentation. We use information from the segmentation of cells to construct minima regions to seed the Watershed segmentation. Background Cells TNT

Erlend Hodneland, University of Bergen Step #3 Watershed segmentation to find crest of structures from edges We use information from the segmentation of cells to construct minima regions to seed the Watershed segmentation. We use information from the segmentation of cells to construct minima regions to seed the Watershed segmentation. TNT Morphological opening Impose (1) on (2) 1 2 Minima regions

Erlend Hodneland, University of Bergen Step #3 Watershed segmentation to find crest of structures from edges For Watershed we use the sum projection of the image to take advantage of 3-D information and for Gaussian noise supression. For Watershed we use the sum projection of the image to take advantage of 3-D information and for Gaussian noise supression. TNT Sum projection Image stack

Erlend Hodneland, University of Bergen Step #3 Watershed segmentation to find crest of structures from edges Using Watershed segmentation to achieve a connected line on the crest of the structure from the edge image. Using Watershed segmentation to achieve a connected line on the crest of the structure from the edge image. TNT Watershed segmentation TNT Minima regions

Erlend Hodneland, University of Bergen Step #4 Removal of false TNT candidates We end up with numerous TNT candidates, some false and some true. We end up with numerous TNT candidates, some false and some true. TNT candidates Watershed segmentation

Erlend Hodneland, University of Bergen Step #4 Removal of false TNT candidates Each TNT candidate must undergo an evaluation of correctedness. Remove candidates Each TNT candidate must undergo an evaluation of correctedness. Remove candidates having low intensities compared to their surroundings. having low intensities compared to their surroundings. not crossing between two cells. not crossing between two cells. not beeing straigth lines using hough transformation. not beeing straigth lines using hough transformation. crossing at the nearest distance of the cells. crossing at the nearest distance of the cells. We are left with ”true” TNT structures after the exclusion evaluation. We are left with ”true” TNT structures after the exclusion evaluation.

Erlend Hodneland, University of Bergen Results We have employed our algorithm to 51 3-D image stacks: We have employed our algorithm to 51 3-D image stacks: Success rate 67% Success rate 67% False positive 50% False positive 50% False negative 33% False negative 33% compared to manual counting. The high number of false positive TNTs is mostly due to large image variations and irregularities of the cells. The high number of false positive TNTs is mostly due to large image variations and irregularities of the cells.

Erlend Hodneland, University of Bergen Results Large irregularites. Large irregularites. Main reason for false positive or false negative TNTs. Main reason for false positive or false negative TNTs.

Erlend Hodneland, University of Bergen Results Large irregularites. Large irregularites. Main reason for false positive or false negative TNTs. Main reason for false positive or false negative TNTs.

Erlend Hodneland, University of Bergen Results Nano experiments to grow the cells on pre- defined matrices. Nano experiments to grow the cells on pre- defined matrices. This will improve the automated detection. This will improve the automated detection.

Erlend Hodneland, University of Bergen Conclusion We have developed an automated method for counting TNTs in cell images. We have developed an automated method for counting TNTs in cell images. The method is essentially based on existing image processing techniques like edge-detectors, watershed segmentation and morphological operators. The method is essentially based on existing image processing techniques like edge-detectors, watershed segmentation and morphological operators. We report a success rate of 67% compared to manual counting. We report a success rate of 67% compared to manual counting.