29297649
Shape from Photometric Stereo and Contours
In this work, we propose an alternative approach to 3D shape recovery by combining photometric stereo and shape from contours methods. Surfaces recovered by photometric stereo are aligned, adjusted and merged according to a preliminary 3D model obtained by shape from contours. Comparisons are conducted to evaluate the performances of different methods. It has been found that the proposed approach provides more accurate shape recovery than the photometric stereo and shape from contours methods.
11144392
Integration of Photometric Stereo and Shape from Occluding Contours by Fusing Orientation and Depth Data
In this paper, we have investigated the fusion of surface data obtained by two different surface recovery methods. In particular, we have fused the depth data obtainable by shape from contours and local surface orientation data obtainable by photometric stereo. It has been found that the surface obtained by fusing orientation and depth data is able to yield more precision when compared with the surfaces obtained by either type of data alone.
5472476
Image Stitching - Comparisons and New Techniques
This work describes the steps involved in the generation of a panoramic image, i.e., image acquisition, image registration and image merging. Different approaches for each of these steps are discussed and compared. The resultant images from image registration and image merging are quantitatively evaluated to provide an indication to the performance of the different methods. The methods provided in this work can be used to generate panoramic images for the use of interactive panoramic viewing of images, architectural walk-through, and other applications associated with the modelling of 3D environments.
13521805
A Systematic Approach to Model-Guided Empirical Search for Memory Hierarchy Optimization
The goal of this work is a systematic approach to compiler optimization for simultaneously optimizing across multiple levels of the memory hierarchy. Our approach combines compiler models and heuristics with guided empirical search to take advantage of their complementary strengths. The models and heuristics limit the search to a small number of candidate implementations, and the empirical results provide accurate feedback information to the compiler. In previous work, we propose a compiler algorithm for deriving a set of parameterized solutions, followed by a model-guided empirical search to determine the best integer parameter values and select the best overall solution. This paper focuses on formalizing the process of deriving parameter values, which is a multi-variable optimization problem, and considers the role of AI search techniques in deriving a systematic framework for the search.
40672752
The existence of hyper-L triple-loop networks
14518854
Detecting and mapping thematic changes in transient networks
Research fronts are the forefront of a scientific field timely identifying emerging trends and abrupt changes in scientific literature is not only beneficial for users of digital libraries, but also instrumental for users to trace the movement of a research front. A research front can be seen as a dynamic and transient mapping from the state of the art to its immediate prior art - the intellectual base. Citation and co-citation analysis primarily focuses on the structure and dynamics of the intellectual base, information retrieval and related research mainly focuses on intrinsic properties of text documents. In this article, we describe a novel approach that enables us to detect and visualize the transient relationship over time. Temporal associations between content words connected to a surge of interest in scientific papers and high-impact articles in the intellectual base are identified and visualized as a time-variant network. We apply the approach to the detection of thematic changes over time in information visualization and research in terrorism.
42163647
Nearly optimal one-to-many parallel routing in star networks
Star networks were proposed recently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows that star networks are as versatile as hypercubes. This paper is an effort in the same direction. Based on the well-known paradigms, we study the one-to-many parallel routing problem on star networks and develop an improved routing algorithm that finds n-1 node-disjoint paths between one node and a set of other n-1 nodes in the n-star network. These parallel paths are proven of minimum length within a small additive constant, and our algorithm has an optimal time complexity. This result significantly improves the previous known algorithms for the problem. Moreover, the algorithm well illustrates an application of the orthogonal partition of star networks, which was observed by the original inventors of the star networks but seems generally overlooked in the subsequent study. We should also point out that similar problems are already studied for hypercubes and have proven useful in designing efficient and fault tolerant routing algorithms on hypercube networks.
205000421
A Simple Approach to Implementing Multiplication with Small Tables
Abstract A new approach for implementing multiplication with a small table is presented. This approach is much simpler and thus easier to be implemented.