Fast Finding a Bitmap contained inside another Bitmap and List the regions

$10-30 USD

已完成

已发布

超过 8 年前

$10-30 USD

货到付款

I have two bitmaps. Lets call the first as SmallBitmap and the other as LargeBitmap. The first bitmap has dimension of 10X10 pixels (this dimension could be changed in the future as an option). The second has the dimension of 600X600. I need to search the SmallBitmap over the LargeBitmap and list all the occurrences in a Tlist with the coordinates. I need a quickly response of the program to list the matches.

Delphi

项目 ID: 8469736

关于此项目

2提案

远程项目

活跃9 年前

想赚点钱吗？

电子邮箱地址

在Freelancer上竞价的好处

设定您的预算和时间范围

为您的工作获得报酬

简要概述您的提案

免费注册和竞标工作

颁发给：

@kukhtinigor

Good day! Something like that? List := [login to view URL]; function SearchBitmap(bmMain, bmSub:TBitMap; var R:TRect):boolean; type TIntArray = array [word] of integer; PIntArray = ^TIntArray; var p0, p1, p2:PIntArray; x, y:integer; x1, y1, w, w0, w1, k : integer; b : boolean; begin result := true; FillChar(R, sizeOf(R), 0); [login to view URL]:=pf32bit; [login to view URL]:=pf32bit; w := [login to view URL]; w0 := [login to view URL]*sizeOf(integer); w1 := [login to view URL]*sizeOf(integer); p0 := [login to view URL][0]; p1 := [login to view URL][0]; for y := 0 to [login to view URL] - [login to view URL] do begin for x := 0 to [login to view URL] - [login to view URL] do begin b := true; p2 := p1; k := 0; for y1 := 0 to bmSub.Height-1 do begin for x1 := 0 to [login to view URL] - 1 do begin if p0[k+x+x1] <> p2[x1] then begin b := false; break; end; end; if not b then break; integer(p2) := integer(p2) - w1; k := k - w; end; if b then begin R := Rect(x, y, x+[login to view URL], y+[login to view URL]); [login to view URL](R) end; end; integer(p0) := integer(p0) - w0; end; result := false; end;

$25 USD 在3天之内