Digital Geometry Klette, Reinhard; Rosenfeld, Azriel
2004, 2004-09-04
eBook
Digital geometry is about deriving geometric information from digital pictures. The field emerged from its mathematical roots some forty-years ago through work in computer-based imaging, and it is ...used today in many fields, such as digital image processing and analysis (with applications in medical imaging, pattern recognition, and robotics) and of course computer graphics. Digital Geometry is the first book to detail the concepts, algorithms, and practices of the discipline. This comphrehensive text and reference provides an introduction to the mathematical foundations of digital geometry, some of which date back to ancient times, and also discusses the key processes involved, such as geometric algorithms as well as operations on pictures. *A comprehensive text and reference written by pioneers in digital geometry, image processing and analysis, and computer vision *Provides a collection of state-of-the-art algorithms for a wide variety of geometrical picture analysis tasks, including extracting data from digital images and making geometric measurements on the data *Includes exercises, examples, and references to related or more advanced work.
We describe a novel approach for high-throughput screening of recombinant antibodies, based on their immobilization on solid cellulose-based supports. We constructed a large human synthetic ...single-chain Fv antibody library where
in vivo formed complementarity determining regions were shuffled combinatorially onto germline-derived human variable-region frameworks. The arraying of library-derived scFvs was facilitated by our unique display/expression system, where scFvs are expressed as fusion proteins with a cellulose-binding domain (CBD).
Escherichia coli cells expressing library-derived scFv-CBDs are grown on a porous master filter on top of a second cellulose-based filter that captures the antibodies secreted by the bacteria. The cellulose filter is probed with labeled antigen allowing the identification of specific binders and the recovery of the original bacterial clones from the master filter. These filters may be simultaneously probed with a number of antigens allowing the isolation of a number of binding specificities and the validation of specificity of binders. We screened the library against a number of cancer-related peptides, proteins, and peptide–protein complexes and yielded antibody fragments exhibiting dissociation constants in the low nanomolar range. We expect our new antibody phage library to become a valuable source of antibodies to many different targets, and to play a vital role in facilitating high-throughput target discovery and validation in the area of functional cancer genomics.
Source: National Library of New Zealand Te Puna Matauranga o Aotearoa, licensed by the Department of Internal Affairs for re-use under the Creative Commons Attribution 3.0 New Zealand Licence.
Non‐DNA microarrays, such as protein, peptide and small molecule microarrays, can potentially revolutionize the high‐throughput screening tools currently used in basic and pharmaceutical research. ...However, fundamental obstacles remain that limit their rapid and widespread implementation as an alternative bioanalytical approach. These include the prerequisite for numerous proteins in active and purified form, ineffectual immobilization strategies and inadequate means for quality control of the considerable numbers of multiple reagents. This study describes a simple yet efficient strategy for the production of non‐DNA microarrays, based on the tenacious affinity of a carbohydrate‐binding module (CBM) for its three‐dimensional substrate, i.e., cellulose. Various microarray formats are described, e.g., conventional and single‐chain antibody microarrays and peptide microarrays for serodiagnosis of human immunodeficiency virus patients. CBM‐based microarray technology overcomes many of the previous obstacles that have hindered fabrication of non‐DNA microarrays and provides a technically simple but effective alternative to conventional microarray technology.
Digital Geometry Reinhard Klette; Azriel Rosenfeld
09/2004
eBook
Digital geometry is about deriving geometric information from digital pictures. The field emerged from its mathematical roots some forty-years ago through work in computer-based imaging, and it is ...used today in many fields, such as digital image processing and analysis (with applications in medical imaging, pattern recognition, and robotics) and of course computer graphics. Digital Geometry is the first book to detail the concepts, algorithms, and practices of the discipline. This comphrehensive text and reference provides an introduction to the mathematical foundations of digital geometry, some of which date back to ancient times, and also discusses the key processes involved, such as geometric algorithms as well as operations on pictures.*A comprehensive text and reference written by pioneers in digital geometry, image processing and analysis, and computer vision*Provides a collection of state-of-the-art algorithms for a wide variety of geometrical picture analysis tasks, including extracting data from digital images and making geometric measurements on the data*Includes exercises, examples, and references to related or more advanced work
The tumor suppressor gene p53 is mutated in more than half of human tumors. One important characteristic of p53 mutants is their accumulation in the nucleus of cancer cells. Thus, reactivation of ...mutant p53 proteins may trigger massive apoptosis in tumor cells. Pharmacologic methods are currently under development to induce mutant p53 proteins to resume their wild-type function. We have identified a human single-chain Fv fragment, designated as transcriptional transactivation and apoptosis restoring (TAR1), which specifically and with high affinity binds to mutant p53 and restores its wild-type active conformation. Binding of TAR1 to mutant p53 induced transcriptional transactivation of p53 target genes and down-regulation of mutant p53 transcriptional target genes. TAR1 treatment induced apoptosis in a variety of cell lines endogenously expressing p53 carrying different point mutations DNA contact or structural p53 mutants. Moreover, in an animal model of mice carrying human xenografts, TAR1 induced tumor regression with no apparent deleterious side effects. Thus, it may be considered as a potential candidate for anticancer treatment, targeting tumors with mutant p53.
Since its genesis more than thirty-five years ago, the field of computer vision has been known by various names, including pattern recognitions, image analysis, and image understanding. The central ...problem of computer vision is obtaining descriptive information by computer analysis of images of a scene. Together with the related fields of image processing and computer graphics, it has become an established discipline at the interface between computer science and electrical engineering. This volume contains fourteen papers presented at the AMS Special Session on Geometry Related to Computer Vision, held in Hoboken, New Jersey in October 1989.This book makes the results presented at the Special Session, which previously had been available only in the computer science literature, more widely available within the mathematical sciences community. Geometry plays a major role in computer vision, since scene descriptions always involve geometrical properties of, and relations among, the objects or surfaces in the scene. The papers in this book provide a good sampling of geometric problems connected with computer vision. They deal with digital lines and curves, polygons, shape decompositions, digital connectedness and surfaces, digital metrics, and generalizations to higher-dimensional and graph-structured 'spaces'. Aimed at computer scientists specializing in image processing, computer vision, and pattern recognition - as well as mathematicians interested in applications to computer science - this book will provide readers with a view of how geometry is currently being applied to problems in computer vision.
Strong arcs in fuzzy graphs Bhutani, Kiran R.; Rosenfeld, Azriel
Information sciences,
06/2003, Letnik:
152
Journal Article
Recenzirano
An arc of a fuzzy graph is called
strong if its weight is at least as great as the strength of connectedness of its end nodes when it is deleted. An arc is strong iff its weight is equal to the ...strength of connectedness of its end nodes. A bridge is strong, but a strong arc need not be a bridge. An arc of maximum weight is strong, but a strong arc need not have maximum weight. In a connected graph, there is a strong path (a path consisting of strong arcs) between any two nodes. A fuzzy graph is a fuzzy tree iff there is a unique strong path between any two of its nodes. In a fuzzy tree, an arc is strong iff it is a bridge, and a strong path between two nodes is a path of maximum strength between them.
A digital arc is called ‘straight’ if it is the digitization of a straight line segment. Since the concept of digital straightness was introduced in the mid-1970s, dozens of papers on the subject ...have appeared; many characterizations of digital straight lines have been formulated, and many algorithms for determining whether a digital arc is straight have been defined. This paper reviews the literature on digital straightness and discusses its relationship to other concepts of geometry, the theory of words, and number theory.
PDF
