• 제목/요약/키워드: Intersection Recognition Algorithm

검색결과 20건 처리시간 0.028초

설계 프리미티브 간의 교차형상을 통한 가공 피쳐 인식 (Machining Feature Recognition with Intersection Geometry between Design Primitives)

  • 정채봉;김재정
    • 한국CDE학회논문집
    • /
    • 제4권1호
    • /
    • pp.43-51
    • /
    • 1999
  • Producing the relevant information (features) from the CAD models of CAM, called feature recognition or extraction, is the essential stage for the integration of CAD and CAM. Most feature recognition methods, however, have problems in the recognition of intersecting features because they do not handle the intersection geometry properly. In this paper, we propose a machining feature recognition algorithm, which has a solid model consisting of orthogonal primitives as input. The algorithm calculates candidate features and constitutes the Intersection Geometry Matrix which is necessary to represent the spatial relation of candidate features. Finally, it recognizes machining features from the proposed candidate features dividing and growing systems using half space and Boolean operation. The algorithm has the following characteristics: Though the geometry of part is complex due to the intersections of design primitives, it can recognize the necessary machining features. In addition, it creates the Maximal Feature Volumes independent of the machining sequences at the feature recognition stage so that it can easily accommodate the change of decision criteria of machining orders.

  • PDF

변형된 BBI 알고리즘에 기반한 음성 인식기의 계산량 감축 (Computational Complexity Reduction of Speech Recognizers Based on the Modified Bucket Box Intersection Algorithm)

  • 김건용;김동화
    • 대한음성학회지:말소리
    • /
    • 제60호
    • /
    • pp.109-123
    • /
    • 2006
  • Since computing the log-likelihood of Gaussian mixture density is a major computational burden for the speech recognizer based on the continuous HMM, several techniques have been proposed to reduce the number of mixtures to be used for recognition. In this paper, we propose a modified Bucket Box Intersection (BBI) algorithm, in which two relative thresholds are employed: one is the relative threshold in the conventional BBI algorithm and the other is used to reduce the number of the Gaussian boxes which are intersected by the hyperplanes at the boxes' edges. The experimental results show that the proposed algorithm reduces the number of Gaussian mixtures by 12.92% during the recognition phase with negligible performance degradation compared to the conventional BBI algorithm.

  • PDF

딥러닝 데이터 활용한 신호등 색 인식 알고리즘 개발 (Development of Color Recognition Algorithm for Traffic Lights using Deep Learning Data)

  • 백서하;김종호;이경수
    • 자동차안전학회지
    • /
    • 제14권2호
    • /
    • pp.45-50
    • /
    • 2022
  • The vehicle motion in urban environment is determined by surrounding traffic flow, which cause understanding the flow to be a factor that dominantly affects the motion planning of the vehicle. The traffic flow in this urban environment is accessed using various urban infrastructure information. This paper represents a color recognition algorithm for traffic lights to perceive traffic condition which is a main information among various urban infrastructure information. Deep learning based vision open source realizes positions of traffic lights around the host vehicle. The data are processed to input data based on whether it exists on the route of ego vehicle. The colors of traffic lights are estimated through pixel values from the camera image. The proposed algorithm is validated in intersection situations with traffic lights on the test track. The results show that the proposed algorithm guarantees precise recognition on traffic lights associated with the ego vehicle path in urban intersection scenarios.

도심의 차량 네트워크에서 긴급 메시지 전파를 위한 효율적인 브로드캐스트 기법 (An Efficient Broadcast Scheme for Disseminating Emergency Message in Urban Vehicular Ad-Hoc Networks)

  • 이규창;한기준;조규철;백영미;김준형
    • 한국통신학회논문지
    • /
    • 제38C권7호
    • /
    • pp.605-611
    • /
    • 2013
  • 본 논문은 차량이 사고가 발생하였을 때, 사고 차량이 가까이에 있는 주위 차량에 긴급메시지를 전파하여, 다른 차량의 운전자들이 사고지점을 인지하고 회피할 수 있도록 효과적이고 빠른 브로드캐스트 기법에 관하여 기술하였다. 본 논문에서는 GPS(Global Position System)가 장착된 도심환경의 차량 네트워크에서 긴급 메시지를 빠르게 전파하는 방법을 제안한다. 전송 차량은 연속적이고 효과적인 메시지 전파를 위해 가장 멀리 있는 차량을 다음 릴레이 차량으로 미리 선정하고 전파를 하는 기법을 제안한다. 그리고 RSU(Road Side Unit)의 도움 없이 교차로를 인식할 수 있는 알고리즘을 제안하며, 끊어진 네트워크 상황에 대처하기 위해 헬로 메시지를 이용한 SCF(Store-Carry-Forward) 기법을 제안한다.

