Sciweavers

455 search results - page 62 / 91
» On Trees and Noncrossing Partitions
Sort
View
ICIP
2007
IEEE
16 years 23 days ago
Perceptual Image Coding Based on a Maximum of Minimal Structural Similarity Criterion
Perceptual image coding algorithms typically impose perceptual modeling in a preprocessing stage. A perceptual normalization model is often used to transform the original image si...
Zhou Wang, Qiang Li, Xinli Shang
84
Voted
ICIP
2002
IEEE
16 years 20 days ago
Packet loss protection of embedded data with fast local search
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...
Vladimir Stankovic, Raouf Hamzaoui, Zixiang Xiong
ICIP
1999
IEEE
16 years 19 days ago
Spiht for Generalized Multiple Description Coding
W e present a simple and eficient scheme for using the Set Partitioning in Hierarchical Trees (SPIHT) image compression algorithm [l]in a generalized multiple description framewor...
Agnieszka C. Miguel, Alexander E. Mohr, Eve A. Ris...
ICML
2005
IEEE
15 years 12 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
WWW
2006
ACM
15 years 11 months ago
FLUX: fuzzy content and structure matching of XML range queries
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure ran...
Hua-Gang Li, S. Alireza Aghili, Divyakant Agrawal,...