• Title/Summary/Keyword: sub-image

Search Result 1,282, Processing Time 0.033 seconds

Method for Restoring the Spatial Resolution of KOMPSAT-3A MIR Image (KOMPSAT-3A 중적외선 영상의 공간해상도 복원 기법)

  • Oh, Kwan-Young;Lee, Kwang-Jae;Jung, Hyung-Sup;Park, Sung-Hwan;Kim, Jeong-Cheol
    • Korean Journal of Remote Sensing
    • /
    • v.35 no.6_4
    • /
    • pp.1391-1401
    • /
    • 2019
  • The KOMPSAT-3A is a high-resolution optical satellite launched in 2015 by Korea Aerospace Research Institute (KARI). KOMPSAT-3A provides Panchromatic (PAN-0.55 m), Multispectral (MS-2.2 m), and Mid-wavelength infrared (MIROR-5.5 m) image. However, due to security or military problems, MIROR image with 5.5m spatial resolution are provided down sampled at 33 m spatial resolution (MIRrd). In this study, we propose spatial sharpening method to improve the spatial resolution of MIRrd image (33 m) using virtual High Frequency (HF) image and optimal fusion factor. Using MS image and MIRrd image, we generated virtual high resolution (5.5 m) MIRORfus image and then compared them to actual high-resolution MIROR image. The test results show that the proposed method merges the spatial resolution of MS image and the spectral information of MIRrd image efficiently.

COMPARISON OF SUB-SAMPLING ALGORITHM FOR LRIT IMAGE GENERATION

  • Bae, Hee-Jin;Ahn, Sang-Il
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.109-113
    • /
    • 2007
  • The COMS provides the LRIT/HRIT services to users. The COMS LRIT/HRIT broadcast service should satisfy the 15 minutes timeliness requirement. The requirement is important and critical enough to impact overall performance of the LHGS. HRIT image data is acquired from INRSM output receiving but LRIT image data is generated by sub-sampling HRIT image data in the LHGS. Specially, since LRIT is acquired from sub-sampled HRIT image data, LRIT processing spent more time. Besides, some of data loss for LRIT occurs since LRIT is compressed by lossy JPEG. Therefore, algorithm with the fastest processing speed and simplicity to be implemented should be selected to satisfy the requirement. Investigated sub-sampling algorithm for the LHGS were nearest neighbour algorithm, bilinear algorithm and bicubic algorithm. Nearest neighbour algorithm is selected for COMS LHGS considering the speed, simplicity and anti-aliasing corresponding to the guideline of user (KMA: Korea Meteorological Administration) to maintain the most cloud itself information in a view of meteorology. But the nearest neighbour algorithm is known as the worst performance. Therefore, it is studied in this paper that the selection of nearest neighbour algorithm for the LHGS is reasonable. First of all, characteristic of 3 sub-sampling algorithms is studied and compared. Then, several sub-sampling algorithm were applied to MTSAT-1R image data corresponding to COMS HRIT. Also, resized image was acquired from sub-sampled image with the identical sub-sampling algorithms applied to sub-sampling from HRIT to LRIT. And the difference between original image and resized image is compared. Besides, PSNR and MSE are calculated for each algorithm. This paper shows that it is appropriate to select nearest neighbour algorithm for COMS LHGS since sub-sampled image by nearest neighbour algorithm is little difference with that of other algorithms in quality performance from PSNR.

  • PDF

3D Image Correlator using Computational Integral Imaging Reconstruction Based on Modified Convolution Property of Periodic Functions

  • Jang, Jae-Young;Shin, Donghak;Lee, Byung-Gook;Hong, Suk-Pyo;Kim, Eun-Soo
    • Journal of the Optical Society of Korea
    • /
    • v.18 no.4
    • /
    • pp.388-394
    • /
    • 2014
  • In this paper, we propose a three-dimensional (3D) image correlator by use of computational integral imaging reconstruction based on the modified convolution property of periodic functions (CPPF) for recognition of partially occluded objects. In the proposed correlator, elemental images of the reference and target objects are picked up by a lenslet array, and subsequently are transformed to a sub-image array which contains different perspectives according to the viewing direction. The modified version of the CPPF is applied to the sub-images. This enables us to produce the plane sub-image arrays without the magnification and superimposition processes used in the conventional methods. With the modified CPPF and the sub-image arrays, we reconstruct the reference and target plane sub-image arrays according to the reconstruction plane. 3D object recognition is performed through cross-correlations between the reference and the target plane sub-image arrays. To show the feasibility of the proposed method, some preliminary experiments on the target objects are carried out and the results are presented. Experimental results reveal that the use of plane sub-image arrays enables us to improve the correlation performance, compared to the conventional method using the computational integral imaging reconstruction algorithm.

