27964880
Surface reconstruction from point set using projection operator
Step 1: Lay a grid over the input point set. Step 3: Mark all grid edges with projection vectors at their two ends pointing in opposite directions. Approximate the intersection points between the surface and these edges based on the magnitudes of their projection vectors. Step 4: For each grid cell, calculate a grid center as the average of all intersection points. For each marked edge, connect the centers of its incident cells to make a piece of the surface.
1115065
An interactive tool for fitting surfaces to volume data
MRI and CT scanners have long been used to produce threeWe begin with a volume dataset. In this example, we have a CT scan of a human prostate. There are 256 slices. The figure to the right shows one input slice, along with rectangles that outline the locations of every 10th slice. We perform linear interpolation between each slice in the input dataset, and now we can render arbitrarily oriented image planes. The figure to the right shows one such plane.
42568731
Defining and computing multi-dimensional skeletons
Describing shapes is an important task in graphics and vision. A simple, concise descriptor that captures the essential shape properties of an object would greatly facilitate computer-based understanding of the object and applications such as matching and segmentation. For this reason, medial axes (MA) has become a popular shape descriptor since its introduction by Blum [Blum 1967]. The MA of an N-D object is an (N -- 1)-D geometry centered within the object. For example, the MA of a 2D object consists of medial curves at elongated parts, whereas the MA of a 3D object consists of medial surfaces describing the protrusions on the object.
7638849
Efficient and scalable search on scale-free P2P networks
Unstructured peer-to-peer (P2P) systems (e.g. Gnutella) are characterized by uneven distributions of node connectivity and file sharing. The existence of “hub” nodes that have a large number of connections and “generous” nodes that share many files significantly influences performance of information search over P2P file-sharing networks. In this paper, we present a novel Scalable Peer-to-Peer Search (SP2PS) method with low maintenance overhead for resource discovery in scale-free P2P networks. Different from existing search methods which employ one heuristic to direct searches, SP2PS achieves better performance by considering both of the number of shared files and the connectivity of each neighbouring node. SP2PS enables peer nodes to forward queries to the neighbours that are more likely to have the requested files and also can help in finding the requested files in the future hops. The proposed method has been simulated in different power-law networks with different forwarding degrees and distances. From our analytic and simulation results, SP2PS achieves better performance when compared to other related methods.
694781
A Decentralized Resource Discovery Based on Keywords Combinations and Node Clusters in Knowledge Grid
The organization and discovery of grid resources are foundational and key subjects in grid research. Many research works in this field have presented the solutions to the problem, but few of them are focused on knowledge resources. This paper aims to explore how to support user's knowledge requests submitted in form of multi-keywords. We present a decentralized resource discovery method based on keyword combinations and node clusters. In the method, hot keyword combinations are formed based on user's knowledge requests. Then, grid nodes can be clustered according to these keyword combinations and user's knowledge requests will be transmitted to those clusters that have high correlations with the requests.
15021541
A Scenario-Based Architecture Evaluation Framework for Network Enabled Capability
The vision of service-oriented computing is one of loosely coupled services that create agile applications to encapsulate business objectives and processes. The potential of services to form complex systems of systems, with emergent behaviour, necessitates the need to understand how we can we develop sufficient confidence in their qualities. In this paper we argue that successful development and evolution of service oriented computing is dependent on making informed decisions at the architectural level. This poses a number of challenges concerning how to evaluate such system architectures and the measurements and metrics that are important in their assessment. This paper describes research-in-progress into the development of a scenario-based architectural evaluation framework that allows architectural-level reasoning across systems of systems in the context of Network Enabled Capability: a UK Ministry endeavour designed to achieve enhanced[military] effect through the physical networking and coherent integration of existing and future resources.
13426917
Dependable Dynamic Service Integration on Service-Oriented Peer-to-Peer Networks
For provision of dependable search and rescue capability in dynamic and unpredictable disaster areas, the networked nodes should have the ability to autonomously support and co-operate with each other in a peer-to-peer (P2P) manner to quickly configure any services available on the disaster area to deliver a real-time capability. In this paper, we present an innovative architectural approach which is able to proactively self-diagnose and self-adapt evolution occurring in provision of search and rescue capabilities in service-oriented P2P (ServP2P) networks. This architecture provides flexibility and agility in handling dynamic changes and evolution encountered in the delivery of rescue capability. The experimental results indicate that the proposed approach provides a high-level of reliability and sustainability to achieve dependable service integration for capability provision.
22546600
Fast and robust detection of near-duplicates in web video database
Web video databases tend to contain tremendous near-duplicates with the explosive growth of online videos. How to detect and eliminate these near-duplicates has become an essential problem for Web video storage and indexing. In this paper, we propose a hierarchical approach to solve this problem efficiently and effectively. For an incoming video, firstly we compare global features to exclude videos with large differences. Then pairwise comparison of key-frame level features with more computation cost is performed. For pairwise comparison, we adopt the maximum matching (MM) framework on bipartite graph. Instead of using standard well-known MM algorithm, a simple approximate algorithm of MM and a graph cut algorithm are applied for a higher speed. Experimental results over two databases summing up to more than 20,000 videos demonstrate our algorithmpsilas excellent performance in both speed and accuracy.