• Title/Summary/Keyword: vector space

Search Result 1,792, Processing Time 0.029 seconds

A Study on Efficient Storage Method for High Density Raster Data (고밀도 격자자료의 효율적 저장기법 연구)

  • JunJang, Young-Woon;Choi, Yun-Woong;Lee, Hyo-Jong;Cho, Gi-Sung
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.27 no.3
    • /
    • pp.401-408
    • /
    • 2009
  • A study for 3D-reconstruction and providing the geospatial information is in progress to many fields recently. For efficient providing the geospatial information, the present information has to be updated and be revised and then the latest geospatial information needs to be acquired economically. Especially, LiDAR system utilized in many study has a advantage to collect the 3D spacial data easily and densely that is possible to supply to the geospatial information. The 3D data of LiDAR is very suitable as a data for presenting 3D space, but in case of using the data without converting, the high performance processor is needed for presenting 2D forms from point data composed by 3D data. In comparison, basically the raster data structure of 2D form is more efficient than vector structure in cheap devices because of a simple structure and process speed. The purpose of this study, in case of supplying LiDAR data as 3D data, present the method that reconstructs to 2D raster data and convert to compression data applied by th tree construction in detail.

Interactive Shape Analysis of the Hippocampus in a Virtual Environment (가상 환경에서의 해마 모델에 대한 대화식 형상 분석☆)

  • Kim, Jeong-Sik;Choi, Soo-Mi
    • Journal of Internet Computing and Services
    • /
    • v.10 no.5
    • /
    • pp.165-181
    • /
    • 2009
  • This paper presents an effective representation scheme for the shape analysis of the hippocampal structure and a stereoscopic-haptic environment to enhance sense of realism. The parametric model and the 3D skeleton represent various types of hippocampal shapes and they are stored in the Octree data structure. So they can be used for the interactive shape analysis. And the 3D skeleton-based pose normalization allows us to align a position and an orientation of the 3D hippocampal models constructed from multimodal medical imaging data. We also have trained Support Vector Machine (SVM) for classifying between the normal controls and epileptic patients. Results suggest that the presented representation scheme provides various level of shape representation and the SVM can be a useful classifier in analyzing the shape differences between two groups. A stereoscopic-haptic virtual environment combining an auto-stereoscopic display with a force-feedback (or haptic) device takes an advantage of 3D applications for medicine because it improves space and depth perception.

  • PDF

Analysis of Code Sequence Generating Algorism and Implementation of Code Sequence Generator using Boolean Functions (부울함수를 이용한 부호계열 발생알고리즘 분석 부호계열발생기 구성)

  • Lee, Jeong-Jae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.13 no.4
    • /
    • pp.194-200
    • /
    • 2012
  • In this paper we analyze the code sequence generating algorism defined on $GF(2^n)$ proposed by S.Bostas and V.Kumar[7] and derive the implementation functions of code sequence generator using Boolean functions which can map the vector space $F_2^n$ of all binary vectors of length n, to the finite field with two elements $F_2$. We find the code sequence generating boolean functions based on two kinds of the primitive polynomials of degree, n=5 and n=7 from trace function. We then design and implement the code sequence generators using these functions, and produce two code sequence groups. The two groups have the period 31 and 127 and the magnitudes of out of phase(${\tau}{\neq}0$) autocorrelation and crosscorrelation functions {-9, -1, 7} and {-17, -1, 15}, satisfying the period $L=2^n-1$ and the correlation functions $R_{ij}({\tau})=\{-2^{(n+1)/2}-1,-1,2^{(n+l)/2}-1\}$ respectively. Through these results, we confirm that the code sequence generators using boolean functions are designed and implemented correctly.

