نتایج جستجو برای: set partitioning
تعداد نتایج: 689813 فیلتر نتایج به سال:
In this paper, we propose an efficient method for rearranging the wavelet packet coefficients of an image to form hierarchical trees, by which the well known SPIHT algorithm can be applied. For images with textures, the high frequency wavelet coefficients are likely to become significant after several code passes of SPIHT, which degrades substantially the coding performance. As a result, the hi...
Interest in synthesis of Application Specific Instruction Set Processors or ASIPs has increased considerably and a number of methodologies have been proposed for ASIP design. A key step in ASIP synthesis involves deciding architectural features based on application requirements and constraints. In this report we observe the effect of changing register file size on the performance as well as pow...
A recent result of Henning and Southey (A note on graphs with disjoint dominating and total dominating set, Ars Comb. 89 (2008), 159–162) implies that every connected graph of minimum degree at least three has a dominating set D and a total dominating set T which are disjoint. We show that the Petersen graph is the only such graph for which D ∪ T necessarily contains all vertices of the graph.
In recent years, the graph partitioning problem gained importance as a mandatory preprocessing step for distributed graph processing on very large graphs. Existing graph partitioning algorithms minimize partitioning latency by assigning individual graph edges to partitions in a streaming manner — at the cost of reduced partitioning quality. However, we argue that the mere minimization of partit...
The problem of partitioning a square into zones of prescribed areas arises when partitioning matrices for dense linear algebra kernels onto a set of heterogeneous processors, and several approximation algorithms have been proposed for that problem. In this paper, we address the natural generalization of this problem in dimension 3: partition a cuboid in a set of zones of prescribed volumes (whi...
We build on state of the art methods for multiresolution embedded coding of images, such as Said and Pearlman’s Set Partitioning In Hierarchical Trees, and combine them with ideas for 3D objects modelling with subdivision surfaces, to obtain a new technique for hierarchical 3D model coding. The compression ratios we obtain are better than or similar to previously reported ones but, perhaps more...
Many scenarios require single frame random access and error resilience in coding, transmission, and decoding of image sequences. We propose in this paper a SPIHT coder that encodes a sequence of images one frame at a time and uses two methods together to achieve strong error resilience. The first method groups wavelet coefficients into a number of tree blocks and the second one encodes these tr...
This paper presents a new lossy coding scheme based on 3D Wavelet Transform and Lattice Vector Quantization for volumetric medical images. The main contribution of this work is the design of a new codebook enclosing a multidimensional dead zone during the quantization step which enables to better account correlations between neighbour voxels. Furthermore, we present an efficient rate-distortion...
YARDstick is a building block for ASIP development, integrating application analysis, custom instruction generation, selection and synthesis with user-defined compiler intermediate representations.
Among noteworthy zero-tree algorithms is the SPIHT algorithm. For images with textures, high frequency wavelet coefficients are likely to become significant after few scan passes of SPIHT, and therefore the coding results are often insufficient. It is desirable that the low frequency and high frequency components of an image are coded using different strategies. In this paper, we propose a hybr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید