Results 1  10
of
83
Image analogies
, 2001
"... Figure 1 An image analogy. Our problem is to compute a new “analogous ” image B ′ that relates to B in “the same way ” as A ′ relates to A. Here, A, A ′ , and B are inputs to our algorithm, and B ′ is the output. The fullsize images are shown in Figures 10 and 11. This paper describes a new framewo ..."
Abstract

Cited by 353 (8 self)
 Add to MetaCart
Figure 1 An image analogy. Our problem is to compute a new “analogous ” image B ′ that relates to B in “the same way ” as A ′ relates to A. Here, A, A ′ , and B are inputs to our algorithm, and B ′ is the output. The fullsize images are shown in Figures 10 and 11. This paper describes a new framework for processing images by example, called “image analogies. ” The framework involves two stages: a design phase, in which a pair of images, with one image purported to be a “filtered ” version of the other, is presented as “training data”; and an application phase, in which the learned filter is applied to some new target image in order to create an “analogous” filtered result. Image analogies are based on a simple multiscale autoregression, inspired primarily by recent results in texture synthesis. By choosing different types of source image pairs as input, the framework supports a wide variety of “image filter ” effects, including traditional image filters, such as blurring or embossing; improved texture synthesis, in which some textures are synthesized with higher quality than by previous approaches; superresolution, in which a higherresolution image is inferred from a lowresolution source; texture transfer, in which images are “texturized ” with some arbitrary source texture; artistic filters, in which various drawing and painting styles are synthesized based on scanned realworld examples; and texturebynumbers, in which realistic scenes, composed of a variety of textures, are created using a simple painting interface.
Robust Distributed Network Localization with Noisy Range Measurements
, 2004
"... This paper describes a distributed, lineartime algorithm for localizing sensor network nodes in the presence of range measurement noise and demonstrates the algorithm on a physical network. We introduce the probabilistic notion of robust quadrilaterals as a way to avoid flip ambiguities that otherw ..."
Abstract

Cited by 295 (19 self)
 Add to MetaCart
This paper describes a distributed, lineartime algorithm for localizing sensor network nodes in the presence of range measurement noise and demonstrates the algorithm on a physical network. We introduce the probabilistic notion of robust quadrilaterals as a way to avoid flip ambiguities that otherwise corrupt localization computations. We formulate the localization problem as a twodimensional graph realization problem: given a planar graph with approximately known edge lengths, recover the Euclidean position of each vertex up to a global rotation and translation. This formulation is applicable to the localization of sensor networks in which each node can estimate the distance to each of its neighbors, but no absolute position reference such as GPS or fixed anchor nodes is available. We implemented the algorithm on a physical sensor network and empirically assessed its accuracy and performance. Also, in simulation, we demonstrate that the algorithm scales to large networks and handles realworld deployment geometries. Finally, we show how the algorithm supports localization of mobile nodes.
ICP Registration using Invariant Features
, 2002
"... This paper investigates the use of Euclidean invariant features in a generalization of iterative closest point registration of range images. Pointwise correspondences are chosen as the closest point with respect to a weighted linear combination of positional and feature distances. It is shown that u ..."
Abstract

Cited by 90 (0 self)
 Add to MetaCart
This paper investigates the use of Euclidean invariant features in a generalization of iterative closest point registration of range images. Pointwise correspondences are chosen as the closest point with respect to a weighted linear combination of positional and feature distances. It is shown that under ideal noisefree conditions, correspondences formed using this distance function are correct more often than correspondences formed using the positional distance alone. In addition, monotonic convergence to at least a local minimum is shown to hold for this method. When noise is present, a method that automatically sets the optimal relative contribution of features and positions is described. This method trades off error in feature values due to noise against error in positions due to misalignment. Experimental results suggest that using invariant features decreases the probability of being trapped in a local minimum, and may be an effective solution for difficult range image registration problems where the scene is very small compared to the model.
Linear npoint camera pose determination
 ieee Transactions on Pattern Analysis and Machine Intelligence
