LF-TSP: Traveling salesman problem for HEVC-based light-field coding

[Paper] HEVC-based Light-field Coding using Basis Images and Frame Reordering

“…This is equivalent to the traveling salesman problem, in which the problem is to determine the shortest route for visiting all cities (in our case, frames). Following our previous work [18], we use…”

“…and the G+2 method of Imaeda et al [18] to obtain the best possible order. Mapping Φ F→F is performed by the HEVC codec, which is regarded as being sufficiently optimized.…”

“…by Imaeda et al [18], resulting in a content-dependent frame order. The parameters for the final transformation are transmitted to the receiver along with the HEVC-encoded bit-stream.…”

“…Various frame orders in addition to the straightforward raster order have been tested [12][13][14]. Furthermore, to enhance performance, adaption of the frame order to the specific LF rather than using a fixed order for all LFs has been proposed [17,18]. The second point is the limited ability of video codecs to handle redundancy among multiple images.…”

“…The parameters for the final transformation are transmitted to the receiver along with the HEVC-encoded bit-stream. The experimental results show that this method achieves better rate-distortion performance than other HEVC-based LF coding methods [12][13][14]18]. Reflecting the recent explosive prevalence of deep neural networks, learning-based video coding methods [19][20][21][22] have attracted much interest.…”