scispace - formally typeset
Search or ask a question
Topic

Subpixel rendering

About: Subpixel rendering is a research topic. Over the lifetime, 3885 publications have been published within this topic receiving 82789 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: This paper attempts to achieve fine spatial and temporal resolution land cover CD with a new computer technology based on subpixel mapping (SPM): the fine spatialresolution land cover maps (FRMs) are predicted through SPM of the coarse spatial but fine temporal resolution images, and then, subpixel resolution CD is performed by comparison of class labels in the SPM results.
Abstract: Due to rapid changes on the Earth's surface, it is important to perform land cover change detection (CD) at a fine spatial and fine temporal resolution. However, remote sensing images with both fine spatial and temporal resolutions are commonly not available or, where available, may be expensive to obtain. This paper attempts to achieve fine spatial and temporal resolution land cover CD with a new computer technology based on subpixel mapping (SPM): The fine spatial resolution land cover maps (FRMs) are first predicted through SPM of the coarse spatial but fine temporal resolution images, and then, subpixel resolution CD is performed by comparison of class labels in the SPM results. For the first time, five fast SPM algorithms, including bilinear interpolation, bicubic interpolation, subpixel/pixel spatial attraction model, Kriging, and radial basis function interpolation methods, are proposed for subpixel resolution CD. The auxiliary information from the known FRM on one date is incorporated in SPM of coarse images on other dates to increase the CD accuracy. Based on the five fast SPM algorithms and the availability of the FRM, subpixels for each class are predicted by comparison of the estimated soft class values at the target fine spatial resolution and borrowing information from the FRM. Experiments demonstrate the feasibility of the five SPM algorithms using FRM in subpixel resolution CD. They are fast methods to achieve subpixel resolution CD.

47 citations

Journal ArticleDOI
TL;DR: The ability of HDM to accurately and reproducibly measure displacement and regional function in the beating heart and the repeatability of using this method to compute RSW was assessed.

47 citations

Book ChapterDOI
06 Sep 2014
TL;DR: A comprehensive statistical evaluation of selected state-of-the-art stereo matching approaches on an extensive dataset is presented and reference values for the precision limits actually achievable in practice are established.
Abstract: Modern applications of stereo vision, such as advanced driver assistance systems and autonomous vehicles, require highest precision when determining the location and velocity of potential obstacles. Subpixel disparity accuracy in selected image regions is therefore essential. Evaluation benchmarks for stereo correspondence algorithms, such as the popular Middlebury and KITTI frameworks, provide important reference values regarding dense matching performance, but do not sufficiently treat local sub-pixel matching accuracy. In this paper, we explore this important aspect in detail. We present a comprehensive statistical evaluation of selected state-of-the-art stereo matching approaches on an extensive dataset and establish reference values for the precision limits actually achievable in practice. For a carefully calibrated camera setup under real-world imaging conditions, a consistent error limit of 1/10 pixel is determined. We present guidelines on algorithmic choices derived from theory which turn out to be relevant to achieving this limit in practice.

47 citations

Journal ArticleDOI
TL;DR: Motion estimation in the DCT domain instead of the spatial domain simplifies the conventional hybrid DCT-based video coder, especially the heavily loaded feedback loop in the conventional design, resulting in a fully D CT-based high-throughput video codec.
Abstract: Currently existing subpixel motion estimation algorithms require interpolation of interpixel values which undesirably increases the overall complexity and data flow and deteriorates the estimation accuracy. We develop discrete cosine transform (DCT)-based techniques to estimate subpel motion at different desired subpel levels of accuracy in the DCT domain without interpolation. We show that subpixel motion information is preserved in the DCT of a shifted signal under some condition in the form of pseudophases, and we establish subpel sinusoidal orthogonal principles to extract this information. The proposed subpixel techniques are flexible and scalable in terms of estimation accuracy with very low computational complexity O(N/sup 2/) compared to O(N/sup 4/) for the full-search block-matching approach and its subpixel versions. Above all, motion estimation in the DCT domain instead of the spatial domain simplifies the conventional hybrid DCT-based video coder, especially the heavily loaded feedback loop in the conventional design, resulting in a fully DCT-based high-throughput video codec. In addition, the computation of pseudophases is local, and thus a highly parallel architecture is feasible for the DCT-based algorithms. Finally, simulation on video sequences of different characteristics shows comparable performance of the proposed algorithms to block-matching approaches.

47 citations

Patent
04 Apr 1991
TL;DR: In this article, a graphics processing apparatus carries out an antialiasing for obtaining an output image having smooth edges, enabling a speedy computation of approximate shading area rates of pixels by making use of neither a subpixel dividing process nor a shading pixel counting process.
Abstract: A graphics processing apparatus carries out an antialiasing for obtaining an output image having smooth edges, enabling a speedy computation of approximate shading area rates of pixels by making use of neither a subpixel dividing process nor a shading pixel counting process. The apparatus comprises a discriminating part for discriminating the presence of an end point pixel at an edge portion of an image defined by a vector data, a computing part for computing the number of edge pixels by extracting two integer parts a, b from x coordinate values Xa, Xb of two points where a scanline intersects the vector data, a setting part for setting a x coordinate value of the end point pixel to the Xb only when an end point pixel is found at the edge portion, an approximate point part for determining an approximate point value C' from a prescribed factor c×(n-1) computed by a decimal fraction c extracted from the x coordinate value Xa, a memory part for storing a lookup table containing a set of predetermined data, and an approximate area factor part for determining an approximate shading area factor k by making reference to the lookup table stored in the memory part.

47 citations


Network Information
Related Topics (5)
Pixel
136.5K papers, 1.5M citations
91% related
Image processing
229.9K papers, 3.5M citations
89% related
Image segmentation
79.6K papers, 1.8M citations
85% related
Convolutional neural network
74.7K papers, 2M citations
84% related
Wavelet
78K papers, 1.3M citations
82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202387
2022209
2021120
2020179
2019189
2018263