• Journal of the Korea Society of Computer and Information
• /
• v.17 no.11
• /
• pp.73-81
• /
• 2012

This paper proposes an ETWAD(Encapsulation and Tunneling Wormhole Attack Detection) design based on positional information and hop count on Ad-Hoc Network. The ETWAD technique is designed for generating GAK(Group Authentication Key) to ascertain the node ID and group key within Ad-hoc Network and authenticating a member of Ad-hoc Network by appending it to RREQ and RREP. In addition, A GeoWAD algorithm detecting Encapsulation and Tunneling Wormhole Attack by using a hop count about the number of Hops within RREP message and a critical value about the distance between a source node S and a destination node D is also presented in ETWAD technique. Therefore, as this paper is estimated as the average probability of Wormhole Attack detection 91%and average FPR 4.4%, it improves the reliability and probability of Wormhole Attack Detection.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1493-1504
• /
• 2010

The localization service which provides the location information of mobile user, is one of important service provided by sensor network. Many methods to obtain the location information of mobile user have been proposed. However, these methods were developed for only one mobile user so that it is hard to extend for multiple mobile users. If multiple mobile users start the localization process concurrently, there could be interference of beacon or ultrasound that each mobile user transmits. In the paper, we propose LME, the localization technique for multiple mobile nodes in mobile wireless sensor networks. In LME, collision of localization between sensor nodes is prevented by forcing the mobile node to get the permission of localization from anchor nodes. For this, we use CTS packet type for localization initiation by mobile node and RTS packet type for localization grant by anchor node. NTS packet type is uevento reject localization by anchor node for interference avoidance.nghe experimental result shows that the number of interference between nodes are increased in proportion to the number of mobile nodes and LME provides efficient localization.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.135-142
• /
• 2013

Contour detection is important for many computer vision applications, such as shape discrimination and object recognition. In many cases, local luminance changes turn out to be stronger in textured areas than on object contours. Therefore, local edge features, which only look at a small neighborhood of each pixel, cannot be reliable indicators of the presence of a contour, and some global analysis is needed. The novelty of this operator is that dilation is limited to Deluanary triangular. An efficient implementation is presented. The grouping algorithm is then embedded in a multi-threshold contour detector. At each threshold level, small groups of edges are removed, and contours are completed by means of a generalized reconstruction from markers. Both qualitative and quantitative comparison with existing approaches prove the superiority of the proposed contour detector in terms of larger amount of suppressed texture and more effective detection of low-contrast contour.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1285-1295
• /
• 1999

본 논문은 방대한 크기의 볼륨 데이타를 효율적으로 렌더링하기 위한 셀 기반 웨이브릿 압축 방법을 제시한다. 이 방법은 볼륨을 작은 크기의 셀로 나누고, 셀 단위로 웨이브릿 변환을 한 다음 복원 순서에 따른 런-길이(run-length) 인코딩을 수행하여 높은 압축율과 빠른 복원을 제공한다. 또한 최근 복원 정보를 캐쉬 자료 구조에 효율적으로 저장하여 복원 시간을 단축시키고, 에러 임계치의 정규화로 비정규화된 웨이브릿 압축보다 빠른 속도로 정규화된 압축과 같은 고화질의 이미지를 생성하였다. 본 연구의 성능을 평가하기 위하여 {{}} 해상도의 볼륨 데이타를 압축하여 쉬어-？ 분해(shear-warp factorization) 알고리즘에 적용한 결과, 손상이 거의 없는 상태로 약 27:1의 압축율이 얻어졌고, 약 3초의 렌더링 시간이 걸렸다.Abstract This paper presents an efficient cell-based wavelet compression method of large volume data. Volume data is divided into individual cell of {{}} voxels, and then wavelet transform is applied to each cell. The transformed cell is run-length encoded according to the reconstruction order resulting in a fairly good compression ratio and fast reconstruction. A cache structure is used to speed up the process of reconstruction and a threshold normalization scheme is presented to produce a higher quality rendered image. We have combined our compression method with shear-warp factorization, which is an accelerated volume rendering algorithm. Experimental results show the space requirement to be about 27:1 and the rendering time to be about 3 seconds for {{}} data sets while preserving the quality of an image as like as using original data.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.187-194
• /
• 2011

In this paper, JPEG(Joint Photographic Experts Group) image data video decoding technique is presented, it is Huffman decoding method and fractal image method which is very complexive algorithm and the time required much it to implement this method and the first image is decoded to video frame image. This have defect of overlap decoding and transport work because of impossible to represent objective value of resemblance. The proposed method was calculated the mathematical absolute image resemblance and simplify the moving picture process to reducing the step of moving picture codefying. The results show that smoothed moving picture compared recent methods.

• Journal of the Korean Geotechnical Society
• /
• v.18 no.5
• /
• pp.271-280
• /
• 2002

A probabilistic approach to identify the effects of uncertainties of soil strength parameters on searching a critical slip surface with the lowest reliability is introduced. In general construction field, it is impossible for the engineer to always gather a variety of statistical information of soil strength parameters for which lots of laboratory and in-situ soil testing are required and to use it with enough statistical knowledge. Thus, in order that the engineer may easily understand the probabilistic concept for the slope stability analysis, this study proposes a combined procedure to incorporate the engineering probabilistic tools into the existing deterministic slope stability analysis methods. Using UTEXAS 3, a slope stability analysis computer program developed by U.S. Army Corps of Engineers (U.S. COE), this study provides the results of this probabilistic slope stability analysis in terms of probability of failure or reliability index. This probabilistic method f3r slope stability analysis appears to yield more comprehensive results of slope reliability than does existing deterministic methods with safety factors alone.

