• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.4
• /
• pp.421-430
• /
• 2010

Image segmentation technique is becoming increasingly important in the field of remote sensing image analysis in areas such as object oriented image classification to extract object regions of interest within images. This paper presents a new method for image segmentation in High Resolution Remote Sensing Image based on Improved Seeded Region Growing (ISRG) and Region merging. Firstly, multi-spectral edge detection was done using an entropy operator in pan-sharpened QuickBird imagery. Then, the initial seeds were automatically selected from the obtained multi-spectral edge map. After automatic selection of significant seeds, an initial segmentation was achieved by applying ISRG to consider spectral and edge information. Finally the region merging process, integrating region texture and spectral information, was carried out to get the final segmentation result. The accuracy assesment was done using the unsupervised objective evaluation method for evaluating the effectiveness of the proposed method. Experimental results demonstrated that the proposed method has good potential for application in the segmentation of high resolution satellite images.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.5
• /
• pp.510-521
• /
• 2001

Image retrieval system should be construct for searching fast, efficient image be extract the accurate feature information of image with more massive and more complex characteristics. Image retrieval system are essential differences between image databases and traditional databases. These differences lead to interesting new issues in searching of image, data modeling. So, cause us to consider new generation method of database, efficient retrieval method of image. In this paper, To extract feature information of edge using in searching from input image, we was performed to extract the edge by convolution Laplacian mask and input image, and we implemented the annotation-based and content-based image retrieval system for searching fast, efficient image by generation image database from extracting feature information of edge and metadata. We can improve the performance of the image contents retrieval, because the annotation-based and content-based image retrieval system is using image index which is made up of the content-based edge feature extract information represented in the low level of image and annotation-based edge feature information represented in the high level of image. As a conclusion, image retrieval system proposed in this paper is possible the accurate management of the accumulated information for the image contents and the information sharing and reuse of image because the proposed method do construct the image database by metadata.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.97-100
• /
• 2007

Recently, there is developed various antenna's models due to increment of wireless communication the need of quantitative study on antenna's measuring technology gets to highlight. In this paper, we propose algorithm of antenna's edge alignment for making automatic measuring system of antenna's characteristics of near-field measurement system of antenna. The proposed algorithm gets the bottom image of antenna from camera, extracts antenna object, and finds the boundary the object. The proposed algorithm calculates distortion of the object using the extracted boundary and the angle to correct this. The proposed algorithm is applied to the standard gain horn antenna. The results show that antenna's object is efficiently extracted and the angle for correcting the error is calculated.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.53-63
• /
• 2006

A discrete wavelet transform(DWT)-based image watermarking algorithm is proposed in this paper, the proposed method decompose the original image into four subsampled images. Subsampled images are transformed by 2 level DWT, respectively. The proposed method embeds the watermark into one of the subsampled DWT images using edge table that represents dege characteristics of the original image. Without an original image, a watermark is extracted through comparison one subsampled DWT image inserted the watermark with the rest of the submapled DWT images. many exiting methodes do not adequately estimate edge regions where intensities are changed abruptly. The proposed method address with an edge table. Also, even if the watermark is embedded into a low frequency area, our method preserves the image quality. The vality of the proposed method is demonstrated through the PSNR test and subjective image quality that human eyes feel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.822-828
• /
• 2002

Optical flow estimation based on multi constraint approaches is frequently used for recognition of moving objects. However, the use have been confined because of OF estimation time as well as error problem. This paper shows a new method form effectively extracting movement information using the multi-constraint base approaches with sobel edge detection. The moving objects anr extraced in the input image sequence using edge detection and segmentation. Edge detection and difference of the two input image sequence gives us the moving objects in the images. The process of thresholding removes the moving objects detected due to noise. After thresholding the real moving objects, we applied the Combinatorial Hough Transform (CHT) and voting accumulation to find the optimal constraint lines for optical flow estimation. The moving objects found in the two consecutive images by using edge detection and segmentation greatly reduces the time for comutation of CHT. The voting based CHT avoids the errors associated with least squares methods. Calculation of a large number of points along the constraint line is also avoided by using the transformed slope-intercept parameter domain. The simulation results show that the proposed method is very effective for extracting optical flow vectors and hence recognizing moving objects in the images.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.385-388
• /
• 2013

