• 제목/요약/키워드: matching property

검색결과 168건 처리시간 0.024초

뉴럴네트웍을 이용한 얼굴영역 추출 및 얼굴인식 (Neural Network-Based Face Detection and Face Recognition)

  • 김재철;이민중;김현식;최영규
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 하계학술대회 논문집 D
    • /
    • pp.2720-2722
    • /
    • 2000
  • This paper proposes a face detection and recognition method that combines the template matching method and the eigenface method with the neural network. In the face extraction step, the skin color information is used. Therefore, the search region is reduced. The global property of the face is achieved by the eigenface method. Face recognition is performed by a neural network that can learn the face property.

  • PDF

국부 움직임을 고려한 Deinterlacing (Deinterlacing Algorithm Based on Local Motion Compensation)

  • 박민규;강문기
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
    • /
    • pp.62-65
    • /
    • 2000
  • In order to reconstruct a high resolution image, it is important to reconstruct frames from fields. A number of approaches have been developed in making frames. In this paper, we propose a new deinterlacing algorithm based on local motion compensation, which is performed based on statistical property. The proposed algorithm achieves faster processing speed than block matching algorithm and higher resolution than inter-field interpolation. The effectiveness of the proposed algorithm is demonstrated experimentally.

  • PDF

비디오 데이터베이스에서 이동 객체의 유사 부분 움직임 궤적을 위한 N-워핑 검색 (N-Warping Searches for Similar Sub-Trajectories of Moving Objects in Video Databases)

  • 심춘보;장재우
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2002년도 봄 학술발표논문집 Vol.29 No.1 (B)
    • /
    • pp.124-126
    • /
    • 2002
  • 본 논문에서는 비디오 데이터가 지니는 이동 객체의 움직임 궤적(moving objects'trajectories)에 대해 유사 부분 움직임 궤적 검색을 효율적으로 지원하는 N-워핑(N-warping) 알고리즘을 제안한다. 제안하는 알고리즘은 기존의 시계열 데이터베이스에서 유사 서브시퀸스 검색을 위해 사용되었던 타임 워핑 변환 기법(time-warping transformation)을 변형란 알고리즘이다. 또한 제안하는 알고리즘은 움직임 궤적을 모델링하기 위해 사용되는 단일 속성(property)인 각도뿐만 아니라, 거리와 시간과 같은 다중 속성을 지원하며, 사용자 질의에 대해 유사 부분 움직임 궤적 검색을 가능하게 하는 근사 매칭(approximate matching)을 지원한다

  • PDF

Solid Contents 에 따른 Ag Paste 의 특성 변화 (Characterization of Ag Pastes with solid contents variation)

  • 조현민;유명재;이우성;양형국;박종철
    • 한국마이크로전자및패키징학회:학술대회논문집
    • /
    • 한국마이크로전자및패키징학회 2002년도 추계기술심포지움논문집
    • /
    • pp.169-172
    • /
    • 2002
  • Silver pastes for inner conductor in the Low Temperature Co-fired Ceramics (LTCC) are composed of silver powder, binder, solvent and additives. The composition of the chemicals have influence on rheology, printability, shrinkage rate, etc. In this study, commercial Ag pastes and Ag pastes made in KETI were investigated to find the relationship between characteristics of Ag paste and solid contents. Ag pastes with 68~90 wt% Solid Contents were tested. Substrate/paste matching property and conductivity of the conductor lines showed large dependence on solid contents of Ag paste.

  • PDF

지연 함수형 프로그래밍 언어의 항 개서 의미 (Term Rewriting Semantics of Lazy Functional Programming Languages)

  • 변석우
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제35권3호
    • /
    • pp.141-149
    • /
    • 2008
  • 대부분의 함수형 프로그래밍 언어에서는 '위에서 아래쪽, 왼쪽에서 오른쪽 방향으로' 패턴 매칭(pattern matching)을 한다는 전략에 따라, 모호한(ambiguous) 특성을 갖는 룰의 정의를 허용하고 있다. 이 방법은 함수형 프로그래머에게 디폴트 룰을 정의할 수 있게 하는 직관적인 편리함을 제공하지만, 한편으로 모호한 룰 때문에 함수형 언어의 의미는 불명확해 질 수 있다. 좀 더 구체적으로, 함수형 언어가 갖는 대표적인 특성인 등식 추론(equational reasoning) 원리의 적용을 불가능하게 할 수 있으며, 함수형 언어를 람다 계산법으로 변환하는 데 있어서도 정형적인 방법이 아닌 임시방편적인(ad hoc) 방법에 의존할 수밖에 없게 한다. 본 연구에서는 지연(lazy) 함수형 언어의 패턴 매칭의 의미를 순수 선언적 특성을 갖는 항 개서 시스템(Term Rewriting Systems)의 분리성(separability) 이론과 연관시키고, 분리성 이론에 따라 지연 함수형 언어가 람다 계산법으로 변환될 수 있음을 보인다.

이동테이블형 공작기계에서의 형상중첩법을 이용한 진직도 측정기술 (Straightness Measurement Technique for a Machine Tool of Moving Table Type using the Profile Matching Method)

  • 박희재
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 1995년도 춘계학술대회 논문집
    • /
    • pp.400-407
    • /
    • 1995
  • The straightness property is one of fundamental geometric tolerances to be strictly controlled for guideways of machine tools and measuring machines. The staightness measurement for long guideways was usually difficult to perform, and it needed additional equipments or special treatment with limited application. In this paper, a new approach is proposed using the profile matching technique for the long guideways, which can be applicable to most of straghtness measurements. An edge of relativelly sthort length is located along a divided section of a long guideway, and the local straightness measurement is performed. The edge is then moved to the next section with several positions overlap. After thelocal straightness profile is measured for every section along the long guideway with overlap, the global straightness profile is constructed using the profile matching technique based on theleast squares method. The proposed techinique is numerically tested for two cases of known global straightness profile arc profile and irregular profile and those profiles with and without random error intervention, respectively. When norandom errors are involved, the constructed golval profile is identical to the original profile. When the random errors are involved, the effect of the number of overlap points are investigated, and it is also found that the difference between the difference between the constructed and original profiles is very close to the limit of random uncertainty with juist few overlap points. The developed technique has been practically applied to a vertical milling machine of moving table type, and showed good performance. Thus the accuracy and efficiency of the proposed method are demonstrated, and shows great potential for variety of application for most of straightness measuirement cases using straight edges, laser optics, and angular measurement equipments.

  • PDF

Head Pose Estimation by using Morphological Property of Disparity Map

  • Jun, Se-Woong;Park, Sung-Kee;Lee, Moon-Key
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.735-739
    • /
    • 2005
  • This paper presents a new system to estimate the head pose of human in interactive indoor environment that has dynamic illumination change and large working space. The main idea of this system is to suggest a new morphological feature for estimating head angle from stereo disparity map. When a disparity map is obtained from stereo camera, the matching confidence value can be derived by measurements of correlation of the stereo images. Applying a threshold to the confidence value, we also obtain the specific morphology of the disparity map. Therefore, we can obtain the morphological shape of disparity map. Through the analysis of this morphological property, the head pose can be estimated. It is simple and fast algorithm in comparison with other algorithm which apply facial template, 2D, 3D models and optical flow method. Our system can automatically segment and estimate head pose in a wide range of head motion without manual initialization like other optical flow system. As the result of experiments, we obtained the reliable head orientation data under the real-time performance.

  • PDF

정지궤도 해색탑재체(GOCI) 자료를 위한 대기 및 BRDF 보정 연구 (Atmospheric and BRDF Correction Method for Geostationary Ocean Color Imagery (GOCI))

  • 민지은;유주형;안유환
    • 대한원격탐사학회지
    • /
    • 제26권2호
    • /
    • pp.175-188
    • /
    • 2010
  • 세계 최초로 정지 상태로 해색을 관측하는 정지궤도해색탑재체(GOCI, Geostationary Ocean Color Imager) 값의 보정을 위해서는 기존의 방법이 아닌 새로운 방법이 요구된다. 본 연구에서는 GOCI의 특별한 특성에 맞는 새로운 대기보정 방법과 양방향성 광반사 분포함수(BRDF, Bidirectional Reflectance Distribution Function) 보정 방법을 소개하고자 한다. GOCI의 대기보정을 위해서 스펙트럼 형태 조화기법(SSMM, Spectral Shape Matching Method)과 Sun Glint Correction Algorithm(SGCA)을 개발하였고, BRDF 보정을 위하여 해수의 고유광특성(IOP, Inherent Optical Property) 값을 이용하는 새로운 방법을 개발하였다. 각 방법은 한반도 주변 해역을 관측한 Sea Viewing Wide Field-of-view Sensor(SeaWiFS) 위성영상을 이용하여 적용하였다. 클로로필 농도 분포 영상을 만들어 본 결과 기존의 방법으로 얻기 어려웠던 탁도높은 해역과 에어로졸의 영향을 많이 받는 지역에서 보다 정확한 자료를 얻을 수 있었다.

보다 정확한 동적 상황인식 추천을 위해 정확 및 오류 패턴을 활용하여 순차적 매칭 성능이 개선된 상황 예측 방법 (Context Prediction Using Right and Wrong Patterns to Improve Sequential Matching Performance for More Accurate Dynamic Context-Aware Recommendation)

  • 권오병
    • Asia pacific journal of information systems
    • /
    • 제19권3호
    • /
    • pp.51-67
    • /
    • 2009
  • Developing an agile recommender system for nomadic users has been regarded as a promising application in mobile and ubiquitous settings. To increase the quality of personalized recommendation in terms of accuracy and elapsed time, estimating future context of the user in a correct way is highly crucial. Traditionally, time series analysis and Makovian process have been adopted for such forecasting. However, these methods are not adequate in predicting context data, only because most of context data are represented as nominal scale. To resolve these limitations, the alignment-prediction algorithm has been suggested for context prediction, especially for future context from the low-level context. Recently, an ontological approach has been proposed for guided context prediction without context history. However, due to variety of context information, acquiring sufficient context prediction knowledge a priori is not easy in most of service domains. Hence, the purpose of this paper is to propose a novel context prediction methodology, which does not require a priori knowledge, and to increase accuracy and decrease elapsed time for service response. To do so, we have newly developed pattern-based context prediction approach. First of ail, a set of individual rules is derived from each context attribute using context history. Then a pattern consisted of results from reasoning individual rules, is developed for pattern learning. If at least one context property matches, say R, then regard the pattern as right. If the pattern is new, add right pattern, set the value of mismatched properties = 0, freq = 1 and w(R, 1). Otherwise, increase the frequency of the matched right pattern by 1 and then set w(R,freq). After finishing training, if the frequency is greater than a threshold value, then save the right pattern in knowledge base. On the other hand, if at least one context property matches, say W, then regard the pattern as wrong. If the pattern is new, modify the result into wrong answer, add right pattern, and set frequency to 1 and w(W, 1). Or, increase the matched wrong pattern's frequency by 1 and then set w(W, freq). After finishing training, if the frequency value is greater than a threshold level, then save the wrong pattern on the knowledge basis. Then, context prediction is performed with combinatorial rules as follows: first, identify current context. Second, find matched patterns from right patterns. If there is no pattern matched, then find a matching pattern from wrong patterns. If a matching pattern is not found, then choose one context property whose predictability is higher than that of any other properties. To show the feasibility of the methodology proposed in this paper, we collected actual context history from the travelers who had visited the largest amusement park in Korea. As a result, 400 context records were collected in 2009. Then we randomly selected 70% of the records as training data. The rest were selected as testing data. To examine the performance of the methodology, prediction accuracy and elapsed time were chosen as measures. We compared the performance with case-based reasoning and voting methods. Through a simulation test, we conclude that our methodology is clearly better than CBR and voting methods in terms of accuracy and elapsed time. This shows that the methodology is relatively valid and scalable. As a second round of the experiment, we compared a full model to a partial model. A full model indicates that right and wrong patterns are used for reasoning the future context. On the other hand, a partial model means that the reasoning is performed only with right patterns, which is generally adopted in the legacy alignment-prediction method. It turned out that a full model is better than a partial model in terms of the accuracy while partial model is better when considering elapsed time. As a last experiment, we took into our consideration potential privacy problems that might arise among the users. To mediate such concern, we excluded such context properties as date of tour and user profiles such as gender and age. The outcome shows that preserving privacy is endurable. Contributions of this paper are as follows: First, academically, we have improved sequential matching methods to predict accuracy and service time by considering individual rules of each context property and learning from wrong patterns. Second, the proposed method is found to be quite effective for privacy preserving applications, which are frequently required by B2C context-aware services; the privacy preserving system applying the proposed method successfully can also decrease elapsed time. Hence, the method is very practical in establishing privacy preserving context-aware services. Our future research issues taking into account some limitations in this paper can be summarized as follows. First, user acceptance or usability will be tested with actual users in order to prove the value of the prototype system. Second, we will apply the proposed method to more general application domains as this paper focused on tourism in amusement park.

차량 검출을 위한 다중객체추적 알고리즘 (Multi-Object Tracking Algorithm for Vehicle Detection)

  • 이근후;김규영;박홍민;박장식;김현태;유윤식
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2011년도 춘계학술대회
    • /
    • pp.816-819
    • /
    • 2011
  • 터널 내에서의 사고 유발 요소는 CCTV 카메라를 이용하여 검출하여 조기에 대응함으로써 차량의 정체뿐만 아니라 인적 물적 피해를 최소화하기 위하여 영상인식시스템이 도입되고 있다. 본 논문에서는 터널 내에서 여러 차량을 추적하는 알고리즘을 제안한다. 제안하는 알고리즘은 Adaboost 알고리즘을 이용하여 차량을 검출하고 검출된 차량(객체)에 대하여 템플릿 매칭 기법을 이용하여 차량을 추적한다. 컴퓨터 시뮬레이션을 통하여 제안하는 알고리즘이 여러 차량을 추적하는데 유용한 것을 확인 하였다.

  • PDF