Results 1  10
of
870,413
Finding Monochromatic LShapes in Bichromatic Point Sets
"... Given a set R of red points and a set B of blue points in the plane of total size n, we study the problem of determining all angles for which there exists an Lshape containing all points from B without containing any points from R. We propose an algorithm to solve the problem in O(n 2 log n) time a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Given a set R of red points and a set B of blue points in the plane of total size n, we study the problem of determining all angles for which there exists an Lshape containing all points from B without containing any points from R. We propose an algorithm to solve the problem in O(n 2 log n) time
Separating Bichromatic Point Sets by Lshapes
, 2013
"... Given a set R of red points and a set B of blue points in the plane, we study the problem of determining all angles for which there exists an Lshape containing all points from B and no points from R. We propose a worstcase optimal algorithm to solve this problem in O(n2) time and O(n) storage, whe ..."
Abstract
 Add to MetaCart
Given a set R of red points and a set B of blue points in the plane, we study the problem of determining all angles for which there exists an Lshape containing all points from B and no points from R. We propose a worstcase optimal algorithm to solve this problem in O(n2) time and O(n) storage
Finding community structure in networks using the eigenvectors of matrices
, 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract

Cited by 500 (0 self)
 Add to MetaCart
We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a number of possible algorithms for detecting community structure, as well as several other results, including a spectral measure of bipartite structure in networks and a new centrality measure that identifies those vertices that occupy central positions within the communities to which they belong. The algorithms and measures proposed are illustrated with applications to a variety of realworld complex networks.
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 659 (7 self)
 Add to MetaCart
, which is required for environment modeling (e.g., building a Digital Elevation Map). Objects are represented by a set of 3D points, which are considered as the samples of a surface. No constraint is imposed on the form of the objects. The proposed algorithm is based on iteratively matching points
QSplat: A Multiresolution Point Rendering System for Large Meshes
, 2000
"... Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing and p ..."
Abstract

Cited by 500 (8 self)
 Add to MetaCart
Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing
The pyramid match kernel: Discriminative classification with sets of image features
 IN ICCV
, 2005
"... Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernelbased classification methods can learn complex decision boundaries, but a kernel over unordered set inputs must somehow solve for correspondenc ..."
Abstract

Cited by 546 (29 self)
 Add to MetaCart
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernelbased classification methods can learn complex decision boundaries, but a kernel over unordered set inputs must somehow solve
Shape modeling with front propagation: A level set approach
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1995
"... Abstract Shape modeling is an important constituent of computer vision as well as computer graphics research. Shape models aid the tasks of object representation and recognition. This paper presents a new approach to shape modeling which retains some of the attractive features of existing methods ..."
Abstract

Cited by 804 (20 self)
 Add to MetaCart
is demonstrated with numerical experiments on some synthesized images and some low contrast medical images. Index Terms Shape modeling, shape recovery, interface motion, level sets, hyperbolic conservation laws, HamiltonJacobi
Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors
 In ICDE
, 2007
"... This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general as it is applicable for both the monochromatic and bichromatic reverse nearest neighbor queries. The incremental aspect of IG ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general as it is applicable for both the monochromatic and bichromatic reverse nearest neighbor queries. The incremental aspect
Shape Matching and Object Recognition Using Shape Contexts
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by (1) solv ing for correspondences between points on the two shapes, (2) using the correspondences to estimate an aligning transform ..."
Abstract

Cited by 1787 (21 self)
 Add to MetaCart
for this purpose. The dissimilarity between the two shapes is computed as a sum of matching errors between corresponding points, together with a term measuring the magnitude of the aligning trans form. We treat recognition in a nearestneighbor classification framework as the problem of finding the stored
Covering a Bichromatic Point Set with Two Disjoint Monochromatic Disks
, 2011
"... Let P be a set of n points in the plane in general position such that its elements are colored red or blue. We study the problem of finding two disjoint disks Dr and Db such that Dr covers only red points, Db covers only blue points, and the number of elements of P contained in Dr ∪ Db is maximized. ..."
Abstract
 Add to MetaCart
Let P be a set of n points in the plane in general position such that its elements are colored red or blue. We study the problem of finding two disjoint disks Dr and Db such that Dr covers only red points, Db covers only blue points, and the number of elements of P contained in Dr ∪ Db is maximized
Results 1  10
of
870,413