Search

Fractional interpolation is used to provide sub-pixel level references for motion compensation in the interprediction of video coding, which attempts to remove temporal redundancy in video sequences. Traditional handcrafted fractional interpolation filters face the challenge of modeling discontinuous regions in videos, while existing deep learning-based methods are either designed for a single quantization parameter (QP), only generating half-pixel samples, or need to train a model for each sub-pixel position. In this paper, we present a one-for-all fractional interpolation method based on a grouped variation convolutional neural network (GVCNN). Our method can deal with video frames coded using different QPs and is capable of generating all sub-pixel positions at one sub-pixel level. Also, by predicting variations between integer-position pixels and sub-pixels, our network offers more expressive power. Moreover, we perform specific measurements in training data generation to simulate practical situations in video coding, including blurring the down-sampled sub-pixel samples to avoid aliasing effects and coding integer pixels to simulate reconstruction errors. In addition, we analyze the impact of the size of blur kernels theoretically. Experimental results verify the efficiency of GVCNN. Compared with HEVC, our method achieves 2.2% in bit saving on average and up to 5.2% under low-delay P configuration. [ABSTRACT FROM AUTHOR]

The blind structured illumination microscopy strategy proposed by Mudry et al. is fully re-founded in this paper, unveiling the central role of the sparsity of the illumination patterns in the mechanism that drives super-resolution in the method. A numerical analysis shows that the resolving power of the method can be further enhanced with optimized one-photon or two-photon speckle illuminations. A much improved numerical implementation is provided for the reconstruction problem under the image positivity constraint. This algorithm rests on a new preconditioned proximal iteration faster than existing solutions, paving the way to 3D and real-time 2D reconstruction. [ABSTRACT FROM PUBLISHER]

This paper presents an efficient algorithm for solving a balanced regularization problem in the frame-based image restoration. The balanced regularization is usually formulated as a minimization problem, involving an \ell2 data-fidelity term, an \ell1 regularizer on sparsity of frame coefficients, and a penalty on distance of sparse frame coefficients to the range of the frame operator. In image restoration, the balanced regularization approach bridges the synthesis-based and analysis-based approaches, and balances the fidelity, sparsity, and smoothness of the solution. Our proposed algorithm for solving the balanced optimal problem is based on a variable splitting strategy and the classical alternating direction method. This paper shows that the proposed algorithm is fast and efficient in solving the standard image restoration with balanced regularization. More precisely, a regularized version of the Hessian matrix of the \ell2 data-fidelity term is involved, and by exploiting the related fast tight Parseval frame and the special structures of the observation matrices, the regularized Hessian matrix can perform quite efficiently for the frame-based standard image restoration applications, such as circular deconvolution in image deblurring and missing samples in image inpainting. Numerical simulations illustrate the efficiency of our proposed algorithm in the frame-based image restoration with balanced regularization. [ABSTRACT FROM AUTHOR]

The main aim of this paper is to develop an algorithm for blending of multiple images in the image-stitching process. Our idea is to propose a variational method containing an energy functional to determine both a stitched image and weighting mask functions of multiple input images for image blending. The existence of the solution of the proposed energy functional is shown. We also present an alternative minimizing algorithm to solve the proposed model numerically and show the convergence of this algorithm. Experimental results show that the proposed model works effectively and efficiently and that the proposed method is competitive with the tested existing methods under noisy conditions. [ABSTRACT FROM AUTHOR]

A family of the block matching 3-D (BM3D) algorithms for various imaging problems has been recently proposed within the framework of nonlocal patchwise image modeling refid="ref1"/, refid="ref2"/. In this paper, we construct analysis and synthesis frames, formalizing BM3D image modeling, and use these frames to develop novel iterative deblurring algorithms. We consider two different formulations of the deblurring problem, i.e., one given by the minimization of the single-objective function and another based on the generalized Nash equilibrium (GNE) balance of two objective functions. The latter results in the algorithm where deblurring and denoising operations are decoupled. The convergence of the developed algorithms is proved. Simulation experiments show that the decoupled algorithm derived from the GNE formulation demonstrates the best numerical and visual results and shows superiority with respect to the state of the art in the field, confirming a valuable potential of BM3D-frames as an advanced image modeling tool. [ABSTRACT FROM AUTHOR]

