Results 31 to 40 of about 29,522 (302)
Directional Analytic Discrete Cosine Frames
IEEE Access, 2022 Block frames called directional analytic discrete cosine frames (DADCFs) are proposed for sparse image representation. In contrast to conventional overlapped frames, the proposed DADCFs require a reduced amount of 1) computational complexity, 2) memory ...
Seisuke Kyochi +2 more
doaj +1 more source
Steerable Discrete Cosine Transform [PDF]
IEEE Transactions on Image Processing, 2017 In image compression, classical block-based separable transforms tend to be inefficient when image blocks contain arbitrarily shaped discontinuities. For this reason, transforms incorporating directional information are an appealing alternative. In this paper, we propose a new approach to this problem, namely a discrete cosine transform (DCT) that can ...
FRACASTORO, GIULIA +2 more
openaire +4 more sources
IEEE Access, 2022 Some conventional transforms such as Discrete Walsh-Hadamard Transform (DWHT) and Discrete Cosine Transform (DCT) have been widely used as feature extractors in image processing but rarely applied in neural networks.
Joonhyun Jeong +3 more
doaj +1 more source
Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms
EURASIP Journal on Advances in Signal Processing, 2007 This paper presents a method to improve the calculation of functions which specially demand a great amount of computing resources. The method is based on the choice of a weighted primitive which enables the calculation of function values under the scope ...
Gregorio de Miguel Casado +3 more
doaj +2 more sources
On the Fractional Derivative Duality in Some Transforms
Mathematics, 2023 Duality is one of the most interesting properties of the Laplace and Fourier transforms associated with the integer-order derivative. Here, we will generalize it for fractional derivatives and extend the results to the Mellin, Z and discrete-time Fourier
Manuel Duarte Ortigueira +1 more
doaj +1 more source
Transformations With Discrete Spectrum are Stacking Transformations [PDF]
Canadian Journal of Mathematics, 1976 The stacking method (see [1] and [5, Section 6]) has been used with great success in ergodic theory to construct a wide variety of examples of ergodic transformations (see, for example, [1 ; 3 ; 4; 5; 7]). However very little is known in general about the class of transformations which can be constructed by the stacking method using single stacks.
openaire +2 more sources
A New Measure to Characterize the Self-Similarity of Binary Time Series and its Application
IEEE Access, 2021 In this study, the branch-length similarity entropy profile is estimated by mapping the time-series signal to the circumference of the time circle, and the self-similarity is defined based on the profile.
Sang-Hee Lee, Cheol-Min Park
doaj +1 more source
IEEE Access, 2022 A binary time series can be transformed into a Branch Length Similarity (BLS) entropy profile by being mapped to a circumference called a time-circle. In this study, we explored how peaks and cliffs are formed and how they relate to time series.
Sang-Hee Lee, Cheol-Min Park
doaj +1 more source
Non-parametric linear time-invariant system identification by discrete wavelet transforms
, 2006 We describe the use of the discrete wavelet transform (DWT) for non-parametric linear time-invariant system identification. Identification is achieved by using a test excitation to the system under test (SUT) that also acts as the analyzing function for ...
Luk, RWP +3 more
core +1 more source
Discrete Lorentz covariance for quantum walks and quantum cellular automata
New Journal of Physics, 2014 We formalize a notion of discrete Lorentz transforms for quantum walks (QW) and quantum cellular automata (QCA), in $(1+1)$ -dimensional discrete spacetime.
Pablo Arrighi +2 more
doaj +1 more source