Improvement of Three Mixture Fragrance Recognition using Fuzzy Similarity based Self-Organized Network Inspired by Immune Algorithm

  • Widyanto, M.R.;Kusumoputro, B.;Nobuhara, H.;Kawamoto, K.;Yoshida, S.;Hirota, K.
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.419-422
    • /
    • 2003
  • To improve the recognition accuracy of a developed artificial odor discrimination system for three mixture fragrance recognition, Fuzzy Similarity based Self-Organized Network inspired by Immune Algorithm (F-SONIA) is proposed. Minimum, average, and maximum values of fragrance data acquisitions are used to form triangular fuzzy numbers. Then the fuzzy similarity treasure is used to define the relationship between fragrance inputs and connection strengths of hidden units. The fuzzy similarity is defined as the maximum value of the intersection region between triangular fuzzy set of input vectors and the connection strengths of hidden units. In experiments, performances of the proposed method is compared with the conventional Self-Organized Network inspired by Immune Algorithm (SONIA), and the Fuzzy Learning Vector Quantization (FLVQ). Experiments show that F-SONIA improves recognition accuracy of SONIA by 3-9%. Comparing to the previously developed artificial odor discrimination system that used FLVQ as pattern classifier, the recognition accuracy is increased by 14-25%.

  • PDF

효과적인 운송 컨테이너 영상의 식별자 인식을 위한 개선된 퍼지 ART 알고리즘 (An Enhanced Fuzzy ART Algorithm for The Effective Identifier Recognition From Shipping Container Image)

  • 김광백
    • 한국통신학회논문지
    • /
    • 제28권5C호
    • /
    • pp.486-492
    • /
    • 2003
  • 퍼지 ART 알고리즘에서 경계 변수는 임의의 패턴과 저장된 패턴과의 불일치(mismatch) 허용도를 결정한다. 이 경계 변수가 크면 입력 패턴과 저장 패턴 사이에 약간의 차이가 있어도 새로운 카테고리(category)로 분류하게 된다. 반대로 경계 변수가 작으면 입력 패턴과 저장 패턴 사이에 많은 차이가 있더라도 유사성이 인정되어 입력 패턴을 저장 패턴의 카테고리로 분류한다. 따라서 영상 인식에 적용하기 위해서는 경계 변수를 경험적으로 설정한다. 그리고 연결 가중치를 조정하는 과정에서 저장된 패턴들의 정보들이 손실되는 경우가 발생하여 인식률을 저하시킨다. 본 논문에서는 퍼지 ART 알고리즘의 문제점을 개선하기 위하여 퍼지 논리 접속 연산자를 이용하여 경계 변수를 동적으로 조정하고 저장 패턴과 학습 패턴간의 실제적인 왜곡 정도를 충분히 고려하여 승자 노드로 선택된 빈도수를 가중치 조정에 적용하는 개선된 퍼지 ART 알고리즘을 제안하였다. 제안된 방법의 인식 성능을 확인하기 위해서 운송 컨테이너 영상을 대상으로 실험한 결과, 기존의 ART2 알고리즘이나 퍼지 ART 알고리즘보다 클러스터의 수가 적게 생성되었고 인식 성능도 기존의 방법들보다 우수한 성능이 있음을 확인하였다.

Reconstruction of Overlapping Character in Thai Printed Documents

  • Nucharee Pemchaiswa;Wichian Premchaiswadi;Voravit Premratanachai;Seinosuke Narita
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -1
    • /
    • pp.31-34
    • /
    • 2000
  • This paper proposes a reconstruction scheme for overlapping characters in Thai printed document. Overlapping characters are characters that overlap with surrounding characters. The problem of overlapping characters is still an unsolved problem In commercially available software of Thai character recognition systems. The algorithm of reconstruction scheme is based on structural analysis of overlapping Thai printed characters. It consists of 2 steps: overlapping point determination and reconstruction of segmented characters. The overlapping point is defined as the intersection point between characters and can be determined by using templates. Then, an overlapping character is separated into segments at the intersection point. The structure of each segment may be an incomplete character and is not identical to the original one. Therefore, the reconstruction process is employed to add the incomplete part of these segments. The proposed scheme has been implemented and tested with 70 patterns of conventionally found in overlapping printed Thai characters with different typefaces and type sizes. The experimental results show that the proposed scheme can segment and reconstruct overlapping characters correctly. The proposed scheme can improve the recognition rate of commercially available software, ThaiOCR1.5 and ArnThai1.0, more than 60 percents

  • PDF

