Dimitrios Pappas

Dimitrios Pappas

Auto-generated profile, based on publicly available information

Dimitrios Pappas

Department of Statistics, Athens University of Economics and Business, Athens, Greece

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 August 2011 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
Vasilios N. KatsikisVasilios N. Katsikis
Vasilios N. Katsikis
DPDimitrios Pappas
Dimitrios Pappas
APAthanassios Petralias
Athanassios Petralias

1 June 2012 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
Predrag S. StanimirovicPredrag S. Stanimirovic
Predrag S. Stanimirovic
DPDimitrios Pappas
Dimitrios Pappas
Vasilios N. KatsikisVasilios N. Katsikis
Vasilios N. Katsikis
ISIvan P. Stanimirović
Ivan P. Stanimirović

1 January 2009 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
SCSpiros Chountasis
Spiros Chountasis
Vasilios N. KatsikisVasilios N. Katsikis
Vasilios N. Katsikis
DPDimitrios Pappas
Dimitrios Pappas
This paper presents a fast computational method that finds application in a broad scientific field such as digital image restoration. The proposed method provides a new approach to the problem of image reconstruction by using the Moore‐Penrose inverse. The resolution of the reconstructed image remains at a very high level but the main advantage of the method was found on the computational load that has been decreased considerably compared to the classic techniques.

1 October 2008 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
DDDimosthenis Drivaliaris
Dimosthenis Drivaliaris
SKSotirios Karanasios
Sotirios Karanasios
DPDimitrios Pappas
Dimitrios Pappas

1 January 2010 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
SCSpiros Chountasis
Spiros Chountasis
Vasilios N. KatsikisVasilios N. Katsikis
Vasilios N. Katsikis
DPDimitrios Pappas
Dimitrios Pappas
The field of image restoration has seen a tremendous growth in interest over the last two decades. The recovery of an original image from degraded observations is a crucial method and finds application in several scientific areas including medical imaging and diagnosis, military surveillance, satellite and astronomical imaging, and remote sensing. The proposed approach presented in this work employs Fourier coefficients for moment‐based image analysis. The main contributions of the presented technique, are that the image is first analyzed in orthogonal basis matrix formulation increasing the selectivity on image components, and then transmitted in the spectral domain. After the transmission has taken place, at the receiving end the image is transformed back and reconstructed from a set of its geometrical moments. The calculation of the Moore‐Penrose inverse ofr×mmatrices provides the computation framework of the method. The method has been tested by reconstructing an image represented by anr×mmatrix after the removal of blur caused by uniform linear motions. The noise during the transmission process is another issue that is considered in the current work.

1 January 2008 in The Electronic Journal of Linear Algebra
Verified
Journal Article
Closed access
PDF file
Vasilios N. KatsikisVasilios N. Katsikis
Vasilios N. Katsikis
DPDimitrios Pappas
Dimitrios Pappas
In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m ×n matrices and of square matrices with at least one zero row or column. Sufficient conditions are also given for special type products of square matrices so that the reverse order law for the Moore-Penrose inverse is satisfied. is defined. In the case when T is a real m × n matrix, Penrose showed that there is a unique matrix satisfying the four Penrose equations, called the generalized inverse of T. A lot of work concerning generalized inverses has been carried out, in finite and infinite dimension (e.g., (2, 11)). In this article, we provide a method for the fast computation of the generalized inverse of full rank matrices and of square matrices with at least one zero row or column. In order to reach our goal, we use a special type of tensor product of two vectors, that is usually used in infinite dimensional Hilbert spaces. Using this type of tensor product, we also give sufficient conditions for products of square matrices so that the reverse order law for the Moore-Penrose inverse ((1, 4, 5)) is satisfied. There are several methods for computing the Moore-Penrose inverse matrix (cf. (2)). One of the most commonly used methods is the Singular Value Decomposition (SVD) method. This method is very accurate but also time-intensive since it requires a large amount of computational resources, especially in the case of large matrices. In the recent work of P. Courrieu (3), an algorithm for fast computation of Moore- Penrose inverse matrices is presented based on a known reverse order law (eq. 3.2