@incollection{eprints2740,
           month = {September},
           title = {Computationally efficient data and application driven color transforms for the compression and enhancement of images and video},
            year = {2015},
       booktitle = {Color Image and Video Enhancement},
       publisher = {Springer},
           pages = {371--393},
          author = {Massimo Minervini and Cristian Rusu and Sotirios A. Tsaftaris},
        keywords = {Color space transformation, unsupervised and supervised learning, Karhunen-Lo{\`e}ve transform, Foley-Sammon transform, image coding, application-aware compression, JPEG 2000, low computational complexity},
        abstract = {An important step in color image or video coding and enhancement is the linear transformation of input (typically RGB) data into a color space more suitable for compression, subsequent analysis, or visualization. The choice of this transform becomes even more critical when operating in distributed and low-computational power environments, such as visual sensor networks or remote sensing. Data-driven transforms are rarely used due to increased complexity. Most schemes adopt fixed transforms to decorrelate the color channels which are then processed independently. Here we propose two frameworks to find appropriate data-driven transforms in different settings. The first, named approximate Karhunen-Lo{\`e}ve Transform (aKLT), performs comparable to the KLT at a fraction of the computational complexity, thus favoring adoption on sensors and resource-constrained devices. Furthermore, we consider an application-aware setting in which an expert system (e.g., a classifier) analyzes imaging data at the receiver's end. In a compression context, distortion may jeopardize the accuracy of the analysis. Since the KLT is not optimal in this setting, we investigate formulations that maximize post-compression expert system performance. Relaxing decorrelation and energy compactness constraints, a second transform can be obtained offline with supervised learning methods. Finally, we propose transforms that accommodate both constraints, and are found using regularized optimization.},
             url = {http://eprints.imtlucca.it/2740/}
}