Binary Image Segmentation using Graph cut

$30-250 CAD

Inaendelea

Imechapishwa

about 6 years ago

$30-250 CAD

Kulipwa wakati wa kufikishwa

The binary image segmentation problem can be reduced to finding a minimum cut in the graph induced by the image graph: the pixels are the vertices or nodes in the graph and we have edges between any neighbouring pixels in the horizontal and vertical direction (i.e. any vertex has maximum 4 neighbours). Given an initial set of user specified foreground and background pixels (displayed as red and blue strokes) you can use these as sources and targets (or sources and sinks depending on the terminology) and find a minimum cut in this graph. After removing the edges in this cut, the pixels in the image will be disconnected such that each pixel in the image will be connected to either the source the target. If a pixel is connected to the source than it is a foreground pixel and if it is connected to the target than it is a background pixel.

Kitambulisho cha mradi: 16698845

Kuhusu mradi

2 mapendekezo

Mradi wa mbali

Inatumika 6 yrs ago

Unatafuta kupata pesa?

Barua pepe

Faida za kutoa zabuni kwenye Freelancer

Weka bajeti yako na muda uliopangwa

Pata malipo kwa kazi yako

Eleza pendekezo lako

Ni bure kujiandikisha na kutoa zabuni kwa kazi

2 wafanyakazi huru wana zabuni kwa wastani $189 CAD kwa kazi hii

@uzairrzahid

Hi. My name is Uzair.I am in final semester of my masters in Electrical Engineering. I am doing my thesis in biomedical signal processing and Machine learning. I have more than 3 years of experience in MATLAB specially in Signal processing and image processing. I think I can handle your project with quality work. Kindly share some more details. Regards

$222 CAD ndani ya siku 10