사람의 움직임 추적을 위한 다중 카메라 기반의 지면 위 발의 대응 (Multiple Camera-Based Correspondence of Ground Foot for Human Motion Tracking)

  • 서동욱;채현욱;조강현
    • 제어로봇시스템학회논문지
    • /
    • 제14권8호
    • /
    • pp.848-855
    • /
    • 2008
  • In this paper, we describe correspondence among multiple images taken by multiple cameras. The correspondence among multiple views is an interesting problem which often appears in the application like visual surveillance or gesture recognition system. We use the principal axis and the ground plane homography to estimate foot of human. The principal axis belongs to the subtracted silhouette-based region of human using subtraction of the predetermined multiple background models with current image which includes moving person. For the calculation of the ground plane homography, we use landmarks on the ground plane in 3D space. Thus the ground plane homography means the relation of two common points in different views. In the normal human being, the foot of human has an exactly same position in the 3D space and we represent it to the intersection in this paper. The intersection occurs when the principal axis in an image crosses to the transformed ground plane from other image. However the positions of the intersection are different depend on camera views. Therefore we construct the correspondence that means the relationship between the intersection in current image and the transformed intersection from other image by homography. Those correspondences should confirm within a short distance measuring in the top viewed plane. Thus, we track a person by these corresponding points on the ground plane. Experimental result shows the accuracy of the proposed algorithm has almost 90% of detecting person for tracking based on correspondence of intersections.

천장 부착 컬러 표식을 이용한 이동로봇의 자기위치추정 (Localization of Mobile Robot Using Color Landmark mounted on Ceiling)

  • 오종규;이찬호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2001년도 합동 추계학술대회 논문집 정보 및 제어부문
    • /
    • pp.91-94
    • /
    • 2001
  • In this paper, we proposed localization method of mobile robot using color landmark mounted on ceiling. This work is composed 2 parts : landmark recognition part which finds the position of multiple landmarks in image and identifies them and absolute position estimation part which estimates the location and orientation of mobile robot in indoor environment. In landmark recognition part, mobile robot detects artificial color landmarks using simple histogram intersection method in rg color space which is insensitive to the change of illumination. Then absolute position estimation part calculates relative position of the mobile robot to the detected landmarks. For the verification of proposed algorithm, ceiling-orientated camera was installed on a mobile robot and performance of localization was examined by designed artificial color landmarks. As the result of test, mobile robot could achieve the reliable landmark detection and accurately estimate the position of mobile robot in indoor environment.

  • PDF

개선된 ART1 알고리즘을 이용한 이미지 인식에 관한 연구 (A Study on Image Recognition using Enhanced ART1 Algorithm)

  • 천두억;윤성호;김광백
    • 한국컴퓨터정보학회논문지
    • /
    • 제3권3호
    • /
    • pp.17-22
    • /
    • 1998
  • 이미지 인식 분야에 있어서 전자 결재시 도장의 진위 문제와 은행업무 또는 중요서류에 있어서의 도장 진위 문제는 점점 더 중요하게 부각되고 있는데 반해 기존의 도장 이미지 처리 과정은 물체의 테두리 부분과 같이 명암도가 날카롭게 변하는 부분의 선명도를 흐리게 하는 단점이 있으며 윤곽선을 추출하는데 어려움이 많다. 본 논문에서는 개선한 평활화 방법을 이용하여 특정한 범위내의 픽셀을 조사하여 가장 빈번히 나타나는 값을 찾고,그 값을 해당 픽셀의 값으로 대체시켜 윤곽선을 검출한 다음, ART1 학습 알고리즘에서 경계값을 퍼지 연산자중 Yager의 일반화된 교연산자를 적용하여 경계변수값을 동적으로 변화시켜 올바른 분류가 될 수 있도록 한다. 본 논문에서 제안한 ART1학습 알고리즘에 적용하여 실험한 결과 기존의 ART1 알고리즘을 이용한 경우보다 향상된 이미지 인식율을 보였다.

  • PDF