• Title/Summary/Keyword: scene detection

Search Result 519, Processing Time 0.029 seconds

A Real-time Motion Object Detection based on Neighbor Foreground Pixel Propagation Algorithm (주변 전경 픽셀 전파 알고리즘 기반 실시간 이동 객체 검출)

  • Nguyen, Thanh Binh;Chung, Sun-Tae
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.1
    • /
    • pp.9-16
    • /
    • 2010
  • Moving object detection is to detect foreground object different from background scene in a new incoming image frame and is an essential ingredient process in some image processing applications such as intelligent visual surveillance, HCI, object-based video compression and etc. Most of previous object detection algorithms are still computationally heavy so that it is difficult to develop real-time multi-channel moving object detection in a workstation or even one-channel real-time moving object detection in an embedded system using them. Foreground mask correction necessary for a more precise object detection is usually accomplished using morphological operations like opening and closing. Morphological operations are not computationally cheap and moreover, they are difficult to be rendered to run simultaneously with the subsequent connected component labeling routine since they need quite different type of processing from what the connected component labeling does. In this paper, we first devise a fast and precise foreground mask correction algorithm, "Neighbor Foreground Pixel Propagation (NFPP)" which utilizes neighbor pixel checking employed in the connected component labeling. Next, we propose a novel moving object detection method based on the devised foreground mask correction algorithm, NFPP where the connected component labeling routine can be executed simultaneously with the foreground mask correction. Through experiments, it is verified that the proposed moving object detection method shows more precise object detection and more than 4 times faster processing speed for a image frame and videos in the given the experiments than the previous moving object detection method using morphological operations.

A Vanishing Point Detection Method Based on the Empirical Weighting of the Lines of Artificial Structures (인공 구조물 내 직선을 찾기 위한 경험적 가중치를 이용한 소실점 검출 기법)

  • Kim, Hang-Tae;Song, Wonseok;Choi, Hyuk;Kim, Taejeong
    • Journal of KIISE
    • /
    • v.42 no.5
    • /
    • pp.642-651
    • /
    • 2015
  • A vanishing point is a point where parallel lines converge, and they become evident when a camera's lenses are used to project 3D space onto a 2D image plane. Vanishing point detection is the use of the information contained within an image to detect the vanishing point, and can be utilized to infer the relative distance between certain points in the image or for understanding the geometry of a 3D scene. Since parallel lines generally exist for the artificial structures within images, line-detection-based vanishing point-detection techniques aim to find the point where the parallel lines of artificial structures converge. To detect parallel lines in an image, we detect edge pixels through edge detection and then find the lines by using the Hough transform. However, the various textures and noise in an image can hamper the line-detection process so that not all of the lines converging toward the vanishing point are obvious. To overcome this difficulty, it is necessary to assign a different weight to each line according to the degree of possibility that the line passes through the vanishing point. While previous research studies assigned equal weight or adopted a simple weighting calculation, in this paper, we are proposing a new method of assigning weights to lines after noticing that the lines that pass through vanishing points typically belong to artificial structures. Experimental results show that our proposed method reduces the vanishing point-estimation error rate by 65% when compared to existing methods.

Extracting Beginning Boundaries for Efficient Management of Movie Storytelling Contents (스토리텔링 콘텐츠의 효과적인 관리를 위한 영화 스토리 발단부의 자동 경계 추출)

  • Park, Seung-Bo;You, Eun-Soon;Jung, Jason J.
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.279-292
    • /
    • 2011
  • Movie is a representative media that can transmit stories to audiences. Basically, a story is described by characters in the movie. Different from other simple videos, movies deploy narrative structures for explaining various conflicts or collaborations between characters. These narrative structures consist of 3 main acts, which are beginning, middle, and ending. The beginning act includes 1) introduction to main characters and backgrounds, and 2) conflicts implication and clues for incidents. The middle act describes the events developed by both inside and outside factors and the story dramatic tension heighten. Finally, in the end act, the events are developed are resolved, and the topic of story and message of writer are transmitted. When story information is extracted from movie, it is needed to consider that it has different weights by narrative structure. Namely, when some information is extracted, it has a different influence to story deployment depending on where it locates at the beginning, middle and end acts. The beginning act is the part that exposes to audiences for story set-up various information such as setting of characters and depiction of backgrounds. And thus, it is necessary to extract much kind information from the beginning act in order to abstract a movie or retrieve character information. Thereby, this paper proposes a novel method for extracting the beginning boundaries. It is the method that detects a boundary scene between the beginning act and middle using the accumulation graph of characters. The beginning act consists of the scenes that introduce important characters, imply the conflict relationship between them, and suggest clues to resolve troubles. First, a scene that the new important characters don't appear any more should be detected in order to extract a scene completed the introduction of them. The important characters mean the major and minor characters, which can be dealt as important characters since they lead story progression. Extra should be excluded in order to extract a scene completed the introduction of important characters in the accumulation graph of characters. Extra means the characters that appear only several scenes. Second, the inflection point is detected in the accumulation graph of characters. It is the point that the increasing line changes to horizontal line. Namely, when the slope of line keeps zero during long scenes, starting point of this line with zero slope becomes the inflection point. Inflection point will be detected in the accumulation graph of characters without extra. Third, several scenes are considered as additional story progression such as conflicts implication and clues suggestion. Actually, movie story can arrive at a scene located between beginning act and middle when additional several scenes are elapsed after the introduction of important characters. We will decide the ratio of additional scenes for total scenes by experiment in order to detect this scene. The ratio of additional scenes is gained as 7.67% by experiment. It is the story inflection point to change from beginning to middle act when this ratio is added to the inflection point of graph. Our proposed method consists of these three steps. We selected 10 movies for experiment and evaluation. These movies consisted of various genres. By measuring the accuracy of boundary detection experiment, we have shown that the proposed method is more efficient.