FUSESHARP: A MULTI-IMAGE FOCUS FUSION METHOD USING DISCRETE WAVELET TRANSFORM AND UNSHARP MASKING

  • GARGI TRIVEDI;RAJESH SANGHAVI
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.5
    • /
    • pp.1115-1128
    • /
    • 2023
  • In this paper, a novel hybrid method for multi-focus image fusion is proposed. The method combines the advantages of wavelet transform-based methods and focus-measure-based methods to achieve an improved fusion result. The input images are first decomposed into different frequency sub-bands using the discrete wavelet transform (DWT). The focus measure of each sub-band is then calculated using the Laplacian of Gaussian (LoG) operator, and the sub-band with the highest focus measure is selected as the focused sub-band. The focused sub-band is sharpened using an unsharp masking filter to preserve the details in the focused part of the image.Finally, the sharpened focused sub-bands from all input images are fused using the maximum intensity fusion method to preserve the important information from all focus images. The proposed method has been evaluated using standard multi focus image fusion datasets and has shown promising results compared to existing methods.

Spatio-Angular Consistent Edit Propagation for 4D Light Field Image (4 차원 Light Field 영상에서의 일관된 각도-공간적 편집 전파)

  • Williem, Williem;Park, In Kyu
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2015.11a
    • /
    • pp.180-181
    • /
    • 2015
  • In this paper, we present a consistent and efficient edit propagation method that is applied for light field data. Unlike conventional sparse edit propagation, the coherency between light field sub-aperture images is fully considered by utilizing light field consistency in the optimization framework. Instead of directly solving the optimization function on all light field sub-aperture images, the proposed optimization framework performs sparse edit propagation in the extended focus image domain. The extended focus image is the representative image that contains implicit depth information and the well-focused region of all sub-aperture images. The edit results in the extended focus image are then propagated back to each light field sub-aperture image. Experimental results on test images captured by a Lytro off-the-shelf light field camera confirm that the proposed method provides robust and consistent results of edited light field sub-aperture images.

  • PDF

Cascaded Residual Densely Connected Network for Image Super-Resolution

  • Zou, Changjun;Ye, Lintao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.2882-2903
    • /
    • 2022
  • Image super-resolution (SR) processing is of great value in the fields of digital image processing, intelligent security, film and television production and so on. This paper proposed a densely connected deep learning network based on cascade architecture, which can be used to solve the problem of super-resolution in the field of image quality enhancement. We proposed a more efficient residual scaling dense block (RSDB) and the multi-channel cascade architecture to realize more efficient feature reuse. Also we proposed a hybrid loss function based on L1 error and L error to achieve better L error performance. The experimental results show that the overall performance of the network is effectively improved on cascade architecture and residual scaling. Compared with the residual dense net (RDN), the PSNR / SSIM of the new method is improved by 2.24% / 1.44% respectively, and the L performance is improved by 3.64%. It shows that the cascade connection and residual scaling method can effectively realize feature reuse, improving the residual convergence speed and learning efficiency of our network. The L performance is improved by 11.09% with only a minimal loses of 1.14% / 0.60% on PSNR / SSIM performance after adopting the new loss function. That is to say, the L performance can be improved greatly on the new loss function with a minor loss of PSNR / SSIM performance, which is of great value in L error sensitive tasks.

