排序方式: 共有11条查询结果,搜索用时 15 毫秒
1.
Steven J. Fliesler Sriganesh Ramachandra Rao Mai N. Nguyen Mahmoud Tawfik KhalafAllah Steven J. Pittler 《International journal of molecular sciences》2022,23(21)
Retinitis pigmentosa-59 (RP59) is a rare, recessive form of RP, caused by mutations in the gene encoding DHDDS (dehydrodolichyl diphosphate synthase). DHDDS forms a heterotetrameric complex with Nogo-B receptor (NgBR; gene NUS1) to form a cis-prenyltransferase (CPT) enzyme complex, which is required for the synthesis of dolichol, which in turn is required for protein N-glycosylation as well as other glycosylation reactions in eukaryotic cells. Herein, we review the published phenotypic characteristics of RP59 models extant, with an emphasis on their ocular phenotypes, based primarily upon knock-in of known RP59-associated DHDDS mutations as well as cell type- and tissue-specific knockout of DHDDS alleles in mice. We also briefly review findings in RP59 patients with retinal disease and other patients with DHDDS mutations causing epilepsy and other neurologic disease. We discuss these findings in the context of addressing “knowledge gaps” in our current understanding of the underlying pathobiology mechanism of RP59, as well as their potential utility for developing therapeutic interventions to block the onset or to dampen the severity or progression of RP59. 相似文献
2.
Madhvanath S. Kim G. Govindaraju V. 《IEEE transactions on pattern analysis and machine intelligence》1999,21(9):928-932
Contour representations of binary images of handwritten words afford considerable reduction in storage requirements while providing lossless representation. On the other hand, the one-dimensional nature of contours presents interesting challenges for processing images for handwritten word recognition. Our experiments indicate that significant gains are to be realized in both speed and recognition accuracy by using a contour representation in handwriting applications 相似文献
3.
4.
S. Madhvanath V. Govindaraju S. N. Srihari 《International journal of imaging systems and technology》1996,7(4):312-319
Commercial form-reading systems for extraction of data from forms do not meet acceptable accuracy requirements on forms filled out by hand. Several important form-processing applications involve the automated reading of handwritten responses. U.S. Census forms are a case in point. A database of form images containing actual responses received by the U.S. Census Bureau was made available by National Institute of Standards and Technology (NIST) in December 1993. A number of factors combine to make the task of reading these forms a challenging one. The quality of form images is often poor, and the handwritten responses are very loosely constrained in terms of writing style, format of response, and choice of text. The sizes of the lexicons provided are large (10,000-50,000 entries) and yet the coverage is incomplete (60%-70%). In this article we discuss our approach to automate the task of reading the census forms. The subtasks of field extraction and phrase recognition are described and multiclassifier control strategies for phrase recognition are presented. The error rate of the system when no rejects are allowed is 59%, with a lower bound of 40% being imposed by the incomplete coverage of the lexicon. The article concludes with a discussion of experimental results and directions for future research. © 1996 John Wiley & Sons, Inc. 相似文献
5.
Madhvanath S. Kleinberg E. Govindaraju V. 《IEEE transactions on pattern analysis and machine intelligence》1999,21(12):1344-1356
In this paper, we describe a system for rapid verification of unconstrained off-line handwritten phrases using perceptual holistic features of the handwritten phrase image. The system is used to verify handwritten street names automatically extracted from live US mail against recognition results of analytical classifiers. Presented with a binary image of a street name and an ASCII street name, holistic features (reference lines, large gaps and local contour extrema) of the street name hypothesis are “predicted” from the expected features of the constituent characters using heuristic rules. A dynamic programming algorithm is used to match the predicted features with the extracted image features. Classes of holistic features are matched sequentially in increasing order of cost, allowing an ACCEPT/REJECT decision to be arrived at in a time-efficient manner. The system rejects errors with 98 percent accuracy at the 30 percent accept level, while consuming approximately 20/msec per image on the average on a 150 MHz SPARC 10 相似文献
6.
The role of holistic paradigms in handwritten word recognition 总被引:1,自引:0,他引:1
Madhvanath S. Govindaraju V. 《IEEE transactions on pattern analysis and machine intelligence》2001,23(2):149-164
The holistic paradigm in handwritten word recognition treats the word as a single, indivisible entity and attempts to recognize words from their overall shape, as opposed to their character contents. In this survey, we have attempted to take a fresh look at the potential role of the holistic paradigm in handwritten word recognition. The survey begins with an overview of studies of reading which provide evidence for the existence of a parallel holistic reading process,in both developing and skilled readers. In what we believe is a fresh perspective on handwriting recognition, approaches to recognition are characterized as forming a continuous spectrum based on the visual complexity of the unit of recognition employed and an attempt is made to interpret well-known paradigms of word recognition in this framework. An overview of features, methodologies, representations, and matching techniques employed by holistic approaches is presented 相似文献
7.
8.
9.
Reference line information has been used for diverse purposes in handwriting research, including word case classification, OCR, and holistic word recognition. In this paper, we argue that the commonly used global reference lines are inadequate for many handwritten phrase recognition applications. Individual words may be written at different orientations or vertically displaced with respect to one another. A function used to approximate the implicit baseline will not be differentiable or even continuous at some points. We have presented the case for local reference lines and illustrate its successful use in a system that verifies street name phrases in a postal application. 相似文献
10.