Regularization methods for the solution of ill-posed inverse problems can be successfully applied if a right estimation of the regularization parameter is known. In this paper, we consider the L1-regularized image deblurring problem and evaluate its solution using the iterative forward–backward splitting method. Based on this approach, we propose a new adaptive rule for the estimation of the regularization parameter that, at each iteration, dynamically updates the parameter value, following the evolution of the objective functional. The iterative algorithm automatically stops, without requiring any assumption about the perturbation process, when the parameter has reached a seemingly near optimal value. In spite of the fact that the optimality of this value has not yet been theoretically proved, a large number of numerical experiments confirm that the proposed rule yields restoration results competitive with those of the best state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Multiplicative noise removal based on total variation (TV) regularization has been widely researched in image science. In this paper, inspired by the spatially adapted methods for denoising Gaussian noise, we develop a variational model, which combines the TV regularizer with local constraints. It is also related to a TV model with spatially adapted regularization parameters. The automated selection of the regularization parameters is based on the local statistical characteristics of some random variable. The corresponding subproblem can be efficiently solved by the augmented Lagrangian method. Numerical examples demonstrate that the proposed algorithm is able to preserve small image details, whereas the noise in the homogeneous regions is sufficiently removed. As a consequence, our method yields better denoised results than those of the current state-of-the-art methods with respect to the signal-to-noise-ratio values. [ABSTRACT FROM AUTHOR]

Loss of information in a wavelet domain can occur during storage or transmission when the images are formatted and stored in terms of wavelet coefficients. This calls for image inpainting in wavelet domains. In this paper, a variational approach is used to formulate the reconstruction problem. We propose a simple but very efficient iterative scheme to calculate an optimal solution and prove its convergence. Numerical results are presented to show the performance of the proposed algorithm. [ABSTRACT FROM PUBLISHER]

This paper proposes a new motion-compensated frame interpolation (MCFI) method. The proposed method utilizes a symmetric motion estimation (SME) method, which is a new pixel-wise motion estimation method for intermediate frame interpolation. By using an adaptive search range for the motion estimation, the proposed method can obtain a more reliable motion vector for each pixel than previous MCFI methods that use a conventional block matching algorithm (BMA). In addition, we propose a combined method of the SME and BMA to reduce the computation time of the pixel-wise motion estimation method. The experimental results show that the proposed method outperforms other MCFI methods in terms of generating objectively and subjectively better interpolated frames. [ABSTRACT FROM AUTHOR]

We propose a new fast algorithm for solving one of the standard approaches to ill-posed linear inverse problems (IPLIP), where a (possibly nonsmooth) regularizer is minimized under the constraint that the solution explains the observations sufficiently well. Although the regularizer and constraint are usually convex, several particular features of these problems (huge dimensionality, nonsmoothness) preclude the use of off-the-shelf optimization tools and have stimulated a considerable amount of research. In this paper, we propose a new efficient algorithm to handle one class of constrained problems (often known as basis pursuit denoising) tailored to image recovery applications. The proposed algorithm, which belongs to the family of augmented Lagrangian methods, can be used to deal with a variety of imaging IPLIP, including deconvolution and reconstruction from compressive observations (such as MRI), using either total-variation or wavelet-based (or, more generally, frame-based) regularization. The proposed algorithm is an instance of the so-called alternating direction method of multipliers, for which convergence sufficient conditions are known; we show that these conditions are satisfied by the proposed algorithm. Experiments on a set of image restoration and reconstruction benchmark problems show that the proposed algorithm is a strong contender for the state-of-the-art. [ABSTRACT FROM AUTHOR]

One weakness in the existing interactive image segmentation algorithms is the lack of more intelligent ways to understand the intention of user inputs. In this paper, we advocate the use of multiple intuitive user inputs to better reflect a user's intention. In particular, we propose a constrained random walks algorithm that facilitates the use of three types of user inputs: 1) foreground and background seed input, 2) soft constraint input, and 3) hard constraint input, as well as their combinations. The foreground and background seed input allows a user to draw strokes to specify foreground and background seeds. The soft constraint input allows a user to draw strokes to indicate the region that the boundary should pass through. The hard constraint input allows a user to specify the pixels that the boundary must align with. Our proposed method supports all three types of user inputs in one coherent computational framework consisting of a constrained random walks and a local editing algorithm, which allows more precise contour refinement. Experimental results on two benchmark data sets show that the proposed framework is highly effective and can quickly and accurately segment a wide variety of natural images with ease. [ABSTRACT FROM AUTHOR]

