• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.3
• /
• pp.229-234
• /
• 2018

Texture is one of the most useful features in classifying and segmenting images. The LBP-based approach previously presented in the literature has been successful in many applications. However, it's theoretical foundation is based only on the difference of pixel values, and consequently it has a number of drawbacks like it performs poorly for the images corrupted with noise, and especially it cannot be used as a multiscale texture descriptor due to the exploding increase of feature vector dimension with increase of the number of neighbor pixels. In this paper, we present a method to address these drawbacks of LBP-based approach. More specifically, our approach quantizes the range of pixels values and construct a 3D histogram which captures the correlative information of pixels. This histogram is used as a texture feature. Several tests with texture images show that the proposed method outperforms the LBP-based approach in the problem of texture classification.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.712-719
• /
• 2008

Temporal error concealment indicates the algorithm that restores the lost video data using temporal correlation between previous frame and current frame with lost data. It can be categorized into the methods of block-based and pixel-based concealment. The proposed method in this paper is for pixel-based temporal error concealment using affine transform. It outperforms especially when the object or background in lost block has geometric transform which can be modeled using affine transform, that is, rotation, magnification, reduction, etc. Furthermore, in order to maintain good performance even though one or more motion vector represents the motion of different objects, we defines a cost function. According to cost from the cost function, the proposed method adopts affine error concealment adaptively. Simulation results show that the proposed method yields better performance up to 1.9 dB than the method embedded in reference software of H.264/AVC.

• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.2
• /
• pp.69-78
• /
• 2010

The hydrological-geomorphic character is closely related with runoff in basin. A development of GIS greatly helps investigating about mechanism between theirs. We analyze local slope and hillslope length which are related with hydrological response. But variation of these geomorphic variables has very wide range at each pixel. So there's a limit as to use directly. Therefore we investigate a relation between hydrological response and distributed geomorphic variables according to statistical character of distributed map considering spatial correlation. As a result, the local slope affects peak discharge, and the hillslope length affects peak discharge and time, mean and variance of hydrological response. Henceforth these hydrological-geomorphic analyze methods can be improved that hydrology response is directly analogized with DEM data.

• Journal of Computing Science and Engineering
• /
• v.8 no.4
• /
• pp.187-198
• /
• 2014

In this paper an efficient image encryption scheme based on cyclic rotations and multiple blockwise diffusions with two chaotic maps is proposed. A Sin map is used to generate round keys for the encryption/decryption process. A Pomeau-Manneville map is used to generate chaotic values for permutation, pixel value rotation and diffusion operations. The encryption scheme is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage performs four operations on the image: row shuffling, column shuffling, cyclic rotation of all the rows and cyclic rotation of all the columns. This stage reduces the correlation significantly among neighboring pixels. The second stage performs circular rotation of pixel values twice by scanning the image horizontally and vertically. The amount of rotation is based on $M{\times}N$ chaotic values. The last stage performs the diffusion four times by scanning the image in four different ways: block of $8{\times}8$ pixels, block of $16{\times}16$ pixels, principal diagonally, and secondary diagonally. Each of the above four diffusions performs the diffusion in two directions (forwards and backwards) with two previously diffused pixels and two chaotic values. This stage makes the scheme resistant to differential attacks. The security and performance of the proposed method is analyzed systematically by using the key space, entropy, statistical, differential and performance analysis. The experimental results confirm that the proposed method is computationally efficient with high security.

• Korean Chemical Engineering Research
• /
• v.47 no.2
• /
• pp.179-184
• /
• 2009

Recent evolution of computer technology enhances the effectiveness of CFD(Computational Fluid Dynamics) analysis for the 3-dimensional complex transport phenomena including turbulent flows. Cheaper and easier than laser and ultra-sonic methods, the windows simulator name by CAMSI(Computer-Aided Management of Stereo Images) has been developed in order to implement the 3-dimensional image using a disparity histogram extracted from left and right stereo images. In our program using the area-based method, the matching pixel finding methods consist of SSD(Sum of Squared Distance), SAD(Sum of Absolute Distance), NCC(Normalized Correlation Coefficient) and MPC(Matching Pixel Count). On performing the program, stereo images on different window sizes for various matching pixel finding methods are compared reasonably. When the image has a small noise, SSD on small window size is more effective. Whereas there is much noise, NCC or MPC is more effective than SSD. CAMSI from the present study will be much helpful to implement the complex objects and to analyze 3-dimensional CFD around them.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.2
• /
• pp.35-45
• /
• 2024

