Graph coloring, or vertex coloring, is a very useful problem in the sense that most practical problems can be reduced to this problem. For example, frequency assignment to mobile stations, allocation of registers of a processing unit, making time tables, solving sudoku puzzles etc. Continue reading Solving Simple Sudoku via Graph Coloring
Recently, I’m stuck with a computer with no output other than the monitor and audio. I needed to get some files from it and using sound waves for file transfer was the only solution. Continue reading Transferring Files Over Sound
Photo cartoonizing is used in a broad range of applications and i’ve always wondered how it’s done. So, i’ve decided to make an application.
I’ve used three methods respectively: image segmentation, median filtering and edge detection. Segmentation reduces details that are not common in cartoon images, median filtering blurs the image and softens sharp edges and edge detection thickens edges. Continue reading Cartoonizing Photos