Changes between Version 24 and Version 25 of GSoC/2016/Additional_segmentation_algorithms/weekly_report
- Timestamp:
- May 30, 2016, 7:05:46 PM (8 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
GSoC/2016/Additional_segmentation_algorithms/weekly_report
v24 v25 18 18 === What did you get done this week? === 19 19 * Finished A small exercise too get more familiar with basic GRASS codes 20 Because currently i.segment only provides one algorithm, the entire layout of the module GUI is related to that one algorithm. By modifying the codes in [https://trac.osgeo.org/grass/browser/sandbox/bo/i.segment.gsoc2016/i.segment/parse_args.c parse_args.c] I added three inputs in the Required tab, then one tab per algorithm with algorithm-specific parameters. 20 Currently i.segment only provides region-growth algorithm. By modifying the codes in [https://trac.osgeo.org/grass/browser/sandbox/bo/i.segment.gsoc2016/i.segment/parse_args.c parse_args.c] I added three inputs each for the additional two algorithms-- mean-shift and watershed. 21 21 22 22 * Reviewed some literature for mean-shift algorithm … … 38 38 === What did you get done this week? === 39 39 * Further discussion about the algorithm mechanism (about the edge effect) 40 the solution of the edge effect: when the moving window located in the edge of the image, adaptively cut the moving window to fit the edge, because the weights are adaptively fit the number of pixels inside of moving windows, this number of pixels will vary for each window anyway depending on how many pixels are discarded because the spectral difference is larger than the spectral bandwidth. NULL cells are discarded anyway. Chopping off edges can be avoided for example for the very first pixel at row 0, col 0 by setting the window to those pixels east and south of the corner pixel. The new bandvalue is new value += weight * current value and weightsum += weight.41 40 42 41 * Got the access for GRASS-addons-svn and [https://trac.osgeo.org/grass/browser/sandbox/bo/i.segment.gsoc2016 sandbox] … … 47 46 48 47 === What do you plan on doing next week? === 49 * Write the meanshift.c codes to implement the meanshift algorithm based on pseudo-code. there will be two parts, the mean-shift filtering part will be write based on the pseudo codes, and the second part--clustering to super-pixel will use some part of r.clump. 48 * Write the meanshift.c module to implement the mean-shift algorithm based on pseudo-code. 49 Next week codes will be based on the essential functions of mean-shift algorithm. the fixed bandwidth and range width will be used and the codes need to implement the function which is able to separate objects(super-pixel). 50 50 51 === Are you blocked on anything? === 51 52 * No, thanks for mentors modifying a more generic pseudo-code