• Korean Journal of Remote Sensing
• /
• v.22 no.6
• /
• pp.601-612
• /
• 2006

This study proposes RAG (Region Adjancency Graph)-based image segmentation for large imagery in remote sensing. The proposed algorithm uses CN-chain linking for computational efficiency and multi-window operation of sliding structure for memory efficiency. Region-merging due to RAG is a process to find an edge of the best merge and update the graph according to the merge. The CN-chain linking constructs a chain of the closest neighbors and finds the edge for merging two adjacent regions. It makes the computation time increase as much as an exact multiple in the increasement of image size. An RNV (Regional Neighbor Vector) is used to update the RAG according to the change in image configuration due to merging at each step. The analysis of large images requires an enormous amount of computational memory. The proposed sliding multi-window operation with horizontal structure considerably the memory capacity required for the analysis and then make it possible to apply the RAG-based segmentation for very large images. In this study, the proposed algorithm has been extensively evaluated using simulated images and the results have shown its potentiality for the application of remotely-sensed imagery.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.6
• /
• pp.107-112
• /
• 2022

In an embedded system such as a drone, it is difficult to store, transfer and analyze the entire hyper-spectral image to a server in real time because it takes a lot of power and time. Therefore, the hyper-spectral image data is transmitted to the server through dimension reduction or compression pre-processing. Feature selection method are used to send only the bands for analysis purpose, and these algorithms usually take a lot of processing time depending on the size of the image, even though the efficiency is high. In this paper, by improving the temporal disadvantage of the band selection algorithm, the time taken 24 hours was reduced to around 60-180 seconds based on the 40000*682 image resolution of 8GB data, and the use of 7.6GB RAM was significantly reduced to 2.3GB using 45 out of 150 bands. However, in terms of pixel classification performance, more than 98% of analysis results were derived similarly to the previous one.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.103-108
• /
• 2022

In this paper, we propose a new image analysis method based on regression manifold 3-D PCA. The proposed method is a new image analysis method consisting of a regression analysis algorithm with a structure designed based on an autoencoder capable of nonlinear expansion of manifold 3-D PCA and PCA for efficient dimension reduction when entering large-capacity image data. With the configuration of an autoencoder, a regression manifold 3-DPCA, which derives the best hyperplane through three-dimensional rotation of image pixel values, and a Bayesian rule structure similar to a deep learning structure, are applied. Experiments are performed to verify performance. The image is improved by utilizing the fine dust image, and accuracy performance evaluation is performed through the classification model. As a result, it can be confirmed that it is effective for deep learning performance.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.4
• /
• pp.145-155
• /
• 2015

Noise reduction has been actively studied in the digital image processing and recently, block-based denoising algorithms are widely used. In particular, a low rank approximation employing WNNM(Weighted Nuclear Norm Minimization) and block-based approaches demonstrated the potential for effective noise reduction. However, the algorithm based on low rank a approximation generates the artifacts in the image restoration step. In this paper, we analyzes the image content using the STFT(Short Time Fourier Transform) and proposes an effective method of minimizing the artifacts generated from the conventional algorithm. To evaluate the performance of the proposed scheme, we use the test images containing a wide range of noise levels and compare the results with the state-of-art algorithms.

• Journal of IKEEE
• /
• v.23 no.3
• /
• pp.910-916
• /
• 2019

Non-local similarity of natural images is one of highly exploited features in various applications dealing with images. Unique edges, texture, and pattern of the images are frequently repeated over the entire image. Once the similar image blocks are classified into a cluster, representative features of the image blocks can be extracted from the cluster. The bigger the size of the cluster is the better the additive white noise can be separated. Denoising is one of major research topics in the image processing field suppressing the additive noise. In this paper, a denoising algorithm is proposed which first clusters the noisy image blocks based on similarity, extracts the feature of the cluster, and finally recovers the original image. Performance experiments with several images under various noise strengths show that the proposed algorithm recovers the details of the image such as edges, texture, and patterns while outperforming the previous methods in terms of PSNR in removing the additive Gaussian noise.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.4
• /
• pp.526-532
• /
• 2022