Sensitivity of Feedback Channel Delay on Transmit Adaptive Array (적응형 송신 빔 성형을 적용한 CDMA 시스템의 귀환 채널 지연에 따른 성능)

  • 안철용;한진규;김동구
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6B
    • /
    • pp.579-585
    • /
    • 2002
  • The investigation into the effect of various feedback errors on system performance can help the robust feedback channel design and transmission of exact feedback channel information as well. In this paper, we address the algorithm that determines space combining weight vector maximizing received signal power at mobile on frequency flat fading channel and investigate the performance degradation by feedback channel delay in the FDD/CDMA systems employing transmit beamforming. We observe the effect of feedback channel delay corresponding to the number of transmit antennas and the temporal/spatial correlation of channel. The results show that performance is more sensitive to feedback delay with the larger number of antennas when fadings at transmit antennas are not spatially correlated.

Two-stage Content-based Image Retrieval Using the Dimensionality Condensation of Feature Vector (특징벡터의 차원축약 기법을 이용한 2단계 내용기반 이미지검색 시스템)

  • 조정원;최병욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7C
    • /
    • pp.719-725
    • /
    • 2003
  • The content-based image retrieval system extracts features of color, shape and texture from raw images, and builds the database with those features in the indexing process. The search in the whole retrieval system is defined as a process which finds images that have large similarity to query image using the feature database. This paper proposes a new two-stage search method in the content-based image retrieval system. The method is that the features are condensed and stored by the property of Cauchy-Schwartz inequality in order to reduce the similarity computation time which takes a mostly response time from entering a query to getting retrieval results. By the extensive computer simulations, we have observed that the proposed two-stage search method successfully reduces the similarity computation time while maintaining the same retrieval relevance as the conventional exhaustive search method. We also have observed that the method is more effective as the number of images and dimensions of the feature space increase.

State detection of explosive welding structure by dual-tree complex wavelet transform based permutation entropy

  • Si, Yue;Zhang, ZhouSuo;Cheng, Wei;Yuan, FeiChen
    • Steel and Composite Structures
    • /
    • v.19 no.3
    • /
    • pp.569-583
    • /
    • 2015
  • Recent years, explosive welding structures have been widely used in many engineering fields. The bonding state detection of explosive welding structures is significant to prevent unscheduled failures and even catastrophic accidents. However, this task still faces challenges due to the complexity of the bonding interface. In this paper, a new method called dual-tree complex wavelet transform based permutation entropy (DTCWT-PE) is proposed to detect bonding state of such structures. Benefiting from the complex analytical wavelet function, the dual-tree complex wavelet transform (DTCWT) has better shift invariance and reduced spectral aliasing compared with the traditional wavelet transform. All those characters are good for characterizing the vibration response signals. Furthermore, as a statistical measure, permutation entropy (PE) quantifies the complexity of non-stationary signals through phase space reconstruction, and thus it can be used as a viable tool to detect the change of bonding state. In order to more accurate identification and detection of bonding state, PE values derived from DTCWT coefficients are proposed to extract the state information from the vibration response signal of explosive welding structure, and then the extracted PE values serve as input vectors of support vector machine (SVM) to identify the bonding state of the structure. The experiments on bonding state detection of explosive welding pipes are presented to illustrate the feasibility and effectiveness of the proposed method.

Nonlinear Inference Using Fuzzy Cluster (퍼지 클러스터를 이용한 비선형 추론)

  • Park, Keon-Jung;Lee, Dong-Yoon
    • Journal of Digital Convergence
    • /
    • v.14 no.1
    • /
    • pp.203-209
    • /
    • 2016
  • In this paper, we introduce a fuzzy inference systems for nonlinear inference using fuzzy cluster. Typically, the generation of fuzzy rules for nonlinear inference causes the problem that the number of fuzzy rules increases exponentially if the input vectors increase. To handle this problem, the fuzzy rules of fuzzy model are designed by dividing the input vector space in the scatter form using fuzzy clustering algorithm which expresses fuzzy cluster. From this method, complex nonlinear process can be modeled. The premise part of the fuzzy rules is determined by means of FCM clustering algorithm with fuzzy clusters. The consequence part of the fuzzy rules have four kinds of polynomial functions and the coefficient parameters of each rule are estimated by using the standard least-squares method. And we use the data widely used in nonlinear process for the performance and the nonlinear characteristics of the nonlinear process. Experimental results show that the non-linear inference is possible.

