|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM195862619 |
| 003 |
DE-627 |
| 005 |
20231223203601.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231223s2010 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2010.2045702
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0653.xml
|
| 035 |
|
|
|a (DE-627)NLM195862619
|
| 035 |
|
|
|a (NLM)20236891
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Anastasia, Davide
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Software designs of image processing tasks with incremental refinement of computation
|
| 264 |
|
1 |
|c 2010
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 29.11.2010
|
| 500 |
|
|
|a Date Revised 23.07.2010
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status MEDLINE
|
| 520 |
|
|
|a Software realizations of computationally-demanding image processing tasks (e.g., image transforms and convolution) do not currently provide graceful degradation when their clock-cycles budgets are reduced, e.g., when delay deadlines are imposed in a multitasking environment to meet throughput requirements. This is an important obstacle in the quest for full utilization of modern programmable platforms' capabilities since worst-case considerations must be in place for reasonable quality of results. In this paper, we propose (and make available online) platform-independent software designs performing bitplane-based computation combined with an incremental packing framework in order to realize block transforms, 2-D convolution and frame-by-frame block matching. The proposed framework realizes incremental computation: progressive processing of input-source increments improves the output quality monotonically. Comparisons with the equivalent nonincremental software realization of each algorithm reveal that, for the same precision of the result, the proposed approach can lead to comparable or faster execution, while it can be arbitrarily terminated and provide the result up to the computed precision. Application examples with region-of-interest based incremental computation, task scheduling per frame, and energy-distortion scalability verify that our proposal provides significant performance scalability with graceful degradation
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 700 |
1 |
|
|a Andreopoulos, Yiannis
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 19(2010), 8 vom: 03. Aug., Seite 2099-114
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:19
|g year:2010
|g number:8
|g day:03
|g month:08
|g pages:2099-114
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2010.2045702
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 19
|j 2010
|e 8
|b 03
|c 08
|h 2099-114
|