Learn More
With the current rapid growth in multimedia technology, there is an imminent need for efficient techniclues to search and query large image databases. Because of their unique and peculiar needs, image databases cannot be treated iri a similar fashion to other types of digital libraries. The contextual dependencies present in images, and the complex nature(More)
The Hard Lefschetz theorem is known to hold for the intersection cohomology of the toric variety associated to a rational convex polytope. One can construct the intersection cohomology combinatorially from the polytope, hence it is well defined even for nonrational polytopes when there is no variety associated to it. We prove the Hard Lefschetz theorem for(More)
Texture analysis methods have been used in various image processing tasks, such as image segmentation, recognition, shape analysis, texture synthesis and image compression. When applying any of these methods, we assume that the input image has some textural characteristics. This paper addresses the problem of deciding whether an image has texture; in other(More)
The strong factorization conjecture states that a proper birational map between smooth algebraic varieties over a field of characteristic zero can be factored as a sequence of smooth blowups followed by a sequence of smooth blowdowns. We prove a local version of the strong factorization conjecture for toric varieties. Combining this result with the(More)