Hessian-Laplace blob detector.

[Daniil Pakhomov]

Hello, Vighnesh Birodkar.

Thank you for your reply.

I have read through some of the related papers and I have a question:

As it seems to me: I will have to compute Hessian with different sigmas (to 
find probable feature points) and also Laplacian of Gaussian with different 
sigmas( to check whether or not the points found on the previous step are 
local minimas in the scale space).

What do you think about efficiency? Because if I have to compute two image 
cubes, it will take some time.

вторник, 3 марта 2015 г., 6:18:22 UTC+1 пользователь Vighnesh Birodkar 
написал:
>
> Hello
>
> The Hessian Laplace blob detector was explained in [1]. 
> Also, look at see `skimage.feature.blob_doh` and skimage.feature.blob_log`
>
> [1] : 
> http://www.robots.ox.ac.uk/~vgg/research/affine/det_eval_files/mikolajczyk_ijcv2004.pdf
>
> Thanks
> Vighnesh
>
>
> On Monday, March 2, 2015 at 10:35:09 PM UTC+5:30, Daniil Pakhomov wrote:
>>
>> Hello,
>>
>> I would like to implement this detector.
>>
>> Can someone give me a list of papers that may help.
>>
>> Thank you.
>>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/scikit-image/attachments/20150303/9d23f517/attachment.html>