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

Shiri Gordon

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

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

Artificial intelligence and machine learning · 4 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-authorHuman-computer interaction and ubiquitous 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 67% Information retrieval · 33%
Theoretical computer science
3 papers
Coding theory · 59% Information theory · 41%
Computer graphics and multimedia
2 papers
Multimedia analysis and retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.112006
Unsupervised image-set clustering using an information theoretic framework · IEEE Trans. Image Process. 2006
Information retrieval
image retrieval
0.112006
Unsupervised image-set clustering using an information theoretic framework · IEEE Trans. Image Process. 2006
Data mining › clustering
information-theoretic clustering
0.112006
Unsupervised image-set clustering using an information theoretic framework · IEEE Trans. Image Process. 2006
Coding theory › source coding › rate-distortion theory
information bottleneck
0.122006
Applying the Information Bottleneck Principle to Unsupervised Clustering of Discrete and Continuous Image Representations · ICCV 2003
Unsupervised image-set clustering using an information theoretic framework · IEEE Trans. Image Process. 2006
Multimedia analysis and retrieval › multimedia analysis › multimedia collection analysis › image collection analysis
image clustering
0.012003
Applying the Information Bottleneck Principle to Unsupervised Clustering of Discrete and Continuous Image Representations · ICCV 2003
Multimedia analysis and retrieval
image retrieval
0.012003
An Efficient Image Similarity Measure Based on Approximations of KL-Divergence Between Two Gaussian Mixtures · ICCV 2003

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

mutual information maximization · 0.1mixture of gaussian densities · 0.1unscented transform · 0.1mixture of gaussians · 0.1information bottleneck · 0.1gaussian mixture matching · 0.1discrete image histograms · 0.1
YearPublicationVenuePosition
2010 An agglomerative segmentation framework for non-convex regions within uterine cervix images
Shiri Gordon, Hayit Greenspan
Image Vis. Comput.1
2009 Automatic Detection of Anatomical Landmarks in Uterine Cervix Images
abstract
The work focuses on a unique medical repository of digital cervicographic images ("Cervigrams") collected by the National Cancer Institute (NCI) in longitudinal multiyear studies. NCI, together with the National Library of Medicine (NLM), is developing a unique web-accessible database of the digitized cervix images to study the evolution of lesions related to cervical cancer. Tools are needed for automated analysis of the cervigram content to support cancer research. We present a multistage scheme for segmenting and labeling regions of anatomical interest within the cervigrams. In particular, we focus on the extraction of the cervix region and fine detection of the cervix boundary; specular reflection is eliminated as an important preprocessing step; in addition, the entrance to the endocervical canal (the "os"), is detected. Segmentation results are evaluated on three image sets of cervigrams that were manually labeled by NCI experts.
Hayit Greenspan, Shiri Gordon, Gali Zimmerman-Moreno, Shelly Lotenberg, Jose Jeronimo, Sameer K. Antani, L. Rodney Long
IEEE Trans. Medical Imaging2
2006 Unsupervised image-set clustering using an information theoretic framework
abstract
In this paper, we combine discrete and continuous image models with information-theoretic-based criteria for unsupervised hierarchical image-set clustering. The continuous image modeling is based on mixture of Gaussian densities. The unsupervised image-set clustering is based on a generalized version of a recently introduced information-theoretic principle, the information bottleneck principle. Images are clustered such that the mutual information between the clusters and the image content is maximally preserved. Experimental results demonstrate the performance of the proposed framework for image clustering on a large image set. Information theoretic tools are used to evaluate cluster quality. Particular emphasis is placed on the application of the clustering for efficient image search and retrieval.
Jacob Goldberger, Shiri Gordon, Hayit Greenspan
IEEE Trans. Image Process.2
2004 Image Segmentation of Uterine Cervix Images for Indexing in PACS
abstract
The National Cancer Institute has collected a large database of digitized 35 mm slides of the uterine cervix, the idea being to build a system enabling to study the evolution of lesions related to cervical cancer. In taking the first few steps towards this goal, the objective of this work is to develop and evaluate methodologies required for visual-based (i.e. content-based) indexing and retrieval that substantially improve information management of such a database. In this paper we model the properties of three tissue types using color and texture features, and use these models for image segmentation. Statistical modeling and segmentation tools are used for the task.
Shiri Gordon, Gali Zimmerman-Moreno, Hayit Greenspan
CBMS1
2003 An Efficient Image Similarity Measure Based on Approximations of KL-Divergence Between Two Gaussian Mixtures
abstract
We present two new methods for approximating the Kullback-Liebler (KL) divergence between two mixtures of Gaussians. The first method is based on matching between the Gaussian elements of the two Gaussian mixture densities. The second method is based on the unscented transform. The proposed methods are utilized for image retrieval tasks. Continuous probabilistic image modeling based on mixtures of Gaussians together with KL measure for image similarity, can be used for image retrieval tasks with remarkable performance. The efficiency and the performance of the KL approximation methods proposed are demonstrated on both simulated data and real image data sets. The experimental results indicate that our proposed approximations outperform previously suggested methods.
Jacob Goldberger, Shiri Gordon, Hayit Greenspan
ICCV2
2003 Applying the Information Bottleneck Principle to Unsupervised Clustering of Discrete and Continuous Image Representations
abstract
We present a method for unsupervised clustering of image databases. The method is based on a recently introduced information-theoretic principle, the information bottleneck (IB) principle. Image archives are clustered such that the mutual information between the clusters and the image content is maximally preserved. The IB principle is applied to both discrete and continuous image representations, using discrete image histograms and probabilistic continuous image modeling based on mixture of Gaussian densities, respectively. Experimental results demonstrate the performance of the proposed method for image clustering on a large image database. Several clustering algorithms derived from the IB principle are explored and compared.
Shiri Gordon, Hayit Greenspan, Jacob Goldberger
ICCV1