• 제목/요약/키워드: Real-time search

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

운동분석 및 측정을 위한 실시간 마커 인식 알고리즘 (Real Time Maker Detection Algorithm for Motion Analysis)

  • 이승민;이주연;황준;김문화
    • 한국정보처리학회논문지
    • /
    • 제5권5호
    • /
    • pp.1367-1376
    • /
    • 1998
  • 본 논문에서는 영상처리기(image processor)가 내장되어 있지 않은 영상획득기(frame grabber) CCD 카메라만을 가지고 2차원 및 3차원 운동 측정과 분석을 위한 실시간 마커 인식 알고리즘을 개발하였다. 검색 범위의 축소를 통해 마커 출현 예상 위치를 추정하는 추적 알고리즘을 제시하며, 예상 범위 내에서 실제 마커를 탐색하는 알고리즘으로서 전화면 검색기법, 회오리 검색 기법, 사방팔방 기법을 제시하며, 인식된 마커의 중점을 찾는 알고리즘을 제시한다. 본 연구에서 제시한 알고리즘들은 실시간 마커 인식을 위해 검색 대상의 범위를 축소하는데 그 목적을 두었다. 인식된 마커의 중점을 찾는 알고리즘은 기존의 외곽선 축출 방법보다 빠른 중점 축출 알고리즘이다.

  • PDF

무안경식 3차원 모니터용 실시간 눈 추적 알고리즘 (A Real-time Eye Tracking Algorithm for Autostereoscopic 3-Dimensional Monitor)

  • 임영신;김준식;주효남
    • 제어로봇시스템학회논문지
    • /
    • 제15권8호
    • /
    • pp.839-844
    • /
    • 2009
  • In this paper, a real-time eye tracking method using fast face detection is proposed. Most of the current eye tracking systems have operational limitations due to sensors, complicated backgrounds, and uneven lighting condition. It also suffers from slow response time which is not proper for a real-time application. The tracking performance is low under complicated background and uneven lighting condition. The proposed algorithm detects face region from acquired image using elliptic Hough transform followed by eye detection within the detected face region using Haar-like features. In order to reduce the computation time in tracking eyes, the algorithm predicts next frame search region from the information obtained in the current frame. Experiments through simulation show good performance of the proposed method under various environments.

Real-Time Non-Local Means Image Denoising Algorithm Based on Local Binary Descriptor

  • Yu, Hancheng;Li, Aiting
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권2호
    • /
    • pp.825-836
    • /
    • 2016
  • In this paper, a speed-up technique for the non-local means (NLM) image denoising method based on local binary descriptor (LBD) is proposed. In the NLM, most of the computation time is spent on searching for non-local similar patches in the search window. The local binary descriptor which represents the structure of patch as binary strings is employed to speed up the search process in the NLM. The descriptor allows for a fast and accurate preselection of non-local similar patches by bitwise operations. Using this approach, a tradeoff between time-saving and noise removal can be obtained. Simulations exhibit that despite being principally constructed for speed, the proposed algorithm outperforms in terms of denoising quality as well. Furthermore, a parallel implementation on GPU brings NLM-LBD to real-time image denoising.

고속블럭정합 알고리즘을 위한 실시간 영상프레임 데이터 처리 제어 방법의 설계 및 구현 (A Design and Implementation of Real-time Video frame data Processing control for Block Matching Algorithm)

  • 이강환;황호정
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2001년도 하계종합학술대회 논문집(2)
    • /
    • pp.373-376
    • /
    • 2001
  • This paper has been studied a real-time video frame data processing control that used the linear systolic array for motion estimation. The proposed data control processing provides to the input data into the multiple processor array unit(MPAU) from search area and reference block data. The proposed data control architecture has based on two slice band for input data processing. And it has no required external control logic blocks for input data as like reference block or search area data.

  • PDF

준비시간이 있는 혼합모델 조립라인의 제품투입순서 결정 : Tabu Search 기법 적용 (Sequencing in Mixed Model Assembly Lines with Setup Time : A Tabu Search Approach)

  • 김여근;현철주
    • 경영과학
    • /
    • 제13권1호
    • /
    • pp.13-27
    • /
    • 1996
  • This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

  • PDF

준비시간이 있는 혼합모델 조립라인에서 투입순서문제를 위한 탐색적 방법 (Heuristic Method for Sequencing Problem in Mixed Model Assembly Lines with Setup Time)

  • 현철주
    • 대한안전경영과학회:학술대회논문집
    • /
    • 대한안전경영과학회 2008년도 추계학술대회
    • /
    • pp.35-39
    • /
    • 2008
  • This paper considers the sequencing of products in mixed model assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time, the number of utility workers, and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

  • PDF

