• 대한수학회지
• /
• 제54권1호
• /
• pp.215-225
• /
• 2017

In this paper, we study some equivalence relations between continuous frames in a Hilbert space ${\mathcal{H}}$. In particular, we seek two necessary and sufficient conditions under which two continuous frames are near. Moreover, we investigate a distance between continuous frames in order to acquire the closest and nearest tight continuous frame to a given continuous frame. Finally, we implement these results for shearlet and wavelet frames in two examples.

• International Journal of Contents
• /
• 제12권1호
• /
• pp.1-5
• /
• 2016

To manipulate large video contents, effective video indexing and retrieval are required. A large number of video indexing and retrieval algorithms have been presented for frame-wise user query or video content query whereas a relatively few video sequence matching algorithms have been proposed for video sequence query. In this paper, we propose an efficient algorithm that extracts key frames using color histograms and matches the video sequences using edge features. To effectively match video sequences with a low computational load, we make use of the key frames extracted by the cumulative measure and the distance between key frames, and compare two sets of key frames using the modified Hausdorff distance. Experimental results with real sequence show that the proposed video sequence matching algorithm using edge features yields the higher accuracy and performance than conventional methods such as histogram difference, Euclidean metric, Battachaya distance, and directed divergence methods.

• 융합신호처리학회논문지
• /
• 제7권1호
• /
• pp.11-16
• /
• 2006

To manipulate large video databases, effective video indexing and retrieval are required. A large number of video indexing and retrieval algorithms have been presented for frame-w]so user query or video content query whereas a relatively few video sequence matching algorithms have been proposed for video sequence query. In this paper, we propose an efficient algorithm to extract key frames using color histograms and to match the video sequences using edge features. To effectively match video sequences with low computational load, we make use of the key frames extracted by the cumulative measure and the distance between key frames, and compare two sets of key frames using the modified Hausdorff distance. Experimental results with several real sequences show that the proposed video retrieval algorithm using color and edge features yields the higher accuracy and performance than conventional methods such as histogram difference, Euclidean metric, Battachaya distance, and directed divergence methods.

• 한국컴퓨터산업학회논문지
• /
• 제4권4호
• /
• pp.569-578
• /
• 2003

본 논문은 광학식 얼굴 모션 캡쳐 데이터를 재사용하여 원하는 얼굴 표정 애니메이션을 실시간에 생성하는 방법을 기술한다. 이 방법의 핵심요소는 얼굴 표정들 간의 거리를 정의하고 이를 이용하여 표정들을 적당한 공간에 분포시키는 방법과 이 공간을 사용하여 실시간 표정 애니메이션을 생성하기 위한 사용자 인터페이스 기법이다. 우리는 약 2400여개의 얼굴 표정 프레임 데이터를 이용하여 공간을 생성하였다. 그리고 사용자가 이 공간을 자유롭게 항해할 때, 항해경로 상에 위치한 얼굴 표정 프레임 데이터들이 연속적으로 선택되어 하나의 애니메이션이 생성되도록 하였다. 약 2400여개의 얼굴 표정 프레임 데이터들을 직관적인 공간상에 분포하기 위해서는 데이터와 데이터 사이의 거리를 계산해야할 필요가 있고, 각 데이터와 데이터 사이의 최단거리를 구하는데 있어서는 Floyd 알고리즘을 사용하며, 이를 이용하여 Manifold distance를 구한다. 직관적인 공간에서의 데이터 배치는 얼굴 표정 프레임 데이터들의 Manifold distance를 이용하여 Multidimensional Scaling을 적용하고, 이로부터 2D 평면에 균일하게 분포하였다. 우리는 이와 같은 방법으로 기존의 얼굴 표정 프fp임 데이터들 사이의 거리를 원형 그대로 살리면서 의미 있게 직관적인 공간에 분포한다. 그러므로 본 논문에서 제시한 기법은 사용자가 항해하고자 하는 얼굴 표정 프레임 데이터들이 항상 주변에 존재할 수 있기 때문에, 얼굴 표정 애니메이션을 생성하기 위해서 직관적인 공간을 제한 없고 자유로운 항해를 할 수 있다는 큰 장점을 가지고 있다. 또한 사용자가 원하는 얼굴 표정 애니메이션을 사용하기 쉬운 사용자 인터페이스를 이용하여 실시간으로 생성하여 확인 하고 재생성할 수 있다는 것도 매우 효율적이다.

