Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering
نویسندگان
چکیده
منابع مشابه
Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملK-Mutual Nearest Neighbour Approach for Clustering Two-Dimensional Shapes Described by Fuzzy-Symbolic Features
In this paper, a new method of representing two-dimensional shapes using fuzzy-symbolic features and a similarity measure defined over fuzzy-symbolic features useful for clustering shapes is proposed. A k-mutual nearest neighborhood approach for clustering two-dimensional shapes is presented. The proposed shape representation scheme is invariant to similarity transformations and the clustering ...
متن کاملDiscrete Average of Two-Dimensional Shapes
In this article we present an algorithm for computing discrete average of n two-dimensional shapes. Our previous work was limited to two shapes, we generalize it to an arbitrary number of objects with consideration of increasing inter-individual variability. The first step of our approach performs a rigid transformation that aligns the shapes as best as possible. The next step consists in searc...
متن کاملMental Rotation of Random Two-Dimensional Shapes
Two experiments are reported in which Ss were required to determine whether a random, angular form, presented at any of a number of picture-plane orientations, was a “standard” or “reflected” version. Average time required to make this determination increased linearly with the angular departure of the form from a previously learned orientation. The slope and intercept of the reaction-time (RT) ...
متن کاملProtein domain decomposition using a graph-theoretic approach
MOTIVATION Automatic decomposition of a multi-domain protein into individual domains represents a highly interesting and unsolved problem. As the number of protein structures in PDB is growing at an exponential rate, there is clearly a need for more reliable and efficient methods for protein domain decomposition simply to keep the domain databases up-to-date. RESULTS We present a new algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 1979
ISSN: 0162-8828
DOI: 10.1109/tpami.1979.4766871