• Title/Summary/Keyword: 평균 이동 분할

Search Result 228, Processing Time 0.036 seconds

Comparison of the covariance matrix for general linear model (일반 선형 모형에 대한 공분산 행렬의 비교)

  • Nam, Sang Ah;Lee, Keunbaik
    • The Korean Journal of Applied Statistics
    • /
    • v.30 no.1
    • /
    • pp.103-117
    • /
    • 2017
  • In longitudinal data analysis, the serial correlation of repeated outcomes must be taken into account using covariance matrix. Modeling of the covariance matrix is important to estimate the effect of covariates properly. However, It is challenging because there are many parameters in the matrix and the estimated covariance matrix should be positive definite. To overcome the restrictions, several Cholesky decomposition approaches for the covariance matrix were proposed: modified autoregressive (AR), moving average (MA), ARMA Cholesky decompositions. In this paper we review them and compare the performance of the approaches using simulation studies.

Feature Point Tracking using Subregion Features (분할 영역 특성을 이용한 특징점 추적 기법)

  • 이대호;박세제;박영태
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10b
    • /
    • pp.373-375
    • /
    • 2001
  • 본 논문에서는 연속된 프레임에서 특징점을 추출하고 특징점의 유사도를 Hough 공간에 누적하여 정확한 이동을 찾아내는 기법을 제시한다. 특징점은 예지의 시작점, 끝점, 분기점과 굴곡점을 사용한다. 정합을 위하여 특징점 주위의 평균 밝기, 굴곡점의 굴곡각을 이용하며, 물체 주위에 물체보다 특징이 강한 배경에 민감하지 않게 동작하기 위하여 Hough 공간상의 극대값들에 대하여, 분할 영역의 평균과 표준 편차를 비교함으로써 정확한 이동 경로를 산출한다. 제안하는 알고리즘을 실제 영상에 적응한 경우 배경의 특징이 매우 강한 경우 Hough 공간의 최대값을 찾는 기법이 해결할 수 없는 부분도 정확히 추적하는 결과를 보인다.

  • PDF

Cleaning Method of Impulse Noise Using Mean Shift Segmentation (평균이동 분할을 이용한 임펄스 잡음제거)

  • Kwon, Young-Man;Lim, Myung-Jae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.163-168
    • /
    • 2009
  • In this paper, We proposed the efficient method of cleaning impulse noise using mean shift segmentation. This method do its job for the pixel which is identified as impulse noise using mean shift segmentation instead of all pixel of image by the existing method. we found that the quality of image is improved by measuring the sum of square error in result image and impulse noise is cleaned efficiently by doing experiment.

  • PDF

Smartphone Based Retouching Method for Watercolor Painting Effect Using Mean Shift Segmentation (Mean Shift Segmentation을 이용한 스마트폰 기반의 수채화 효과 변환 기법)

  • Lee, Sang-Geol;Kim, Cheol-Ki;Cha, Eui-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.11
    • /
    • pp.2413-2418
    • /
    • 2010
  • We propose a retouching method that converts a photography taken by smartphone to a watercolor painting image using bilateral filtering and mean shift segmentation which are mostly used in image processing. The first step is to convert an input image to fit the screen resolution of smartphone. And next step is to weaken high frequency components of the image, while preserving the edge of image using the bilateral filtering. And after that we perform mean shift segmentation from the bilateral filtered image. We apply parameters of mean shift segmentation considering the processing speed of smartphone. Experimental result shows that our method can be applied to various types of image and bring better result.

Smartphone Based Retouching Method for Watercolor Painting Effect Using Mean Shift Segmentation (Mean Shift Segmentation을 이용한 스마트폰 기반의 수채화 효과 변환 기법)

  • Lee, Sang-Geol;Kim, Cheol-Ki;Cha, Eui-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.206-208
    • /
    • 2010
  • We propose a retouching method that converts a photography taken by smartphone to a watercolor painting image using bilateral filtering and mean shift segmentation which are mostly used in image processing. The first step is to convert an input image to fit the screen resolution of smartphone. And next step is to weaken high frequency components of the image, while preserving the edge of image using the bilateral filtering. And after that we perform mean shift segmentation from the bilateral filtered image. We apply parameters of mean shift segmentation considering the processing speed of smartphone. Experimental result shows that our method can be applied to various types of image and bring better result.

  • PDF

Ship Detection Using Visual Saliency Map and Mean Shift Algorithm (시각집중과 평균이동 알고리즘을 이용한 선박 검출)

  • Park, Jang-Sik
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.2
    • /
    • pp.213-218
    • /
    • 2013
  • In this paper, a video based ship detection method is proposed to monitor port efficiently. Visual saliency map algorithm and mean shift algorithm is applied to detect moving ships don't include background information which is difficult to track moving ships. It is easy to detect ships at the port using saliency map algorithm, because it is very effective to extract saliency object from background. To remove background information in the saliency region, image segmentation and clustering using mean shift algorithm is used. As results of detecting simulation with images of a camera installed at the harbor, it is shown that the proposed method is effective to detect ships.

