A variational approach to problems in calibration of multiple cameras

This paper addresses the problem of calibrating camera parameters using variational methods. One problem addressed is the severe lens distortion in low-cost cameras. For many computer vision algorithms aiming at reconstructing reliable representations of 3D scenes, the camera distortion effects will lead to inaccurate 3D reconstructions and geometrical measurements if not accounted for. A second problem is the color calibration problem caused by variations in camera responses that result in different color measurements and affects the algorithms that depend on these measurements. We also address the extrinsic camera calibration that estimates relative poses and orientations of multiple cameras in the system and the intrinsic camera calibration that estimates focal lengths and the skew parameters of the cameras. To address these calibration problems, we present multiview stereo techniques based on variational methods that utilize partial and ordinary differential equations. Our approach can also be considered as a coordinated refinement of camera calibration parameters. To reduce computational complexity of such algorithms, we utilize prior knowledge on the calibration object, making a piecewise smooth surface assumption, and evolve the pose, orientation, and scale parameters of such a 3D model object without requiring a 2D feature extraction from camera views. We derive the evolution equations for the distortion coefficients, the color calibration parameters, the extrinsic and intrinsic parameters of the cameras, and present experimental results.     

Statistical performance evaluation of biometric authentication systems using random effects models

As biometric authentication systems become more prevalent, it is becoming increasingly important to evaluate their performance. This paper introduces a novel statistical method of performance evaluation for these systems. Given a database of authentication results from an existing system, the method uses a hierarchical random effects model, along with Bayesian inference techniques yielding posterior predictive distributions, to predict performance in terms of error rates using various explanatory variables. By incorporating explanatory variables as well as random effects, the method allows for prediction of error rates when the authentication system is applied to potentially larger and/or different groups of subjects than those originally documented in the database. We also extend the model to allow for prediction of the probability of a false alarm on a "watch-list" as a function of the list size. We consider application of our methodology to three different face authentication systems: a filter-based system, a Gaussian mixture model (GMM)-based system, and a system based on frequency domain representation of facial asymmetry     

Evaluation of amplitude-based sorting algorithm to reduce lung tumor blurring in PET images using 4D NCAT phantom

PURPOSE: develop and validate a PET sorting algorithm based on the respiratory amplitude to correct for abnormal respiratory cycles. METHOD AND MATERIALS: using the 4D NCAT phantom model, 3D PET images were simulated in lung and other structures at different times within a respiratory cycle and noise was added. To validate the amplitude binning algorithm, NCAT phantom was used to simulate one case of five different respiratory periods and another case of five respiratory periods alone with five respiratory amplitudes. Comparison was performed for gated and un-gated images and for the new amplitude binning algorithm with the time binning algorithm by calculating the mean number of counts in the ROI (region of interest). RESULTS: an average of 8.87+/-5.10% improvement was reported for total 16 tumors with different tumor sizes and different T/B (tumor to background) ratios using the new sorting algorithm. As both the T/B ratio and tumor size decreases, image degradation due to respiration increases. The greater benefit for smaller diameter tumor and lower T/B ratio indicates a potential improvement in detecting more problematic tumors.     

Motion mapping and mode decision for MPEG-2 to H.264/AVC transcoding

This paper describes novel transcoding techniques aimed for low-complexity MPEG-2 to H.264/AVC transcoding. An important application for this type of conversion is efficient storage of broadcast video in consumer devices. The architecture for such a system is presented, which includes novel motion mapping and mode decision algorithms. For the motion mapping, two algorithms are presented. Both efficiently map incoming MPEG-2 motion vectors to outgoing H.264/AVC motion vectors regardless of the block sizes that the motion vectors correspond to. In addition, the algorithm maps motion vectors to different reference pictures, which is useful for picture type conversion and prediction from multiple reference pictures. We also propose an efficient rate-distortion optimised macroblock coding mode decision algorithm, which first evaluates candidate modes based on a simple cost function so that a reduced set of candidate modes is formed, then based on this reduced set, we evaluate the more complex Lagrangian cost calculation to determine the coding mode. Extensive simulation results show that our proposed transcoder incorporating the proposed algorithms achieves very good rate-distortion performance with low complexity. Compared with the cascaded decoder-encoder solution, the coding efficiency is maintained while the complexity is significantly reduced.

Utilizing endoscopic technology to reveal real-time proteomic alterations in response to chemoprevention

