I need to scan the binary image according as:
row range from row m to the height of the image, column range of (n − 30) to (n + 30), get the point with the least white pixels, and denoted by q(x, y), get region of (x − 30, x + 30), (y − 30, y + 30) as region of interest

댓글 수: 7

KSSV
KSSV 2019년 3월 7일
Okay.....go ahead..what is the problem?
rahul unnikrishnan
rahul unnikrishnan 2019년 3월 7일
Please provide the matlab code
KSSV
KSSV 2019년 3월 7일
if you have given x and y..you can pick the indices:
idx = (x-30):(x+30) ;
rahul unnikrishnan
rahul unnikrishnan 2019년 3월 7일
편집: rahul unnikrishnan 2019년 3월 7일
How can we get the point with the least white pixels
Rik
Rik 2019년 3월 7일
You could find the region with the least number of true positions with a convolution.
rahul unnikrishnan
rahul unnikrishnan 2019년 3월 7일
Please provide the Matlab code
Rik
Rik 2019년 3월 7일
Do you realize how rude you sound? You didn't show any indication that you put in any effort. If you want a turn key solution, you should hire a consultant. If you want help, you can stay on this forum.
Have a read here (or here for more general advice). It will greatly improve your chances of getting an answer.

댓글을 달려면 로그인하십시오.

답변 (0개)

질문:

2019년 3월 7일

댓글:

Rik
2019년 3월 7일

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by