text:
|Publication number
|Publication type
|Application number
|Publication date
|Oct 3, 2000
|Filing date
|Jun 9, 1997
|Priority date
|Jun 9, 1997
|Fee status
|Publication number
|Paul J. Ausbeck, Jr.
|Original Assignee
|Ausbeck, Jr.; Paul J.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (7), Referenced by (10), Classifications (5), Legal Events (3)
|External Links: USPTO, USPTO Assignment, Espacenet
The invention relates to image partitioning or segmentation. It is applicable to image processing, image coding, computer graphics, and computer vision. The invention is generally applicable to the problem of approximating two-dimensional fields with polynomial surfaces.
Xiaolin Wu and Yonggang Fang, "Segmentation-Based Image Coding", Proc. Data Compression Conference, Snowbird, Utah, Mar. 30, 1993, pp. 262-271.
Murat Kunt, Michel Benard, and Riccardo Leonardi, "Recent Results in High-Compression Image Coding", IEEE Transactions on Circuits and Systems, Vol. CAS-34, No. 11, November 1987, 1306-1336.
Partitioning is a well known problem in image processing and computer vision. When an image is partitioned each pixel is assigned to one of a multiplicity of domains. In conventional partitioning methods, domain membership is determined by similarity or dissimilarity criteria.
More recently, several methods using two-dimensional image models and global optimization have been developed. Model based partitioning schemes approximate the pixels of each domain with an analytic intensity function. The analytic functions universally used for this purpose are two-dimensional polynomials. Since third order polynomials are sufficient to provide boundary continuity in both the function and its derivative they are typically the largest used.
Model based partitioning methods begin with an initial "seed" partition and make successive transformations that balance model complexity against model fidelity. Model complexity criteria include domain count and domain shape. Model fidelity is typically measured on a per pixel basis with each pixel's actual value being compared with its corresponding modeled value. An overall fidelity measure is obtained by aggregating the individual errors.
For example, a common partitioning operation is domain merge. When two domains are merged, model complexity is reduced since there are fewer domains and less domain periphery. Model fidelity suffers, however, since the combined domain's pixels, formerly modeled with two polynomials, must be modeled with one. The goal of the partitioning process is to make a sequence of transformations that results in a model with an overall balance of complexity and fidelity.
Unfortunately, the problem of determining a transformation's impact on model fidelity is computationally expensive. In many situations the square of the error between each pixel and its modeled value is an appropriate base for fidelity computations. If so, least squares methods can be used to reduce computational complexity.
Least Squares Methods
The principles of least squares data modeling are best illustrated by the widely used linear regression technique. Linear regression is method for fitting data points to a straight line model
y(x)=mx+b. (1)
The model obtained is optimal in the sense that the sum of the squared error between it and the data points ##EQU1## is minimal. Since a local extremum exists where partial derivatives of the error metric are equal to zero, the model parameters can be found by differentiating with respect to each parameter and solving the resulting system of equations ##EQU2##
An important aspect of the least squares error metric is that a solution for the model parameters b and m and the minimum error E can be formulated solely in terms of ensemble statistics. If the following sums are defined ##EQU3## then b and m are calculated as follows ##EQU4## and E is
E=Sy.spsb.2 -2(mSxy +bSy)+2bmSx +m2 Sx.spsb.2 +b2 S. (6)
By formulating the desired result in terms of ensemble statistics, a data point can be added to the set being modeled by simply adding to the ensembles
S:=S+1 Sx :=Sx +xi Sy :=Sy +yi Sx.spsb.2 :=Sx.spsb.2 +xi 2 Sxy :=Sxy +xi yi Sy.spsb.2 :=Sy.spsb.2 +yi 2, (7)
and the new optimum model parameters can be recalculated using (5). Points can be removed from the data set using an analogous subtraction procedure. The key idea is that no matter how many points are being modeled, a point can be added or subtracted and new model parameters calculated using only a fixed number of mathematical operations.
The ensemble technique can be extended to higher order polynomials and many other types of approximating functions. In the general least squares problem the systems of equations derived from differentiation with respect to model parameters are called the normal equations and are commonly represented in matrix form as
A·x=b. (8)
For example the normal equations for the model function
y(x)=ax2 +bx+c (9)
are ##EQU5##
Like any other matrix equation, the normal equations can be solved with standard matrix solution techniques such as Gauss-Jordan elimination or LU decomposition and back substitution. Also, since A is symmetric and positive the Cholesky factorization is applicable. By taking advantage of symmetry, the Cholesky method requires only one half of the number of mathematical operations required by the fastest general elimination technique.
Unfortunately, A is often singular, or nearly so, and standard techniques yield incorrect results. The singular value decomposition is the most widely used technique for solving singular systems. However, on small matrices such as the normal equations the singular value decomposition requires significantly more computation than standard techniques.
A common tactic to make use of least squares methods in image partitioning is to place restrictions on domain shape. An O(1) method for finding the optimal rectilinear or diagonal cut of a domain is disclosed by Wu et al in "Segmentation-Based Image Coding", Proc. Data Compression Conference, Snowbird, Utah, Mar. 30, 1993, pp. 262-271. Methods applicable to evenly splitting and merging square domains modeled by up to third order polynomials are disclosed by Kunt, et al in "Recent Results in High-Compression Image Coding", IEEE Transactions on Circuits and Systems, Vol. CAS-34, No. 11, November 1987, 1306-1336.
Neither of these methods address the underdetermined matrices that occur when fitting higher order polynomials to freeform domains. The method of Wu et al largely avoids the problems by using only linear polynomials. The method of Kunt et al is restricted to squares large enough to support the highest polynomial order in use.
Therefore, there is a need for a method that efficiently measures fidelity changes when making partition transformations that are unrestricted by shape. The method should be stable for complex domain shapes and polynomials up to third order. Further, higher order models should be automatically reduced when there is insufficient data to support them.
Given a piecewise-analytic model of a digital image, the invention relates to a method for determining how certain transformations affect the model's fidelity. The applicable transformations are merging two domains, adding a single pixel or a group of pixels to a domain, removing a single pixel or a group of pixels from a domain, and altering the intensity value of a sample or group of samples from a surface over a domain. Model fidelity is measured in the least squares sense.
The applicable model functions are the maximal two-dimensional polynomials of order one, two, and three. Moment vectors for these polynomials are defined and used to facilitate fidelity measurements. The moment vectors are appropriate for image sizes up to 640×480 pixels when using a single reference coordinate system. A method for efficiently performing two-dimensional coordinate transformations on moment vectors extends their use to arbitrarily sized images.
No restrictions are placed on domain shape, and model complexity is automatically reduced for domains with insufficient support for a given model order. The method for determining the supported model terms is an improvement of the Cholesky factorization for symmetric positive definite systems that extends it to semidefinite systems. The improved factorization is applicable to solving general least squares problems.
FIG. 1 shows how certain elements of a matrix factored in accordance with the present invention become zero or effectively zero.
FIG. 2 is pseudocode for a method for factoring symmetric positive semidefinite matrices in accordance with the present invention.
FIG. 3 is pseudocode for a method for using a matrix factored in accordance with the present invention to obtain the coefficients of an approximating polynomial.
FIG. 4 is pseudocode for a method for initializing a least squares system matrix with a zero order moment vector in accordance with the present invention.
FIG. 5 is pseudocode for a method for initializing a least squares system matrix with a first order moment vector in accordance with the present invention.
FIG. 6 is pseudocode for a method for initializing a least squares parameter vector with a zero order moment vector in accordance with the present invention.
FIG. 7 is pseudocode for a method for initializing a least squares parameter vector with a first order moment vector in accordance with the present invention.
FIG. 8 is pseudocode for a method for solving for the least squares polynomial of a moment vector in accordance with the present invention.
FIG. 9 is pseudocode for a method for adding a pixel contribution to a moment vector in accordance with the present invention.
FIG. 10 is pseudocode for a method for removing a pixel contribution from a moment vector in accordance with the present invention.
FIG. 11 is pseudocode for a method for updating the intensity value of a pixel's contribution to a moment vector in accordance with the present invention.
FIG. 12 is pseudocode for a method for shifting the horizontal coordinate origin of a two-dimensional polynomial in accordance with the present invention.
FIG. 13 is pseudocode for a method for shifting the vertical coordinate origin of a two-dimensional polynomial in accordance with the present invention.
FIG. 14 is pseudocode for a method for shifting the coordinate system of a two-dimensional polynomial in accordance with the present invention.
FIG. 15 is pseudocode for a method for shifting the coordinate system of a two-dimensional moment vector in accordance with the present invention.
FIG. 16 is pseudocode for a method for shifting the horizontal coordinate origin of a two-dimensional moment vector in accordance with the present invention.
FIG. 17 is pseudocode for a method for shifting the vertical coordinate origin of a two-dimensional moment vector in accordance with the present invention.
FIG. 18 shows conventional and central coordinate axis for a digital image.
FIG. 19 is pseudocode for performing bounds checks as part of a forced error computation and preventing moment vector overflow by returning maximal error in accordance with the present invention.
FIG. 20 is pseudocode for determining in accordance with the present invention how model fidelity would be affected by a proposed merger of two domains.
FIG. 21 is pseudocode for determining in accordance with the present invention how model fidelity would be affected by a proposed transfer of pixels from one domain to another.
FIG. 22 is pseudocode in accordance with the present invention for adjusting the value of one of the samples of a sample fitted polynomial and determining the squared error between the adjusted polynomial and the pixels of the domain from which the samples are taken.
Approximating Polynomials
In model based image partitioning, the analytic functions used to approximate pixel intensities in each domain are two-dimensional polynomials. Such polynomials are commonly classified by their highest combined power of x and y. For a given highest power, the polynomial containing all possible terms has the best isotropic behavior. The largest power of a maximal two-dimensional polynomial is its order, symbolically denoted Pmax. The first four maximal two-dimensional polynomials are
f0 (x,y)≡c--, (11)
f1 (x,y)≡cx x+cy y+f0 (x,y), (12)
f2 (x,y)≡cx.spsb.2 x2 +cy.spsb.2 y2 +cxy xy+f1 (x,y), (13)
f3 (x,y)≡cx.spsb.3 x3 +cy.spsb.3 y3 +cx.spsb.2y x2 y+cxy.spsb.2 xy2 +f2 (x,y).(14)
Since the largest polynomial of interest has only ten terms, a useful polynomial representation is a vector of coefficients P. So that lower order vectors can be obtained from higher order vectors by simple truncation, it is desirable to embed each vector in the vector of the next highest order. One such embedding is ##EQU6## Moment Sums
To apply least squares techniques to model based image partitioning, appropriate moment sums must be maintained for each domain. In two dimensions, moment sums are formed from up to two independent variables and one dependent variable. A notation similar to the introductory one dimensional shorthand results if y is used as the second independent variable and z is added as the dependent intensity variable. For example, the sum over all the pixels in a domain of each pixel's x coordinate multiplied by its y coordinate multiplied by its intensity is defined as ##EQU7## and the sum of the square of each pixel's x coordinate multiplied by the cube of its y coordinate is defined as ##EQU8##
To help simplify the following discussion it is convenient to divide the moment sums into two categories, those that contain the intensity variable z and those that do not. The forcing moments encapsulate how the intensity variable z interacts with domain geometry. The natural moments are obtained solely from domain geometry. The sum over a domain of the square of individual pixel intensities ##EQU9## is separately designated the energy moment. U is not needed to solve the normal equations for an approximating polynomial but is needed to obtain the error between the pixel intensities predicted by an approximating polynomial and their actual values.
Moment Vectors
The particular moments that must be maintained for each domain in an image partition are determined by the order of the model driving the partitioning process. Higher order models require more moments than lower order models. As with polynomial coefficients, the most straightforward representation for the required moment sums is a vector. A domain's moment vector is formed from its energy, natural, and forcing moments. It is useful to order the moment sums in such a way that lower order moment vectors are embedded in higher order vectors.
The zero order natural moment vector
contains only one component, the number of pixels comprising a domain. The corresponding forcing moment vector ##EQU10## contains the sum of a domain's pixel values. The zero order moment vector is the concatenation of the energy moment and the zero order natural and forcing moments ##EQU11##
Higher order moment vectors are formed by concatenating additional moments to lower order vectors. Defining the additional portion of the first order natural moment vector as ##EQU12## the first order natural moment vector is ##EQU13##
Similarly the additional portion and totality of the first order forcing moment vector are ##EQU14##
Embedding the zero order vector in the additional portions of the natural and forcing moment vectors yields the first order moment vector ##EQU15##
Extending the notation to higher order yields the second order ##EQU16## and third order ##EQU17## moment vectors. Least Squares Normal Equations
A moment vector is converted to a polynomial coefficient vector by solving an appropriate system of least squares normal equations. In the matrix form of the normal equations, A·x=b, the vector x contains the unknown polynomial coefficients, the vector b contains forcing moments, and the matrix A contains natural moments. The matrix is arranged symmetrically such that the lowest order natural moments comprise its first row and column without replication, and the natural moments whose subscripts correspond to the multiplication of the heads of each intersecting row and column comprise its subsequent rows and columns.
The exact arrangement of the normal equations is dependent upon the arrangement of the unknown polynomial. The Cholesky solution procedure of the next section requires that the polynomial be arranged in such a way that lower order polynomials are embedded in higher order polynomials. One such arrangement is that of the previously defined coefficient vectors P (15). If x is arranged in the same order P, then b is populated with the forcing moments
b0 =F0,b1 =F1,b2 =F2,b3 =F3.(28)
and A is populated with the natural moments as follows ##EQU18## Cholesky Factorization for Positive Semidefinite Matrices
The matrix A of the least squares normal equations is symmetric. It is also positive, but since it can be non-invertible it is not necessarily definite. In other words, the data can be insufficient to support all the coefficients of the modeling function. For example, a domain that is only one pixel wide cannot support polynomial terms containing x, or a domain that is only one pixel tall cannot support terms in y.
For small symmetric positive definite matrices, the fastest known solution technique is the Cholesky factorization
The factorization is performed in place with the factorization taking the place of the original matrix elements. L takes the place of the elements below the diagonal, D appears on the diagonal, and D·LT replaces the elements above the diagonal.
The inner loop of the Cholesky method modifies the elements on or above the diagonal by a sequence of multiply-subtract operations. The factorization proceeds in column major order from the left and then down each row from the top ##EQU19##
After each element above the diagonal is calculated it is reflected symmetrically across the diagonal by dividing by the same row diagonal element ##EQU20##
For example, the order of calculation for a 3×3 matrix is
______________________________________ 0 1 3 1' 2 4, 3' 4' 5______________________________________
with the primed values indicating reflection across the diagonal. The calculation order ensures that the final value of each element of the factorization is available before it is needed for calculation of subsequent elements.
Once A has been factored, in place forward substitution (i increasing) ##EQU21## and backward substitution (i decreasing) ##EQU22## deliver the solution into b.
The diagonal elements, D, of the factorization are the pivots of the original matrix A. If any of the members of D are zero, the factorization fails since division by zero as would occur in (35) is undefined. Further, if any d, is near zero, the resulting factorization can become inaccurate. Small inaccuracies occurring early in the factorization are amplified as the calculation proceeds leading to large errors in the rightmost and bottommost elements of L and D.
Least squares systems on which the Cholesky factorization fails have insufficient data to support all the terms of the approximating polynomial. Unfortunately, it is not always easy to decide which polynomial coefficients are supported by a given a domain. However, with the following improvements, the Cholesky method can both produce accurate solutions and determine the supported polynomial terms.
The first aspect of the Cholesky method of note is that the final value of each element of the factorization is independent of values below or to the right. If the normal equations are organized so the lower order polynomial terms are on the left, the factorization begins the same no matter how large the ultimate polynomial order. The matrices (29)-(32) are arranged to take advantage of this property.
The second important aspect of the Cholesky method is that if the row and column of zero diagonal elements are removed as they occur in the computation, the result is the same as if the zeroed rows and columns were not included initially. Removing a row and column from A has the affect of removing a polynomial term from the approximating polynomial f, which is exactly the desired behavior.
The following property of positive matrices leads to a method for dynamically removing unsupported rows and columns of A.
All the diagonal elements and all of the pivots of a positive definite matrix are positive. The implication of this property is that the diagonal elements of A are non-negative both before and after factorization. Since the lower elements of the factorization are obtained by dividing the corresponding upper element by a positive diagonal element, aif and afi always have the same sign, the product aif ·afi is always positive, and the diagonal elements aii are monotonically reduced (34) as the factorization progresses. This means that the di never become negative and then later return to positivity. Therefore, any negative di is solely due to computational inaccuracies and is set to zero.
Just as computational inaccuracies can lead to negative di, they can conspire to produce di that are positive but are known with insufficient precision to distinguish them from zero. The precision to which a di is known can be determined using the structure of the computation and the numerical precision with which computations are made.
Numerical computations are performed with floating point numbers. Floating point numbers are irregularly spaced samples of the real numbers. For a given precision, the smallest number that can be added to one and produce a number different than one is ε. For numbers larger than one the difference between two successive floating point numbers Nn and Nn+1 is approximately ε·Nn.
This means that before factorization, the initial granularity or uncertainty in each aii is ε·aii. Since the aii are only altered through subtraction the initial uncertainty can never improve. Therefore, if any di falls below its initial uncertainty, u, it is indistinguishable from zero and is set to zero. To guard against pathological error combinations, u is multiplied by a small positive integer κ.
The preceding modifications of the Cholesky factorization ensure that elements of D that are indistinguishable from zero are replaced with zero. The reason for carefully winnowing inaccurate di is that division by zero is used as a signaling event. Any value divided by zero during factorization or back substitution is replaced with zero. Application of this rule has the affect of "removing" the rows and columns of zero di from the computation. Since zero di are associated with underdetermined terms of the approximating polynomial, when zeroed rows and columns are "removed" from the computation the result is the same as if the associated underdetermined parameter was not included in the first place.
FIG. 1 shows how the zero-divide-by-zero rule "removes" rows and columns in an example second order system that has insufficient support for the polynomial term in xy. First the elements of a zeroed row and column are not used outside of that row and column until after the associated diagonal element is zeroed. Second the elements labeled 0' are never used outside of the zeroed row and column. Third, the elements labeled 0" are zeroed by subsequent division by zero (35). Fourth, elements labeled 0'" to the right of the zeroed di are effectively zero since they are always multiplicatively paired (34) with their mirror element 0" below di.
Zero propagation carries through forward and backward substitution as well. The aif of (37) that are in zeroed columns are the elements 0". Finally, division by zero aii in (36) results in a zero polynomial coefficient for a "removed" row and column.
The modified Cholesky factorization for positive semidefinite matrices is shown in FIG. 2. Forward and backward substitution including zero propagation are shown in FIG. 3. The divide by zero check adds ##EQU23## comparisons to factorization and |P| comparisons to substitution. Also added to factorization are |P|-1 multiplications for calculating the lower bound for aii and |P|-1 comparisons for comparing aii against the bound.
Initializing and Solving the Normal Equations
The least squares system matrix A is initialized from a moment vector by scattering natural moments according to equations (29-32). When the Cholesky method of the previous section is used to factor A, only the entries on and above the diagonal need be initialized. The entries below the diagonal are filled during factorization. FIG. 4 and FIG. 5 are procedures for initializing the upper diagonal elements of zero order and first order system matrices respectively. Extension to second and third order systems is straightforward and not shown.
The least squares parameter vector b is initialized by gathering forcing moments according to equations (28). FIG. 6 and FIG. 7 are procedures for using a moment vector to initialize the zero order and first order parameter vectors respectively. Extension to second and third order systems is straightforward and not shown.
Solution for the least squares polynomial of a moment vector entails filling an appropriate system matrix and parameter vector, factoring the system matrix, and performing forward and backward substitution on the parameter vector. The complete procedure is shown in FIG. 8.
Error Computation
The natural and forcing moments are also useful for determining the squared error between a domain's pixels and its approximating surface. The approximating surface does not have to be the least squares surface. The squared error over a domain can be expressed in terms of its energy moment and particular evaluations of the approximating surface using the domain's moments. A forced evaluation of an approximating polynomial over a domain is performed using the polynomial's coefficient vector and the domain's forcing moments. A natural evaluation is performed using a domain's natural moments.
Given a polynomial with coefficient vector c, the zero order forced evaluation over the domain with moment vector S is
Fv0 (S,c):=c-- Sz (38)
and the analogous zero order natural evaluation is
Nv0 (S,c):=c-- (c-- S). (39)
Higher order evaluations are extensions of lower order evaluations. The first, second and third order evaluations are
Fv1 (S,c):=cy Syz +cx Sxz +Fv0(40)
Nv1 (S,c):=cy (2c-- Sy +cy Sy.spsb.2)+cx (2(c-- Sx +cy Sxy)+cx Sx.spsb.2)+Nv0(41)
Fv2 (S,c):=cxy Sxyz +cy.spsb.2 Sy.spsb.2z +cx.spsb.2 Sx.spsb.2z +Fv1 (42)
Nv2 (S,c):=cxy (2(c-- Sxy +cy Sxy.spsb.2 +cx Sx.spsb.2y)+cxy Sx.spsb.2y.spsb.2)+cy.spsb.2 (2(c-- Sy.spsb.2 +cy Sy.spsb.3 +
cx Sxy.spsb.2 +cxy Sxy.spsb.3)+cy.spsb.2 Sy.spsb.4)+cx.spsb.2 (2(c-- Sx.spsb.2 +cy Sx.spsb.2y +cx Sx.spsb.3 +cxy Sx.spsb.3y +cy.spsb.2 Sx.spsb.2y.spsb.2)+cx.spsb.2 Sx.spsb.4)+Nv1(43)
Fv3 (S,c):=cxy.spsb.2 Sxy.spsb.2z +cx.spsb.2y Sx.spsb.2yz +cy.spsb.3 Sy.spsb.3z +cx.spsb.3 Sx.spsb.3z +Fv2 (44)
Nv3 (S,c):=cxy.spsb.2 (2(c-- Sxy.spsb.2 +cy Sxy.spsb.3 +cx Sx.spsb.2y.spsb.2 +cxy Sx.spsb.2y.spsb.3 +cy.spsb.2 Sxy.spsb.4 +cx.spsb.2 Sx.spsb.3y.spsb.2)
+cxy.spsb.2 Sx.spsb.2y.spsb.4)+cx.spsb.2y (2(c-- Sx.spsb.2y +cy Sx.spsb.2y.spsb.2 +cx Sx.spsb.3y +cxy Sx.spsb.3y.spsb.2 +cy.spsb.2 Sx.spsb.2y.spsb.3 +
cx.spsb.2 Sx.spsb.4y +cxy.spsb.2 Sx.spsb.3y.spsb.3)+cx.spsb.2y Sx.spsb.4y.spsb.2)+cy.spsb.3 (2(c-- Sy.spsb.3 +cy Sy.spsb.4 +cx Sxy.spsb.3 +cxy Sxy.spsb.4
+cy.spsb.2 Sy.spsb.5 +cx.spsb.2 Sx.spsb.2y.spsb.3 +cxy.spsb.2 Sxy.spsb.5 +cx.spsb.2y Sx.spsb.2y.spsb.4)
+cy.spsb.3 Sy.spsb.6)cx.spsb.3 (2(c-- Sx.spsb.3 +cy Sx.spsb.3y +cx Sx.spsb.4 +cxy Sx.spsb.4y +cy.spsb.2 Sx.spsb.3y.spsb.2 +cx.spsb.2 Sx.spsb.5 +
cxy.spsb.2 Sx.spsb.4y.spsb.2 +cx.spsb.2y Sx.spsb.5y +cy.spsb.3 Sx.spsb.3y.spsb.3)+cx.spsb.3 Sx.spsb.6)+Nv2.(45)
Given a forced evaluation and a natural evaluation of a particular order, the total squared error between a domain's pixels and its approximating polynomial is
E(S,c):=Sz.spsb.2 -2Fv (S,c)+Nv (S,c). (46)
If the polynomial used to evaluate Fv and Nv is the least squared error polynomial then
Fv (S,c)=Nv (S,c) (47)
and the total squared error is either
EF (S,c):=Sz.spsb.2 -Fv (S,c) (48)
EN (S,c):=Sz.spsb.2 -Nv (S,c). (49)
The forced error computation (48) is much faster than the natural error computation (49) and is preferred if forcing moments are available. If the approximating polynomial is not the least squares polynomial the general error computation (46) must be used.
Moment Vector Alteration Operators
Once a moment vector is available for a given domain, the methods previously described show how a fixed number of mathematical operations can determine the domain's least squares approximating surface and the squared error between that surface and its pixels. These procedures are maximally useful for image partitioning, however, only if new moment vectors can easily be found for domains undergoing transformation. For certain domain transformations, efficient moment vector alteration operators do exist.
A common domain transformation is merging two domains. The corresponding merged moment vector is formed by element by element addition of two moment vectors
merge(B,C):=B+C. (50)
A similar operation forms a new moment vector when one domain is excised from another
excise(B,C):=B-C. (51)
Another important domain transformation is transferring pixels from one domain to another. The corresponding moment vectors are altered by adding and removing the contribution of the transferred pixels. A pixel is contributed to a moment vector by adding the appropriate term in xp i yp j zp k to each of its elements. A pixel contribution is removed from a moment vector by the corresponding subtraction. FIG. 9 shows the pixel addition procedure and FIG. 10 shows the corresponding subtraction procedure. Note that only one multiplication and one addition per moment sum are required.
In certain situations the intensity component of an individual pixel's contribution to a moment vector must be altered. While this can be accomplished by adding and removing the altered pixel, a more efficient procedure is to directly adjust the forcing moments. The zadjust() procedure of FIG. 11 performs the direct adjustment.
Polynomial Evaluation
With appropriate use of moment vectors there is typically no need to evaluate a polynomial during partitioning. However, to reconstruct an image from an extracted model, polynomial evaluation must be performed for each pixel of the image. Because applications such as image coding require rapid model reconstruction, a fast method for performing polynomial evaluation is desirable.
A two-dimensional polynomial is efficiently evaluated at a coordinate (x,y) by extending Horner's rule for single dimensional polynomials to two dimensions
eval0 (c,x,y):=c--, (52)
eval1 (c,x,y):=xcx +ycy +c--, (53)
eval2 (c,x,y):=x(xcx.spsb.2 +cx)+y(ycy.spsb.2 +cy +xcxy)+c--, (54)
eval3 (c,x,y):=x(x(xcx.spsb.3 +cx.spsb.2)+cx)+y(y(ycy.spsb.3 +cy.spsb.2)+cy +x(cxy +xcx.spsb.2y +ycxy.spsb.2)+c--).(55)
Note that just as in one dimension the two-dimensional Horner evaluation only becomes non-trivial for orders higher than one.
Coordinate Transformations
Due to precision constraints, coefficient vectors and moment vectors may have differing reference coordinate systems. Because of this, it is desirable to be able to efficiently transform the reference coordinate system of a coefficient or moment vector. For one-dimensional polynomials the reference coordinate system is efficiently shifted by another method attributed to Horner. This method is most easily extended to two dimensions if shifts in each dimension are performed separately. Two-dimensional extensions of Horner's method for performing shifts in x and y are shown in FIG. 12 and FIG. 13 respectively. A general shift is achieved by sequentially performing shifts in each dimension as shown in FIG. 14.
The fastest procedure for shifting moment vectors results if transformations in each coordinate are made separately and sequentially as in FIG. 15. A variant of Horner's method again yields the most efficient shift procedure. Procedures for shifting two-dimensional moment vectors in x and y are shown in FIG. 16 and FIG. 17 respectively. The first triply nested loop in each procedure shifts the natural moments, the second shifts the forcing moments.
Storage Requirements and Operation Counts
TABLE 1______________________________________Matrix/Vector SizesMatrix/Vector Size Zero One Two Three______________________________________ ##STR1## 1 3 6 10U 1 1 1 1 1F |P| 1 3 6 10N ##STR2## 1 6 15 28M |U| + |F| + |N.vertl ine. 3 10 22 39A |P|2 1 9 36 100______________________________________
Sizes of coefficient and moment vectors and least squares system matrices for each maximum polynomial order are summarized in Table 1. Note that the size of coefficient and moment vectors is O(Pmax 2). This contrasts with vectors obtained from one dimensional polynomials where size is linear in Pmax. The size of the system matrix is O(|P|2) and therefore O(Pmax 4).
Since many moment vectors are typically in use at once, their storage requirements are more critical than those for coefficient vectors or system matrices. The amount of memory needed to hold a vector is dependent upon the element precision. For 32 bit integers, multiply the numeric columns of the table by four to obtain the number of bytes necessary to hold a single vector.
At higher precision either 64 bit integers or double precision floating point numbers require 8 bytes per vector element. Since only the 53 bit mantissa of a double precision number is useful for holding moment sums, use of the equivalent sized integer is preferable. In situations where 53 bit sums are adequate to prevent overflow and available double precision arithmetic is faster than 64 bit integer arithmetic, double precision moment vectors may have utility. With additional implementation effort, storage requirements can be further reduced by using lower precision for smaller moments and higher precision for larger moments.
TABLE 2______________________________________Algorithmic ComplexityAlgorithm Dominant Operation Count Zero One Two Three______________________________________eval |P| - 1 0 2 5 9pshifty ##STR3## 0 1 4 10pshiftx ##STR4## 0 1 4 10pshift ##STR5## 0 2 8 20merge |M| 3 10 22 39excise |M| 3 10 22 39add |M| 3 10 22 39remove |M| 3 10 22 39zupdate |F| + 2 2 5 8 12factor ##STR6## 0 4 35 165substitute |P| · (|P| - 0) 6 15 45F.sub.ν |P| 1 3 6 10N.sub.ν ##STR7## 2 9 27 65mshiftx ##STR8## 0 5 24 66mshifty ##STR9## 0 5 24 66mshift ##STR10## 0 10 48 132______________________________________
Table 2 shows the number of scalar operations performed by each vector or matrix operation. The dominant operation count is formulated in terms of Pmax (or vector sizes previously defined in terms of Pmax) in column 2. The actual operation counts for orders zero through three are shown in columns 3 through 6 respectively. The dominant operation counted in the table is addition for merge() and excise(), and multiply-add for all other operators. For clarity of presentation the operation counts shown in Table 2 may be slightly lower than the actual dominant operation counts. For example the moment vector operators add() and remove() require |M| additions but only |M|-4 multiplications.
Polynomial evaluation is the fastest operation, requiring just less than one operation per polynomial term. Polynomial shifts are O(Pmax 3), but a full shift requires only twice as many operations as evaluation even for order three. The moment vector alteration operators merge(), excise(), and add(), remove(), and zadjust() require approximately one scalar operation per affected vector element.
The Cholesky factorization for positive semidefinite matrices has the highest asymptotic complexity at O(Pmax 6). Substitution is computationally simpler at O(Pmax 4) but makes the combined factorization/substitution cycle even more expensive. Further, the ##EQU24## and |P|-1 divisions performed in factorization and substitution are not counted in Table 2. At order three, factorization/substitution is significantly more computationally expensive than other operations.
The operations necessary to extended the Cholesky method to semidefinite systems also add slightly to the computational requirements. However, the additional divide by zero checks can be handled via an exception mechanism and need only add to the computation when division by zero is actually encountered. For definite systems, the only operations added by the semidefinite extensions are the |P|-1 multiplications and |P|-1 comparisons necessary to manage the lower bound on aii. Overall, the modified Cholesky method is extremely successful in minimizing the cost of solving small semidefinite systems.
One of the most important observations reinforced by Table 2 is that a forced polynomial evaluation is performed using only one more scalar operation than evaluation of the polynomial at a single point. This means that no matter how large a domain may be, if its forcing moments are available and its least squared error polynomial is known, the least squared error over the domain is calculable with only |P|+1 scalar operations. Natural evaluation is more expensive at O(Pmax 4) and should be used only where forcing moments are not available or where the comparison polynomial is not the least squared error polynomial for the domain. Note that a natural evaluation at first appears to require more multiplications than additions. However, multiplication by two is most efficiently implemented with addition. Accounting for times two multiplication as addition evens the requirements.
At O(Pmax 3) the asymptotic complexity of a moment vector shift is identical to a coefficient vector shift. However, moment vector shift requires approximately six times the computational effort of coefficient vector shift and rivals that of factorization/substitution for the polynomial orders of interest.
Precision and Overflow
Since pixel coordinates and values take on only integer values, moment vectors associated with domains in an image partition also take on only integer values. Further, moment vectors typically undergo many transformations during partitioning. For example, if moment vectors are used in a region growing partitioning process, they are typically merged many times.
If floating point numbers are used to store moments the accuracy of the sums can degrade considerably over a sequence of transformations. If integers are used to store moments, vector transformations can be made with perfect accuracy as long as overflow does not occur.
However, if a fixed coordinate system is used, moment sums associated with domains only small distances from the origin can grow quite large. For example, if moments are stored in 32 bit signed integers, pixels can be no further than ##EQU25## rows or columns from the origin before even a single pixel causes overflow of the largest third order moments. Since 70×70 pixels is not a very large image and since domains typically contain more than one pixel even further limiting maximum image size, larger integers must typically be used to hold moments when using a fixed coordinate system.
If each domain has its own centroidal coordinate system then domain size, not domain location determines moment overflow. Integers can still be used to hold moment sums if the coordinate system origin is not exactly centroidal but is located at the nearest round coordinate. A centroidal coordinate system is only advantageous if coordinate transformations are made directly to moment vectors without reconstituting the sums in the new coordinate system.
Efficient procedures for shifting moment vectors without reconstitution have been previously described. Because of the relatively large cost of performing a moment vector shift, the lower vector precision potentially afforded by centroidal moments must be carefully balanced against the increased computation incurred by required vector shifts. In general, the closer a moment vector's coordinate origin is kept to its centroid, the more often it must be shifted. Conversely, the farther it is allowed to drift, the larger its moment sums become. Given a certain precision and a fixed coordinate system, the largest useable image is obtained using the following techniques.
The traditional image processing view of an image places the coordinate origin at the upper left corner with x synonymous with column number and increasing to the right and with y synonymous with row number and increasing downward. The traditional axis is labeled xy on FIG. 18. Relative to the traditional axis, all coordinates and therefore all moment sums are positive. This eliminates the need for a sign bit and unsigned integers can be used for storing moments.
In most useful image size/moment precision combinations the first moments to overflow are the highest order natural moments. The largest natural moments are associated with domains farthest from the coordinate origin. For a given image size, the maximum distance from the coordinate origin is minimized if the origin is placed at the center of the image. The bit savings for central placement is equivalent to the highest power used in forming the moment sums. For first order moments, two magnitude bits are saved and for third order moments six magnitude bits are saved. This savings outweighs the increased cost incurred by requiring a sign bit. On FIG. 18 the central axis, x'y', are placed to retain integer pixel coordinates.
When moments are stored as integers, it is critical to avoid overflow. The most straightforward way to avoid overflow is to use a large enough integer so that the largest moments for a single domain covering the entire image do not overflow. For a given moment order the image size at which overflow becomes possible can be calculated via combinatorial analysis. The largest safe square image size is shown in Table 3 for various combinations of maximum polynomial order and integer size. An * indicates no practical limit to image size. Note that for up to second order moments, very large images can be accommodated by 64 bit integers.
TABLE 3______________________________________Largest Square Image GuaranteeingNo Moment OverflowOrder 32 bits 53 bits 64 bits______________________________________1 474 * *2 82 840 33723 32 210 548______________________________________
Since a single domain encompassing an entire image is not encountered in practical applications, guaranteeing moment integrity by limiting use to safe image size is somewhat wasteful. However, for many commonly encountered images a single background domain may encompass a large fraction of the image. Because of this it is not practical to determine a safe image size other than the single domain safe size.
It is practical, though, to check for moment overflow and disallow moment alteration operations that cause overflow. Disallowing overflow alterations on unsafe images prevents large domains from forming near the image periphery. The effect for images slightly larger than safe size is for partitions to have slightly more domains than might otherwise result.
Since the highest order pure moments will overflow first, to bounds check the natural moments only two comparisons must be made. From an implementation perspective the most convenient place to bounds check is during error computations. Typically a partitioning process creates one or more temporary moment vectors reflecting the result of a proposed transformation. Error computations are then made on the temporary vectors and only the most favorable transformations are performed.
By checking moment bounds and returning a maximum error value, an error computation can prevent transformations that result in overflow. A method for checking for overflow of signed integer moments during a forced error computation is shown in FIG. 19.
Moment bounds checking has been experimentally verified on 640×480 pixel, 256 gray-level images using 64 bit integers to hold third order moments. In the experiments, Cholesky factorization, substitution, and error computation were performed using double precision floating point arithmetic.
The motivation for the initial work on moment operators was the problem of developing a piecewise-smooth image model via domain growing. When growing domains one essential question is posed quite often and therefore needs to be answered quickly.
If two domains are modeled via least squares polynomial surfaces, what is the increase in error if they are merged and modeled by a single polynomial?
The change in error together with additional model complexity criteria determine the order in which domains are merged. Using straightforward methods the number of mathematical operations necessary to calculate ΔE is proportional to the number of pixels in the proposed combination. However, if moment vectors are available for each of the unmerged domains, moment operators can provide ΔE with fixed effort. FIG. 20 shows a procedure for using moment operators to obtain ΔE. The procedure consists of merging two moment vectors, solving three systems of normal equations, and performing three forced error computations. If error measurements for each unmerged domain are previously available, only one solution and one forced error computation are required.
Another application of moment operators arises when optimizing the boundaries of a piecewise-smooth image partition. The shape of a boundary is altered by transferring pixels from one domain to another. Again one question arises that must be answered quickly.
If two domains are modeled via least squares polynomial surfaces, what is the increase in error if a group of pixels is transferred from one domain to another?
The change in error together with additional boundary shape criteria determines which transformations are performed. To calculate ΔE using moment operators, a boundary optimizer first forms a moment vector from the transferring pixels via a succession of add operations on an empty vector. Then, using the transferring moment vector and moment vectors for each initial domain, performs the procedure of FIG. 21. The move-- delta() procedure first forms a new moment vector by merging the moment vector containing the transferring pixels, Mv, and the moment vector of the domain receiving the pixels. A second vector is then formed by excising the transferring moment vector from the donating moment vector. Solutions for the domains before and after transfer are the obtained and ΔE is found using four forced error computations. If error measurements for each original domain are previously available only two solutions and two forced error computations are required.
Another application of moment operators comes from application of the piecewise-smooth image model to lossy image coding. In a partition based image coder it is important to be able to represent a domain's least squares polynomial using a minimum number of bits. Further, using fewer bits should smoothly degrade the representation. One way to achieve these goals is to sample the surface over a domain, quantize and code the sample values, and reconstruct the polynomial from the samples. By critically sampling the surface, only one sample point is needed per polynomial term. A geometry implicit sampler determines the locations of critical sample points solely from a domain's shape. Subject to shape determined restrictions, the sample points are located such that the polynomial reconstructed from the samples is minimally sensitive to changes in sample point values.
Given an adequate sampling, the accuracy of the reconstructed surface is completely determined by the accuracy of the samples. Placing no restrictions on sample precision yields a reconstructed surface closely matching the least squares surface. However, if the sampled values are limited to a relatively small number of intensities via quantization, the accuracy of the reconstructed surface smoothly degrades as the difference between allowable values increases.
Heavy quantization may yield a reconstructed surface that significantly diverges from the least squares surface. The accuracy of the reconstruction may be improved by perturbing one or more sample points into adjacent quantizer buckets. In a procedure that optimizes a sample-reconstructed surface by perturbing sampled values, moment operators are again useful for answering a central question.
If a sample point valve is perturbed, what is the error change between the perturbed surface reconstructed from the samples and the actual data that the surface approximates?
The change in error determines which perturbations are performed. FIG. 22 shows how moment operators can be used to determine ΔE. The adjust-- error() procedure of the figure has several parameters. The parameter MS is a moment vector formed from the sample points. The moment vector MA is formed from the pixel contributions of the entire domain.
Because the natural moments are unaffected by a value adjustment and because the same factored matrix is useable for an entire sequence of value adjustments on the same domain, it is not necessary to factor the sample moment matrix more than once for a single domain. The parameter AS is a matrix that can optionally be filled from the natural moments of the sample points and Cholesky factored. The parameter f determines whether or not the matrix is factored and is set to a nonzero value to force factorization and to zero to reuse a previous factorization.
The adjust-- error() procedure first fills and factors AS if f is nonzero. It then calculates the error between the unperturbed surface and the domain's pixels. If an unperturbed error measurement is previously available, this computation is unnecessary. After adjusting the sampled moment vector to reflect a change in sample point value, the adjusted moments and the factored sample point matrix, AS, are used to reconstruct a polynomial through the sample points. The reconstructed polynomial is then compared against the domain's pixels using a general error computation. Finally, the error change is computed by subtracting the old error from the new.
|Cited Patent
|Filing date
|Publication date
|Jul 2, 1984
|May 26, 1987
|Nec Corporation
|Low bit-rate speech coding with decision of a location of each exciting pulse of a train concurrently with optimum amplitudes of pulses
|Nov 19, 1992
|Nov 23, 1993
|Kabushiki Kaisha Toshiba
|Speech coding and decoding apparatus
|Dec 10, 1993
|Aug 20, 1996
|Leland Stanford Junior University
|System and method for generating attitude determinations using GPS
|Oct 11, 1994
|May 13, 1997
|Hughes Aircraft Company
|Programmable systolic array system arranged in a found arrangement for passing data through programmable number of cells in a time interleaved manner
|Jul 31, 1996
|May 19, 1998
|International Business Machines Corporation
|Computer aided design system
|Dec 29, 1995
|Jun 16, 1998
|At&T Corp
|Monitoring of periodic patterns
|Mar 1, 1996
|Aug 4, 1998
|Her Majesty The Queen In Right Of Canada
|Block decision feedback equalizer
|Citing Patent
|Filing date
|Publication date
|Apr 15, 1999
|Sep 2, 2003
|Synopsys Inc.
|Method and apparatus for representing integrated circuit device characteristics using polynomial equations
|Nov 22, 2002
|Feb 14, 2006
|Intel Corporation
|Building image-based models by mapping non-linear optimization to streaming architectures
|Dec 21, 2001
|Jun 13, 2006
|Intel Corporation
|Surface light field decomposition using non-negative factorization
|Sep 9, 2004
|Jan 29, 2008
|Silicon Optix Inc.
|System and method for representing a general two dimensional spatial transformation
|Nov 22, 2002
|May 27, 2004
|Radek Grzeszczuk
|Building image-based models by mapping non-linear optmization to streaming architectures
|Dec 21, 2001
|Dec 9, 2004
|Radek Grzeszczuk
|Surface light field decomposition using non-negative factorization
|Sep 9, 2004
|Mar 9, 2006
|Silicon Optix Inc.
|System and method for representing a general two dimensional spatial transformation
|Jul 8, 2004
|May 9, 2007
|Image partitioning display method and device
|Sep 9, 2004
|Jun 27, 2007
|Silicon Optix Inc.
|System and method for representing a general two dimensional spatial transformation
|Sep 9, 2004
|Mar 23, 2006
|Silicon Optix Inc.
|System and method for representing a general two dimensional spatial transformation
|U.S. Classification
|382/288, 382/282
|International Classification
|Cooperative Classification
|European Classification
|Apr 21, 2004
|Maintenance fee reminder mailed
|Oct 4, 2004
|Lapse for failure to pay maintenance fees
|Nov 30, 2004
|Expired due to failure to pay maintenance fee
Effective date: 20041003


