Results 1 - 10 of 8,249

A Metrics Suite for Object Oriented Design

by Shyam R. Chidamber , Chris F. Kemerer , 1994
"... Given the central role that software development plays in the delivery and application of information technology, managers are increasingly focusing on process improvement in the software development area. This demand has spurred the provision of a number of new and/or improved approaches to softwa ..."
Abstract - Cited by 1108 (3 self) - Add to MetaCart
to software development, with perhaps the most prominent being object-orientation (00). In addition, the focus on process im-provement has increased the demand for software measures, or metrics with which to manage the process. The need for such metrics is particularly acute when an organization is adopting a

Kernel-Based Object Tracking

by Dorin Comaniciu, Visvanathan Ramesh, Peter Meer , 2003
"... A new approach toward target representation and localization, the central component in visual tracking of non-rigid objects, is proposed. The feature histogram based target representations are regularized by spatial masking with an isotropic kernel. The masking induces spatially-smooth similarity fu ..."
Abstract - Cited by 900 (4 self) - Add to MetaCart
A new approach toward target representation and localization, the central component in visual tracking of non-rigid objects, is proposed. The feature histogram based target representations are regularized by spatial masking with an isotropic kernel. The masking induces spatially-smooth similarity

M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

by Paolo Ciaccia, Marco Patella, Pavel Zezula , 1997
"... A new access meth d, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."
Abstract - Cited by 663 (38 self) - Add to MetaCart
A new access meth d, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion

A Validation Of Object-Oriented Design Metrics As Quality Indicators

by Victor R. Basili, Lionel Briand, Walcélio L. Melo - IEEE Transactions on Software Engineering , 1995
"... This paper presents the results of a study conducted at the University of Maryland in which we experimentally investigated the suite of Object-Oriented (OO) design metrics introduced by [Chidamber&Kemerer, 1994]. In order to do this, we assessed these metrics as predictors of fault-prone clas ..."
Abstract - Cited by 439 (19 self) - Add to MetaCart
This paper presents the results of a study conducted at the University of Maryland in which we experimentally investigated the suite of Object-Oriented (OO) design metrics introduced by [Chidamber&Kemerer, 1994]. In order to do this, we assessed these metrics as predictors of fault

Real-Time Tracking of Non-Rigid Objects using Mean Shift

by Dorin Comaniciu, Visvanathan Ramesh, Peter Meer - IEEE CVPR 2000 , 2000
"... A new method for real-time tracking of non-rigid objects seen from a moving camera isproposed. The central computational module is based on the mean shift iterations and nds the most probable target position in the current frame. The dissimilarity between the target model (its color distribution) an ..."
Abstract - Cited by 815 (19 self) - Add to MetaCart
A new method for real-time tracking of non-rigid objects seen from a moving camera isproposed. The central computational module is based on the mean shift iterations and nds the most probable target position in the current frame. The dissimilarity between the target model (its color distribution

Sapa: A multi-objective metric temporal planner

by Subbarao Kambhampati - J. Artif. Intell. Res
"... Sapa is a domain-independent heuristic forward chaining planner that can handle durative actions, metric resource constraints, and deadline goals. It is designed to be capable of handling the multi-objective nature of metric temporal planning. Our technical contributions include (i) planning-graph b ..."
Abstract - Cited by 67 (13 self) - Add to MetaCart
Sapa is a domain-independent heuristic forward chaining planner that can handle durative actions, metric resource constraints, and deadline goals. It is designed to be capable of handling the multi-objective nature of metric temporal planning. Our technical contributions include (i) planning

Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems

by Antony Rowstron , Peter Druschel - IN PROC. OF THE 18TH IFIP/ACM INTERNATIONAL CONFERENCE ON DISTRIBUTED SYSTEMS PLATFORMS, , 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer applications. Pastry performs application-level routing and object location in a potentially very large overlay network of nodes connected via the Intern ..."
Abstract - Cited by 1932 (1 self) - Add to MetaCart
This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer applications. Pastry performs application-level routing and object location in a potentially very large overlay network of nodes connected via

Features of similarity.

by Amos Tversky - Psychological Review , 1977
"... Similarity plays a fundamental role in theories of knowledge and behavior. It serves as an organizing principle by which individuals classify objects, form concepts, and make generalizations. Indeed, the concept of similarity is ubiquitous in psychological theory. It underlies the accounts of stimu ..."
Abstract - Cited by 1455 (2 self) - Add to MetaCart
. These models represent objects as points in some coordinate space such that the observed dissimilarities between objects correspond to the metric distances between the respective points. Practically all analyses of proximity data have been metric in nature, although some (e.g., hierarchical clustering) yield

Nearest neighbor queries.

by Nick Roussopoulos , Stephen Kelley , Fr Ed , Eric Vincent - ACM SIGMOD Record, , 1995
"... Abstract A frequently encountered type of query in Geographic Information Systems is to nd the k nearest neighbor objects to a given point in space. Processing such queries requires substantially di erent search algorithms than those for location or range queries. In this paper we present a n e cie ..."
Abstract - Cited by 592 (1 self) - Add to MetaCart
cient branch-and-bound R-tree traversal algorithm to nd the nearest neighbor object to a point, and then generalize it to nding the k nearest neighbors. We also discuss metrics for an optimistic and a pessimistic search ordering strategy as well as for pruning. Finally, w e present the results

Geodesic Active Contours

by Vicent Caselles, Ron Kimmel, Guillermo Sapiro , 1997
"... A novel scheme for the detection of object boundaries is presented. The technique is based on active contours evolving in time according to intrinsic geometric measures of the image. The evolving contours naturally split and merge, allowing the simultaneous detection of several objects and both in ..."
Abstract - Cited by 1425 (47 self) - Add to MetaCart
interior and exterior boundaries. The proposed approach is based on the relation between active contours and the computation of geodesics or minimal distance curves. The minimal distance curve lays in a Riemannian space whose metric is defined by the image content. This geodesic approach for object
Results 1 - 10 of 8,249