Photios Stavrou

Dr. Photios Stavrou


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 May 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
PSPhotios Stavrou
Photios Stavrou
MKMarios Kountouris
Marios Kountouris
We study a variant of a robust description source coding framework, which is a relevant model for goal-oriented semantic information transmission, via its corresponding characterization. Considering two individual single-letter separable distortion constraints and input and output data acting as the intrinsic and extrinsic message, respectively, we first derive a lower bound on the optimal rates of the problem, as well as necessary and sufficient conditions for this bound to be tight. Subsequently, we prove a general result that provides in parametric form the optimal solution of the characterization of this problem. Capitalizing on these results, we examine the structure of the solution for one case study of general binary alphabets under Hamming distortions and solve in closed form a special case. We also solve another general binary alphabet case where a Hamming and an erasure distortion coexist, as a means to highlight the importance of selecting the type of the distortion constraint in goal-oriented semantic communication. Furthermore, we develop a goal-oriented Blahut-Arimoto (BA) algorithm, which can be used for the computation of any finite alphabet intrinsic or extrinsic message under individual distortion criteria. Finally, we revisit the problem for multidimensional independent and identically distributed (i.i.d.) jointly Gaussian processes with individual mean-square error (MSE) distortion constraints, providing new insights that have previously been overlooked. This work reveals the cardinal role of context-dependent fidelity criteria in goal-oriented semantic communication.

11 July 2018 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
PSPhotios Stavrou
Photios Stavrou
JØJan Østergaard
Jan Østergaard
charalambos D. charalambouscharalambos D. charalambous
charalambos D. charalambous
We deal with zero-delay source coding of a vector-valued Gauss-Markov source subject to a mean-squared error (MSE) fidelity criterion \FS{characterized by the operational zero-delay vector-valued Gaussian rate distortion function (RDF). We address this problem by considering the nonanticipative RDF (NRDF) which is a lower bound to the causal and zero-delay RDF. We recall the realization that corresponds to the optimal “test-channel“ of the Gaussian NRDF, when considering a vector Gauss-Markov source subject to a MSE distortion in the finite time horizon. Then, we introduce sufficient conditions to show existence of solution for this problem in the infinite time horizon (or asymptotic regime). For the asymptotic regime, we use the asymptotic characterization of the Gaussian NRDF to provide a new equivalent realization scheme with feedback which is characterized by a resource allocation (reverse-waterfilling) problem across the dimension of the vector source. We leverage the new realization to derive a predictive coding scheme via lattice quantization with subtractive dither and joint memoryless entropy coding. This coding scheme offers an upper bound to the zero-delay vector-valued Gaussian RDF. When we use scalar quantization, then for r active dimensions of the vector Gauss-Markov source the gap between the obtained lower and upper bounds is less that or equal to 0.254r + 1 bits/sample. However, we further show that it is possible when we use vector quantization, and assume infinite dimensional Gauss-Markov sources to make the previous gap to be negligible, i.e., Gaussian NRDF approximates the zero-delay Gaussian RDF. We also extend our results to vector-valued Gauss-Markov sources of any order under mild conditions}. Our theoretical framework is demonstrated with illustrative numerical experiments.

1 January 2018 in SIAM Journal on Control and Optimization
Verified
Journal Article
Open access
PSPhotios Stavrou
Photios Stavrou
Themistoklis CharalambousThemistoklis Charalambous
Themistoklis Charalambous
CCCharalambos D. Charalambous
Charalambos D. Charalambous
SLSergey Loyka
Sergey Loyka
In this paper, we develop finite-time horizon causal filters for general processes taking values in Polish spaces using the nonanticipative rate distortion function ($NRDF$). Subsequently, we apply the $NRDF$ to design optimal filters for time-varying vector-valued Gauss--Markov processes, subject to a mean-squared error ($MSE$) distortion. Unlike the classical Kalman filter design, the developed filters based on the $NRDF$ are characterized parametrically by a dynamic reverse-waterfilling optimization problem obtained via Karush--Kuhn--Tucker conditions. We develop algorithms that provide, in general, tight upper bounds to the optimal solution to the dynamic reverse-waterfilling optimization problem subject to a total and per-letter $MSE$ distortion constraint. Under certain conditions, these algorithms produce the optimal solutions. Further, we establish a universal lower bound on the total and per-letter $MSE$ of any estimator of a Gaussian random process. Our theoretical framework is demonstrated via ...