A Fast Scene Change Detection Algorithm using Direct Feature Extraction from MPEG Compressed Videos (MPEG 압축 비디오로부터 특징 정보의 직접 추출을 통한 바른 장면 전환 검출 알고리즘)

  • 김영민;이성환
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10b
    • /
    • pp.404-406
    • /
    • 1999
  • 비디오 데이터의 효율적인 저장, 관리를 위해서는 장면 전환 검출을 통한 비디오 분할 기술에 대한 연구가 필요하므로, 최근 들어 압축 비디오상의 특징 정보를 직접 추출하여 장면 전환 검출에 사용하는 방법에 대한 연구가 많이 이루어지고 있다. 본 논문에서는 MPEG 압축 비디오 상의 에지 정보를 복호화 과정을 거치지 않고 직접 추출하여 장면 전환 검출에 사용하는 새로운 방법을 제안하였다. 이산 여현 변환(DCT)된 블록내 AC 계수의 부호를 통해 에지의 모양을 알아내었으며, AC 계수간의 상관 관계를 통해 에지의 방향과 세기를 측정하여 프레임을 정합하는 방법을 사용하였다. 실험 결과 사용한 특징 정보가 명도나 색상 변환에 무관하여 잘못 검출하는 비율이 현저히 적었으며, 영상을 완전 복호화한 후 에지를 구하여 장면 전환 검출을 하는 방법에 비해 약 5-6배 속도가 빠름을 확인할 수 있었다.

  • PDF

Extraction of Assault and Violence-in Elevator (폭행 및 폭력의 추출-엘리베이터 내에서)

  • Shin, Seong-Yoon;Lee, Hyun-Chang
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2013.01a
    • /
    • pp.95-97
    • /
    • 2013
  • 현재 엘리베이터 내에서는 수많은 범죄들이 발생하고 있으며, 그 대담성 또한 날로 증가하고 있다. 본 논문에서는 불법한 유형력의 행사인 폭행과 이러한 폭행에 동반되는 물리적인 행사인 폭력에 대하여 의미를 알아본다. 그리고 엘리베이터 내에서 발생하는 폭행과 폭력을 추출하는 방법을 제시하도록 한다. 장면 전환 검출 방법 중의 하나인 컬러히스토그램 기법을 사용하여 키프레임을 추출한다. 추출된 키 프레임들은 영상 포렌식에서 범죄 현장을 담은 장면의 증거자료인 프레임이 된다.

  • PDF

3D Depth Measurement System-based Unpaved Trail Recognition for Mobile Robots (이동 로봇을 위한 3차원 거리 측정 장치기반 비포장 도로 인식)

  • Gim Seong-Chan;Kim Jong-Man;Kim Hyong-Suk
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.4
    • /
    • pp.395-399
    • /
    • 2006
  • A method to recognize unpaved road region using a 3D depth measurement system is proposed for mobile robots. For autonomous maneuvering of mobile robots, recognition of obstacles or recognition of road region is the essential task. In this paper, the 3D depth measurement system which is composed of a rotating mirror, a line laser and mono-camera is employed to detect depth, where the laser light is reflected by the mirror and projected to the scene objects whose locations are to be determined. The obtained depth information is converted into an image. Such depth images of the road region represent even and plane while that of off-road region is irregular or textured. Therefore, the problem falls into a texture identification problem. Road region is detected employing a simple spatial differentiation technique to detect the plain textured area. Identification results of the diverse situation of unpaved trail are included in this paper.

