-
公开(公告)号：US20090185692A1
公开(公告)日：2009-07-23
申请号：US12414602
申请日：2009-03-30
CPC分类号： G10L19/018
摘要： A system and method of retrieving a watermark in a watermarked signal are disclosed. The watermarked signal comprises odd and even overlapped blocks where the watermark is contained in the even blocks. The method comprises, for each k-th even block, subtracting the two adjacent odd numbered blocks from the k-th even block of the watermarked signal to retrieve s*k(n), transforming s*k(n) into the frequency domain to generate Sk(ƒ), calculating a phase of Sk(ƒ) as φ(ƒ) and a phase of Sk(ƒ) as φ(ƒ), calculating the difference Ψ(ƒ) between φ(ƒ) and φ(ƒ), unwrapping Ψ(ƒ) to obtain the phase modulation {tilde over (Φ)}k(ƒ), and using a Viterbi search to retrieve the watermark embedded in {tilde over (Φ)}k(ƒ).
摘要翻译： 公开了一种在水印信号中检索水印的系统和方法。 水印信号包括奇偶重叠块，其中水印包含在偶数块中。 该方法包括对于每个第k个偶数块，从水印信号的第k个偶数块中减去两个相邻的奇数块，以获取
s * k（n）输入到频域中以产生 Sk（f），将 Sk（f）的相位计算为< （f）和Sk（f）的相位作为phi（f），计算 phi（f）和phi（f）之间的差Psi（f） 展开Psi（f）以获得相位调制（波前）（Phi）} k（f），并且使用维特比搜索来检索嵌入{波浪号（Phi）} k（f）中的水印。 -
公开(公告)号：US20090074116A1
公开(公告)日：2009-03-19
申请号：US12290811
申请日：2008-11-04
申请人： William Turin
发明人： William Turin
IPC分类号： H04L27/06
CPC分类号： H04L1/005 , H03M13/3746 , H03M13/3905 , H03M13/3933 , H04L1/0055 , H04L1/006
摘要： This invention provides an iterative process to maximum a posteriori (MAP) decoding. The iterative process uses an auxiliary function which is defined in terms of a complete data probability distribution. The auxiliary function is derived based on an expectation maximization (EM) algorithm. For a special case of trellis coded modulators, the auxiliary function may be iteratively evaluated by a combination of forward-backward and Viterbi algorithms. The iterative process converges monotonically and thus improves the performance of any decoding algorithm. The MAP decoding minimizes a probability of error. A direct approach to achieve this minimization results in complexity which grows exponentially with T, where T is the size of the input. The iterative process avoids this complexity by converging on the MAP solution through repeated maximization of the auxiliary function.
摘要翻译： 本发明提供了一种用于最大化后验（MAP）解码的迭代过程。 迭代过程使用根据完整数据概率分布定义的辅助功能。 辅助函数是基于期望最大化（EM）算法导出的。 对于网格编码调制器的特殊情况，辅助功能可以通过前向后向和维特比算法的组合进行迭代评估。 迭代过程单调收敛，从而提高了任何解码算法的性能。 MAP解码使错误概率最小化。 实现这种最小化的直接方法导致复杂度随着T指数增长，其中T是输入的大小。 迭代过程通过辅助功能的重复最大化收敛在MAP解决方案上来避免这种复杂性。
-
23.发明授权Methods and systems for performing handwriting recognition from raw graphical image data 失效从原始图形图像数据执行手写识别的方法和系统
公开(公告)号：US5875256A
公开(公告)日：1999-02-23
申请号：US691995
申请日：1996-08-02
CPC分类号： G06K9/6296 , G06K9/00416 , G06K9/00429 , G10L15/193 , G10L15/18 , G10L15/1815
摘要： Methods and systems for performing handwriting recognition which include, in part, application of stochastic modeling techniques in conjunction with language modeling. Handwriting recognition is performed on a received data set, which is representative of a handwriting sample comprised of one or more symbols. Recognition is performed by selectively segmenting the data set into one or more strokes utilizing an evolution grammar for identifying each one of the strokes among one or more alternatives. Each one of the strokes represents a segment of the handwriting sample. The identified strokes are evaluated as a stroke sequence, representative of one or more of the handwriting sample's symbols, to identify the handwriting sample.
摘要翻译： 用于执行手写识别的方法和系统，其部分地包括结合语言建模的随机建模技术的应用。 对接收到的数据集执行手写识别，该数据集代表由一个或多个符号组成的手写样本。 通过使用用于识别一个或多个替代方案中的每个笔划的演进语法来选择性地将数据集分成一个或多个笔划来执行识别。 每个笔画都代表手写样本的一段。 所识别的笔画被评估为表示手写样本的一个或多个符号的笔画序列，以识别手写样本。
-
24.发明授权Method and apparatus for handwriting decompression using estimated timing information 失效使用估计的定时信息进行手写解压缩的方法和装置
公开(公告)号：US5623555A
公开(公告)日：1997-04-22
申请号：US228823
申请日：1994-04-18
申请人： Winston L. Nelson , William Turin
发明人： Winston L. Nelson , William Turin
CPC分类号： G06T9/00
摘要： A method and apparatus for generating a reconstructed image from a compressed image. An exemplary method in accordance with the present invention includes the steps of identifying pairs of compressed image data points having a connection therebetween in a linear segment approximation of the reconstructed image; estimating timing information such as a number of original image data points between each of the connected pairs of compressed image data points; and fitting a spline segment to each of the pairs of compressed image data points and the estimated number of original image data points corresponding thereto, such that the fitted spline segments in combination form the reconstructed image. The reconstructed image may then be smoothed by replacing spline segments which produce undesirable deviations in the reconstructed image with conic section spline segments. The timing information may be estimated using, for example, a linear time model, in which a fixed number of original image data points are estimated between each pair of compressed image data points, or a constant velocity model, in which the estimated number of original image data points is proportional to, or more generally, a function of the distance between the pair of compressed points. One such function of distance particularly well-suited to reconstruction of handwriting images is a square root of the distance.
摘要翻译： 一种用于从压缩图像生成重建图像的方法和装置。 根据本发明的示例性方法包括以下步骤：在重建图像的线性段近似中识别其间具有连接的压缩图像数据点对; 估计每个连接的压缩图像数据点对之间的原始图像数据点的数量的定时信息; 以及将样条段拟合到每对压缩图像数据点以及与其相对应的原始图像数据点的估计数，使得合并的样条段组合形成重建图像。 然后，可以通过替换在重构图像中产生不希望的偏差的花键片段花键片段来平滑重建的图像。 可以使用例如在每对压缩图像数据点之间估计固定数量的原始图像数据点的线性时间模型或者等速模型来估计定时信息，其中估计的原始数量 图像数据点与一对压缩点之间的距离成比例，或者更一般地是一个函数。 距离特别适合重写手写图像的一种这样的功能是距离的平方根。
-
公开(公告)号：US07882357B1
公开(公告)日：2011-02-01
申请号：US11278673
申请日：2006-04-04
CPC分类号： G10L19/018
摘要： A system, method and computer readable medium that processing a watermarked signal using the phase Sk(f) of an original signal. The watermarked signal includes odd and even overlapped blocks where the watermark is contained in the even blocks. The method comprises test-decoding the watermarked signal and, if the watermarked signal contains errors, recoding the watermarked signal with a higher redundancy code. The steps of test-decoding and recording may be performed until all errors are corrected.
摘要翻译： 一种使用原始信号的相位Sk（f）处理加水印信号的系统，方法和计算机可读介质。 水印信号包括奇偶重叠块，其中水印被包含在偶数块中。 该方法包括对水印信号进行测试解码，如果水印信号含有错误，则用较高冗余码重新编码水印信号。 可以执行测试解码和记录的步骤，直到所有错误被校正。
-
公开(公告)号：US20090116689A1
公开(公告)日：2009-05-07
申请号：US12269461
申请日：2008-11-12
IPC分类号： G06K9/00
CPC分类号： G10L19/018
摘要： A system and method of generating a watermarked signal are disclosed. The system segments the signal into overlapping blocks using a window function and processes the overlapping blocks according to whether each block is odd- or even-numbered. The system windows the odd-numbered blocks, modulates the phase of each block in the frequency domain, transforms each modulated block in the time domain, windows each block transformed into the time domain and overlap-adds each odd-numbered block with each even-numbered block to generate the watermarked signal.
摘要翻译： 公开了一种产生水印信号的系统和方法。 该系统使用窗口功能将信号分割成重叠块，并根据每个块是奇数还是偶数编号来处理重叠块。 系统对奇数块进行窗口调制，对频域中每个块的相位进行调制，对时域中的每个调制块进行变换，将每个块变换为时域，将每个奇数块与每个偶数块相加， 编号块生成水印信号。
-
公开(公告)号：US07451318B1
公开(公告)日：2008-11-11
申请号：US11278672
申请日：2006-04-04
CPC分类号： G10L19/022 , G10L19/018 , G11B20/00891
摘要： A method of retrieving a watermark in a watermarked signal involves processing a signal having odd- and even-overlapped blocks and where the watermark is contained in the even blocks. For each k-th block, the method comprises subtracting the odd-numbered blocks from the k-th block of the watermarked signal to generate s*k(n), applying an FFT to s*k(n) to generate a phase Sk(ƒ), calculating a phase of Sk(ƒ) as φ(ƒ) and a phase of an original signal Sk(ƒ) as φ(ƒ), calculating the difference Ψ(ƒ) between φ(ƒ) and φ(ƒ); and retrieving the watermark embedded in Ψ(ƒ). A Viterbi search may be the algorithm used to retrieve the watermark.
摘要翻译： 在水印信号中检索水印的方法涉及处理具有奇数和偶数重叠块的信号，并且其中水印包含在偶数块中。 对于每个第k个块，所述方法包括从所述水印信号的第k个块中减去奇数块以产生所述第N个块的奇数块。 （f）将相应的FFT应用于
S（f）的相位为 phi（f），并且原始信号S < （f）作为phi（f），计算 phi（f）和phi（f）之间的差Psi（f）; 并检索嵌入在Psi（f）中的水印。 维特比搜索可以是用于检索水印的算法。 -
公开(公告)号：US06700937B1
公开(公告)日：2004-03-02
申请号：US09549201
申请日：2000-04-13
申请人： William Turin
发明人： William Turin
IPC分类号： H04L512
CPC分类号： H04L1/005 , H03M13/3746 , H03M13/3905 , H03M13/3933 , H04L1/0055 , H04L1/006
摘要： This invention provides an iterative process to maximum a posteriori (MAP) decoding. The iterative process uses an auxiliary function which is defined in terms of a complete data probability distribution. The auxiliary function is derived based on an expectation maximization (EM) algorithm. For a special case of trellis coded modulators, the auxiliary function may be iteratively evaluated by a combination of forward-backward and Viterbi algorithms. The iterative process converges monotonically and thus improves the performance of any decoding algorithm. The MAP decoding minimizes a probability of error. A direct approach to achieve this minimization results in complexity which grows exponentially with T, where T is the size of the input. The iterative process avoids this complexity by converging on the MAP solution through repeated maximization of the auxiliary function.
摘要翻译： 本发明提供了一种用于最大化后验（MAP）解码的迭代过程。 迭代过程使用根据完整数据概率分布定义的辅助功能。 辅助函数是基于期望最大化（EM）算法导出的。 对于网格编码调制器的特殊情况，辅助功能可以通过前向后向和维特比算法的组合进行迭代评估。 迭代过程单调收敛，从而提高了任何解码算法的性能。 MAP解码使错误概率最小化。 实现这种最小化的直接方法导致复杂度随着T指数增长，其中T是输入的大小。 迭代过程通过辅助功能的重复最大化收敛在MAP解决方案上来避免这种复杂性。
-
公开(公告)号：US6157731A
公开(公告)日：2000-12-05
申请号：US108892
申请日：1998-07-01
CPC分类号： G06K9/6297 , G06K9/00154
摘要： A signature verification method involves segmenting a smoothed and normalized signature and, for each segment, evaluating at least one local feature, thereby to obtain a feature-value vector. The method further includes computing the likelihood that the segments having the observed sequence of feature values were generated by a particular hidden Markov model, such model comprising a sequence of states having duration probabilities and feature-value histograms. In one aspect, the invention involves explicit state-duration modeling to account for duration in the respective states underlying the unknown signature. In another aspect, the invention involves computing a measure of signature complexity, and setting the number of states of the hidden Markov model according to such complexity measure.
摘要翻译： 签名验证方法包括分割平滑和归一化的签名，并且对于每个段来评估至少一个局部特征，从而获得特征值向量。 该方法还包括计算具有观察到的特征值序列的段由特定隐马尔科夫模型生成的可能性，该模型包括具有持续时间概率和特征值直方图的状态序列。 在一个方面，本发明涉及明确的状态持续时间建模以考虑未知签名下的相应状态的持续时间。 在另一方面，本发明涉及计算签名复杂度的度量，并且根据这种复杂性度量设置隐马尔可夫模型的状态数。
-
公开(公告)号：US5878164A
公开(公告)日：1999-03-02
申请号：US946876
申请日：1997-10-08
CPC分类号： G06K9/00865 , G10L15/18
摘要： A method of handwriting recognition is provided that combines the efficiency of a point oriented system and the shape information of a segment oriented system in an HMM based handwriting recognition system. The partial segmentation hypotheses obtained using the point oriented features in a conventional Viterbi search are augmented with scores based on segmental shape measurements made on the hypothesized segments. In addition, a method for segmentation of a handwriting sample is accomplished by incorporating a feature to distinguish between continuous and not continuous strokes and influencing the indicated hypothesis score by adding a penalty to the contraindicated hypothesis score.
摘要翻译： 提供了一种手写识别方法，其结合了基于HMM的手写识别系统中面向点的系统的效率和面向片段的系统的形状信息。 使用常规维特比搜索中的面向点的特征获得的部分分割假设用基于对假设段进行的分段形状测量的分数进行增强。 此外，手写样本的分割方法是通过结合特征来区分连续笔画和不连续笔画来实现的，并通过对禁忌假说得分加上惩罚来影响指示的假设得分。
-
-
-
-
-
-
-
-
-
搜索结果
38 条记录 (耗时 0.02 秒)
