Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

Photo Mosaic Algorithm. How to create a mosaic photo given the basic image and a list of tiles?

Hy.What I have to do is to create a program (using C or C++), that takes as input a 24bits/pixel bitmap and a gathering of images and I have to create a mosaic image , similar to the input image using the library of images given(To create a mosaic Photo similar to the input).

So far I can access the input's image pixels and the colors from it but I'm kind of stuck. My question is Where should I start? I need a basic algorithm that could do such a thing. And I can't really find any(maybe I'm looking wrong). And also can someone tell me a random photo downloader, so that i can download small images for the project? Can someone help me? Please, tell me where to start and what to use.

like image 202
Alexx Avatar asked Mar 29 '11 20:03

Alexx


3 Answers

I've done this in Scala. The Dr Dobbs article was extremely useful to me.

Sample image:

Sample photomosaic

Here's my basic algorithm:

def createMosaic(targetImage:BufferedImage,
  index:PhotoIndexer.PhotoIndex,
  opacity:Float,
  targetWidth:Int,
  targetHeight:Int,
  numRows:Int,
  numColumns:Int, callback:PhotoMosaicCallback): ImageGrid = {

      var indexCopy = index

      // Map from the buffered image to that image's average color
      var colorMap:Map[BufferedImage,Color] =
      index.values.map(data => (data.thumbnail, data.avgColor)).toMap

      // We look at rectangular regions of the target image, calculate their average
      // colors, and then pick images that match those colors.
      val sampleWidth = targetImage.getWidth / numColumns
      val sampleHeight = targetImage.getHeight / numRows

      // Used to report the progress of the process
      var counter = 1
      val numSubImages = numRows * numColumns

      val imageGrid:ImageGrid = Array.fill(numRows, numColumns)(Nil)

      // for each patch in the image
      for (row <- 0 until numRows) {
        for (column <- 0 until numColumns) {
          val x = column * sampleWidth
          val y = row * sampleHeight
          // This is the small rectangular region of the target image that we're
          // currently considering
          val subImage = targetImage.getData(new Rectangle(x,y,sampleWidth,sampleHeight))
          val avgImageColor = calculateColorFromRaster(subImage)

          val nearest:Seq[BufferedImage] = getNearestColorImages(avgImageColor, colorMap)

          // nearest is in sorted order; pick one of them and draw it to correct place in
          // image
          imageGrid(row)(column) = nearest

          callback.photosCalculated(row, column, nearest)

          val percent = 100.0 * counter / numSubImages
          // TODO: for GUI version, use a display bar
          if (counter % 100 == 0) {
            println(percent + " completed (" + counter + " of" + numSubImages + ")")
          }
          counter+=1
        }
      }
      imageGrid
}

My full sourcecode is available on github

like image 148
I82Much Avatar answered Nov 04 '22 17:11

I82Much


Let's say your basic image is 100x100 pixels, and you have a bunch of 10x10 tiles.

You want to mosaic the basic image with 400 of the little tiles, so each tile comprises 5x5 pixels in the basic image.

For each 5x5 part in the basic image, determine the average RGB values for those pixels.

For each tile, determine the average RGB values.

Match up the average RGB values of each 5x5 part to the closest match from the tiles.

Then create your mosaic. You'll need to scale the tiles down to 5x5 to keep the image size the same, though.

like image 24
John Avatar answered Nov 04 '22 15:11

John


  1. Decrease the resolution of the input image
  2. For every image in the list compute the average value of every channel (3 numbers - RGB)
  3. For every pixel in the input image with values (r,g,b) do the following: Randomly sample 30 (just a number that works well) images from the list. For every such random image in the sample, compute the distance (*) between the rgb values and choose the image with smallest distance.

(*) The distance between (r1,g1,b1) and (r2,g2,b2) can be for example: (r1-r2)**2+(g1-g2)**2+(b1-b2)**2.

That's it. It works pretty well. There are two hyperparameters for the algorithm.

  • The new resolution of the input image
  • The number of images we sample for every pixel in the input image. You can play with both of them.
like image 40
Moran Nechushtan Avatar answered Nov 04 '22 16:11

Moran Nechushtan