18. The computer program of claim 15 , wherein defining the first and the second boundary in the first image comprises: defining a first and a second band at opposing sides of the at least one symbol; selecting at least a first path that traverses through the first band and at least a second path that traverses through the second band; deriving a cost for the at least first path and the at least second path by summing gradient change in pixel color of a plurality of pixels along each path; and selecting the path with a lowest cost from the first band as the first boundary and the path with a lowest cost from the second band as the second boundary.
15. A non-transitory computer readable storage medium coupled to a processor, wherein the non-transitory computer readable storage medium comprises a computer program executable by the processor for implementing a method comprising: obtaining a first image comprising a plurality of pixels representing an at least one symbol and a plurality of pixels representing a background area; defining a first and a second boundary in the first image, wherein the first and the second boundaries are each a path comprising a plurality of pixels that minimizes a cost associated with change in color for the path and each of the paths are positioned on opposite sides of the at least one symbol; generating a plurality of pixels representing an at least one translated symbol of the at least one symbol; generating a plurality of pixels representing an augmented version of the background area, by interpolating a plurality of background pixel values between the first and the second boundaries; and constructing a second image comprising the plurality of pixels representing the at least one translated symbol and the plurality of pixels representing the augmented version of the background area.