• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.292-300
• /
• 2008

An algorithm for detecting a line segment in an image is presented using incremental pixel extension. We use a different approach from conventional algorithms, such as the Hough transform approach and the line segment grouping approach. The Canny edge is calculated and an arbitrary point is selected among the edge elements. After the arbitrary point is selected, a base line approximating the line segment is calculated and edge pixels within an arbitrary radius are selected. A weighted value is assigned to each edge pixel, which is selected by using the error of the distance and the direction between the pixel and the base line. A line segment is extracted by Jilting a line using the weighted least square method after determining whether selected pixels are linked or delinked using the sum comparison of the weights. The proposed algorithm is compared with two other methods and results show that our algorithm is faster and can detect the real line segment.

• Korean Journal of Agricultural Science
• /
• v.42 no.4
• /
• pp.447-453
• /
• 2015

Increase of national family income improved demand of high-quality and year-round horticultural products including chrysanthemum. To meet these demand, farmers have introduced protected facilities, such as greenhouses, of which environmental conditions could be monitored and controlled. Environment management up to three weeks after transplanting is critical for chrysanthemum quality. Artificial lighting and light-blocking screen are especially important for long-day (day period > 13 hours) and short-day (night period > 13 hours) treatments. In this study, a web-camera was installed, and the image was obtained and transmitted to mobile phones to monitor the status of 3-wavelength(RGB) lighting environments. RGB pixel values were used to determine malfunctioning of the lighting lamps, and leaking out and incoming illumination status during short-day and long-day treatment periods. Normal lighting lamps provided RGB pixel values of 240~255. During long-day treatment period, G pixel values were useful to detect abnormal lighting conditions (e.g., leaking). During short-day treatment period, R pixel values were useful to determine incoming light (e.g., sun-light). Results of this study would provide useful information for remote monitoring of light conditions for protected chrysanthemum production under artificial lights.

• Journal of the Korean Society of Radiology
• /
• v.16 no.2
• /
• pp.151-156
• /
• 2022

A detector using a small number of photosensors was designed, and the position of a scintillation pixel that interacted with gamma rays through a maximum likelihood position estimation(MLPE) was measured as a digital position. For this purpose, simulation was performed using DETECT2000, which can simulate the movement of light within the scintillator, and the accuracy of position measurement was evaluated. A detector was configured using a 6 × 6 scintillation pixel array and 4 photosensors, and a gamma ray event was generated at the center of each scintillation pixel to create a look-up table through the ratio of acquired light. The gamma-ray event generated at the new position was applied as the input value of the MLPE, and the positiion of the scintillation pixel was converted into a digital positiion after comparison with the look-up table. All scintillation pixels were evaluated, and as a result, a high accuracy of 99.1% was obtained. When this method is applied to the currently usesd system, it is concidered that the process of determining the position of the scintillation pixel will be simplified.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.79-84
• /
• 2015

In a distribution of digital image, there is a serious problem that is a distribution of the altered image by a forger. For the problem solution, this paper proposes a median filtering (MF) image forensic decision algorithm using a feature vector according to the pixel value's gradients. In the proposed algorithm, AR (Autoregressive) coefficients are computed from pixel value' gradients of original image then 1th~6th order coefficients to be six feature vector. And the reconstructed image is produced by the solution of Poisson's equation with the gradients. From the difference image between original and its reconstructed image, four feature vector (Average value, Max. value and the coordinate i,j of Max. value) is extracted. Subsequently, Two kinds of the feature vector combined to 10 Dim. feature vector that is used in the learning of a SVM (Support Vector Machine) classification for MF (Median Filtering) detector of the altered image. On the proposed algorithm of the median filtering detection, compare to MFR (Median Filter Residual) scheme that had the same 10 Dim. feature vectors, the performance is excellent at Unaltered, Averaging filtering ($3{\times}3$) and JPEG (QF=90) images, and less at Gaussian filtering ($3{\times}3$) image. However, in the measured performances of all items, AUC (Area Under Curve) by the sensitivity and 1-specificity is approached to 1. Thus, it is confirmed that the grade evaluation of the proposed algorithm is 'Excellent (A)'.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1399-1404
• /
• 2004

The development of computer technology and the advancement of the technology of information and communications spread the technology of multimedia and increased the use of multimedia data with large capacity. Users can grasp the overall video data and they are able to play wanted video back. To grasp the overall video data it is necessary to offer the list of summarized video data information. In order to search video efficiently an index process of video data is essential and it is also indispensable skill. Therefore, this thesis suggested the effective method about the cut detection of frames which will become a basis of an index based on contents of video image data. This suggested method was detected as the unchanging pixel rotor intelligence value, classified into diagonal direction. Pixel value of color detected in each frame of video data is stored as A(i, i) matrix - i is the number of frames, i is an image height of frame. By using the stored pixel value as the method of UE(Mean Square Error) I calculated a specified value difference between frames and detected cut quickly and exactly in case it is bigger than threshold value set in advance. To carry out an experiment on the cut detection of lames comprehensively, 1 experimented on many kinds of video, analyzing and comparing efficiency of the cut detection system.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.425-428
• /
• 2000

2차원 슬라이스 영상으로부터 volume rendered 이미지를 생성하기 위해서는 2차원 영상의 pixel 데이터를 voxel 기반으로 재구성해야 한다. 영상을 재구성하면서 생성되는 voxel value 는 3차원 영상을 2차원 화면으로 원근 투영할 때 최종 픽셀값을 결정하는 기본 요소가 된다. 따라서 본 논문에서는 조합되는 voxel value를 결정하는 Transfer Function를 이용한 intensity 와 gradient magnitude 의조작을 통하여 최종 3차원 이미지에서 오브젝트의 surface 뿐만 아니라 내부의 서로 다른 조직끼리의 경계 영역을 가시화하여 보았다.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1807-1810
• /
• 2003

Steganography based on Just Noticeable Difference(JND) has been used for natural images. However, it has been recognized to have defects for the non-natural images such as scanned text images, cartoons, etc. In this paper, an alternative method is proposed to improve this problem. A new scheme is designed specially for the non-natural images. Instead of JND, Noise Visibility Function(NVF) is used. NVF value and edge strength value of each pixel ate combined to decide the embedding data capacity and the visibility of data embedded images have been improved specially for the non-natural images.

• Proceedings of the KSR Conference
• /
• 2002.10a
• /
• pp.566-573
• /
• 2002

In this paper, is propose to the object(human) dection method using geometrical structures and projection histograms in the image. The problem of existing methods for objects tracking of background subtracted is resulted from uncertainty at background unfixed. In this paper, two methods are applied to solve problem. This problems are proved by method. This problems is demonstrated by using this methods and applied to the train railroad crossing. Therefore, this paper aims that this contributes to improve the accident of the train railroad crossing.

• The Journal of the Korea Contents Association
• /
• v.9 no.4
• /
• pp.189-197
• /
• 2009

A digital image usually has 8 bits of depth basically representing pixel intensity ranging for [0 255]. These pixel range allow 256 step levels of pixel values in the image. Thus the greyscale value for a given image is an integer. When we carry out interpolation of a given image for resizing we have to round the interpolated value to integer which can result in loss of quality on perceived color values. This paper proposes a new method for recovering this loss of information during interpolation process. By using the proposed method the pixels tend to regain more original values which yields better looking images on resizing.

• 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.