会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Compressed data multiple description transmission and resolution conversion system
    • 压缩数据多描述传输和分辨率转换系统
    • US07720299B2
    • 2010-05-18
    • US11126705
    • 2005-05-10
    • Hsieh S. Hou
    • Hsieh S. Hou
    • G06K9/46H04N7/12H04N11/02H04N11/04G06F17/14
    • G06F17/147H04N19/122H04N19/176H04N19/39H04N19/60
    • A system provides lossless split and merge processes of integer discrete cosine transform (DCT) transformed data such that the discrete cosine transform of one data block may be split into two half length DCT odd and even blocks for merging, with split and merge processes being lossless and are generated in the discrete cosine transformed domain. After splitting, the redundancy existing between the two integer discrete cosine transformed half data blocks allows one to approximately reconstruct the original data block in case one of the discrete cosine transformed half data block is lost during transmission. The system may be used with existing JPEG and MPEG compressors and decompressors because both use the discrete cosine transform for image and video compression and decompression, may be used as a resolution conversion device for transcribing from digital high-definition TV to analog low-definition TV, and may be used for lossless splitting and merging type-IV discrete cosine transformed data for audio compression and decompression in the international standard MPEG-4 Advanced Audio Coding (AAC), such as AC-3 or MP3.
    • 系统提供整数离散余弦变换(DCT)变换数据的无损拆分和合并过程,使得一个数据块的离散余弦变换可以分为两个半长的DCT奇数和偶数块进行合并,其中分割和合并过程是无损的 并在离散余弦变换域中产生。 在分裂之后,存在于两个整数离散余弦变换的半数据块之间的冗余允许在传输期间丢失一个离散余弦变换的半数据块的情况下大致重建原始数据块。 该系统可以与现有的JPEG和MPEG压缩器和解压缩器一起使用,因为它们都使用用于图像和视频压缩和解压缩的离散余弦变换,可以用作用于从数字高清晰度电视转换成模拟低分辨率电视的分辨率转换装置 ,可用于国际标准MPEG-4高级音频编码(AAC)(如AC-3或MP3)中的音频压缩和解压缩的无损分离和合并类型-IV离散余弦变换数据。
    • 2. 发明授权
    • Split-radix discrete cosine transform
    • 分离 - 离散余弦变换
    • US5408425A
    • 1995-04-18
    • US67503
    • 1993-05-25
    • Hsieh S. Hou
    • Hsieh S. Hou
    • G06F17/14G06F7/38
    • G06F17/147
    • A special purpose processor and method of computation for performing an N-length real-number discrete cosine transform (DCT). The algorithm is called the split-radix discrete cosine transform because an Nth order DCT consists of an (N/2)th order DCT and two (N/4)th order inverse DCT (IDCT), where N is an integer power of 2 and larger than 4. In the embodiments of the invention, signal flow-graphs for both the forward and inverse scaled DCT have been implemented based on fused multiply and add operations in pipeline architectures. In the two-dimensional cases, over 20% arithmetic operations are saved compared to other known fast two-dimensional DCT algorithms. In addition, the split-radix DCT method offers flexibility of processing different input sizes under software control.
    • 一种用于执行N长实数离散余弦变换(DCT)的专用处理器和计算方法。 该算法被称为分裂离散余弦变换,因为N阶DCT由(N / 2)次DCT和两个(N / 4)次逆DCT(IDCT)组成,其中N是2的整数幂 并且大于4.在本发明的实施例中,基于流水线结构中的融合乘法和加法运算,已经实现了正向和反向缩放DCT两者的信号流图。 在二维情况下,与其他已知的快速二维DCT算法相比,保存了超过20%的算术运算。 此外,分割DCT方法提供了在软件控制下处理不同输入尺寸的灵活性。
    • 3. 发明授权
    • Halftone image scaling
    • 半色调图像缩放
    • US4611349A
    • 1986-09-09
    • US640200
    • 1984-08-13
    • Hsieh S. Hou
    • Hsieh S. Hou
    • G06T3/40H04N1/393G06K9/36
    • H04N1/3935G06T3/403
    • A method of enlarging or reducing the size of a halftone one bit per pixel raster image without changing the screen pitch is disclosed. First, there is a determination of whether the current byte is on an image edge using any edge detection means. If the current byte is on an edge, the nearest neighbor algorithm is applied to the original image on a bit by bit basis to prevent edge jaggedness. If the current byte is not on an edge, the nearest neighbor algorithm is applied on a byte by byte basis to prevent Moire patterns in the solid areas of the image.
    • 公开了一种在不改变屏幕间距的情况下放大或缩小每个像素光栅图像一比特的半色调尺寸的方法。 首先,使用任何边缘检测装置确定当前字节是否在图像边缘上。 如果当前字节在边缘上,则将最邻近的算法逐位应用于原始图像,以防止边缘锯齿状。 如果当前字节不在边缘,则以逐字节为基础应用最近邻算法,以防止图像的实心区域中的莫尔图案。
    • 6. 发明授权
    • Merge and split fast hartley block transform method
    • 合并和分割快速哈特利块变换方法
    • US07062522B2
    • 2006-06-13
    • US10174894
    • 2002-06-19
    • Hsieh S. Hou
    • Hsieh S. Hou
    • G06F17/14
    • G06F17/142
    • Fast Hartley Transforms in a radix-2 block transform method enables true split and merge transform processing of equal sized data halves for enabling recursive merges and splits in Hartley transform domain without data degradation. Input data in the time domain or spatial domain during either the split and merge radix-2 forward Hartley transform processing is firstly transform processed followed by combinational processing. Whole transformed data is split using combinational processing into transformed data halves in the Hartley transform domain as a true split. The transformed halves are merged using combinational processing into whole merged transformed data in the Hartley transform domain. Time or spatial domain input data can be transformed into the Hartley transform domain in the form of split halves or merged whole. The split halves can be merged by the merge process combinational processing and the merged whole can be split by the split process combinational processing.
    • Fast Hartley以radix-2块变换方法进行转换,可实现相同大小的数据半部的真正的分割和合并变换处理,以实现Hartley变换域中的递归合并和分割,而不会导致数据退化。 在分裂和合并基数2前向哈特利变换处理中的时域或空域中的输入数据首先进行变换处理,然后进行组合处理。 使用组合处理将整个变换的数据分解为Hartley变换域中的变换数据,作为真正的分割。 使用组合处理将转换的一半合并到Hartley变换域中的整个合并的变换数据中。 时间或空间域输入数据可以分成两半或合并整体的形式转换成哈特利变换域。 分割一半可以通过合并过程组合处理合并,合并后的整体可以通过分割过程组合处理进行分割。
    • 8. 发明申请
    • Low power Fast Hadamard transform
    • 低功率快速Hadamard变换
    • US20080288568A1
    • 2008-11-20
    • US11803652
    • 2007-05-14
    • Hsieh S. Hou
    • Hsieh S. Hou
    • G06F17/14
    • G06F17/145
    • Fast Hadamard transforms (FHT) are implemented using a pipelined architecture having an input stage, a processing stage, and an output stage, the FHT having a single internal loop back between the output stage and the input stage, the processing stage having at least one Hadamard processing unit. The FHT implementations provided both forward and inverse transformations, and, lossless normalized and lossfull unnormalized transformations, while the FHT implementation includes only multiplexers, demultiplexer, latches, and shift registers, and while, the processing unit stage includes processing units using only shift registers and effective adders, for fast, low power, and low weight Hadamard transform implementations.
    • 使用具有输入级,处理级和输出级的流水线架构实现快速Hadamard变换(FHT),FHT在输出级和输入级之间具有单个内部循环,处理级具有至少一个 哈达玛处理单元 FHT实现提供正向和反向变换,以及无损归一化和损耗非标准化变换,而FHT实现仅包括多路复用器,解复用器,锁存器和移位寄存器,而处理单元级包括仅使用移位寄存器的处理单元 有效的加法器,用于快速,低功耗和低重量的Hadamard变换实现。
    • 9. 发明授权
    • Merge and split fast fourier block transform method
    • 合并和分割快速傅里叶变换方法
    • US07099909B2
    • 2006-08-29
    • US10177197
    • 2002-06-19
    • Hsieh S. Hou
    • Hsieh S. Hou
    • G06F17/14
    • G06F17/142
    • Fast Fourier Transforms in a radix-2 block transform method enables true split and merge transform processing of equal sized data halves in the Fourier transform domain for enabling recursive merges and splits in Fourier transform domain without data degradation. Input data in the time domain or spatial domain during either the split and merge radix-2 forward transform processing is firstly transform processed followed by combinational processing. Whole transformed data is split using combinational processing into transformed data halves in the transform domain as a true split. Transform halves are merged using combinational processing into whole merged transformed data in the transform domain. Time or spatial domain input data can be transformed into the transform domain in the form of split halves or merged whole. The split halves can be merged by the merge process combinational processing and the merged whole are split by the split process combinational processing.
    • 基数2块变换方法中的快速傅里叶变换使得在傅里叶变换域中相等大小的数据半部能够进行真正的分割和合并变换处理,以实现傅里叶变换域中的递归合并和分割,而不会降低数据。 在分裂和合并基数2正交变换处理期间,在时域或空域中的输入数据首先进行变换处理,然后进行组合处理。 使用组合处理将变换后的数据分解为变换域中的变换数据,作为真正的分割。 使用组合处理将变换半部分合并成变换域中的全部合并变换数据。 时间或空间域输入数据可以以分割半部或合并整体的形式转换为变换域。 分割一半可以通过合并过程组合处理合并,合并后的整体由分割过程组合处理分割。
    • 10. 发明授权
    • Merge and split Karhunen-Loeve block transform method
    • 合并和分裂Karhunen-Loeve块变换方法
    • US07047267B2
    • 2006-05-16
    • US10175397
    • 2002-06-19
    • Hsieh S. Hou
    • Hsieh S. Hou
    • G06F17/14
    • G06F17/14
    • Discrete Karhunen-Loeve Transforms in a radix-2 block transform method enables true split and merge transform processing of equal sized data halves in the KLT domain for enabling recursive merges and splits in the KLT domain without data degradation. Input data in the time domain or spatial domain during either the split and merge radix-2 forward transform processing is firstly transform processed followed by combinational processing. Whole transformed data is split using combinational processing into transformed halves in the transform domain as a true split. Transformed halves are merged using combinational processing into whole merged transformed data in the transform domain. Time or spatial domain input data can be transformed into the transform domain in the form of split halves or merged whole. The split halves are merged by the merge process combinational processing and the merged whole are split by the split process combinational processing.
    • 离散Karhunen-Loeve以基数2块变换方法进行转换,可以在KLT域中实现相同大小的数据半部的真正的分割和合并变换处理,以实现KLT域中的递归合并和分割,而不会导致数据退化。 在分裂和合并基数2正交变换处理期间,在时域或空域中的输入数据首先进行变换处理,然后进行组合处理。 使用组合处理将整个变换后的数据分解为变换域中的转换半部,作为真正的分割。 转换半部分使用组合处理合并到变换域中的全部合并变换数据中。 时间或空间域输入数据可以以分割半部或合并整体的形式转换为变换域。 分割一半由合并过程组合处理合并,合并后的整体由分割过程组合处理分割。