• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.405-424
• /
• 2013

This research paper proposes a secured, robust approach of information security using steganography. It presents two component based LSB (Least Significant Bit) steganography methods for embedding secret data in the least significant bits of blue components and partial green components of random pixel locations in the edges of images. An adaptive LSB based steganography is proposed for embedding data based on the data available in MSB's (Most Significant Bits) of red, green, and blue components of randomly selected pixels across smooth areas. A hybrid feature detection filter is also proposed that performs better to predict edge areas even in noisy conditions. AES (Advanced Encryption Standard) and random pixel embedding is incorporated to provide two-tier security. The experimental results of the proposed approach are better in terms of PSNR and capacity. The comparison analysis of output results with other existing techniques is giving the proposed approach an edge over others. It has been thoroughly tested for various steganalysis attacks like visual analysis, histogram analysis, chi-square, and RS analysis and could sustain all these attacks very well.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.259-266
• /
• 2002

In this paper we implemented various image processing filtering using the format converter. This design method is based on realized the large processor-per-pixel array by integrated circuit technology. These two types of integrated structure are can be classify associative parallel processor and parallel process DRAM (or SRAM) cell. Layout pitch of one-bit-wide logic is Identical memory cell pitch to array high density PEs in integrate structure. This format converter design has control path implementation efficiently, and can be utilize the high technology without complicated controller hardware. Sequence of array instruction are generated by host computer before process start, and instructions are saved on unit controller. Host computer is executed the pixel-parallel operation starting at saved instructions after processing start. As a result, we obtained three result that 1) simple smoothing suppresses higher spatial frequencies, reducing noise but also blurring edges, 2) a smoothing and segmentation process reduces noise while preserving sharp edges, and 3) median filtering may be applied to reduce image noise. Median filtering eliminates spikes while maintaining sharp edges and preserving monotonic variations in pixel values.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.221-224
• /
• 2005

In this paper, we propose a fast video mixing method for reducing the computational complexity in the MCU (Multipoint Control Unit) used in the video conferencing. The conventional mixing method is based on the pixeldomain transcoder, of which computational complexity is linearly increased as the number of participants is increased. Basically the method requires N decoders and one huge encoder to mix the bitstreams from the N participants. To reduce the computational complexity, we propose a hybrid mixing method based on the bitstreamdomain and pixel-domain transcoding methods. The proposed method reduces the computational complexity about 45% at the improved quality, compared with the conventional mixing method based on the pixel-domain transcoders.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.3
• /
• pp.173-178
• /
• 2008

In this paper, we present a new impulsive noise detection technique. To remove the impulse noise without detail loss, only corrupted pixels must be filtered. In order to identify the corrupted pixels, a new impulse detector based on rank and value estimations of the current pixel is proposed. Based on the rank and value estimations of the current pixel, the new proposed method provides excellent statistics for detecting an impulse noise while reducing the probability of detecting image details as impulses. The proposed detection is efficient and can be used with any noise removal filter. Simulation results show that the proposed method significantly outperforms many other well-known detection techniques in terms of image restoration and noise detection.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2010.10a
• /
• pp.527-532
• /
• 2010

This paper is concerned with the measurement of static and dynamic displacement by image processing(IP) and study for prediction method of velocity and acceleration. To measure the displacement visually, the measurement system consists of a telephoto zoom camera, ccd image device and a computer. The specific target on the white board is used to calculate the displacement of the structure. The captured image is then converted into a pixel-based data and then analyzed numerically. The limitation of the system depends on the image capturing speed and the pixel-size of image. In this paper, we developed for the displacement measurement using the image processing method. The proposed method enables us to measure the vibration measurement, velocity and acceleration directly without any contact. The current resolution of the displacement measurement is limited to 1/100 millimeter scale.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.21 no.2
• /
• pp.112-119
• /
• 2011

This paper is concerned with the measurement of static and dynamic displacement by image processing(IP) and study for prediction method of velocity and acceleration. To measure the displacement visually, the measurement system consists of a telephoto zoom camera, CCD(charge coupled device) image device and a computer. The specific target on the white board is used to calculate the displacement of the structure. The captured image is then converted into a pixel-based data and then analyzed numerically. The limitation of the system depends on the image capturing speed and the pixel-size of image. In this paper, we developed for the displacement measurement using the image processing method. The proposed method enables us to measure the vibration displacement, velocity and acceleration directly without any contact. The current resolution for the displacement measurement can be seen from the results.

• Proceedings of the KOSOMBE Conference
• /
• v.1990 no.11
• /
• pp.42-47
• /
• 1990

In this paper, a new adaptive image processing method based on human visual system has been presented. The basic idea behind the proposed method is to improve the efficiency of the information transfer channel regionally by manipulating the displayed image in order to compensate the regional inefficiency of the information transfer channel. The proposed method consists of two parts; the first part reallocates pixel values corresponding to high X-ray attenuation to that of more intense X-ray exposure by multiplying the pixel values with the local adaptive multiplcation factor, and the second part adjusts the pixel values of dark area of displayed image such as overexposed lung area to be more bright. The processed image with the proposed method shows significantly increased visibility of mediastinal and subdiaphramatic area, and also the lung area of over exposed case without any artifact.

• Journal of Sensor Science and Technology
• /
• v.21 no.3
• /
• pp.211-216
• /
• 2012

Fires are the most common disaster and early fire detection is of great importance to minimize the consequent damage. Simple sensors including smoke detectors are widely used for the purpose but they are able to sense fires only at close proximity. Recently, due to the rapid advances of relevant technologies, vision-based fire sensing has attracted growing attention. In this paper, a novel visual sensing technique to automatically detect fire is presented. The proposed technique consists of multiple steps of image processing: pixel-level, block-level, and frame level. At the first step, fire flame pixel candidates are selected based on their color values in YIQ space from the image of a camera which is installed as a vision sensor at a fire scene. At the second step, the dynamic parts of flames are extracted by comparing two consecutive images. These parts are then represented in regularly divided image blocks to reduce pixel-level detection error and simplify following processing. Finally, the temporal change of the detected blocks is analyzed to confirm the spread of fire. The proposed technique was tested using real fire images and it worked quite reliably.

• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.59-74
• /
• 2022

During the last decade, the security of digital images has received considerable attention in various multimedia transmission schemes. However, many current cryptosystems tend to adopt a single-layer permutation or diffusion algorithm, resulting in inadequate security. A hierarchical bilateral diffusion architecture for color image encryption is proposed in response to this issue, based on a hyperchaotic system and DNA sequence operation. Primarily, two hyperchaotic systems are adopted and combined with cipher matrixes generation algorithm to overcome exhaustive attacks. Further, the proposed architecture involves designing pixelpermutation, pixel-diffusion, and DNA (deoxyribonucleic acid) based block-diffusion algorithm, considering system security and transmission efficiency. The pixel-permutation aims to reduce the correlation of adjacent pixels and provide excellent initial conditions for subsequent diffusion procedures, while the diffusion architecture confuses the image matrix in a bilateral direction with ultra-low power consumption. The proposed system achieves preferable number of pixel change rate (NPCR) and unified average changing intensity (UACI) of 99.61% and 33.46%, and a lower encryption time of 3.30 seconds, which performs better than some current image encryption algorithms. The simulated results and security analysis demonstrate that the proposed mechanism can resist various potential attacks with comparatively low computational time consumption.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.26-28
• /
• 2007

The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.