text:
Nick Carter: Arrested for Bar Flight in Florida
Nick Carter was placed under arrest on Wednesday night.
Nick Carter was placed under arrest on Wednesday night.
After dozens of allegations and months of speculation Bill Cosby is finally facing criminal charges for sexual assault.
Last week, Tyga was allegedly busted cheating on Kylie Jenner with Brazilian model Annalu Cardoso, on the heels of accusations that Tyga has stalked and harassed 14-year-old Molly O'Malia via social media.
Needless to say, Kylie has a lot to be suspicious about these days ...
There was plenty of controversy to be stirred by the 2016 Golden Globe Awards on Sunday night.
Whoa. This Josh Duggar porn star scandal has more twists and turns than a cornfield maze.
Yesterday we learned that Duggar claimed he never met Danica Dillon, much less paid for sex with her or abused her. Now Radar Online reports that he plans to prove his side of the story ...
Oh, Justin Bieber.
We really thought you had cleaned up your act and had decided to just focus on your love life for awhile.
Up until yesterday, executives at TLC haven't said anything about Josh Duggar's scandals beyond a generic statement.
In October of 2015, Institute of Basic Life Principles Bill Gothard was sued by 5 women who claim they were sexually assaulted by the disgraced minister either while they were under his employ, or after they'd come to him seeking help.
In honor of its final season kicking off, American Idol brought back a few fan favorites on its Wednesday night premiere.
Clay Aiken was not one of them. And we have a feeling he won't be making an appearance on the show that made him famous any time soon, either.
Last week, Bill Cosby was charged with felony assault in connection with allegations made by Andrea Constand, one of more than 50 women who have accused Cosby of sexual misconduct.
At first, it seemed that the walls might be closing in on Cosby, as on the day the charges were announced, he was also being investigated for allegedly molesting Chloe Goins, a teenage model he met at the Playboy Mansion in 2008.

