6236190
Estimation of multiple directional light sources for synthesis of mixed reality images
We present a new method for the detection and estimation of multiple directional illuminants, using a single image of any object with known geometry and Lambertian reflectance. We use the resulting highly accurate estimates to modify virtually the illumination and geometry of a real scene and produce correctly illuminated mixed reality images. Our method obviates the need to modify the imaged scene by inserting calibration objects of any particular geometry, relying instead on partial knowledge of the geometry of the scene. Thus, the recovered multiple illuminants can be used both for image-based rendering and for shape reconstruction. Our method combines information both from the shading of the object and from shadows cast on the scene by the object. Initially we use a method based on shadows and a method based on shading independently. The shadow based method utilizes brightness variation inside the shadows cast by the object, whereas the shading based method utilizes brightness variation on the directly illuminated portions of the object. We demonstrate how the two sources of information complement each other in a number of occasions. We then describe an approach that integrates the two methods, with results superior to those obtained if the two methods are used separately. The resulting illumination information can be used (i) to render synthetic objects in a real photograph with correct illumination effects, and (ii) to virtually re-light the scene.
46437694
Estimation of multiple directional illuminants from a single image
We present a new method for the detection and estimation of multiple directional illuminants, using only one single image of an object with known geometry. It obviates the need to modify the imaged scene by inserting calibration objects of any particular geometry, relying instead on partial knowledge of the geometry of the scene. We first develop our method for the case of a Lambertian sphere with known size, illuminated by a set of directional light sources. A novel and robust way is proposed to segment the surface into regions, with each region illuminated by a different set of sources. Our region-based least-squares method is impervious to noise and missing data, which is crucial to extending the method to arbitrary smooth geometry and to surfaces having both Lambertian and specular properties. We propose a novel methodology that integrates information from shadows and shading in the presence of strong directional sources of illumination, even when significant non-directional sources exist in the scene and the object surface is not Lambertian. We demonstrate experimentally the accuracy of our method, both in detecting the number of light sources and in estimating their directions, by testing on images of a variety of synthetic and real objects.
13511504
Non-Rigid Object Alignment with a Mismatch Template Based on Exhaustive Local Search
Non-rigid object alignment is especially challenging when only a single appearance template is available and target and template images fail to match. Two sources of discrepancy between target and template are changes in illumination and non-rigid motion. Because most existing methods rely on a holistic representation for the alignment process, they require multiple training images to capture appearance variance. We developed a patch-based method that requires only a single appearance template of the object. Specifically, we fit the patch-based face model to an unseen image using an exhaustive local search and constrain the local warp updates within a global warping space. Our approach is not limited to intensity values or gradients, and therefore offers a natural framework to integrate multiple local features, such as filter responses, to increase robustness to large initialization error, illumination changes and non-rigid deformations. This approach was evaluated experimentally on more than 100 subjects for multiple illumination conditions and facial expressions. In all the experiments, our patch-based method outperforms the holistic gradient descent method in terms of accuracy and robustness of feature alignment and image registration.
9142519
Utilizing field usage patterns for Java heap space optimization
This research studies the characteristics of field usage patterns in the SpecJVM98 benchmarks. It finds that multiple object instances of the same class often exhibit different field-usage patterns. Motivated by this observation, we designed a heap compression mechanism that classifies object instances at runtime based on their field-usage patterns and eliminates unused fields to save space. To achieve the maximum space savings while minimizing the space and time overhead, our design combines three interrelated techniques in a novel manner: runtime object instance classification, field virtualization, and bidirectional object layout. An experimental evaluation reveals that this mechanism can reduce the maximum heap occupancy of SpecJVM98 benchmarks by up to 18% and 14% on average while keeping the application execution overhead low.
20945105
Real-Time Moving Vehicle Detection With Cast Shadow Removal in Video Based on Conditional Random Field
This paper presents an approach of moving vehicle detection and cast shadow removal for video based traffic monitoring. Based on conditional random field, spatial and temporal dependencies in traffic scenes are formulated under a probabilistic discriminative framework, where contextual constraints during the detection process can be adaptively adjusted in terms of data-dependent neighborhood interaction. Computationally efficient algorithm has been developed to discriminate moving cast shadows and handle nonstationary background processes for real-time vehicle detection in video streams. Experimental results show that the proposed approach effectively fuses contextual dependencies and robustly detects moving vehicles under heavy shadows even in grayscale video.
2947494
High Resolution Tracking of Non-Rigid Motion of Densely Sampled 3D Data Using Harmonic Maps
Abstract
We present a novel automatic method for high resolution, non-rigid dense 3D point tracking. High quality dense point clouds of non-rigid geometry moving at video speeds are acquired using a phase-shifting structured light ranging technique. To use such data for the temporal study of subtle motions such as those seen in facial expressions, an efficient non-rigid 3D motion tracking algorithm is needed to establish inter-frame correspondences. The novelty of this paper is the development of an algorithmic framework for 3D tracking that unifies tracking of intensity and geometric features, using harmonic maps with added feature correspondence constraints. While the previous uses of harmonic maps provided only global alignment, the proposed introduction of interior feature constraints allows to track non-rigid deformations accurately as well. The harmonic map between two topological disks is a diffeomorphism with minimal stretching energy and bounded angle distortion. The map is stable, insensitive to resolution changes and is robust to noise. Due to the strong implicit and explicit smoothness constraints imposed by the algorithm and the high-resolution data, the resulting registration/deformation field is smooth, continuous and gives dense one-to-one inter-frame correspondences. Our method is validated through a series of experiments demonstrating its accuracy and efficiency.

