• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.5
• /
• pp.266-276
• /
• 2013

LSB-based steganography is a simple and well known information hiding technique. In most LSB based techniques, a secret message is embedded into a specific position of LSB in the cover pixels. On the other hand, the main threat of LSB-based steganography is steganalysis. This paper proposes an asynchronous-cellular-automata(ACA)-based steganographic method, where secret bits are embedded into the selected position inside the cover pixel by ACA rule 51 and a secret key. As a result, it is very difficult for malicious users to retrieve a secret message from a cover image without knowing the secret key, even if the extraction algorithm is known. In addition, another layer of security is provided by almost random (rule-based) selection of a cover pixel for embedding using ACA and a different secret key. Finally, the experimental results show that the proposed method can be secured against the well-known steganalysis RS-attack.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.965-970
• /
• 2013

It is important work to extract saliency regions from an image as preprocessing for various image processing methods. In this paper, we introduce an improved method to estimate saliency value of each pixel from an image. The proposed method is an improved work of the previously studied method using color and statistical framework to estimate saliency values. At first, saliency value of each pixel is calculated using the local contrast of an image region at various scales and the most significant saliency pixel is determined using saliency value of each pixel. Then, saliency value of each pixel is again estimated using gauss weight with respect to the most significant saliency pixel and the saliency of each pixel is determined to calculate initial probability. At last, the saliency value of each pixel is calculated by Bayes' rule. The experiments show that our approach outperforms the current statistical based method.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.9 no.3
• /
• pp.146-155
• /
• 2006

A handful of previous studies have attempted to integrate socioeconomic data and remotely sensed data for urban quality of life assessment with their spatial dimension in a zonal unit. However, such a zone-based approach not only has the unrealistic assumption that all attributes of a zone are uniformly spatially distributed throughout the zone, but also has resulted in serious methodological difficulties such as the modifiable areal unit problem and the incompatibility problem with environmental data. An alternative to the zone-based approach can be a pixel-based approach which gets its spatial dimension through a pixel. This paper proposes a pixel-based approach to linking remotely sensed data with socioeconomic data in GIS for urban quality of life assessment. The pixel-based approach uses dasymetric mapping and spatial interpolation to spatially disaggregate socioeconomic data and integrates remotely sensed data with spatially disaggregated socioeconomic data for the quality of life assessment. This approach was implemented and compared with a zone-based approach using a case study of Fulton County, Georgia. Results indicate that the pixel-based approach allows for the calculation of a microscale indicator in the urban quality of life assessment and facilitates efficient data integration and visualization in the assessment although it costs an intermediate step with more processing time such as the disaggregation of zonal data. The results also demonstrate that the pixel-based approach opens up the potential for the development of new database and increased analytical capabilities in urban analysis.

• Korean Journal of Cognitive Science
• /
• v.9 no.1
• /
• pp.1-11
• /
• 1998

In this paper, the features which are thought to be used by humans based on the psychological experiment of human information processing are applied to character recognition problem. Man will deal with a little large area information as well as pixel by pixel information. Therefore we define the feature that represents a little wide region I information called region feature, and combine the features derived from region feature and pixel by pixel features that have been used by now. The features we used are the result of region feature based preanalysis, mesh with region attributes, cross distance difference and gradient. The training and test data in the experiment are handwritten Korean alphabets, digits and English alphabets, which are trained on neural network using back propagation algorithm and recognition results are 90.27-93.25%, 98.00% and 79.73-85.75%, respectively Experimental results show that the feature we are suggesting in this paper is 1-2% better than UDLRH feature similar in attribute to region feature, and the tendency of misrecognition is more easily acceptable by humans.

• Journal of the Institute of Convergence Signal Processing
• /
• v.23 no.1
• /
• pp.44-49
• /
• 2022

Abstract Recently, with the development of IoT technology and communication media, various video equipment is being used in industrial fields. Image data acquired from cameras and sensors are easily affected by noise during transmission and reception, and noise removal is essential as it greatly affects system reliability. In this paper, we propose a weight filter algorithm based on the pixel value distribution pattern to preserve details in the process of restoring images damaged in AWGN. The proposed algorithm calculates weights according to the pixel value distribution pattern of the image and restores the image by applying a filtering mask. In order to analyze the noise removal performance of the proposed algorithm, it was simulated using enlarged image and PSNR compared to the existing method. The proposed algorithm preserves important characteristics of the image and shows the performance of efficiently removing noise compared to the existing method.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.187-193
• /
• 2021

In this paper, we propose an image watermarking technique that effectively hides confidential data in the LSB of image pixels by utilizing the characteristics of the image. In the proposed technique, the image is precisely divided into boundary surface and normal region other than the boundary surface and performs different processing. The boundary surface existing in the image is created by meeting different regions and contains important information of the image. One bit of confidential data is concealed in the LSB of the pixel at the boundary surface to preserve the characteristics of the boundary surface. In normal region other than the boundary surface, the pixel values are similar, and the change with the adjacent pixel values is smooth. Based on this property, even if the 2 bits of confidential data are hidden in the lower 2 bits of the pixel in the normal region, the difference cannot be visually distinguished. When confidential data is concealed in an image as described above, the amount of confidential data concealed in an image can be increased while maintaining excellent image quality. Concealing confidential data by applying the proposed method increases the amount of confidential data concealed by up to 84.6% compared to the existing method. The proposed technique can be effectively used for commercial image watermarking that hides copyright information.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.149-156
• /
• 2011

This paper proposes the effective edge selection algorithm for the rapid processing time and low memory usage of efficient graph-based image segmentation on mobile device. The graph-based image segmentation algorithm is to extract objects from a single image. The objects are consisting of graph edges, which are created by information of each image's pixel. The edge of graph is created by the difference of color intensity between the pixel and neighborhood pixels. The object regions are found by connecting the edges, based on color intensity and threshold value. Therefore, the number of edges decides on the processing time and amount of memory usage of graph-based image segmentation. Comparing to personal computer, the mobile device has many limitations such as processor speed and amount of memory. Additionally, the response time of application is an issue of mobile device programming. The image processing on mobile device should offer the reasonable response time, so that, the image segmentation processing on mobile should provide with the rapid processing time and low memory usage. In this paper, we demonstrate the performance of the effective edge selection algorithm, which effectively controls the edges of graph for the rapid processing time and low memory usage of graph-based image segmentation on mobile device.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.61-70
• /
• 2023

Image segmentation is a very crucial step in effective digital image processing. In the past decade, several research contributions were given related to this field. However, a general segmentation algorithm suitable for various applications is still challenging. Among several image segmentation approaches, graph-based approach has gained popularity due to its basic ability which reflects global image properties. This paper proposes a methodology to partition the image with its pixel, region and texture along with its intensity. To make segmentation faster in large images, it is processed in parallel among several CPUs. A way to achieve this is to split images into tiles that are independently processed. However, regions overlapping the tile border are split or lost when the minimum size requirements of the segmentation algorithm are not met. Here the contributions are made to segment the image on the basis of its pixel using min-cut/max-flow algorithm along with edge-based segmentation of the image. To segment on the basis of the region using a homogenous optimum cut algorithm with boundary segmentation. On the basis of texture, the object type using spectral partitioning technique is identified which also minimizes the graph cut value.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.3
• /
• pp.202-208
• /
• 2013

In the image processing for VS (Video Surveillance), the detection of moving entities in a monitored scene is an important step. A background subtraction technique has been widely employed to find the moving entities. However, the extracted foreground regions often include not only real entities but also their cast shadows, and this can cause errors in following image processing steps, such as tracking, recognition, and analysis. In this paper, a novel technique is proposed to determine the shadow pixels of moving objects in the foreground image of a VS camera. Compared to existing techniques where the same decision criteria are applied to all moving pixels, the proposed technique determines shadow pixels using local features based on two facts: First, the amount of pixel intensity drop due to a shadow depends on the intensity level of background. Second, the distribution pattern of pixel intensities remains even if a shadow is cast. The proposed method has been tested at various situations with different backgrounds and moving humans in different colors.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.4
• /
• pp.253-261
• /
• 2017

In this paper, a corner detection method based on a new non-cornerness measure is presented. Rather than evaluating local gradients or surface curvatures, as done in previous approaches, a non-cornerness function is developed that can identify stable corners by testing an image region against a set of desirable corner criteria. The non-cornerness function is comprised of two steps: 1) eliminate any pixel located in a flat region and 2) remove any pixel that is positioned along an edge in any orientation. A pixel that passes the non-cornerness test is considered a reliable corner. The proposed method also adopts the idea of non-maximum suppression to remove multiple corners from the results of the non-cornerness function. The proposed method is compared with previous popular methods and is tested with an artificial test image covering several corner forms and three real-world images that are universally used by the community to evaluate the accuracy of corner detectors. The experimental results show that the proposed method outperforms previous corner detectors with respect to accuracy, and that it is suitable for real-time processing.