subset: commoncrawl


text:
V.20 No.29 | 7/21/2011
Sergio Salvador salvadorphoto.com
Local meats, exotic flavors
By Ari LeVaux
Pastoral paintings of thoughtful, grass-chomping cows adorn the red walls of Albuquerque's brand-new designer burger joint, bRgR. The restaurant's lineup of burger names could double as the course catalog of a tantric yoga ashram, including (in order of the stages of spiritual growth) the Harmonic, Elation, Euphoria, Jubilation, Ecstasy, Nirvana and, finally, Enlightenment. The beef, which is grass-fed and grain-finished, comes from Heritage Ranch, a national beef company that matches local beef producers with consumers, state by state.
V.20 No.22 | 6/2/2011
Sergio Salvador salvadorphoto.com
Five Star Burgers
Meat that's bloody well done
By Ari LeVaux
Last week I explained the new direction this review column is taking, including the fact that I'll no longer be eating or writing about mystery meat. There are many shades of mystery, and this simple-sounding mandate was tested numerous times during my first attempt to follow it at Five Star Burgers—with tasty results.
Today's Events
12 Angry Jurors at Aux Dog Theatre Nob Hill
Twelve jurors' task is to return a verdict against an inner-city youth charged with the murder of his father, where a guilty vote equals a mandatory death sentence.
Spite • hardcore, black metal • Bodysnatcher • deathcore at The Co-Op
Java Bike at Albuquerque Tourism & Sightseeing FactoryMore Recommended Events ››
tartar control and more • 7.20.2016
home | feature | news | film | music | art | food | classifieds | personals | staff | lo-fi | search
© 1996-2016 Weekly Alibi firstname.lastname@example.com
View mobile version


