Home/ Questions/Q 6972637
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-27T16:59:43+00:00

I am trying to solve a problem of compositing two images in Java. The

  • 0

I am trying to solve a problem of compositing two images in Java. The program will take a part of the first image and past it on the second image. The goal is to make the boundary between the two images less visible. The boundary must be chosen in such a way that the difference between the two images at the boundary is small.

My Tasks:

To write a method to choose the boundary between the two images. The method will receive the overlapping parts of the input images. This must first be transformed so that the boundary always starts from the left-top corner to the right-bottom corner.

Note: The returned image should not be the joined image but gives which parts of the two images were used.

The pixels of the boundary line can be marked with a constant (SEAM). Pixels of the first image can be marked with integer 0, pixels of the second image with integer 1. After choosing the boundary line, the floodfill algorithm can be used to fill the extra pixels with 0 or 1.

Note: The image can be represented as a graph whereby each pixel is connected with its left, right, top and bottom neighbor. So using the flood fill will be like depth-first search.

The “shortest path algorithm” must be used to choose the boundary in order to make it small.

Note: I cannot use any Java data structure except Arrays (not even ArrayList) or I can use my own defined data structure.

I am new in this area and am trying to solve it. What steps must I follow to solve this problem?

My main issue is, how do I represent the images as graphs in Java code (for instance with arrays or my own data structure)?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Here is what can be an answer to your “Main issue” part of the question.

    You have to represent the images pixels as graph and also you have a restriction to use Java array only. Well if you look at a 2 dimensional array which you will need to use represent the pixels of the image, it can be used as an graph as well just that each item in the array will only have data value (pixel color) and the attached node to the current node can be calculated using the below formula:

    Current pixel : [X,Y]
Top pixel : [X,Y-1] 
Bottom pixel : [X,Y+1]
Left pixel : [X-1,Y]
Right pixel : [X+1,Y]

    NOTE: X and Y are index in the 2D array. Also, when incrementing/decrementing X or Y to calculate neighbor pixel you need to make sure that you dont’t overflow/underflow the boundary of the image i.e decrementing should not cause the value of X/Y to be < 0 and increment should not cause the X to go beyond width of image and Y to go beyond height of image.

    Refer: http://docs.oracle.com/javase/tutorial/2d/images/index.html

    • 0