Accurate Feature Extraction and Control Point Correction for Camera Calibration with a Mono-Plane Target

The paper addresses two problems related to 3D camera calibration using a single mono-plane calibration target with circular control marks. The first problem is how to compute accurately the locations of the features (ellipses) in images of the target. Since the structure of the control marks is known beforehand, we propose to use a shape-specific searching technique to find the optimal locations of the features. Our experiments have shown this technique generates more accurate feature locations than the state-of-the-art ellipse extraction methods. The second problem is how to refine the control mark locations with unknown manufacturing errors. We demonstrate in a case study, where the control marks are laser printed on a A4 paper, that the manufacturing errors of the control marks can be compensated to a good extent so that the remaining calibration errors are reduced significantly. 1

The structure of red-infrared scattergrams of semivegetated landscapes

A physically based linear stochastic geometric canopy soil reflectance model is presented for characterizing spatial variability of semivegetated landscapes at subpixel and regional scales. Landscapes are conceptualized as stochastic geometric surfaces, incorporating not only the variability in geometric elements, but also the variability in vegetation and soil background reflectance which can be important in some scenes. The model is used to investigate several possible mechanisms which contribute to the often observed characteristic triangular shape of red-infrared scattergrams of semivegetated landscapes. Scattergrams of simulated and semivegetated scenes are analyzed with respect to the scales of the satellite pixel and subpixel components. Analysis of actual aerial radiometric data of a pecan orchard is presented in comparison with ground observations as preliminary confirmation of the theoretical results

Fundamental remote sensing science research program. Part 1: Status report of the mathematical pattern recognition and image analysis project

The Mathematical Pattern Recognition and Image Analysis (MPRIA) Project is concerned with basic research problems related to the study of the Earth from remotely sensed measurement of its surface characteristics. The program goal is to better understand how to analyze the digital image that represents the spatial, spectral, and temporal arrangement of these measurements for purposing of making selected inference about the Earth

Detection of curved edges at subpixel accuracy using deformable models

One approach to the detection of curves at subpixel accuracy involves the reconstruction of such features from subpixel edge data points. A new technique is presented for reconstructing and segmenting curves with subpixel accuracy using deformable models. A curve is represented as a set of interconnected Hermite splines forming a snake generated from the subpixel edge information that minimizes the global energy functional integral over the set. While previous work on the minimization was mostly based on the Euler-Lagrange transformation, the authors use the finite element method to solve the energy minimization equation. The advantages of this approach over the Euler-Lagrange transformation approach are that the method is straightforward, leads to positive m-diagonal symmetric matrices, and has the ability to cope with irregular geometries such as junctions and corners. The energy functional integral solved using this method can also be used to segment the features by searching for the location of the maxima of the first derivative of the energy over the elementary curve set

A topological sampling theorem for Robust boundary reconstruction and image segmentation

AbstractExisting theories on shape digitization impose strong constraints on admissible shapes, and require error-free data. Consequently, these theories are not applicable to most real-world situations. In this paper, we propose a new approach that overcomes many of these limitations. It assumes that segmentation algorithms represent the detected boundary by a set of points whose deviation from the true contours is bounded. Given these error bounds, we reconstruct boundary connectivity by means of Delaunay triangulation and α-shapes. We prove that this procedure is guaranteed to result in topologically correct image segmentations under certain realistic conditions. Experiments on real and synthetic images demonstrate the good performance of the new method and confirm the predictions of our theory

Frame Combination Techniques for Ultra High-Contrast Imaging

We summarize here an experimental frame combination pipeline we developed for ultra high-contrast imaging with systems like the upcoming VLT SPHERE instrument. The pipeline combines strategies from the Drizzle technique, the Spitzer IRACproc package, and homegrown codes, to combine image sets that may include a rotating field of view and arbitrary shifts between frames. The pipeline is meant to be robust at dealing with data that may contain non-ideal effects like sub-pixel pointing errors, missing data points, non-symmetrical noise sources, arbitrary geometric distortions, and rapidly changing point spread functions. We summarize in this document individual steps and strategies, as well as results from preliminary tests and simulations.Comment: 9 pages, 4 figures, SPIE conference pape

Perturbation theory for anisotropic dielectric interfaces, and application to sub-pixel smoothing of discretized numerical methods

We derive a correct first-order perturbation theory in electromagnetism for cases where an interface between two anisotropic dielectric materials is slightly shifted. Most previous perturbative methods give incorrect results for this case, even to lowest order, because of the complicated discontinuous boundary conditions on the electric field at such an interface. Our final expression is simply a surface integral, over the material interface, of the continuous field components from the unperturbed structure. The derivation is based on a "localized" coordinate-transformation technique, which avoids both the problem of field discontinuities and the challenge of constructing an explicit coordinate transformation by taking a limit in which a coordinate perturbation is infinitesimally localized around the boundary. Not only is our result potentially useful in evaluating boundary perturbations, e.g. from fabrication imperfections, in highly anisotropic media such as many metamaterials, but it also has a direct application in numerical electromagnetism. In particular, we show how it leads to a sub-pixel smoothing scheme to ameliorate staircasing effects in discretized simulations of anisotropic media, in such a way as to greatly reduce the numerical errors compared to other proposed smoothing schemes.Comment: 10 page

Efficient Regularization of Squared Curvature

Curvature has received increased attention as an important alternative to length based regularization in computer vision. In contrast to length, it preserves elongated structures and fine details. Existing approaches are either inefficient, or have low angular resolution and yield results with strong block artifacts. We derive a new model for computing squared curvature based on integral geometry. The model counts responses of straight line triple cliques. The corresponding energy decomposes into submodular and supermodular pairwise potentials. We show that this energy can be efficiently minimized even for high angular resolutions using the trust region framework. Our results confirm that we obtain accurate and visually pleasing solutions without strong artifacts at reasonable run times.Comment: 8 pages, 12 figures, to appear at IEEE conference on Computer Vision and Pattern Recognition (CVPR), June 201

Reliable fusion of ToF and stereo depth driven by confidence measures

In this paper we propose a framework for the fusion of depth data produced by a Time-of-Flight (ToF) camera and stereo vision system. Initially, depth data acquired by the ToF camera are upsampled by an ad-hoc algorithm based on image segmentation and bilateral filtering. In parallel a dense disparity map is obtained using the Semi- Global Matching stereo algorithm. Reliable confidence measures are extracted for both the ToF and stereo depth data. In particular, ToF confidence also accounts for the mixed-pixel effect and the stereo confidence accounts for the relationship between the pointwise matching costs and the cost obtained by the semi-global optimization. Finally, the two depth maps are synergically fused by enforcing the local consistency of depth data accounting for the confidence of the two data sources at each location. Experimental results clearly show that the proposed method produces accurate high resolution depth maps and outperforms the compared fusion algorithms