text:
20% off everything. Seriously. Every. Single. Thing. Use CREEPY20
This is the Fluttershy of the Defend Equestria line
my little pony friendship is magic fluttershy
10% off
for joining the Redbubble mailing list
Receive exclusive deals and awesome artist news and content right to your inbox.
Free for your convenience.


text:
A source tells the Baltimore Sun that free agent LT Bryant McKinnie is weighing offers from both the Chargers and Dolphins.
Marcus Mariota told coach Mike Mularkey he would "hand the ball off 40 times" if that's what it took to win games.
Legendary coach Buddy Ryan has died.
The Washington Post's Mike Jones left seventh-round RB Keith Marshall off his 53-man roster projection.
CSN Bay Area's Scott Bair said Amari Cooper was "excellent" in offseason practices.
Mike Wallace believes he is a better receiver today than when he left Pittsburgh.
Coach Pete Carroll said Tyler Lockett is "right in the middle of all our planning."
Walk-year WR Emmanuel Sanders said he is not weighed down by ongoing contract negotiations.
In an interview with ESPN's Vaughn McClure, Sammy Watkins (foot) was noncommittal about his status for training camp.
Hays Carlyon of the Florida Times Union expects Julius Thomas to score double-digit touchdowns this season.
Calvin Johnson said he knew 2015 would be his last year in the NFL before the season began.
ESPN's John Keim reports the Redskins "loved how [Jamison] Crowder looked" in the offseason program.


