会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明专利
    • Image processing device
    • 图像处理装置
    • JP2013109190A
    • 2013-06-06
    • JP2011254647
    • 2011-11-22
    • Yamaha Corpヤマハ株式会社
    • FUNAKUBO NORIYUKI
    • G09G5/38G09G5/00H04N5/66
    • PROBLEM TO BE SOLVED: To prevent drawing performance from being extremely lowered even when a plurality of sprites are included in a line to be rendered in an image processing device of a line buffer method.SOLUTION: A plurality of code buffers are provided with a ROM interface that connects a ROM in which compression data of a sprite is stored with an image processing device. Any code buffer is assigned to each compression data item to be read out. As long as a vacancy is available in the assigned code buffer, compression data is read out by a predetermined amount to be held in the code buffer. When the decoding of the compression data is completed, the assignment is released.
    • 要解决的问题:即使当在行缓冲方法的图像处理装置中要渲染的行中包括多个精灵时,也防止绘图性能极度降低。 解决方案:多个代码缓冲器设置有ROM接口,该ROM接口连接存储精灵的压缩数据的ROM与图像处理装置。 任何代码缓冲区被分配给要读出的每个压缩数据项。 只要分配的代码缓冲器中存在空位,就将压缩数据读出预定的量以保存在代码缓冲器中。 当压缩数据的解码完成时,分配被释放。 版权所有(C)2013,JPO&INPIT
    • 2. 发明专利
    • Data structure and access method of font set compression data
    • FONT SET压缩数据的数据结构和访问方法
    • JP2012147061A
    • 2012-08-02
    • JP2011001613
    • 2011-01-07
    • Yamaha Corpヤマハ株式会社
    • NISHIKAWA YUKINARIFUNAKUBO NORIYUKI
    • H03M7/30G06F17/21
    • PROBLEM TO BE SOLVED: To facilitate random access to any font compression data in an aggregate of variable length font compression data and also reduce the code amount of font compression data for one font set.SOLUTION: A group of variable length font compression data is divided into a prescribed number of pieces, and each pieces of font compression data are combined every prescribed number of pieces of font compression data to create font compression data units FDUk consisting of arrays of data, each divided to a fixed length, which are then stored in a storage medium. At the same time, an address header 1 which consists of address data indicating the start address of each font compression data unit stored in the storage medium is stored in the storage medium. Also, each font compression data unit FDU has a distance header 21 included therein which includes a prescribed number of pieces of fixed length distance data identifying the respective positions of the font compression data of a prescribed number of fonts.
    • 要解决的问题:为了方便随机访问可变长度字体压缩数据的集合中的任何字体压缩数据,并且还减少一个字体集的字体压缩数据的代码量。 解决方案:将一组可变长字体压缩数据分成规定数量,并且将每个字体压缩数据按规定数量的字体压缩数据组合,以创建由阵列组成的字体压缩数据单元FDUk 的数据,每个分成固定长度,然后将其存储在存储介质中。 同时,由存储在存储介质中的表示每个字体压缩数据单元的起始地址的地址数据组成的地址头1存储在存储介质中。 此外,每个字体压缩数据单元FDU具有其中包括的距离标题21,其包括标识规定数量的字体的字体压缩数据的各个位置的规定数量的固定长度距离数据。 版权所有(C)2012,JPO&INPIT
    • 3. 发明专利
    • Method for compression encoding and decoding of bitmap font, program, and data structure of compression-encoded data
    • 压缩编码数据的BITMAP FONT,PROGRAM和数据结构的压缩编码和解码方法
    • JP2012032667A
    • 2012-02-16
    • JP2010173132
    • 2010-07-30
    • Yamaha Corpヤマハ株式会社
    • NISHIKAWA YUKINARIFUNAKUBO NORIYUKI
    • G09G5/00G09G5/24H04N1/41
    • PROBLEM TO BE SOLVED: To improve a compression rate of compression-encoded data of a bitmap font and decode the bitmap font from the compression-encoded data line by line.SOLUTION: A bitmap font constructed with X dots in a horizontal direction and Y dots in a vertical direction is segmented into X/K pieces of sub-blocks each constructed with K dots in the horizontal direction and Y dots in the vertical direction. Each of the sub-blocks is further segmented into small blocks each constructed with K dots in the horizontal direction and 1 dot in the vertical direction. In each of X/K pieces of the sub-blocks, a same-data number, the number of times that the small blocks of the same content continue in the vertical direction, is Huffman coded, and real data, the content of continuous small blocks, is also Huffman coded.
    • 要解决的问题:提高位图字体的压缩编码数据的压缩率,并逐行从压缩编码数据解码位图字体。 解决方案:在水平方向上用X点构成的位图字体和垂直方向上的Y点被分割成每个由水平方向上的K点构成的X / K个子块以及垂直方向上的Y点 。 每个子块被进一步分割成小块,每个块在水平方向上用K点构成,在垂直方向上构成1个点。 在X / K个子块中的每个子块中,相同数据数,相同内容的小块在垂直方向上继续的次数是霍夫曼编码,实数据,连续小数的内容 块,也是霍夫曼编码。 版权所有(C)2012,JPO&INPIT
    • 4. 发明专利
    • Image processor
    • 图像处理器
    • JP2011097371A
    • 2011-05-12
    • JP2009249462
    • 2009-10-29
    • Yamaha Corpヤマハ株式会社
    • SUZUKI KUNIKAZUFUNAKUBO NORIYUKI
    • H04N19/00H04N19/102H04N19/134H04N19/136H04N19/189H04N19/196H04N19/21H04N19/423H04N19/44H04N19/50H04N19/503H04N19/61H04N19/625H04N19/91
    • PROBLEM TO BE SOLVED: To accelerate processing from the decoding of compression encoded image data and compression encoded alpha data to alpha blending using the decoded result. SOLUTION: A moving image decoder 25 decodes compression encoded image data and supplies the decoded result to an external memory I/F 27. An alpha data decoder 26 decodes compression encoded alpha data, and when alpha data obtained by decoding is alpha data with a resolution of other than 4 bits, converts the alpha data to the alpha data with a resolution of 4 bits and supplies it to the external memory I/F 27. The external memory I/F 27 transfers the decoded results supplied from the moving image decoder 25 and the alpha data decoder 26 respectively through a bus I/F 21C to an external memory module 102. COPYRIGHT: (C)2011,JPO&INPIT
    • 要解决的问题:使用解码结果加速从压缩编码图像数据的解码和压缩编码的alpha数据到α混合的处理。 解决方案:运动图像解码器25对压缩编码图像数据进行解码并将解码结果提供给外部存储器I / F27.α数据解码器26解码压缩编码的alpha数据,并且当通过解码获得的α数据是α数据 以4位以外的分辨率将alpha数据以4位的分辨率转换为alpha数据,并将其提供给外部存储器I / F 27.外部存储器I / F 27传送从移动中提供的解码结果 图像解码器25和阿尔法数据解码器26分别通过总线I / F 21C连接到外部存储器模块102.版权所有:(C)2011,JPO&INPIT
    • 5. 发明专利
    • Memory access control device
    • 存储器访问控制装置
    • JP2011097197A
    • 2011-05-12
    • JP2009247123
    • 2009-10-27
    • Yamaha Corpヤマハ株式会社
    • FUNAKUBO NORIYUKI
    • H04N19/50G06F12/08G06F12/12H04N19/423H04N19/44
    • H04N19/423H04N19/44H04N19/61
    • PROBLEM TO BE SOLVED: To efficiently supply image data from an external memory to a moving image decoder without redundantly generating a read request of the image data. SOLUTION: When a cache table 122 has neither an address in a frame of image data to be acquired needed to obtain image data requested by a data request nor a table area storing a validity flag indicating validity, a data request processing part 121 selects one table area as a table area TA(k) to be updated, stores addresses XB(k) and YB(k) in the frame of the image data to be acquired and a validity flag VALID(k) indicating invalidity into the table area TA(k) to be updated, and outputs a read request for commanding to transfer the image data to be acquired from an external memory module 102 to a cache memory 11. When the image data to be acquired is read and stored into a cache area CA(k), the validity flag VALID(k) is made valid. COPYRIGHT: (C)2011,JPO&INPIT
    • 要解决的问题:在不冗余地生成图像数据的读取请求的情况下,有效地将图像数据从外部存储器提供给运动图像解码器。 解决方案:当高速缓存表122既没有获取要获取的图像数据的帧中的地址以获得由数据请求请求的图像数据,也没有存储指示有效性的有效标志的表区域时,数据请求处理部分121 选择一个表区域作为要更新的表区域TA(k),将要获取的图像数据的帧中存储地址XB(k)和YB(k)以及表示无效的有效标志VALID(k) 区域TA(k)被更新,并且输出用于命令将要从外部存储器模块102获取的图像数据传送到高速缓存存储器11的读取请求。当要获取的图像数据被读取并存储到高速缓存 区域CA(k),使有效标志VALID(k)有效。 版权所有(C)2011,JPO&INPIT
    • 6. 发明专利
    • Image data compression/expansion method, and image processing apparatus
    • 图像数据压缩/扩展方法和图像处理装置
    • JP2006005740A
    • 2006-01-05
    • JP2004181146
    • 2004-06-18
    • Yamaha Corpヤマハ株式会社
    • FUNAKUBO NORIYUKI
    • H04N19/50H04N19/503H04N19/61H04N19/625H04N19/63H04N19/90
    • H04N19/23H04N19/00H04N19/12
    • PROBLEM TO BE SOLVED: To provide an image data compression/expansion method and an image processing apparatus which can attain a higher compression rate, and moreover, do not produce a blur at the edge part of a character. SOLUTION: A reference image data is irreversibly compressed, while a mask data indicative of a transparent part of the reference image data is reversibly compressed. Next, each mask data indicative of a transparent part of one or a plurality of original image data following the reference image data is reversibly compressed, while difference data between the one or the plurality of original image data and the reference image data is irreversibly compressed respectively. Next, an original image data next to the one or the plurality of original image data is irreversibly compressed as a reference image data, while a mask data indicative of a transparent part of the reference image data is reversibly compressed. Then, each mask data of one or a plurality of original image data following the reference image data is reversibly compressed, while difference data between the one or the plurality of original image data and the references image data is irreversibly compressed respectively. The above-mentioned processing is repeated. COPYRIGHT: (C)2006,JPO&NCIPI
    • 解决的问题:提供可以获得更高压缩率的图像数据压缩/扩展方法和图像处理装置,此外,不会在字符的边缘部分产生模糊。 解决方案:参考图像数据被不可逆地压缩,而指示参考图像数据的透明部分的掩模数据被可逆地压缩。 接下来,可逆地压缩指示参考图像数据之后的一个或多个原始图像数据的透明部分的每个掩模数据,同时一个或多个原始图像数据与参考图像数据之间的差分数据被不可逆地压缩 。 接下来,一个或多个原始图像数据旁边的原始图像数据被不可逆地压缩为参考图像数据,而指示参考图像数据的透明部分的掩模数据被可逆地压缩。 然后,在参考图像数据之后的一个或多个原始图像数据的每个掩模数据被可逆地压缩,而一个或多个原始图像数据与参考图像数据之间的差分数据分别被不可逆地压缩。 重复上述处理。 版权所有(C)2006,JPO&NCIPI
    • 9. 发明专利
    • Memory controller
    • 内存控制器
    • JP2008299438A
    • 2008-12-11
    • JP2007142477
    • 2007-05-29
    • Yamaha Corpヤマハ株式会社
    • HARANO ATSUSHIFUNAKUBO NORIYUKI
    • G06F12/02G06F12/00G06T1/60
    • PROBLEM TO BE SOLVED: To suppress occurrence frequency of a precharge cycle in the case of performing decoding processing of the compression-encoded data of a moving image by using a DRAM or the like. SOLUTION: A write access control part 52 and a read access control part 54 are provided with a function for performing address conversion processing. In the address conversion processing, when the logical address of image data designated by an access request is converted into a memory address to specify the storage area of the image data in an image memory 11, the conversion of the logical address into the memory address is executed, as regards each block acquired by dividing a picture into a plurality of blocks of the predetermined pixel size, according to a conversion rule for converting each logical address of the image data of each pixel in the same block into a plurality of memory addresses whose row addresses are the same, and whose column addresses are different. COPYRIGHT: (C)2009,JPO&INPIT
    • 要解决的问题:在通过使用DRAM等进行运动图像的压缩编码数据的解码处理的情况下,抑制预充电循环的发生频率。 解决方案:写访问控制部分52和读访问控制部分54具有执行地址转换处理的功能。 在地址转换处理中,当将由访问请求指定的图像数据的逻辑地址转换为存储器地址以指定图像存储器11中的图像数据的存储区域时,将逻辑地址转换为存储器地址是 通过根据用于将同一块中的每个像素的图像数据的每个逻辑地址转换成多个存储器地址的转换规则,对于通过将图像划分成多个预定像素大小的块而获取的每个块执行 行地址相同,列地址不同。 版权所有(C)2009,JPO&INPIT
    • 10. 发明专利
    • Image processor
    • 图像处理器
    • JP2014013278A
    • 2014-01-23
    • JP2012149998
    • 2012-07-03
    • Yamaha Corpヤマハ株式会社
    • FUNAKUBO NORIYUKI
    • G09G5/00G06T1/60G09G3/20G09G5/36
    • PROBLEM TO BE SOLVED: To efficiently display a rotated or deformed sprite without using a large capacity of work memory in a line buffer type image processor.SOLUTION: A controller 103 sequentially commands an image data generation part 105 to generate image data of each block precedently to display of image data of each block obtained by dividing a sprite in an LCD 202 in each vertical scanning period, and the image data generation part 105 decodes compressed encoded data of a commanded block, generates image data of the block and stores the image data in a work memory 108 as a virtual memory through an MMU 107. A line buffer drawing part 112 generates image data for one line to be displayed in each horizontal scanning period on the basis of the image data in the work memory 108. The MMU 107 prepares a page storing image data of a block in which all of four vertexes in each page of the work memory 108 belong to a horizontally scanned area for storage of new image data and releases the page.
    • 要解决的问题:在线缓冲型图像处理器中不使用大容量工作存储器来有效地显示旋转或变形的子画面。解决方案:控制器103依次命令图像数据生成部件105生成每个块的图像数据 通过在每个垂直扫描周期中显示LCD 202中的子画面而获得的每个块的图像数据,并且图像数据生成部105解码被命令块的压缩编码数据,生成块的图像数据并存储图像数据 在工作存储器108中作为通过MMU 107的虚拟存储器。行缓冲器绘制部分112基于工作存储器108中的图像数据,在每个水平扫描周期中生成要显示的一行的图像数据。MMU 107 准备存储块的图像数据的页面,其中工作存储器108的每页中的所有四个顶点都属于用于存储新图像数据的水平扫描区域,并且释放 页面。