• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.1
• /
• pp.74-84
• /
• 1988

This paper presents feature extraction technique for linear image using edge detection algorithms. The process of edge finding consists of determining edge magnitud and direction by convolution of an image with a number of edge masks, of thinning and ghresholding these edge magnitudes, of linking the edge elemtnts based on proximity ans orientation, and finally, of approximating the linked elements by piede-wise linear segmentss. These techniques are intened to be general and opplications to terminal detection and road recognition tasks are described. The presentation will be helpful to other researchers attempting to implement similar algorithms.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.323-325
• /
• 2012

SNS의 활용에 따라 대규모의 네트워크가 생성되고 있고, 네트워크에서 생성되는 커뮤니티의 구조를 파악하기 위한 많은 연구가 진행되고 있다. 파악된 커뮤니티를 통합하는 방안은 서로 다른 커뮤니티를 통합할 필요가 있을 때 활용된다. 본 연구에서는 파악된 2개의 커뮤니티를 하나의 커뮤니티로 만들기 위해 필요한 에지추가 방법을 연구한다. 파악된 커뮤니티를 통합하기 위해 각 커뮤니티를 연결하여야 하는데, 이 때 각 커뮤니티 내의 노드들에 대해 노드 근접도를 계산하여 커뮤니티의 중심을 찾는다. 중심에 가까운 노드들을 순차적으로 이용하여 커뮤니티가 통합될 때까지 에지를 생성하여 그래프에 추가한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.313-317
• /
• 2003

This paper suggested the initial edge map through the pre-processing of vague image before apply the GVF snake algorithm. The reason obtain for detail object outline and time efficiency GVF snake algorithm feasible extracted concave edge but mistake interested object edge for the around others. So it need to trim about the object around edges. The method is using Pixel morphological reconstruction, edge extraction mask and threshoding. The result, defend fallen local minimum edge energy and reduce iteration.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06a
• /
• pp.81-85
• /
• 1998

점확산 함수(point spread function; PSF)의 정확한 추정은 복원결과가 원 영상에 얼마나 근접할 수 있는가를 결정한다는 점에서 영상처리의 중요한 연구 주제중의 하나가 된다. 본 논문에서는 PSF를 추정하기 위한 알고리즘을 제안하고, 이를 영상복원에 적용한 후 이를 기반으로 디지털 자동초점시스템을 제안한다. 초점불안전 열화시스템을 구현하기 위한 과정은 두 단계로 구성되어 있는데, 즉 입력 영상에서 에지분류를 통한 PSF 추정과, 이를 이용한 영상복원이다. 보다 구체적으로, 입력 영상에 특정 에지가 있는 임의의 크기의 블록을 선정해부면, 그 블록으로부터 자동으로 에지방향이 기저영상을 이용해서 구해지며 확산원의 크기를 추정하여 1차원 단위 계단응답과 영역을 구하여 평균한 후, 2차원 등방성 PSF를 추정한다. 마지막으로 추정된 PSF를 사용하여 복원을 수행함으로써 초점이 맞는 영상을 구한다.

• Proceedings of the Optical Society of Korea Conference
• /
• 2009.02a
• /
• pp.243-245
• /
• 2009

광학 현미경의 분해능이 파장에 따른 회절에 의해 결정된다. 이것을 극복하기 위해서 나노미터까지 분해능을 향상시키기 위해서 근접장 광학이 각광을 받고 있다. 본 보고에서는 흡수 에지 근처의 위상변화 특성에 기인한 초해상을 보고한다.

• The KIPS Transactions:PartB
• /
• v.19B no.1
• /
• pp.37-42
• /
• 2012

The pseudo relevance feedback suggests that frequent words at the top documents are related to initial query. However, the main drawback associated with the term frequency method is the fact that it relies on feature independence, and disregards any dependencies that may exist between words in the text. In this paper, we propose query expansion based on word graph using term proximity. It supplements term frequency method. On TREC WT10g test collection, experimental results in MAP(Mean Average Precision) show that the proposed method achieved 6.4% improvement over language model.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.6
• /
• pp.511-517
• /
• 2009

In this paper an finite element approach for the edge crack analysis of silicon-steel sheet during cold rolling is presented. Based on the damage mechanics, the proposed approach follows the analysis steps which are composed of damage initiation, damage evolution and fracture. Through those steps, we can find out the initiation instant of crack and resulting propagated length and shape of the crack. The material constants related to fracture is experimentally obtained by tension tests using standard sheet-type specimen and notched sheet-type specimen. To evaluate the prediction accuracy, we performed a pilot rolling test with a initially notched sheets. It is shown that the results obtained by the approach converged to the experimental one concerning about the direction and length of propagated crack. The capability of the proposed one is demonstrated through the application to the actual silicon-steel rolling mill.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.704-711
• /
• 2008

This paper proposes a new de-interlacing method which results in efficient visual improvement. In the proposed algorithm, the distance weight was considered and the previously developed the EDI (Edge Dependent Interpolation) algorithm and the NAL (New Adaptive Linear interpolation) algorithm were used as a basis. The do-interlacing method was divided into two main parts. First, the edge direction was found by using information of closer pixels. Then, missing pixels were interpolated along with the decided edge direction. In this paper, after predicting the edge through the EDI algorithm, missing pixels were interpolated by using the weighted distance based on the NAL algorithm. Experimental results indicate that the proposed algorithm be superior to the conventional algorithms in terms of the objective and subjective criteria.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.1098-1103
• /
• 2005

The edge and contour information are very much appreciated by the human visual systems and are responsible for our perceptions and recognitions. Therefore, if edge information is integrated during extracting video objects, we can generate boundaries of oects closer to human visual systems for multimedia applications such as interaction between video objects, object-based coding, and representation. Most of object extraction methods are difficult to implement real-time systems due to their iterative and complex arithmetic operations. In this paper, we propose a VLSI architecture integrating edge information to extract video objects for precisely located object boundaries. The proposed architecture can be easily implemented into hardware due to simple arithmetic operations. Also, it can be applied to real-time object extraction for object-oriented multimedia applications.