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

ONLINE RECOGNITION BY DEVIATION-EXPANSION MODEL AND dynamic-programming matching

PATTERN RECOGNITION 1993年第2期26卷 259-268页

作者： LIN, CK FAN, KC LEE, FTP NATL CENT UNIV INST COMP SCI & ELECTR ENGNCHUNGLI 32054TAIWAN

An on-line recognition system is presented for large-alphabet handprinted Chinese characters by the model based recognition approach with stroke based features. A deviation-expansion (D-E) model representing the reference pattern is constructed. The model contains the hypothetical knowledge of handwriting variations including stroke-order deviations and stroke-number deviations. For pattern matching a matching graph is constructed by combining the knowledge of the reference pattern and the unknown pattern together. With the graph a similarity measure function is defined to indicate similarity degree, The evaluation of the function is obtained by utilizing dynamic programming matching. Experimental results are based upon the testing set of 54,000 handprinted sample characters written in square style by ten persons. The D-E models of reference patterns saved in a data base are generated by 5400 daily-used Chinese characters. The unknown character to be recognized can be stroke-order and stroke-number free, tolerant for incorrect strokes and daily-used connected strokes, size and shape flexible. The cumulative classification rate of choosing the ten most similar characters is 98%. The results suggest that the hypothetical model is feasible and reasonable.

关键词： ONLINE RECOGNITION DEVIATION-EXPANSION MODEL matching GRAPH SIMILARITY MEASURE FUNCTION dynamic programming matching

来源：评论

学校读者我要写书评

暂无评论

Continuous nonlinearity in character recognition

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 1996年第5期E79D卷 423-428页

作者： Yamada, H Machine Understanding Division Electrotechnical Laboratory Tsukuba-shi 305 Japan

''Continuous nonlinearity'' is stressed as a fundamental principle in pattern recognition including handprinted Kanji character recognition. ''Continuity'' in template matching and '... 详细信息

''Continuous nonlinearity'' is stressed as a fundamental principle in pattern recognition including handprinted Kanji character recognition. ''Continuity'' in template matching and ''spatial nonlinearity'' in structural analysis should be uni fled toward deriving a higher level of recognition algorithm. At the same time, continuous nonlinearity in the temporal axis is important, as is the case of simultaneous processing of segmentation and recognition for touching characters. The above viewpoint is discussed in the following examples: nonlinear normalization, directional pattern matching, locally maximized similarity, relaxation matching, dynamic programming matching, segmentation of character string using dynamic programming, and exhaustive matching for character extraction on complex background.

关键词： handprinted character recognition continuous nonlinearity nonlinear normalization nonlinear matching dynamic programming matching relaxation matching

来源：评论

学校读者我要写书评

暂无评论

RECOGNITION OF HANDWRITTEN CHINESE-CHARACTERS BY MODIFIED HOUGH TRANSFORM TECHNIQUES

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1989年第4期11卷 429-439页

作者： CHENG, FH HSU, WH CHEN, MY ACAD SINICA INST INFORMAT SCITAIPEI 11529TAIWAN

Chinese characters are mapped from the spatial domain into the parametric one for stroke extraction, and the dynamic programming matching (DP matching) algorithm is applied to recognize Chinese characters. This method overcomes not only the problem of noise sensitivity in the local feature approach, but also the problem of being time consuming in the global feature approach. Results are presented for two experiments conducted for a database called ETL8, which contains 881 Chinese characters and 160 variations for each one, to prove the usefulness of the MHT and DP matching methods. An actual recognition rate of 94.5% was obtained for 351 Chinese characters in the ETL8.

关键词： Character recognition Handwriting recognition Feature extraction dynamic programming Information science Data mining Spatial databases Pattern recognition Fourier transforms INSPEC: Controlled Indexing transforms character recognition dynamic programming INSPEC: Non-Controlled Indexing ETL8 handwritten Chinese characters recognition Hough transform spatial domain stroke extraction dynamic programming matching noise sensitivity database

来源：评论

学校读者我要写书评

暂无评论

Multilingual Signature-Verification by Generalized Combined Segmentation Verification 13

Multilingual Signature-Verification by Generalized Combined ...

引用

13th IAPR International Conference on Document Analysis and Recognition (ICDAR)

作者： Ohyama, Wataru Ogi, Yuuki Wakabayashi, Tetsushi Kimura, Fumitaka Mie Univ Grad Sch Engn Tsu Mie Japan

