Topic
Centroid
About: Centroid is a research topic. Over the lifetime, 4110 publications have been published within this topic receiving 53637 citations. The topic is also known as: barycenter (geometry) & geometric center of a plane figure.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The centroid method has two optimality properties: it yields loadings with the highest sum of absolute values, even in the absence of the constraint that the squared component weights be equal as discussed by the authors.
Abstract: The aim of this note is to show that the centroid method has two optimality properties It yields loadings with the highest sum of absolute values, even in absence of the constraint that the squared component weights be equal In addition, it yields scores with maximum variance, subject to the constraint that none of the squared component weights be larger than 1
22 citations
••
TL;DR: A P-centroid location-allocation model is developed and test that provides insight into the ideal shapes, locations and numbers of harvesting sites and minimizes aggregate work.
Abstract: We model a log harvesting problem as one of how to slide blocks along an inclined plane. To analyze this problem we develop and test a P-centroid location-allocation model that minimizes aggregate work. The model provides insight into the ideal shapes, locations and numbers of harvesting sites.
21 citations
••
18 Sep 2011
TL;DR: The proposed methodology consists in a novel feature extraction technique, which uses a non-rigid representation adaptable to the shape that adapts its representation to the given shape and encodes the pixel density distribution.
Abstract: This paper presents a methodology for shape recognition that focuses on dealing with the difficult problem of large deformations. The proposed methodology consists in a novel feature extraction technique, which uses a non-rigid representation adaptable to the shape. This technique employs a deformable grid based on the computation of geometrical centroids that follows a region partitioning algorithm. Then, a feature vector is extracted by computing pixel density measures around these geometrical centroids. The result is a shape descriptor that adapts its representation to the given shape and encodes the pixel density distribution. The validity of the method when dealing with large deformations has been experimentally shown over datasets composed of handwritten shapes. It has been applied to signature verification and shape recognition tasks demonstrating high accuracy and low computational cost.
21 citations
•
07 Oct 2004TL;DR: In this article, a pixel center position that is not covered by a primitive covering a portion of the pixel is displaced to lie within a fragment formed by the intersection of the primitive and the pixel.
Abstract: A pixel center position that is not covered by a primitive covering a portion of the pixel is displaced to lie within a fragment formed by the intersection of the primitive and the pixel. X,y coordinates of a pixel center are adjusted to displace the pixel center position to lie within the fragment, affecting actual texture map coordinates or barycentric weights. Alternatively, a centroid sub-pixel sample position is determined based on coverage data for the pixel and a multisample mode. The centroid sub-pixel sample position is used to compute pixel or sub-pixel parameters for the fragment.
21 citations
••
TL;DR: In this paper , the damage characteristics of Carbon Fiber Reinforced Polymer (CFRP) composites, adhesively bonded in a Single Lap Shear (SLS) configuration, are analyzed using Acoustic Emission (AE) data recorded during the test.
21 citations