#### Filter Results:

#### Publication Year

2005

2008

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The proliferation of digital images and the widespread distribution of digital data that has been made possible by the Internet has increased problems associated with copyright infringement on digital images. Watermarking schemes have been proposed to safeguard copyrighted images, but watermarks are vulnerable to image processing and geometric distortions… (More)

In recent years, weblogs, or blogs for short, have become an important form of online content. The personal nature of blogs, online interactions between bloggers, and the temporal nature of blog entries, differentiate blogs from other kinds of Web content. Bloggers interact with each other by linking to each other's posts, thus forming online communities.… (More)

We propose EXTENT, which combines the context and content of an image to provide the image with metadata that cannot be inferred by either context or content alone. EXTENT first applies contextual analysis for reducing the complexity of content analysis, it can then afford using more expensive (hence robust) algorithms for performing content analysis. Our… (More)

For many applications in computer vision and multimedia, similarity between objects is measured by a dissimilarity function that is complex, expensive to compute, and often non-metric. To allow fast distance computations, these objects may be embedded into a vector space, where the distance between the embedding of two objects approximates the actual… (More)

Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can exceed the time required for performing a linear scan on the entire dataset. To alleviate this dimensionality curse, indexing schemes such as locality sensitive hashing (LSH) and… (More)

In many data-mining applications, Support Vector Machines are used to learn query concepts, and then the learned SVM is used to find the corresponding best matches in a given dataset. When the dataset is large, naively scanning the entire dataset to find the instances with the highest classification scores is not practical. An indexing strategy is thus… (More)

- ‹
- 1
- ›