• Journal of Broadcast Engineering
• /
• v.13 no.2
• /
• pp.188-199
• /
• 2008

In conventional video coding, encoder complexity is much higher than that of decoder. However, investigations for lightweight encoder to eliminate motion prediction/compensation claiming most complexity in encoder have recently become an important issue. The Wyner-Ziv coding is one of the representative schemes for the problem and, in this scheme, since encoder generates only parity bits of a current frame without performing any type of processes extracting correlation information between frames, it has an extremely simple structure compared to conventional coding techniques. However, in Wyner-Ziv coding, channel decoding errors occur when noisy side information is used in channel decoding process. These channel decoding errors appear more frequently, especially, when there is not enough correlation between frames to generate accurate side information and, as a result, those errors look like Salt & Pepper type noise in the reconstructed frame. Since this noise severely deteriorates subjective video quality even though such noise rarely occurs, previously we proposed a computationally extremely light encoding method based on selective median filter that corrects such noise using spatial correlation of a frame. However, in the previous method, there is a problem that loss of texture from filtering may exceed gain from error correction by the filter for video sequences having complex torture. Therefore, in this paper, we propose an improved lightweight encoding method that minimizes loss of texture detail from filtering by allowing information of texture and that of noise in side information to be utilized by the selective median filter. Our experiments have verified average PSNR gain of up to 0.84dB compared to the previous method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.17 no.2
• /
• pp.71-76
• /
• 2016

Digital image processing is being utilized in various fields including medical industry, satellite photos, and factory automation image recognition. However, this kind of image data produces heat by an external cause in the course of being processed, transmitted, and stored. Most typical noises added in the images are AWGN and salt and pepper. MF, CWMF, and AWMF are methods used to restore images damaged by AWGN and the existing methods are likely to damage detailed information such as an edge. Therefore, this paper suggests an algorithm applying weight of average filter, average filter depending on pixel, and spatial weight filter based on edge size of local mask in an AWGN environment, in a different way. Also, this paper compares functions of existing methods by using PSNR to prove excellence of the suggested algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.8
• /
• pp.943-949
• /
• 2019

As use of digital equipment in various fields is increasing importance of processing video and signals is rising as well. However, in the process of sending and receiving signals, noise occurs due to different reasons and this noise bring about a huge influence on final output of the system. This research suggests algorithm for effectively repairing video in consideration to characteristics of its noise in condition where impulse and AWGN noises are combined. This algorithm tries to preserve video features by considering inference to noise components and resolution of filtering mask. Depending on features of input resolution, standard value is set and similar resolutions is selected for noise removal. This algorithm showing simulation result had outstanding noise removal and is compared and analyzed with existing methods by using different ways such as PSNR.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.455-458
• /
• 2008

Former times Information Technology generally has only depended on text or sound, while nowadays information is being moved through a variety of image media. Cell phone, TV and computer have been major elements of modem society as mediators using image signal. Therefore, image signal processing also has been treated importantly and done actively. The processing has been developed in many fields of digital image processing technologies as image data compression, recognition, restoration, etc. Noises are inevitably generated by using the signals during the processing, and typical types of the noise are Impulse(salt & pepper) and AWGN(Addiction White Gaussian Noise). To reduce the noise, various kinds of filters have been developed, and according to each noise, it is being used different filter each. However, the noise is not generated by one signal but by a complex. In this paper, I suggested an image filter to remove the complex noise, and compared with existing filters' methods for verification.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.6
• /
• pp.95-105
• /
• 2003

A novel reference point detection method is proposed by exploiting tile gradient probabilistic model that captures the curvature information of fingerprint. The detection of reference point is accomplished through searching and locating the points of occurrence of the most evenly distributed gradient in a probabilistic sense. The uniformly distributed gradient texture represents either the core point itself or those of similar points that can be used to establish the rigid reference from which to map the features for recognition. Key benefits are reductions in preprocessing and consistency of locating the same points as the reference points even when processing arch type fingerprints. Moreover, the new feature extraction method is proposed by improving the existing feature extraction using filterbank method. Experimental results indicate the superiority of tile proposed scheme in terms of computational time in feature extraction and verification rate in various noisy environments. In particular, the proposed gradient probabilistic model achieved 49% improvement under ambient noise, 39.2% under brightness noise and 15.7% under a salt and pepper noise environment, respectively, in FAR for the arch type fingerprints. Moreover, a reduction of 0.07sec in reference point detection time of the GPM is shown possible compared to using the leading the poincare index method and a reduction of 0.06sec in code extraction time of the new filterbank mettled is shown possible compared to using the leading the existing filterbank method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.1
• /
• pp.11-21
• /
• 2008

