Отрывок: For each fragment is need to find the cost of the bypass: ߑ௦ = ∑ Cost(߂) ⋅ ݖೞாୀଵ (8) where E – length of bypass (number of edges); e - edge index; S - number of bypasses; s - bypass index; ∆e - delta-code of edge; zes – presence an edge e in bypass s; Cost – is the some estimation function of encoding cost, it is similar to the Cost in interchannel decorrelation function. It should be noted that the estimate of by...
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Khokhlachev, A. | - |
dc.contributor.author | Smirnov, V. | - |
dc.contributor.author | Korobeynikov, A. | - |
dc.date.accessioned | 2017-05-19 10:31:07 | - |
dc.date.available | 2017-05-19 10:31:07 | - |
dc.date.issued | 2017 | - |
dc.identifier | Dspace\SGAU\20170515\63763 | ru |
dc.identifier.citation | Khokhlachev A. OpenCL application to accelerate the lossless image compression algorithm based on cascading fragmentation and the pixels sequence ordering / A. Khokhlachev, V. Smirnov, A. Korobeynikov // Сборник трудов III международной конференции и молодежной школы «Информационные технологии и нанотехнологии» (ИТНТ-2017) - Самара: Новая техника, 2017. - С. 676-683. | ru |
dc.identifier.uri | http://repo.ssau.ru/handle/Informacionnye-tehnologii-i-nanotehnologii/OpenCL-application-to-accelerate-the-lossless-image-compression-algorithm-based-on-cascading-fragmentation-and-the-pixels-sequence-ordering-63763 | - |
dc.description.abstract | The previous papers of authors describes approach to building the ordered sequence of image pixels at lossless compression, which comprises methods of cascading fragmentation, and code book. For fragment sized 6*6 the code book contained 22144 various bypasses, every must be estimated for the cost of coding. The search of optimal bypass is an exhaustive search. Present paper describes increasing the image lossless compression speed by using parallel computing based on OpenCL. Algorithm functions with great runtime were changed, in order to transfer calculations to OpenCL using GPU/CPU. Gained in experiments acceleration degree for different algorithm functions ranging in 3..32. | ru |
dc.language.iso | en | ru |
dc.publisher | Новая техника | ru |
dc.subject | lossless image compression | ru |
dc.subject | cascading fragmentation | ru |
dc.subject | pixels sequence ordering | ru |
dc.subject | optimal bypass | ru |
dc.subject | code book | ru |
dc.subject | acceleration calculation | ru |
dc.subject | parallel computing | ru |
dc.subject | open computing language (OpenCL) | ru |
dc.subject | graphics processing unit (GPU) | ru |
dc.subject | central processing unit (CPU) | ru |
dc.subject | integral-valued Haar wavelets | ru |
dc.subject | interchannel decorrelation | ru |
dc.title | OpenCL application to accelerate the lossless image compression algorithm based on cascading fragmentation and the pixels sequence ordering | ru |
dc.type | Article | ru |
dc.textpart | For each fragment is need to find the cost of the bypass: ߑ௦ = ∑ Cost(߂) ⋅ ݖೞாୀଵ (8) where E – length of bypass (number of edges); e - edge index; S - number of bypasses; s - bypass index; ∆e - delta-code of edge; zes – presence an edge e in bypass s; Cost – is the some estimation function of encoding cost, it is similar to the Cost in interchannel decorrelation function. It should be noted that the estimate of by... | - |
Располагается в коллекциях: | Информационные технологии и нанотехнологии |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
paper 126_676-683.pdf | Основная статья | 329.41 kB | Adobe PDF | Просмотреть/Открыть |
Показать базовое описание ресурса
Просмотр статистики
Поделиться:
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.