• 제어로봇시스템학회논문지
• /
• 제13권9호
• /
• pp.868-874
• /
• 2007

This paper proposes an efficient partial matching system and representation by using a region-based method for 2D image, and we applied to an extraction of the ROI(Region of Interest) according to its matching score. The matching templates consist of the global pattern and the local one. The global pattern can make it by using region-based relation between center region and its rest regions in an object. And, the local pattern can be obtained appling to the same method as global, except relation between objects. As the templates can be normalized, we use this templates for extraction of ROI with invariant to size and position. And, our system operates only one try to match, due to normalizing of region size. To use our system for searching and examining if it's the ROI by evaluating the matching function, at first, we are searching to find candidate regions with the global template. Then, we try to find the ROI among the candidates, and it works this time by using the local template. We experimented to the binary and the color image respectively, they showed that the proposed system can be used efficiently for representing of the template and the useful applications, such as partially retrievals of 2D image.

• 응용통계연구
• /
• 제31권6호
• /
• pp.707-719
• /
• 2018

시계열 데이터의 분류와 군집화를 효율적으로 수행하기 위해 다양한 시계열 표현 방법들이 제안되었다. 본 연구는 Lin 등 (2007)이 제안한 국소 평균 근사를 이용하여 시계열의 차원을 축소한 후 심볼릭 자료로 이산화하는 symbolic aggregate approximation (SAX) 방법의 개선에 대해서 연구하였다. SAX는 국소 평균 근사를 할 때 등간격으로 임의의 개수의 세그먼트로 나누어 평균을 계산하여 세그먼트의 개수에 그 성능이 크게 좌우된다. 따라서 본 논문은 불균형 Haar 웨이블릿 변환을 통해 국소 평균 수준을 등간격이 아니라 자료의 특성을 반영하여 자료 의존적으로 선택하게 함으로써 시계열의 차원을 효과적으로 축소함과 동시에 정보의 손실을 줄이는 방법에 대해서 제안한다. 제안한 방법은 실증 자료 분석을 통해 SAX 방법을 개선시킴을 확인하였다.

• 대한조선학회논문집
• /
• 제32권1호
• /
• pp.1-8
• /
• 1995

본 논문에서는 선수미부와 같이 Rounding, Landing, Bulb 등의 심한 형상변화를 요구하는 선형의 곡선설계에서 수학적 형상표현의 가능성을 찾아보고, 충분한 연속성과 국부적인 변형성을 갖는 NURBS 곡선을 이용한 선형의 수치적 표현기법을 연구하였다.

• Journal of Positioning, Navigation, and Timing
• /
• 제11권4호
• /
• pp.263-268
• /
• 2022

Precise Point Positioning-Real Time Kinematic (PPP-RTK) is a high accuracy positioning method that combines RTK and PPP to overcome the limitations on service coverage of RTK and convergence time of PPP. PPP-RTK provides correction data in the form of State Space Representation (SSR), unlike RTK, which provides measurement-based Observation Space Representation (OSR). Due to this, PPP-RTK has an advantage that it can transmit less data than RTK. So, recently, several techniques for PPP-RTK have been proposed. However, in order to utilize PPP-RTK techniques, performance analysis of these in a real environment is essential. In this paper, we implement the local network PPP-RTK and analyze the positioning performance according to the distance within 100 km from the reference station in Korea. As results of experiment, the horizontal and vertical 95% errors of local network PPP-RTK were 6.25 cm and 5.86 cm or less, respectively.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제15권1호
• /
• pp.1-14
• /
• 2011

Logo has influenced many researchers and learners for the past decades as a 20 turtle geometry environment in the perspective of constructionism. Logo uses the metaphor of 'playing turtle' that is intrinsic, local and procedural. We, then, design an environment in which the metaphor of 'playing turtle' is applied to construct 3D objects, and we figure out ways to represent 3D objects in terms action symbols and 3D building blocks. For this purpose, design three kinds of representation systems, and asked students make various 3D artifacts using various representation systems. We briefly introduce the results of our investigation into students' cognitive burden when they use those representation systems, and discuss the future application measures and the design principles of Logo-based 3D microworld.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2013년도 추계학술대회
• /
• pp.246-247
• /
• 2013

