• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.209-217
• /
• 2014

It is very important to classify a lot of table-form documents into the same type of classes or to extract information filled in the template automatically. For these, it is necessary to accurately analyze table-form structure. This paper proposes an algorithm to extract corner points based on line edge segments and to classify the type of junction from table-form images. The algorithm preprocesses image through binarization, skew correction, deletion of isolated small area of black color because that they are probably generated by noises.. And then, it processes detections of edge block, line edges from a edge block, corner points. The extracted corner points are classified as 9 types of junction based on the combination of horizontal/vertical line edge segments in a block. The proposed method is applied to the several unconstraint document images such as tax form, transaction receipt, ordinary document containing tables, etc. The experimental results show that the performance of point detection is over 99%. Considering that almost corner points make a correspondence pair in the table, the information of type of corner and width of line may be useful to analyse the structure of table-form document.

• The KIPS Transactions:PartA
• /
• v.17A no.3
• /
• pp.113-120
• /
• 2010

Even networks were introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties and algorithms such as simple routing algorithms, maximal fault tolerance, node disjoint path. Introduced routing algorithms and node disjoint path algorithms are proven to be optimal. However, it has not been introduced to constructing scheme for edge-disjoint spanning trees in even networks. The design of edge-disjoint spanning trees is a useful scheme to analyze for measuring the efficiency of fault tolerant of interconnection network and effective broadcasting. Introduced routing algorithm or node disjoint path algorithm are for the purpose of routing or node disjoint path hence they are not applicable to constitute edge disjoint spanning tree. In this paper, we show a construction algorithm of edge-disjoint spanning trees in even network $E_d$.

• Journal of IKEEE
• /
• v.10 no.1 s.18
• /
• pp.87-95
• /
• 2006

This paper presents the analyses of the effect of inserting border lines between different color regions on edge detection in color codes, and is not intended to present any new algorithm for color-code recognition. With its role to complement the RFID (radio frequency identification) and the wide and fast spread of digital cameras, an interest on color codes is fast increasing. However, the severe distortion of colors in obtained images prohibits color codes from expanding their applications. To reduce the effect of color distortion it is desirable to process the whole pixels in each color region statistically, instead of relying on some pixels sampled from the region. This requires segmentation, and the segmentation usually requires edge detection. To help detect edges not disconnected, we inserted border lines of the width of two pixels between adjacent color regions. Two colors were used for the border lines: one consisting of white pixels, and the other black pixels. The edge detection was performed on images with either of the two kinds of border lines inserted, and the results were compared to results without inserted border lines. We found that inserting black border lines degraded edge detection by causing zipper effect while inserting white border lines improved it compared to the cases without inserted border lines.

• Convergence Security Journal
• /
• v.8 no.4
• /
• pp.127-134
• /
• 2008

In this paper, we try to improve the accuracy of automatic measurement for analysis equipment by detecting efficiently the edge of a waterdrop with transparency. In order to detect the edge of a waterdrop with transparency, we use an edge detecting technique, MADD (Modified Adaptive Directional Derivative), which can identify the ramp edges with various widths as the perfectly sharp edges and respond effectively regardless of enlarging or reducing the image. The proposed edge detecting technique by means of perfect sharpening of ramp edges employs the modified adaptive directional derivatives instead of the usual local differential operators in order to detect the edges of image. The modified adaptive directional derivatives are defined by introducing the perfect sharpening map into the adaptive directional derivatives. Finally we apply the proposed method to contact angle arithmetic and show the effiency and validity of the proposed method.

• Convergence Security Journal
• /
• v.6 no.3
• /
• pp.29-35
• /
• 2006

In order to detect and locate edge features precisely in real images we have developed an algorithm by introducing a nonlocal differentiation of intensity profiles called adaptive directional derivative (ADD), which is evaluated independently of varying ramp widths. In this paper, we first develop the edge detector system employing the ADD and then, the performance of the algorithm is illustrated by comparing the results to those from the Canny's edge detector.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.07a
• /
• pp.625-627
• /
• 2022