12687767
Comments on "Estimation of frequencies and damping factors by two-dimensional ESPRIT type methods"
For original paper, see Rouquette and Najim (IEEE Trans. Signal Process., vol.49, no.1, p.237-45, 2001).The original authors present two high-resolution approaches to estimate two-dimensional (2-D) signal parameters. The first approach decomposes the 2-D estimation problem into two one-dimensional (1-D) ones, estimates the 1-D frequencies with the MEMP method, and then forms correct pairs using a new pairing scheme introduced in Vanpoucke et al. (1994). The second method (the 2-D ESPRIT method) directly estimates the 2-D frequencies. It is shown that both methods are more accurate than the related methods. The present authors note that the original paper appears to have a key error in the permutation matrix specification of the first method. In this comment, they derive the correct one with the performance simulations.
206606945
Self-organization Data Gathering for Wireless Sensor Networks
Sensor networks have attracted much attention in the recent years for its wide applications in biology, medicine, security and battlefield, etc. Data gathering is one of the most important operations in wireless sensor networks. In this paper, we present an energy-delay efficient data gathering protocol, SODG, for sensor networks while taking the transmission interference into considerations. The significance of this proposal is that it is fully localized and distributed, and only depends on the one-hop neighbors’ information. To minimize the delay, the parallel transmissions are permitted with interference- free guaranteed. The experimental simulations show that our protocol is energy- delay efficient. Especially, SODG protocol improves about 64% over PEGASIS on energy consumption, and about 80% over chain-based protocols on delay.
3104032
Robot Navigation by Waypoints
In this paper we propose a novel waypoint-based robot navigation method that combines reactive and deliberative actions. The approach uses reactive exploration to generate waypoints that can then be used by a deliberative system to plan future movements through the same environment. The waypoints are used largely to provide the interface between reactive and deliberative navigation and a range of methods could be used for either type of navigation. In the current work, an incremental decision tree method is used to navigate the robot reactively from the specified initial position to its destination avoiding obstacles in its path and a genetic algorithm method is used to perform the deliberative navigation. The new method is shown to have a number of practical advantages. Firstly, in contrast with many deliberative approaches, complete knowledge of the environment is not required, nor is it necessary to make assumptions regarding the geometry of obstacles. Secondly, the presence of a reactive navigator means it is always possible to continue directed movements in unknown or changing environments or when time constraints become particularly demanding. Thirdly, the use of waypoints allows escape from certain obstacle configurations that would normally trap robots navigated under the control of purely reactive methods. In addition, the results presented in this paper from a number of realistic simulated environments show that the adoption of waypoints significantly reduces the time to calculate a deliberative path.
121024775
Arbitrarily smooth orthogonal nonseparable wavelets in R 2
For each $r\in\N$, we construct a family of bivariate orthogonal wavelets with compact support that are nonseparable and have vanishing moments of order r or less. The starting point of the construction is a scaling function that satisfies a dilation equation with special coefficients and a special dilation matrix M: the coefficients are aligned along two adjacent rows, and $\detwo$. We prove that if $\M^2=\pm 2I$, e.\,g., %%$\M=\ourmtx$ or $\M=\qsymtx$, $M=({0\,\,2 \atop 1\,\,0})$ or $M=({1\,\,\phantom{-}1 \atop 1\,\,-1})$, then the smoothness of the wavelets improves asymptotically by $1-\frac{1}{2}\log_23 \approx 0.2075$ when r is incremented by 1. Hence they can be made arbitrarily smooth by choosing r large enough.
7846558
T1DBase, a community web-based resource for type 1 diabetes research
T1DBase (http://T1DBase.org) is a public website and database that supports the type 1 diabetes (T1D) research community. The site is currently focused on the molecular genetics and biology of T1D susceptibility and pathogenesis. It includes the following datasets: annotated genome sequence for human, rat and mouse; information on genetically identified T1D susceptibility regions in human, rat and mouse, and genetic linkage and association studies pertaining to T1D; descriptions of NOD mouse congenic strains; the Beta Cell Gene Expression Bank, which reports expression levels of genes in beta cells under various conditions, and annotations of gene function in beta cells; data on gene expression in a variety of tissues and organs; and biological pathways from KEGG and BioCarta. Tools on the site include the GBrowse genome browser, site-wide context dependent search, Connect-the-Dots for connecting gene and other identifiers from multiple data sources, Cytoscape for visualizing and analyzing biological networks, and the GESTALT workbench for genome annotation. All data are open access and all software is open source.