Rank: 22855 based on 0 downloads (last 30 days) and 0 files submitted

Olga Avila

E-mail: Contact Author

Personal Profile:
Professional Interests:

Watch this Author's files

Files
Watch Lists

Comments and Ratings by Olga		View all 1 - 5 of 5
Updated	File	Comments	Rating
31 Jul 2011	anisodiff in matlab This code will help u anisotropic diffusion Author: Aadarsh Malviya	There is no acknowledgement to the real author of this function (Peter Kovesi) http://www.csse.uwa.edu.au/~pk/Research/MatlabFns/#anisodiff
31 Jul 2011	anisodiff in matlab This code will help u anisotropic diffusion Author: Aadarsh Malviya
17 Nov 2009	Fast and Robust Curve Intersections Computes intersection points of two curves. Author: Douglas Schwarz	Excellent! Found the link for this on the following thread <http://www.mathworks.de/matlabcentral/newsreader/view_thread/258260#672305>; It was just what I needed :)
27 Mar 2009	Image Pixel Sorting Sorts the boundary pixels of an image after edge detection. Author: Atakan Varol	Thanks! very useful and commonly used. I added some functionality like sorting having an initial point as reference, and also retrieving an array of indices like sort.m does.
06 Mar 2009	ginput2.m v3.1 (Nov 2009) Same as GINPUT but with ZOOM, PAN and (optionally) PLOT and image SCALE/GEOREFERENCE! Author: Carlos Adrian Vargas Aguilera	This is really good! It works perfect for me, and was exactly what I needed... I just added a minor detail to plot a line from an input center point to the ginput point selected by the user (like a radial line). This was just to improve visualization for my needs. Thank you very much!

Top Tags Applied by Olga	1 - 3 of 3
georeference, ginput, zoom

Files Tagged by Olga					1 - 1 of 1
Updated		File	Tags	Downloads (last 30 days)	Comments	Rating
12 Nov 2009		ginput2.m v3.1 (Nov 2009) Same as GINPUT but with ZOOM, PAN and (optionally) PLOT and image SCALE/GEOREFERENCE! Author: Carlos Adrian Vargas Aguilera	georeference, ginput, digitize, zoom, double click, doble click	56	4	4.75 4.8 \| 4 ratings

Currently Watching
Type	Description
File	Fast and Robust Curve Intersections
File	Image Pixel Sorting
File	ginput2.m v3.1 (Nov 2009)

Files Matching Olga's Watch List					View all 1 - 3 of 3
Updated		File	Tags	Downloads (last 30 days)	Comments	Rating
27 Jan 2010		Fast and Robust Curve Intersections Computes intersection points of two curves. Author: Douglas Schwarz	interpolation, approximation, intersect intersectio...	217	68	4.83721 4.8 \| 46 ratings
12 Nov 2009		ginput2.m v3.1 (Nov 2009) Same as GINPUT but with ZOOM, PAN and (optionally) PLOT and image SCALE/GEOREFERENCE! Author: Carlos Adrian Vargas Aguilera	georeference, ginput, digitize, zoom, double click, doble click	56	4	4.75 4.8 \| 4 ratings
22 Jul 2005		Image Pixel Sorting Sorts the boundary pixels of an image after edge detection. Author: Atakan Varol	sorting, pixel, image processing	8	5	4.33333 4.3 \| 9 ratings

Comments and Ratings Matching Olga's Watch List			1-5 of 87
Date	File	Comment by	Comments	Rating
16 Jan 2012	Fast and Robust Curve Intersections Computes intersection points of two curves.	Murat Shagirov		5
18 Dec 2011	Fast and Robust Curve Intersections Computes intersection points of two curves.	Douglas Schwarz	Paul, Thank you for your comments. First of all, you should know that the definitions for I and J were specifically requested by users -- they were not included at all in early versions of the program. I have no opinion about them since I don't use them myself. Certainly, backwards compatibility is important so they are not going to change. I would encourage you to write a simple wrapper function that runs intersections and then converts its outputs into whatever you require. I hesitate to do that for you since I'm not completely sure what it is you need, but feel free to contact me via email if you need help with it. Doug	Comment only
16 Dec 2011	Fast and Robust Curve Intersections Computes intersection points of two curves.	Paul Koppen	This is an absolutely fantastic piece of code. 5* well deserved. Thank you! That said I really regret writing this but... To me the returned values for I and J feel awkward. Because X0 and Y0 return the intersection points in terms of the original space in which the curves lie (X,Y), I would expect the second set of returned values to give coordinates in terms of the curves themselves. So if a curve has (Euclidean) length 4.8, then I would expect 2.4 to be halfway the curve, not at 4 tenth of the second line segment. This way we could also compute derivatives and integrals along a curve and interpolate these values simply by looking op the value at I (or J for that matter). Furthermore, the distance along the curve is a nice linear function, whereas the currently returned values for I and J are piecewise linear and non-differentiable it the points. I understand that such a change of I and J would not be backwards compatible, and also it might be slightly (but hardly) more involved to compute, so I see the big arguments against. Nevertheless, I would be very happy if you would at least give it a thought :-)	5
17 Nov 2011	Fast and Robust Curve Intersections Computes intersection points of two curves.	David	Excellent work	5
08 Nov 2011	Fast and Robust Curve Intersections Computes intersection points of two curves.	Björn	Really good, faster and as useful as polyxpoly.	5

Contact us at files@mathworks.com