Search
Skip to Search Results- 14Nascimento, Mario
- 7Oliveira, Stanley
- 5Sander, Joerg
- 5Zaiane, Osmar
- 2Chitkara, Vishal
- 2Coman, Alexandru
- 8Database Systems
- 2Color histograms
- 2Color-based image retrieval
- 2Communication Networks
- 2Content-based image retrieval
- 2Databases
-
Content-Based Image Retrieval Using Binary Signatures
2000
Nascimento, Mario, Chitkara, Vishal, Mastaller, Curt
Technical report TR00-18. Significant research has focused on determining efficient methodologies for retrieving images in large image databases. In this paper, we propose two variations of a new image abstraction technique based on signature bit-strings and an appropriate similarity metric. The...
-
2004
Oliveira, Stanley, Zaiane, Osmar
Technical report TR04-17. Preserving privacy of individuals when data are shared for clustering is a complex problem. The challenge is how to protect the underlying attribute values subjected to clustering without jeopardizing the similarity between data objects under analysis. To address this...
-
2002
Zaiane, Osmar, Nascimento, Mario, Oliveira, Stanley
Technical report TR02-01. Research in information hiding has grown explosively. A large number of techniques have been proposed to discourage copyright infringement, tampering and unauthorized distribution of digital media (e.g. video, audio, and images). In this paper, we provide an overview of...
-
2008
Nikolaidis, Ioanis, Nascimento, Mario, Malhotra, Baljeet
Technical report TR08-02. We consider the problem of vehicle classification using acoustic signals captured within a sensor network. The sensors perform collaborative decision and/or data fusion in a distributed and energy efficient manner. We present a distributed cluster-based algorithm,...
-
Finding non-Redundant, Statistically Significant Regions in High Dimensional Data: a Novel Approach to Projected and Subspace Clustering
Download2008
Moise, Gabriela, Sander, Joerg
Technical report TR08-03. Projected and subspace clustering algorithms search for clusters of objects in subsets of attributes. Projected clustering computes several disjoint clusters, plus outliers, so that each cluster exists in its own subset of attributes. Subspace clustering enumerates...
-
2004
Sander, Joerg, Moise, Gabriela, Rafiei, Davood
Technical report TR04-24. This thesis studies the problem of effectively finding related pages on the Web, where given the URL of a page, one wants to find other pages that are on the same topic. This is a both simple and natural way of searching for resources without being forced to formulate a...
-
2003
Oliveira, Stanley, Zaiane, Osmar
Technical report TR03-12. Despite its benefit in a wide range of applications, data mining techniques also have raised a number of ethical issues. Some such issues include those of privacy, data security, intellectual property rights, and many others. In this paper, we address the privacy problem...
-
On the Trade-Off Between User-Location Privacy and Queried-Location Privacy in Wireless Sensor Networks
Download2009
Harms, Janelle, Vogt, Ryan, Nascimento, Mario
Technical report TR09-07. By eavesdropping on a user's query in a sensor network, an adversary can deduce both the user's location and his/her area of interest. In many domains it is desirable to guarantee privacy of both places. Relying on the principle of k-anonymity, we propose an effective...
-
2013
Nascimento, Mario, Wang, Zhiyu, MacGregor, Mike
Mobile objects can be equipped with sensors enabling them to collect data, as well as answer queries remotely and in real-time. For that, one needs to be able to effectively route queries from a base station to the queried object in an efficient way, i.e., with minimum energy-cost and/or minimum...
-
2009
Alencar, Romulo, Nascimento, Mario, Brayner, Angelo
Technical report TR09-05. It is a well known fact that minimizing energy consumption in Wireless Sensor Networks (WSNs) is crucial for its usability; and minimizing the flow of data is one way to achieve that. Most WSN models assume the existence of a base station where query results could in...