Voting based Cue Integration for Visual Servoing

  • Cho, Che-Seung;Chung, Byeong-Mook
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.798-802
    • /
    • 2003
  • The robustness and reliability of vision algorithms is the key issue in robotic research and industrial applications. In this paper, the robust real time visual tracking in complex scene is considered. A common approach to increase robustness of a tracking system is to use different models (CAD model etc.) known a priori. Also fusion of multiple features facilitates robust detection and tracking of objects in scenes of realistic complexity. Because voting is a very simple or no model is needed for fusion, voting-based fusion of cues is applied. The approach for this algorithm is tested in a 3D Cartesian robot which tracks a toy vehicle moving along 3D rail, and the Kalman filter is used to estimate the motion parameters, namely the system state vector of moving object with unknown dynamics. Experimental results show that fusion of cues and motion estimation in a tracking system has a robust performance.

  • PDF

Matching Algorithm for PCB Inspection Using Vision System (Vision System을 이용한 PCB 검사 매칭 알고리즘)

  • An, Eung-Seop;Jang, Il-Young;Lee, Jae-Kang;Kim, Il-Hwan
    • Journal of Industrial Technology
    • /
    • v.21 no.B
    • /
    • pp.67-74
    • /
    • 2001
  • According as the patterns of PCB (Printed Circuit Board) become denser and complicated, quality and accuracy of PCB influence the performance of final product. It's attempted to obtain trust of 100% about all of parts. Because human inspection in mass-production manufacturing facilities are both time-consuming and very expensive, the automation of visual inspection has been attempted for many years. Thus, automatic visual inspection of PCB is required. In this paper, we used an algorithm which compares the reference PCB patterns and the input PCB patterns are separated an object and a scene by filtering and edge detection. And than compare two image using pattern matching algorithm. We suggest an defect inspection algorithm in PCB pattern, to be satisfied low cost, high speed, high performance and flexibility on the basis of $640{\times}480$ binary pattern.

  • PDF

Scene Change Detection by the Comparison of Strong Edge Blocks (강한 에지 블록의 비교에의한 장면 전환 검출)

  • 송한새;김일구;조남익
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.385-388
    • /
    • 2001
  • 본 논문에서는 비디오 영상에서 장면 전환을 검출하는 알고리듬을 제안한다. 장면 전환 검출은 비디오 프레임 사이의 유사도를 측정하여 이루어 진다. 유사도는 비디오 영상의 특성을 나타내는 지표를 추출하고 이를 비교함으로써 얻어진다. 비디오 영상의 특성 지표는 비디오 영상 전체에서 추출하는 것이 일반적이나 제안하는 알고리듬에서는 비디오 영상에서 강한 에지 부분을 포함하는 여러개의 블록에서만 추출된다. 이렇게 함으로써 배경보다 더 중요한 정보를 가진 에지 주변의 칼라 변화에 집중하는 효과를 얻게된다. 실험 결과는 강한 에지 블록에서 얻은 지표가 점진적 장면 전환(dissolve, wipe) 검출에 효과적임을 보여준다. 제안하는 알고리듬은 또한 Cut탐지에도 비교적 좋은 성능을 보인다. 그리고 Fade-in/out을 간단하면서 효과적으로 탐지할 수 있는 방법을 제시한다.

  • PDF

An Anchor-frame Detection Algorithm in MPEG News Data using DC component extraction and Color Clustering (MPEG으로 압축된 뉴스 데이터에서의 DC성분 추출과 컬러 클러스터링을 이용한 앵커 프레임 검색 기법)

  • 정정훈;이근섭;오화종;최병욱
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.729-732
    • /
    • 2000
  • 대용량 비디오 데이터의 이용에 있어 효과적인 비디오 검색을 위해서는 비디오 데이터의 색인 과정이 필요하다. 효과적인 비디오 데이터의 색인을 위해서는 의미적 단위인 씬(Scene)으로 이루어진 비디오 데이터를 물리적인 경계면인 컷(장면전환점)으로 검출하는 기법이 필수적이며 각 샷에서의 키 프레임 추출 또한 필수적이다. 본 논문에서는 뉴스 비디오데이터의 키 프레임인 앵커 프레임의 효과적인 검색을 위해 DC 성분 추출과 이진 검색기법, 그리고 컬러 클러스터링을 이용하고 있다. 본 논문에서 제하고 있는 방법을 검증하기 위해서 47분 10초 분량의 MPEG-2 로 압축된 뉴스 비디오 데이터에 적용한 결과 91.3%의 정확도와 84.0%의 재현율을 보여 제안한 방법의 우수성을 증명하고 있다.

  • PDF