Отрывок: 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.authorKhokhlachev, A.-
dc.contributor.authorSmirnov, V.-
dc.contributor.authorKorobeynikov, A.-
dc.date.accessioned2017-05-19 10:31:07-
dc.date.available2017-05-19 10:31:07-
dc.date.issued2017-
dc.identifierDspace\SGAU\20170515\63763ru
dc.identifier.citationKhokhlachev 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.urihttp://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.abstractThe 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.isoenru
dc.publisherНовая техникаru
dc.subjectlossless image compressionru
dc.subjectcascading fragmentationru
dc.subjectpixels sequence orderingru
dc.subjectoptimal bypassru
dc.subjectcode bookru
dc.subjectacceleration calculationru
dc.subjectparallel computingru
dc.subjectopen computing language (OpenCL)ru
dc.subjectgraphics processing unit (GPU)ru
dc.subjectcentral processing unit (CPU)ru
dc.subjectintegral-valued Haar waveletsru
dc.subjectinterchannel decorrelationru
dc.titleOpenCL application to accelerate the lossless image compression algorithm based on cascading fragmentation and the pixels sequence orderingru
dc.typeArticleru
dc.textpartFor 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 kBAdobe PDFПросмотреть/Открыть



Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.