18209709
Mesostructure from Specularity
We describe a simple and robust method for surface mesostructure acquisition. Our method builds on the observation that specular reflection is a reliable visual cue for surface mesostructure perception. In contrast to most photometric stereo methods, which take specularities as outliers and discard them, we propose a progressive acquisition system that captures a dense specularity field as the only information for mesostructure reconstruction. Our method can efficiently recover surfaces with fine-scale geometric details from complex real-world objects with a wide variety of reflection properties, including translucent, low albedo, and highly specular objects. We show results for a variety of objects including human skin, dried apricot, orange, jelly candy, black leather and dark chocolate.
15759301
Animating human face under arbitrary illumination
The authors present a method to animate a human face under arbitrary lighting conditions. We first acquire the reflectance models of a human face in various expressions by employing a robot to precisely control the light position. By developing a relighting tool, named LUXMASTER, we achieve great freedom to change the illumination condition and get a variety of photorealistic novel renderings of the human face. Then, we introduce morphing techniques to add the time dimension and produce a clip of facial animation with varying illumination and expression. In order to make the morphing work easily, we design an expressive, intuitive and efficient tool, called FLUIDMAN, which at the same time enables an enormous possibility of visual effects.
12569733
Modern floorplanning based on fast simulated annealing
Unlike classical floorplanning that usually handles only block packing to minimize silicon area, modern VLSI floorplanning typically needs to pack blocks within a fixed die (outline) and additionally considers the packing with block positions and interconnect constraints. Floorplanning with bus planning is one of the most challenging modern floorplanning problems because it needs to consider the constraints with interconnect and block positions simultaneously. We study in this paper two types of modern floorplanning problems: (1) fixed-outline floorplanning and (2) bus-driven floorplanning. Our floorplanner uses the B*-tree floorplan representation and is based on a fast three-stage simulated annealing scheme, called Fast-SA. For fixed-outline floorplanning, we present an adaptive Fast-SA that can dynamically change the weights in the cost function to optimize wirelength under the outline constraint. Experimental results show that our floorplanner can achieve almost 100% success rates efficiently for fixed-outline floorplanning with various aspect ratios, compared to 10%--90% success rates obtained by the most recent works. For the bus-driven floorplanning, we explore the feasibility conditions of the B*-tree with the bus constraints and develop a bus-driven floorplanning algorithm based on the conditions and Fast-SA. Experimental results show that our floorplanner on the average reduces 20% (55%) dead space for the floorplanning with hard (soft) macro blocks, compared with the most recent work. In particular, our floorplanner is more efficient than the previous works.
4650146
A New Coarse-to-Fine Framework for 3D Brain MR Image Registration
Registration, that is, the alignment of multiple images, has been one of the most challenging problems in the field of computer vision. It also serves as an important role in biomedical image analysis and its applications. Although various methods have been proposed for solving different kinds of registration problems in computer vision, the results are still far from ideal when it comes to real world biomedical image applications. For instance, in order to register 3D brain MR images, current state of the art registration methods use a multi-resolution coarse-to-fine algorithm, which typically involves starting with low resolution images and working progressively through to higher resolutions, with the aim to avoid the local maximum "traps". However, these methods do not always successfully avoid the local maximum. Consequently, various rather sophisticated optimization methods are developed to attack this problem. In this paper, we propose a novel viewpoint on the coarse-to-fine registration, in which coarse and fine images are distinguished by different scales of the objects instead of different resolutions of the images. Based on this new perspective, we develop a new image registration framework by combining the multi-resolution method with novel multi-scale algorithm, which could achieve higher accuracy and robustness on 3D brain MR images. We believe this work has great contribution to biomedical image analysis and related applications.
13146679
A Broadcasting Algorithm in Star Graph Interconnection Networks
8131087
Multipath-Based Multicasting Strategies for Wormhole-Routed Star Graph Interconnection Networks
The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we present a multipath-based multicast routing model for wormholerouted star graph networks, propose two efficient multipath routing schemes, and contrast the performance of the proposed schemes with the performance of the scheme presented in our previous work. Both of the two proposed schemes have been proven to be deadlock-free. The first scheme, simplemultipath routing, uses multiple independent paths for concurrent multicasting. The second scheme, two-phase multipath routing, includes two phases: source-to-relay and relay-to-destination. For each phase, multicasting is carried out using simple multipath routing. Experimental results show that, for short and medium messages with small message startup latencies, the proposed schemes reduce multicast latency more efficiently than other schemes.
8043922
Intensionality of modal logic for Robust Ambient Calculus
Abstract Computation with mobility becomes a novel distributed computation paradigm with the development of network technology. The calculus of Mobile Ambient is a widely studied formal mechanism for describing both mobile computing and mobile computation. To improve this process calculus, Robust Mobile Ambient is introduced by providing co-actions. This paper deals with the modal logic for finite fragment of this calculus without communication primitives. In details, we compare standard behavioral equivalence with the equivalence induced by the logic (=L) and with the structural congruence. As a result, we prove the intensionality of the logic and at the same time, an axiomatization for = L is given. The authors thank the three referees for many constructive suggestions and comments.