Sciweavers

2520 search results - page 70 / 504
» The complexity of approximating entropy
Sort
View
CORR
2006
Springer
127views Education» more  CORR 2006»
14 years 10 months ago
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
Steven de Rooij, Paul M. B. Vitányi
PAMI
2006
122views more  PAMI 2006»
14 years 10 months ago
Polarimetric Image Segmentation via Maximum-Likelihood Approximation and Efficient Multiphase Level-Sets
This study investigates a level set method for complex polarimetric image segmentation. It consists of minimizing a functional containing an original observation term derived from ...
Ismail Ben Ayed, Amar Mitiche, Ziad Belhadj
KDD
2002
ACM
148views Data Mining» more  KDD 2002»
15 years 10 months ago
Discovering informative content blocks from Web documents
In this paper, we propose a new approach to discover informative contents from a set of tabular documents (or Web pages) of a Web site. Our system, InfoDiscoverer, first partition...
Shian-Hua Lin, Jan-Ming Ho
TRECVID
2008
14 years 11 months ago
Learning TRECVID'08 High-Level Features from YouTube
Run No. Run ID Run Description infMAP (%) training on TV08 data 1 IUPR-TV-M SIFT visual words with maximum entropy 6.1 2 IUPR-TV-MF SIFT with maximum entropy, fused with color+tex...
Adrian Ulges, Christian Schulze, Markus Koch, Thom...
SCIA
2005
Springer
186views Image Analysis» more  SCIA 2005»
15 years 3 months ago
Building Detection from Mobile Imagery Using Informative SIFT Descriptors
We propose reliable outdoor object detection on mobile phone imagery from off-the-shelf devices. With the goal to provide both robust object detection and reduction of computation...
Gerald Fritz, Christin Seifert, Manish Kumar, Luca...