인간행동의 자동인식 기술은 영상보안 및 인간-사물 상호작용 분야에 핵심적 기술이다. 그러나 실제 비디오 환경에서는 인간 행동의 다양성 및 잡음 등 많은 제한점들로 인해 효과적인 행동인식에 어려움이 있다. 최근 이러한 문제점을 해결하기 위하여 많은 영상 처리 및 인식 분야에서 연구되고 있는 sparse representation 기반의 방법들이 제시되고 있다. 이에 본 논문에서는 효과적으로 sparse representation을 행동인식에 적용하고, sparse representation 기반 인간행동인식을 위해 사용되는 지역특징 및 전역특징에 대하여 비교했다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권6호
• /
• pp.2748-2766
• /
• 2016

Compared with traditional patch-based sparse representation, recent studies have concluded that group-based sparse representation (GSR) can simultaneously enforce the intrinsic local sparsity and nonlocal self-similarity of images within a unified framework. This article investigates an accelerated split Bregman method (SBM) that is based on GSR which exploits image compressive sensing (CS). The computational efficiency of accelerated SBM for the measurement matrix of a partial Fourier matrix can be further improved by the introduction of a fast Fourier transform (FFT) to derive the enhanced algorithm. In addition, we provide convergence analysis for the proposed method. Experimental results demonstrate that accelerated SBM is potentially faster than some existing image CS reconstruction methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권4호
• /
• pp.2109-2123
• /
• 2017

This paper presents a super-resolution reconstruction method based on sparse representation for two-dimensional bar code images. Considering the features of two-dimensional bar code images, Kirsch and LBP (local binary pattern) operators are used to extract the edge gradient and texture features. Feature extraction is constituted based on these two features and additional two second-order derivatives. By joint dictionary learning of the low-resolution and high-resolution image patch pairs, the sparse representation of corresponding patches is the same. In addition, the global constraint is exerted on the initial estimation of high-resolution image which makes the reconstructed result closer to the real one. The experimental results demonstrate the effectiveness of the proposed algorithm for two-dimensional bar code images by comparing with other reconstruction algorithms.

• 대한수학회보
• /
• 제57권1호
• /
• pp.167-177
• /
• 2020

Let I be an ideal of Noetherian local ring (R, m) and M an artinian R-module. In this paper, we study colocalization of local homology modules. In fact we give Colocal-global Principle for the artinianness and minimaxness of local homology modules, which is a dual case of Local-global Principle for the finiteness of local cohomology modules. We define the representation dimension r^I (M) of M and the artinianness dimension a^I (M) of M relative to I by r^I (M) = inf{i ∈ ℕ₀ : H^I_i (M) is not representable}, and a^I (M) = inf{i ∈ ℕ₀ : H^I_i (M) is not artinian} and we will prove that i) a^I (M) = r^I (M) = inf{r^IR_𝖕 (_𝖕M) : 𝖕 ∈ Spec(R)} ≥ inf{a^IR_𝖕 (_𝖕M) : 𝖕 ∈ Spec(R)}, ii) inf{i ∈ ℕ₀ : H^I_i (M) is not minimax} = inf{r^IR_𝖕 (_𝖕M) : 𝖕 ∈ Spec(R) ∖ {𝔪}}. Also, we define the upper representation dimension R^I (M) of M relative to I by R^I (M) = sup{i ∈ ℕ₀ : H^I_i (M) is not representable}, and we will show that i) sup{i ∈ ℕ₀ : H^I_i (M) ≠ 0} = sup{i ∈ ℕ₀ : H^I_i (M) is not artinian} = sup{R^IR_𝖕 (_𝖕M) : 𝖕 ∈ Spec(R)}, ii) sup{i ∈ ℕ₀ : H^I_i (M) is not finitely generated} = sup{i ∈ ℕ₀ : H^I_i (M) is not minimax} = sup{R^IR_𝖕 (_𝖕M) : 𝖕 ∈ Spec(R) ∖ {𝔪}}.

• Kyungpook Mathematical Journal
• /
• 제53권1호
• /
• pp.143-148
• /
• 2013

The theory of generalized Bessel functions is reformulated within the framework of an operational formalism using the multiplier representation of the Lie group $T_3$ as suggested by Miller. This point of view provides more efficient tools which allow the derivation of generating functions of generalized Bessel functions. A few special cases of interest are also discussed.