Comparison of Pedestrian Walking Characteristics Between Highway Crosswalk and Pedestrian Underpass (횡단보도와 지하보도간의 횡단보행특성 비교)

  • 임종훈;김동녕
    • Journal of Korean Society of Transportation
    • /
    • v.18 no.5
    • /
    • pp.17-29
    • /
    • 2000
  • 본 연구는 지하횡단보도 이용시 계단에서 나타나는 보행자 특성에 관한 연구로써, 교차로에서 횡단보도와 지하보도에서 보행자의 편의성을 정량화한 것이다. 지하보도 계단에서의 보행자특성에 관한 연구, 즉 속도, 밀도와 보행자교통량에 관한 연구는 비디오촬영을 통하여 수집한 자료를 분석하였다. 지하보도나 횡단보도 횡단시 이동 거리, 소요시간, 소요에너지는 보행자특성 분석에서 나온 결과와 직접 시설을 조사한 자료를 이용하여 비교하였다. 주요 연구결과는 다음과 같다. 첫째, 지하보도 계단에서 보행자 속도는 상향이동시의 평균속도는 37.7m/분(또는 0.67m/초)이고, 하향이동시의 평균속도는 46.7m/분(또는 0.77m/초)으로 나타났다. 둘째, 평균 이동거리는 단순횡단의 경우 지하보도는 119m이고, 횡단보도는 78m이다. 대각횡단의 경우 지하 보도는 161m이고, 횡단보도는 111m이다. 평균 소요시간은 단순횡단의 경우 지하보도는 125.6초이고, 횡단보도는 111.3초로 나타났다. 대각횡단의 경우 지하보도는 162.3초이고, 횡단보도는 178.8초로 나타났다. 평균 소요에너지는 단순횡단의 경우 지하보도는 20.2kcal이고, 횡단보도는 4.7kcal이다. 대각횡단의 경우 지하보도는 23.5kcal이고, 횡단보도는 6.6kcal이다. 단순횡단시 지하보도가 횡단보도보다 이동거리는 평균 1.5배 더 길고, 시간은 평균 1.2배 더 소요되고, 에너지는 평균 4.5배가 더 소요된다. 대각횡단시 이동거리는 평균 1.5배 더 길고, 소요시간은 비슷하고, 에너지는 평균 3.5배 더 소요되었다. 본 연구는 기존의 교차로나 가로구간에 지하보도만 설치되어 있는 지점에 횡단보도의 설치여부에 관한 정책결정을 하는데 도움이 될 수 있을 것이다.

  • PDF

A Study on Efficient Split Algorithm for Minimum Bounding Box of Moving Object Trajectoty (이동 객체 궤적의 최소경계사각형 영역을 효율적으로 분할하는 알고리즘에 관한 연구)

  • Park, Ju-Hyun;Cho, Woo-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.1
    • /
    • pp.110-116
    • /
    • 2013
  • With the recent development of wireless network technologies, there have been increasing usage of variouse position base servies. Position based services basically collect position information of moving object for the utilization of them in real life. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. In the paper, we consider volume of Extended Minimum Bounding Rectangles(EMBR) to be determined by average size of range queries. We proposed the methode that split efficiently moving object with long distance between location, and split moving object for decrease searching space an Estimated-Split algorithm that minimizes the volume of MBRs is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy.

An Improved Split Algorithm for Indexing of Moving Object Trajectories (이동 객체 궤적의 색인을 위한 개선된 분할 알고리즘)

  • Jeon, Hyun-Jun;Park, Ju-Hyun;Park, Hee-Suk;Cho, Woo-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.2
    • /
    • pp.161-168
    • /
    • 2009
  • Recently, use of various position base servicesthat collect position information for moving object and utilize in real life is increasing by the development of wireless network technology. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. This paper addresses an improved trajectory split algorithm for the purpose of efficiently supporting spatio-temporal range queries using index structures that use Minimum Bounding Rectangles(MBR) as trajectory approximations. We consider volume of Extended Minimum Bounding Rectangles (EMBR) to be determined by average size of range queries. Also, Use a priority queue to speed up our process. This algorithm gives in general sub-optimal solutions with respect to search space. Our improved trajectory split algorithm is going to derive minimizing volume of EMBRs better than previously proposed split algorithm.

A Road Extraction Algorithm using Mean-Shift Segmentation and Connected-Component (평균이동분할과 연결요소를 이용한 도로추출 알고리즘)

  • Lee, Tae-Hee;Hwang, Bo-Hyun;Yun, Jong-Ho;Park, Byoung-Soo;Choi, Myung-Ryul
    • Journal of Digital Convergence
    • /
    • v.12 no.1
    • /
    • pp.359-364
    • /
    • 2014
  • In this paper, we propose a method for extracting a road area by using the mean-shift method and connected-component method. Mean-shift method is very effective to divide the color image by the method of non-parametric statistics to find the center mode. Generally, the feature points of road are extracted by using the information located in the middle and bottom of the road image. And it is possible to extract a road region by using this feature-point and the partitioned color image. However, if a road region is extracted with only the color information and the position information of a road image, it is possible to detect not only noise but also off-road regions. This paper proposes the method to determine the road region by eliminating the noise with the closing / opening operation of the morphology, and by extracting only the portion of the largest area using a connected-components method. The proposed method is simulated and verified by applying the captured road images.