ISBN: (纸本)9781479918058

We propose a combined segmentation-verification technique for Multilingual signature verification. One limitation of original segmentation verification method is that it is not applicable for such signatures which are difficult in segmentation like Latin-scripts signatures. To overcome this limitation, we employ signature segmentation using the position of gravity center of whole signature strokes instead of an interval space between names in the signature image. Three grayscale-gradient features are extracted from whole signature image and two segmented signature images, left-hand and right-hand side and evaluated the Mahalanobis distances from reference samples. The on-line feature based technique employs dynamic programming (DP) matching for time series data of the two segmented and one whole signatures. Three resultant distance values from off-line verification and three resultant dissimilarity values are input to SVM to make final decision of genuine or forgery. We evaluated the performance of the proposed method on SigComp2011 dataset which consists of Chinese and Dutch signatures. In the results of evaluation, the proposed technique achieved 1.02 % and 4.29% EER(Equal Error Rate) for Chinese and Dutch signatures respectively, which are significantly lower than and comparable to those of the best performances in SigComp2011 competition. These results confirm that the proposed generalized combined segmentation-verification by gravity center is effective for accuracy improvement of multi-script signature verification.

关键词： dynamic programming feature extraction handwriting recognition image segmentation natural language processing support vector machines time series Chinese signatures DP matching Dutch signatures EER Mahalanobis distance SVM SigComp2011 dataset dynamic programming matching equal error rate generalized combined segmentation verification grayscale-gradient feature extraction multilingual signature-verification multiscript signature verification offline verification online feature based technique signature image signature segmentation signature stroke gravity center position time series data Forgery Image segmentation Support vector machines Support Vector Network image segmentation forgery time series data handwriting recognition energy efficiency ratio dynamic programming Natural Language Processing Center of gravity signatures Feature extraction segmentation Error analysis Time series

来源：评论

学校读者我要写书评

暂无评论

A study of modifying pruning strategies for dp beam search at a preset input frame

引用

Systems and Computers in Japan 1993年第3期24卷 98-110页

作者： Kohda, Masaki Faculty of Engineering Yamagata University Yonezawa 992 Japan

In a conventional dynamic programming beam search, the parameters of the threshold function for pruning grid points in the dynamic programming region are assumed to be set to the same values throughout the speech input. In this paper, I describe a method designed to improve the effectiveness of decreasing the computation amount in the dynamic programming beam search by changing the parameters during speech input. An accumulated distance is defined that is not easily influenced by the quality of matching at the beginning of speech input. When this accumulated distance is used in the grid point pruning decision, the parameters of the threshold function can be changed to smaller values, at an early point in time of several frames from the beginning of the speech input, without missing grid points on the optimum dynamic programming path for the reference pattern. It was demonstrated through word recognition tests that the computation amount when the proposed threshold function is used can be decreased to about 1/5 of that in the conventional, simple grid point pruning method, and decreased by at least 1/2 compared to the threshold function of [11] because of the effectiveness of changing the threshold function's parameters at an early point during speech input. Copyright © 1993 Wiley Periodicals, Inc., A Wiley Company

关键词： beam search technique dynamic programming matching dynamic time warping (DTW) frame‐synchronous grid point pruning function speech recognition

来源：评论

学校读者我要写书评

暂无评论

EQUISOLID FISHEYE STEREOVISION CALIBRATION AND POINT CLOUD COMPUTATION

EQUISOLID FISHEYE STEREOVISION CALIBRATION AND POINT CLOUD C...

引用

ISPRS Conference on Serving Society with Geoinformatics (SSG)

作者： Moreau, Julien Ambellouis, Sebastien Ruichek, Yassine UTBM IRTES SET F-90010 Belfort France Univ Lille Nord France LEOST IFSTTAR F-59000 Lille France Univ Lille Nord France LEOST IFSTTAR F-59650 Villeneuve Dascq France

ISBN: (纸本)9781629935201

This paper deals with dense 3D point cloud computation of urban environments around a vehicle. The idea is to use two fisheye views to get 3D coordinates of the surrounding scene's points. The first contribution of this paper is the adaptation of an omnidirectional stereovision self-calibration algorithm to an equisolid fisheye projection model. The second contribution is the description of a new epipolar matching based on a scan-circle principle and a dynamic programming technique adapted for fisheye images. The method is validated using both synthetic images for which ground truth is available and real images of an urban scene.

