• No results found

[PDF] Top 20 An Efficient DCT Compression Technique using Strassen’s Matrix Multiplication Algorithm

Has 10000 "An Efficient DCT Compression Technique using Strassen’s Matrix Multiplication Algorithm" found on our website. Below are the top 20 most common "An Efficient DCT Compression Technique using Strassen’s Matrix Multiplication Algorithm".

An Efficient DCT Compression Technique using Strassen’s Matrix Multiplication Algorithm

An Efficient DCT Compression Technique using Strassen’s Matrix Multiplication Algorithm

... The JPEG process is one of them that widely used, form of lossy image compression that based on the Discrete Cosine Transform DCT that work as separating images into parts of differing f[r] ... See full document

6

SELECTIVE CONSISTENCY MODEL ON MONGODB BIG DATA STORE

SELECTIVE CONSISTENCY MODEL ON MONGODB BIG DATA STORE

... 10X10 matrix, 2*n to store the multiplier and multiplicand and a 2*n array to hold the ...a Technique taught to children to improve their mental multiplication, where children can enjoy multiplying ... See full document

11

Designing and Implementation of Efficient Fuzzy
          Logic Based Fractal Image Compression Technique
          in DCT Domain Using Quadtree Algorithm

Designing and Implementation of Efficient Fuzzy Logic Based Fractal Image Compression Technique in DCT Domain Using Quadtree Algorithm

... proposed technique one domain block is considered for each range block and searched only for matched contrast ...Quadtree algorithm can be here applied and the size of range block can be reduce as small as ... See full document

6

Analysis of Image Compression Algorithm using DCT

Analysis of Image Compression Algorithm using DCT

... an efficient way, so as to be put to practical ...when using general purpose compression programs to compress ...image compression. Image compression have many applications and plays an ... See full document

7

A Novel Lossy Compression using 8x8 DCT Coefficient Matrix

A Novel Lossy Compression using 8x8 DCT Coefficient Matrix

... In the array each number represents an intensity value at a particular location in the image and is called as a picture element or pixel. Pixel values are usually positive integers and can range between 0 to 255. This ... See full document

6

Efficient Fast Multiplication Free Integer Transformation for the 1 D DCT of the H 265 Standard

Efficient Fast Multiplication Free Integer Transformation for the 1 D DCT of the H 265 Standard

... Proposed Algorithm 1 over Proposed Algorithm 2 and even the Original algorithm as it was able to achieve the smallest values for the MSE index over 4 different test ...ginnal algorithm and ... See full document

12

Applied Minimized Matrix Size Algorithm on the Transformed Images by DCT and DWT used for Image Compression

Applied Minimized Matrix Size Algorithm on the Transformed Images by DCT and DWT used for Image Compression

... b) Converts the Header -Information-Matrix for the AC- MA2-Matrix to array contains floating point value, by computing through multiplication operation between weight values and each ... See full document

8

Design and implementation of polynomial matrix multiplication by using cyclic convolution technique

Design and implementation of polynomial matrix multiplication by using cyclic convolution technique

... and efficient algorithms for the computation of the circular or cyclic convolution operation, reaching the minimal number of multiplications according to the Winograd’s ...point-by-point multiplication ... See full document

7

Area and power efficient DCT architecture for image compression

Area and power efficient DCT architecture for image compression

... of DCT ap- proximations have been ...8-point DCT. Cham [16] proposed the integer cosine transforms (ICT) using the principle of dyad ...of DCT. Haweel [17] proposed a signed DCT (SDCT) ... See full document

9

Title: An Efficient System for Encrypted Image by Using Hybrid DWT-DCT Compression Algorithm

Title: An Efficient System for Encrypted Image by Using Hybrid DWT-DCT Compression Algorithm

... PSS algorithm starts with P=10 data from ...the algorithm, these data are estimates three columns (A, B and C), as mentioned in ...the algorithm starts searching for original data (Ai, Bi and Ci) ... See full document

10

An efficient image compression algorithm with...

An efficient image compression algorithm with...

... In the current scenario and with the increase in development and usage of internet and wide applications of multimedia technology, people can communicate through the digital multimedia information systems with others, ... See full document

5

Image Compression using an efficient hybrid algorithm

Image Compression using an efficient hybrid algorithm

... components of the image .Discrete cosine transform is applied on the compressed image to further compress the image by selecting the DCT threshold value to 200. We have fixed this value otherwise we can also vary ... See full document

6

High Performance Asynchronous Pipelined QDI Templates for DCT Matrix vector Multiplication

High Performance Asynchronous Pipelined QDI Templates for DCT Matrix vector Multiplication

... an efficient asynchronous bundled-data pipeline design methodology on matrix–vector multiplication for ...in DCT and IDCT, yield both high average performance and low ... See full document

8

FPGA Hardware Accelerators - Case Study on Design Methodologies and Trade-Offs

FPGA Hardware Accelerators - Case Study on Design Methodologies and Trade-Offs

... standard algorithm in ...the matrix multiplication was performed on a block by block basis, N in this case did not refer to the size of a source matrix, but rather the size of the ... See full document

65

Article JAMPI: efficient matrix multiplication in Spark using Barrier Execution Mode

Article JAMPI: efficient matrix multiplication in Spark using Barrier Execution Mode

... JAMPI: efficient matrix multiplication in Spark using Barrier Execution Mode1. Tamas Foldi 1, ∗ , Chris von Csefalvay 1 and Nicolas A.[r] ... See full document

11

A High Speed FPGA Implementation of an ECSMA Based Elliptic Curve Crypto Processor

A High Speed FPGA Implementation of an ECSMA Based Elliptic Curve Crypto Processor

... point multiplication with Xilinx's FPGA ...point multiplication is done using C++ and ...point multiplication in GF(2283) is based on Algorithm 1 and carried out on a Pentium4 ... See full document

8

An Efficient Image Hiding Technique based on Secret Fragment Visible Mosaic Images using DCT Algorithm

An Efficient Image Hiding Technique based on Secret Fragment Visible Mosaic Images using DCT Algorithm

... HIDING DATA IN IMAGES BY SIMPLE LSB SUBSTITUTION [9], In this paper, a data hiding scheme by simple LSB substitution is proposed. By applying associate degree optimum pel adjustment method to the stego image obtained by ... See full document

10

Efficient Test Data Compression for SoC through ASRL with Improved Dictionary based Compression Technique

Efficient Test Data Compression for SoC through ASRL with Improved Dictionary based Compression Technique

... data compression through the deflate algorithm where ...the compression ratio is achieved on an ...data compression technique. Yuvan et al. [8], enhance the compression ratio by ... See full document

7

Hybrid Image Compression Using DCT

Hybrid Image Compression Using DCT

... Image compression is used to reduce redundancy and irrelevance of the image data, it is also used for archiving the data which has a very broad usage in various fields like compressing medical ...Image ... See full document

6

A Hybrid Image and Video Compression of DCT and DWT Techniques for H 265/HEVC

A Hybrid Image and Video Compression of DCT and DWT Techniques for H 265/HEVC

... days DCT and DWT unit of measurement the foremost modern techniques for ...higher compression quantitative relation whereas not losing a great deal of knowledge of image but it need a lot of method power ... See full document

5

Show all 10000 documents...