text:
List all words starting with joes
Only the word joes was found, nothing longer.
Some random words: aah apeek vocable mi liaise lowe if
This is not a dictionary, it's a word game wordfinder.
- Help and FAQ - Examples - Home
Privacy and Cookies Policy - Share - © Copyright 2004-2016 Morewords.com - 4.596mS


text:
Meglio & Associates, Inc.
10 - 19
2.5 - 5 Million
SIC Code:
8999 - Services, Nec
Full company description is available with the free trial.
Additional Info:
This includes Meglio & Associates, Inc. email format addresses with the @meglio.com domain, contacts, phone numbers, linkedin info, cfo employees, and facebook profiles. Meglio & Associates, Inc. is a Materials/manufacturing business with its headquarters based in Chesterfield, MO. If you sign up for our free trial you will see our firstname.lastname@example.com addresses.
Company Background:
Full company description is available with the free trial.
Similar Companies:
ESCO Technologies Inc
ESCO Technologies Inc, a company that works within the Materials/manufacturing industry. Their profile on Lead411 presents significant contact information such as cfo contacts, phone numbers, linkedin data, and Esco Technologies Inc email addresses with the @escotechnologies.comdomain format. They have their head office in Ladue, MO. If you sign up for our free trial you will see our email@example.com addresses.
Katy Industries Inc
This member of the Materials/manufacturing industry is located in Saint Louis, MO and you can find important contact information regarding significant company contacts on their Lead411 profile like linkedin, phone numbers, facebook and cfo details. The profile also contains Katy Industries Inc email addresses which have a domain of @katyindustries.com format. If you sign up for our free trial you will see our email@example.com addresses.
Bull Moose Tube Company
Looking for company data regarding Bull Moose Tube Company's CEO or CFO? Bull Moose Tube Company is part of the Materials/manufacturing field and are located in the area of Chesterfield, MO. Some of the helpful data that can be found on their Lead411 profile include Bull Moose Tube Company email addresses marked by the domain format @bullmoosetube.com. Other contact information could contain cfo names, phone numbers, linkedin profiles, corporate contacts, and facebook profiles. If you sign up for our free trial you will see our firstname.lastname@example.com addresses.
Company Directory > Meglio & Associates, Inc.


text:
2008 All Over Again
As the War on Weed Winds Down, Will Monsanto Be the Winner?
Donald Trump Said to Have Less Money Than He Claimed
After Brexit, European Left Calls for 'Massive Political Opposition'
American Battlefields
By Daniel Domscheit-Berg $15.64
By Abraham H. Foxman $24.95
Billionaire Peter Thiel's $140 million triumph over media site Gawker is part of a trend in which the rich use the media to retaliate against journalists who criticize them.
The power elites that rule America are threatening the First Amendment again—and the assault is not coming just from government agencies.
The online media site owes Hulk Hogan $140 million after it lost a privacy lawsuit earlier this year, but it's hoping to be bought by publishing company Ziff Davis, which could lower its payment.
Facebook's top brass is on board with Peter Thiel, but Amazon's boss thinks he needs to toughen up.
Apparently, where you get your news may predict which presidential candidate you support—and no, we aren't just talking about CNN versus Fox News.
In the business world, Donald Trump is more Rupert Murdoch's peer than his subject—but when it comes to the Republican front-runner's patented propensity to galvanize the press and cultivate his all-important brand, he has, in part, Murdoch to thank.
The man who "has probably done more than any individual to loosen up the mainstream media" is having second thoughts about the click-baiting model of reporting that his media empire helped make standard today.
David Sirota was breaking big stories at Silicon Valley site Pando Daily, so it's a bit odd that he and fellow contributor Ted Rall were abruptly let go without any public explanation.
In what he says may be his "final statement on Earth," Texas death row inmate Ray Jasper offers a plainly devastating take on the American judicial system and on Texas' bizarre law of parties, which allows the state to execute him even though he didn't commit murder.
Shaun Merritt (CC BY-SA 2.0)
What is it about certain big-city mayors succumbing to the siren call of crack rock?
Flickr/Donkey Hokey
Are you poor? Female? A student? A veteran? Planning on growing old? Zach Woods of "The Office"? Well, congratulations! If Mitt Romney is elected president, then you're definitely going to get screwed by his running mate Paul Ryan! Click below to find out how.
Be glad that Wiki-wizard Julian Assange isn't your houseguest, for a number of startling reasons dramatized (or spoofed, rather) in this sendup created by a "Colbert Report" insider, some news-savvy performers and a really awkward Warhol wig.
Screen capture from Gawker.com
Certain vigilant operatives from the blogosphere have caught wind of some key words and phrases that we might soon be hearing on Fox News, as Republican pollster and memo composer Frank Luntz has let fly with his latest manifesto on how to spin the news about happenings on Capitol Hill to the GOP's advantage.
Flickr/Optical Illusion
This just in from the Annals of Utterly Unsurprising Polling Results: Nearly 75 percent of Americans won't be sorry to kiss 2009 goodbye, according to a year-end AP-GfK poll. But wait—there's a silver lining to be found, in that about the same percentage of respondents are optimistic about 2010.
Since President Barack Obama has reportedly decided to linger in Washington for a few more days to make sure Congress passes a health care bill before Christmas Day, he has a little time to play with, or so it would seem ... (continued)
You know it's the end of the year when all those predictable fun lists start coming out. This one is among the more creative: Gawker has put together a memorable pastiche of the year's top feuds, starting with an unexpected ambush on NYT columnist Thomas Friedman.
Wow, there've really been some cheesy opening numbers in Summer Olympics past. Check out this amusing montage of clips from bygone ceremonies and see if you can tell, from the music, the outfits, and the cuts to shady-looking heads of state, when each awe-inspiring spectacle happened.
Picking up on the pro-life theme of "giving a voice to the unborn," cartoonist Gary Cangemi made a lil' creation of his own, "Umbert the Unborn," otherwise known as "the world's most loveable unborn baby (next to yours) ... ," according to his Web site.
View the most popular tags overall?
View all tags?
Posted on Jun 25, 2016
A Progressive Journal of News and Opinion
Publisher Zuade Kaufman | Editor Robert Scheer
About Us | Contact Us | Advertise on Truthdig | User Agreement | Privacy Policy | Comment Policy
© 2016 Truthdig, LLC. All rights reserved.
Website development by Hop Studios


