Re: [scikit-image] New logo?

At least it’s fine for Tritanopians! ;) Good effort! Michael > On May 2, 2017, at 23:09, Stefan van der Walt wrote: > > Hi, everyone > > It's been bothering me for a while that we have a logo that is not colorblind > friendly. > > E.g., try running scikit-image.org through > > https://www.

[scikit-image] New logo?

Hi, everyone It's been bothering me for a while that we have a logo that is not colorblind friendly. E.g., try running scikit-image.org through https://www.toptal.com/designers/colorfilter :/ *I challenge you to submit a new logo, and a hexagonal sticker [0] that we can print for SciPy 2017.**

Re: [scikit-image] Help with MCP.goal_reached() in graph module

Good point. Hadn't thought about the monotonic problem with Dijkstra. My problem is I need the costs to represent considerations other than pure distance but my ultimate outcome must be constrained by a total distance, so there's not really a good way that I can see to fold them together. One stra

Re: [scikit-image] Help with MCP.goal_reached() in graph module

I can't think of any alternatives off the top of my head. The usual solution is to incorporate everything into your cost function, instead of having two separate stopping criteria -- most problems lend themselves to this pretty well. And actually, now that I think of it: Dijkstra's algorithm (whic

Re: [scikit-image] Help with MCP.goal_reached() in graph module

Thanks. That's extremely helpful. I think I'll be able to work out the subclassing. I've never worked in cython but there's a first time for everything. Is there some alternative solution to my problem that I've missed? I've scoured the documentation from various software projects (GIS and non-GIS

Re: [scikit-image] Help with MCP.goal_reached() in graph module

> I need to implement a minimum cost path through an array of costs. The added > twist is that I need to ensure the path does not exceed some maximum > geometric distance (represented as a total number of traversed cells). So I > need my goal_reached() method to check whether the current path has e

[scikit-image] Help with MCP.goal_reached() in graph module

The skimage.graph documentation states that the goal_reached method can be overloaded to introduce additional constraints on finding the minimum cost path. I'm having some trouble implementing this but I can't find any useful examples to follow online. I'm hoping someone can provide some guidance.

Re: [scikit-image] Making glare free photo scans

Looks interesting — If possible, I’ll take a look during the weekend and update. Surya > On May 2, 2017, at 9:55 AM, Juan Nunez-Iglesias wrote: > > Hi everyone, > > I recently saw this blog post from Google and was struck by how easily it > could map to scikit-image functions. If anyone

Re: [scikit-image] Using EllipseModel

Hi Juan, Thanks for raising the ticket. I will look into it and possibly add a small script to reproduce what I’m facing. Best, Surya > On May 2, 2017, at 8:48 AM, Juan Nunez-Iglesias wrote: > > I’ve raised the issue: > https://github.com/scikit-image/scikit-image/issues/2646 >

[scikit-image] Making glare free photo scans

Hi everyone, I recently saw this blog post from Google and was struck by how easily it could map to scikit-image functions. If anyone wants to make a blog post / gallery example, it would be most welcome. ;) https://research.googleblog.com/2017/04/photoscan-taking-glare-free-pictures-of.html J

Re: [scikit-image] Segmentation

Yes, as you say and as suggested by Brian, I think using the background from the watershed would be the proper way. You could also find the mean intensity of each label and set to background those with a mean intensity below some threshold. The ndimage.labeled_comprehension function should be ab

Re: [scikit-image] Using EllipseModel

I’ve raised the issue: https://github.com/scikit-image/scikit-image/issues/2646 On 29 Apr 2017, 5:40 AM +1000, Stefan van der Walt , wrote: > It may well be that those two functions use opposite directions for theta.  > Do you mind filing an issue? > > Thanks > Stéfan > > On Fri, Apr 28, 2017, a