activity
20182026
most citedFrequency Disentangled Features in Neural Image Compression

11 citations · 31 across the 15 of their papers we have counts for

collaborators

15 papers

math.CO2026

On the Spectrum of the Line Graph of a Family of Bipartite Graphs Arising from the Boolean Lattice

Ali Zafari, Saeid Alikhani

The Boolean lattice , , is the graph whose vertex set is the collection of all subsets of , where two subsets and are adjacent if and o…

math.CO2026

The partition dimension and -domination number of a family of non-distance regular graph

Ali Zafari, Saeid Alikhani

A partition of the vertex set is a resolving partition if every pair of distinct vertices in has a unique representation relative to . T…

math.CO2025

Some results on Hamming graphs and an extended Hamming graphs

Ali Zafari, Saeid Alikhani

In this paper we first obtain the spectrum of the folded hypercube in a new approach. Then we introduce a new family of graphs called the extended Hamming graph, denoted by $EH(n,2…

eess.IV2023★ 11 cited

Frequency Disentangled Features in Neural Image Compression

Ali Zafari, Atefeh Khoshkhahtinat, Piyush Mehta +3

The design of a neural image compression network is governed by how well the entropy model matches the true distribution of the latent code. Apart from the model capacity, this abi…

cs.CV2023

A Quality Aware Sample-to-Sample Comparison for Face Recognition

Mohammad Saeed Ebrahimi Saadabadi, Sahar Rahimi Malakshan, Ali Zafari +2

Currently available face datasets mainly consist of a large number of high-quality and a small number of low-quality samples. As a result, a Face Recognition (FR) network fails to…

eess.IV2022★ 10 cited

Attention-Based Generative Neural Image Compression on Solar Dynamics Observatory

Ali Zafari, Atefeh Khoshkhahtinat, Piyush M. Mehta +4

NASA's Solar Dynamics Observatory (SDO) mission gathers 1.4 terabytes of data each day from its geosynchronous orbit in space. SDO data includes images of the Sun captured at diffe…

math.GM2022

A Minimum Doubly Resolving Set and Strong Resolving Set for the Crystal Cubic Carbon

Ali Zafari, Saeid Alikhani

The task of identifying resolving sets has been extensively studied due to its wide relevance in fields such as chemistry, robot navigation, combinatorial optimization, pattern rec…

math.CO2021

Metric dimension, doubly resolving set and strong metric dimension for

Jia-Bao Liu, Ali Zafari

A subset of vertices of a connected graph is a doubly resolving set of if for any various vertices we have $r(x|Q)-r(y|Q)\neqλI…

math.CO2021

Some resolving parameters with the minimum size for two specific graphs

Ali Zafari, Saeid Alikhani

A resolving set for a graph is a set of vertices such that, for all the -tuple uniquely determines , wh…

math.CO2020

Computing Minimal Doubly Resolving Sets and the Strong Metric Dimension of the Layer Sun Graph and the Line Graph of Layer Sun Graph

Jia-Bao Liu, Ali Zafari

Let be a finite, connected graph of order of at least 2, with vertex set and edge set . A set of vertices of the graph is a doubly resolving set for i…

math.GM2019★ 3 cited

Metric dimension, minimal doubly resolving sets and the strong metric dimension for jellyfish graph and cocktail party graph

Jia-Bao Liu, Ali Zafari, Hassan Zarei

Let be a simple connected undirected graph with vertex set and edge set . The metric dimension of a graph is the least number of vertices in a set with the pro…

math.CO2019

Some resolving parameters in a class of Cayley graphs

Jia-Bao Liu, Ali Zafari

Resolving parameters is a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences. In this article, we construct a…

math.CO2019

On the spectrum of two families of non-distance-regular graphs

Ali Zafari, Saeid Alikhani

This paper addresses the challenge of spectral analysis and structural investigation for graphs that are not distance-regular, where computing the spectrum using standard methods b…

math.CO2019

Some algebraic properties of a class of integral graphs determined by their spectrum

Jia-Bao Liu, S. Morteza Mirafzal, Ali Zafari

Let be a graph. If all the eigenvalues of the adjacency matrix of the graph are integers, then we say that is an integral graph. A graph is determined by its…

math.GR2018★ 7 cited

Some algebraic properties of bipartite Kneser graphs

S. Morteza Mirafzal, Ali Zafari

Let and be integers with and . The is the graph with the all -element and all ()-elemen…