|
|
【答案】應(yīng)助回帖
商家已經(jīng)主動(dòng)聲明此回帖可能含有宣傳內(nèi)容
★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ... yuxintian: 金幣+70, 翻譯EPI+1, ★★★★★最佳答案, 太感謝了,確實(shí)翻譯得很好 2015-10-10 05:22:13
Jacquin在 他的論文中提出,一個(gè)圖像 不應(yīng)該認(rèn)為 是 整個(gè)圖像的 變形拷貝和粘貼,而應(yīng)該是 圖像的 小部分的 變形拷貝和粘貼。例如,云的 一部分 當(dāng)然不會(huì)像 帶有云的 整個(gè)風(fēng)景,但 卻可能 發(fā)現(xiàn)云 或其它結(jié)構(gòu)的 另一小部分 看起來(lái)像云,由此打破了 全局迭代函數(shù) 映射 的 僵硬觀點(diǎn),為 圖像壓縮研究 帶來(lái)了 新的方向。他實(shí)現(xiàn)了 第一個(gè) 自動(dòng)分形壓縮 系統(tǒng),如圖4.1所示,首先 把圖像 劃分成 固定大小的方塊,然后對(duì) 每個(gè)小塊 尋找匹配的 圖像區(qū)域。這種 構(gòu)造 被稱為 局部的 或分區(qū)的 迭代函數(shù)系統(tǒng)。
Jacquin proposed in this paper that a image should not be regarded as the anamorphic copy and paste version of the whole image,but should be regarded as the anamorphic copy and paste version of a small part of whole image. For example, a small part of cloud is surely not like the whole scenery where the cloud is included, but it may probably find that a small part of cloud or other structure looks like the cloud. Therefore the opinion of global iteration function mapping was broken, charting a new approach for image compression study. He is the first one who realizes the automatic fractal compression system shown in Fig.4.1. First, the image is divided into blocks in a constant size, the each block seeks the matched image region. Such structure is called the regional or divisional IFS.
為 每一個(gè)小塊 尋找 匹配的 圖像區(qū)域,實(shí)際上 就是尋找 該小塊的 局部迭代函數(shù)系統(tǒng)或 生成元,把 該圖像區(qū)域 稱為 定義域塊(domain塊) ,而 把要匹配的 每個(gè)小塊稱 為 值域塊(range塊) 。一般 所選定義域塊 的邊長(zhǎng) 為值域塊邊長(zhǎng) 的兩倍大小,要把它 收縮到 和 值域塊 一樣大小后 才可以 匹配值域塊。由前面所述,生成元 映射形 如 , 其中 a為壓縮系數(shù), b為偏移量,c 為收縮后的 定義域塊,稱為 代碼本塊,d 為維數(shù)與 一致的 單位向量。匹配過(guò)程 就是尋找 c,使之滿足方程1 。
Actually, seeking the matched image region for each block is to reach the local iteration function system or the generating element for each block. The image region is called domain block, while each block is called range block. Normally, the side length of domain block is twice larger than that of range block, the two blocks can be matched with each other after their side lengths are equal. Based on former analysis, the generating element mapping is like..., wherein, a is the compression coefficient, b is offset, c is the domain block after compression, which is called codebook block, d is the unit vector with the same dimensions as that of....The matching process is actually the process of seeking c, making it meet the equation 1. |
|