Top Banner
SUCH AS MULTI-FOCUS OR MULTI-CUE FOR CAPTURE IMAGE MULTI-CAMERAS APPLICATION Professor: Pei-Jun Lee Researcher: Bui Trong An Weekly report 105.11.23
16

Researching - Image Segmentation with Watershed Algorithm

Jan 09, 2017

Download

Mobile

An Bui Trong
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Researching - Image Segmentation with Watershed Algorithm

SUCH AS MULTI-FOCUS OR MULTI-CUE FOR CAPTURE IMAGE

MULTI-CAMERASAPPLICATION

Professor: Pei-Jun LeeResearcher: Bui Trong An

Weekly report 105.11.23

Page 2: Researching - Image Segmentation with Watershed Algorithm

Outline

- Progressing- Has implemented- Implement in this week- Implement in next week- Issue

Page 4: Researching - Image Segmentation with Watershed Algorithm

Has implementedSetup Environment development

Setup environment development mobile app and OpenCV Library for Coding.

Convert Source Image to SIFT ImageInput source image from mobile device to application. Then use OpenCV library converted source image to SIFT image.

Page 5: Researching - Image Segmentation with Watershed Algorithm

Implement in this weekP1: Initial segmentation - Convert Image to Initial segmentation in Progressing Fig.2

- Research algorithm- Library algorithm in OpenCV- Apply to Mobile Project- Run and test with mobile device – Android)

Page 6: Researching - Image Segmentation with Watershed Algorithm

Implement in this weekResearch algorithm

- Initial segmentation- Image Segmentation with Watershed Algorithm

http://docs.opencv.org/3.1.0/d3/db4/tutorial_py_watershed.html

Page 7: Researching - Image Segmentation with Watershed Algorithm

Implement in this weekImage segmentation

•Image segmentation is an aspect of image processing and is a com-puter vision process.

•The goal of segmentation: is to simplify and/or change the repre-sentation of an image into something that is more meaningful and easier to analyze.

https://en.wikipedia.org/wiki/Image_segmentation

Page 8: Researching - Image Segmentation with Watershed Algorithm

Implement in this weekMethod Image segmentation

•Thresholding•Clustering methods•Compression-based methods•Histogram-based methods•Edge detection•Dual clustering method•Region-growing methods•Partial differential equation-based methods•Variational methods•Graph partitioning methods

https://en.wikipedia.org/wiki/Image_segmentation

Page 9: Researching - Image Segmentation with Watershed Algorithm

Implement in this weekWatershed Algorithm

http://cmm.ensmp.fr/~beucher/wtshed.html

The segmentation paradigm

Segmenting an image by the watershed transformation is therefore a two-step process: 

• Finding the markers and the segmentation criterion (the crite-rion or function which will be used to split the regions - it is most often the contrast or gradi-ent, but not necessarily). 

• Performing a marker-controlled watershed with these two ele-ments. 

Page 11: Researching - Image Segmentation with Watershed Algorithm

Implement in this weekRun and test with Mobile device - Android

Page 12: Researching - Image Segmentation with Watershed Algorithm

Implement in next weekFocus algorithm and progressing

• Watershed Algorithm - detailed• Multi input ( 2 source image) and compile to P1

Page 13: Researching - Image Segmentation with Watershed Algorithm

Outline

--- The end ---

Page 14: Researching - Image Segmentation with Watershed Algorithm
Page 15: Researching - Image Segmentation with Watershed Algorithm

Implement in this weekFundamentals

Let R represent the entire region occupied by an image.

Image segmentation partitions R into n subregions R1, R2, ….., Rn,

such that

a. U Ri = R

b. Ri is a connected set, i = 1, 2, …., n

c. Ri n Rj = ø for all i & j, i ≠ j

d. Q(Ri) = TRUE for i = 1, 2, ….., n

e. Q(Ri U Rj) = FALSE for any adjacent regions Ri & Rj.

Page 16: Researching - Image Segmentation with Watershed Algorithm

Implement in this weekFundamentals

Q(Rk) is a logical predicate over the points in set Rk

Explanation:

Every pixel must be in a region.

Points in a region be 4- or 8- connected.

Regions must be disjoint

Q(Ri) = TRUE if all pixels have same intensity level.

Two adjacent regions Ri & Rj must be different in the sense of predicate

Q.