User:Nrp/Weekly updates/20080705: Difference between revisions

From OLPC
Jump to navigation Jump to search
(thursday)
No edit summary
 
Line 9: Line 9:
== Thursday ==
== Thursday ==
* By some miracle, changing the function to get the largest connected component actually worked on the first try. Now its just a matter of integrating it with masks and seeing if it'll run at a usable speed on the XO.
* By some miracle, changing the function to get the largest connected component actually worked on the first try. Now its just a matter of integrating it with masks and seeing if it'll run at a usable speed on the XO.
== Friday ==
* Integrated largest connected component function into pygame.

Latest revision as of 00:09, 7 July 2008

Saturday

  • Researched connected components extraction

Monday

  • Continued connected components research

Tuesday

  • Started writing a connected components function using decision trees and array based union-find. As far as I can tell, this is the current state of the art in connected component algorithms.

Wednesday

  • Finished the connected components function and tested it. It still needs more testing, and I have to come up with a way of tracking the number of pixels in each connected component without needing another pass of the array. Then I can plug it into pygame.mask

Thursday

  • By some miracle, changing the function to get the largest connected component actually worked on the first try. Now its just a matter of integrating it with masks and seeing if it'll run at a usable speed on the XO.

Friday

  • Integrated largest connected component function into pygame.