In this paper, we show the weakness of the image matching method by using MPEG-7 EHD(Edge Histogram Descriptor) and suggest how to improve this weakness by using image normalization. EHD algorithm is an image matching technique that collects edge's slope of distribution and same distribution. However, the EHD error rate is high because EHD is sensitive for changes of object distortion and rotation that will be matched. We improve matching performance by accurately extract edge information in image by using normalization. We compare and analyze the normalized EHD algorithm by using distortion and rotation and it shows robustness for changes of the size and rotation.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.889-892
• /
• 2000

본 논문에서는 효과적인 De-interlacing을 위한 Edge based Median Filter와 3-Step AMPD(Adaptive Minimum Pixel Difference Filter)를 제안한다. Motion Adaptive De-interlacing 방법에서 중요한 요소인 Motion Hissing에 의한 에러를 방지하기 위해 입력 영상을 4 가지 유형으로 구분하여 각 영상에 따라 다른 임계 값을 적용하여 정확한 화소 값을 보간 하는AMPD(Adaptive Minimum Pixel Difference) Filter를 사용하며 Moving Diagonal Edge의 효과적인 보간을 위해서 방향 필터를 사용하여 Edge Map을 추출한 뒤 Edge에 따라 가변적인 후보 화소를 선택하는 Edge based Median Filter를 사용하여 성능을 향상시켰다. 또한 입력되는 영상을 움직임 영역, 정지 영역, 경계 영역으로 나누어 적응적으로 보간 하여 연산 효율을 높였다. 제안된 방법은 다양한 영상에 대한 모의실험을 통해 기존의 방법에 비해 뛰어난 성능 개선을 보였다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.211-214
• /
• 2009

Edge detection always influenced by noise belong to the original image, therefore need use some methods to sort this issue, mean shift algorithm has the smooth function which suit for the edge detection purpose, so adopted to fade out the unimportant information, and the sensitive noise portions. After this section, use the Canny algorithm to pick up the contour of the objects we focus on, meanwhile select the Soble operator that has the orientation attribute to support the method work well. In final, take experiment and get the perfect result we wanted, make sure this method make sense and better than the sole Edge detection algorithm,

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.01a
• /
• pp.95-96
• /
• 2018

Edge Computing은 Cloud Computing의 단점을 보완하기 위해 등장 하였으나, 자원 제한을 가지고 있는 Edge Node에서 데이터 분석 및 처리해야 하는 문제점이 있다. 이를 해결하기 위해 K-means clustering 알고리즘과 PCA 기법을 이용해 차원 추축을 이용한 계산비용과 처리시간을 줄이는 기법을 제안하였다. PCA란, 차원 축소 및 데이터 압축에 사용되는 기계학습 알고리즘 중 하나이며, 데이터에서 중요한 정보만 추출해 차원을 줄일 수 있다. 이를 통해 제안한 기법이 기존의 Reduction first clustering second(RFCS) 기법에 비해 성능이 우수한 것을 확인할 수 있었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.767-770
• /
• 2001

Edge detection is one of issues with essential importance in the area of image process. An edge in image is a boundary or contour which a significant change occurs in image intensity. In the paper, we process edge detection algorithms which are based on Potts automata. The dynamical behavior of these automata is completely determined by Lyapunov operators for sequential and parallel update. If Potts Automata convergence to fixed points, then it can be used to image processing. From the generalized Potts automata point of view, we propose a Potts Automata technique for detecting edge. Based on the experimental results we discuss the advantage and efficiency.