ruarai

4 ms·

1.
by ruarai 6y ago
This is called 'overshoot'. See here for a good explanation https://twitter.com/CT_Bergstrom/status/1252077930286444545
2.
by ruarai 7y ago
Working on genomics stuff right now and gene ontology (GO) is ubiquitous. My primary complaint with GO is that it doesn't map to any statistical analyses very well
3.
by ruarai 7y ago
This article read a little annoying. I don't know why this PhD holder failed to find the actual paper describing the algorithm: https://www.cv-foundation.org/openaccess/content_cvpr_2016/p... The author is ma
4.
Show HN: Trigrad, a tool to automatically create high quality mesh art(trigrad.ruarai.com)
4 points by ruarai 11y ago|0 comments
5.
PixelMap: Sleeker, Faster Bitmap Editing for .NET(ruarai.com)
35 points by ruarai 11y ago|4 comments
6.
PixelMap: Sleeker, Faster Bitmap Manipulation for .NET(github.com)
2 points by ruarai 11y ago|0 comments
7.
by ruarai 11y ago
This is an area that needs work, but basically there's the table of 'edge intensity' that gets multiplied by a constant baseChance variable for every pixel. baseChance = 8 * samples / (width * height) samples is the desi
8.
by ruarai 11y ago
This doesn't seem to have any benefit unfortunately. It seems like the current approach already produces the before-after edge effect.
9.
by ruarai 11y ago
Wow, that works pretty well. I was mistaken in thinking that either the Dictionary class or the process of sampling would sort them. Mind if I merge that? Or you could submit a pull request. Either would be great! Also, do you know of any r
10.
by ruarai 11y ago
Here's Lenna reconstructed after 30,000 samples. http://i.imgur.com/hlPonsO.png The compressed data comes out to 303KB, which isn't that great. It's a pretty noisy image.
11.
by ruarai 11y ago
Not sure if that applies for my purposes, since I'm not actually using linear interpolation barycentric coordinates (I don't think that's possible). The barycentric coordinates supply the gradient within themselves. I may hav
12.
by ruarai 11y ago
I tried your struct-of-array idea, and that's produced an okay improvement ~1%. Sorting them seems tough as the index of each value must match for each channel, so any sorting would have to occur beforehand. Except that is already sort
13.
by ruarai 11y ago
It's not very comparable to PNG, since they're designed for different types of imagery. I know currently Trigrad cannot handle text at all. In regards to your other comment, it's currently definitely worse than JPEG for vecto
14.
by ruarai 11y ago
Currently compressing the example image (the one of the flowers) with 100,000 samples takes 1.5 seconds + 1.5 seconds for AForge's edge detection. I'm sure this could be increased by a huge amount if I had a not-terrible CPU or if
15.
Show HN: Trigrad, a novel image compression with interesting results(ruarai.github.io)
175 points by ruarai 11y ago|67 comments
16.
A Map of Melbourne from 1966 + Current Google Maps(ruarai.me)
2 points by ruarai 12y ago|0 comments
17.
An Analysis of Sony Picture's Hacked File Lists(medium.com)
1 points by ruarai 12y ago|0 comments