• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.223-229
• /
• 2005

In this paper, we proposed an extended edge-based line averaging method for deinterlacing with restricted search range. Conversion from interlaced signal to non-interlaced signal is one of important issues. Conventional deinterlacing algorithms usually utilize edge-based line average algorithm(ELA) within pixel-by-pixel approach. However, it is very sensitive to noise and variation of intensity. To reduce the sensitivity, the proposed method adopts a block-by-block approach and provides reliable direction of edge. Simulation results show that it provides a better performance than other pixel-by-pixel ELA-based methods.

• KIISE Transactions on Computing Practices
• /
• v.23 no.8
• /
• pp.492-497
• /
• 2017

A hypergraph consists of a set of nodes and hyperedges that connect an arbitrary number of nodes. We employ graph traversal algorithms such as BFS and DFS to analyze or explore hypergraph data. However, the conventional BFS and DFS do not consider the structural characteristics of hyperedges. In this paper, we propose a method to record visited edges and nodes during the traversal algorithm for data stored in hypergraphDB. In the experiments, we conduct various hypergraph analyses that utilize traversal algorithms and show that our method achieves a fewer number of database accesses and faster processing time than the conventional one.

• Journal of KIISE:Software and Applications
• /
• v.37 no.11
• /
• pp.866-870
• /
• 2010

This paper presents an improved Snake algorithm that contains additional energy term related to adjacent edges. The suggested algorithm represents the distance between an adjacent edge and the current cell as energy, and extracts object contours more effectively by including the energy tenn to the whole energy function. The adjacent edge-based snake algorithm not only make it possible to detect object boundaries which are concave, but also can detect the boundaries of complex objects without weight adjustment. Experimental results show that the proposed method extracts object boundaries more accurately than other existing methods without loss of speed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.739-742
• /
• 2002

본 논문에서는 에지 추출을 위하여 다양한 영상에 탄력적으로 적용되는 자동 임계치에 의한 에지 추출 방법을 제안한다. 자동 임계치는 Prewitt 연산자를 이용하여 얻어진 영상을 사용하여 구한다. 에지 추출(Edge Detection)은 영상처리에 있어 데이터의 양을 크게 줄일 수 있는 장점과 함께 각종 영상처리의 전처리로 이용되어지고 있는데 정확한 에지 추출은 영상을 이해하고 분석하는데 있어서 대단히 중요한 요소로 영상처리의 다양한 분야와 결합하여 이용되어 지고 있다. 본 논문에서 제안한 자동 임계치 알고리즘에 의한 에지 추출은 영상의 세세한 부분의 에지를 탐색하는데 효과적임을 알 수가 있었다.

• KSCI Review
• /
• v.2 no.1
• /
• pp.130-139
• /
• 1995

This paper suggests the method to shorten the search area by using edge detection and subimage partition. For the purpose reduce encoding time, The Domain areas are reduced 1/64 by partitioning original image to subimage, and classified them into edge area and shade area so that detect only the area in the same class. for achieving an encoding with good fidelity, tried to differ the search method as the threshold value of edge which is included in subimage, and compared the compression rate and fidelity when set the size of range block as $4{\times}4$ and $8{\times}8$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.355-362
• /
• 2009

A new intra field deinterlacing algorithm with edge map in the image block is introduced. Conventional deinterlacing methods usually employ edge-based line average algorithm within pixel-by-pixel approach. However, it is sensitive to variation of intensity. To reduce this shortcoming, we proposed edge direction vector computed by edge map, and also its interpolation technique. We first introduce an edge direction vector, which is computed by Sobel mask, so that finer resolution of the edge direction can be acquired. The proposed edge direction vector oriented deinterlacer operates by identifying small pixel variations in five orientations, while weighted averaging to estimate missing pixel. According to the edge direction of the direction vector, we calculate weights on each edge direction. These weight values multiplied by the candidate deinterlaced pixels in order to successively build approximations of the deinterlaced sequence.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.327-336
• /
• 2004

For visual inspection system in real industrial environment, it is one of most important tasks to design fast and stable pattern matching algorithm. This paper presents an edge-based point correlation algorithm avoiding full search in visual inspection system. Conventional algorithms based on NGC(normalized gray-level correlation) have to overcome some difficulties for applying to automated inspection system in factory environment. First of all, NGC algorithms need high time complexity and thus high performance hardware to satisfy real-time process. In addition, lighting condition in realistic factory environments if not stable and therefore intensity variation from uncontrolled lights gives many roubles for applying directly NGC as pattern matching algorithm in this paper, we propose an algorithm to solve these problems from using thinned and binarized edge data and skipping full point search with edge-map analysis. A point correlation algorithm with the thinned edges is introduced with image pyramid technique to reduce the time complexity. Matching edges instead of using original gray-level pixel data overcomes NGC problems and pyramid of edges also provides fast and stable processing. All proposed methods are preyed from experiments using real images.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.259-262
• /
• 2000

본 논문은 전탐색 블럭매칭 움직임추정 VLSI 구조에서 클럭당 두연산(하나는 클럭의 상향에지, 하나는 하향에지에서 동작)을 수행하는 PE(Processing Element)를 교번적으로 결선, 클럭의 상향에지는 물론 하향에지에서도 동작하도록 하는 방식으로 클럭 사이클수를 줄이는 VLSI 구조를 제안한다 기존 구조에 그대로 적용되는 본 방법은 공급 데이타폭이 2 배, PE 의 HW 복잡도가 1.5 배 절대차 합 연산의 복잡도가 2 배로 늘어나 전체 하드웨어가 복잡해지나, PE수를 2배로 하여 클럭사이클수를 줄이는 방법에 비해서는 매우 효율적이다. 본 제안 구조는 계층적 움직임 추정 알고리듬을 사용한 MPEG-2 움직임 추정기 개발의 설계에 적용하여 기능과 HW 복잡도를 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.3
• /
• pp.249-262
• /
• 1989

We present a method of boundary extraction of moving objects. We propose four methods for detecting moving edge pixels which can be located on the boundaries of moving objects. We select the best one after we test the above four methods to real image sequences. The portion of the boundaries of moving objects which is marked as moving edge pixels is searched along the moving edge pixels with simple heuristics. And the end points of the resultant line segments are utilized as the start points of the secon stage heuristic search. This second stage search is performed for the boundaries of moving objects which is not marked as moving edge pixels due to various reasons. We test our algorithm for two real sequences and we find that this simple algorithm has good performance.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.1909_1910
• /
• 2009

디인터레이싱 방법은 크게 화면 간(Inter - Field) 디인터레이싱과 화면 내(Intra - Field) 디인터레이싱이 있고 화면 내 디인터레이싱 방법 중에는 대표적으로 라인카피와 라인별 평균값을 취하는 선형적인 방법, ELA 그리고 E-ELA 알고리즘 등이 있다. 기존 방식 중 선형적 보간법은 에지 블러링이나 계단현상이 발생하고 ELA, E-ELA알고리즘을 이용한 방법은 특정방향에지 정보가 없어 이미지에서 다양한 형태의 에지 부분의 디인터레이싱에 있어 성능이 좋지 못한 단점이 있다. 본 논문은 한 개의 필드를 사용하는 화면 내(Intra - Field) 디인터레이싱 방법을 사용하고 7방향의 에지 방향 보간법과 수평방향의 에지 라인을 고려하여 기존 방식에서 나타나던 오브젝트의 계단현상을 최대한 줄여줌으로써 향상된 화질을 보이는 디인터레이싱 알고리즘을 제안한다.