Tensor voting (TV) is a method for inferring geometric structures from sparse, irregular and possibly noisy input. It was initially proposed by Guy and Medioni [Guy96] and has been applied to several computer vision applications. TV generates a dense output field in a domain by dispersing information associated with sparse input tokens. In 3-D this implies that a surface can be generated from a...

This paper presents a content-based image retrieval technique based on interest points matching and geometric hashing. We estimate points with significant luminance variations as interest points. A small region around the interest point is located as an image patch. Low-level features are extracted to describe each image patch. To provide geometric invariant image matching, we index the image p...

Spatial verification is a crucial part of every image retrieval system, as it accounts for the fact that geometric feature configurations are typically ignored by the Bag-of-Words representation. Since spatial verification quickly becomes the bottleneck of the retrieval process, runtime efficiency is extremely important. At the same time, spatial verification should be able to reliably distingu...

My current research is primarily in the mathematics of voting. This discipline lies at the interface of mathematics, political science, and economics, though it has connections to any field which could involve aggregation of preferences, such as statistics or psychology. It also is a proven, fertile field for undergraduate research. The math of voting, in its classical form, asks questions abou...

In this paper we present an approach based on sceneor part-graphs for geometrically categorizing touching and occluded objects. We use additive RGBD feature descriptors and hashing of graph configuration parameters for describing the spatial arrangement of constituent parts. The presented experiments quantify that this method outperforms our earlier part-voting and sliding window classification...

In this paper we present a new method for self-localization on wafers using geometric hashing. The proposed technique is robust to image changes induced by process variations, as opposed to the traditional, correlation based methods. Moreover, it eliminates the need in training on reference patterns. Two enhancements are introduced to the basic geometric hashing scheme improving its performance...

Do print media significantly impact political attitudes and party identification? To examine this question, we draw on a rare quasi-natural experiment that occurred when The Sun, a right-leaning UK tabloid, shifted its support to the Labour party in 1997 and back to the Conservative party in 2010. We compared changes in party identification and political attitudes among Sun readers with non-rea...

2-24-16, Naka-cho, Koganei Tokyo 184, JAPAN the combinations of triplets of basis points from the set of ABSTRACT feature points and then the HT can include normalized A new method for recognition of three dimensional information of feature distribution on the image plane. In objects by use of a monocular image is proposed. It the recognition phase, a set of feature points from the utilizes sam...

A natural partial ordering exists on all weighted games and, more broadly, on all linear games. We describe several properties of the partially ordered sets formed by these games and utilize this perspective to enumerate proper linear games with one generator. We introduce a geometric approach to weighted voting by considering the convex polytope of all possible realizations of a weighted game ...

We consider the possibility of designing an election method that eliminates the incentives for a voter to rank any other candidate equal to or ahead of his or her sincere favorite. We refer to these methods as satisfying the " Strong Favorite Betrayal Criterion " (SFBC). Methods satisfying our strategic criteria can be classified into four categories, according to their geometrical properties. ...