• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.5
• /
• pp.375-382
• /
• 2016

In this paper, we presents a signatures verification by using the nonlinear quantization histogram of polar coordinate based on multi-dimensional adjacent pixel intensity difference. The multi-dimensional adjacent pixel intensity difference is calculated from an intensity difference between a pair of pixels in a horizontal, vertical, diagonal, and opposite diagonal directions centering around the reference pixel. The polar coordinate is converted from the rectangular coordinate by making a pair of horizontal and vertical difference, and diagonal and opposite diagonal difference, respectively. The nonlinear quantization histogram is also calculated from nonuniformly quantizing the polar coordinate value by using the Lloyd algorithm, which is the recursive method. The polar coordinate histogram of 4-directional intensity difference is applied not only for more considering the corelation between pixels but also for reducing the calculation load by decreasing the number of histogram. The nonlinear quantization is also applied not only to still more reflect an attribute of intensity variations between pixels but also to obtain the low level histogram. The proposed method has been applied to verified 90(3 persons * 30 signatures/person) images of 256*256 pixels based on a matching measures of city-block, Euclidean, ordinal value, and normalized cross-correlation coefficient. The experimental results show that the proposed method has a superior to the linear quantization histogram, and Euclidean distance is also the optimal matching measure.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2017.04a
• /
• pp.157-157
• /
• 2017

To minimize the damage by wild birds and acquire the benefits such as protection against weeds and maintenance of water content in soil, the mulching black color vinyl after seeding should be carried out. Non-contact and non-destructive methods that can continuously determine the locations are necessary. In this study, a crop position detection method was studied that uses infrared thermal image sensor to determine the cotyledon position under vinyl mulch. The moving system for acquiring image arrays has been developed for continuously detecting crop locations under plastic mulching on the field. A sliding mechanical device was developed to move the sensor, which were arranged in the form of a linear array, perpendicular to the array using a micro-controller integrated with a stepping motor. The experiments were conducted while moving 4.00 cm/s speed of the IR sensor by the rotational speed of the stepping motor based on a digital pulse width modulation signal from the micro-controller. The acquired images were calibrated with the spatial image correlation. The collected data were processed using moving averaging on interpolation to determine the frame where the variance was the smallest in resolution units of 1.02 cm. Non-linear integral interpolation was one of method for analyzing the frequency using the normalization image and then arbitrarily increasing the limited data value of $16{\times}4pixels$ in one frame. It was a method to relatively reduce the size of overlapping pixels by arbitrarily increasing the limited data value. The splitted frames into 0.1 units instead of 1 pixel can propose more than 10 times more accurate and original method than the existing correction method. The non-integral calibration method was conducted by applying the subdivision method to the pixels to find the optimal correction resolution based on the first reversed frequency. In order to find a correct resolution, the expected location of the first crop was indicated on near pixel 4 in the inversion frequency. For the most optimized resolution, the pixel was divided by 0.4 pixel instead of one pixel to find out where the lowest frequency exists.

• Communications for Statistical Applications and Methods
• /
• v.6 no.3
• /
• pp.893-900
• /
• 1999

We use statistical tests which are useful for two-sample problem for detecting edges in gray-level images. An edge is detected by examining changes in gray-level value between adjacent pixel neighborhoods. Some experimental results show that nonparametric detectors such as Mann-Whitney test median test and Kolmogorov-Smirnov test perform effectively in both noisy and noise-free images while parametric T test is sensitive to noise.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2530-2538
• /
• 2015

The pixel value of depth image is depth value so that different objects which are placed on nearby position have similar pixel value. Moreover, the pixels of depth image have distinct pixel values compared to adjacent pixels while those of color image has very similar values. Accordingly distorted depth image of multiview video plus depth (MVD) needs proper error concealment methods considering the characteristics of depth image when transmission errors are happened. In this paper, classifying regions of depth image to consider edge directions and then applying adaptive error concealment methods to each region are proposed. Recovered depth images utilize with multiview video data to synthesize intermediate-view point video. The synthesized view is evaluated by objective quality metrics to demonstrate proposed method performance.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.357-362
• /
• 2005

Iris recognition system is the one of the most reliable biometries recognition system. An algorithm is proposed to determine the localized iris from the iris image received from iris input camera in client. For the first step, the algorithm determines the center of pupil. For the second step, the algorithm determines the outer boundary of the iris and the pupillary boundary. The localized iris area is transformed into polar coordinates. After performing three times Wavelet transformation, normalization was done using a sigmoid function. The converting binary process performs normalized value of pixel from 0 to 255 to be binary value, and then the converting binary process is compared pairs of two adjacent pixels. The binary code of the iris is transmitted to the server by the network. In the server, the comparing process compares the binary value of presented iris to the reference value in the database. The process of recognition or rejection is dependent on the value of Hamming Distance. After matching the binary value of presented iris with the database stored in the server, the result is transmitted to the client.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.17 no.1
• /
• pp.17-24
• /
• 2024

