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