The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Some of the major challenges in current clustering applications include: some data sets are so huge that it is difficult to load the entire data sets into memory for clustering, the data sets are often distributed over different locations for various reasons, which makes it impossible to process them centrally, and when lacking prior knowledge of the unknown data sets, it is troublesome to choose...
To visualize the relations among products based on preference transition, this paper describes a method for merging products which are equivalent. While a node represents a product item and an arrow from one node to other node represents preference transition, the whole graph becomes complex as the number of product items increases. Using acyclic graph for equivalent nodes, the method enhances the...
This paper presents 2D shape matching technique using hierarchical tree structure extracted from shock graph that in turn extracted from the skeleton of the shape of interest. Object recognition and shape matching are important issues in the field of image processing. Extraction and application of skeleton of a shape is widely used in these fields. In this paper shape representation, matching and...
Questionnaire is often used to investigate the respondent' s opinion toward some product or service. To realize the knowledge mining from response data of questionnaire, this paper proposes one kind of visualization technique based on frequency analysis together with co-occurrence analysis. In created visualization graph, the nodes express the result of frequency analysis and the links between nodes...
In this paper, we present a graph-based approach to automatically detect defective zebrafish embryos. Here, the zebrafish is segmented from the background using a texture descriptor and morphological operations. In this way, we can represent the embryo shape as a graph, for which we propose a vectorisation method to recover clique histogram vectors for classification. The clique histogram represents...
This paper presents an algorithm for object localization and segmentation. The algorithm uses machine learning, and statistical and combinatorial optimization tools to build a tracker that is robust to noise and occlusions. The method is based on a novel energy formulation and its dual use for object localization and segmentation. The energy uses kernel principal component analysis to incorporate...
In this paper, we focus on the problem of shape retrieval. A novel approach, called improved graph transduction, is proposed. As preceding graph transduction method, we regard the shape as a node in a graph and the similarity of shapes is represented by the edge of the graph. Then we learn a new distance measure between the query shape and the testing shapes. The main contribution of our work is to...
A new geometric constraints histogram descriptor (GCHD) based on curvature mesh graph for image retrieval is presented in this paper. Through this method, the edge and angle geometric constraints based on the curvature mesh graph are extracted firstly. Then the histogram algorithm is applied on the geometric constraints to obtain the histogram matrix for each curvature point. Finally, the histograms...
Fully automatic segmentation of natural image is still a tough task. In this paper, we investigate a special class of natural images, whose foreground objects appear sharp while background are blurred due to out of depth of field, we call that Background Defocused Images. This kind of pictures is frequently seen on newspapers, advertisements and feature shoots. An algorithm is proposed to automatically...
Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been motivated by several factors: (1) The advent of 100 Gbps interfaces necessitating correspondingly fast packet processing algorithms with a compact memory footprint; (2) network virtualization leading to virtualization of physical...
Localization is an essential problem in wireless sensor networks (WSNs). Many localization algorithms have been proposed, but few efforts have been paid on theoretical analysis on the accuracy of these algorithms. Because it is naturally to formalize range-based localization problems as deterministic parameter estimation problems, for range-based localization algorithms Crameacuter-Rao lower bound...
Protein-protein docking is the computational approach to predict protein-protein interactions. The 3D geometric matching plays an important role in docking because a good matching between proteins provides a good cue for searching the interactional interfaces between them. In this paper, we propose a graph-based approach to search for the protein binding site. Given two proteins, we first identify...
The encrypting PIN pad (EPP) is one common interface used to verify the authentications for such as access control management, automatic teller machine (ATM), etc. by entering personal identification number (PIN). However, the strength of the passwords composed of ten candidate digits is less than 30% of with alphanumeric inputs by additional 26 English alphabet letters. This paper proposes an alternative...
This paper proposes a logical framework that visualizes worker's system awareness. Generally, this awareness is difficult to compile in a educational book, and is seldom communicated in verbally. To show broad utility of system awareness, we need to show operator's conceptual structure of system operating. We firstly carry out operation analysis of graph drawing task using a spreadsheet software....
A new statistical descriptor of geometric constraints histogram (GCHD) based on curvature graph for image retrieval is presented in this paper. Through this method, the image contour curvature graph is firstly computed, and the edge and angle geometric constraints based on the curvature graph are extracted. Then the histogram algorithm is applied on the geometric constraints to obtain the statistical...
In this paper we present a new visualization paradigm to represent and assist the understanding of a correlative multi-level graph, a group of interconnected networks. Such a graph is formed via term association mining, and the visualization paradigm consists of three components: terrain surface visualization units, terrain surface arrangement, and terrain surface correlation. We apply this paradigm...
We propose a novel texture synthesis method to a wide variety of texture and any triangulated surface.. According to the relation of the neighboring triangulated surfaces of model, we use a extent first strategy to appoint texture coordinate of each triangulated surface. When the processes of searching and mapping have restricted surfaces, first, we create a minimal texture error of neighboring surfaces...
Fuzzy sets featuring in applications to fuzzy control systems are often required to satisfy specific conditions such as, e.g., convexity or normality. In the same connection, a widespread choice is to work with fuzzy sets whose graphs have triangular shape. The purpose of this paper is to show that the former conditions may be regarded as attempts at approximating the latter choice. Specifically,...
This paper proposes an efficient shape reconstruction method from sectional data in 3-axis Numerical Control (NC) machining. A merge-divide algorithm is proposed to construct triangle meshes for machined surfaces with arbitrary shape and genus. The algorithm is of linear complexity due to the special property of the NC data. The method is used to interference detection and space cutter compensation...
This paper presents a method to solve the problem of common design structure discovery from a large number of CAD models. First, a CAD model is transformed into a face adjacency graph (FAG) and each node of FAG is mapped to a point in two-dimensional plane after representing face shape information with two coordinates. So the shapes of models are directly compared through the point coordinates of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.