In this paper, we seek to fit a model, specified in terms of connected ellipses, to an image silhouette. Some algorithms that have attempted this problem are sensitive to initial guesses and also may converge to a wrong solution when they attempt to minimize the objective function for the entire ellipse structure in one step. We present an algorithm that overcomes these issues. Our first step is to temporarily ignore the connections, and refine the initial guess using unconstrained Expectation-Maximization (EM) for mixture Gaussian densities. Then the ellipses are reconnected linearly. Lastly, we apply the Levenberg-Marquardt algorithm to fine-tune the ellipse shapes to best align with the contour. The fitting is achieved in a hierarchical manner based upon the joints of the model. Experiments show that our algorithm can robustly fit a complex ellipse structure to a corresponding shape for several applications. [ABSTRACT FROM AUTHOR]

We develop two new algorithms for tomographic reconstruction which incorporate the technique of equally-sloped tomography (EST) and allow for the optimized and flexible implementation of regularization schemes, such as total variation constraints, and the incorporation of arbitrary physical constraints. The founding structure of the developed algorithms is EST, a technique of tomographic acquisition and reconstruction first proposed by Miao et al. in 2005 for performing tomographic image reconstructions from a limited number of noisy projections in an accurate manner by avoiding direct interpolations. EST has recently been successfully applied to coherent diffraction microscopy, electron microscopy, and computed tomography for image enhancement and radiation dose reduction. However, the bottleneck of EST lies in its slow speed due to its higher computation requirements. In this paper, we formulate the EST approach as a constrained problem and subsequently transform it into a series of linear problems, which can be accurately solved by the operator splitting method. Based on these mathematical formulations, we develop two iterative algorithms for tomographic image reconstructions through EST, which incorporate Bregman and continuative regularization. Our numerical experiment results indicate that the new tomographic image reconstruction algorithms not only significantly reduce the computational time, but also improve the image quality. We anticipate that EST coupled with the novel iterative algorithms will find broad applications in X-ray tomography, electron microscopy, coherent diffraction microscopy, and other tomography fields. [ABSTRACT FROM AUTHOR]

In this paper, a motion-aligned auto-regressive (MAAR) model is proposed for frame rate up conversion, where each pixel is interpolated as the average of the results generated by one forward MAAR (Fw-MAAR) model and one backward MAAR (Bw-MAAR) model. In the Fw-MAAR model, each pixel in the to-be-interpolated frame is generated as a linear weighted summation of the pixels within a motion-aligned square neighborhood in the previous frame. To derive more accurate interpolation weights, the aligned actual pixels in the following frame are also estimated as a linear weighted summation of the newly interpolated pixels in the to-be-interpolated frame by the same weights. Consequently, the backward-aligned actual pixels in the following frame can be estimated as a weighted summation of the corresponding pixels within an enlarged square neighborhood in the previous frame. The Bw-MAAR is performed likewise except that it is operated in the reverse direction. A damping Newton algorithm is then proposed to compute the adaptive interpolation weights for the Fw-MAAR and Bw-MAAR models. Extensive experiments demonstrate that the proposed MAAR model is able to achieve superior performance than the traditional frame interpolation methods such as MCI, OBMC, and AOBMC, and it is even better than STAR model for the most test sequences with moderate or large motions. [ABSTRACT FROM AUTHOR]

This paper proposes a selective data pruning-based compression scheme to improve the rate-distortion relation of compressed images and video sequences. The original frames are pruned to a smaller size before compression. After decoding, they are interpolated back to their original size by an edge-directed interpolation method. The data pruning phase is optimized to obtain the minimal distortion in the interpolation phase. Furthermore, a novel high-order interpolation is proposed to adapt the interpolation to several edge directions in the current frame. This high-order filtering uses more surrounding pixels in the frame than the fourth-order edge-directed method and it is more robust. The algorithm is also considered for multiframe-based interpolation by using spatio-temporally surrounding pixels coming from the previous frame. Simulation results are shown for both image interpolation and coding applications to validate the effectiveness of the proposed methods. [ABSTRACT FROM AUTHOR]

In this paper, a new image prior is introduced and used in image restoration. This prior is based on products of spatially weighted total variations (TV). These spatial weights provide this prior with the flexibility to better capture local image features than previous TV based priors. Bayesian inference is used for image restoration with this prior via the variational approximation. The proposed restoration algorithm is fully automatic in the sense that all necessary parameters are estimated from the data and is faster than previous similar algorithms. Numerical experiments are shown which demonstrate that image restoration based on this prior compares favorably with previous state-of-the-art restoration algorithms. [ABSTRACT FROM AUTHOR]