text:
I have installed the latest Windows 10 Pro on my Surface Pro 3 and configured OneDrive for the first time. The app stucked at "Getting started with OneDrive" notification and the setup wizard showed the "There was a problem with connecting to OneDrive. Check your Internet connection, then try again." error message. But other programs accessed the internet well and I could surf website. Continue reading
How to use/enable Driver Verifier Manager in Windows 10
Driver Verifier Manager is a built-in tool to identify problematic drivers and locate the fault in Windows 10/8.1. If the drivers are corrupted, your machine may run into Blue Screen of Death or stop errors and this helpful app can help you verify lesser or minimum number of drivers in a single session quickly. Here are the step-by-step tips for using it to troubleshoot, and resolve common device problem. Continue reading
Active domain services currently unavailable for Windows 10 printer
I had added my HP OfficeJet 4635 Printer correctly in control panel and set it as default device but was still unable to print from my Surface Pro 3 tablet running Windows 10. When I opened Office 2013 components Excel, Word or PowerPoint and tried to print a documents, it didn't detect the device and poped up the error message "Find in the Directory. Active Directory Domain Services is currently unavailable". Any solutions to get it working? Continue reading
How to fix Cannot Install QuickTime in Windows 10
QuickTime extensible multimedia framework allows users to view lots range of file formats of Internet video, HD movie trailers, as well as it is relied with many editing or player applications such as Adobe After Effects, Adobe Premiere Elements and GoPro Studio. However, When I tried to install the latest version 7.7.8 on my Surface Pro 4 running the latest Windows 10 Pro, it poped up the alert "Quicktime 7 requires that your computer is running Windows Vista or Windows 7″ and is not compatible. Any way to get it working? Continue reading
Create shared network map or drive in Windows 10/8.1
I was able to create a network map in the "Network & Sharing Center" of Windows 7. However, after my computer upgraded to Windows 10, I could not find the same feature and it is missing. Is there any way to get back the extremely valuable tool to use the shortcut? Continue reading
How to disable/remove Media device in This PC on Windows 10/8.1
I have added the Folders of Documents, Pictures, and some of my Media devices from network under This PC (Computer) in navigation pane of File Explorer, and that worked fine. Now I would like to delete the media icons from there and right click them to choose Remove device option, but they keep appearing after restart. How can I resolve the problem? Continue reading
Increase number of fail attempts for fingerprint in Windows 10
My new laptop is running Windows 10 Pro and comes with a secugen hamster 4 fingerprint reader to unlock the devices. When I siged in to system, it automatically leted me setup fingerprnt login and the configure process ran correctly. However, sometimes I went to authenticate at start up and it failed to recognize me and I had to repeat that. Once I reached a number of maximum unsucccesful attempts, Windows hello blocked that and I needed to use the low Number around from 3 to 5 as password. How can I increase its number or modify the Windows hello blocking settings? Continue reading
How to receive push Android Notifications on Surface Pro Windows 10
Windows 10 build 14342 brings a new feature to receive notifications from an Android device on the desktop through Cortana app. Users can set mirrored notifications up to only send alerts for the apps they want and aren't worrying about notification overload on Surface Pro tablet. Here are the how-to tips for that. Continue reading
Word/Outlook Could Not Create The Work File in Windwos 10/8.1
When I ran the Office Outlook Desktop software on my Surface Pro 3 running the Windows 10 Pro, the app crashed with the error "Outlook Could Not Create The Work File. Check The Temp Environment Variable." That also happened with word 2013 app. It seemed that something was preventing two programs from working and I could not fingure out how to resolve the problem. Continue reading
USB Device connect/disconnect sound keeps playing in Windows 10
I connected my USB keyboard and mouse to my Windows 10 Pro computer and everything worked fine. However, everytime the monitor powered down then turn into sleep mode, the device connect/disconnect sound would play over and over. There was no usb log showing up in the event viewer and the Device Manager didn't list highlighted devices. Continue reading


