• 한국통신학회논문지
• /
• 제29권8C호
• /
• pp.1062-1068
• /
• 2004

본 논문에서는 정확한 코너점 검출을 위하여 새로운 그레이 레벨 코너점 검출 방법을 제안한다. 새로운 코너 검출자는 코너 영역을 윈도우 크기에 따라서 동심원으로 계층을 나누어 각각의 계층에서의 코너의 각도를 구하여 코너점을 검출하도록 하였다. 또한 계층적 구조를 가지고 처리함으로써 기존의 그레이레벨 코너 검출자보다 더 빠른 처리 속도를 얻을 수 있도록 하였다.

• 한국실내디자인학회논문집
• /
• 제13권2호
• /
• pp.72-79
• /
• 2004

First of all corner is an essential element to consist the space, but there is not much solid study and basic concept on the corner. The most important reason is the lack of the concept on the corner. The definition of corner by itself carries the term of space. Accordingly arguing the corner in space is to characterize the space. The corner is an important element to build up the space. The purpose of this study is to give a definition on the comer in space and suggest the way of practical use. The corner in space began to transform after Cubism. Therefore this study is bounded after Cubism era. The focus of study on plastical expression properties is on the view point by each era and constitutional point of view. In conclusion, the concept of corner has been switched from the concept of structure to concept of decoration. Also, study found that the concept of corner has the ideology, medium, and characteristics of boundary.

• 통합자연과학논문집
• /
• 제12권4호
• /
• pp.122-126
• /
• 2019

In this paper, we propose a simple and efficient retrieval technique using the feature value of the corner region, which is one of the shape information attributes of images. The proposed algorithm extracts the edges and corner points of the image and rearranges the feature values of the corner regions doubly, and then measures the similarity with the image in the database using the correlation of these feature values as the feature vector. The proposed algorithm is confirmed to be more robust to rotation and size change than the conventional image retrieval method using the corner point.

• 전기학회논문지
• /
• 제56권10호
• /
• pp.1865-1867
• /
• 2007

We propse a novel corner detection algorithm for locating 2D Data Matrix barcode in an image. The proposed method accumulates weight for each cross point defined by every combination of edge points in the image, and detects the corner point of the barcode L-pattern by determining the location of the highest accumulated weight. By designing the weight considering the connectivity of two lines around the cross point, we were able to detect the corner of L-pattern even for the cases that the lines of L-patterns are short. In the experiments, the proposed method showed improved performance compared with the conventional Hough transform based method in terms of detectability and computation time.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제31권6호
• /
• pp.792-798
• /
• 2004

본 논문에서는 웨이퍼 영상에서 다이 위치를 인식하기 위한 새로운 코너점 검출 방법을 제안한다. 웨이퍼 다이 위치 인식은 WSCSP(Wafer Scale Chip Scale Packaging)기술에 필수적인 과정으로서 웨이퍼 윗면의 다이 패턴을 얼마나 정확히 인식하느냐에 따라서 후 공정의 정확도가 결정된다. 본 논문에서는 정확한 다이 위치를 인식하기 위하여 계층적 명암 영상 코너 검출 방법을 제안한다. 새로운 코너 검출자는 코너 영역을 마스크 크기에 따라서 동심원으로 나누어 각각의 동심원에서의 코너성과 방향성을 구하여 정확한 코너점을 검출하도록 하였다. 또한 계층적 구조를 가지고 처리하여 기존의 명암 영상코너 검출자 보다 더 빠른 처리 속도를 얻을 수 있도록 하였다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2011년도 춘계학술대회 논문집
• /
• pp.335-336
• /
• 2011

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 춘계학술대회 논문집
• /
• pp.466-469
• /
• 2002

Burr is a projected part of finished workpiece. It is unavoidable and undesirable by-product of most metal cutting or shearing process. Also, it must be removed to improve the fit of machined parts, safety of workers, and the effectiveness of finishing operation. But deburring process is one of manufacturing processes that have net been successfully automated, so deburring automation is strongly needed. This paper focused on developing a basic algorithm to find edge of workpiece and match two different image data for deburring automation which includes automatic recognition of parts, generation of deburring tool paths and edge/corner finding ability by analyzing the DXF drawing file which contains information of part geometry. As an algorithm for corner finding, SUSAN method was chosen. It makes good performance in finding edge and corner in suitable time. And this paper suggested a simple algorithm to find matching point between CCD image and drawing file.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제13권4호
• /
• pp.284-290
• /
• 2013

Feature detection is very important to image processing area. In this paper we compare and analyze some characteristics of image processing algorithms for corner and blob feature detection. We also analyze the simulation results through image matching process. We show that how these algorithms work and how fast they execute. The simulation results are shown for helping us to select an algorithm or several algorithms extracting corner and blob feature.

• 대한전자공학회논문지
• /
• 제27권1호
• /
• pp.96-104
• /
• 1990

In this paper, a novel method of jig-saw puzzle matching is proposed using a modifided boundary matching algorithm without a priori knowledge for the matched puzzle. Specifically, a boundary tracking algorithm is utilised to segment each puzzle from low-resolution image data. Segmented puzzle is described via corner point, angle and distance between two adjacent coner point, and convexity and/or concavity of corner point. Proposed algorithm is implemented and tested in IBM PC and PC version vision system, and applied successfully to real jig-saw puzzles.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 D
• /
• pp.2598-2600
• /
• 2002

본 논문은 다양한 크기와 복잡한 배경을 포함한 질의 얼굴 영상이 들어 왔을 때 질의 영상의 얼굴 타원 정보 내에서의 Corner point들에서의 Gabor 웨이블릿 특성을 이용한 얼굴 인식에 관한 것이다. 기존에 방법은 다른 크기와 배경의 질의 영상이 들어왔을 때에는 배경에서의 Corner Point들에 대한 영향과 영상의 크기가 다름으로 인해 Corner point의 변화와 Gabor 특징벡터의 변화 때문에 인식률이 저하되었다. 이러한 단점을 보완하고자 질의 영상의 얼굴 타원 정보를 추출하여 배경에 의한 영향을 제거하고, 크기를 보정해줌으로써 기존의 우수한 성능을 유지함과 동시에 다양한 크기와 배경을 가진 질의 얼굴 영상을 인식할 수 있도록 한 것이다.