, 1999
"... AbstractÐThe determination of camera position and orientation from known correspondences of 3D reference points and their images is known as pose estimation in computer vision and space resection in photogrammetry. It is wellknown that from three corresponding points there are at most four algebraic ..."
Abstract

Cited by 82 (2 self)
 Add to MetaCart
AbstractÐThe determination of camera position and orientation from known correspondences of 3D reference points and their images is known as pose estimation in computer vision and space resection in photogrammetry. It is wellknown that from three corresponding points there are at most four algebraic solutions. Less appears to be known about the cases of four and five corresponding points. In this paper, we propose a family of linear methods that yield a unique solution to 4 and 5point pose determination for generic reference points. We first review the 3point algebraic method. Then we present our twostep, 4point and onestep, 5point linear algorithms. The 5point method can also be extended to handle more than five points. Finally, we demonstrate our methods on both simulated and real images. We show that they do not degenerate for coplanar configurations and even outperform the special linear algorithm for coplanar configurations in practice. Index TermsÐPose estimation, space resection, 2D3D image orientation, exterior orientation determination, perspectivenpointproblem, four points, five points. 1
Discovering Structural Regularity in 3D Geometry
, 2008
"... We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an effective algorithm for detecting such repeated geometric patterns in point or meshbased models. Our method assumes no p ..."
Abstract

Cited by 78 (9 self)
 Add to MetaCart
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an effective algorithm for detecting such repeated geometric patterns in point or meshbased models. Our method assumes no prior knowledge of the geometry or spatial location of the individual elements that define the pattern. Structure discovery is made possible by a careful analysis of pairwise similarity transformations that reveals prominent lattice structures in a suitable model of transformation space. We introduce an optimization method for detecting such uniform grids specifically designed to deal with outliers and missing elements. This yields a robust algorithm that successfully discovers complex regular structures amidst clutter, noise, and missing geometry. The accuracy of the extracted generating transformations is further improved using a novel simultaneous registration method in the spatial domain. We demonstrate the effectiveness of our algorithm on a variety of examples and show applications to compression, model repair, and geometry synthesis.
A Framework for Uncertainty and Validation of 3D Registration Methods based on Points and Frames
 Int. Journal of Computer Vision
, 1997
"... In this paper, we propose and analyze several methods to estimate a rigid transformation from a set of 3D matched points or matched frames, which are important features in geometric algorithms. We also develop tools to predict and verify the accuracy of these estimations. The theoretical contributi ..."
Abstract

Cited by 75 (23 self)
 Add to MetaCart
In this paper, we propose and analyze several methods to estimate a rigid transformation from a set of 3D matched points or matched frames, which are important features in geometric algorithms. We also develop tools to predict and verify the accuracy of these estimations. The theoretical contributions are: an intrinsic model of noise for transformations based on composition rather than addition; a unified formalism for the estimation of both the rigid transformation and its covariance matrix for points or frames correspondences, and a statistical validation method to verify the error estimation, which applies even when no "ground truth" is available. We analyze and demonstrate on synthetic data that our scheme is well behaved. The practical contribution of the paper is the validation of our transformation estimation method in the case of 3D medical images, which shows that an accuracy of the registration far below the size of a voxel can be achieved, and in the case of protein substructure matching, where frame features drastically improve both selectivity and complexity. 1.
Segmentation and Interpretation of MR Brain Images: An Improved Active Shape Model
, 1997
"... This paper reports a novel method for fully automated segmentation that is based on description of shape and its variation using Point Distribution Models (PDM). An improvement of the Active Shape procedure introduced by Cootes and Taylor to find new examples of previously learned shapes using PDMs ..."
Abstract

Cited by 58 (6 self)
 Add to MetaCart
