Sciweavers

283 search results - page 27 / 57
» On the Use of Context Tree for Binary Image Compression
Sort
View
CANDC
2005
ACM
13 years 7 months ago
Integer linear programming as a tool for constructing trees from quartet data
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
Jan Weyer-Menkhoff, Claudine Devauchelle, Alexande...
BMVC
2001
13 years 9 months ago
Spectral and Spatial Invariant Image Retrieval using Scene Structural Matrix
We introduce Scene Structural Matrix (SSM), a novel image content descriptor and its application to invariant image retrieval. The SSM captures the overall structural characterist...
Guoping Qiu, S. Sudirman
TIT
1998
123views more  TIT 1998»
13 years 7 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu
TITB
2010
138views Education» more  TITB 2010»
13 years 2 months ago
Local structure-based region-of-interest retrieval in brain MR images
The aging population and the growing amount of medical data have increased the need for automated tools in the neurology departments. Although the researchers have been developing ...
Devrim Unay, Ahmet Ekin, Radu S. Jasinschi
ICIP
2001
IEEE
14 years 9 months ago
Feature coincidence trees for registration of ultrasound breast images
Registration of an image, the query or reference, to a database of rotated and translated exemplars constitutes an important image retrieval and indexing application which arises i...
Huzefa Neemuchwala, Alfred O. Hero, Paul L. Carson