• 대한음성학회지:말소리
• /
• 제56호
• /
• pp.195-206
• /
• 2005

Discrimination between speech and music is important in many multimedia applications. In this paper, focusing on the spectral change characteristics of speech and music, we propose a new method of speech/music discrimination based on cepstral distance. Instead of using cepstral distance between the frames with fixed interval, the minimum of cepstral distances among neighbor frames is employed to increase discriminability between fast changing music and speech. And, to prevent misclassification of speech segments including short pause into music, short pause segments are excluded from computing cepstral distance. The experimental results show that proposed method yields the error rate reduction of$68\%$, in comparison with the conventional approach using cepstral distance.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.621-624
• /
• 1999

This paper describes a distance estimation method of object's motion in soccer image sequence by tracking field features. And we quantitatively evaluate the estimation accuracy We suppose that the input image sequence is taken with a camera on static axis and includes only zooming and panning transformation between frames. Adaptive template matching is adopted for non-rigid object tracking. For background compensation, feature templates selected from reference frame image are matched in following frames and the matched feature point pairs are used in computing Affine motion parameters. A perspective displacement field model is used for estimating the real distance between two position on Input Image. To quantitatively evaluate the accuracy of the estimation, we synthesized a 3 dimensional virtual stadium with graphic tools and experimented on the synthesized 2 dimensional image sequences. The experiment shows that the average of the error between the actual moving distance and the estimated distance is 1.84%.

• 대한전자공학회논문지
• /
• 제23권2호
• /
• pp.206-216
• /
• 1986

In this paper, the moving distance and velocity of a single moving object are measured by sampling three frames in a two-dimensional line sequence image. The brightness of each frame is analyzed, and the bit data of their pixel are rearranged so that the difference image may be extracted. The parameters for recognition of the object are the gray level of the object, the number of vertex points and the distance between the vertex points. The moving distance obtained from the coordinate which is constructed by the bit processing of the data in the memory map of a microcomputer, and the moving velocity is obtained from the moving distance and the time interval between the first and second sampled frames.

• International Journal of Contents
• /
• 제6권3호
• /
• pp.5-9
• /
• 2010

To manage large database system with video, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for frame-wise user query or video content query, whereas a few video identification algorithms have been proposed for video sequence query. In this paper, we propose an effective video identification algorithm for video sequence query that employs the Cauchy function of histograms between successive frames and the modified Hausdorff distance. To effectively match the video sequences with a low computational load, we make use of the key frames extracted by the cumulative Cauchy function and compare the set of key frames using the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed algorithm for video identification yields remarkably higher performance than conventional algorithms such as Euclidean metric, and directed divergence methods.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1987년도 춘계학술발표회 논문집
• /
• pp.56-59
• /
• 1987

In this study the moving information extraction techniques of moving objects are processed digital imaqe data by sampling three frames in a fixed-bacqround two-dimensional line sequence image the brightness of interframe are compared to extract difference image and difference image are two level formed and neighber averged From neigbber averaged image the parameters for recoqnition of the object are the number of contorur pixels, the number of vertex points and the distance between the vertex points Agtercomparing the same object the moving distance obtained from the coordinate which is constructed by the bit processing of the digital data and the moving velocity is obtained from the moving distance and the time interval between the first andsecond sampled frames.

• 한국컴퓨터정보학회논문지
• /
• 제13권1호
• /
• pp.75-80
• /
• 2008

본 논문에서는 프레임들의 차이값으로부터 카메라 브레이크에 의해 발생하는 큰 변화의 폭을 갖는 경계지점을 추출하는 전역적 결정트리를 이용하여 샷 경계를 검출하는 방법을 제시한다. 먼저 지적 $X^2$ 히스토그램과 정규화를 통하여 프레임 간 차이값을 계산하고, 다음으로 차이값간의 거리를 정규화를 통하여 계산한다. 계산된 차이값간의 거리를 바탕으로 전역적 임계치 거리를 계산하여 인접한 두 프레임들에 대한 거리값과 전역적 임계치 거리를 비교하여 샷 경계를 검출한다. 본 논문에서 제시한 전역적 결정트리를 이용하여 객체나 카메라의 움직임과 플래시 라이트와 같은 갑작스런 장면 변화를 쉽게 검출할 수 있다.