text:
Open Tuesday through Saturday 11:00-4:00
For every book a child reads, or every book read to a child, they earn a raffle ticket entered to win a brand new Kindle!
Illustration by Dave Gano
Artist Robin Modlin constructs the "Pieces" memorial wall.
Are you ready to READ? Sign up for the Summer Reading Program at Murphys Library in June, July, and August.
The Murphys Volunteer Library serves our community with literature,
audio books, DVDs, free wifi, meeting space, and dynamic programming.
Kids ages 3 -16 participating in the Summer Reading Program are eligible to enter for a chance to win a $500 college savings account with ScholarShare (California's 529 College Savings Plan). Forty (40) future scholars will be randomly selected to win - and their libraries win $500, too! Enter online between June 1st and August 1st at www.ScholarShare.com/Summer
Murphys Volunteer Library is proud to display a selection from this public art installation, endorsed by the Calaveras County Arts Council. Murphys artist Robin Modlin is leading the creation of a mosaic wall or monument in honor of Butte Fire victims, to help in the healing process for their community. The exhibit uses donated pieces collected from the rubble of the fire.
For the month of July, different "pieces" will be shown at Murphys, Arnold, and Mokelumne Hill libraries, as well as the Art on Main gallery in Murphys. It will then move to the Calaveras County Arts Council Gallery in San Andreas on August 1st. The finished memorial will be presented in a ceremony starting at 10am on Saturday, September 10th, at Mountain Ranch Community Park.
Copyright © Murphys Volunteer Library. All rights reserved.


text:
Top Scorers
- R. Lewandowski
Bayern München
- 30
- P. Aubameyang
Borussia Dortmund
- 25
- T. Müller
Bayern München
- 20
- J. Hernández
Bayer Leverkusen
- 17
- A. Modeste
- 15
- Baba Rahman set for Chelsea exit
Lazio are set to make a move for Chelsea flop Baba Rahman, according to the Daily Star. The defender moved […] [+]
- Subotic signals intention to leave Dortmund
Neven Subotic is seeking a move away from Borussia Dortmund after eight seasons with the Bundesliga giants. A key figure […] [+]
- Gerland sees Kimmich as Lahm´s long-term successor
Joshua Kimmich is the long-term successor for Philipp Lahm at Bayern Munich, according to the club's assistant manager Hermann Gerland. […] [+]
- Man Utd submit improved offer for Henrikh Mkhitaryan
Manchester United have submitted an improved offer for Borussia Dortmund attacking midfielder Henrick Mkhitaryan after having their initial approach rejected, […] [+]
- Weinzierl keen for Sane to stay with Schalke
New Schalke boss Markus Weinzierl has urged star forward Leroy Sane to remain with the Bundesliga club. The 41-year-old signed […] [+]
- Gladbach snap up PSG youngster Doucoure
Borussia Monchengladbach have completed the signing of Mamadou Doucoure from Paris Saint-Germain on a five-year deal. Centre-back Doucoure was part of […] [+]
- Sanches ´relaxed´ about Bayern move
Bayern Munich signing Renato Sanches insists he has no nerves ahead of linking up with the Bundesliga champions. Sanches signed […] [+]
- David Alaba on Real Madrid radar
Austrian star David Alaba has found himself in the middle of hot transfer speculation with Real Madrid executives having already […] [+]
- Bayern Munich angry at ´fictional´ Gotze reports
Bayern Munich have slammed reports suggesting they threatened to exclude Mario Gotze from their Champions League squad if he chose […] [+]
- Increased interest from Germany for Serbian starlet Stojiljkovic
Braga striker Nikola Stojiljkovic is attracting a lot of interest this summer, with a move to Germany already being mooted […] [+]
- Schalke deny Man City deal for Sane
Schalke have denied rumours that Manchester City have agreed a deal to sign Leroy Sane. Numerous newspaper reports had claimed […] [+]
- Dortmund dismiss Reus injury speculation
Borussia Dortmund have poured cold water on speculation that Marco Reus is facing up to six months out. Germany forward […] [+]
- Torino resigned to losing Immobile
Ciro Immobile was keen to stay at Torino but now has "other ambitions", according to the club's sporting director Gianluca […] [+]
- Stoke City want £12.5m for Arnautovic
The Mirror understands that Stoke City have slapped a £12.5m price tag on wantaway forward Marko Arnautovic. The twenty-seven year […] [+]
- Hojbjerg set for Bayern exit
Danish midfielder Pierre-Emile Hojbjerg will be leaving Allianz Arena this summer, German media outlet Bild has claimed. Despite showing a […] [+]
- Dortmund to cash in on Mkhitaryan
Bundesliga outfit Borussia Dortmund are ready to entertain offers for star player Henrikh Mkhitaryan, according to Bild. The highly rated […] [+]
- Robben focused on fitness, not new Bayern contract
Arjen Robben is in no hurry to sign a new contract at Bayern Munich despite only having one year left on […] [+]
- Klinsmann points to Pulisic in MLS youth concerns
United States coach Jurgen Klinsmann used the example of Borussia Dortmund forward Christian Pulisic to highlight his concerns about youth […] [+]
- Rummenigge extends Bayern stay until 2019
Bayern Munich chairman Karl-Heinz Rummenigge has signed a three-year contract extension, the club have confirmed. Rummenigge has held the position […] [+]
- Man City eyeing Leroy Sane
Premier League giants Manchester City are hot on the trail of Schalke starlet Leroy Sane, according to Bild. New Man […] [+]
- Former Leverkusen coach Lewandowski dies
Union Berlin have confirmed their former coach Sascha Lewandowski, who also managed Bayer Leverkusen, has died at the age of 44. […] [+]
- Gladbach to announce three summer signings
Bundesliga high flyers Borussia M'gladbach are expected to announce three new recruits in the coming days, according to Bild. It […] [+]
- Alaba adamant he did not demand Bayern midfield role
David Alaba has stressed that playing in midfield was never a condition for him to sign a new contract with […] [+]
- Leverkusen set to sign Aleksandar Dragovic
German media outlet Bild has learned that Bayer Leverkusen are on the verge of signing Austrian defender Aleksandar Dragovic from […] [+]
- Gladbach move for Leverkusen´s Kramer
Borussia Monchengladbach have signed Germany international Christoph Kramer from Bundesliga rivals Bayer Leverkusen. Kramer spent the 2013-14 and 2014-15 campaigns […] [+]
- Man City close on Aubameyang
Premier League giants Manchester City are close to agreeing a deal for Borussia Dortmund striker Pierre-Emerick Aubameyang, Sky Sports has […] [+]
- Jeffrey Bruma on Wolfsburg radar
German media outlet Bild is reporting that Wolfsburg are hot on the trail of PSV Eindhoven defender Jeffrey Bruma. The […] [+]
- Gladbach agree deal for Christoph Kramer
Bundesliga outfit Borussia M'gladbach have reportedly agreed to sign German midfielder Christoph Kramer from Bayer Leverkusen, Bild can reveal. Die […] [+]
- Schweinsteiger better off away from Manchester – Beckenbauer
Franz Beckenbauer says being "away from the problems in Manchester" has helped Germany captain Bastian Schweinsteiger. The midfielder came on […] [+]
- Sebastian Rode undergoes Borussia Dortmund medical
Borussia Dortmund are set to complete the deal for Bayern Munich midfielder Sebastian Rode, according to Bild. The Millionaires are […] [+]


text:
16 items from 2010
28 October 2010 4:52 PM, PDT | Deadline TV | See recent Deadline TV news »
Exclusive: FX is working on a series project based on the 2007 Korean movie Soo (aka Act of Revenge) with Barry Josephson (Life as We Know It) on board to executive produce. A History of Violence writer Josh Olson is writing the adaptation, a drama exploring the nature of identity through the lens of twin brothers -- one a detective and one a hitman. After witnessing the killing of his estranged twin brother, a hitman decides to assume his life and become a policeman to find those responsible. Olson is executive producing with Josephson Entertainment's Josephson and Alexander Young as well as Ted Kim and Jiwon Park from Korean entertainment giant Cj Entertainment which distributed the movie based on the South Korean graphic novel Double Casting by Shin Young-woo. Olson, repped by UTA and Benderspink, has several feature projects in development, One Shot at Paramount, Oz at Warners and a »
13 September 2010 3:00 AM, PDT | The Hollywood Reporter | See recent The Hollywood Reporter news »
Paris -- Top U.S. screenwriters will be pushing their scripts over the borderline when the third annual "France: Unlimited Access" program kicks off on Sept. 19th in Metz and Nantes, French film commission Film France announced Monday.
After a first edition in Paris, Marseille and Provence followed by last year's romp through French Polynesia, this year, the program is titled "Cities on the Borders: Metz & Nantes."
Ten of Hollywood's finest scribes have been selected for the eight-day program organized by Film France and the Los Angeles Film and Television Office of the French Embassy with the help of the Lorraine and Loire Valley regions and several sponsors.
This year's crop of studio-friendly screenwriters includes: Stuart Beattie ("Collateral," "Pirates of the Caribbean," "Derailed," "3:10 to Yuma," "Australia," "G.I. Joe."), John Brancato and Michael Ferris ("The Game," "Terminator 3," "Terminator 4," "The Net," "Clones" and the upcoming "xXx3."), Peter Buchman ("Che"), Katherine Fugate ("Valentine's Day, »
- By Rebecca Leffler
18 July 2010 9:55 PM, PDT | LatinoReview | See recent LatinoReview news »
It's been awhile since Christopher McQuarrie has sat in the director's chair. The last time he put the directorial stamp on a project was all the way in 2000 with "The Way of the Gun". Since then he's produced and written "Valkyrie" and the upcoming thriller "The Tourist". Now he might sit back in the director's chair with Paramount Pictures' "One Shot". "One Shot", which McQuarrie is already re-writing for the studio, is based off of several novels written by Lee Child. Each one of them focuses on military officer turned drifter Jack Reacher, but the film will be about a sniper wanted for murder. He eventually calls for the help from Jack Reacher, but things get even more strange as the sniper forgets what he can recall about the day in question. If Paramount pushes this out properly, this could be the start of a new franchise. There's about »
18 July 2010 3:28 AM, PDT | ScreenRant.com | See recent Screen Rant news »
This week:
Inception boggles the mind at number one while Nic Cage and Jerry Bruckheimer's Apprentice has no magic; Sandra Vergara joins Fright Night; Christopher McQuarrie has only One Shot; Sam Raimi's Oz The Great And Powerful has a start date; Warner Bros. start World War X; two TV stars play Moneyball and lots more.
Box Office
Anyone who didn't think that Inception wouldn't open at number one this weekend was very silly indeed. It wasn't that the film wouldn't open big, the question was "how big?" - $62 million is the answer. The Christopher Nolan directed film has won itself awesome reviews and strong word-of-mout, meaning that the film should have very impressive legs – if the average Joe isn't put off by the complex plot. However, the marketing of "James Bond meets The Matrix" would imply that audiences will come.
The Leonardo DiCaprio »
- Niall Browne
17 July 2010 4:29 PM, PDT | Filmofilia | See recent Filmofilia news »
Christopher McQuarrie, well-known Oscar-winning writer of The Usual Suspects, has been hired to rework the Paramount thriller One Shot, with an eye to direct the whole thing as well.
His directorial debut was with the 2000 film, The Way of the Gun and he hasn't directed any additional films since then, so we guess this could be just the perfect time…
The project is based on a series of novels written by Lee Child that center on Jack Reacher, a military police officer-turned-drifter.
The story of One Shot, the ninth book in the series, centers on "Jack Reacher, a military police officer-turned-drifter. He's not looking for trouble. Sometimes trouble looks for Reacher.
A lone gunman hides in a parking garage and shoots into a crowd in a public plaza in a small Indiana city. Five random people die in a senseless massacre. The shooter leaves a perfect trail behind »
- Fiona
16 July 2010 8:25 AM, PDT | MTV Movies Blog | See recent MTV Movies Blog news »
There are a few movies in this world where, if I hear that the top-level creatives are doing something else, I'm immediately interested. "The Usual Suspects" is one of them. Which brings us to today's news.
Christopher McQuarrie, who dared us all to ask the question "Who is Kaiser Soze?" in "The Usual Suspects," has been brought in to give a re-write to Josh Olson's script for "One Shot," adapted from the ninth book in Lee Child's Jack Reacher series. What's more, there's a chance he may direct it, making it his first time helming a movie since "The Way of the Gun" in 2000. The story follows "military police officer-turned-drifter" Jack Reacher as he helps out a military sniper who is facing a murder charge.
McQuarrie also wrote the script for the Johnny Depp/Angelina Jolie-starring thriller "The Tourist," and he did a rewrite on the upcoming sequel to "X-Men Origins: Wolverine. »
- Adam Rosenberg
16 July 2010 8:03 AM, PDT | Dark Horizons | See recent Dark Horizons news »
"The Usual Suspects" scribe Christopher McQuarrie is set to re-write and potentially direct the thriller "One Shot" for Paramount Pictures says Heat Vision.
The story is based on the ninth book by novelist Lee Child featuring his Jack Reacher character, a military cop turned drifter. In 'Shot', a military sniper accused of murder seeks out Reacher for help.
Mutual Film and Cruise/Wagner Prods., who originally opted the book series, are still attached to produce while McQuarrie will rework the script by Josh Olson ("A History of Violence"). The film marks McQuarrie's second time in director's chair following his 2000 effort "The Way of the Gun." »
- Garth Franklin
16 July 2010 | Comingsoon.net | See recent Comingsoon.net news »
Paramount Pictures has hired Oscar winner Christopher McQuarrie ( The Usual Suspect , upcoming The Tourist , Jack the Giant Killer and Wolverine 2 ) to rework the thriller One Shot , with an eye to direct. The project is based on a series of novels written by Lee Child that center on Jack Reacher. "One Shot" is the ninth book in the series and is described as follows: Jack Reacher is working on his tan with a Norwegian blonde on the beach in Miami. The weather is hot and he is so cool you could skate on him. But he doesn't like to stick around. He likes to be on the move. He was in the machine his whole life. Then the machine coughed and spat him out. Now he takes it easy. He's not looking for trouble. But sometimes trouble looks for Reacher. A lone gunman »
16 July 2010 5:15 AM, PDT | firstshowing.net | See recent FirstShowing.net news »
Much of Christopher McQuarrie's success in screenwriting is paired with the success of Bryan Singer. Early on the two collaborated on the little known thriller Public Access only to break out with crime drama favorite The Usual Suspects. Over a decade later the two found reasonable success with Valkyrie. Between their collaboration, McQuarrie directed his first film to mixed reviews with The Way of the Gun in the year 2000. Now it looks like McQuarrie may be hopping in the director's chair again as Heat Vision reports he's been hired to rework the script for the thriller One Shot for Paramount and may potentially direct the film. Though the novel on which the film is based is actually the ninth in a series, this is still shaping up to be the start of a potentially lucrative new franchise for Paramount. Written by Lee Child, the series of novels center on »
- Ethan Anderton
16 July 2010 4:01 AM, PDT | Screenrush | See recent Screenrush news »
Master of the twist-and-turn thriller Christopher McQuarrie looks like he may well be working himself up to jump back in the directors chair, as he has signed on to re-write the script for One shot, one of Lee Child's explosive Jack Reacher novels.
And although The Usual Suspects' McQuarrie provides safe hands for a big-screen incarnation of the ex-military policeman turned drifter, apparently rights to Child's various books in the series all rest in the hands of different studios, meaning that if One Shot had a shot at being a franchise, there might be a wrangle to get licenses all to the one place.
In the meantime though, this book has been bought up by none other than McQuarrie's Valkyrie star and friend Tom Cruise. However, there is no intimation that the Knight and Day actor would attempt to make the role his own, unless he planned on leg extensions, »
15 July 2010 11:57 PM, PDT | MovieWeb | See recent MovieWeb news »
Christopher McQuarrie gives One Shot a rewriteThe Way of the Gun director Christopher McQuarrie has been set by Paramount to rework the thriller One Shot, with an eye to direct the project, according to Heat Vision.
The project is based on a series of novels written by Lee Child that center on Jack Reacher, a military police officer-turned-drifter. "One Shot," the ninth book in the series, tells the story of a military sniper accused of murder who seeks Reacher's help.
Paramount is developing the property as a potential franchise. No production date has been set.
One Shot is in development . »
15 July 2010 11:34 PM, PDT | Collider.com | See recent Collider.com news »
Oscar-winning screenwriter Christopher McQuarrie (The Usual Suspects) has been hired by Paramount to rework the thriller One Shot, which he may also end up directing. Per Heat Vision, "The project is based on a series of novels written by Lee Child that center on Jack Reacher, a military police officer-turned-drifter. One Shot, the ninth book in the series, tells the story of a military sniper accused of murder who seeks Reacher's help." Not surprisingly, Paramount is hoping to develop the property into a franchise.
If McQuarrie were hired to direct, it would be his first film since the 2000's astoundingly wretched The Way of the Gun (which he also wrote). McQuarrie recently handled the screenplays for the sequel to X-Men Origins: Wolverine and Bryan Singer's Jack the Giant Killer. »
- Matt Goldberg
15 July 2010 10:54 PM, PDT | EmpireOnline | See recent EmpireOnline news »
It's been 10 years since Christopher McQuarrie brought us his excellent directorial debut, The Way of the Gun. And now, according to the Heat Vision blog, it looks like he might pick up the megaphone again for Paramount's thriller One Shot.For now, however, he's definitely re-writing the movie, which will be adapted from Lee Child's Jack Reacher novels. The ninth one, to be exact, which finds a military sniper who is fighting a murder charge and asks Reacher, himself a heck of a sniper and the world's hardest man, for help.Given that Cruise/Wagner Productions originally optioned the books, it's not a shocker that someone who has collaborated with Cruise in the past is now attached to work on it (since Reacher's 6'5", however, don't expect Cruise to go playing the role). Josh Olson wrote a draft of the movie, and now McQuarrie is »
15 July 2010 10:51 PM, PDT | JoBlo.com | See recent JoBlo news »
You might know Christopher McQuarrie as the guy who brilliantly scripted 1995's The Usual Suspects. He also directed 2000's underrated The Way Of The Gun. Well, it seems McQuarrie will be not only rewriting a brand new adaptation for the big screen, but perhaps even directing it as well. The film is One Shot, based on a series of books by Lee Child, which focuses on a character named Jack Reacher, a military police officer-turned-drifter. One Shot, the ninth book in Child's series, »
- George Merchan
15 July 2010 9:45 PM, PDT | Slash Film | See recent Slash Film news »
I got a little excited when I clicked open the source article that tells me Christopher McQuarrie has been hired to rework and possibly direct One Shot, based on the Lee Child novel of the same name. I love Child's novels, which follow ex-military policeman Jack Reacher as he drifts across America. They're perfect escapist entertainment: smart, taut and blessed with some fantastic action setpieces. (Thanks to Chud's Nick Nunziata for turning me on to the books many years ago.) It's inevitable that one of the books will become a movie eventually. I'd just like to see it be a good one. This could be the way. THR says that McQuarrie, who recently wrote Valkyrie, The Tourist and a draft of Wolverine 2 (and obviously The Usual Suspects), is rewriting the project for Paramount. Studio is "eying the property as a potential franchise." He'd be rewriting the last draft by A »
- Russ Fischer
15 July 2010 8:45 PM, PDT | Beyond Hollywood | See recent Beyond Hollywood news »
Is Lee Child's Jack Reacher finally going to punch and badass his way to the big screen? Possibly, if Christopher McQuarrie and Paramount have their way. The writer/director of "The Unusual Suspects" and "Persons Unknown" has boarded the studio's "One Shot", a big-screen adaptation of Child's novel of the same name. "One Shot" is the ninth in the series, which means it's one of the installments I haven't gotten to yet, though that's likely to change now that I know "One Shot" will be the first of what the studio is no doubt hoping will be a launching pad for a Jack Reacher franchise. The hero of "One Shot" is Jack Reacher, an ex-military policeman who spends his time wandering the byroads and backroads of America after leaving the Army. Since that in itself would make a boring novel, the laconic and slightly »
- Nix
16 items from 2010
IMDb.com, Inc. takes no responsibility for the content or accuracy of the above news articles, Tweets, or blog posts. This content is published for the entertainment of our users only. The news articles, Tweets, and blog posts do not represent IMDb's opinions nor can we guarantee that the reporting therein is completely factual. Please visit the source responsible for the item in question to report any concerns you may have regarding content or accuracy.See our NewsDesk partners


text:
It's a tee. It's a dress. It's the new Graphic T-shirt Dress.
© Copyright 04/05/2010 by Michael Lee
abstract hero man power super superhero superman
10% off
for joining the Redbubble mailing list
Receive exclusive deals and awesome artist news and content right to your inbox.
Free for your convenience.


text:
Woods mapped out a strategy for navigating the bunkers of Royal Lytham, and not even a change in the weather — only a breath of wind — will take him away from that. He has hit driver only three times this week. On the par-5 11th, where several players hit driver for a chance to go for the green in two, Woods laid back with an iron. He pulled it into the rough, and it cost him. Woods had to get up-and-down from behind the green for a bogey.
That was his lone mistake, however. He holed an 18-foot birdie on the 16th hole, and then fooled by what little wind there was on the 18th, recovered by holing out from the greenside bunker with a shot that rolled into the cup for his second straight 67 and a 6-under 134.
"It wasn't as hard as it may have looked," Woods said. "Because I was on the up slope, I could take out that steepness coming off the bunker and land the ball on the flat. So just threw it up there, and I played about a cup outside the left and it landed on my spot and rolled to the right."
Woods will find out if his record in the majors still means anything. This was the eighth time he has opened a major with two rounds in the 60s, and he went on to win on the seven previous occasions — including all three of his Open titles.
He will be in the penultimate group with Thorbjorn Olesen, a 22-year-old Dane who won for the first time this year on the European Tour. He closed with two birdies, knowing that the last one would give him a 66 and a chance to meet Woods on a Saturday afternoon at golf's oldest championship.
"That was amazing," Olesen said. "He's been my idol in so many years. So it's fantastic to have a chance to play with him. And I'm certainly looking forward to it."
The rest of the field would love nothing more than for the wind to show up.
The forecast, which cannot be trusted in these parts, is for mostly sunny skies and perhaps enough wind to fly a kite on the shoreline of the Irish Sea. The blustery conditions are to arrive Sunday, which would make all those bunkers and the high grass even tougher to avoid and possibly allow others to get into the mix.
Paul Lawrie, who came from 10 shots behind on the final day at Carnoustie in 1999 to win the claret jug, overcame two double bogeys to salvage a 71 and was in the group at 4-under 136 that included Graeme McDowell (69), Matt Kuchar (67), Jason Dufner (66) and Thomas Aiken (68).
"The forecasts I've seen so far have all been wrong," Kuchar said. "So I don't put a whole lot of stock in what's coming. I think all of us would like to see some more British Open-like conditions. I think everybody would like to have a little bit more wind just to test us a little bit more out here."
Ernie Els squandered some chances by missing a few short putts on the back nine, though he still carved out a 70 and was at 137.
Luke Donald's day stated early, and not just with his tee time. His caddie, John McLaren, called to say his pregnant wife was due any minute. No matter. He used Gareth Lord — almost on the bag at Disney last year when Donald won to capture the PGA Tour money title — and he had a 68 to join the list at 2-under 138.
Rory McIlroy bought a hotel room and gave some spending cash to the 16-year-old who was hit in the head by his errant tee shot on Thursday. The teenager watched on Friday as McIlroy only hurt himself. He took two shots to get out of a bunker on the par-3 ninth for a double bogey, had to play sideways out of a water-filled bunker on the 17th and wound up with a 75 to fall 12 shots behind.
The cut was at 3-over 143 — the 13-shot separation speaks to how well Snedeker played. Phil Mickelson never had a chance, taking three double bogeys for a 78 to end his streak of 18 consecutive cuts in the majors that dates to Carnoustie five years ago.
Tom Watson, 62, extended his record as the oldest player to make the cut in the Open by holing a 35-foot birdie putt on the final hole.
It was a fitting end to the day.
Snedeker idolized Watson growing up, and he has just enough freckles under that strawberry-blond mop to resemble the five-time Open champion. He has learned to accept the odd bounces and embrace the Open beyond the links, hanging out in the pubs and appreciating the locals' love of golf.
As for their games? Snedeker doesn't hit the ball on the button the way Watson does — not many do.
"I would love to be like him," Snedeker said. "We both make pretty quick decisions. There's no hold-back in either one of our swings. He's one of the best ball strikers of all time. I am not, by any stretch of the imagination. But I think we both hole a lot of putts. Tom in his prime holed a lot of 25- and 30-footers. And when I'm playing well, I tend to do that a lot, too."
British Open
At Lytham St. Annes, England
Third round today
TV: ESPN, 5 a.m.
Final round Sunday
TV: ESPN, 6 a.m.
- Past few days 'difficult' for former...
- Defending champ Serena Williams at Wimbledon...
- Chile wins 2nd straight Copa America title as...
- Messi's retirement from Argentina could hurt...
- Most common names of NBA players this season
- Injured Lochte plows ahead in 200 free at US...
- Djokovic beat James Ward to open bid for 5th...
- Durant, Anthony lead US Olympic basketball team
- Kalani Sitake on BYU-Utah rivalry: 'I... 81
- Sitake not intimidated by BYU's arduous... 59
- Morning links: Colin Cowherd compares... 59
- Dick Harmon: 1996 Cotton Bowl champion... 51
- Morning Links: BYU basketball fans... 44
- Sitake making transition from longtime... 20
- Utes have a lot of depth on the... 18
- Utah football: Williams, McCormick... 18


text:
Latest Games
**ل** ف*لم **پ* ج*****
0 Results
More Games
Steam Droid
Liberate the steam droids in over 14 levels and take on the final big boss. Visit the store to upgrade to triple shot, reverse shot, rockets, homing...
Ninja Turtles Sewer Surf
Ride your shell surf board in the sewers as you chop down enemies from the Ninja Turtle universe.
Goodgame Poker
Goodgame Poker presents a whole new poker experience to players.
Pom Pom Cheerleader Coloring
Pom Pom Cheerleader Coloring is a game where you can color a draw the way you want. You can choose a lot of different colors and make her beautiful.
Vegetables Matching Game
Do your best to accurately match the vegetables on the cards through three levels of increasing difficulty. Each level will add more cards and also a...
Soccer Challenge
Score at least 3 goals to move on the next level!
Charlie The Duck
Mario-style platform game about a cute duck named Charlie. Run and jump through the levels, collect power ups and try to stay alive. Try to get to...