FEC (Fog/Edge Computing) 환경에서 지연시간 최소화는 로컬과 에지 서버 간의 효율적인 협력을 보장하기 위한 최적의 계산 오프로딩 방법 결정을 통해 실현될 수 있다. 본 논문은 임의의 응용 서비스 실행모듈에 대한 부분 오프로딩 기반의 로컬(모바일 장치)과 에지 서버 간의 협업 경로를 추출하는 방법을 제안한다. 제안 방법은 다중 분기구조를 포함하는 응용 서비스 실행모듈에 대한 부분 오프로딩 기반의 최적 협업 실행경로 추출 방법을 제안한다. 제안 방법은 각 부분 모듈들의 실행위치에 따라 변화되는 지연시간 측정 및 분석에 적용가능하다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.151-154
• /
• 2008

In this paper, this program which is Retrieval System using Image Gray-scale histogram and Edge features is used to reduce the errors incurred by inputting methods which are used in a current Retrieval System. The Retrieval Algorithm is proceeding with several steps which are extracting features of images quality, extracting edge features and refining images, analysing extracted features, retaining important information from analyzed features, retrieving retained information from database, extracting and comparing among images from retrieved database. The proposed Retrieval System is used for a fast retrieval with accuracy and it is confirmed through simulations.

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

본 논문에서는 방향성을 갖는 새로운 공간적응 조절연산자와 비선형필터를 이용한 제한 반복적 영상복원 알고리듬을 제안하고 제안한 알고리듬의 수렴성에 대하여 분석을 하고 있다. 일반적인 제한반복적 영상복원 기법에서는 열화된 영상을 복원하는 과정에서 에지 및 경계부분의 재번짐이 지나친 잡음성분의 증폭에 의한 고리현상 등이 발생한다. 이러한 문제들을 해결하기 위하여 본 논문에서는 다음과 같은 기법을 도입하고 있다. 첫째는, 방향성을 갖는 새로운 공간적응 조절연산자를 적용하여 에지 등의 재번짐을 막고 고주파수 영역의 복원성능을 개선하고 있다. 둘째로, 적응적인 비선형필터를 사용하여 잡음성분과 같은 고주파수 영역의 지나친 증폭에 따른 문제를 해결하고 있다. 그리고, 제안한 논문의 안정성과 수렴성을 보장하기 위한 조건을 분석하고 있다. 열화된 영상에 대하여 실험한 결과, 기존의 다른 결과보다 우수한 성능이 있었고, 특히, 에지의 복원성능 및 고리현상의 제거에 두드러진 특징을 나타내었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.855-858
• /
• 2004

본 논문에서는 원영상 영역내 포함된 우성의 에지에 대한 구체적 정보를 이용하기 위하여 Haar 웨이블릿을 이용한 에지영상 추출한다. 추출된 에지영상에 얼굴영역을 검출하기위해 이진화된 영상에 설정된 임계값을 통하여 얻은 이진영상으로부터 얼굴영역을 검출하기 위하여 얼굴의 일반적인 구조적 정보와 처리시간이 빠른 수평, 수직히스토그램 분석법을 이용하였다. 얼굴영역을 분리한 영상에 얼굴영역의 특징벡터를 구하기 위하여 26개의 특징벡터를 사용한 효율적인 고차 국소 자동 상관함수를 사용하였다. 계산된 특징벡터는 BP 신경망의 학습을 통하여 얼굴인식을 위한 데이터로 사용하여 제안된 알고리즘에 의한 인식률향상과 속도 향상을 입증한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.429-436
• /
• 2009

Odd network was introduced as one model of graph theory. In [1], it was introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties such as simple routing algorithms, maximal fault tolerance, node axsjoint path, etc. In this paper, we sauw a construction algorithm of edge-axsjoint spanning trees in Odd network $O_d$. Also, we prove that edge-disjoint spanning tree generated by our algorithm is optimal edge-disjoint spanning tree.