31 August 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
charalambos D. charalambouscharalambos D. charalambous
charalambos D. charalambous
PSPhotios Stavrou
Photios Stavrou
Directed information or its variants are utilized extensively in the characterization of the capacity of channels with memory and feedback, nonanticipative lossy data compression, and their generalizations to networks. In this paper, we derive several functional and topological properties of directed information, defined on general abstract alphabets (complete separable metric spaces), using the topology of weak convergence of probability measures. These include the convexity of the set of consistent distributions, which uniquely define causally conditioned distributions, convexity, and concavity of directed information with respect to the sets of consistent distributions, weak compactness of such sets of distributions, their joint distributions, and their marginals. Furthermore, we show lower semicontinuity of directed information, and under certain conditions, we also establish continuity. Finally, we derive variational equalities for directed information, including sequential versions. These may be viewed as the analog of the variational equalities of mutual information (utilized in Blahut-Arimoto algorithms). In summary, we extend the basic functional and topological properties of mutual information to directed information. These properties are discussed throughout this paper, in the context of extremum problems of directed information.

29 March 2024 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
GSGiuseppe Serra
Giuseppe Serra
PSPhotios Stavrou
Photios Stavrou
MKMarios Kountouris
Marios Kountouris
In this paper, we study the computation of the rate-distortion-perception function (RDPF) for a multivariate Gaussian source assuming jointly Gaussian reconstruction under mean squared error (MSE) distortion and, respectively, Kullback–Leibler divergence, geometric Jensen-Shannon divergence, squared Hellinger distance, and squared Wasserstein-2 distance perception metrics. To this end, we first characterize the analytical bounds of the scalar Gaussian RDPF for the aforementioned divergence functions, also providing the RDPF-achieving forward “test-channel” realization. Focusing on the multivariate case, assuming jointly Gaussian reconstruction and tensorizable distortion and perception metrics, we establish that the optimal solution resides on the vector space spanned by the eigenvector of the source covariance matrix. Consequently, the multivariate optimization problem can be expressed as a function of the scalar Gaussian RDPFs of the source marginals, constrained by global distortion and perception levels. Leveraging this characterization, we design an alternating minimization scheme based on the block nonlinear Gauss–Seidel method, which optimally solves the problem while identifying the Gaussian RDPF-achieving realization. Furthermore, the associated algorithmic embodiment is provided, as well as the convergence and the rate of convergence characterization. Lastly, for the “perfect realism” regime, the analytical solution for the multivariate Gaussian RDPF is obtained. We corroborate our results with numerical simulations and draw connections to existing results.

28 November 2017 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
PSPhotios Stavrou
Photios Stavrou
Themistoklis CharalambousThemistoklis Charalambous
Themistoklis Charalambous
charalambos D. charalambouscharalambos D. charalambous
charalambos D. charalambous
We derive the finite-time horizon nonanticipative rate distortion function (NRDF) of time-varying scalar Gauss–Markov sources under an average mean squared-error (MSE) distortion fidelity. Further, we show that a conditionally Gaussian reproduction process realizes the optimal reproduction distribution, and this is determined from the solution of a dynamic reverse-waterfilling optimization problem. We provide an iterative algorithm that approximates the solution of the dynamic reverse-waterfilling problem. From the above results, we also obtain, as a special case, the NRDF under a per-letter or pointwise MSE distortion fidelity, and we draw connections to the classical RDF of Gaussian processes. Our results are corroborated with illustrative examples.