This paper reports a novel method for fully automated segmentation that is based on description of shape and its variation using Point Distribution Models (PDM). An improvement of the Active Shape procedure introduced by Cootes and Taylor to find new examples of previously learned shapes using PDMs is presented. The new method for segmentation and interpretation of deep neuroanatomic structures such as thalamus, putamen, ventricular system, etc. incorporates a priori knowledge about shapes of the neuroanatomic structures to provide their robust segmentation and labeling in MR brain images. The method was trained in 8 MR brain images and tested in 19 brain images by comparison to observerdefined independent standards. Neuroanatomic structures in all testing images were successfully identified. Computeridentified and observerdefined neuroanatomic structures agreed well. The average labeling error was 7 \Sigma 3%. Border positioning errors were quite small, with the average border posi...
Robust Rotation and Translation Estimation in Multiview Reconstruction
"... It is known that the problem of multiview reconstruction can be solved in two steps: first estimate camera rotations and then translations using them. This paper presents new robust techniques for both of these steps. (i) Given pairwise relative rotations, global camera rotations are estimated linea ..."
Abstract

Cited by 46 (4 self)
 Add to MetaCart
It is known that the problem of multiview reconstruction can be solved in two steps: first estimate camera rotations and then translations using them. This paper presents new robust techniques for both of these steps. (i) Given pairwise relative rotations, global camera rotations are estimated linearly in least squares. (ii) Camera translations are estimated using a standard technique based on Second Order Cone Programming. Robustness is achieved by using only a subset of points according to a new criterion that diminishes the risk of chosing a mismatch. It is shown that only four points chosen in a special way are sufficient to represent a pairwise reconstruction almost equally as all points. This leads to a significant speedup. In image sets with repetitive or similar structures, nonexistent epipolar geometries may be found. Due to them, some rotations and consequently translations may be estimated incorrectly. It is shown that iterative removal of pairwise reconstructions with the largest residual and reregistration removes most nonexistent epipolar geometries. The performance of the proposed method is demonstrated on difficult wide baseline image sets. 1.
Approximation with Active Bspline Curves and Surfaces
, 2002
"... An active contour model for parametric curve and surface approximation is presented. The active curve or surface adapts to the model shape to be approximated in an optimization algorithm. The quasiNewton optimization procedure in each iteration step minimizes a quadratic function which is built up ..."
Abstract

Cited by 44 (7 self)
 Add to MetaCart
An active contour model for parametric curve and surface approximation is presented. The active curve or surface adapts to the model shape to be approximated in an optimization algorithm. The quasiNewton optimization procedure in each iteration step minimizes a quadratic function which is built up with help of local quadratic approximants of the squared distance function of the model shape and an internal energy which has a smoothing and regularization effect. The approach completely avoids the parametrization problem. We also show how to use a similar strategy for the solution of variational problems for curves on surfaces. Examples are the geodesic path connecting two points on a surface and interpolating or approximating spline curves on surfaces. Finally we indicate how the latter topic leads to the variational design of smooth motions which interpolate or approximate given positions. 1.
POTTMANN H.: Reassembling fractured objects by geometric matching
 TOG
"... We present a system for automatic reassembly of broken 3D solids. Given as input 3D digital models of the broken fragments, we analyze the geometry of the fracture surfaces to find a globally consistent reconstruction of the original object. Our reconstruction pipeline consists of a graphcuts based ..."
Abstract

Cited by 43 (7 self)
 Add to MetaCart
We present a system for automatic reassembly of broken 3D solids. Given as input 3D digital models of the broken fragments, we analyze the geometry of the fracture surfaces to find a globally consistent reconstruction of the original object. Our reconstruction pipeline consists of a graphcuts based segmentation algorithm for identifying potential fracture surfaces, featurebased robust global registration for pairwise matching of fragments, and simultaneous constrained local registration of multiple fragments. We develop several new techniques in the area of geometry processing, including the novel integral invariants for computing multiscale surface characteristics, registration based on forward search techniques and surface consistency, and a nonpenetrating iterated closest point algorithm. We illustrate the performance of our algorithms on a number of realworld examples.