• The KIPS Transactions:PartB
• /
• v.12B no.2 s.98
• /
• pp.131-136
• /
• 2005

Motion Estimation (ME) has been developed to remove redundant data contained in a sequence of image. And ME is an important part of video encoding systems, since it can significantly affect the qualify of an encoded sequences. Generally, ME consists of two stages, the integer pixel motion estimation and the half pixel motion estimation. Many methods have been developed to reduce the computational complexity at the integer pixel motion estimation. However, the studies are needed at the half pixel motion estimation to reduce the complexity. In this paper, a method based on the correlations between integer pixel motion vectors and half pixel motion vectors is proposed for the half pixel motion estimation. The proposed method has less computational complexity than the full half pixel search method (FHSM) that needs the bilinear interpolation of half pixels and examines nine half pixel points to the find the half pixel motion vector. Experimental results show that the speedup improvement of the proposed method over FHSM can be up to $2.5\~80$ times faster and the image quality degradation is about to $0.07\~0.69(dB)$.

• Korean Journal of Remote Sensing
• /
• v.38 no.1
• /
• pp.33-43
• /
• 2022

This study presents a method to restore an optical satellite image with distortion and occlusion due to fog, haze, and clouds to one that minimizes degradation factors by referring to the same type of peripheral image. Specifically, the time and cost of re-photographing were reduced by partially occluding a region. To maintain the original image's pixel value as much as possible and to maintain restored and unrestored area continuity, a simulation restoration technique modified with the Cycle Generative Adversarial Network (CycleGAN) method was developed. The accuracy of the simulated image was analyzed by comparing CycleGAN and histogram matching, as well as the pixel value distribution, with the original image. The results show that for Site 1 (out of three sites), the root mean square error and R² of CycleGAN were 169.36 and 0.9917, respectively, showing lower errors than those for histogram matching (170.43 and 0.9896, respectively). Further, comparison of the mean and standard deviation values of images simulated by CycleGAN and histogram matching with the ground truth pixel values confirmed the CycleGAN methodology as being closer to the ground truth value. Even for the histogram distribution of the simulated images, CycleGAN was closer to the ground truth than histogram matching.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.61-70
• /
• 2023

Image segmentation is a very crucial step in effective digital image processing. In the past decade, several research contributions were given related to this field. However, a general segmentation algorithm suitable for various applications is still challenging. Among several image segmentation approaches, graph-based approach has gained popularity due to its basic ability which reflects global image properties. This paper proposes a methodology to partition the image with its pixel, region and texture along with its intensity. To make segmentation faster in large images, it is processed in parallel among several CPUs. A way to achieve this is to split images into tiles that are independently processed. However, regions overlapping the tile border are split or lost when the minimum size requirements of the segmentation algorithm are not met. Here the contributions are made to segment the image on the basis of its pixel using min-cut/max-flow algorithm along with edge-based segmentation of the image. To segment on the basis of the region using a homogenous optimum cut algorithm with boundary segmentation. On the basis of texture, the object type using spectral partitioning technique is identified which also minimizes the graph cut value.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.604-607
• /
• 2005

All CCD pixels do not react uniformly even if the light of same radiance enters into the camera. This comes from the different camera optical characteristics, the read-out characteristics, the pixel own characteristics and so on. Usually, the image data of satellite camera can be corrected by the various image-processing methods in the ground. However, sometimes, the in-orbit correction is needed to get the higher quality image. Especially high frequency pixel correction in the middle of in-orbit mission is needed because the in-orbit data compression with the high frequency loss is essential to transmit many data in real time due to the limited RF bandwidth. In this case, this high frequency correction can prevent have to have any unnecessary high frequency loss. This in-orbit correction can be done by the specific correction table, which consists of the gain and the offset correction value for each pixel. So, it is very important to get more accurate correction table for good correction results. This paper shows the new algorithm to get accurate pixel correction table. This algorithm shall be verified theoretically and also verified with the various simulation and the test results.

• Journal of the Korean Society of Radiology
• /
• v.16 no.2
• /
• pp.157-162
• /
• 2022

