Results 1  10
of
10
Shape orientability
 In ACCV(2
, 2006
"... Abstract. In this paper we consider some questions related to the orientation of shapes. We introduce as a new shape feature shape orientability, i.e. the degree to which a shape has distinct (but not necessarily unique) orientation. A new method is described for measuring shape orientability, and h ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we consider some questions related to the orientation of shapes. We introduce as a new shape feature shape orientability, i.e. the degree to which a shape has distinct (but not necessarily unique) orientation. A new method is described for measuring shape orientability, and has several desirable properties. In particular, unlike the standard moment based measure of elongation, it is able to differentiate between the varying levels of orientability of nfold rotationally symmetric shapes. 1
A Rectilinearity Measurement for 3D Meshes
, 2008
"... In this paper, we propose and evaluate a novel shape measurement describing the extent to which a 3D mesh is rectilinear. Since the rectilinearity measure corresponds proportionally to the ratio of the sum of three orthogonal projected areas and the surface area of the mesh, it has the following des ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In this paper, we propose and evaluate a novel shape measurement describing the extent to which a 3D mesh is rectilinear. Since the rectilinearity measure corresponds proportionally to the ratio of the sum of three orthogonal projected areas and the surface area of the mesh, it has the following desirable properties: 1) the estimated rectilinearity is always a number from (0,1]; 2) the estimated rectilinearity is 1 if and only if the measured 3D shape is rectilinear; 3) there are shapes whose estimated rectilinearity is arbitrarily close to 0; 4) the measurement is invariant under scale, rotation, and translation; 5) the 3D objects can be either open or closed meshes, and we can also deal with poor quality meshes; 6) the measurement is insensitive to noise and stable under small topology errors; and 7) a Genetic Algorithm (GA) can be applied to calculate the approximate rectilinearity efficiently. We have also implemented two experiments of its applications. The first experiment shows that, in some cases, the calculation of rectilinearity provides a better tool for registering the pose of 3D meshes compared to PCA. The second experiment demonstrates that the combination of this measurement and other shape descriptors can significantly improve 3D shape retrieval performance.
Turning shape decision problems into measures
 Int. J. Shape Modelling
"... This paper considers the problem of constructing shape measures; we start by giving a short overview of areas of practical application of such measures. Shapes can be characterised in terms of a set of properties, some of which are Boolean in nature. E.g. is this shape convex? We show how it is poss ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
This paper considers the problem of constructing shape measures; we start by giving a short overview of areas of practical application of such measures. Shapes can be characterised in terms of a set of properties, some of which are Boolean in nature. E.g. is this shape convex? We show how it is possible in many cases to turn such Boolean properties into continuous measures of that property e.g. convexity, in the range [0–1]. We give two general principles for constructing measures in this way, and show how they can be applied to construct various shape measures, including ones for convexity, circularity, ellipticity, triangularity, rectilinearity, rectangularity and symmetry in two dimensions, and 2.5Dness, stability, and imperforateness in three dimensions. Some of these measures are new; others are well known and we show how they fit into this general framework. We also show how such measures for a single shape can be generalised to multiple shapes, and briefly consider as particular examples measures for containment, resemblance, congruence, and similarity.
MapSets: Visualizing Embedded and Clustered Graphs
"... Abstract. We describe MapSets, a method for visualizing embedded and clustered graphs. The proposed method relies on a theoretically sound geometric algorithm which guarantees the contiguity and disjointness of the regions representing the clusters, and also optimizes the convexity of the regions. A ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We describe MapSets, a method for visualizing embedded and clustered graphs. The proposed method relies on a theoretically sound geometric algorithm which guarantees the contiguity and disjointness of the regions representing the clusters, and also optimizes the convexity of the regions. A fully functional implementation is available online and is used in a comparison with related earlier methods. 1
Some Regularity Measures for Convex Polygons
"... We propose new measures to evaluate to which extent the shape of a given convex polygon is close to the shape of some regular polygon. We prove that our parameters satisfy several reasonable requirements and provide algorithms for their efficient computation. The properties we mostly focus on are th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
We propose new measures to evaluate to which extent the shape of a given convex polygon is close to the shape of some regular polygon. We prove that our parameters satisfy several reasonable requirements and provide algorithms for their efficient computation. The properties we mostly focus on are the facts that regular polygons are equilateral, equiangular and have radial symmetry. 1
Carried object detection and tracking using geometric shape models and spatiotemporal consistency
 in Computer Vision Systems, ser. LNCS
"... Abstract. This paper proposes a novel approach that detects and tracks carried objects by modelling the personcarried object relationship that is characteristic of the carry event. In order to detect a generic class of carried objects, we propose the use of geometric shape models, instead of using ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. This paper proposes a novel approach that detects and tracks carried objects by modelling the personcarried object relationship that is characteristic of the carry event. In order to detect a generic class of carried objects, we propose the use of geometric shape models, instead of using pretrained object class models or solely relying on protrusions. In order to track the carried objects, we propose a novel optimization procedure that combines spatiotemporal consistency characteristic of the carry event, with conventional properties such as appearance and motion smoothness respectively. The proposed approach substantially outperforms a stateoftheart approach on two challenging datasets PETS2006 and MINDSEYE2012. 1
2010 Seventh IEEE International Conference on Advanced Video and Signal Based Surveillance Thirteen Hard Cases in Visual Tracking
"... Visual tracking is a fundamental task in computer vision. However there has been no systematic way of analyzing visual trackers so far. In this paper we propose a method that can help researchers determine strengths and weaknesses of any visual tracker. To this end, we consider visual tracking as an ..."
Abstract
 Add to MetaCart
(Show Context)
Visual tracking is a fundamental task in computer vision. However there has been no systematic way of analyzing visual trackers so far. In this paper we propose a method that can help researchers determine strengths and weaknesses of any visual tracker. To this end, we consider visual tracking as an isolated problem and decompose it into fundamental and independent subproblems. Each subproblem is designed to associate with a different tracking circumstance. By evaluating a visual tracker onto a specific subproblem, we can determine how good it is with respect to that dimension. In total we come up with thirteen subproblems in our decomposition. We demonstrate the use of our proposed method by analyzing working conditions of two stateoftheart trackers. 1.
DOI: 10.7155/jgaa.00364 MapSets: Visualizing Embedded and Clustered Graphs
, 2015
"... In addition to objects and relationships between them, groups or clusters of objects are an essential part of many realworld datasets: party affiliation in political networks, types of living organisms in the tree of life, movie genres in the internet movie database. In recent visualization metho ..."
Abstract
 Add to MetaCart
(Show Context)
In addition to objects and relationships between them, groups or clusters of objects are an essential part of many realworld datasets: party affiliation in political networks, types of living organisms in the tree of life, movie genres in the internet movie database. In recent visualization methods, such group information is conveyed by explicit regions that enclose related elements. However, when in addition to fixed cluster membership, the input elements also have fixed positions in space (e.g., georeferenced data), it becomes difficult to produce readable visualizations. In such fixedclustering and fixedembedding settings, some methods produce fragmented regions, while other produce contiguous (connected) regions that may contain overlaps even if the input clusters are disjoint. Both fragmented regions and unnecessary overlaps have a detrimental effect on the interpretation of the drawing. With this in mind, we propose MapSets: a visualization technique that combines the advantages of both methods, producing maps with nonfragmented and nonoverlapping regions. The proposed method relies on a theoretically sound geometric algorithm which guarantees contiguity and disjointness of the regions, and also optimizes the convexity of the regions. A fully functional implementation is available in an online system and is used in a comparison with related earlier methods. Submitted:
unknown title
"... SOFTWARE SHERPA: an image segme Kloster et al. BMC Bioinformatics 2014, 15:218 ..."
Abstract
 Add to MetaCart
(Show Context)
SOFTWARE SHERPA: an image segme Kloster et al. BMC Bioinformatics 2014, 15:218