With the development of IoT technology, image processing is being utilized in various fields such as image analysis, image recognition, medical industry, and factory automation. Noise is generated in image data from causes such as defect in transmission line. Image noise must be removed because it damages the performance of the image processing application program. Salt and Pepper noise is a representative type of image noise, and various studies have been conducted to remove Salt and Pepper noise. Widely known methods include A-TMF, AFMF, and SDWF. However, as the noise density increases, the performance deteriorates. Thus, this paper proposes an algorithm that performs filtering using a fuzzy logic weight mask only in case of noise after noise determination. In order to prove the noise removal performance of the proposed algorithm, an experiment was performed on images with 10% to 90% noise added and the PSNR was compared.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1939-1944
• /
• 2003

This paper presents a global path planning algorithm based on a visibility graph method, and applies additionally various constraints for constructing the reduced visibility graph. The modification algorithm for generating the rounded path is applied to the globally shortest path of the visibility graph using the robot size constraint in order to avoid the obstacle. In order to check the visibility in given 3D map data, 3D CAD data with VRML format is projected to the 2D plane of the mobile robot, and the projected map is converted into an image for easy map analysis. The image processing are applied to this grid map for extracting the obstacles and the free space. Generally, the tree size of visibility graph is proportional to the factorial of the number of the corner points. In order to reduce the tree size and search the shortest path efficiently, the various constraints are proposed. After short paths that crosses the corner points of obstacles lists up, the shortest path among these paths is selected and it is modified to the combination of the line path and the arc path for the mobile robot to avoid the obstacles and follow the rounded path in the environment. The proposed path planning algorithm is applied to the mobile robot LCAR-III.

• Journal of Sensor Science and Technology
• /
• v.8 no.1
• /
• pp.63-68
• /
• 1999

We proposed a method of eye pattern detection in the 2-D image which was obtained by CCD video camera. To detect face region and eye pattern, we proposed pattern search network and batch SVD algorithm which had the statistical equivalence of PCA. We also used HMM to improve the accuracy of detection. As a result, we acknowledged that the proposed algorithm was superior to PCA pattern detection algorithm in computational cost and accuracy of defection. Furthermore, we evaluated that the proposed algorithm was possible in real-time face pattern detection with 2 frame images per second.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.191-195
• /
• 2003

The formation degree of sustain (ITO pattern) decides quality of PDP (plasma display panel). For this reason. it makes efforts in search defects more than 30 ${\mu}{\textrm}{m}$. Now, the existing inspection process is dependent upon naked eye or SEM equipment in off-line PDP manufacturing process. In this study developed prototype inspection system of PDP ITO glass. This system creates information that detects and sorts kind of defect automatically. Design ed inspection technology adopts line-scan method by slip-beam formation for the minimum of inspection time and image processing algorithm is embodied in detection ability of developed system. Designed algorithm had to make good use of kernel matrix which draws up an approach to geometry. A characteristic of area-shaped defects, as pin hole, substance, protrusion et al, are extracted from blob analysis method. Defects, as open, short, spots, et al, are distinguished by line type inspection algorithm. In experiment results, we could have ensured ability of inspection that can be detected with reliability of up to 95% in about 60 seconds

• Journal of Information Processing Systems
• /
• v.10 no.3
• /
• pp.443-458
• /
• 2014

An extreme learning machine (ELM) is a recently proposed learning algorithm for a single-layer feed forward neural network. In this paper we studied the ensemble of ELM by using a bagging algorithm for facial expression recognition (FER). Facial expression analysis is widely used in the behavior interpretation of emotions, for cognitive science, and social interactions. This paper presents a method for FER based on the histogram of orientation gradient (HOG) features using an ELM ensemble. First, the HOG features were extracted from the face image by dividing it into a number of small cells. A bagging algorithm was then used to construct many different bags of training data and each of them was trained by using separate ELMs. To recognize the expression of the input face image, HOG features were fed to each trained ELM and the results were combined by using a majority voting scheme. The ELM ensemble using bagging improves the generalized capability of the network significantly. The two available datasets (JAFFE and CK+) of facial expressions were used to evaluate the performance of the proposed classification system. Even the performance of individual ELM was smaller and the ELM ensemble using a bagging algorithm improved the recognition performance significantly.