Since preclinical positron emission tomography imaging is performed on small animals that are very small compared to the human body, a detector with excellent spatial resolution is required. For this purpose, a system was constructed using a detector using small scintillation pixels. Since the size of the currently developed and used photosensors is limited, excellent spatial resolution can be obtained when the minimum scintillation pixel and maximum array are used. In this study, the size of the photosensor is fixed and various scintillation pixel arrays are configured to match the size of the scintillation pixels, so that no overlap occurs in the flood image and the maximum scintillation pixel array in which all scintillation pixels are distinguished. For this purpose, DETECT2000, which can simulate a detector module composed of a scintillator and an photosensor, was used. A photosensor consisting of a 4 × 4 array of 3 mm × 3 mm pixels was used, and the scintillation pixel array was configured from 8 × 8 to 13 × 13, and simulations were performed. A flood image was constructed using the data obtained from the photosensor pixel, and the maximum scintillation pixel array that does not overlap the image was found through the flood image and the profile. As a result, the size of the scintillation pixel array in which all scintillation pixels are imaged without overlapping each other in the flood image was 11 × 11.

• Journal of the Korean Society for Precision Engineering
• /
• v.32 no.9
• /
• pp.833-840
• /
• 2015

Inkjet technology is one of the commonly used technologies in the printed-electronics field. The primary issue regarding the usage of inkjet technology as a printed-electronics tool is the printing resolution; therefore, to print complicated patterns of precise dimensions, we developed software that can convert a CAD file into a bitmap image. Moreover, as a bitmap image is not comprised of physical dimensions, its resolution needs to be defined in terms of pixel distance to print a rasterized bitmap image. In this study, we investigated the effects of pixel distance and dot size on printing resolution; based on the experiment results, we concluded that the printed dot size should be used to determine the optimal pixel distance. Lastly, we also propose inkjet printing procedures for bitmap images.

• International Journal of Advanced Culture Technology
• /
• v.6 no.3
• /
• pp.173-177
• /
• 2018

Masks are generated by adding different fonts of learning data characters in pixel unit, and pixel values belonging to each of the masks are divided into 3 groups. Using the directional expansion operators, we expand the text area of the test data character into 4 diagonal directions in order to create the boundary areas to distinguish it from the background area. A mask with a minimum average discordance is selected as the final recognition result by calculating the degree of discordance between the expanded test data and the masks. Image comparison using directional expansion operations more accurately recognizes test data through 4 subdivided recognition processes. It is also possible to expand the ranges of 3 groups of pixel values of masks more evenly such that new fonts can easily be added to the given learning data.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.15 no.2
• /
• pp.245-252
• /
• 1997

The development of digital camera and advancement of computer processor could simplify the acquisition and the analysis of digial image, and be the real-time processing by the digital photogrammetry. This study is about to enhancement of the image measuring accuracy by the centroid methods. We were able to determine more effective centroid measuring methods and suitable target shape as the development of analysis system and actualize semi-automatic measuring of digital image. And we can supply the weakness of non-metric camera for the geometric internal accuracy of digital image as the correct of Kodak DCS200 camera 8008s lens distortion.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.4
• /
• pp.68-75
• /
• 2008

This paper proposes a new data hiding method for binary images using the weighting value of pixel-value differencing. The binary cover image is partitioned into non-overlapping sub-blocks and find the most suitable position to embed a secret bit for each sub-block. The proposed method calculates the weighted value for a sub-block to pivot a pixel to be changed. This improves the image quality of the stego-image. The experimental results show that the proposed method achieves a good visual quality and high capacity.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.612-613
• /
• 2010

The common image processing method treat the image as the array of pixels, and every pixel with its eight neighbors who directly around it form a square neighbor domain, sometimes may be more than that such as $5{\times}5$, or $7{\times}7$, and then adopt the convolution and template for every possible pixel value and then divide a attenuation factor, restrict the result in the area between 0 and 255, while the original and processed value record respectively. During the whole procedure, the result sole exist and represent the processing without changing the original pixel.