Comparison of the Quality of Various Polychromatic and Monochromatic Dual-Energy CT Images with or without a Metal Artifact Reduction Algorithm to Evaluate Total Knee Arthroplasty

  • Hye Jung Choo;Sun Joo Lee;Dong Wook Kim;Yoo Jin Lee;Jin Wook Baek;Ji-yeon Han;Young Jin Heo
    • Korean Journal of Radiology
    • /
    • v.22 no.8
    • /
    • pp.1341-1351
    • /
    • 2021
  • Objective: To compare the quality of various polychromatic and monochromatic images with or without using an iterative metal artifact reduction algorithm (iMAR) obtained from a dual-energy computed tomography (CT) to evaluate total knee arthroplasty. Materials and Methods: We included 58 patients (28 male and 30 female; mean age [range], 71.4 [61-83] years) who underwent 74 knee examinations after total knee arthroplasty using dual-energy CT. CT image sets consisted of polychromatic image sets that linearly blended 80 kVp and tin-filtered 140 kVp using weighting factors of 0.4, 0, and -0.3, and monochromatic images at 130, 150, 170, and 190 keV. These image sets were obtained with and without applying iMAR, creating a total of 14 image sets. Two readers qualitatively ranked the image quality (1 [lowest quality] through 14 [highest quality]). Volumes of high- and low-density artifacts and contrast-to-noise ratios (CNRs) between the bone and fat tissue were quantitatively measured in a subset of 25 knees unaffected by metal artifacts. Results: iMAR-applied, polychromatic images using weighting factors of -0.3 and 0.0 (P-0.3i and P0.0i, respectively) showed the highest image-quality rank scores (median of 14 for both by one reader and 13 and 14, respectively, by the other reader; p < 0.001). All iMAR-applied image series showed higher rank scores than the iMAR-unapplied ones. The smallest volumes of low-density artifacts were found in P-0.3i, P0.0i, and iMAR-applied monochromatic images at 130 keV. The smallest volumes of high-density artifacts were noted in P-0.3i. The CNRs were best in polychromatic images using a weighting factor of 0.4 with or without iMAR application, followed by polychromatic images using a weighting factor of 0.0 with or without iMAR application. Conclusion: Polychromatic images combined with iMAR application, P-0.3i and P0.0i, provided better image qualities and substantial metal artifact reduction compared with other image sets.

A Novel Sub-image Retrieval Approach using Dot-Matrix (점 행렬을 이용한 새로운 부분 영상 검색 기법)

  • Kim, Jun-Ho;Kang, Kyoung-Min;Lee, Do-Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.3
    • /
    • pp.1330-1336
    • /
    • 2012
  • The Image retrieval has been study different approaches which are text-based, contents-based, area-based method and sub-image finding. The sub-image retrieval is to find a query image in the target one. In this paper, we propose a novel sub-image retrieval algorithm by Dot-Matrix method to be used in the bioinformatics. Dot-Matrix is a method to evaluate similarity between two sequences and we redefine the problem for retrieval of sub-image to the finding similarity of two images. For the approach, the 2 dimensional array of image converts a the vector which has gray-scale value. The 2 converted images align by dot-matrix and the result shows candidate sub-images. We used 10 images as target and 5 queries: duplicated, small scaled, and large scaled images included x-axes and y-axes scaled one for experiment.

Fuzzy Sub-Field Mapping Algorithm For High Image Quality PDP (고화질 PDP를 위한 Fuzzy Sub-Field 맵핑 알고리즘)

  • 구본철;진성일;최두현
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.359-362
    • /
    • 2003
  • In PDP(Plasma Display Panel), sub-field method is used to implement gray scale. Each sub-field has different periods. And Every gray level has information of which sub-field has to be displayed. This is called sub-field mapping. There are several sub-field mapping values in some gray levels. So, it is possible to select best choice in this paper, we propose new sub field mapping method using a fuzzy inference system to select best sub-field mapping values in accordance with input image and environment temperature. In order to implement fuzzy system, we used MATLAB fuzzy inference editor.

  • PDF

A Versatile Medical Image Enhancement Algorithm Based on Wavelet Transform

  • Sharma, Renu;Jain, Madhu
    • Journal of Information Processing Systems
    • /
    • v.17 no.6
    • /
    • pp.1170-1178
    • /
    • 2021
  • This paper proposed a versatile algorithm based on a dual-tree complex wavelet transform for intensifying the visual aspect of medical images. First, the decomposition of the input image into a high sub-band and low-sub-band image is done. Further, to improve the resolution of the resulting image, the high sub-band image is interpolated using Lanczos interpolation. Also, contrast enhancement is performed by singular value decomposition (SVD). Finally, the image reconstruction is achieved by using an inverse wavelet transform. Then, the Gaussian filter will improve the visual quality of the image. We have collected images from the hospital and the internet for quantitative and qualitative analysis. These images act as a reference image for comparing the effectiveness of the proposed algorithm with the existing state-of-the-art. We have divided the proposed algorithm into several stages: preprocessing, contrast enhancement, resolution enhancement, and visual quality enhancement. Both analyses show the proposed algorithm's effectiveness compared to existing methods.