Has Retrieval Technology in Vertical Site Search Systems Improved over the Years? A Holistic Evaluation for Real Web Systems

  • Mandl, Thomas;Womser-Hacker, Christa;Gatzke, Natalia
    • Journal of Information Science Theory and Practice
    • /
    • 제3권4호
    • /
    • pp.19-34
    • /
    • 2015
  • Evaluation of retrieval systems is mostly limited to laboratory settings and rarely considers changes of performance over time. This article presents an evaluation of retrieval systems for internal Web site search systems between the years 2006 and 2011. A holistic evaluation methodology for real Web sites was developed which includes tests for functionality, search quality, and user interaction. Among other sites, one set of 20 Web site search systems was evaluated three times in different years and no substantial improvement could be shown. It is surprising that the communication between site and user still leads to very poor results in many cases. Overall, the quality of these search systems could be improved, and several areas for improvement are apparent from our evaluation. For a comparison, Google’s site search function was also tested with the same tasks.

A Real-time Multiview Video Coding System using Fast Disparity Estimation

  • Bae, Kyung-Hoon;Woo, Byung-Kwang
    • 조명전기설비학회논문지
    • /
    • 제22권7호
    • /
    • pp.37-42
    • /
    • 2008
  • In this paper, a real-time multiview video coding system using fast disparity estimation is proposed. In the multiview encoder, adaptive disparity-motion estimation (DME) for an effective 3-dimensional (3D) processing are proposed. That is, by adaptively predicting the mutual correlation between stereo images in the key-frame using the proposed algorithm, the bandwidth of stereo input images can be compressed to the level of a conventional 2D image and a predicted image also can be effectively reconstructed using a reference image and adaptive disparity vectors. Also, in multiview decoder, intermediate view reconstruction (IVR) using adaptive disparity search algorithm (DSA) for real-time multiview video processing is proposed. The proposed IVR can reduce a processing time of disparity estimation by selecting adaptively disparity search range. Accordingly, the proposed multiview video coding system is able to increase the efficiency of the coding rate and improve the resolution.

비교 쇼핑 사이트들에 대한 효율적인 메타검색 기법 (An Efficient Meta-Search Scheme for Comparison Shopping Sites)

  • 조강의;조성제
    • 경영정보학연구
    • /
    • 제5권1호
    • /
    • pp.97-111
    • /
    • 2003
  • 인터넷 기반의 전자상거래가 확산되면서, 에이전트 기술을 사용한 비교 쇼핑 사이트들이 등장하여 쇼핑이 점차 편해지고 있다. 하지만, 이들 비교 쇼핑 사이트들이 동일 상품에 대해 서로 다른 가격을 보여줄 때도 있고, 또 어떤 사이트는 특정 상품에 대한 정보를 전혀 보여주지 못할 때가 많기 때문에, 여전히 대부분의 소비자들은 최적의 가격을 검색하기 위해 많은 시간을 소비하고 있다. 또한, 책이나 CD 등의 상품에 대한 가격 검색에서는 온라인 실시간 검색이 요구되므로 시스템 부하를 유발시켜 응답시간이 길어지게 된다. 이러한 문제를 해결하기 위해, 본 논문에서는 지역 데이터베이스와 메모리 캐시를 갖는 메타-비교 쇼핑 시스템을 설계하고 구현하였다. 제안된 시스템은 여러 소프트웨어 에이전트를 이용하여 기존 비교 쇼핑 사이트들에 대해 메타 검색을 수행함으로써, 인기검색 상품들에 대한 가격 정보를 수집하여 유지한다. 실험을 통해 제안 시스템이 효율적인 메타-비교 쇼핑 엔진으로 응답 시간의 지연을 줄여 주며 오버헤드도 적게 유발시킨다는 것을 보였다.

나노 인포매틱스 기반 구축을 위한 구글 트렌드와 데이터 마이닝 기법을 활용한 나노 기술 트렌드 분석 (Nano Technology Trend Analysis Using Google Trend and Data Mining Method for Nano-Informatics)

  • 신민수;박민규;배성훈
    • 산업경영시스템학회지
    • /
    • 제40권4호
    • /
    • pp.237-245
    • /
    • 2017
  • Our research is aimed at predicting recent trend and leading technology for the future and providing optimal Nano technology trend information by analyzing Nano technology trend. Under recent global market situation, Users' needs and the technology to meet these needs are changing in real time. At this point, Nano technology also needs measures to reduce cost and enhance efficiency in order not to fall behind the times. Therefore, research like trend analysis which uses search data to satisfy both aspects is required. This research consists of four steps. We collect data and select keywords in step 1, detect trends based on frequency and create visualization in step 2, and perform analysis using data mining in step 3. This research can be used to look for changes of trend from three perspectives. This research conducted analysis on changes of trend in terms of major classification, Nano technology of 30's, and key words which consist of relevant Nano technology. Second, it is possible to provide real-time information. Trend analysis using search data can provide information depending on the continuously changing market situation due to the real-time information which search data includes. Third, through comparative analysis it is possible to establish a useful corporate policy and strategy by apprehending the trend of the United States which has relatively advanced Nano technology. Therefore, trend analysis using search data like this research can suggest proper direction of policy which respond to market change in a real time, can be used as reference material, and can help reduce cost.