搜索资源列表
filter
- 字符编码过滤，单纯的过滤器，解决乱码问题-Character encoding filter, a simple filter to solve garbage problem
count_char
- 程序接收用户键入的一行字符（字符个数不超过80个，该字符用回车符结束），并按字母、数字、及其他字符分类计数，然后将结果存入以letter，digit，other为名的存取单元中-Program receives the user to type a line character (number not more than 80 characters, the characters end with a carriage return), according to letters, numbers
Matlab_Vehicle_License_Location
- 基于字符轮廓与形态学处理的车牌定位算法，做图像处理及车牌定位的朋友可以看一下，本文毕业设计部分-Character-based profile and the morphological processing of license plate location algorithm to do image processing and license plate location of friends can look at this part of graduation
vc_character_recognization
- mydate.dat为字库 先点击file, 点open，读入字库 学习时字库自动保存 已有键盘字符，字母，数字 和简单汉字 如要识别复杂汉字，请先用学习功能-mydate.dat first hits for the font file, point open, read into the character has to learn the keyboard automatically saved when the font characters, letters, nu
abcd
- 几种手写体汉字网格方向特征提取法并与神经网络在图像识别中应用-study of several handwritten chinese character directional feature extraction approaches
HuffMan
- Huffman编码及译码 1：将给定字符文件编码：生成编码，输出每个字。 2：将给定编码文件译码：生成字符，输出编码及其对应字符。 -Huffman coding and decoding 1: the given character encoding files: generated code, the output of each word. 2: decode the given encoded files: build character, the output encodi
charArrayCreate
- Matlab C++数学库对字符型阵列的操作-Matlab C++ Math Library operate on character arrays
Chinese_character_recognition
- 学习时字库自动保存 已有键盘字符，字母，数字 和简单汉字 如要识别复杂汉字，请先用学习功能-Chinese character recognition
huibian
- 无符号字数据的排序和查找，输入一组数据，按照用户指定的形式输出排序后的结果，并能查找输入的某个数据。-Unsigned character data, sorting and searching, input a set of data, in accordance with the output in the form specified by the user sort the result, and can find a data input.
data_struct3
- 数据结构课后设计题第三章 ◆3.17③ 试写一个算法，识别依次读入的一个以@ 为结束符的字符序列是否为形如 序列1&序列2 模式 的字符序列。其中序列1和序列2中都不含字符 & ， 且序列2是序列1的逆序列。例如， a+b&b+a 是属该 模式的字符序列，而 1+3&3-1 则不是。 实现下列函数: Status match(char *str) -Data structure design question after class Chapter ◆
wmScaner
- 基于wm的多模字符串扫描，稍微做了点改进，预先多扫描后一个字符，使的能够多跳一个位置。-Wm-based multi-mode string scanning, done some little improvements over pre-scan a character, so a place that can multi-hop.
HuffmanCoding
- （1）I：初始化（Initialization）。对输入的一段英文中的每个字符统计其权值，建立哈夫曼树； （2）E：编码（Encoding）。利用已建好的哈夫曼树，对每个字符进行编码。 -(1) I: Initialization (Initialization). English section of the input statistics for each character of their weight, the establishment of Huffman tree
HuffmanTree
- 本程序可以对任何大小的字符型文件进行Huffman编码，生成一个编码文件。 并可以在程序运行结束后的任意时间对它解码还原生成字符文件。即：先对一条电文进行输入，并实现Huffman编码，然后对Huffman编码生成的代码串进行译码，最后输出电文数字 -This procedure can be any size character files Huffman coding, to generate a code file. And can run it any time after th
200812214431237
- OCR手写文字识别源码。陨落雕(ThirdApple)的大作，识别率不错，手写输入识别后分别给出匹配率和匹配的字符 -OCR handwritten character recognition source. Fall Eagle (ThirdApple)' s masterpiece, the recognition rate is true that handwriting recognition is given after the match rate and match each
code2
- 建立哈夫曼树，哈夫曼树，即最优树，是带权路径长度最短的树。有着广泛的应用。在解决某些判定问题上，及字符编码上，有着重要的价值。 -Establish hoffmann tree, the tree of hoffmann, namely, the right path is parent-stand shortest length of the tree. A wide range of applications. In solving some problems, and judge th
Pattern-Recognition
- 字符识别、K-L人脸识别、虹膜识别、笔画识别等模式识别的例程和资料。-Character recognition, KL face recognition, iris recognition, stroke recognition, pattern recognition routines and information.
binmatrix
- inmatrix函数创建一个与x矩阵同等大小的二、十进制换算对应表，所生成的换算对应表的第一行到末行依次对应二进制的高位到低位；并用此生成的换算对应表进行其他如求列和、列和代表的字符的运算；-inmatrix function creates a matrix of equal size with x 2, corresponding to decimal conversion table, the generated conversion table corresponding to the
huffman
- Huffman编码译码器 采用输入字符自行统计字符频度 建立哈弗曼树编码译码-Huffman coding decoder input characters using character frequency statistics to establish their own tree coding and decoding Havermann
bpNet
- VS 2005 下编写的BP神经网络，可用于文字识别，车牌识别等方面。-VS 2005, prepared under the BP neural network can be used for character recognition, license plate recognition and so on.
huffmam_decoding
- the decoding of Huffman codes is shown. For the decoding the coding tree has to be constructed using the information which has to be transmitted as well. Following that the input is read bitwise and for each 0 a left turn is taken and for each one