[Tracing] First steps/progress and some images
Hello ppl,
I just finished the task for week 2 from my proposed timelinehttp://www.google-melange.com/gsoc/project/google/gsoc2013/vinipsmaker/48002. This task was related to create a graph from an input image. This graph will be used by later steps in the Kopf/Lischinski algorithm.
I'm attaching a zip file containing 4 input images and a set of output images representing the intermediate steps of the graph generation. There is a README.txt file inside this zip with further information.
The next step of the algorithm is to improve this graph further more with three heuristics. I'll try to implement this step during the next two weeks.
If you have any question, just ask and I'll be happy to answer your question.
Impresionant work, but it make some unhappy. love the pixels circular, rouded, with some margin to make crayzy effect y love... but the work is the work.
El vie, 07-06-2013 a las 20:45 -0300, Vinícius dos Santos Oliveira escribió:
Hello ppl,
I just finished the task for week 2 from my proposed timeline. This task was related to create a graph from an input image. This graph will be used by later steps in the Kopf/Lischinski algorithm.
I'm attaching a zip file containing 4 input images and a set of output images representing the intermediate steps of the graph generation. There is a README.txt file inside this zip with further information.
The next step of the algorithm is to improve this graph further more with three heuristics. I'll try to implement this step during the next two weeks.
If you have any question, just ask and I'll be happy to answer your question.
-- Vinícius dos Santos Oliveira https://about.me/vinipsmaker
How ServiceNow helps IT people transform IT departments:
- A cloud service to automate IT design, transition and operations
- Dashboards that offer high-level views of enterprise services
- A single system of record for all IT processes
http://p.sf.net/sfu/servicenow-d2d-j _______________________________________________ Inkscape-devel mailing list Inkscape-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/inkscape-devel
2013/6/10 Jabiertxo Arraiza Cenoz <jabier.arraiza@...2893...>
Impresionant work, but it make some unhappy. love the pixels circular, rouded, with some margin to make crayzy effect y love... but the work is the work.
The samples are the output of one debug-function I made.
One of the purposes is to easily track the project (even if you don't look the project source code). Nothing special with the pixels circular. In fact, this function shouldn't be available in the final version.
2013/6/7 Vinícius dos Santos Oliveira <vini.ipsmaker@...400...>
The next step of the algorithm is to improve this graph further more with three heuristics. I'll try to implement this step during the next two weeks.
I implemented this step and graph is fully optimized, but I found a strange behaviour in paper's algorithm.
I'm attaching 2 files this time.
heuristics_evolution.zip has some sample images generated from newer code and its only purpose is to show progress (even if you don't look the source code).
pape error.zip has details about the strange behaviour I found in the paper's algorithm. Maybe some images from the supplementary material were tunned. Maybe they pressed the wrong keys when they were writing the paper. Maybe they changed one of the algorithms and forget to update the paper. Maybe I'm the one wrong here.
It's not possible to replicate their results with this error, but I'll let users of libdepixelize to provide values to tune the algorithm and get the same results. I think the "tunned" value is the one from "sparse pixels" heuristic, but I need to analyze all sample images to be sure and I'll only do it after I implement the full algorithm (this would make analyze easier).
Next step is to implement a voronoi diagram (I may blog about this).
One extra note: This algorithm uses the same procedure to detect dissimlar colors from hqx filter and this algorithm don't support alpha channel, but several hqx libraries have alpha channel support. I intend to implement alpha channel support in libdepixelize, but I need to reasearch how to do it and I want to obey my timeline, then this *extra* feature will be done *after* my timeline.
But in the tests.svg of papererror.zip there is 1 less row no?
El vie, 14-06-2013 a las 23:56 -0300, Vinícius dos Santos Oliveira escribió:
2013/6/7 Vinícius dos Santos Oliveira <vini.ipsmaker@...400...> The next step of the algorithm is to improve this graph further more with three heuristics. I'll try to implement this step during the next two weeks.
I implemented this step and graph is fully optimized, but I found a strange behaviour in paper's algorithm.
I'm attaching 2 files this time.
heuristics_evolution.zip has some sample images generated from newer code and its only purpose is to show progress (even if you don't look the source code).
pape error.zip has details about the strange behaviour I found in the paper's algorithm. Maybe some images from the supplementary material were tunned. Maybe they pressed the wrong keys when they were writing the paper. Maybe they changed one of the algorithms and forget to update the paper. Maybe I'm the one wrong here.
It's not possible to replicate their results with this error, but I'll let users of libdepixelize to provide values to tune the algorithm and get the same results. I think the "tunned" value is the one from "sparse pixels" heuristic, but I need to analyze all sample images to be sure and I'll only do it after I implement the full algorithm (this would make analyze easier).
Next step is to implement a voronoi diagram (I may blog about this).
One extra note: This algorithm uses the same procedure to detect dissimlar colors from hqx filter and this algorithm don't support alpha channel, but several hqx libraries have alpha channel support. I intend to implement alpha channel support in libdepixelize, but I need to reasearch how to do it and I want to obey my timeline, then this *extra* feature will be done *after* my timeline.
-- Vinícius dos Santos Oliveira https://about.me/vinipsmaker
This SF.net email is sponsored by Windows:
Build for Windows Store.
http://p.sf.net/sfu/windows-dev2dev _______________________________________________ Inkscape-devel mailing list Inkscape-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/inkscape-devel
2013/6/15 Jabiertxo Arraiza Cenoz <jabier.arraiza@...2893...>
But in the tests.svg of papererror.zip there is 1 less row no?
8 rows by 8 columns. It's the window size used by "sparse pixels" heuristic.
2013/6/15 Mark Schafer <mschafer@...2596...>
Far be it for me to suggest modifying their algorithm... But...
- If you used variable sized centred windows (4,6,8,10) and calculated
the weight for each window. There will be a window size where the weight flips. This might suggest an improvement to the heursistic where the state is constant for two scales in a row.
- Another approach might be to perturb the center point of the window by 1
position in all 8 directions and take the majority weight in the 8x8 case. I did not calculate this - just a hunch. But I think the first may work better...
Each heuristic favors one feature of the original graphic. I can change the library API to allow users to "tune" the "strenth" of each heuristic. The default values would be the ones from the paper.
I think this may everyone win. What do you guys say?
participants (3)
-
Jabiertxo Arraiza Cenoz -
Mark Schafer -
Vinícius dos Santos Oliveira