关键词： fisheye stereovision binocular 3D reconstruction point cloud dynamic programming matching

来源：评论

学校读者我要写书评

暂无评论

OBSERVATIONS OF LIDAR BACKSCATTER FROM SNOWFALL AT TWO SITES

OBSERVATIONS OF LIDAR BACKSCATTER FROM SNOWFALL AT TWO SITES

引用

IEEE International Geoscience and Remote Sensing Symposium (IGARSS)

作者： Matsuda, K. Kubo, M. Muramoto, K. Kanazawa Univ Div Elect Engn & Comp Sci Kanazawa Ishikawa 9201192 Japan

ISBN: (纸本)9781467311595

Snow cloud distribution in the lower atmosphere was observed using two optical lidars (ceilometer) set up at the distance of 3.1 kIn. Visualization was constructed from two time series data measured by each lidar. The instruments additionally included weather station, to measure wind speed and direction, and snowfall gauge, to calculate precipitation rate. Combination of all these instruments with time synchronization and methods will be a potent system for understanding lower atmospheric structure.

关键词： lidar lower atmosphere snowfall dynamic programming matching

来源：评论

学校读者我要写书评

暂无评论

An Epipolar Geometry Constraint Based View Synthesis Algorithm

An Epipolar Geometry Constraint Based View Synthesis Algorit...

引用

2nd International Congress on Image and Signal Processing

作者： Zhang Jing Wang Chang-shun Liao Wu-ling SG Inst Technol Mech & Elect Engn Dept Beijing Peoples R China

ISBN: (纸本)9781424441303

A view synthesis algorithm based on the epipolar geometry constraint is proposed in this paper. Based on the epipolar geometry constraint, the destination image for new viewpoint is obtained precisely by using epipolar line segmentation, epipolar line interpolation, and dynamic programming matching methods. This algorithm requires only original captured images, and no camera parameters or other geometric information. Besides, this algorithm requires no manual operations, thus the synthesis process is fully automatic. The running results show that this algorithm reduces the probability of misregistration, and the derived destination image for new viewpoint is fairly well.

关键词： view synthesis epipolar geometry constrain epipolar line segmentation epipolar line interpolation dynamic programming matching

来源：评论

学校读者我要写书评

暂无评论

OBSERVATIONS OF LIDAR BACKSCATTER FROM SNOWFALL AT TWO SITES

OBSERVATIONS OF LIDAR BACKSCATTER FROM SNOWFALL AT TWO SITES

引用

IEEE International Geoscience and Remote Sensing Symposium

作者： K. Matsuda M. Kubo K. Muramoto Division of Electrical Engineering and Computer Science Kanazawa University Ishikawa National College of Technology

ISBN: (纸本)9781467311601

Snow cloud distribution in the lower atmosphere was observed using two optical lidars (ceilometer) set up at the distance of 3.1 km. Visualization was constructed from two time series data measured by each lidar. The instruments additionally included weather station, to measure wind speed and direction, and snowfall gauge, to calculate precipitation rate. Combination of all these instruments with time synchronization and methods will be a potent system for understanding lower atmospheric structure.

关键词： Lidar Lower atmosphere Snowfall dynamic programming matching

来源：评论

学校读者我要写书评

暂无评论

Iterative Expansion and Color Coding: An Improved Algorithm for 3D-matching

引用

ACM TRANSACTIONS ON ALGORITHMS 2012年第1期8卷 6-6页

作者： Chen, Jianer Liu, Yang Lu, Songjian Sze, Sing-Hoi Zhang, Fenghui Texas A&M Univ Dept Comp Sci & Engn College Stn TX 77843 USA Univ Texas Pan Amer Dept Comp Sci Edinburg TX 78539 USA Med Univ S Carolina Dept Biochem & Mol Biol Charleston SC 29425 USA Google Inc Seattle WA 98103 USA

The research in the parameterized 3D-matching problem has yielded a number of new algorithmic techniques and an impressive list of improved algorithms. In this article, a new deterministic algorithm for the problem is developed that integrates and improves a number of known techniques, including greedy localization, dynamic programming, and color coding. The new algorithm, which either constructs a matching of k triples in a given triple set or correctly reports that no such a matching exists, runs in time O*(2.80(3k)), improving a long list of previous algorithms for the problem.

关键词： Color coding dynamic programming matching parameterized algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：