• Korean Journal of Remote Sensing
• /
• v.39 no.6_1
• /
• pp.1211-1224
• /
• 2023

Clouds cause many difficult problems in observing land surface phenomena using optical satellites, such as national land observation, disaster response, and change detection. In addition, the presence of clouds affects not only the image processing stage but also the final data quality, so it is necessary to identify and remove them. Therefore, in this study, we developed a new cloud detection technique that automatically performs a series of processes to search and extract the pixels closest to the spectral pattern of clouds in satellite images, select the optimal threshold, and produce a cloud mask based on the threshold. The cloud detection technique largely consists of three steps. In the first step, the process of converting the Digital Number (DN) unit image into top-of-atmosphere reflectance units was performed. In the second step, preprocessing such as Hue-Value-Saturation (HSV) transformation, triangle thresholding, and maximum likelihood classification was applied using the top of the atmosphere reflectance image, and the threshold for generating the initial cloud mask was determined for each image. In the third post-processing step, the noise included in the initial cloud mask created was removed and the cloud boundaries and interior were improved. As experimental data for cloud detection, CAS500-1 L2G images acquired in the Korean Peninsula from April to November, which show the diversity of spatial and seasonal distribution of clouds, were used. To verify the performance of the proposed method, the results generated by a simple thresholding method were compared. As a result of the experiment, compared to the existing method, the proposed method was able to detect clouds more accurately by considering the radiometric characteristics of each image through the preprocessing process. In addition, the results showed that the influence of bright objects (panel roofs, concrete roads, sand, etc.) other than cloud objects was minimized. The proposed method showed more than 30% improved results(F1-score) compared to the existing method but showed limitations in certain images containing snow.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.67-75
• /
• 1996

컴퓨터를 이용한 문서정보의 처리를 위해서는 기본적으로 문서영상내의 각 특징영역을 분리하는 것이 필수적이다. 본 논문에서는 노이즈가 존재하는 non-manhattan layout 이치 문서영상내의 halftone 이미지, 선 및 텍스트 등의 중요한 특징영역들을 자동으로 구분 추출하는 효과적인 알고리즘을 제안한다. 제안한 알고리즘의 기본적인 아이디어는 먼저 처리속도의 고속화를 위하여 원본 영상을 축소시키는 것이 필수적인 바, 축소 시 노이즈의 제거와 동시에 축소된 영상 내에서 원하는 영역의 특징들이 잘 나타나도록 하는 임계치 축소기법을 제안 사용하여 축소영상을 만든 다음, 축소영상에 다양한 모폴로지 필터를 적용함으로써 각 알고리즘의 성능을 이용한 노이즈 문서영상을 이용한 시뮬레이션을 통하여 보인다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.319-322
• /
• 2000

본 논문에서는 지문영상으로부터 제안한 알고리즘을 이용하여 특이점(Core, Delta)을 추출한 후 특이점의 개수와 종류에 따라서 5가지 부류(arch, tented arch, left loop, right loop, whorl)로 지문영상을 분류하였다. 지문영상을 8*8블록과 16*16블록으로 분할한 후 3*3 Sobel 마스크를 씌워서 대표 방향을 구하였다. 또한 블록으로 분할한 영상으로부터 분산을 구하여 전경과 배경을 분리(segmentation)시켜 수행속도를 향상시켰다. 전처리 과정으로는 일정한 블록마다 임계값을 다르게 적용시키는 블록 이진화 기법을 사용하였으며 특이점을 추출하기 위해서 서로 크기가 다른 2개의 블록으로 영상을 분할하였다. 우선 8*8블록으로 영역을 분할한 후 방향 성분을 구하고 특이점들을 추출하였다. 이 경우 잡영 때문에 특이점이 너무 많이 추출되는 문제점이 있으므로 이러한 해결책으로 16*16블록으로 영역을 분할하여 방향 성분을 구하고 특이점을 추출하였다. 이렇게 다른 두 영역에서 동시에 나타나는 특이점을 후보 특이점으로 잡아서 그 후보 특이점 주변으로 Poincare 지수를 적용하여 확실한 특이점을 선택한 후 5가지의 지문 형태로 분류하였다. 실험결과 대부분의 지문영상에 대하여 강건한 분류 특성을 보이고 있음을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.85-87
• /
• 2001

업무 데이터 분석을 통한 종합적인 의사결정을 지원할 수 있도록 데이터웨어하우스, OLAP, 데이터마이닝을 적용하려는 기업의 요구가 많아졌다. 그래서 기초 데이터의 이해, 선별, 수집, 가공, 정제가 매우 중요한 과정이나 테이블명 및 속성명이 표준화되어있지 않고 코드나 시스템 카탈로그와 같은 기본 데이터는 부정확하고 부족하다. 본 논문에서는 거의 스키마 정보에만 의존하여 테이블의 의미적 연관성에 근거한 유사한 특성을 가진 집단끼리 분류하는 대략적인 군집분석 방법을 제안한다. 질의 수행시 사용자가 설정한 임계 거리에 ㄸ라 관련된 군집만 검색함으로써 신속한 응답시간을 보장하고, 분석시점에서 다양한 질의에 유연하게 대처할 수 있다는 장점이 있다. 또한 실제 데이터에 본 연구를 적용하여 산출한 군집결과와 사람이 매뉴얼하게 그룹핑한 군집결과와 비교한다.