Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Saeid Saryazdi

dblp:50/2163 · also Saeïd Saryazdi · DBLP profile ↗
← Back
14ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0002-4577-1971ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 6 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video processing · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › image restoration › image denoising › single image denoising
document image denoising
0.112007
PKCS: A Polynomial Kernel Family With Compact Support for Scale- Space Image Processing · IEEE Trans. Image Process. 2007
Image and video processing › image restoration
image denoising
0.112007
PKCS: A Polynomial Kernel Family With Compact Support for Scale- Space Image Processing · IEEE Trans. Image Process. 2007

Methods — techniques the papers use, named apart from their topics

polynomial kernel design · 0.1diffusion equation approximation · 0.1
YearPublicationVenuePosition
2021 A new reversible data hiding in transform domain
Zahra Pakdaman, Hossein Nezamabadi-pour, Saeid Saryazdi
Multim. Tools Appl.3
2020 Image denoising in undecimated dual-tree complex wavelet domain using multivariate t-distribution
Mansoore Saeedzarandi, Hossein Nezamabadi-pour, Saeid Saryazdi, Ahad Jamalizadeh
Multim. Tools Appl.3
2017 A prediction based reversible image watermarking in Hadamard domain
Zahra Pakdaman, Saeid Saryazdi, Hossein Nezamabadi-pour
Multim. Tools Appl.2
2015 A data clustering approach based on universal gravity rule
Abbas Bahrololoum, Hossein Nezamabadi-pour, Saeid Saryazdi
Eng. Appl. Artif. Intell.3
2015 Information fusion between short term learning and long term learning in content based image retrieval systems
Esmat Rashedi, Hossein Nezamabadi-pour, Saeid Saryazdi
Multim. Tools Appl.3
2014 Long term learning in image retrieval systems using case based reasoning
Esmat Rashedi, Hossein Nezamabadi-pour, Saeid Saryazdi
Eng. Appl. Artif. Intell.3
2014 A short-term learning approach based on similarity refinement in content-based image retrieval
Asma Shamsi, Hossein Nezamabadi-pour, Saeid Saryazdi
Multim. Tools Appl.3
2013 A simultaneous feature adaptation and feature selection method for content-based image retrieval systems
Esmat Rashedi, Hossein Nezamabadi-pour, Saeid Saryazdi
Knowl. Based Syst.3
2011 Filter modeling using gravitational search algorithm
Esmat Rashedi, Hossein Nezamabadi-pour, Saeid Saryazdi
Eng. Appl. Artif. Intell.3
2010 BGSA: binary gravitational search algorithm
Esmat Rashedi, Hossein Nezamabadi-pour, Saeid Saryazdi
Nat. Comput.3
2009 GSA: A Gravitational Search Algorithm
Esmat Rashedi, Hossein Nezamabadi-pour, Saeid Saryazdi
Inf. Sci.3
2007 PKCS: A Polynomial Kernel Family With Compact Support for Scale- Space Image Processing
abstract
In a scale-space framework, the Gaussian kernel has some properties that make it unique. However, because of its infinite support, exact implementation of this kernel is not possible. To avoid this drawback, there exist two different approaches: approximating the Gaussian kernel by a finite support kernel, or defining new kernels with properties closed to the Gaussian. In this paper, we propose a polynomial kernel family with compact support which overcomes the Gaussian practical drawbacks while preserving a large number of the useful Gaussian properties. The new kernels are not obtained by approximating the Gaussian, though they are derived from it. We show that, for a suitable choice of kernel parameters, this family provides an approximated solution of the diffusion equation and satisfies some other basic constraints of the linear scale-space theory. The construction and properties of the proposed kernel are described, and an application in which handwritten data are extracted from noisy document images is presented.
Saeid Saryazdi, Mohamed Cheriet
IEEE Trans. Image Process.1
2006 Edge detection using ant algorithms
Hossein Nezamabadi-pour, Saeid Saryazdi, Esmat Rashedi
Soft Comput.2
2000 Image representation by a new optimal non-uniform morphological sampling
Saeid Saryazdi, Véronique Haese-Coat, Joseph Ronsin
Pattern Recognit.1