Minutiae are very important features for fingerprint representation, and most practical fingerprint recognition systems only store the minutiae template in the database for further usage. The conventional methods to utilize minutiae information are treating It as a point set and finding the matched points from different minutiae sets. In this paper, we propose a novel algorithm to use minutiae for fingerprint recognition, in which the fingerprint's orientation field Is reconstructed from minutiae and further utilized in the matching stage to enhance the system's performance. First, we produce "virtual" minutiae by using interpolation in the sparse area, and then use an orientation model to reconstruct the orientation field from all "real" and "virtual" minutiae. A decision fusion scheme is used to combine the reconstructed orientation field matching with conventional minutiae-based matching. Since orientation field is an important global feature of fingerprints, the proposed method can obtain better results than conventional methods. Experimental results illustrate its effectiveness. [ABSTRACT FROM AUTHOR]

In this paper, we propose an algorithm to compose a geometrically dewarped and visually enhanced image from two document images taken by a digital camera at different angles. Unlike the conventional works that require special equipments or assumptions on the contents of books or complicated image acquisition steps, we estimate the unfolded book or document surface from the corresponding points between two images. For this purpose, the surface and camera matrices are estimated using structure reconstruction, 3-D projection analysis, and random sample consensus-based curve fitting with the cylindrical surface model. Because we do not need any assumption on the contents of books, the proposed method can be applied not only to optical character recognition (OCR), but also to the high-quality digitization of pictures in documents. In addition to the dewarping for a structurally better image, image mosaic is also performed for further improving the visual quality. By finding better parts of images (with less out of focus blur and/or without specular reflections) from either of views, we compose a better image by stitching and blending. them. These processes are formulated as energy minimization problems that can be solved using a graph cut method. Experiments on many kinds of book or document images show that the proposed algorithm robustly works and yields visually pleasing results. Also, the OCR rate of the resulting image is comparable to that of document images from a flatbed scanner. [ABSTRACT FROM AUTHOR]

This paper presents an interactive algorithm for segmentation of natural images. The task is formulated as a problem of spline regression, in which the spline is derived in Sobolev space and has a form of a combination of linear and Green's functions. Besides its nonlinear representation capability, one advantage of this spline in usage is that, once it has been constructed, no parameters need to be tuned to data. We define this spline on the user specified foreground and background pixels, and solve its parameters (the combination coefficients of functions) from a group of linear equations. To speed up spline construction, K-means clustering algorithm is employed to cluster the user specified pixels. By taking the cluster centers as representatives, this spline can be easily constructed. The foreground object is finally cut out from its background via spline interpolation. The computational complexity of the proposed algorithm is linear in the number of the pixels to be segmented. Experiments on diverse natural images, with comparison to existing algorithms, illustrate the validity of our method. [ABSTRACT FROM AUTHOR]

This paper studies image deblurring problems using a total variation-based model, with a non-negativity constraint. The addition of the non-negativity constraint improves the quality of the solutions, but makes the solution process a difficult one. The contribution of our work is a fast and robust numerical algorithm to solve the non-negatively constrained problem. To overcome the nondifferentiability of the total variation norm, we formulate the constrained deblurring problem as a primal-dual program which is a variant of the formulation proposed by Chan, Golub, and Mulet for unconstrained problems. Here, dual refers to a combination of the Lagrangian and Fenchel duals. To solve the constrained primal-dual program, we use a semi-smooth Newton's method. We exploit the relationship between the semi-smooth Newton's method and the primal-dual active set method to achieve considerable simplification of the computations. The main advantages of our proposed scheme are: no parameters need significant adjustment, a standard inverse preconditioner works very well, quadratic rate of local convergence (theoretical and numerical), numerical evidence of global convergence, and high accuracy of solving the optimality system. The scheme shows robustness of performance over a wide range of parameters. A comprehensive set of numerical comparisons are provided against other methods to solve the same problem which show the speed and accuracy advantages of our scheme. [ABSTRACT FROM AUTHOR]

