• 제목/요약/키워드: Two-dimension

검색결과 1,804건 처리시간 0.027초

의류상품 유형별 평가기준에 관한 연구(II) (A Study on Clothing evaluative Criteria of Various Clothing Items (II))

  • 김미영
    • 대한가정학회지
    • /
    • 제26권3호
    • /
    • pp.1-12
    • /
    • 1988
  • The objectives of the study were two folds. The first objective was to determine the dimensions of the evaluative criteria of various clothing items (underwear, pajamas, jeans, blouse, two-piece, coat). The second objective was to compare the importance of the dimensions according to the clothing items and the socioeconomic status of the subjects. The questionnaires were administered to college female students living in Seoul. Principal component factor analysis with varimax rotation and ANOVA were used for the analysis. The results were as follows; 1) The evaluative criteria dimensions were found to be different according to clothing items. (1) In underwear, pajamas, jeans, evaluative criteria were classified into Aesthetic dimension, economic dimension and Functional dimension. (2) In blouse, two-piece, coat, evaluative criteria were classified into Aesthetic dimension and practical dimension. 2) there were partially significant differences in placing importance on each evaluative criteria dimension between socio-economic groups. (1) In jeans, there was a significant difference in placing importance on Aesthetic dimension between socioeconomic status groups. (2) In blouse and two-piece there was a significant difference in placing importance on Practical dimension between socioeconomic status groups.

  • PDF

Image Enhancement for Two-dimension bar code PDF417

  • Park, Ji-Hue;Woo, Hong-Chae
    • 한국정보기술응용학회:학술대회논문집
    • /
    • 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
    • /
    • pp.69-72
    • /
    • 2005
  • As life style becomes to be complicated, lots of support technologies were developed. The bar code technology is one of them. It was renovating approach to goods industry. However, data storage ability in one dimension bar code came in limit because of industry growth. Two-dimension bar code was proposed to overcome one-dimension bar code. PDF417 bar code most commonly used in standard two-dimension bar codes is well defined at data decoding and error correction area. More works could be done in bar code image acquisition process. Applying various image enhancement algorithms, the recognition rate of PDF417 bar code is improved.

  • PDF

A Note on Bootstrapping in Sufficient Dimension Reduction

  • Yoo, Jae Keun;Jeong, Sun
    • Communications for Statistical Applications and Methods
    • /
    • 제22권3호
    • /
    • pp.285-294
    • /
    • 2015
  • A permutation test is the popular and attractive alternative to derive asymptotic distributions of dimension test statistics in sufficient dimension reduction methodologies; however, recent studies show that a bootstrapping technique also can be used. We consider two types of bootstrapping dimension determination, which are partial and whole bootstrapping procedures. Numerical studies compare the permutation test and the two bootstrapping procedures; subsequently, real data application is presented. Considering two additional bootstrapping procedures to the existing permutation test, one has more supporting evidence for the dimension estimation of the central subspace that allow it to be determined more convincingly.

정서의 이차원 구조에서 유아의 얼굴표정 해석 (Children's Interpretation of Facial Expression onto Two-Dimension Structure of Emotion)

  • 신영숙;정현숙
    • 인지과학
    • /
    • 제18권1호
    • /
    • pp.57-68
    • /
    • 2007
  • 본 논문은 정서의 이차원 구조상에서 얼굴표정으로부터 아동의 정서이해에 대한 범주를 알아보고자 한다. 3세에서 5세 89명의 아동들을 대상으로 14개의 정서 단어와 관계된 얼굴표정들을 선택하도록 하였다. 실험에 적용된 얼굴표정들은 54명의 대학생들로부터 9점 척도상에서 두차원(쾌-불쾌차원과 각성-수면차원) 각각에서 표정의 강도가 평정된 사진들이 사용되었다. 실험결과에서 아동들은 쾌-불쾌 차원보다는 각성-수면 차원에서 더 큰 안정성을 보였다. 이차원 구조상에서 슬픔, 졸림, 화남, 놀람과 같은 정서들은 두 차원에서 매우 잘 변별된 반면, 두려움, 지겨움과 같은 정서들은 쾌-불쾌 차원에서 불안정성을 보였다. 특히 3세 아동들은 각성-수면정도에 대한 지각이 쾌-불쾌에 대한 지각보다 높게 나타났다.

  • PDF

순위차원라우팅을 사용한 완전 이진트리의 3차원 메쉬로의 링크 충돌 없는 임베딩 (Link-Disjoint Embedding of Complete Binary Trees into 3D-Meshes using Dimension-Ordered Routing)

  • 박상명;이상규;문봉희
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제27권2호
    • /
    • pp.169-176
    • /
    • 2000
  • 본 논문에서는 령크 충돌을 최소화 하는데 중점을 두고 순위차원 라우팅을 사용하여 완전이진트리를 3차원 메쉬로 임베딩하는 방법을 제안한다. 기존의 연구[14]에서는, 완전이진트리를 3차원 메쉬에 임베딩 할 때 순위차원 라우팅을 사용하는 경우 1, 2 차원에서 링크 충돌이 발생하였고, 순위차원 라우팅을 따르지 않는 경우 1차원에서만 링크 충돌이 존재하도록 하는 임베딩 방법을 보였었다. 이와 비교하여 본 논문에서는 순위차원 라우팅을 사용하고 링크 충돌이 존재하지 않는 임베딩 방법을 제안하며, 이 방법에 의해 임베딩을 수행한 결과, 임베딩을 위해 사용된 메쉬의 크기가 최적크기의 1.27 배를 넘지 않음을 증명한다.

  • PDF

Two variations of cross-distance selection algorithm in hybrid sufficient dimension reduction

  • Jae Keun Yoo
    • Communications for Statistical Applications and Methods
    • /
    • 제30권2호
    • /
    • pp.179-189
    • /
    • 2023
  • Hybrid sufficient dimension reduction (SDR) methods to a weighted mean of kernel matrices of two different SDR methods by Ye and Weiss (2003) require heavy computation and time consumption due to bootstrapping. To avoid this, Park et al. (2022) recently develop the so-called cross-distance selection (CDS) algorithm. In this paper, two variations of the original CDS algorithm are proposed depending on how well and equally the covk-SAVE is treated in the selection procedure. In one variation, which is called the larger CDS algorithm, the covk-SAVE is equally and fairly utilized with the other two candiates of SIR-SAVE and covk-DR. But, for the final selection, a random selection should be necessary. On the other hand, SIR-SAVE and covk-DR are utilized with completely ruling covk-SAVE out, which is called the smaller CDS algorithm. Numerical studies confirm that the original CDS algorithm is better than or compete quite well to the two proposed variations. A real data example is presented to compare and interpret the decisions by the three CDS algorithms in practice.

On hierarchical clustering in sufficient dimension reduction

  • Yoo, Chaeyeon;Yoo, Younju;Um, Hye Yeon;Yoo, Jae Keun
    • Communications for Statistical Applications and Methods
    • /
    • 제27권4호
    • /
    • pp.431-443
    • /
    • 2020
  • The K-means clustering algorithm has had successful application in sufficient dimension reduction. Unfortunately, the algorithm does have reproducibility and nestness, which will be discussed in this paper. These are clear deficits for the K-means clustering algorithm; however, the hierarchical clustering algorithm has both reproducibility and nestness, but intensive comparison between K-means and hierarchical clustering algorithm has not yet been done in a sufficient dimension reduction context. In this paper, we rigorously study the two clustering algorithms for two popular sufficient dimension reduction methodology of inverse mean and clustering mean methods throughout intensive numerical studies. Simulation studies and two real data examples confirm that the use of hierarchical clustering algorithm has a potential advantage over the K-means algorithm.

치아의 밀집(Crowding)에 영향을 주는 치아 및 악궁의 크기와 형태에 관한 통계학적 연구 (A STASTICAL STUDY OF DENIAL CROWDING AND ITS RELATIONSHIP TOOTH SIZE, AND ARCH DIMENSION AND SHAPE)

  • 최영주;박영철
    • 대한치과교정학회지
    • /
    • 제14권2호
    • /
    • pp.263-272
    • /
    • 1984
  • This study was undertaken to examine the extent to which tooth size and jaw size each contribute to dental crowding. Two groups of dental casts were selected on the basis of dental crowding. One group, consisting of 94 pairs of dental casts (46 males and 48 females) with normal occlusion. A second group, consisting of 84 pairs of dental casts (98 males and 46 females) with crowding. The results were as follows. 1. Means and standard deviations of the two groups were used to compare the two groups. 2. Significant differences were observed between two groups on the basis of tooth size, arch dimension and arch perimeter. 3. Between noncrowded group and crowded group, was crowded group was found to have large troth size than noncrowded group, while smaller arch dimension and perimeter. 4. Significant differences were observed between males and females on the basis of tooth size, arch dimension and arch perimeter. 5. Author found ideal arch shape of normal occlusion.

  • PDF

Non-linear distributed parameter system estimation using two dimension Haar functions

  • Park Joon-Hoon;Sidhu T.S.
    • Journal of information and communication convergence engineering
    • /
    • 제2권3호
    • /
    • pp.187-192
    • /
    • 2004
  • A method using two dimension Haar functions approximation for solving the problem of a partial differential equation and estimating the parameters of a non-linear distributed parameter system (DPS) is presented. The applications of orthogonal functions, including Haar functions, and their transforms have been given much attention in system control and communication engineering field since 1970's. The Haar functions set forms a complete set of orthogonal rectangular functions similar in several respects to the Walsh functions. The algorithm adopted in this paper is that of estimating the parameters of non-linear DPS by converting and transforming a partial differential equation into a simple algebraic equation. Two dimension Haar functions approximation method is introduced newly to represent and solve a partial differential equation. The proposed method is supported by numerical examples for demonstration the fast, convenient capabilities of the method.