The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Image compression by linear splines over adaptive triangulations
Signal Processing
Computationally attractive reconstruction of bandlimited images from irregular samples
IEEE Transactions on Image Processing
The farthest point strategy for progressive image sampling
IEEE Transactions on Image Processing
Image quality assessment: from error visibility to structural similarity
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
Reconstruction of nonuniformly sampled images in spline spaces
IEEE Transactions on Image Processing
Hi-index | 0.00 |
This paper presents a fast and novel method of image reconstruction using Adaptive R-tree based segmentation and Linear Bivariate Splines. We have used our own Significant Pixel Selection Algorithm [8] to represent the strong edges which are then stored in an adaptive R-tree to enhance and improve image reconstruction. The image set can be encapsulated in a bounding box which contains the connected parts of the edges found using edge-detection techniques. Image reconstruction is done based on the approximation of image regarded as a function, by a linear spline over adapted Delaunay triangulation. The proposed method is compared with some of the existing image reconstructions.