In this paper, we propose a highly secure technique to hide confidential data in image pixels using a quadruple encryption techniques. In the proposed technique, the boundary surface where the image outline exists and the flat surface with little change in pixel values are investigated. At the boundary of the image, in order to preserve the characteristics of the boundary, one bit of confidential data that has been multiply encrypted is spatially encrypted again in the LSB of the pixel located at the boundary to hide the confidential data. At the boundary of an image, in order to preserve the characteristics of the boundary, one bit of confidential data that is multiplely encrypted is hidden in the LSB of the pixel located at the boundary by spatially encrypting it. In pixels that are not on the border of the image but on a flat surface with little change in pixel value, 2-bit confidential data that is multiply encrypted is hidden in the lower 2 bits of the pixel using location-based encryption and spatial encryption techniques. When applying the proposed technique to hide confidential data, the image quality of the stego-image is up to 49.64dB, and the amount of confidential data hidden increases by up to 92.2% compared to the existing LSB method. Without an encryption key, the encrypted confidential data hidden in the stego-image cannot be extracted, and even if extracted, it cannot be decrypted, so the security of the confidential data hidden in the stego-image is maintained very strongly. The proposed technique can be effectively used to hide copyright information in general commercial images such as webtoons that do not require the use of reversible data hiding techniques.

• The KIPS Transactions:PartB
• /
• v.13B no.3 s.106
• /
• pp.197-204
• /
• 2006

Recent advances in information technology have resulted in rapid growth in the mobile communication. With this explosive growth, reliable transmission and error concealment technique become increasingly important to offer high quality multimedia services. In this paper, we propose an improved BMA(Boundary Matching Algorithm) method using gradient vectors to conceal channel errors in inter-frames of H.264 video images. General BMA method computes the sum of pixel differences of adjacent pixels of the candidate block and its neighbouring blocks, assuming that adjacent pixels have almost the same value. In real images, however, there exist some gradients, which means that the pixel values are increasing or decreasing in a specific direction. In this paper, we develop a precise estimation method of errors in candidates blocks using gradient information and try to recover lost blocks with this technique. Experimental results show the improvement of picture quality about $1{\sim}3dB$ compared to existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.360-373
• /
• 2017

This paper presents a novel digital video steganalysis scheme against the spatial domain video steganography technology based on a spatial temporal detector (ST_D) that considers both spatial and temporal redundancies of the video sequences simultaneously. Three descriptors are constructed on XY, XT and YT planes respectively to depict the spatial and temporal relationship between the current pixel and its adjacent pixels. Considering the impact of local motion intensity and texture complexity on the histogram distribution of three descriptors, each frame is segmented into non-overlapped blocks that are $8{\times}8$ in size for motion and texture analysis. Subsequently, texture and motion factors are introduced to provide reasonable weights for histograms of the three descriptors of each block. After further weighted modulation, the statistics of the histograms of the three descriptors are concatenated into a single value to build the global description of ST_D. The experimental results demonstrate the great advantage of our features relative to those of the rich model (RM), the subtractive pixel adjacency model (SPAM) and subtractive prediction error adjacency matrix (SPEAM), especially for compressed videos, which constitute most Internet videos.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.17 no.6
• /
• pp.622-632
• /
• 2004

We have studied how liquid crystal's rubbing direction and voltage driving method affect generation of disclination line. At first, generation of disclination line in vertical alignment(VA) cell and VA-twisted nematic(TN) cell has been examined. When liquid crystal's rubbing direction of bottom substrate was 0$^{\circ}$, the degree of generated disclination line was the smallest value. Further, the generation of disclination line above the electrode is less in the frame inversion than in the line inversion. Secondly, we have examined a generation of disclination line in reflective fringe-field switching cell. When the distance between common electrodes is over 3 ${\mu}{\textrm}{m}$ with on-state of one pixel and off-state of neighboring pixels, the reflectance appears only on-state pixel without generating reflectance in adjacent pixels.

• Journal of information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.201-206
• /
• 2011

FRUC (Frame Rate Up-Conversion) technique needs an effective frame interpolation algorithm using motion information between adjacent neighboring frames. In order to have good visual qualities in the interpolated frames, it is necessary to develop an effective detection and interpolation algorithms for occluded regions. For this aim, this paper proposes an effective occluded region detection algorithm through the adaptive forward and backward motion searches and also by introducing the minimum value of normalized cross-correlation coefficient (NCCC). That is, the proposed scheme looks for the location with the minimum sum of absolute differences (SAD) and this value is compared to that of the location with the maximum value of NCCC based on the statistics of those relations. And, these results are compared with the size of motion vector and then the proposed algorithm decides whether the given block is the occluded region or not. Furthermore, once the occluded regions are classified, then this paper proposes an adaptive interpolation algorithm for occluded regions, which still exist in the merged frame, by using the neighboring pixel information and the available data in the occluded block. Computer simulations show that the proposed algorithm can effectively classify the occluded region, compared to the conventional SAD-based method and the performance of the proposed interpolation algorithm has better PSNR than the conventional algorithms.