• 沒有找到結果。

[PDF] Top 20 A Refined Fast 2-D Discrete Cosine Transform Algorithm

Has 10000 "A Refined Fast 2-D Discrete Cosine Transform Algorithm" found on our website. Below are the top 20 most common "A Refined Fast 2-D Discrete Cosine Transform Algorithm".

A Refined Fast 2-D Discrete Cosine Transform Algorithm

A Refined Fast 2-D Discrete Cosine Transform Algorithm

... based 2-D DCT algorithm has been pre- sented in this ...proposed algorithm makes it easier to describe the process of how to map one 2-D DCT into a number of 1-D ... See full document

4

A refined fast 2-D discrete cosine transform algorithm with regularbutterfly structure

A refined fast 2-D discrete cosine transform algorithm with regularbutterfly structure

... In this paper, a fast computation algorithm for the two-dimensional discrete cosine transform (2-D DCT) is derived based on index permutation.. Furthermore, as compared[r] ... See full document

8

Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format

Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format

... Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format Kuo-Liang Chung a, ∗ , Wen-Ming Yan b,1 a Department of Information ... See full document

9

Two-variable modularized fast polynomial transform algorithm for2-D discrete Fourier transforms

Two-variable modularized fast polynomial transform algorithm for2-D discrete Fourier transforms

... The modularity, regularity, and easy extensi- bility of the proposed algorithm make it of great practical value in computing multidimensional discrete Fourier transforms [r] ... See full document

4

Recursive fast computation of the two-dimensional discrete cosine transform

Recursive fast computation of the two-dimensional discrete cosine transform

... Employing fast algorithms for the computation of these CCiSCC oper- ations, we can thus substantially reduce the numbers of multiplications required, compared with those of [r] ... See full document

9

Two-stage circular-convolution-algorithm/architecture for the discrete cosine transform

Two-stage circular-convolution-algorithm/architecture for the discrete cosine transform

... The elements in the pre- processing stage consist of 1, - 1, and 0 only; the postprocessing stage is of block diagonal form in which each block performs a circular-convolut[r] ... See full document

8

A generalized output pruning algorithm for matrix-vector multiplication and its application to compute pruning discrete cosine transform

A generalized output pruning algorithm for matrix-vector multiplication and its application to compute pruning discrete cosine transform

... CLxN , we omit the details also due to page limit. On the other hand, more effective decomposition of the matrix ANxN is necessary if we want to obtain better simplificati[r] ... See full document

10

A generalized output pruning algorithm for matrix-vector multiplication and its application to compute pruning discrete cosine transform

A generalized output pruning algorithm for matrix-vector multiplication and its application to compute pruning discrete cosine transform

... Let A N2N (= 5 k01 i=0 C N2N i ) be a linearly independent ...pruning algorithm. From Lemma 1, for a linearly independent matrix A N2N , we know that the ... See full document

3

Normal Bases Expansion of the Discrete Cosine Transform

Normal Bases Expansion of the Discrete Cosine Transform

... the discrete cosine transform (DCT) can be obtained by projecting the discrete Fourier trans- form from the extension field to the ...operator, a fast fully recursive ... See full document

3

Progressive Pattern Matching Approach Using Discrete Cosine Transform

Progressive Pattern Matching Approach Using Discrete Cosine Transform

... The underlying philosophy of the progressive matching algorithm is the concept of multi-resolution. Adding more DCT coefficients usually imply increasing the resolution level of an image. If current resolution is ... See full document

5

Directional textures auto-inspection using discrete cosine transform

Directional textures auto-inspection using discrete cosine transform

... preserved. A defect-free directional texture surface image resulted in a clear response in our experiments; otherwise, distinct defects were clearly identified by rough shapes in precise ...is a ... See full document

18

Discrete Cosine Transform Image Compression Using Modified Set Partitioning in Hierarchical Trees

Discrete Cosine Transform Image Compression Using Modified Set Partitioning in Hierarchical Trees

... The SPIHT is a famous wavelet-based image coding, so describe this algorithm as follows. The flowchart of SPIHT is presented in Figure 1. First step, the original image is decomposed into ten subbands. ... See full document

8

Reconfigurable discrete cosine transform processor for object-based video signal processing

Reconfigurable discrete cosine transform processor for object-based video signal processing

... paper, a novel reconfigurable discrete cosine trans- form processor is proposed to perform the Shape-Adaptive DCT (SA-DCT) algorithm, which is a dominating compu- tational kernel of ... See full document

4

High throughput CORDIC-based systolic array design for the discrete cosine transform

High throughput CORDIC-based systolic array design for the discrete cosine transform

... In this paper, we propose a modified Malvar algorithm that can transfer the Discrete Hartley Transform (DHT) results to the Discrete Cosine Transform ( DCT) by using [r] ... See full document

4

Public-key image steganography using discrete cosine transform and quadtree partition vector quantization coding

Public-key image steganography using discrete cosine transform and quadtree partition vector quantization coding

... Embedding Algorithm A steganography scheme must be extremely secure to all kinds of attacks, and at the same time not reduce the visual quality of the cover image when the secret image is con- ...Fig. ... See full document

7

Architecture design of shape-adaptive discrete cosine transform and its inverse for MPEG-4 video coding

Architecture design of shape-adaptive discrete cosine transform and its inverse for MPEG-4 video coding

... by Transform Matrices’ Numerical Properties The numerical properties exploited in this work are different from the traditional ...many fast algorithms designed for the 1-D DCT or IDCT ...for a ... See full document

12

Improved Accuracy Factors for the Nonuniform Fast Fourier Transform (NUFFT) Algorithm

Improved Accuracy Factors for the Nonuniform Fast Fourier Transform (NUFFT) Algorithm

... IV. C ONCLUSION New accuracy factors (cosine function to the th power) are proposed for incorporation into the NUFFT technique to im- prove the accuracy of the transformed data. The current density of a ... See full document

3

Fast Fourier Transform with Applications to
Pricing Discrete European Barrier Options
under Binomial and Trinomial Models

Fast Fourier Transform with Applications to Pricing Discrete European Barrier Options under Binomial and Trinomial Models

... gives a linear time solution for such ...price discrete barrier options is to traverse the whole tree, which takes quadratic ...subquadratic-time algorithm for the problem. The method relies on the ... See full document

25

A NEW ARRAY ARCHITECTURE FOR PRIME-LENGTH DISCRETE COSINE TRANSFORM

A NEW ARRAY ARCHITECTURE FOR PRIME-LENGTH DISCRETE COSINE TRANSFORM

... The design approach utilizes the input and output data permutations accom- panied with the symmetry property of the cosine kernels such that the proposed array can reta[r] ... See full document

7

A programmable VLSI architecture for 2-D discrete wavelet transform

A programmable VLSI architecture for 2-D discrete wavelet transform

... In this paper, we present a parallel-processing VLSI architecture to compute the programmable 2-D DWT, including various wavelet filter lengths and various wavelet transfo[r] ... See full document

4

Show all 10000 documents...