- Full text PDF available (24)
A fingerprint classification algorithm is presented in this paper. Fingerprints are classified into five categories: arch, tented arch, left loop, right loop and whorl. The algorithm extracts singular points (cores and deltas) in a fingerprint image and performs classification based on the number and locations of the detected singular points. The classifier… (More)
Existence of minimal models for varieties of log general type." J. Amer. Math. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract. We prove that the canonical ring of a smooth projec-tive variety is finitely generated.
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)
Building on work of the fourth author in , we prove the weak factor-ization conjecture for birational maps in characteristic zero: a birational map between complete nonsingular varieties over an algebraically closed field K of characteristic zero is a composite of blowings up and blowings down with smooth centers.
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 number of flags in a complete fan, or more generally in an Eulerian poset, is encoded in the cd-index. We prove the non-negativity of the cd-index for complete fans, regular CW-spheres and Gorenstein* posets.
We study the non-negativity conjecture of the complete cd-index of a Bruhat interval as defined by Billera and Brenti. For each cd-monomial M we construct a set of paths, such that if a " flip condition " is satisfied, then the number of these paths is the coefficient of the monomial M in the complete cd-index. When the monomial contains at most one d, then… (More)