Research Article Video Superresolution Reconstruction Using Iterative Back Projection with Critical-Point Filters Based Image Matching
|
|
- Herbert Charles
- 5 years ago
- Views:
Transcription
1 Advances in Multimedia Volume 2015, Article ID , 10 pages Research Article Video Superresolution Reconstruction Using Iterative Back Projection with Critical-Point Filters Based Image Matching Yixiong Zhang, Mingliang Tao, Kewei Yang, and Zhenmiao Deng Department of Communication Engineering, Xiamen University, Xiamen, Fujian , China Correspondence should be addressed to Yixiong Zhang; Received 27 December 2014; Accepted 23 February 2015 Academic Editor: Constantine Kotropoulos Copyright 2015 Yixiong Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. To improve the spatial resolution of reconstructed images/videos, this paper proposes a Superresolution (SR) reconstruction algorithm based on iterative back projection. In the proposed algorithm, image matching using critical-point filters (CPF) is employed to improve the accuracy of image registration. First, a sliding window is used to segment the video sequence. CPF based image matching is then performed between frames in the window to obtain pixel-level motion fields. Finally, high-resolution (HR) frames are reconstructed based on the motion fields using iterative back projection (IBP) algorithm. The CPF based registration algorithm can adapt to various types of motions in real video scenes. Experimental results demonstrate that, compared to optical flow based image matching with IBP algorithm, subjective quality improvement and an average PSNR score of 0.53 db improvement are obtained by the proposed algorithm, when applied to video sequence. 1. Introduction Since high-resolution (HR) images/videos are important in many applications, such as astronomy, military monitor, medical diagnosis, and remote sensing, superresolution (SR) reconstruction has a great significance in practice [1]. The concept of superresolution (SR) reconstruction refers to reconstructing a high-resolution (HR) image from one or more low-resolution (LR) images. The purpose of superresolution (SR) reconstruction is using digital image processing algorithm to enhance the spatial resolution by transcending the limiting factors of optical imaging system [2, 3]. The innate character of superresolution (SR) reconstruction is using complementary content of multiple images to extend high frequency component. Most superresolution reconstruction methods contain four steps: registration, map, interpolation, noise, and blur removal. Registration refers to estimating motion vectors between two different video frames or images. Then the motion vectors are used to map the pixels of the input lowresolution frames to a common high-resolution reference frame. Interpolation is used to obtain the pixel value of the superresolution grid, by utilizing the mapped pixels. Finally, noise and blur removal is applied to eliminate the optical sensor blur [4]. A variety of iterative superresolution reconstruction algorithms have been proposed. These algorithms can be divided into two types: frequency domain method and spatial domain method.thefrequencydomainapproachwasfirstproposed by Tsai and Huang [5]. They formulated a series of equations which relate high-resolution frames to low-resolution frames, making use of the shift property of Fourier transform. But their imaging model does not consider motion blur and additive noise and is only restricted to global translational motion. Interpolation based method, iterative back projection (IBP) method [1, 6, 7], projection onto convex set (POCS) method [3, 8], and maximum a posteriori (MAP) method [9]arefour main spatial domain algorithms for superresolution reconstruction. Interpolation based method is the simplest spatial domain algorithm, which uses multiple registered images to generate the HR image, based on some interpolation approach, such as nearest-neighbor interpolation, bilinear interpolation, and cubic spline interpolation [10]. The other three spatial domain SR algorithms (IBP, POCS, and MAP) are all based on iterative reconstruction and have better results than interpolation based method. Another class of
2 2 Advances in Multimedia superresolution reconstruction algorithm is example-based superresolution algorithm. Freeman et al. [11] presented the idea of example-based superresolution reconstruction algorithm. A state-of-the-art algorithm via structure analysis ofpatcheswasproposedbykimetal.in[12]. The key to the spatial domain algorithms is accurate image registration. Traditional registration approaches estimate the global translational or rotational motion. But if more than one type of motion coexists in the scene such as natural video, global motion estimation does not work. In video superresolution, image registration algorithms such as block based matching [13] and optical flow based matching [14, 15] are often used. But both of these two algorithms have some drawbacks and are not appropriate in the superresolution reconstruction. Motion vectors cannot be accurately obtained because of block based matching criterion, and the performance of optical flow based matching may be seriously degraded due to changes of brightness. In this paper, image matching using multiresolutional critical-point filters (CPF-IM) [16 18] is proposed to be applied in the process of superresolution reconstruction. CPF-IM is suitable for representing both the global and local motions. Moreover, the influence of brightness change is small in CPF-IM. In our experiments, pixel-level motion fields are first obtained by CPF-IM. Then the iterative back projection (IBP) algorithm is employed to reconstruct the high-resolution image based on the motion fields. Experimental result shows that the IBP algorithm with CPF-IM has better performance than bilinear interpolation algorithm, bicubic interpolation algorithm, and optical flow based image matching with IBP algorithm. The rest of this paper is organized as follows. Section 2 briefly introduces the CPF based image matching algorithm. Section 3 describes the proposed superresolution algorithm using iterative back projection (IBP) algorithm with CPF- IM. Section 4 discusses the experimental results. Finally, Section5 concludes this paper. 2. Image Matching Using Multiresolutional Critical-Point Filters Multiresolutional critical-point filters (CPF) [16 18] provide a means of matching two images in pixel-level accurately. Suppose there are two images, a source and a destination. A set of multiresolution subimages are constructed for both images. Then, mappings from the source to the destination subimages are performed at each level from the coarsest resolution to the finest resolution. The mapping is computed pixelbypixelconstrainedbytheinheritedandthebijectivity conditions. The mapping with the minimum energy will be selected as final correspondence. Supposing the width and the height of the original image size are W and H, respectively,n denotes the hierarchy level of the finest resolution. A multiresolution hierarchy of size W/2 (n m) H/2 (n m) images can be computed. There are four subimages to be calculated, which are formed by extraction of the minimum, the maximum, and the saddle points, respectively, at each level of the hierarchy. Let p (m,s) denote the pixel at (i, j) in the subimage, where m is the level of hierarchy and s is the type of subimage. The pixels of subimages in the hierarchy are recursively calculated from the pixels of its higher level subimages in the hierarchy as follows: p (m,0) p (m,1) p (m,2) p (m,3) = min (min (p (m1,0) (2i,2j),p (m1,0) (2i,2j1) ), min (p (m1,0) (2i1,2j),p(m1,0) (2i1,2j1) )), = max (min (p (m1,1) (2i,2j),p (m1,1) (2i,2j1) ), min (p (m1,1) (2i1,2j),p(m1,1) (2i1,2j1) )), = min (max (p (m1,2) (2i,2j),p (m1,2) (2i,2j1) ), max (p (m1,2) (2i1,2j),p(m1,2) (2i1,2j1) )), = max (max (p (m1,3) (2i,2j),p (m1,3) (2i,2j1) ), max (p (m1,3) (2i1,2j),p(m1,3) (2i1,2j1) )), where p (n,0) =p (n,1) =p (n,2) =p (n,3) =p,whicharethe pixels of the original image. Once the multiresolution hierarchy is constructed, a top down method is utilized to map pixels from the source image to the destination image. The number of candidate mappings at each level is constrained by the mapping at its upper level. Apixelp at level m ofthesourceimageissearchingforits corresponding pixel q in the destination image. Suppose the 4nearestpixelsofthepixelp are a, b, c,andd. Their parents (A, B, C, D) aremappedtoa, B, C, D at level m 1.For each of the parents, one child pixel is selected. The four children pixels define an inherited quadrilateral a b c d,inside whichwesearchthepixelq with a minimum mapping energy. Let p (m,s) (i, j) bethepixeltomapinsourceimageat location (i, j) and q (m,s) (k, l) the pixel to test in destination image at location (k, l) = f (m,s) (i, j). The mapping energy E (m,s) (i, j) consists of G (m,s) (i, j) and H (m,s) (i, j), defined as E (m,s) =λg (m,s) (1) H (m,s), (2) where λ 0 is a real number. G (m,s) (i, j) denotes the intensity differences between the source image pixel and its corresponding pixel in the destination image. Consider G (m,s) (i, j) = I(p(m,s) (i, j)) I (q (m,s) (k, l)) 2, (3) where the function I( ) denotes the intensity of image pixel. And H (m,s) (i, j) is the cost related to the locations of pixel. Consider H (m,s) =ηh (m,s) 0 H(m,s) 1, (4)
3 Advances in Multimedia 3 where η 0is a real number. Consider H (m,s) 1 = i H (m,s) 0 = (i, j) f(m,s) (i, j) 2, j i =i 1 j =j 1 ( (f(m,s) (i, j) (i, j)) (f (m,s) (i,j ) (i,j 2 )) ) (4) 1. (5) H 0 is determined by the differences between (i, j) and f(i, j) to prevent a pixel being mapped to a pixel too far away. H 1 is determined by the distance between the displacement of p (m,s) (i, j) and the displacement of its neighbors. This energy is used to smooth the mapping. In the mapping procedure, the energy of the candidate pixels satisfying the above conditions will be computed and compared. Then the pixel with the minimum energy will be determined as the final corresponding pixel. The advantage of integrating CPF based image matching into video image superresolution is that pixel-level motion fields can be accurately obtained. Shifts usually vary across small regions between video frames; therefore, block based image matching is not accurate enough. Moreover, optical flow based image matching is seriously affected by brightness change. In summary, CPF based image matching can overcome the defects of traditional image matching algorithms and is applicable to global motion and local motion model. In the process of image matching, one of the low-resolution images is selected as the reference image. CPF based image matching is performed between the reference image and the other low-resolution images to obtain motion fields. 3. Integrate CPF Based Image Matching into Video Image Superresolution This section introduces how to integrate CPF-IM into video image superresolution. A new framework of iterative back projection algorithm is proposed to reconstruct the highresolution video image Video Superresolution Reconstruction Model. The acquisition of low-resolution images is shown in Figure 1. The relation between the kth observation image g k and the original high-resolution image f can be expressed as g k =V k U k W k fn k, (6) where W k represents the affine operation matrix for g k, U k denotes the blur operation caused by point spread function (PSF), and V k is the downsampling matrix. The point spread function (PSF) and the downsampling operator used to be the same in the process of image acquisition in an imaging system. Thus, the blur operator U k and the downsampling operator V k canbeassumedtobe f Affine transform Low-resolution video frame PSF blur Downsampling W k U k V k Figure 1: Low-resolution image acquisition model. g 1 g 2 g 3 g 4 g 5 g 6 Sliding window move forward f 1 f 2 n k g k High-resolution video frame Figure 2: Video superresolution reconstruction model. constants in a sequence of images acquisition. So the imaging model (6) canbetransformedto g k =UVW k fn k. (7) The purpose of superresolution is to obtain the optimal estimation of the high-resolution image f from a series of low-resolution images g k. This is the inverse process of imaging as shown in (7). The key to superresolution reconstruction algorithms is accurate image registration, which is a difficult problem, since motion between video frames is complex and accurate motion field is difficult to obtain. Most traditional superresolution reconstruction algorithms are proposed for image superresolution rather than video superresolution, as motion field between images is much easier to estimate. The algorithm proposed in this paper is suitable for video image superresolution, and the experimental results will verify its effectiveness. For a video sequence, the motion vectors between two adjacent frames are relatively small. So we select the successive frames as the low-resolution images. A high-resolution frame can be reconstructed from the adjacent frames through (7). A video superresolution reconstruction model based on sliding window [19] is depicted in Figure 2. As shown in Figure 2, in video superresolution reconstruction, the sliding window is moved forward to produce successive high-resolution frames in the output sequence. In order to ensure the accuracy of registration, the middle frame of the sliding window is selected as the reference frame. Image matching is performed between the reference frame and other frames in the sliding window to obtain the motion fields. Then the high-resolution frames are reconstructed basedonthesemotionfields.ifweassumethatthetotal length of video is N and P is the length of sliding window, (NP 1) high-resolution frames can be reconstructed from the low-resolution video sequence Original Iterative Back Projection Algorithm. Iterative back projection [1, 6, 7] starts with an initial estimation of high-resolution image. The initial high-resolution image is generated by interpolating an input low-resolution image.
4 4 Advances in Multimedia Image acquisition model Observation low- resolution image Blur Affine transform g il g n Downsampling il The previous image fh n Upsampling Deblur Reverse affine transform G i P G= G i i=1 Back projection The iterative image fh n1 Figure 3: Flow of the original IBP algorithm. Then, a series of simulated low-resolution images are generated from the reconstructed superresolution image by the image acquisition model. If the simulated low-resolution images are consistent with the corresponding input lowresolution images, the reconstructed superresolution image is identical with the original high-resolution image. Otherwise, the differences between the simulated low-resolution images and the input low-resolution images will be projected to the reconstructed superresolution image. This process is repeated iteratively until the differences between the simulated lowresolution images and the input low-resolution images are small enough. Iterative back projection algorithm can be formulated as f n1 H i=1 =fn H λ P H BP i (g n il g il), g n il =VUW kf n H, (8) where n represents the iteration number, f n1 H is the reconstructed superresolution image in the (n 1)th iteration, and f n H is the reconstructed superresolution image in the nth iteration. λ is a constant value controlling the convergence speed, which is set as 0.1 for every iterative process. The length of sliding window is defined as P, which also represents the number of input low-resolution images. H BP i is the ith back projection operation, which is the same projection operator. g n il denotes the simulated low-resolution image defined by the image acquisition model, and g il denotes the input lowresolution image. W k represents the affine operation matrix for g n il, U denotes the blur operation caused by point spread function (PSF), and V is the downsampling matrix. The flow of the original iterative back projection algorithm is shown in Figure 3, and deblur block denotes the inverse matrix of U Proposed Iterative Back Projection Algorithm Combined with CPF Based Image Matching. In traditional image superresolution, global motion estimation is usually adopted as image matching algorithm, and global motion parameters are obtained between low-resolution images. In this case, the motion parameters between high-resolution images can be directly obtained by transforming the motion parameters between low-resolution images. And thus the affine transformation is easily implemented at high resolution. In this paper, pixel-level motion fields are obtained by CPF based image matching. And the affine transformation should be performed pixel by pixel, which is difficult to implement. Moreover, the affine transformation between the input lowresolution images is already included in the process of CPF matching. Therefore, the affine transformation in the image acquisitionmodelcanbereplacedbythatincpfmatching, and a new framework of iterative back projection algorithm combined with CPF-IM (IBP-CPF-IM) is proposed. The proposed IBP-CPF-IM algorithm starts with taking an input low-resolution image as the reference image. Then, CPF-IM is performed between the reference image and the other nonreference input low-resolution images to obtain pixel-level motion fields. And a series of simulated reference images x il are produced from these nonreference low-resolution images using the motion fields. Each input low-resolution image corresponds to a simulated reference image. Next, an initial reconstructed superresolution image f 0 H is generated by interpolating the reference low-resolution image. Generally, better initial estimation directly leads to better quality of the final reconstructed image. In addition, high quality of the initial estimation image can speed up the convergence of the iteration algorithm. Finally, simulated low-resolution image x n il is generated through downsampling the reconstructed superresolution image. If the simulated low-resolution image x n il is consistent with the simulated reference images x il, the reconstructed superresolution image is identical with the original high-resolution image. Otherwise, the differences between the simulated low-resolution image and the simulated reference images will be projected to the reconstructed superresolution image. This process is repeated iteratively until the differences between the simulated lowresolution image and the simulated reference images are
5 Advances in Multimedia 5 Simulated low-resolution image acquisition Simulated reference frames x il x n il Downsampling Blur The previous image yh n CPF-IM Upsampling Deblur G i P G= G i i=1 Back projection Observation lowresolution image g il The iterative image yh n1 Figure 4: Flow of the proposed IBP with CPF-IM. small enough. The proposed IBP-CPF-IM algorithm can be formulated as f n1 H i=1 =fn H λ P x il = CPF (g il ), x n il =VUfn H, H BP i (x n il x il), where x il represents the simulated reference image, x n il is the simulated low-resolution image through downsampling the superresolution image, and CPF( ) represents the operation which transforms input low-resolution image to simulated reference image. In the original IBP algorithm, affine transformation is implemented between high-resolution images using global motion parameters. However, the affine transformation in the proposed algorithm is replaced by CPF matching between low-resolution images. And the convergence of the proposed algorithm is going to speed up. The relative error used to control when to stop the iterative process is defined as follows: fn1 H error = fn H, (10) fn H where represents L 2 norm. Iteration stops when error is smallerthanathreshold(setas10 4 in our experiments) or the iteration number reaches the maximum value which is set as 100. The processes of IBP-CPF-IM algorithm for video superresolution are presented as follows. Step 1. Movetheslidingwindowandtakefivevideoframes as the input low-resolution frames. In general, when the distance between the middle frame and the matching frame becomes larger, their differences also become larger. In this (9) case, the accuracy of CPF matching will decrease, and subtle quality improvement of the generated frame can be obtained. Nevertheless, the computational complexity will increase greatly. To get a tradeoff between computational complexity and image quality, the length of sliding window P is set as five empirically. Step 2. The middle frame of the sliding window is taken as the reference frame. CPF based image matching is conducted between the reference frame and the other frames in the sliding window. Four motion fields are obtained through this process. And four simulated reference frames are generated using the motion fields. Step 3. The reference frame is interpolated to obtain the initial reconstructed superresolution frame. Step 4. The simulated low-resolution frame is obtained through downsampling the reconstructed superresolution frame. Step 5. Ifthesimulatedlow-resolutionframeisnotthesame as the simulated reference frame, differences between them are projected to the reconstructed superresolution frame and we return to Step 4. If the differences between the simulated low-resolution frame and the simulated reference frame are small enough, the reconstructed superresolution frame is the desired frame. The flow of proposed iterative back projection algorithm is shown in Figure 4, and deblur block denotes the inverse matrix of U. 4. Experiment Results 4.1. Experiments on Static Image. To evaluate the performance of the proposed algorithm, standard images are tested. The size of the input high-resolution image is
6 6 Advances in Multimedia (a) Original image (b) Bilinear interpolated image (c) Bicubic interpolated image (d) IBP-FR image (e) IBP-OL2004 (f) IBP-OL2010 (g) IBP-CPF-IM Figure 5: Comparison of Peppers. The low-resolution images are obtained by the image acquisition model as shown in Figure 1. The high-resolution image is first performed by affine transform which contains various unique vertical shifts, horizontal shifts, and rotations. Then, these affined images are blurred through low pass filter and downsampled by a factor of 2 to generate low-resolution images. The number of input simulated low-resolution images is 4. In this part, the performance of the proposed algorithm is compared with bilinear interpolation, bicubic interpolation, IBP with frequency domain registration (IBP- FR) [20], and IBP with optical flow based image matching (IBP-OL) algorithms (optical flow based image matching algorithms used in the experiments are proposed in [14]and [15], resp.). CPF based image matching is applied to obtain motion fields between images. A stable result about each test image in the experiments is obtained when iterative number is around 15. Figures 5(a) and 6(a) show the original high-resolution images of Peppers and Lena. One of the generated lowresolution images is selected as the reference image about each test image. Figures 5(b) and 6(b) are the interpolated images from the reference image using bilinear algorithm, while Figures 5(c) and 6(c) are the interpolated images using bicubic algorithm. Superresolution images reconstructed using iterative back projection algorithm based on frequency domain registration [20]are shown in Figures 5(d) and 6(d). Figures 5(e), 6(e), 5(f), and6(f) are images reconstructed using iterative back projection algorithm with optical flow based image matching [14, 15]. IBP-OL2004 represents optical flow based image matching algorithm proposed in [14].
7 Advances in Multimedia 7 (a) Original image (b) Bilinear interpolated image (c) Bicubic interpolated image (d) IBP-FR image (e) IBP-OL 2004 (f) IBP-OL2010 (g) CPF-IM Figure 6: Comparison of Lena. IBP-OL2004 denotes the used optical flow based image matching algorithm proposed in [15]. And the images reconstructed by the proposed algorithm are shown in Figures 5(g) and 6(g). Ringing artifacts of Figures 5(g) and 6(g) are effectively reduced compared with Figures 5(d) and 6(d). Moreover, the edges of Figures 5(g) and 6(g) are handled better than those in Figures 5(e), 5(f), 6(e),and6(f). In order to evaluate the quality of the reconstructed imageobjectively,psnriscalculatedbetweentheoriginal high-resolution image and the reconstructed superresolution image. Table 1 gives the performance of the proposed algorithm and the compared algorithms. It is apparent that the proposed algorithm achieves an improvement of objective quality Experiments on Video. To verify the effect of the proposed algorithm on video image superresolution reconstruction, a series of standard video sequences are tested. The tested videos are in format of YUV. Proposed algorithm is applied to each component of video. In order to calculate PSNR performance of reconstructed video, low-resolution videos are obtained through downsampling high-resolution videos. And the PSNR performance of the experiment results is calculated based on Y component. For each sequence, only
8 8 Advances in Multimedia Table 1: PSNR of experimental image shown in Figures 3 and 4 and the other experimental images. Bilinear Bicubic IBP-FR IBP-OL2004 IBP-OL2010 IBP-CPF-IM Barbara db db db db db db Lena db db db db db db Peppers db db db db db db (a) (b) (c) (d) (e) (f) (g) (h) (i) (j) (k) (l) Figure 7: Comparison of hall: (a) original image, (b) the enlarged portion of (a), (c) bilinear interpolated image, (d) the enlarged portion of (c), (e) bicubic interpolated image, (f) the enlarged portion of (e), (g) IBP-OL2004, (h) the enlarged portion of (g), (i) IBP-OL2010, (j) the enlarged portion of (i), (k) IBP-CPF-IM, and (l) the enlarged portion of (k). thefirst100framesareusedandthesizeofthevideoimageis In this experiment, the scheme of sliding window (Figure 2) is adopted. The pixel-level motion fields between the reference frame and the other frames are estimated by CPF-IM. Taking the scheme of sliding window into consideration, the length of the output reconstructed frames is 96. The proposed algorithm is compared with bilinear interpolated algorithm, bicubic interpolated algorithm, and IBP with optical flow based image matching algorithm (optical flow based image matching algorithms used in the experiment are proposed in[14] and[15], resp.). Thus the motion mode which frequency domain registration algorithm requests is only global translation or rotation. iterative back projection algorithm based on frequency domain registration is not suitable for video superresolution. For bilinear and bicubic interpolation, the output reconstructed frame is acquired by interpolating the reference frame. For each frame in the video, a stable result is obtained before iterative number reaches the maximumvalue.thepsnrperformancesofthesealgorithms are listed in Table 2. Compared to bicubic interpolation, IBP- CPF-IM achieves a linear average PSNR gain of 1.27 db. These demonstrate that the amount of reconstruction information which we get from more than one frame is much more than that from only one frame, and the objective quality of the reconstructed frame by superresolution algorithm is generally higher than the reconstructed frame by interpolation. When compared with the IBP-OL2004 and IBP- OL2010 algorithms, the PSNR gain of IBP-CPF-IM is about 0.52 db and 0.60 db. The reason is that optical flow is sensitive to brightness change, which frequently occurs on video sequence. And the motion vectors cannot be accurately obtained by using optical flow based image matching. Figures7 and 8 show examples of the experimental results about hall and container sequences. The original images are
9 Advances in Multimedia 9 Table 2: PSNR of experimental video frames shown in Figures 5 and 6 and the other experimental video frames. Bilinear Bicubic IBP-OL2004 IBP-OL2010 IBP-CPF-IM Coastguard db db db db db Container db db db db db Hall db db db db db Foreman db db db db db Mother-daughter db db db db db Tempete db db db db db Average db db db db db (a) (b) (c) (d) (e) (f) (g) (h) (i) (j) (k) (l) Figure 8: Comparison of container: (a) original image, (b) the enlarged portion of (a), (c) bilinear interpolated image, (d) the enlarged portion of (c), (e) bicubic interpolated image, (f) the enlarged portion of (e), (g) IBP-OL2004, (h) the enlarged portion of (g), (i) IBP-OL2010, (j) the enlarged portion of (i), (k) IBP-CPF-IM, and (l) the enlarged portion of (k). shown in (a). The reconstructed images by bilinear, bicubic IBP-OL2004, IBP-OL2010, and the proposed IBP-CPF-IM are shown in (c), (e), (g), (i), and (k), respectively. In order to show details of the reconstructed images, a portion of these reconstructedimagesisenlargedwithascalefactorof1:4, asshownin(d),(f),(h),(j),and(l),respectively.compared to bicubic interpolation, the enlarged portion of Figure 7(l) reconstructed by IBP-CPF-IM is clearer. When there is a large motion or the change is abrupt between consecutive frames, the ghosting effect is produced by IBP-OL as shown in Figure 7(h), while IBP-CPF-IM can reduce this defect, as shown in Figure 7(j). 5. Conclusion The performance of superresolution reconstruction algorithm depends largely on the accuracy of image registration. Traditional registration approaches for superresolution reconstruction algorithm usually demand that the motion between images is global translation or rotation. For video frames, this does not hold. Moreover, block based matching and optical flow based matching algorithms have their own limitations. To improve the accuracy of image registration, this paper introduces multiresolutional critical-point filters based image matching algorithm (CPF-IM) to image/video
10 10 Advances in Multimedia superresolution. The elastic motion model in CPF-IM can adapt to various nontranslational motions, such as zoom and rotation. The combination of IBP and CPF-IM, which is called IBP-CPF-IM, is applied to image and video superresolution. Experimental results show that the proposed approach achieves better performance in objective and subjective qualityforbothimageandvideoframes,whencompared with bilinear and bicubic interpolation algorithms and IBP- FR and IBP-OL algorithm. CPF-IM can also be integrated into other superresolution reconstruction algorithms, such as projections onto convex sets (POCS) algorithm and maximum a posteriori (MAP) algorithm. Conflict of Interests There is no conflict of interests regarding the paper. Acknowledgments This project is supported by the National Natural Science Foundation of China (no ), China Postdoctoral Science Foundation (no. 2012M511433), and China Postdoctoral International Exchange Programme. References [1]B.Wan,L.Meng,D.Ming,H.Qi,Y.Hu,andK.D.K.Luk, Video image super-resolution restoration based on iterative back-projection algorithm, in Proceedings of the IEEE International Conference on Computational Intelligence for Measurement Systems and Applications (CIMSA 09), pp.46 49,May [2] B. Narayanan, R. C. Hardie, K. E. Barner, and M. Shao, A computationally efficient super-resolution algorithm for video processing using partition filters, IEEE Transactions on Circuits and Systems for Video Technology, vol.17,no.5,pp , [3] J.Yu,C.Xiao,andK.Su, Amethodofgibbsartifactreduction for POCS super-resolution image reconstruction, in Proceedings of the 8th International Conference on Signal Processing (ICSP 06), vol. 2, IEEE, Beijing, China, November [4] A.J.Patti,M.I.Sezan,andA.M.Tekalp, Superresolutionvideo reconstruction with arbitrary sampling lattices and nonzero aperture time, IEEE Transactions on Image Processing, vol. 6, no. 8, pp , [5]R.Y.TsaiandT.S.Huang, Multiframeimagerestoration and registration, in Advances in Computer Vision and Image Processing, T.S.Huang,Ed.,vol.1,pp ,JAIPress, Greenwich, Conn, USA, [6] H.Song,X.He,W.Chen,andY.Sun, Animprovediterative back-projection algorithm for video super-resolution reconstruction, in Proceedings of the Symposium on Photonics and Optoelectronic (SOPO '10), pp. 1 4, Chengdu, China, June [7] M. Irani and S. Peleg, Improving resolution by image registration, CVGIP: Graphical Models and Image Processing, vol.53, no. 3, pp , [8] H. Xi, C. Xiao, and C. Bian, Edge halo reduction for projections onto convex sets super resolution image reconstruction, in Proceedings of the 14th International Conference on Digital Image Computing Techniques and Applications (DICTA 12), pp.1 7, December [9] J. Chen, J. Nunez-Yanez, and A. Achim, Video super-resolution using generalized Gaussian Markov random fields, IEEE Signal Processing Letters,vol.19,no.2,pp.63 66,2012. [10] H. S. Hou and H. C. Andrews, Cubic splines for image interpolation and digital filtering, IEEE Trans Acoust Speech Signal Process,vol.26,no.6,pp ,1978. [11] W. T. Freeman, T. R. Jones, and E. C. Pasztor, Example-based super-resolution, IEEE Computer Graphics and Applications, vol.22,no.2,pp.56 65,2002. [12] C. Kim, K. Choi, and J. B. Ra, Example-based super-resolution via structure analysis of patches, IEEE Signal Processing Letters, vol. 20, no. 4, pp , [13] F. Dufaux and F. Moscheni, Motion estimation techniques for digital TV: a review and a new contribution, Proceedings of the IEEE,vol.83,no.6,pp ,1995. [14] A. Mitiche and A.-R. Mansouri, On convergence of the Horn and Schunck optical-flow estimation method, IEEE Transactions on Image Processing,vol.13,no.6,pp ,2004. [15] D. Sun, S. Roth, and M. J. Black, Secrets of optical flow estimation and their principles, in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR 10), pp ,SanFrancisco,Calif,USA,June [16] Y. Shinagawa and T. L. Kunii, Unconstrained automatic image matching using multiresolutional critical-point filters, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 9, pp , [17] K. Habuka and Y. Shinagawa, Image interpolation using enhanced multiresolution critical-point filters, International Journal of Computer Vision,vol.58,no.1,pp.19 35,2004. [18] Y. Zhang, W. Wang, and L. Zheng, Image interpolation using multiresolutional critical point filters with unconstrained boundary extension, in Proceedings of the 3rd International Congress on Image and Signal Processing (CISP 10), pp , October [19] F.-Q. Qin, X.-H. He, W.-L. Chen, X.-M. Yang, and W. Wu, Video superresolution reconstruction based on subpixel registration and iterative back projection, Journal of Electronic Imaging,vol.18,no.1,ArticleID013007,2009. [20] P. Vandewalle, S. Süsstrunk, and M. Vetterll, A frequency domain approach to registration of aliased images with application to super-resolution, EURASIP Journal on Advances in Signal Processing,vol.2006,ArticleID071459,2006.
11 Rotating Machinery Engineering Journal of The Scientific World Journal Distributed Sensor Networks Journal of Sensors Journal of Control Science and Engineering Advances in Civil Engineering Submit your manuscripts at Journal of Journal of Electrical and Computer Engineering Robotics VLSI Design Advances in OptoElectronics Navigation and Observation Chemical Engineering Active and Passive Electronic Components Antennas and Propagation Aerospace Engineering Modelling & Simulation in Engineering Shock and Vibration Advances in Acoustics and Vibration
Introduction to Image Super-resolution. Presenter: Kevin Su
Introduction to Image Super-resolution Presenter: Kevin Su References 1. S.C. Park, M.K. Park, and M.G. KANG, Super-Resolution Image Reconstruction: A Technical Overview, IEEE Signal Processing Magazine,
More informationNovel Iterative Back Projection Approach
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 11, Issue 1 (May. - Jun. 2013), PP 65-69 Novel Iterative Back Projection Approach Patel Shreyas A. Master in
More informationSuper-Resolution Image with Estimated High Frequency Compensated Algorithm
Super-Resolution with Estimated High Frequency Compensated Algorithm Jong-Tzy Wang, 2 Kai-Wen Liang, 2 Shu-Fan Chang, and 2 Pao-Chi Chang 1 Department of Electronic Engineering, Jinwen University of Science
More informationEnhancing DubaiSat-1 Satellite Imagery Using a Single Image Super-Resolution
Enhancing DubaiSat-1 Satellite Imagery Using a Single Image Super-Resolution Saeed AL-Mansoori 1 and Alavi Kunhu 2 1 Associate Image Processing Engineer, SIPAD Image Enhancement Section Emirates Institution
More informationSuper resolution: an overview
Super resolution: an overview C Papathanassiou and M Petrou School of Electronics and Physical Sciences, University of Surrey, Guildford, GU2 7XH, United Kingdom email: c.papathanassiou@surrey.ac.uk Abstract
More informationRegion Weighted Satellite Super-resolution Technology
Region Weighted Satellite Super-resolution Technology Pao-Chi Chang and Tzong-Lin Wu Department of Communication Engineering, National Central University Abstract Super-resolution techniques that process
More informationINTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATION ENGINEERING & TECHNOLOGY (IJECET)
INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATION ENGINEERING & TECHNOLOGY (IJECET) ISSN 0976 6464(Print) ISSN 0976 6472(Online) Volume 3, Issue 3, October- December (2012), pp. 153-161 IAEME: www.iaeme.com/ijecet.asp
More informationA Survey On Super Resolution Image Reconstruction Techniques
A Survey On Super Resolution Image Reconstruction Techniques Krunal Shah Jaymit Pandya Safvan Vahora Dept. of Info Tech,GCET Dept. of Info Tech,GCET Dept. of Info Tech,VGEC Engg.College, VV Nagar, Engg,College,VV
More informationA Novel Image Super-resolution Reconstruction Algorithm based on Modified Sparse Representation
, pp.162-167 http://dx.doi.org/10.14257/astl.2016.138.33 A Novel Image Super-resolution Reconstruction Algorithm based on Modified Sparse Representation Liqiang Hu, Chaofeng He Shijiazhuang Tiedao University,
More informationImage Super-Resolution Reconstruction Based On L 1/2 Sparsity
Buletin Teknik Elektro dan Informatika (Bulletin of Electrical Engineering and Informatics) Vol. 3, No. 3, September 4, pp. 55~6 ISSN: 89-39 55 Image Super-Resolution Reconstruction Based On L / Sparsity
More informationComparative Analysis of Edge Based Single Image Superresolution
Comparative Analysis of Edge Based Single Image Superresolution Sonali Shejwal 1, Prof. A. M. Deshpande 2 1,2 Department of E&Tc, TSSM s BSCOER, Narhe, University of Pune, India. ABSTRACT: Super-resolution
More informationFast and Effective Interpolation Using Median Filter
Fast and Effective Interpolation Using Median Filter Jian Zhang 1, *, Siwei Ma 2, Yongbing Zhang 1, and Debin Zhao 1 1 Department of Computer Science, Harbin Institute of Technology, Harbin 150001, P.R.
More informationSelf-Adaptive Blind Super-Resolution Image Reconstruction
2010 3rd International Congress on Image and Signal Processing (CISP2010) Self-Adaptive Blind Super-Resolution Image Reconstruction Yunfei Bai, Jing Hu, Yupin Luo Tsinghua National Laboratory for Information
More informationSuper-Resolution. Many slides from Miki Elad Technion Yosi Rubner RTC and more
Super-Resolution Many slides from Mii Elad Technion Yosi Rubner RTC and more 1 Example - Video 53 images, ratio 1:4 2 Example Surveillance 40 images ratio 1:4 3 Example Enhance Mosaics 4 5 Super-Resolution
More informationSuper-resolution Image Reconstuction Performance
Super-resolution Image Reconstuction Performance Sina Jahanbin, Richard Naething March 30, 2005 Abstract As applications involving the capture of digital images become more ubiquitous and at the same time
More informationResearch Article Regressive Structures for Computation of DST-II and Its Inverse
International Scholarly Research etwork ISR Electronics Volume 01 Article ID 537469 4 pages doi:10.540/01/537469 Research Article Regressive Structures for Computation of DST-II and Its Inverse Priyanka
More informationA A A. Fig.1 image patch. Then the edge gradient magnitude is . (1)
International Conference on Information Science and Computer Applications (ISCA 013) Two-Dimensional Barcode Image Super-Resolution Reconstruction Via Sparse Representation Gaosheng Yang 1,Ningzhong Liu
More informationLearning based face hallucination techniques: A survey
Vol. 3 (2014-15) pp. 37-45. : A survey Premitha Premnath K Department of Computer Science & Engineering Vidya Academy of Science & Technology Thrissur - 680501, Kerala, India (email: premithakpnath@gmail.com)
More informationRobust Video Super-Resolution with Registration Efficiency Adaptation
Robust Video Super-Resolution with Registration Efficiency Adaptation Xinfeng Zhang a, Ruiqin Xiong b, Siwei Ma b, Li Zhang b, Wen Gao b a Institute of Computing Technology, Chinese Academy of Sciences,
More informationGRID WARPING IN TOTAL VARIATION IMAGE ENHANCEMENT METHODS. Andrey Nasonov, and Andrey Krylov
GRID WARPING IN TOTAL VARIATION IMAGE ENHANCEMENT METHODS Andrey Nasonov, and Andrey Krylov Lomonosov Moscow State University, Moscow, Department of Computational Mathematics and Cybernetics, e-mail: nasonov@cs.msu.ru,
More informationSpatially Adaptive Block-Based Super-Resolution Heng Su, Liang Tang, Ying Wu, Senior Member, IEEE, Daniel Tretter, and Jie Zhou, Senior Member, IEEE
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 21, NO. 3, MARCH 2012 1031 Spatially Adaptive Block-Based Super-Resolution Heng Su, Liang Tang, Ying Wu, Senior Member, IEEE, Daniel Tretter, and Jie Zhou, Senior
More informationSuper Resolution Using Graph-cut
Super Resolution Using Graph-cut Uma Mudenagudi, Ram Singla, Prem Kalra, and Subhashis Banerjee Department of Computer Science and Engineering Indian Institute of Technology Delhi Hauz Khas, New Delhi,
More informationIMPROVED MOTION-BASED LOCALIZED SUPER RESOLUTION TECHNIQUE USING DISCRETE WAVELET TRANSFORM FOR LOW RESOLUTION VIDEO ENHANCEMENT
17th European Signal Processing Conference (EUSIPCO 009) Glasgow, Scotland, August 4-8, 009 IMPROVED MOTION-BASED LOCALIZED SUPER RESOLUTION TECHNIQUE USING DISCRETE WAVELET TRANSFORM FOR LOW RESOLUTION
More informationBlur Space Iterative De-blurring
Blur Space Iterative De-blurring RADU CIPRIAN BILCU 1, MEJDI TRIMECHE 2, SAKARI ALENIUS 3, MARKKU VEHVILAINEN 4 1,2,3,4 Multimedia Technologies Laboratory, Nokia Research Center Visiokatu 1, FIN-33720,
More informationAdaptive Multiple-Frame Image Super- Resolution Based on U-Curve
Adaptive Multiple-Frame Image Super- Resolution Based on U-Curve IEEE Transaction on Image Processing, Vol. 19, No. 12, 2010 Qiangqiang Yuan, Liangpei Zhang, Huanfeng Shen, and Pingxiang Li Presented by
More informationIMAGE RECONSTRUCTION WITH SUPER RESOLUTION
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 IMAGE RECONSTRUCTION WITH SUPER RESOLUTION B.Vijitha 1, K.SrilathaReddy 2 1 Asst. Professor, Department of Computer
More informationImage Interpolation using Collaborative Filtering
Image Interpolation using Collaborative Filtering 1,2 Qiang Guo, 1,2,3 Caiming Zhang *1 School of Computer Science and Technology, Shandong Economic University, Jinan, 250014, China, qguo2010@gmail.com
More informationMulti-frame super-resolution with no explicit motion estimation
Multi-frame super-resolution with no explicit motion estimation Mehran Ebrahimi and Edward R. Vrscay Department of Applied Mathematics Faculty of Mathematics, University of Waterloo Waterloo, Ontario,
More informationCONTENT ADAPTIVE SCREEN IMAGE SCALING
CONTENT ADAPTIVE SCREEN IMAGE SCALING Yao Zhai (*), Qifei Wang, Yan Lu, Shipeng Li University of Science and Technology of China, Hefei, Anhui, 37, China Microsoft Research, Beijing, 8, China ABSTRACT
More informationSuper-Resolution. Deepesh Jain. EE 392J Digital Video Processing Stanford University Winter
Super-Resolution Deepesh Jain EE 392J Digital Video Processing Stanford University Winter 2003-2004 Motivation Create High Resolution Video from a low-resolution one Create High Resolution Image(s) from
More informationPerformance study on point target detection using super-resolution reconstruction
Performance study on point target detection using super-resolution reconstruction Judith Dijk a,adamw.m.vaneekeren ab, Klamer Schutte a Dirk-Jan J. de Lange a, Lucas J. van Vliet b a Electro Optics Group
More informationSuper-Resolution on Moving Objects and Background
Super-Resolution on Moving Objects and Background A. van Eekeren K. Schutte J. Dijk D.J.J. de Lange L.J. van Vliet TNO Defence, Security and Safety, P.O. Box 96864, 2509 JG, The Hague, The Netherlands
More informationResolution Magnification Technique for Satellite Images Using DT- CWT and NLM
AUSTRALIAN JOURNAL OF BASIC AND APPLIED SCIENCES ISSN:1991-8178 EISSN: 2309-8414 Journal home page: www.ajbasweb.com Resolution Magnification Technique for Satellite Images Using DT- CWT and NLM 1 Saranya
More informationResearch Article A Novel Metaheuristic for Travelling Salesman Problem
Industrial Volume 2013, Article ID 347825, 5 pages http://dx.doi.org/10.1155/2013/347825 Research Article A Novel Metaheuristic for Travelling Salesman Problem Vahid Zharfi and Abolfazl Mirzazadeh Industrial
More informationSingle-Image Super-Resolution Using Multihypothesis Prediction
Single-Image Super-Resolution Using Multihypothesis Prediction Chen Chen and James E. Fowler Department of Electrical and Computer Engineering, Geosystems Research Institute (GRI) Mississippi State University,
More informationRobust Single Image Super-resolution based on Gradient Enhancement
Robust Single Image Super-resolution based on Gradient Enhancement Licheng Yu, Hongteng Xu, Yi Xu and Xiaokang Yang Department of Electronic Engineering, Shanghai Jiaotong University, Shanghai 200240,
More informationInvestigation of Superresolution using Phase based Image Matching with Function Fitting
Research Journal of Engineering Sciences ISSN 2278 9472 Investigation of Superresolution using Phase based Image Matching with Function Fitting Abstract Budi Setiyono 1, Mochamad Hariadi 2 and Mauridhi
More informationInfluence of Training Set and Iterative Back Projection on Example-based Super-resolution
Influence of Training Set and Iterative Back Projection on Example-based Super-resolution Saeid Fazli Research Institute of Modern Biological Techniques University of zanjan Zanjan, Iran Abstract Example-based
More informationVideo Super-Resolution by Motion Compensated Iterative Back-Projection Approach *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 27, 1107-1122 (2011) Video Super-Resolution by Motion Compensated Iterative Back-Projection Approach * CHEN-CHIUNG HSIEH 1, YO-PING HUANG 2, YU-YI CHEN 1
More informationA Novel Multi-Frame Color Images Super-Resolution Framework based on Deep Convolutional Neural Network. Zhe Li, Shu Li, Jianmin Wang and Hongyang Wang
5th International Conference on Measurement, Instrumentation and Automation (ICMIA 2016) A Novel Multi-Frame Color Images Super-Resolution Framewor based on Deep Convolutional Neural Networ Zhe Li, Shu
More informationEUSIPCO A SPACE-VARIANT CUBIC-SPLINE INTERPOLATION
EUSIPCO 213 1569744341 A SPACE-VARIAN CUBIC-SPLINE INERPOLAION Jianxing Jiang, Shaohua Hong, Lin Wang Department of Communication Engineering, Xiamen University, Xiamen, Fujian, 3615, P.R. China. ABSRAC
More informationAn Effective Denoising Method for Images Contaminated with Mixed Noise Based on Adaptive Median Filtering and Wavelet Threshold Denoising
J Inf Process Syst, Vol.14, No.2, pp.539~551, April 2018 https://doi.org/10.3745/jips.02.0083 ISSN 1976-913X (Print) ISSN 2092-805X (Electronic) An Effective Denoising Method for Images Contaminated with
More informationMotion Estimation using Block Overlap Minimization
Motion Estimation using Block Overlap Minimization Michael Santoro, Ghassan AlRegib, Yucel Altunbasak School of Electrical and Computer Engineering, Georgia Institute of Technology Atlanta, GA 30332 USA
More informationReconstructing Vehicle License Plate Image from Low Resolution Images using Nonuniform Interpolation Method
Reconstructing Vehicle License Plate Image from Low Resolution Images using Nonuniform Interpolation Method Shih-Chieh Lin Department of Power Mechanical Engineering National Tsing Hua University Hsin-Chu,
More informationEdge-Preserving MRI Super Resolution Using a High Frequency Regularization Technique
Edge-Preserving MRI Super Resolution Using a High Frequency Regularization Technique Kaveh Ahmadi Department of EECS University of Toledo, Toledo, Ohio, USA 43606 Email: Kaveh.ahmadi@utoledo.edu Ezzatollah
More informationSuper-Resolution (SR) image re-construction is the process of combining the information from multiple
Super-Resolution Super-Resolution (SR) image re-construction is the process of combining the information from multiple Low-Resolution (LR) aliased and noisy frames of the same scene to estimate a High-Resolution
More informationIMAGE super-resolution is the process of reconstructing
1 Adaptive Large Scale Artifact Reduction in Edge-based Image Super-Resolution Alexander Wong and William Bishop Abstract The goal of multi-frame image super-resolution is to use information from low-resolution
More informationAugmented Coupled Dictionary Learning for Image Super-Resolution
Augmented Coupled Dictionary Learning for Image Super-Resolution Muhammad Rushdi and Jeffrey Ho Computer and Information Science and Engineering University of Florida Gainesville, Florida, U.S.A. Email:
More informationCompression Artifact Reduction with Adaptive Bilateral Filtering
Compression Artifact Reduction with Adaptive Bilateral Filtering Ming Zhang and Bahadir Gunturk Department of Electrical and Computer Engineering Louisiana State University Baton Rouge, LA 70803 ABSTRACT
More informationSelf-Learning of Edge-Preserving Single Image Super-Resolution via Contourlet Transform
Self-Learning of Edge-Preserving Single Image Super-Resolution via Contourlet Transform Min-Chun Yang, De-An Huang, Chih-Yun Tsai, and Yu-Chiang Frank Wang Dept. Computer Science and Information Engineering,
More informationAN ITERATIVE APPROACH TO IMAGE SUPER-RESOLUTION
AN ITERATIVE APPROACH TO IMAGE SUPER-RESOLUTION Vivek Bannore' and Leszek Swierkowski^ School of Electrical and Information Engineering, University of South Aust rulia.mawson Lakes SA 5095,Aitstralia.
More informationSEMI-BLIND IMAGE RESTORATION USING A LOCAL NEURAL APPROACH
SEMI-BLIND IMAGE RESTORATION USING A LOCAL NEURAL APPROACH Ignazio Gallo, Elisabetta Binaghi and Mario Raspanti Universitá degli Studi dell Insubria Varese, Italy email: ignazio.gallo@uninsubria.it ABSTRACT
More informationMULTI-POSE FACE HALLUCINATION VIA NEIGHBOR EMBEDDING FOR FACIAL COMPONENTS. Yanghao Li, Jiaying Liu, Wenhan Yang, Zongming Guo
MULTI-POSE FACE HALLUCINATION VIA NEIGHBOR EMBEDDING FOR FACIAL COMPONENTS Yanghao Li, Jiaying Liu, Wenhan Yang, Zongg Guo Institute of Computer Science and Technology, Peking University, Beijing, P.R.China,
More informationResearch Article Cooperative Signaling with Soft Information Combining
Electrical and Computer Engineering Volume 2010, Article ID 530190, 5 pages doi:10.1155/2010/530190 Research Article Cooperative Signaling with Soft Information Combining Rui Lin, Philippa A. Martin, and
More informationIEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 24, NO. 9, SEPTEMBER
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 24, NO. 9, SEPTEMBER 2015 2797 Image Super-Resolution Based on Structure-Modulated Sparse Representation Yongqin Zhang, Member, IEEE, Jiaying Liu, Member, IEEE,
More informationSuperresolution software manual
Superresolution software manual S. Villena, M. Vega, D. Babacan, J. Mateos R. Molina and A. K. Katsaggelos Version 1.0 Contact information: Rafael Molina Departamento de Ciencias de la Computación e I.
More informationTexture Sensitive Image Inpainting after Object Morphing
Texture Sensitive Image Inpainting after Object Morphing Yin Chieh Liu and Yi-Leh Wu Department of Computer Science and Information Engineering National Taiwan University of Science and Technology, Taiwan
More informationImage Restoration. Diffusion Denoising Deconvolution Super-resolution Tomographic Reconstruction
Image Restoration Image Restoration Diffusion Denoising Deconvolution Super-resolution Tomographic Reconstruction Diffusion Term Consider only the regularization term E-L equation: (Laplace equation) Steepest
More informationResearch Article MFT-MAC: A Duty-Cycle MAC Protocol Using Multiframe Transmission for Wireless Sensor Networks
Distributed Sensor Networks Volume 2013, Article ID 858765, 6 pages http://dx.doi.org/10.1155/2013/858765 Research Article MFT-MAC: A Duty-Cycle MAC Protocol Using Multiframe Transmission for Wireless
More informationEFFICIENT PERCEPTUAL, SELECTIVE,
EFFICIENT PERCEPTUAL, SELECTIVE, AND ATTENTIVE SUPER-RESOLUTION RESOLUTION Image, Video & Usability (IVU) Lab School of Electrical, Computer, & Energy Engineering Arizona State University karam@asu.edu
More informationFast restoration of natural images corrupted by high-density impulse noise
Hosseini and Marvasti EURASIP Journal on Image and Video Processing 2013, 2013:15 RESEARCH Open Access Fast restoration of natural images corrupted by high-density impulse noise Hossein Hosseini * and
More informationLecture 2 Image Processing and Filtering
Lecture 2 Image Processing and Filtering UW CSE vision faculty What s on our plate today? Image formation Image sampling and quantization Image interpolation Domain transformations Affine image transformations
More informationResearch Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding
e Scientific World Journal, Article ID 746260, 8 pages http://dx.doi.org/10.1155/2014/746260 Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding Ming-Yi
More informationInterresolution Look-up Table for Improved Spatial Magnification of Image
Journal of Visual Communication and Image Representation 11, 360 373 (2000) doi:10.1006/jvci.1999.0451, available online at http://www.idealibrary.com on Interresolution Look-up Table for Improved Spatial
More informationAuto-focusing Technique in a Projector-Camera System
2008 10th Intl. Conf. on Control, Automation, Robotics and Vision Hanoi, Vietnam, 17 20 December 2008 Auto-focusing Technique in a Projector-Camera System Lam Bui Quang, Daesik Kim and Sukhan Lee School
More informationA Fast Super-Resolution Reconstruction Algorithm for Pure Translational Motion and Common Space-Invariant Blur
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 10, NO. 8, AUGUST 2001 1187 A Fast Super-Resolution Reconstruction Algorithm for Pure Translational Motion and Common Space-Invariant Blur Michael Elad, Member,
More informationA reversible data hiding based on adaptive prediction technique and histogram shifting
A reversible data hiding based on adaptive prediction technique and histogram shifting Rui Liu, Rongrong Ni, Yao Zhao Institute of Information Science Beijing Jiaotong University E-mail: rrni@bjtu.edu.cn
More informationInter-slice Reconstruction of MRI Image Using One Dimensional Signal Interpolation
IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.10, October 2008 351 Inter-slice Reconstruction of MRI Image Using One Dimensional Signal Interpolation C.G.Ravichandran
More informationPatch Based Blind Image Super Resolution
Patch Based Blind Image Super Resolution Qiang Wang, Xiaoou Tang, Harry Shum Microsoft Research Asia, Beijing 100080, P.R. China {qiangwa,xitang,hshum@microsoft.com} Abstract In this paper, a novel method
More informationImage Registration using combination of PCA and GPOF Method for Multiframe Super-Resolution
Image Registration using combination of PCA and GPOF Method for Multiframe Super-Resolution Jagruti Rajput PG Student Parul Institute of Technology Bhailal Limbasiya Assistant Professor Parul Institute
More informationResearch Article Improvements in Geometry-Based Secret Image Sharing Approach with Steganography
Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2009, Article ID 187874, 11 pages doi:10.1155/2009/187874 Research Article Improvements in Geometry-Based Secret Image Sharing
More informationSuperresolution Using Preconditioned Conjugate Gradient Method
Superresolution Using Preconditioned Conjugate Gradient Method Changjiang Yang, Ramani Duraiswami and Larry Davis Computer Vision Laboratory University of Maryland, College Park, MD 20742 E-mail: {yangcj,ramani,lsd}@umiacs.umd.edu
More informationVIDEO OBJECT SEGMENTATION BY EXTENDED RECURSIVE-SHORTEST-SPANNING-TREE METHOD. Ertem Tuncel and Levent Onural
VIDEO OBJECT SEGMENTATION BY EXTENDED RECURSIVE-SHORTEST-SPANNING-TREE METHOD Ertem Tuncel and Levent Onural Electrical and Electronics Engineering Department, Bilkent University, TR-06533, Ankara, Turkey
More informationExpress Letters. A Simple and Efficient Search Algorithm for Block-Matching Motion Estimation. Jianhua Lu and Ming L. Liou
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 7, NO. 2, APRIL 1997 429 Express Letters A Simple and Efficient Search Algorithm for Block-Matching Motion Estimation Jianhua Lu and
More informationMatching. Compare region of image to region of image. Today, simplest kind of matching. Intensities similar.
Matching Compare region of image to region of image. We talked about this for stereo. Important for motion. Epipolar constraint unknown. But motion small. Recognition Find object in image. Recognize object.
More informationOptimizing the Deblocking Algorithm for. H.264 Decoder Implementation
Optimizing the Deblocking Algorithm for H.264 Decoder Implementation Ken Kin-Hung Lam Abstract In the emerging H.264 video coding standard, a deblocking/loop filter is required for improving the visual
More informationAn Edge Based Adaptive Interpolation Algorithm for Image Scaling
An Edge Based Adaptive Interpolation Algorithm for Image Scaling Wanli Chen, Hongjian Shi Department of Electrical and Electronic Engineering Southern University of Science and Technology, Shenzhen, Guangdong,
More informationFace Hallucination Based on Eigentransformation Learning
Advanced Science and Technology etters, pp.32-37 http://dx.doi.org/10.14257/astl.2016. Face allucination Based on Eigentransformation earning Guohua Zou School of software, East China University of Technology,
More informationAccurate Image Registration for MAP Image Super-Resolution
Accurate Image Registration for MAP Image Super-Resolution Michalis Vrigkas, Christophoros Nikou and Lisimachos P. Kondi Department of Computer Science, University of Ioannina, Greece {mvrigkas, cnikou,
More informationFPGA-based Real-time Super-Resolution on an Adaptive Image Sensor
FPGA-based Real-time Super-Resolution on an Adaptive Image Sensor Maria E. Angelopoulou, Christos-Savvas Bouganis, Peter Y. K. Cheung, and George A. Constantinides Department of Electrical and Electronic
More informationImage Inpainting Using Sparsity of the Transform Domain
Image Inpainting Using Sparsity of the Transform Domain H. Hosseini*, N.B. Marvasti, Student Member, IEEE, F. Marvasti, Senior Member, IEEE Advanced Communication Research Institute (ACRI) Department of
More informationAn indirect tire identification method based on a two-layered fuzzy scheme
Journal of Intelligent & Fuzzy Systems 29 (2015) 2795 2800 DOI:10.3233/IFS-151984 IOS Press 2795 An indirect tire identification method based on a two-layered fuzzy scheme Dailin Zhang, Dengming Zhang,
More informationWEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS
WEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS ARIFA SULTANA 1 & KANDARPA KUMAR SARMA 2 1,2 Department of Electronics and Communication Engineering, Gauhati
More informationGuided Image Super-Resolution: A New Technique for Photogeometric Super-Resolution in Hybrid 3-D Range Imaging
Guided Image Super-Resolution: A New Technique for Photogeometric Super-Resolution in Hybrid 3-D Range Imaging Florin C. Ghesu 1, Thomas Köhler 1,2, Sven Haase 1, Joachim Hornegger 1,2 04.09.2014 1 Pattern
More informationK-Means Based Matching Algorithm for Multi-Resolution Feature Descriptors
K-Means Based Matching Algorithm for Multi-Resolution Feature Descriptors Shao-Tzu Huang, Chen-Chien Hsu, Wei-Yen Wang International Science Index, Electrical and Computer Engineering waset.org/publication/0007607
More informationSingle Image Improvement using Superresolution.
Single Image Improvement using Superresolution. ABSTRACT Shwetambari Shinde, Meeta Dewangan Department of Computer Science & Engineering,CSIT,Bhilai,India. shweta_shinde9388@yahoo Department of Computer
More informationMultiframe Blocking-Artifact Reduction for Transform-Coded Video
276 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 12, NO. 4, APRIL 2002 Multiframe Blocking-Artifact Reduction for Transform-Coded Video Bahadir K. Gunturk, Yucel Altunbasak, and
More informationRedundancy and Correlation: Temporal
Redundancy and Correlation: Temporal Mother and Daughter CIF 352 x 288 Frame 60 Frame 61 Time Copyright 2007 by Lina J. Karam 1 Motion Estimation and Compensation Video is a sequence of frames (images)
More informationFAST SINGLE-IMAGE SUPER-RESOLUTION WITH FILTER SELECTION. Image Processing Lab Technicolor R&I Hannover
FAST SINGLE-IMAGE SUPER-RESOLUTION WITH FILTER SELECTION Jordi Salvador Eduardo Pérez-Pellitero Axel Kochale Image Processing Lab Technicolor R&I Hannover ABSTRACT This paper presents a new method for
More informationMoving Object Segmentation Method Based on Motion Information Classification by X-means and Spatial Region Segmentation
IJCSNS International Journal of Computer Science and Network Security, VOL.13 No.11, November 2013 1 Moving Object Segmentation Method Based on Motion Information Classification by X-means and Spatial
More informationResearch Article Implementation of Personal Health Device Communication Protocol Applying ISO/IEEE
Distributed Sensor Networks, Article ID 291295, 4 pages http://dx.doi.org/10.1155/2014/291295 Research Article Implementation of Personal Health Device Communication Protocol Applying ISO/IEEE 11073-20601
More informationCoE4TN3 Medical Image Processing
CoE4TN3 Medical Image Processing Image Restoration Noise Image sensor might produce noise because of environmental conditions or quality of sensing elements. Interference in the image transmission channel.
More informationResearch Article Block-Matching Translational and Rotational Motion Compensated Prediction Using Interpolated Reference Frame
Hindawi Publishing Corporation EURASIP Journal on Advances in Signal Processing Volume 2010, Article ID 385631, 9 pages doi:10.1155/2010/385631 Research Article Block-Matching Translational and Rotational
More informationEdge-directed Image Interpolation Using Color Gradient Information
Edge-directed Image Interpolation Using Color Gradient Information Andrey Krylov and Andrey Nasonov Laboratory of Mathematical Methods of Image Processing, Faculty of Computational Mathematics and Cybernetics,
More informationVideo Compression Method for On-Board Systems of Construction Robots
Video Compression Method for On-Board Systems of Construction Robots Andrei Petukhov, Michael Rachkov Moscow State Industrial University Department of Automatics, Informatics and Control Systems ul. Avtozavodskaya,
More informationEE795: Computer Vision and Intelligent Systems
EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 FDH 204 Lecture 14 130307 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Stereo Dense Motion Estimation Translational
More informationImage Super-Resolution Using Compressed Sensing Based on Learning Sub Dictionary
Image Super-Resolution Using Compressed Sensing Based on Learning Sub Dictionary 1 MUHAMMAD SAMEER SHEIKH, 1 QUNSHENG CAO, 2 CAIYUN WANG 1 College of Electronics and Information Engineering, 2 College
More informationLow Power VLSI Implementation of the DCT on Single
VLSI DESIGN 2000, Vol. 11, No. 4, pp. 397-403 Reprints available directly from the publisher Photocopying permitted by license only (C) 2000 OPA (Overseas Publishers Association) N.V. Published by license
More informationA Fast Image Super-Resolution Algorithm Using an Adaptive Wiener Filter
University of Dayton ecommons Electrical and Computer Engineering Faculty Publications Department of Electrical and Computer Engineering 12-2007 A Fast Image Super-Resolution Algorithm Using an Adaptive
More informationMOTION COMPENSATION IN TEMPORAL DISCRETE WAVELET TRANSFORMS. Wei Zhao
MOTION COMPENSATION IN TEMPORAL DISCRETE WAVELET TRANSFORMS Wei Zhao August 2004 Boston University Department of Electrical and Computer Engineering Technical Report No. ECE-2004-04 BOSTON UNIVERSITY MOTION
More information