In conventional video coding, the complexity of encoder is much higher than that of decoder. However, as more needs arises for extremely simple encoder in environments having constrained energy such as sensor network, much investigation has been carried out for eliminating motion prediction/compensation claiming most complexity and energy in encoder. The Wyner-Ziv coding, one of the representative schemes for the problem, reconstructs video at decoder by correcting noise on side information using channel coding technique such as turbo code. Since the encoder generates only parity bits without performing any type of processes extracting correlation information between frames, it has an extremely simple structure. However, turbo decoding errors occur in noisy side information. When there are high-motion or occlusion between frames, more turbo decoding errors appear in reconstructed frame and look like Salt & Pepper noise. This severely deteriorates subjective video quality even though such noise rarely occurs. In this paper, we propose a computationally extremely light encoder based on symbol-level Wyner-Ziv coding technique and a new corresponding decoder which, based on a decision whether a pixel has error or not, applies median filter selectively in order to minimize loss of texture detail from filtering. The proposed method claims extremely low encoder complexity and shows improvements both in subjective quality and PSNR. Our experiments have verified average PSNR gain of up to 0.8dB.

• Journal of applied mathematics & informatics
• /
• v.39 no.5_6
• /
• pp.859-882
• /
• 2021

In the proposed paper, a new algorithm based on Nonlinear Feedback Shift Register (NLFSR) and modified RC4A (Rivest Cipher 4A) cipher is introduced. NLFSR is used for image pixel scrambling while modified RC4A algorithm is used for pixel substitution. NLFSR used in this algorithm is of order 27 with maximum period 2^27-1 which was found using Field Programmable Gate Arrays (FPGA), a searching method. Modified RC4A algorithm is the modification of RC4A and is modified by introducing non-linear rotation operator in the Key Scheduling Algorithm (KSA) of RC4A cipher. Analysis of occlusion attack (up to 62.5% pixels), noise (salt and pepper, Poisson) attack and key sensitivity are performed to assess the concreteness of the proposed method. Also, some statistical and security analyses are evaluated on various images of different size to empirically assess the robustness of the proposed scheme.

• Journal of information and communication convergence engineering
• /
• v.13 no.1
• /
• pp.62-68
• /
• 2015

In this paper, we propose a watermarking method for protecting the ownership of three-dimensional (3D) content generated from depth and texture images. After selecting the target areas to preserve the watermark by depth-image-based rendering, the reference viewpoint image is moved right and left in the depth map until the maximum viewpoint change is obtained and the overlapped region is generated for marking space. The region is divided into four subparts and scanned. After applying discrete cosine transform, the watermarks are inserted. To extract the watermark, the viewpoint can be changed by referring to the viewpoint image and the corresponding depth image initially, before returning to the original viewpoint. The watermark embedding and extracting algorithm are based on quantization. The watermarked image is attacked by the methods of JPEG compression, blurring, sharpening, and salt-pepper noise.

• Journal of Information Display
• /
• v.5 no.3
• /
• pp.1-7
• /
• 2004

We developed a novel frame interpolation method to interpolate a frame between two successive original frames. Using this method, we are able to apply a double-rate driving method instead of an impulse driving method where a black frame is inserted between two successive original frames. The double-rate driving method enables amelioration of the motion blur of LCDs caused by the characteristics of human vision without reducing the luminosity of the whole screen. The image quality of the double-rate driving method was also found to be better than that of an impulse driving method using our motion picture simulator and an actual panel. Our initial model of our frame interpolation method consists of motion estimation with a maximum matching pixel count estimation function, an area segmentation technique, and motion compensation with variable segmentation threshold. Although salt and pepper noise remained in a portion of an object mainly due to inaccuracy of motion estimation, we verified the validity of our method and the possibility of improvement in hold-type motion blurring.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.765-778
• /
• 2016

In watermarking schemes, the discrete wavelet transform (DWT) is broadly used because its frequency component separation is very useful. Moreover, LU decomposition has little influence on the visual quality of the watermark. Hence, in this paper, a novel blind watermark algorithm is presented based on LU transform and DWT for the copyright protection of digital images. In this algorithm, the color host image is first performed with DWT. Then, the horizontal and vertical diagonal high frequency components are extracted from the wavelet domain, and the sub-images are divided into $4{\times}4$ non-overlapping image blocks. Next, each sub-block is performed with LU decomposition. Finally, the color image watermark is transformed by Arnold permutation, and then it is inserted into the upper triangular matrix. The experimental results imply that this algorithm has good features of invisibility and it is robust against different attacks to a certain degree, such as contrast adjustment, JPEG compression, salt and pepper noise, cropping, and Gaussian noise.