[Insight-developers] Re: [Insight-users] Dynamic Programming 2

[Karthik Krishnan]

Hi Gabriel,

Great! Contributions are always welcome.

Do you have an implementation at hand ? Is it possible to post your code 
as an attachment ?
You might also want to subscribe to Insight-developers mailing list. 
This is an appropriate sounding board for contributions and related 
questions.

Instructions on how to subscribe to it are at :
http://www.itk.org/mailman/listinfo/insight-developers

On a related note, Dr James Gee's group at Univ of Pennsylvania is 
working on an implementation of Graph cuts based segmentation. You might 
have framework in common as far as graph based representations are 
concerned.

Thank you.
Regards
Karthik


Gabriel Camporredondo Díaz wrote:

> Sorry about last message,...
>
> The algorithm is a Dijkstra modified algorithm, commonly used in dynamic
> programming for finding the minimum tree or path in a graph. It has 
> frequently
> been used in image processing to evaluate the cost of image features, 
> such as
> gradient histograms,  statistical funtions, etc. and trace paths of 
> optimal cost.
> I thing there may be some other applications that fall in the same 
> criteria, though.
>
> Some early but commonly accessible references:
> 1. N.J.Nilsson, "Principles of Artificial Intelligent", Tioga, Palo 
> Alto, CA, 1980.
> 2. E.W. Dijkstra, A note on two problems in connection with graphs , 
> Num. Math. 1
>    (959), 269-270.
> 3. J. Udupa et al, Boundary detection via dynamic programming, in 
> "Proccedings
>     of the SPIE: Visualization in Biomedical Computing 92, Chapel 
> Hill, NC, Oct.
>     1992", Vol. 1808, pp.33-39.
>
> So, pls let me know to update and put in good shape my code. Bye.
>
> Regards,
> Gabriel
>
>
> Karthik Krishnan wrote:
>
>> Hi Gabriel
>>
>> I apologize for the delay. It would be great if you could contribute 
>> the classes. I am sure they will be of use in the ITK's Statistics 
>> library and/or the Algorithms library. What exactly do you have in 
>> mind. Is it for something like Curves extraction ? We would be happy 
>> to help you package the code into ITK filters.
>>
>> Thanks
>> karthik
>>
>> Gabriel Camporredondo Díaz wrote:
>>
>>> Once again, I forward my message again, keep waiting for answer!
>>>
>>>> Dear Luis Ibañez and ITK users,
>>>>
>>>> I've searched into itk libraries looking for dynamic programming
>>>> functions, but without success. I guess there isn't any at this point.
>>>> Initially I was interested in replacing  my code for any available
>>>> in ITK, but if there isn't any, I would like to submit my code
>>>> of Minimum Cost Paths Search on images. If you are interested
>>>> on or you consider it could be beneficial. I've seen some requests
>>>> of this issue in the itk email-list messages. Pls let me know.
>>>> I am pleased to contribute. See you all.
>>>>
>>>> Regards,
>>>>
>>>>
>>>> -- 
>>>> Gabriel Camporredondo-Diaz
>>>> ECE - HCT Lab
>>>> University of British Columbia
>>>> Canada
>>>>  
>>>>
>>>
>>> _______________________________________________
>>> Insight-users mailing list
>>> Insight-users at itk.org
>>> http://www.itk.org/mailman/listinfo/insight-users
>>>
>
> _______________________________________________
> Insight-users mailing list
> Insight-users at itk.org
> http://www.itk.org/mailman/listinfo/insight-users
>