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

Ali Tabesh

dblp:84/7018 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2010
—ORCID · none

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

Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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.

Theoretical computer science
1 paper
Coding theory · 94% Information theory · 6%

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

TopicWeightPapersLastEvidence papers
Coding theory › source coding › quantization
entropy-coded quantization
0.112010
Optimal rate allocation for entropy-coded uniform scalar quantization of dependent sources in nonbinary hypothesis testing · IEEE Trans. Commun. 2010
Coding theory › source coding
quantization
0.112010
Optimal rate allocation for entropy-coded uniform scalar quantization of dependent sources in nonbinary hypothesis testing · IEEE Trans. Commun. 2010
Coding theory › source coding
rate allocation
0.112010
Optimal rate allocation for entropy-coded uniform scalar quantization of dependent sources in nonbinary hypothesis testing · IEEE Trans. Commun. 2010
Coding theory › source coding › quantization
scalar quantization
0.112010
Optimal rate allocation for entropy-coded uniform scalar quantization of dependent sources in nonbinary hypothesis testing · IEEE Trans. Commun. 2010
Coding theory
source coding
0.112010
Optimal rate allocation for entropy-coded uniform scalar quantization of dependent sources in nonbinary hypothesis testing · IEEE Trans. Commun. 2010
Information theory
hypothesis testing
0.012010
Optimal rate allocation for entropy-coded uniform scalar quantization of dependent sources in nonbinary hypothesis testing · IEEE Trans. Commun. 2010

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

rate-distortion theory · 0.1bayes decision theory · 0.1
YearPublicationVenuePosition
2010 Optimal rate allocation for entropy-coded uniform scalar quantization of dependent sources in nonbinary hypothesis testing
abstract
We propose a closed-form rate allocation scheme (RAS) for entropy-coded uniform scalar quantization of dependent sources in classification problems. The proposed RAS is applicable to nonbinary classification with piecewise monotonic unquantized Bayes decision boundaries. The RAS is also extended to joint compression and classification.
Ali Tabesh, Michael W. Marcellin, Mark A. Neifeld
IEEE Trans. Commun.1
2007 Multifeature Prostate Cancer Diagnosis and Gleason Grading of Histological Images
abstract
We present a study of image features for cancer diagnosis and Gleason grading of the histological images of prostate. In diagnosis, the tissue image is classified into the tumor and nontumor classes. In Gleason grading, which characterizes tumor aggressiveness, the image is classified as containing a low- or high-grade tumor. The image sets used in this paper consisted of 367 and 268 color images for the diagnosis and Gleason grading problems, respectively, and were captured from representative areas of hematoxylin and eosin-stained tissue retrieved from tissue microarray cores or whole sections. The primary contribution of this paper is to aggregate color, texture, and morphometric cues at the global and histological object levels for classification. Features representing different visual cues were combined in a supervised learning framework. We compared the performance of Gaussian, k-nearest neighbor, and support vector machine classifiers together with the sequential forward feature selection algorithm. On diagnosis, using a five-fold cross-validation estimate, an accuracy of 96.7% was obtained. On Gleason grading, the achieved accuracy of classification into low- and high-grade classes was 81.0%.
Ali Tabesh, Mikhail Teverovskiy, Ho-Yuen Pang, Vinay P. Kumar, David Verbel, Angeliki Kotsianti, Olivier Saidi
IEEE Trans. Medical Imaging1
2005 JPEG2000 and Motion JPEG2000 Content Analysis Using Codestream Length Information
abstract
The widespread adoption of the JPEG2000 standard calls for the development of computationally efficient algorithms to analyze the content of imagery compressed using this standard. For this purpose, we propose the use of the information content (IC) of wavelet subbands, defined as the number of bytes that JPEG2000 spends to encode the subbands. The IC of subbands can be obtained from the packet headers of the JPEG2000 codestream, thereby avoiding decompressing the arithmetically encoded bitplane data. We present experimental results for two content analysis tasks; namely, image classification and scene change detection. Our results indicate that performance comparable to that of methods operating on decompressed data can be achieved, while saving computational and bandwidth resources.
Ali Tabesh, Ali Bilgin, Karthik Krishnan, Michael W. Marcellin
DCC1