检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

348 篇 会议
82 篇 期刊文献
4 册 图书

馆藏范围

434 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

245 篇 工学
- 156 篇 计算机科学与技术...
- 130 篇 软件工程
- 60 篇 信息与通信工程
- 43 篇 生物工程
- 42 篇 机械工程
- 38 篇 控制科学与工程
- 30 篇 生物医学工程（可授...
- 21 篇 光学工程
- 20 篇 化学工程与技术
- 18 篇 仪器科学与技术
- 15 篇 电气工程
- 9 篇 电子科学与技术（可...
- 4 篇 水利工程
- 4 篇 交通运输工程
- 3 篇 土木工程
127 篇 理学
- 60 篇 数学
- 43 篇 生物学
- 36 篇 物理学
- 21 篇 化学
- 17 篇 统计学（可授理学、...
- 3 篇 系统科学
70 篇 管理学
- 49 篇 图书情报与档案管...
- 25 篇 管理科学与工程(可...
- 11 篇 工商管理
16 篇 艺术学
- 16 篇 设计学（可授艺术学...
12 篇 医学
- 12 篇 临床医学
- 10 篇 基础医学(可授医学...
- 9 篇 药学(可授医学、理...
4 篇 经济学
- 4 篇 应用经济学
3 篇 法学
- 3 篇 社会学
2 篇 文学
1 篇 教育学

主题

83 篇 feature extracti...
76 篇 pattern recognit...
64 篇 handwriting reco...
63 篇 image segmentati...
60 篇 character recogn...
55 篇 support vector m...
51 篇 computer vision
43 篇 optical characte...
41 篇 training
33 篇 accuracy
32 篇 shape
26 篇 writing
24 篇 histograms
24 篇 testing
22 篇 databases
21 篇 image edge detec...
20 篇 text recognition
16 篇 reservoirs
15 篇 image recognitio...
14 篇 automation

机构

206 篇 computer vision ...
43 篇 computer vision ...
31 篇 national key lab...
28 篇 faculty of compu...
18 篇 department of st...
17 篇 computer vision ...
17 篇 computer vision ...
13 篇 school of comput...
12 篇 computer vision ...
12 篇 indian statistic...
8 篇 graduate school ...
8 篇 idetic universit...
8 篇 institute for in...
7 篇 department of st...
7 篇 school of inform...
6 篇 computer vision ...
6 篇 computer vision ...
6 篇 school of scienc...
6 篇 the computer vis...
5 篇 school of inform...

作者

113 篇 umapada pal
109 篇 pal umapada
38 篇 b.b. chaudhuri
33 篇 michael blumenst...
32 篇 palaiahnakote sh...
30 篇 blumenstein mich...
27 篇 shivakumara pala...
25 篇 chaudhuri b.b.
23 篇 u. pal
18 篇 lu tong
17 篇 chanda sukalpa
17 篇 tong lu
15 篇 chaudhuri bidyut...
14 篇 bidyut b. chaudh...
13 篇 fumitaka kimura
13 篇 sukalpa chanda
13 篇 p. nagabhushan
12 篇 ujjwal bhattacha...
12 篇 garain utpal
12 篇 alireza alaei

语言

430 篇 英文
4 篇 其他

检索条件"机构=Indian Statistical Institute Computer Vision and Pattern Recognition Unit"

共 434 条记录，以下是21-30 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

An end-to-end system for bangla online handwriting recognition 15

An end-to-end system for bangla online handwriting recogniti...

引用

15th International Conference on Frontiers in Handwriting recognition, ICFHR 2016

作者： Bhattacharya, Soumik Maitra, Durjoy Sen Bhattacharya, Ujjwal Parui, Swapan K. Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781509009817

A few studies of online Bangla handwriting recognition such as isolated character recognition or limited vocabulary cursive word recognition are found in the literature. However, development of an end-to-end recognition system of unconstrained online Bangla handwritten texts has not been duly attempted so far. In the present report, we describe a similar system which takes a piece of continuous online handwritten Bangla texts as the input. It first segments the input texts into individual lines, each line into its constituent words and each word into sub-strokes. In the present study, 152 different symbols which include basic characters, character modifiers, frequently used conjunct characters, a few special characters and numerals have been considered. The entire set of sub-strokes obtained from the training sample set has been exhaustively studied by 3 experts and 76 different shapes of sub-strokes have been identified based on consensus among these experts. Also, it has been observed that a character may produce at most 3 sub-strokes. Since a piece of Bangla texts often contains either Bangla or English numerals, the present character set consists of both the numeral set and 3 numeral shapes are common to both the scripts. The proposed recognition system uses two classifiers, one for characters and the other for sub-strokes. Sub-strokes are fed to the character classifier in their temporal order. A single sub-stroke followed by two consecutive sub-strokes and finally three successive sub-strokes are passed to the character classifier and the first two top responses of the character classifier among the three cases are compared. If the difference is less than a threshold, the response of sub-stroke classifier is used to reach a final decision. The proposed system provided 94.3% character level accuracy on a test set consisting of 33,453 word samples written by 31 writers. © 2016 IEEE.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

Processing of struck-out handwriting

Processing of struck-out handwriting

引用

2nd indian International Conference on Artificial Intelligence, IICAI 2005

作者： Bhattacharya, U. Chaudhuri, B.B. Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)0972741216

Struck-out words are often found in handwritten manuscripts. A realistic off-line handwriting recognition system should take care of this common aspect. A simple but efficient approach to this problem is to subject each handwritten word to a two-class classifier in the initial stage. This classifier should take decision to pass the word to a word recognition engine in the next step or discard it as a struck-out/wrong word. In the present work, we studied a stroke analysis based technique, which can classify an input word as a correct or wrong (struck-out) word. We simulated the proposed approach on a database of 466 words collected from handwritten manuscripts of different languages and the results are promising. Copyright © IICAI 2005.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

indian language multimedia and information retrieval 3

Indian language multimedia and information retrieval

引用

3rd International Conference on Computational Intelligence and Multimedia Applications, ICCIMA 1999

作者： Chaudhuri, B.B. Computer Vision and Pattern Recognition Unit Indian Statistical Institute Calcutta India

ISBN: (纸本)0769503004

Over the last decade or so, remarkable developments in computer technology have given a major impetus to research in the field of multimedia. With the proliferation of the Internet and the increasingly widespread use of sophisticated computers, the multimedia revolution has arrived in India as well. It is therefore time to take stock of the situation: to evaluate how existing techniques can be used in the indian context and to determine what new methods have to be developed. This paper summarizes the current state of multimedia technology in India and points to directions for further work. As more and more people in India begin to use computers and the Internet, multimedia capabilities will start playing a vital role in solving problems in many different areas. Education is probably one of the most important areas where multimedia technology can have a major impact. Already, multimedia educational systems are being developed in indian languages. Several interactive encyclopaedia-like environments are also being marketed on CD-ROMs, and cover topics ranging from indian classical music to indian history, using text, images and sound. Some of the other possible applications of multimedia technology are: the development of digital libraries, news and information dissemination services, medicine, business and commerce, and the entertainment industry. Multimedia information technology is thus poised to become an exciting area for research and development activities in India. © 1999 IEEE.

关键词： CD-ROM

来源：评论

学校读者我要写书评

暂无评论

A fast correlation attack for LFSR-based stream ciphers

A fast correlation attack for LFSR-based stream ciphers

引用

1st International Conference on Applied Cryptography and Network Security, ACNS 2003

作者： Palit, Sarbani Roy, Bimal K. De Arindom Computer Vision and Pattern Recognition Unit Indian Statistical Institute India Applied Statistics Unit Indian Statistical Institute India Computer Vision and Pattern Recognition Unit Indian Statistical Institute India

ISBN: (纸本)3540202080

This paper describes a novel fast correlation attack of stream ciphers. The salient feature of the algorithm is the absence of any pre-processing or iterative phase, an usual feature of existing fast correlation attacks. The algorithm attempts to identify a number of bits of the original linear feedback shift register (LFSR) output from the received bits of the ciphertext. These are then used to construct a system of linear equations which are subsequently solved to obtain the initial conditions. The algorithm is found to perform well for LFSRs of large sizes but having sparse polynomials. It may be noted that such polynomials have low Hamming weight which is one more than the number of feedback connections or "taps" of the corresponding LFSR. Its performance is good in situations even where limited cipherlength is available. Another important contribution of the paper is a modification of the approach when the LFSR outputs are combined by a function which is correlation immune and perhaps, unknown to the decrypter. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

OCR error detection and correction of an inflectional indian language script

OCR error detection and correction of an inflectional Indian...

引用

13th International Conference on pattern recognition, ICPR 1996

作者： Chaudhuri, B.B. Pal, U. Computer Vision and Pattern Recognition Unit Indian Statistical Institute Calcutta 35 India

ISBN: (纸本)081867282X

This paper deals with an OCR error detection and correction technique for a highly inflectional language script like Bangla (a major indian language). This is the first report of its kind. Using two separate lexicons of root words and suffixes, candidate root-suffix pairs of each input word are detected, their grammatical agreement are tested and the root/suffix part in which the error has occurred is noted. The correction is made on the corresponding error part of the input string by a fast dictionary access technique. To do so some alternative strings are generated for an erroneous word. Among the alternative strings, those satisfying grammatical agreement in root-suffix and also having smallest Levenstein-Damerau distance are finally chosen as the correct ones. The system has an accuracy of 75.61%. © 1996 IEEE.

关键词： Error detection

来源：评论

学校读者我要写书评

暂无评论

Offline handwritten Devanagari word recognition: Information fusion at feature and classifier levels 3

Offline handwritten Devanagari word recognition: Information...

引用

3rd IAPR Asian Conference on pattern recognition, ACPR 2015

作者： Shaw, Bikash Bhattacharya, Ujjwal Parui, Swapan Kumar Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata700108 India

ISBN: (纸本)9781479961009

This article presents our recent study on fusion of information at feature and classifier output levels for improved performance of offline handwritten Devanagari word recognition. We consider here two state-of-the-art features, viz., Directional Distance Distribution (DDD) and Gradient-Structural-Concavity (GSC) features along with multi-class SVM classifiers. Here, we study various combinations of DDD features along with one or more features from the GSC feature set. We experiment by presenting different combined feature vectors as input to SVM classifiers. Also, the output vectors of different SVM classifiers fed with different feature vectors are combined by another SVM classifier. The combination of the outputs of two SVMs each being fed with a different feature vector provides superior performance to the performance of a single SVM classifier fed with the combined feature vector. Experimental results are obtained on a large handwritten Devanagari word sample image database of 100 indian town names. The recognition results on its test samples show that SVM recognition output of DDD features combined with the SVM output of GSC features improves the final recognition accuracy significantly. © 2015 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

An MLP-based texture segmentation technique which does not require a feature set

An MLP-based texture segmentation technique which does not r...

引用

13th International Conference on pattern recognition, ICPR 1996

作者： Bhattacharya, U. Chaudhuri, B.B. Parui, S.K. Computer Vision and Pattern Recognition Unit Indian Statistical Institute Calcutta - 35 India

ISBN: (纸本)081867282X

In this paper we describe a texture segmentation approach without feature computation based on a multilayer perceptron network (MLP). Thus, the users need not bother about the selection and then computation of feature set and hence real-time segmentation may be possible. The basic motivation of the work is the fact that human vision does not consciously compute features for distinguishing different textures in a scene. A single hidden layer MLP network has been found to be most suitable with heuristically chosen input and hidden layer sizes. A method has been used to speedup the learning of the MLP network. The result of segmentation by a trained network usually results in misclassification in the form of speckles. For the removal of such noise an edge-preserving-noise- smoothing technique is proposed. The final segmentation accuracy is well comparable with that of other existing techniques. © 1996 IEEE.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Devanagari and Bangla text extraction from natural scene images

Devanagari and Bangla text extraction from natural scene ima...

引用

ICDAR2009 - 10th International Conference on Document Analysis and recognition

作者： Bhattacharya, U. Parui, S.K. Mondal, S. Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata - 108 India

ISBN: (纸本)9780769537252

With the increasing popularity of digital cameras attached with various handheld devices, many new computational challenges have gained significance. One such problem is extraction of texts from natural scene images captured by such devices. The extracted text can be sent to OCR or to a text-to-speech engine for recognition. In this article, we propose a novel and effective scheme based on analysis of connected components for extraction of Devanagari and Bangla texts from camera captured scene images. A common unique feature of these two scripts is the presence of headline and the proposed scheme uses mathematical morphology operations for their extraction. Additionally, we consider a few criteria for robust filtering of text components from such scene images. Moreover, we studied the problem of binarization of such scene images and observed that there are situations when repeated binarization by a well-known global thresholding approach is effective. We tested our algorithm on a repository of 100 scene images containing texts of Devanagari and / or Bangla © 2009 IEEE.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

A robust scheme for extraction of text lines from handwritten documents

A robust scheme for extraction of text lines from handwritte...

引用

International Conference on computer vision and Image Processing, CVIP 2016

作者： Biswas, Barun Bhattacharya, Ujjwal Chaudhuri, Bidyut B. Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata108 India

ISBN: (纸本)9789811021060

Considering the vast collection of handwritten documents in various archives, research studies for their automatic processing have major impact in the society. Line segmentation from images of such documents is a crucial step. The problem is more difficult for documents of major indian scripts such as Bangla because a large number of its characters have either ascender or descender or both and the majority of its writers are accustomed in extremely cursive handwriting. In this article, we describe a novel strip based text line segmentation method for handwritten documents of ***, the proposed method has been found to perform efficiently on English and Devanagari handwritten *** conducted extensive experimentations and its results show the robustness of the proposed approach on multiple scripts. © Springer Science+Business Media Singapore 2017.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Exemplary Sequence Cardinality: An effective application for word spotting 13

Exemplary Sequence Cardinality: An effective application for...

引用

13th International Conference on Document Analysis and recognition, ICDAR 2015

作者： Mondal, Tanmoy Ragot, Nicolas Ramel, Jean-Yves Pal, Umapada France Indian Statistical Institute Computer Vision and Pattern Recognition Unit Kolkata India

ISBN: (纸本)9781479918058

In this paper proposed. ESC combines several abilities of other sequence matching algorithms e.g. DTW, SSDTW, CDP, FSM, MVM, OSB1. Depending on the application domain, ESC can be tuned to∗∗a new sequence matching algorithm called as Exemplary Sequence Cardinality (ESC) is behave such as these different sequence matching algorithms. Its generality and robustness comes from its ability to find subsequences (as in CDP and SSDTW), to skip outliers inside the target sequences (as in MVM and FSM) and also in the query sequence (as in OSB ) and it has the ability to have many to one and one to many correspondences (as in DTW) between the elements of the query and the target sequences. It's special characteristic of skipping noisy elements from query sequence along with other afore mentioned properties gives it an edge over FSM. In case of word spotting application, the outliers skipping capability of ESC makes it less sensible to local variations in the spelling of words, and also to noise present in the query and/or in the target word images. Due to it's capability of sub-sequence matching, the ESC algorithm has the ability to retrieve a query inside a line or piece of line. Finally, its multiple matching facilities (many to one and one to many matching) is proven to be well advantageous in case of different length of target and query sequences due to the variability in scale, font, type/size factors. By experimenting on printed historical document images, we have demonstrated the interest of proposed ESC algorithm in specific cases when incorrect word segmentation and word level local variations occur regularly. © 2015 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共44页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：