会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • DECODER AND METHOD FOR DECODING A MESSAGE USING AN ARBITRARY-SIDE GROWING HUFFMAN TREE
    • 解码器和方法,用于解码使用边缘增长HUFFMAN树的信息
    • US20100013679A1
    • 2010-01-21
    • US12177096
    • 2008-07-21
    • YI-SHIN TUNGSUNG-WEN WANGYI-CHIN HUANGJA-LING WU
    • YI-SHIN TUNGSUNG-WEN WANGYI-CHIN HUANGJA-LING WU
    • H03M7/40
    • H03M7/425
    • A decoder for decoding a message using an arbitrary-side growing (ASG) Huffman tree including a plurality of codewords and symbols includes a database, a processing module, and a bit pattern matching module. The database stores a plurality of parameters corresponding to the ASG Huffman tree divided into several sub-trees according to a Hashemian cut operation and a bits-pattern-Xor (BPX) operation. The plurality of parameters include a bit pattern of a sub-tree of the ASG Huffman tree divided according to the BPX operation and a code length of the bit pattern. The processing module receives a bit stream corresponding to the ASG Huffman tree from an encoder. The bit pattern matching module selects bits from the bit stream according to the code length of the bit pattern and decodes the selected bits into a symbol in the ASG Huffman tree by comparing the selected bits with the bit pattern.
    • 使用包括多个码字和符号的任意侧增长(ASG)霍夫曼树来解码消息的解码器包括数据库,处理模块和位模式匹配模块。 数据库根据哈希姆切割操作和比特模式Xor(BPX)操作,将与ASG霍夫曼树相对应的多个参数存储为几个子树。 多个参数包括根据BPX操作划分的ASG霍夫曼树的子树的位模式和位模式的代码长度。 处理模块从编码器接收对应于ASG霍夫曼树的比特流。 比特模式匹配模块根据比特模式的码长选择比特流中的比特,并通过将所选择的比特与比特模式进行比较,将所选择的比特解码成ASG霍夫曼树中的符号。
    • 2. 发明授权
    • Method and system of automatically extracting facial features
    • 自动提取面部特征的方法和系统
    • US06600830B1
    • 2003-07-29
    • US09441607
    • 1999-11-16
    • Chun-Hung LinJa-Ling Wu
    • Chun-Hung LinJa-Ling Wu
    • G06K900
    • G06K9/00268
    • An automatic feature extraction system for analyzing a face image and finding the facial features of the face. In the pre-processing stage, a second-chance region growing method is applied to determine a face region on the face image. In the feature extraction stage, three primary facial features, including both eyes and the mouth, are extracted first. Then other facial features can be extracted according to these extracted primary facial features. Searching feature points can be achieved by calculating the cost function of each point using a simple feature template. In addition, a genetic algorithm can be used to accelerate the process of searching feature points.
    • 一种自动特征提取系统,用于分析面部图像并找到面部的面部特征。 在预处理阶段,应用第二机会区域生长方法来确定面部图像上的面部区域。 在特征提取阶段,首先提取包括眼睛和嘴巴在内的三个主要面部特征。 然后可以根据这些提取的主要面部特征提取其他面部特征。 通过使用简单的特征模板计算每个点的成本函数可以获得搜索特征点。 另外,遗传算法可以用来加快搜索特征点的过程。
    • 4. 发明申请
    • Digital-Invisible-Ink Data Hiding Schemes
    • 数字隐形墨水数据隐藏方案
    • US20080307227A1
    • 2008-12-11
    • US11758725
    • 2007-06-06
    • Chun-Hsiang HuangJa-Ling Wu
    • Chun-Hsiang HuangJa-Ling Wu
    • H04L9/00
    • G06T1/005G06T1/0028G06T2201/0065G06T2201/0202
    • A novel steganographic approach analogous to the real-world secret communication mechanism, in which messages to be concealed are written on white papers using invisible ink like lemon juice or milk and are revealed only after the papers are heated, is proposed. Carefully designed informed-embedders now play the role of “invisible ink”; some pre-negotiated attacks that can be provided by common content processing tools correspond to required “heating” process. Theoretic models and feasible implementations of the proposed digital-invisible-ink (DII) watermarking approach are provided. The proposed DII watermarking schemes can prevent the supervisor from interpreting secret messages even the watermark extractor, decryption tool, as well as session keys are available to the supervisor. Furthermore, under certain steganographic application scenarios, secret communication systems employing the DII watermarking schemes can aggressively mislead the channel supervisor with fake payloads and transmit genuine secrets at the same time.
    • 一种类似于真实秘密通信机制的新颖的隐写方法,其中隐藏的消息是使用隐形墨像柠檬汁或牛奶写在白皮书上,并且仅在纸被加热之后才被揭示。 仔细设计的知情嵌体现在扮演“隐形墨水”的角色; 一些可以由通用内容处理工具提供的预先协商的攻击对应于所需的“加热”过程。 提出了提出的数字不可见墨水(DII)水印方法的理论模型和可行的实现。 即使水印提取器,解密工具以及会话密钥对主管也是可用的,所以提出的DII水印方案可以防止主管人员解密秘密信息。 此外,在某些隐写应用场景下,采用DII水印方案的秘密通信系统可能会以假的有效载荷对信道主管造成误导,同时传输真实的秘密。
    • 6. 发明授权
    • Hidden digital watermarks in images
    • 图像中隐藏的数字水印
    • US06700991B1
    • 2004-03-02
    • US09520058
    • 2000-03-07
    • Ja-Ling WuChiou-Ting Hsu
    • Ja-Ling WuChiou-Ting Hsu
    • G06K900
    • G06T1/0071G06T2201/0052G06T2201/0061
    • An image authentication method by embedding digital watermarks into images, comprising: providing an original image and a watermark image; applying pseudo-random permutations to the watermark image for generating a dispersed watermark image; applying block-based permutations to the original image and the dispersed watermark image in order to form a plurality of original image blocks with each of the watermark blocks dispersed over the corresponding image block only; applying FDCT (Forward Discrete Cosine Transform) on each of the original image blocks independently so that each of the original image blocks is transformed into a DCT coefficient block that corresponds to different frequency ranges; embedding said watermark image blocks into said DCT coefficient blocks, in order to form a plurality of combined DCT coefficient blocks; applying IDCT (Inverse Discrete Cosine Transform) to the combined DCT coefficient blocks to form an embedded watermark image.
    • 一种通过将数字水印嵌入到图像中的图像认证方法,包括:提供原始图像和水印图像; 对水印图像应用伪随机排列以产生分散的水印图像; 对原始图像和分散水印图像应用基于块的排列,以便形成多个原始图像块,其中每个水印块仅分散在对应的图像块上; 对每个原始图像块独立地应用FDCT(前向离散余弦变换),使得每个原始图像块被变换成对应于不同频率范围的DCT系数块; 将所述水印图像块嵌入所述DCT系数块中,以形成多个组合DCT系数块; 将IDCT(逆离散余弦变换)应用于组合的DCT系数块以形成嵌入的水印图像。
    • 7. 发明授权
    • Decoder and method for decoding a message using an arbitrary-side growing Huffman tree
    • 解码器和使用任意边扩展的霍夫曼树解码消息的方法
    • US07663512B2
    • 2010-02-16
    • US12177096
    • 2008-07-21
    • Yi-Shin TungSung-Wen WangYi-Chin HuangJa-Ling Wu
    • Yi-Shin TungSung-Wen WangYi-Chin HuangJa-Ling Wu
    • H03M7/40
    • H03M7/425
    • A decoder for decoding a message using an arbitrary-side growing (ASG) Huffman tree including a plurality of codewords and symbols includes a database, a processing module, and a bit pattern matching module. The database stores a plurality of parameters corresponding to the ASG Huffman tree divided into several sub-trees according to a Hashemian cut operation and a bits-pattern-Xor (BPX) operation. The plurality of parameters include a bit pattern of a sub-tree of the ASG Huffman tree divided according to the BPX operation and a code length of the bit pattern. The processing module receives a bit stream corresponding to the ASG Huffman tree from an encoder. The bit pattern matching module selects bits from the bit stream according to the code length of the bit pattern and decodes the selected bits into a symbol in the ASG Huffman tree by comparing the selected bits with the bit pattern.
    • 使用包括多个码字和符号的任意侧增长(ASG)霍夫曼树来解码消息的解码器包括数据库,处理模块和位模式匹配模块。 数据库根据哈希姆切割操作和比特模式Xor(BPX)操作,将与ASG霍夫曼树相对应的多个参数存储为几个子树。 多个参数包括根据BPX操作划分的ASG霍夫曼树的子树的位模式和位模式的代码长度。 处理模块从编码器接收对应于ASG霍夫曼树的比特流。 比特模式匹配模块根据比特模式的码长选择比特流中的比特,并通过将所选择的比特与比特模式进行比较,将所选择的比特解码成ASG霍夫曼树中的符号。