In this paper, a motion-compensated de-interlacing algorithm using the Markov random field (MRF) model is proposed. The de-interlacing problem is formulated as a maximum a posteriori (MAP) MRF problem. The MAP solution is the one that minimizes an energy function, which imposes discontinuity-adaptive smoothness (DAS) spatial constraint on the de-interlaced frame. The edge direction information, which is used to formulate the DAS constraint, is implicitly indicated by weight vectors (weights for 16 digitized directions). Generally, large weights are assigned to along-edge directions and relatively small weights are assigned to across-edge directions. As a local statistical-based method, the proposed weighting method should be more robust than traditional edge-directed interpolation methods in deciding local edge directions. The proposed algorithm is implemented by an iterative optimization process, which guarantees convergence. However, a global optimal solution is not guaranteed due to computational complexity concern. Simulation results compare the proposed algorithm to other motion compensated de-interlacing algorithms. Significant improvements of de-interlaced edges are observed. [ABSTRACT FROM AUTHOR]

Character skeleton plays a significant role in character recognition. The strokes of a character may consist of two regions, i.e., singular and regular regions. The intersections and junctions of the strokes belong to singular region, while the straight and smooth parts of the strokes are categorized to regular region. Therefore, a skeletonization method requires two different processes to treat the skeletons in theses two different regions. All traditional skeletonization algorithms are based on the symmetry analysis technique. The major problems of these methods are as follows. 1) The computation of the primary skeleton in the regular region is indirect, so that its implementation is sophisticated and costly. 2) The extracted skeleton cannot be exactly located on the central line of the stroke. 3) The captured skeleton in the singular region may be distorted by artifacts and branches. To overcome these problems, a novel scheme of extracting the skeleton of character based on wavelet transform is presented in this paper. This scheme consists of two main steps, namely: a) extraction of primary skeleton in the regular region and b) amendment processing of the primary skeletons and connection of them in the singular region. A direct technique is used in the first step, where a new wavelet-based symmetry analysis is developed for finding the central line of the stroke directly. A novel method called smooth interpolation is designed in the second step, where a smooth operation is applied to the primary skeleton, and, thereafter, the interpolation compensation technique is proposed to link the primary skeleton, so that the skeleton in the singular region can be produced. Experiments are conducted and positive results are achieved, which show that the proposed skeletonization scheme is applicable to not only binary image but also gray-level image, and the skeleton is robust against noise and affine transform. [ABSTRACT FROM AUTHOR]

In this paper, we make contact with the field of non-parametric statistics and present a development and generalization of tools and results for use in image processing and reconstruction. In particular, we adapt and expand kernel regression ideas for use in image denoising, upscaling, interpolation, fusion, and more. Furthermore, we establish key relationships with some popular existing methods and show how several of these algorithms, including the recently popularized bilateral filter, are special cases of the proposed framework. The resulting algorithms and analyses are amply illustrated with practical examples. [ABSTRACT FROM AUTHOR]

At low bit rates, better coding quality can be achieved by downsampling the image prior to compression and estimating the missing portion after decompression. This paper presents a new algorithm in such a paradigm, based on the adaptive decision of appropriate downsampling directions/ratios and quantization steps, in order to achieve higher coding quality with low bit rates with the consideration of local visual significance. The full-resolution image can be restored from the DCT coefficients of the downsampled pixels so that the spatial interpolation required otherwise is avoided. The proposed algorithm significantly raises the critical bit rate to approximately 1.2 bpp, from 0.15-0.41 bpp in the existing downsample-prior-to-JPEG schemes and, therefore, outperforms the standard JPEG method in a much wider bit-rate scope. The experiments have demonstrated better PSNR improvement over the existing techniques before the critical bit rate. In addition, the adaptive mode decision not only makes the critical bit rate less image-independent, but also automates the switching coders in variable bit-rate applications, since the algorithm turns to the standard JPEG method whenever it is necessary at higher bit rates. [ABSTRACT FROM AUTHOR]

