![]() dupeGuru PE runs on Windows 2k/XP/Vista and Mac OS X 10.4. It works like dupeGuru, but is specialized for duplicate pictures matching. dupeGuru PE is a big brother of dupeGuru. Since the number resulting from the addition for each picture gives an idea of the light present in the picture (the higher the number -maximum is 172800-, the lighter the picture), I will call the value brightness.DupeGuru Picture Edition (PE for short) is a tool to find duplicate pictures on your computer. Comparison phase: No matter where the algorithm starts, it compares each picture with each picture after it until reaching the threshold and then it stops, since the comparison with each of all following pictures will result in a higher score.Therefore this phase will take longer than before, but the comparison phase will become much faster. Blockification phase: no caching of 675 bytes per picture required, just the addition of all of them.Let's see how it would work based on this documentation: Once the sorting criterion is clear, the bright of the proposal comes to shine. But the result is the same if you add all the 675 bytes of a picture to a single number and then compare! That's basic arithmetic (although I needed some minutes to see it myself): (x1-y1)+(x2-y2) = (x1+x2)-(y1+y2). Think about it, the comparison score being used to test against the threshold results from adding all single differences. ![]() ![]() The key point of the whole idea is the less elaborated part of the proposal □ Which alternatives do I see as sorting criterion? In fact only one:Īdd the values of all 675 bytes to a single number and use it for comparisons. Since it doesn't look as if will elaborate the sorting criteria as is asking for, let me try to analyze the proposal. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |