StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POFaster Image Processing than Lock Bits
primarykey
Id
16090254
data
AcceptedAnswerId
16091656
AnswerCount
4
ClosedDate
CommentCount
8
CommunityOwnedDate
CreationDate
2013-04-18T18:11:42.523
FavoriteCount
1
LastActivityDate
2018-04-08T20:50:33.357
LastEditDate
2018-03-02T07:12:19.277
LastEditorUserId
8280225
OwnerUserId
2296368
ParentId
0
PostTypeId
1
Score
4
ViewCount
5737
LastEditorDisplayName
text
Body
I've been working on an edge detection program in C#, and to make it run faster, I recently made it use lock bits. However, lockBits is still not as fast as I would like it to run. Although the problem could be my general algorithm, I'm also wondering if there is anything better than lockBits I can use for image processing. In case the problem is the algorithm, here's a basic explanation. Go through an array of Colors (made using lockbits, which represent pixels) and for each Color, check the color of the eight pixels around that pixel. If those pixels do not match the current pixel closely enough, consider the current pixel an edge. Here's the basic code that defines if a pixel is an edge. It takes in a Color[] of nine colors, the first of which is the pixel is to check. <pre><code>public Boolean isEdgeOptimized(Color[] colors) { //colors[0] should be the checking pixel Boolean returnBool = true; float percentage = percentageInt; //the percentage used is set //equal to the global variable percentageInt if (isMatching(colors[0], colors[1], percentage) && isMatching(colors[0], colors[2], percentage) && isMatching(colors[0], colors[3], percentage) && isMatching(colors[0], colors[4], percentage) && isMatching(colors[0], colors[5], percentage) && isMatching(colors[0], colors[6], percentage) && isMatching(colors[0], colors[7], percentage) && isMatching(colors[0], colors[8], percentage)) { returnBool = false; } return returnBool; } </code></pre> This code is applied for every pixel, the colors of which are fetched using lockbits. So basically, the question is, how can I get my program to run faster? Is it my algorithm, or is there something I can use that is faster than lockBits? By the way, the project is on gitHub, <a href="https://github.com/vkoves/EdgeDetection" rel="nofollow noreferrer">here</a>
Tags
<c#><image><image-processing><edge-detection><lockbits>
Title
Faster Image Processing than Lock Bits
singulars
PostAcceptedAnswerId
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USvkoves
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
2. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 POFaster Image Processing than Lock Bits
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 POFaster Image Processing than Lock Bits
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTApproveEditSuggestion
3. VO
 singulars
 PostPostId
 POFaster Image Processing than Lock Bits
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.