Non-uniform Segmentation Research Articles

A Novel Algorithm for Color Space Conversion Model from CMYK to LAB

Color space conversion has become a very important role in the image acquisition, display and the transmission of the color information in the replication. Printers and Image setter express color by CMYK space. But if color is edited and corrected in the CMYK space, it will cause a greater loss of color, and the Computing of computer will also be slowed down. So it often needs to be converted to a LAB uniform color space. Among the previous conversion methods, there is a widespread problem that is dark color tones is a little larger. In view of the problem above, we put forward a non-uniform segmentation method: with Prism geometry linear interpolation method and Pyramid linear geometry interpolation method, doing color modeling for color inkjet printer, realizing the conversion of CMYK and LAB (positive) color space; Meanwhile, we explore techn ical difficulties and the realization process of this method and give a comparison with these two testing results . Through the analysis of the results of the modeling, it can be seen that: The feature of these tow color space conversion method s we proposed in this paper is small in chromatic aberration, effective and simple. This method can also be applied to other color space conversion.

Compact Numerical Function Generators Based on Quadratic Approximation: Architecture and Synthesis Method

This paper presents an architecture and a synthesis method for compact numerical function generators (NFGs) for trigonometric, logarithmic, square root, reciprocal, and combinations of these functions. Our NFG partitions a given domain of the function into non-uniform segments using an LUT cascade, and approximates the given function by a quadratic polynomial for each segment. Thus, we can implement fast and compact NFGs for a wide range of functions. Experimental results show that: 1) our NFGs require, on average, only 4% of the memory needed by NFGs based on the linear approximation with non-uniform segmentation; 2) our NFG for 2x-1 requires only 22% of the memory needed by the NFG based on a 5th-order approximation with uniform segmentation; and 3) our NFGs achieve about 70% of the throughput of the existing table-based NFGs using only a few percent of the memory. Thus, our NFGs can be implemented with more compact FPGAs than needed for the existing NFGs. Our automatic synthesis system generates such compact NFGs quickly.

Periodic broadcasting with VBR-encoded video

We consider designing near video on demand (NVOD) systems that minimize startup latency while maintaining high image quality. Recently nonuniform segmentation has been used to develop periodic broadcasting techniques for NVOD. These techniques give significant reductions in startup latency as compared with more conventional uniform segmentation. Essentially all of these schemes assume, however, that the videos are CBR-encoded. Since a CBR-encoded video has a larger average rate than an open-loop VBR encoding with the same image quality, there is potential to obtain further performance improvements by using VBR video. In this paper we develop a series of multiplexing schemes for the periodic broadcasting of VBR-encoded video that are based on smoothing, server buffering, and client prefetching. Two key but conflicting performance measures exist when using VBR video: latency and packet loss. By introducing small additional delays in our multiplexing schemes, our trace-based numerical work shows that the schemes can achieve nearly 100% link utilization with negligible packet loss. When the ratio of the CBR rate to the VBR average rate is a modest 1.8, startup latency can be reduced by a factor of four or more for common scenarios.