In this paper, we propose an intra prediction method for depth picture using CNN and Attention mechanism. The proposed method allows each pixel in a block to predict to select pixels among reference area. Spatial features in the vertical and horizontal directions for reference pixels are extracted from the top and left areas adjacent to the block, respectively, through a CNN layer. The two spatial features are merged into the feature direction and the spatial direction to predict features for the prediction block and reference pixels, respectively. the correlation between the prediction block and the reference pixel is predicted through attention mechanism. The predicted correlations are restored to the pixel domain through CNN layers to predict the pixels in the block. The average prediction error of intra prediction is reduced by 5.8% when the proposed method is added to VVC intra modes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.477-481
• /
• 2007

A background is a part where do not vary too much or frequently change in an image sequence. Using this assumption, it is presented a background acquisition algorithm for not only static but also dynamic view in this paper. For generating background, we detect a region, where has high correlation rate compared within selected region in the prior pyramid image, from the searching region in the current image. Between a detected region in the current image and a selected region in the prior image, we calculate movement vector for each regions in time sequence. After we calculate whole movement vectors for two successive images, vector histogram is used to determine the camera movement. The vector which has the highest density in the histogram is determined a camera movement. Using determined camera movement, we classify clusters based on pixel intensities which pixels are matched with prior pixels following camera movement. Finally we eliminate clusters which have lower weight than threshold, and combine remained clusters for each pixel to generate multiple background clusters. Experimental results show that we can automatically detect background whether camera move or not.

• Journal of Astronomy and Space Sciences
• /
• v.19 no.1
• /
• pp.39-46
• /
• 2002

BV observations for V523 Cas were performed with 1.8m telescope and 2K CCD camera at Bohyunsan Optical Astronomy Observatory, Korea, on October 27, 1999. ${\Delta}m$ light curves for 11 comparison objects were made. It was found that their light curve slopes are different each other. Factor analysis for items of slope, (b-v) , magnitude, X pixel, and Y pixel results that there is strong correlation between the slope and the location (X,Y). It might be due to problems of CCD cooling system.

• International Journal of Contents
• /
• v.11 no.4
• /
• pp.56-69
• /
• 2015

This paper proposes an efficient image encryption scheme based on quintuple encryption using two chaotic maps. The encryption process is realized with quintuple encryption by calling the encrypt(E) and decrypt(D) functions five times with five different keys in the form EDEEE. The decryption process is accomplished in the reverse direction by invoking the encrypt and decrypt functions in the form DDDED. The keys for the quintuple encryption/decryption processes are generated by using a Tent map. The chaotic values for the encrypt/decrypt operations are generated by using a Gumowski-Mira map. The encrypt function E is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage scrambles all the rows and columns to chaotically generated positions. This stage reduces the correlation radically among the neighboring pixels. The pixel value rotation stage circularly rotates all the pixels either left or right, and the amount of rotation is based on chaotic values. The last stage performs the diffusion four times by scanning the image in four different directions: Horizontally, Vertically, Principal diagonally and Secondary diagonally. Each of the four diffusion steps performs the diffusion in two directions (forward and backward) with two previously diffused pixels and two chaotic values. This stage ensures the resistance against the differential attacks. The security and performance of the proposed method is investigated thoroughly by using key space, statistical, differential, entropy and performance analysis. The experimental results confirm that the proposed scheme is computationally fast with security intact.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.21-30
• /
• 2009

In low bit-rate video transmission, the payload of a single packet can often contain a whole coded frame due to the high compression ratio in both spatial and temporal domains of most modern video coders. Thus, the loss of a single packet not only causes the loss of a whole frame, but also produces error propagation into subsequent frames. In this paper, we propose a novel whole frame error concealment algorithm which reconstructs the first of the subsequent frames instead of the current lost frame to suppress the effects of error propagation. In the proposed algorithm, we impose a constraint which uses side match distortion (SMD) and overlapped region difference (ORD) to estimate motion vectors between the target reconstructed frame and its reference frame. SMD measures the spatial smoothness connection between a block and its neighboring blocks. ORD is defined as the difference between the correlated pixels which are predicted from one reference pixel. Experimental results show that the proposed algorithm effectively suppresses error propagation and significantly outperforms other conventional techniques in terms of both peak signal-to-noise ratio performance and subjective visual quality.