• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.132-134
• /
• 2004

This paper proposes partial image encryption system for secure transmission of images. Partial image encryption is suitable for real-time processing purpose of multimedia data that needs compression and encryption. Compression part uses modified SPIHT algorithm and encryption part uses AES. Partial image encryption is significant reduction in encryption time in comparison with whole image encryption.

• The Journal of the Convergence on Culture Technology
• /
• v.4 no.4
• /
• pp.355-360
• /
• 2018

We propose a method to connect partial image in whole image to partial image in whole image of other internet site. For this study, we have developed four partial image generation methods and retrieval methods. A method of 'image segmentation' that cuts out only partial images that want to provide information from the whole image, a method of 'creating an image block' that finds outermost points of a cut-out partial image, a method of 'Stamp transformation of outer points', which connects outer points and registers them as the most similar image stamp, and a retrieval method that connects image stamps with other image stamps are developed. We suggested a image search UI that can use image stamps in various ways.

• Journal of the Korean Institute of Navigation
• /
• v.19 no.3
• /
• pp.21-28
• /
• 1995

Mathematical morphology skeleton image processing makes many partial skeleton image planes from an original binary image. And the original binary image can be reconstructed without any distortion by summing the first partial skeleton image plane and each dilated partial skeleton image planes using the same structuring element. Especially compression effects of Elias coding to the morphological globally minimal skeleton(GMS) image, is better than that of PCX and Huffman coding. And then this paper proposes mathematical morphological GMS image processing which can be applied to a binary image transmitting for facimile and big size(bigger than $64{\times}64$ size) bitmap fonts storing in a memory.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.943-957
• /
• 2014

Removing noise, called denoising, is an essential factor for the more intuitive and more accurate results in boundary image matching. This paper deals with a partial denoising problem that tries to allow a limited amount of partial noise embedded in boundary images. To solve this problem, we first define partial denoising time-series which can be generated from an original image time-series by removing a variety of partial noises and propose an efficient mechanism that quickly obtains those partial denoising time-series in the time-series domain rather than the image domain. We next present the partial denoising distance, which is the minimum distance from a query time-series to all possible partial denoising time-series generated from a data time-series, and we use this partial denoising distance as a similarity measure in boundary image matching. Using the partial denoising distance, however, incurs a severe computational overhead since there are a large number of partial denoising time-series to be considered. To solve this problem, we derive a tight lower bound for the partial denoising distance and formally prove its correctness. We also propose range and k-NN search algorithms exploiting the partial denoising distance in boundary image matching. Through extensive experiments, we finally show that our lower bound-based approach improves search performance by up to an order of magnitude in partial denoising-based boundary image matching.

• Korean Journal of Mathematics
• /
• v.17 no.4
• /
• pp.361-374
• /
• 2009

We characterize a fuzzy partial order relation using its level set, find sufficient conditions for the image of a fuzzy partial order relation to be a fuzzy partial order relation, and find sufficient conditions for the inverse image of a fuzzy partial order relation to be a fuzzy partial order relation. Also we define a fuzzy lattice as fuzzy relations, characterize a fuzzy lattice using its level set, show that a fuzzy totally ordered set is a distributive fuzzy lattice, and show that the direct product of two fuzzy lattices is a fuzzy lattice.

• Journal of Mechanical Science and Technology
• /
• v.20 no.10
• /
• pp.1691-1701
• /
• 2006

The scan type magnetic camera is proposed to improve the limited spatial resolution due to the size of the packaged magnetic sensor. An image of the scan type magnetic camera, ${\partial}B/{\partial}x$ image, is useful for extracting the crack information of a specimen under a large inclined mag netic field distribution due to the poles of magnetizer. The ${\partial}B/{\partial}x$ images of the cracks of different shapes and sizes are calculated by using the improved dipole model proposed in this paper. The improved dipole model uses small divided dipole models, the rotation and relocation of each dipole model and the principle of superposition. Also for a low carbon steel specimen, the experimental results of nondestructive testing obtained by using multiple cracks are compared with the modeling results to verify the effectiveness of ${\partial}B/{\partial}x$ modeling. The improved dipole model can be used to simulate the LMF and ${\partial}B/{\partial}x$ image of a specimen with complex cracks, and to evaluate the cracks quantitatively using magnetic flux leakage testing.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.526-531
• /
• 1992

