Cover Image

Low-complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Oliveira, P. A. M., Cintra, R. J., Bayer, F. M., Kulasekera, S., Madanayake, A., Coutinho, V. A.
Format:	Preprint
Published:	2016
Subjects:	Multimedia Computer Vision and Pattern Recognition Data Structures and Algorithms Computation Methodology
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Low-complexity 8-point DCT Approximation Based on Angle Similarity for Image and Video Coding
by: Oliveira, R. S., et al.
Published: (2018)

Data-independent Low-complexity KLT Approximations for Image and Video Coding
by: Radünz, A. P., et al.
Published: (2021)

On computing and the complexity of computing higher-order $U$-statistics, exactly
by: Chen, Xingyu, et al.
Published: (2025)

Fast Computation of Leave-One-Out Cross-Validation for $k$-NN Regression
by: Kanagawa, Motonobu
Published: (2024)

Scalable Learning of Multivariate Distributions via Coresets
by: Ding, Zeyu, et al.
Published: (2026)

Data Structures for Approximate Discrete Fréchet Distance
by: van der Hoog, Ivor, et al.
Published: (2022)

On Approximating the Dynamic and Discrete Network Flow Problem
by: Manna, Bubai, et al.
Published: (2024)

Low-complexity Scaling Methods for DCT-II Approximations
by: Coelho, D. F. G., et al.
Published: (2021)

A Refreshment Stirred, Not Shaken: Invariant-Preserving Deployments of Differential Privacy for the U.S. Decennial Census
by: Bailie, James, et al.
Published: (2025)

An efficient heuristic for approximate maximum flow computations
by: Qian, Jingyun, et al.
Published: (2024)

Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
by: Choromanski, Krzysztof, et al.
Published: (2026)

Graph Generation Methods under Partial Information
by: Sun, Tong, et al.
Published: (2026)

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
by: Abbasi, Fateme, et al.
Published: (2023)

Detecting Low-Degree Truncation
by: De, Anindya, et al.
Published: (2024)

Improved Hardness and Approximations for Cardinality-Based Minimum $s$-$t$ Cuts Problems in Hypergraphs
by: Adriaens, Florian, et al.
Published: (2024)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
by: Bhore, Sujoy, et al.
Published: (2024)

From Chinese Postman to Salesman and Beyond I: Approximating Shortest Tours $δ$-Covering All Points on All Edges
by: Frei, Fabian, et al.
Published: (2024)

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
by: Esmer, Barış Can, et al.
Published: (2022)

Efficient Greedy Discrete Subtrajectory Clustering
by: van der Hoog, Ivor, et al.
Published: (2025)

Parameterized Approximation of Rectangle Stabbing
by: Chu, Huairui, et al.
Published: (2026)

Maximization of Approximately Submodular Functions
by: Horel, Thibaut, et al.
Published: (2024)

Optimal Trajectories in Discrete Space with Acceleration Constraints
by: Casteigts, Arnaud, et al.
Published: (2026)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

A divide and conquer strategy for multinomial particle filter resampling
by: Popov, Andrey A.
Published: (2026)

Approximation Algorithms for Smallest Intersecting Balls
by: Zheng, Jiaqi, et al.
Published: (2024)

Improved Hardness-of-Approximation for Token Swapping
by: Hiken, Sam, et al.
Published: (2024)

Adversarially Robust Approximate Furthest Neighbor
by: Banihashem, Kiarash, et al.
Published: (2026)

Approximately: Independence Implies Vertex Cover
by: Har-Peled, Sariel
Published: (2023)

The communication complexity of distributed estimation
by: Gopalan, Parikshit, et al.
Published: (2025)

Parameterized complexity of reconfiguration of atoms
by: Cooper, Alexandre, et al.
Published: (2021)

On Approximating the Weighted Region Problem in Square Tessellations
by: Kakimura, Naonori, et al.
Published: (2024)

On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
by: Bilò, Davide, et al.
Published: (2025)

Faster Approximation Scheme for Euclidean $k$-TSP
by: van Wijland, Ernest, et al.
Published: (2023)

Fast Computation of the Discrete Fourier Transform Square Index Coefficients
by: Queiroz, Saulo, et al.
Published: (2024)

Fast Computation of the Discrete Fourier Transform Rectangular Index Coefficients
by: Queiroz, Saulo, et al.
Published: (2025)

Private Approximations of a Convex Hull in Low Dimensions
by: Gao, Yue, et al.
Published: (2020)

A more efficient algorithm to compute the Rand Index for change-point problems
by: Prates, Lucas de Oliveira
Published: (2021)

Tight Streaming Lower Bounds for Deterministic Approximate Counting
by: Wang, Yichuan
Published: (2024)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
by: Liu, Shuilian, et al.
Published: (2025)

Linear Space Streaming Lower Bounds for Approximating CSPs
by: Chou, Chi-Ning, et al.
Published: (2021)