Eurographics 2016 Additional material accompanying paper This document contains a number of additional re-photography examples. Each example consists of a vintage and contemporary photo pair with corresponding line constraints, the quad-based AAAP re-photo of the contemporary photo and a blend of this result with the vintage photo to better appreciate the match. Images courtesy of nycvintageima...

The QUaD project will measure the cosmic microwave background’s polarization anisotropy from the South Pole beginning in early 2005. This thesis discusses the optical characterization of a single pixel in both the 100 GHz and 150 GHz spectral bands using the QUaD test bed. It describes the methods and results for measuring the pixel’s spectral response, polarization response, spatial response, ...

Although quad-trees are not the most successful strategy in image coding, some generalized subdivision schemes have been proposed recently. This work exploits a moderate generalization of quad-trees where tiles are not restricted to be split in both dimensions, which leads to a previously developed graph of anisotropic tiles called “bush”. An algorithm is developed to find the minimal number of...

We study percolation and Ising models defined on generalizations of quad-trees used in multiresolution image analysis. These can be viewed as trees for which each mother vertex has 2 daughter vertices, and for which daughter vertices are linked together in d-dimensional Euclidean configurations. Retention probabilities / interaction strengths differ according to whether the relevant bond is bet...

It is proved that the internal path length of a d–dimensional quad tree after normalization converges in distribution. The limiting distribution is characterized as a fixed point of a random affine operator. We obtain convergence of all moments and of the Laplace transforms. The moments of the limiting distribution can be evaluated from the recursion and lead to first order asymptotics for the ...

in order to determine the best form factor formula for loblolly pine (pinus taeda l.) plantations in talesh (western guilan province-iran), a number of 110 trees were selected based on their distribution in diameter classes, from 12 to 34 cm (in a two- cm diameter interval). first, several quantitative factors including diameter at breast height, diameter at 0.65 m of height, and diameter at st...

If d = 1, we can simply sort the points and do a binary search; so we can answer the query in time O(log n). We can extend this idea to d dimensions; this leads to famous data structures known as k-d trees and quad trees. Unfortunately, the memory that we need for any of these data structures grows exponentially in d, i.e., n. So, even if d is about 30 it is impossible to run these algorithms o...

Abst rac t . In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced partitioning trees (or wp-trees) for indexing a set of points in Rd. Well-known examples of wp-trees include fed-trees, BBD-trees, pseudo quad trees, and BAR trees. These trees are defined with fixed degree and are thus...

the energy of a graph is equal to the sum of the absolute values of its eigenvalues. two graphs of the same order are said to be equienergetic if their energies are equal. we point out the following two open problems for equienergetic graphs. (1) although it is known that there are numerous pairs of equienergetic, non-cospectral trees, it is not known how to systematically construct any such pa...