This paper introduces edge-forming schemes for image zooming of color images by general magnification factors. In order to remove/reduce artifacts arising in image interpolation, such as image blur and the checkerboard effect, an edge-forming method is suggested to be applied as a postprocess of standard interpolation methods. The method is based on nonconvex non-linear partial differential equations. The equations are carefully discretized, incorporating numerical schemes of anisotropic diffusion, to be able to form reliable edges satisfactorily. The alternating direction implicit (ADI) method is employed for an efficient simulation of the model. It has been numerically verified that the resulting algorithm can form clear edges in 2 to 3 AD! iterations. Various results are given to show th eeffectiveness and reliability of the algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new image inpainting algorithm that relies on explicit edge information. The edge information is used both for the reconstruction of a skeleton image structure in the missing areas, as well as for guiding the interpolation that follows. The structure reconstruction part exploits different properties of the edges, such as the colors of the objects they separate, an estimate of how well one edge continues into another one, and the spatial order of the edges with respect to each other. In order to preserve both sharp and smooth edges, the areas delimited by the recovered structure are interpolated independently, and the process is guided by the direction of the nearby edges. The novelty of our approach lies primarily in exploiting explicitly the constraint enforced by the numerical interpretation of the sequential order of edges, as well as in the pixel filling method which takes into account the proximity and direction of edges. Extensive experiments are carried out in order to validate and compare the algorithm both quantitatively and qualitatively. They show the advantages of our algorithm and its readily application to real world cases. [ABSTRACT FROM AUTHOR]

This paper investigates the usefulness of bidirectional multigrid methods for variational optical flow computations. Although these numerical schemes are among the fastest methods for solving equation systems, they are rarely applied in the field of computer vision. We demonstrate how to employ those numerical methods for the treatment of variational optical flow formulations and show that the efficiency of this approach even allows for real-time performance on standard PCs. As a representative for variational optic flow methods, we consider the recently introduced combined local-global method. It can be considered as a noise-robust generalization of the Horn and Schunck technique. We present a decoupled, as well as a coupled, version of the classical Gaufi-Seidel solver, and we develop several multgrid implementations based on a discretization coarse grid approximation. In contrast, with standard bidirectional multigrid algorithms, we take advantage of intergrid transfer operators that allow for nondyadic grid hierarchies. As a consequence, no restrictions concerning the image size or the number of traversed levels have to be imposed. In the experimental section, we juxtapose the developed multigrid schemes and demonstrate their superior performance when compared to unidirectional multgrid methods and nonhierachical solvers. For the well-known 316 × 252 Yosemite sequence, we succeeded in computing the complete set of dense flow fields in three quarters of a second on a 3.06-GHz Pentium4 PC. This corresponds to a frame rate of 18 flow fields per second which outperforms the widely-used Gaull-Seidel method by almost three orders of magnitude. [ABSTRACT FROM AUTHOR]

Regularization is one of the most promising methods for image up-sampling, which is an ill-posed inverse problem. A key element of such a regularization approach is the observation model relating the observed lower resolution (LR) image to the desired higher resolution (HR) up-sampled image, used in the data-fidelity term of the regularization cost function. This paper presents an algorithm to determine this observation model based on a model of the physical acquisition process for the LR image, and the ideal acquisition process for the desired HR image, both from the same underlying continuous image. The method is illustrated with typical scenarios corresponding to LR and HR cameras modeled by either Gaussian or rectangular apertures. Experiments with some regularized image up-samplers demonstrate the importance of using the correct, adapted observation model as determined by our algorithm. [ABSTRACT FROM AUTHOR]

A cost-effective digital camera uses a single-image sensor, applying alternating patterns of red, green, and blue color filters to each pixel location. A way to reconstruct a full three-color representation of color images by estimating the missing pixel components in each color plane is called a demosaicing algorithm. This paper presents three inherent problems often associated with demosaicing algorithms that incorporate two-dimensional (2-D) directional interpolation: misguidance color artifacts, interpolation color artifacts, and aliasing. The level of misguidance color artifacts present in two images can be compared using metric neighborhood modeling. The proposed demosaicing algorithm estimates missing pixels by interpolating in the direction with fewer color artifacts. The aliasing problem is addressed by applying filterbank techniques to 2-D directional interpolation. The interpolation artifacts are reduced using a nonlinear iterative procedure. Experimental results using digital images confirm the effectiveness of this approach. [ABSTRACT FROM AUTHOR]

In this paper, we look at the problem of spatially scaling color images. We focus on an approach that takes advantage of the human visual system's color spatial frequency sensitivity. The algorithm performs an efficient least-squares (LS) resolution conversion for the luminance channel and a low-complexity pixel replication/reduction in the chrominance channels. The performance of the algorithm is compared to a LS method in sRGB and CIELAB color spaces, as well as standard bilinear interpolation in sRGB space. The comparisons are made in terms of computational cost and color error in sCIELAB. [ABSTRACT FROM AUTHOR]