18755002
Color image decomposition and restoration
Meyer has recently introduced an image decomposition model to split an image into two components: a geometrical component and a texture (oscillatory) component. Inspired by his work, numerical models have been developed to carry out the decomposition of gray scale images. In this paper, we propose a decomposition algorithm for color images. We introduce a generalization of Meyer’s G norm to RGB vectorial color images, and use Chromaticity and Brightness color model with total variation minimization. We illustrate our approach with numerical examples.
205396452
Video dejittering by bake and shake
Video jittering occurs when the horizontal lines of video image frames are randomly displaced due to the corruption of synchronization signals or electromagnetic interference during video transmission. Inspired by the recent Bayesian/variational dejittering model of Shen (SIAM J. Appl. Math., vol. 64, pp. 1691-1708, 2004), in the current paper we propose a novel dejittering approach nicknamed 'bake-and-shake.' The bake step is to apply Perona-Malik type nonlinear diffusions to 'melt away' or heat up the jittered video frames, based upon which the shake step is able to optimally estimate the individual line jitters and renormalize the jittered images. Numerical implementation of the bake-and-shake algorithm as well as several computational results are presented.
12383139
Thermal failure simulation for electrical overstress in semiconductor devices
Electrical overstress (EOS) and electrostatic discharge (ESD) constitute one of the most dominant threats to integrated circuits (ICs). A nonlinear 2-D/1-D thermal simulator suitable for ESD/EOS thermal failure modeling in ICs is reported. The unboundedness of the thermal problem is addressed by a special set of boundary conditions, making the thermal simulation task computationally efficient. Simulated power-to-failure vs. time-to-failure relationships (power profiles) for various combinations of major IC structural parameters are presented and compared with experimental data.<<ETX>>
61448634
Single-Image Vignetting Correction
In this paper, we propose a method for determining the vignetting function given only a single image. Our method is designed to handle both textured and untextured regions in order to maximize the use of available information. To extract vignetting information from an image, we present adaptations of segmentation techniques that locate image regions with reliable data for vignetting estimation. Within each image region, our method capitalizes on frequency characteristics and physical properties of vignetting to distinguish it from other sources of intensity variation. The vignetting data acquired from regions are weighted according to a presented reliability measure to promote robustness in estimation. Comprehensive experiments demonstrate the effectiveness of this technique on a broad range of images.
35282259
New algorithms for circuit simulation of device breakdown
Numerical algorithms that enable extension of device models into avalanche breakdown region without disturbing the convergence of modified nodal-analysis-based circuit simulators are introduced. Details of model implementation into circuit simulators are presented along with applications. In particular, circuit-level simulation of nondestructive electrostatic discharge phenomena is discussed along with the time-step size on the simulation of negative resistance structures. >
41829156
Spatiotemporal analysis of face profiles: detection, segmentation, and registration
We use a two-image approach to construct a 3D human facial model for multimedia applications. The images used are those of faces at direct frontal and side views. The selection of the side view from a sequence of facial images is automatically done by applying a spatiotemporal approach to face profile analysis. The extracted side profile is then segmented based on knowledge of known local facial structures. Temporal consistency in the structure of the face under small deviations from the profile image is exploited to improve robustness of the segmentation in the presence of noise and image artifacts. Once the face profile is properly segmented, nine perceptually significant landmarks (fiducial points) on the face are registered based on a local maximum curvature computation. The methods developed are invariant to geometric transformation and are more robust than earlier approaches which rely only on the spatial structure of the face.
2910253
Registration and integration of textured 3-D data
In general, multiple views are required to create a complete 3-D model of an object or of a multi-roomed indoor scene. In this work, we address the problem of merging multiple textured 3-D data sets, each of which corresponds to a different view of a scene or object. There are two steps to the merging process: registration and integration. To register, or align, data sets we use a modified version of the Iterative Closest Point algorithm; our version, which we call color ICP, considers not only 3-D information, but color as well. We show that the use of color decreases registration error by an order of magnitude. Once the 3-D data sets have been registered we integrate them to produce a seamless, composite 3-D textured model. Our approach to integration uses a 3-D occupancy grid to represent likelihood of spatial occupancy through voting. In addition to occupancy information, we store surface normal in each voxel of the occupancy grid. Surface normal is used to robustly extract a surface from the occupancy grid; on that surface we blend textures from multiple views.