Partial derivatives are easily computed analytically assuming that all the geometric information is known. However, there are computational difficulties in getting accurate partial derivatives directly from a range image since an image is a discrete version of continuous data contaminated with some noise. In this paper, we develop a general window function to compute partial derivatives based on the least square surface fitting method. A dynamic selective surface fitting method is introduced to make the window less sensitive to noise. Any degree of partial derivative can be obtained by a simple convolution between an image and window functions.

• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.145-152
• /
• 2002

As the number of digital images available to users is exponentially growing due to the rapid development of digital technology, content-based image retrieval (CBIR) has been one of the most active research areas. A variety of image retrieval methods have been proposed, where, given an input query image, the images that are similar to the input are retrieved from an image database based on low-level features such as colors and textures. However, most of the existing retrieval methods did not consider the case when an input query image is a part of a whole image in the database due to the high complexity involved in partial matching. In this paper, we present an efficient method for partial image matching by using the histogram distribution relationships between query image and whole image. The proposed approach consists of two steps: the first step prunes the search space and the second step performs block-based retrieval using partial image matching to rank images in candidate set. The experimental results demonstrate the feasibility of the proposed algorithm after assuming that the response tune of the system is very high while retrieving only by using partial image matching without Pruning the search space.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2002.09a
• /
• pp.322-323
• /
• 2002

Partial volume averaging effect of PET data influences on the accuracy of quantitative measurements of regional brain metabolism because spatial resolution of PET is limited. The purpose of this study was to evaluate the accuracy of partial volume correction carried out on $^{18}$ F-PET images using Hoffman brain phantom. $^{18}$ F-PET Hoffman phantom images were co-registered to MR slices of the same phantom. All the MR slices of the phantom were then segmented to be binary images. Each of these binary images was convolved in 2 dimensions with the spatial resolution of the PET. The original PET images were then divided by the smoothed binary images in slice-by-slice, voxel-by-voxel basis resulting in larger PET image volume in size. This enlarged partial volume corrected PET image volume was multiplied by original binary image volume to exclude extracortical region. The evaluation of partial volume corrected PET image volume was performed by region of interests (ROI) analysis applying ROIs, which were drawn on cortical regions of the original MR image slices, to corrected and original PET image volume. From the ROI analysis, range of regional mean values increases of partial volume corrected PET images was 4 to 14%, and average increase for all the ROIs was about 10% in this phantom study. Hoffman brain phantom study was useful for the objective evaluation of the partial volume correction method. This MR-based correction method would be applicable to patients in the. quantitative analysis of FDG-PET studies.

• International Journal of Contents
• /
• v.3 no.4
• /
• pp.15-21
• /
• 2007

Image morphing deals with the metamorphosis of one image into another. The field morphing depends on the manual work for most of the process, where a user has to designate the control lines. It takes time and requires skills to have fine quality results. It is an object of this paper to propose a method capable of realizing the semi-automation of field morphing using adaptive vertex correspondence based on image segmentation. The adaptive vertex correspondence process efficiently generates a pair of control lines by adaptively selecting reference partial contours based on the number of vertices that are included in the partial contour of the source morphing object and in the partial contour of the destination morphing object, in the pair of the partial contour designated by external control points through user input. The proposed method generates visually fluid morphs and warps with an easy-to-use interface. According to the proposed method, a user can shorten the time to set control lines and even an unskilled user can obtain natural morphing results as he or she designates a small number of external control points.