Cancer chemoprevention approaches use either pharmacological or dietary agents to impede, arrest or reverse the carcinogenic process. Although several agents have shown effectiveness against colon cancer, present intervention strategies provide only partial reduction. In this study, we utilized high-resolution endoscopy to obtain colon tumor biopsy specimens from Apc mutant mice before and after 2-wk sulindac intervention. To acquire information beyond genomics, proteome analysis using the ProteomeLab PF2D platform was implemented to generate 2-D protein expression maps from biopsies. Chromatograms produced common signature profiles between sulindac and nonsulindac treated samples, and contrasting profiles termed "fingerprints". We selected a double peak that appeared in tumor biopsies from sulindac-treated mice. Further analyses using MS sequencing identified this protein as histone H2B. The location of H2B in the 1(st) dimension strongly suggested PTM, consistent with identification of two oxidized methionines. While further studies on sulindac proteomic fingerprints are underway, this study demonstrates the feasibility and advantages of "real-time" proteomic analysis for obtaining information on biomarker discovery and drug activity that would not be revealed by a genetic assay. This approach should be broadly applicable for assessing lesion responsiveness in a wide range of translational and human clinical studies.     

Performance of a modified polling strategy for broadband wireless lans in a harsh fading environment

In this paper, we consider a radio-based communication network in which a single, high speed radio channel is shared by some plurality of small portable notebooks. Such a system has the potential to provide LAN-like service within buildings, allowing the portable "notebooks" to access the CPU and data resources of a wired network. In this harsh indoor fading environment, a base-station approach is used. We propose a modified polling scheme for the indoor radio LAN channel. The base station regularly polls each remote, in response to which the remote either generates a "keep alive" packet or a request packet, allowing the base to fetch the requested information from the wired network and scheduling a reply to that remote. The efficiency of such a scheme is studied and the expected turn-around delay as a function of network loading is approximately obtained. A system stability under such a scheme is derived. For a polling cycle of 20 milliseconds and a network containing 10 or 50 users, for example, the maximum link efficiency is 97% and 87%, respectively, assuming that the link speed is 5 Mbps.The Center for Telecommunications Research is an NSF Engineering Research Center. This work was supported under NSF grant #ECD88-1 1111.     

Toxicity of waters from the St. Lawrence River at Massena Area-of-Concern to the plankton species Selenastrum capricornutum and Ceriodaphnia dubia

In 1972, the US and Canada committed to restore the chemical, physical, and biological integrity of the Great Lakes Ecosystem under the first Great Lakes Water Quality Agreement. During subsequent amendments, part of the St. Lawrence River at Massena NY, and segments of three tributaries, were designated as one Area of Concern (AOC) due to various beneficial use impairments (BUIs). Plankton beneficial use was designated impaired within this AOC because phytoplankton and zooplankton population data were unavailable or needed “further assessment”. Contaminated sediments from industrial waste disposal have been largely remediated, thus, the plankton BUI may currently be obsolete. The St. Lawrence River at Massena AOC remedial action plan established two criteria which may be used to assess the plankton BUI; the second states that, “in the absence of community structure data, plankton bioassays confirm no toxicity impact in ambient waters”. This study was implemented during 2011 to determine whether this criterion was achieved. Acute toxicity and chronic toxicity of local waters were quantified seasonally using standardized bioassays with green alga Selenastrum capricornutum and water flea Ceriodaphnia dubia to test the hypothesis that waters from sites within the AOC were no more toxic than were waters from adjacent reference sites. The results of univariate and multivariate analyses confirm that ambient waters from most AOC sites (and seasons) were not toxic to both species. Assuming both test species represent natural plankton assemblages, the quality of surface waters throughout most of this AOC should not seriously impair the health of resident plankton communities.     

Probabilistic resource allocation in heterogeneous distributed systems with random failures

The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of compute nodes may change spontaneously over time. Resource-allocation policies designed for such systems should maximize the performance and, at the same time, be robust against failure and recovery of compute nodes. Such a policy, based on the concepts of the Derman–Lieberman–Ross theorem, is proposed in this work, and is applied to a simulated model of a dedicated system composed of a set of heterogeneous image processing servers. Assuming that each image results in a “reward” if its processing is completed before a certain deadline, the goal for the resource allocation policy is to maximize the expected cumulative reward. An extensive analysis was done to study the performance of the proposed policy and compare it with the performance of some existing policies adapted to this environment. Our experiments conducted for various types of task-machine heterogeneity illustrate the potential of our method for solving resource allocation problems in a broad spectrum of distributed systems that experience high failure rates.