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

Michael Crosier

dblp:06/3297 · 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

Artificial intelligence and machine learning · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 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.

Computer graphics and multimedia
2 papers
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing › texture analysis
texture classification
0.222010
Using Basic Image Features for Texture Classification · Int. J. Comput. Vis. 2010
Texture classification with a dictionary of basic image features · CVPR 2008

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

basic image features · 0.1quantization · 0.1multiscale classification · 0.1filter bank · 0.1
YearPublicationVenuePosition
2010 Using Basic Image Features for Texture Classification
Michael Crosier, Lewis D. Griffin
Int. J. Comput. Vis.1
2008 Texture classification with a dictionary of basic image features
abstract
Many successful recent approaches to texture classification model texture images as distributions over a set of discrete features, or textons, which correspond to a partitioning of the space of responses to local descriptors such as filter banks or image patches. This partitioning is learned by unsupervised clustering of descriptor responses taken from the dataset to be analysed. Here, we explore a quantization of filter responses into a dictionary of discrete features which is based on geometrical, rather than statistical, considerations, resulting in a simple texture description based on a dictionary of dasiavisual wordspsila which is independent of the images to be described. A multi-scale classification scheme built on this dictionary is evaluated. The results presented are, to the best of our knowledge, state-of-the-art for the UIUCTex and KTH-TIPS datasets, and close to the state-of-the-art for CUReT, despite using a less sophisticated classifier.
Michael Crosier, Lewis D. Griffin
CVPR1
2007 Zipf's Law in Image Coding Schemes
abstract
Zipf's Law describes a power law between the frequency and rank of an event which is observed, most famously, in word distributions in human languages [1]; where it has been argued [2] that it represents an optimally efficient communication code. From an analogy between image coding schemes and natural language, we hypothesize that conforming to Zipf's Law is a necessary property of a good image description code, i.e. one that provides optimal local descriptors for vision tasks such as object categorization and recognition. Following the analogy between images and documents, we have developed an 'alphabet' of Basic Image Features (BIFs) [3]. This alphabet allows us to label each pixel, at each scale, with one of a small number of letters. 'Words' in this approach are then fixed square patches of BIF 'letters'. We test whether the frequency statistics of BIF words obeys Zipf's law, and find that as we vary certain parameters the Zipfness varies systematically. Remarkably, we find that for certain parameter settings we get extremely Zipf behaviour. Moreover the encoding at these settings looks optimal to eyeball measure.
Michael Crosier, Lewis D. Griffin
BMVC1