3245287
Study and Comparison of 3D Face Generation
Four techniques to generate 2.5 D face surfaces from a set of 2D images are compared using both rendering results and surface distance comparison for Orthogonal Views (OV), Photometric Stereo (PSM), Automatic and Interactive Binocular Stereo (ABS and IBS) using Dur database of 20 face surfaces. PSM obtains the best rendered surfaces.
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.
15344875
Albedo recovery using a photometric stereo approach
This paper describes a method for the estimation of surface reflectance values using a photometric stereo approach. Evaluations show that surfaces rendered with reflectance values calculated by the proposed method have more realistic appearances than those with constant albedo.
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.
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.
46218447
Parallelizing Progressive Computation for Skyline Queries in Multi-disk Environment
Given a set of d-dimensional points, skyline query returns the points that are not dominated by any other point on all dimensions. In this paper, we study an interesting scenario of skyline retrieval, where multi-dimensional points are distributed among multiple disks. Efficient algorithms for parallelizing progressive skyline computation are developed, using the parallel R-trees. The core of our scheme is to visit more entries from some disks simultaneously and enable effective pruning strategies with dominance checking to prune away the non-qualifying entries. Extensive experiments with synthetic data confirm that our proposed algorithms are both efficient and scalable.
2965625
Visualizing the evolution of a subject domain: a case study
We explore the potential of information visualization techniques in enhancing existing methodologies for domain analysis and modeling. In this case study, we particularly focus on visualizing the evolution of the hypertext field based on author co-citation patterns, including the use of a sliding-window scheme to generate a series of annual snapshots of the domain structure, and a factor-referenced color-coding scheme to highlight predominant specialties in the field.
40672752
The existence of hyper-L triple-loop networks
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.
7360354
Fast performance-driven optimization for buffered clock trees based on Lagrangian relaxation
Delay, power, skew, area, and sensitivity are the most important concerns in current clock-tree design. We present in this paper an algorithm for simultaneously optimizing the above objectives by sizing wires and buffers in clock trees. Our algorithm, based on Lagrangian relaxation method, can optimally minimize delay, power, and area simultaneously with very low skew and sensitivity. With linear storage overall and linear runtime per iteration, our algorithm is extremely economical, fast, and accurate; for example, our algorithm can solve a 6201-wire-segment clock-free problem using about 1-minute runtime and 1.3-MB memory and still achieve pico-second precision on an IBM RS/6000 workstation.