Morceau issu de: Autopsie, vol. Dans un album, quelques bangers. Un morceau qui porte bien son nom. Les rimes, elles, sont aussi pauvres que son auteur au moment des faits. Ok, il lui aura rendu de bons et loyaux services en effectuant parfois la sale besogne depuis que les deux roulent ensemble.
Pour le feat. Mon dieu quel couplet! On force. Comme Julien des Marseillais le dit si bien: Exit la patate chaude en bouche, le emcee pose les bases de sa nouvelle signature vocale. Du grand art. Deux questions: Time Bomb. Seul le fabuleux quatuor Rochefort, Marielle, Noiret et Claude Rich approche la puissance de la team infernale. Les cinq artistes sont au sommet de leur art en Aucune fioriture, pour mieux laisser la musique parler.
La voix rugueuse de B2O se cogne et se cale sur les basses puissantes du morceau. Des punchlines percutantes, une plume rigoureuse et un flow brutal. Tonton peut dire merci.
Quand le D.U.C. joue à l'extérieur : le classement définitif - YARD
Et tout le monde en prend pour son grade: On ne sait presque plus qui est en feat. After having to turn down the invitation once or twice before due to problematic dates, this year I managed to arrange a "vacation" in the relevant dates and I'll actually be going! Yesterday I finished all of the arrangements including setting up ubuntu dual-boot on my laptop, which turned out to be way easier than I thought , and I can start thinking about LGM itself.
It's going to be the first time I attend a real convention like this, and the fact that this first time is abroad and far from home does add it's share to my excitement: The program sounds very interesting and with a potential to cover many topics which I never had the chance to learn such as color management and font design.
Also meeting people whom I talked to by IRC in the last 4 years but never met in practice should be one of the greatest parts in LGM fromy my point of view. So, before I depart, it's time for some thanks.
Les tops et l'actu' du marché de la musique
The first of them is to the GIMP family - the people who always care, help and greet you with a smile after you were missing for some time. Links to this post Email This BlogThis! Recently, I was asked by email to help with the status of my GSoC ! So before I say anything about that, let me explain a few things about my current situation. Note that this was originally written as an email, so I'll sometimes write as if I'm addressing someone specific in a conversation, and sometimes I talk in general 3rd person.
Please ignore this inconsistency The proposal is located here. Papers I'm listing them here, it will become clearer once you see the modules listing. The paper behind the seamless cloning algorithm: Coordinates for Instant Image Cloning Unfortunately, due to open source licensing issues and some other reasons, I had to implement myself an algorithm for creating fine triangular meshes.
The algorithm I used and implemented! Delaunay Triangulation s are triangulations which are considered "nice", meaning that most triangles are more or less of equal size, without too big or too small angles.
Delaunay refinement is the process of taking a Constrained Delaunay Triangulation which is not exactly Delaunay due to constraints such as outline that must be respected and refining it by inserting more and more points. The process terminates when the resulting triangulation is almost Delaunay. The implementation of the algorithm above was made from scratch and in fact was the biggest part of the GSoC project the assumption was that there was an existing open source library to do this.
Apparently it wasn't so The render basically takes a mesh created from the refinement process, a buffer to fill and a vertex-to-color function, and creates an image of the mesh in the specified resolution and size. This is another implementation from zero, although quite trivial and could probably be made more efficient The original article used OpenGL to do this rendering , resulting an ultra-fast renderer. In brief, here is a description of the process needed to understand the state of the code: Do a heavy preprocessing step for creating a fine triangular mesh from the outline of the pasted area Now, for each render attempt, compute the color differences between the edges of the paste and the background image, and use the previously created mesh to interpolate the differences in the colors along the entire area of the pasted image.
Add the interpolated color differences on-top of the paste and you get a seamless pasting! GeglScContext implements smart logic to notice when a paste doesn't change between rendering sessions i. However, currently gimp uses the GEGL op which is described below in a rather dumb way This library even exposes a pkg-config file to be easily linked against later Finally, in order to have the triangulation algorithm included, a copy of poly2tri-c is included under the libs directory of GEGL.
This is since poly2tri-c has no package that can be installed and it was asked for so that developers won't need to download additional source code from more locations. This is not a desired situation, yet I'm unaware of any package owners for various Linux distributions which would be willing to help with distributing poly2tri-c as it's own package.
That's different! Non-English post.
It's about time I post this. My work is actually useable enough I even received my first bug report by email recently so it's the time to explain how to use this. Then let us begin! It works! An outline and it's refinement. Time for another update on the GSoC project: My C port of Poly2Tri part of my Google summer of code project, see my previous post s has received much work in the last weekend and things start to look pretty good. One of the problems I had was an incorrect understanding of what is an encroached edge.
As someone who don't speak English natively, in university I heard many different non-English terms to describe edges and vertices in graph, since it's not really formalized what terms should be used in my language. When I first came to read about Delaunay Refinement for generating a triangular mesh from an outline, I was sure that the following terms marked in bold are used freely without some rules meaning you can use each one of them to express the same common meaning as the others: This term is used in triangles simple because triangular meshes are indeed a form of a graph.
Sub-Segment - The result of splitting a Segment into smaller parts this happens during the refinement of the mesh produced from the outlines described by the PSLG. Basically, the source of confusion was lingual, due to conflicting terms in my native language Hebrew - there are several words used to describe these terms, and the people who use them aren't always exactly consistent in their usage. Anyway, I believe I got it more or less right now - I read all the material in English from scratch, and now I understand the differences between all the three terms above.
And a small teaser - I needed to test if I can detect which points are "visible" from a triangle to test whether an edge is encroached.
Mac Tyer Banger 3 (Album)
To do so I wrote a small and quick algorithm, and here is the demo app I wrote to test it: Some people at the GIMP irc said it's rather unwise I work on the post-gsoc work without comitting it to somewhere public. They are probably right: P Therefor you can see updates on Poly2Tri-C - I'll be updating once in a while starting from a minute ago.
During the weekend, I reached a deep understanding of how wrong my implementation was for the triangulation algorithm because of a misunderstanding of some basic terms. I'm implementing a smaller algorithm Rupert's algorithm to see if I'm right now, and then I'll update the main algorithm. Also, to my few readers: I don't always have enough time to respond to comments because I'm very busy in real life. If you feel it is important, you should be able to find my email on this site - feel free to email me for the important stuff! And for all the people who celebrate it like me!
Yes, I know it's only in 4 days, it's just that I probably won't get to this blog before the holiday. So, you may ask, why on earth is it not integrated yet? The answer is short and simple - last university semester combined with real life. But, I'm not here to bring excuses, I'm here to bring results: On Thursday I had my last university exam Computational Complexity. Unless I fail, and I hope I don't, I finished university!
In the last two weeks of university, I had more and more free time so I began working again on my GSoC project. The current things that are waiting to happen are: Fix the triangulation refinement implementation.kamishiro-hajime.info/voice/localiser-un/comment-tracer-quelquun-avec-son-portable.php
Search results for 'clinique'
For those who are not familiar with the algorithm behind the scene, the algorithm itself is based on interpolation of image differences in a triangular mesh. Therfor, it is a critical part. The algorithm currently would get stuck in an infinite loop of refining the triangulation, even though it was gauranteed to stop meaning an implementation bug.
I think I just fixed it now now as in 5 minutes ago , more on this below.