SVM Kernel Design Using Local Feature Analysis (지역특징분석을 이용한 SVM 커널 디자인)

  • Lee, Il-Yong;Ahn, Jung-Ho
    • Journal of Digital Contents Society
    • /
    • v.11 no.1
    • /
    • pp.17-24
    • /
    • 2010
  • The purpose of this study is to design and implement a kernel for the support vector machine(SVM) to improve the performance of face recognition. Local feature analysis(LFA) has been well known for its good performance. SVM kernel plays a limited role of mapping low dimensional face features to high dimensional feature space but the proposed kernel using LFA is designed for face recognition purpose. Because of the novel method that local face information is extracted from training set and combined into the kernel, this method is expected to apply to various object recognition/detection tasks. The experimental results shows its improved performance.

Purification and Characterization of Clostridium thermocellum Xylanase from Recombinant Escherichia coli

  • Koo, Bon-Joon;Oh, Hwa-Gyun;Cho, Ki-Haeng;Yang, Chang-Kun;Jung, Kyung-Hwa;Ryu, Dai-Young
    • Journal of Microbiology and Biotechnology
    • /
    • v.6 no.6
    • /
    • pp.414-419
    • /
    • 1996
  • The xylnX gene encoding a xylanase from Clostridium thermocellum ATCC27405 was cloned in the plasmid pJH27, an E. coli-Bacillus shuttle vector and the resultant recombinant plasmid, pJX18 was transformed into E. coli HB101. The overexpressed xylanase was found to be secreted into the periplasmic space of the recombinant E. coli cells. The crude enzyme was obtained by treating the E. coli cells with lysozyme, and purified by DEAE-Sepharose column chromatography. Molecular wieght of the xylanase was estimated to be 53 kDa by gel filtration. The pI value was determined to be pH 8.8. The N-terminal sequence of the enzyme protein was Asp-Asp-Asn-Asn-Ala-Asn-Leu-Val-Ser-Asn which was considered to be the sequence of that of the mature form protein. The Km value of the enzyme for oat spelt xylan was calculated to be 2.63 mg/ml and the Vmax value was $0.47 {\mu}mole/min$. The xylanase had a pH optimum for its activity at pH 5.4 and a temperature optimum at $60^{\circ}C$. The enzyme hydrolyzed xylan into xylooligosaccharides which were composed mainly of xylobiose (40%) and xyloltriose (12%) after 5 hour reaction. This result indicates that the xylanase from C. thermocellum ATCC27405 is an endo-acting enzyme.

  • PDF

Realtime Facial Expression Control of 3D Avatar by Isomap of Motion Data (모션 데이터에 Isomap을 사용한 3차원 아바타의 실시간 표정 제어)

  • Kim, Sung-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.3
    • /
    • pp.9-16
    • /
    • 2007
  • This paper describe methodology that is distributed on 2-dimensional plane to much high-dimensional facial motion datas using Isomap algorithm, and user interface techniques to control facial expressions by selecting expressions while user navigates this space in real-time. Isomap algorithm is processed of three steps as follow; first define an adjacency expression of each expression data, and second, calculate manifold distance between each expressions and composing expression spaces. These facial spaces are created by calculating of the shortest distance(manifold distance) between two random expressions. We have taken a Floyd algorithm for it. Third, materialize multi-dimensional expression spaces using Multidimensional Scaling, and project two dimensions plane. The smallest adjacency distance to define adjacency expressions uses Pearson Correlation Coefficient. Users can control facial expressions of 3-dimensional avatar by using user interface while they navigates two dimension spaces by real-time.