• 제목/요약/키워드: Strong Representation

검색결과 116건 처리시간 0.022초

Adaptive Hyperspectral Image Classification Method Based on Spectral Scale Optimization

  • Zhou, Bing;Bingxuan, Li;He, Xuan;Liu, Hexiong
    • Current Optics and Photonics
    • /
    • 제5권3호
    • /
    • pp.270-277
    • /
    • 2021
  • The adaptive sparse representation (ASR) can effectively combine the structure information of a sample dictionary and the sparsity of coding coefficients. This algorithm can effectively consider the correlation between training samples and convert between sparse representation-based classifier (SRC) and collaborative representation classification (CRC) under different training samples. Unlike SRC and CRC which use fixed norm constraints, ASR can adaptively adjust the constraints based on the correlation between different training samples, seeking a balance between l1 and l2 norm, greatly strengthening the robustness and adaptability of the classification algorithm. The correlation coefficients (CC) can better identify the pixels with strong correlation. Therefore, this article proposes a hyperspectral image classification method called correlation coefficients and adaptive sparse representation (CCASR), based on ASR and CC. This method is divided into three steps. In the first step, we determine the pixel to be measured and calculate the CC value between the pixel to be tested and various training samples. Then we represent the pixel using ASR and calculate the reconstruction error corresponding to each category. Finally, the target pixels are classified according to the reconstruction error and the CC value. In this article, a new hyperspectral image classification method is proposed by fusing CC and ASR. The method in this paper is verified through two sets of experimental data. In the hyperspectral image (Indian Pines), the overall accuracy of CCASR has reached 0.9596. In the hyperspectral images taken by HIS-300, the classification results show that the classification accuracy of the proposed method achieves 0.9354, which is better than other commonly used methods.

패션 일러스트레이션에 나타난 New Painting 특성 (Characteristics of New Painting in Fashion Illustrations)

  • 김순자
    • 한국의류산업학회지
    • /
    • 제14권6호
    • /
    • pp.906-917
    • /
    • 2012
  • The purpose of this study is to examine the characteristics of expression and their effects of New painting in fashion illustration since 1990s. This study is focused on searching for the development in expressional techniques of the fashion illustration on the basis of various techniques of New painting. New painting as a trend of new expressionism in America was developed in opposition to the minimalism in the 1980s when the discussion of the post-modernism was most widely. The artists of New painting attempted to resurrect figure through the representation of figure and concrete image, rich in color and strong in image. They also expressed the realistic scene of life with the various kind of medium, materials and styles and appropriation of image from mass media and popular culture. The representation of fashion figure and image through the various kind of painting medium, techniques and styles can express the realistic and sensitive image and increase the communication ability in fashion illustration. It could also deliver the fashion message more clearly through the appropriation of image. These findings indicate that fashion illustrations accept variety by interacting with fine arts and expand the scope of expression.

w-Bit Shifting Non-Adjacent Form Conversion

  • Hwang, Doo-Hee;Choi, Yoon-Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권7호
    • /
    • pp.3455-3474
    • /
    • 2018
  • As a unique form of signed-digit representation, non-adjacent form (NAF) minimizes Hamming weight by removing a stream of non-zero bits from the binary representation of positive integer. Thanks to this strong point, NAF has been used in various applications such as cryptography, packet filtering and so on. In this paper, to improve the NAF conversion speed of the $NAF_w$ algorithm, we propose a new NAF conversion algorithm, called w-bit Shifting Non-Adjacent Form($SNAF_w$), where w is width of scanning window. By skipping some unnecessary bit comparisons, the proposed algorithm improves the NAF conversion speed of the $NAF_w$ algorithm. To verify the excellence of the $SNAF_w$ algorithm, the $NAF_w$ algorithm and the $SNAF_w$ algorithm are implemented in the 8-bit microprocessor ATmega128. By measuring CPU cycle counter for the NAF conversion under various input patterns, we show that the $SNAF_2$ algorithm not only increases the NAF conversion speed by 24% on average but also reduces deviation in the NAF conversion time for each input pattern by 36%, compared to the $NAF_2$ algorithm. In addition, we show that $SNAF_w$ algorithm is always faster than $NAF_w$ algorithm, regardless of the size of w.

Prosody in Spoken Language Processing

  • Schafer Amy J.;Jun Sun-Ah
    • 한국음향학회:학술대회논문집
    • /
    • 한국음향학회 2000년도 하계학술발표대회 논문집 제19권 1호
    • /
    • pp.7-10
    • /
    • 2000
  • Studies of prosody and sentence processing have demonstrated that prosodic phrasing can exhibit strong effects on processing decisions in English. In this paper, we tested Korean sentence fragments containing syntactically ambiguous Adj-N1-N2 strings in a cross-modal naming task. Four accentual phrasing patterns were tested: (a) the default phrasing pattern, in which each word forms an accentual phrase; (b) a phrasing biased toward N1 modification; (c) a phrasing biased toward complex-NP modification; and (d) a phrasing used with adjective focus. Patterns (b) and (c) are disambiguating phrasings; the other two are commonly found with both interpretations and are thus ambiguous. The results showed that the naming time of items produced in the prosody contradicting the semantic grouping is significantly longer than that produced in either default or supporting prosody, We claim that, as in English, prosodic information in Korean is parsed into a well-formed prosodic representation during the early stages of processing. The partially constructed prosodic representation produces incremental effects on syntactic and semantic processing decisions and is retained in memory to influence reanalysis decisions.

  • PDF

신경회로망을 이용한 고온 저사이클 피로균열성장 모델링에 관한 연구 (A Study on High Temperature Low Cycle Fatigue Crack Growth Modelling by Neural Networks)

  • 주원식;조석수
    • 대한기계학회논문집A
    • /
    • 제20권4호
    • /
    • pp.2752-2759
    • /
    • 1996
  • This paper presents crack growth analysis approach on the basis of neural networks, a branch of cognitive science to high temperature low cycle fatigue that shows strong nonlinearity in material behavior. As the number of data patterns on crack growth increase, pattern classification occurs well and two point representation scheme with gradient of crack growth curve simulates crack growth rate better than one point representation scheme. Optimal number of learning data exists and excessive number of learning data increases estimated mean error with remarkable learning time J-da/dt relation predicted by neural networks shows that test condition with unlearned data is simulated well within estimated mean error(5%).

ASYMPTOTIC PROPERTIES OF RANDOM CENTRAL ORDER STATISTICS UNDER CONTAMINATION

  • Kim, Sung-Kyun;Kim, Sung-Lai
    • Journal of applied mathematics & informatics
    • /
    • 제8권2호
    • /
    • pp.627-634
    • /
    • 2001
  • Under contamination, Bahadur representations with a strong remainder term are derived for random central order statistics with a prescribed limiting rank, and asymptotic normalities for these statistics of truncated and contaminated data are proved, with a suitable limiting rank. From these results, an application to the fixed-width confidence interval problem is available.

RECONSTRUCTION THEOREM FOR STATIONARY MONOTONE QUANTUM MARKOV PROCESSES

  • Heo, Jae-Seong;Belavkin, Viacheslav P.;Ji, Un Cig
    • 대한수학회보
    • /
    • 제49권1호
    • /
    • pp.63-74
    • /
    • 2012
  • Based on the Hilbert $C^*$-module structure we study the reconstruction theorem for stationary monotone quantum Markov processes from quantum dynamical semigroups. We prove that the quantum stochastic monotone process constructed from a covariant quantum dynamical semigroup is again covariant in the strong sense.

어머니의 양육체계와 유아의 애착체계간의 관계 (Relationships Between Maternal Caregiving System and Child's Attachment System)

  • 유영미;이영
    • 아동학회지
    • /
    • 제26권4호
    • /
    • pp.125-143
    • /
    • 2005
  • This study focused on the importance of the attachment/caregiving system at a dyadic level, and examined relationships between maternal representations of caregiving, maternal caregiving behavior, and child attachment. Seventy-five middle-class mothers and their preschool children(ages 3-4) participated in the study. Results indicated a strong correspondence between maternal representations of caregiving and maternal caregiving behavior at the secure/insecure and ordered/disordered level. The correspondence between maternal representations of caregiving and their preschooler's attachment, and between maternal caregiving behavior and their preschooler's attachment at the secure/insecure level were also strong. The correspondence between maternal representations of caregiving and their preschooler's attachment was mediated by maternal caregiving behavior.

  • PDF

Discriminative and Non-User Specific Binary Biometric Representation via Linearly-Separable SubCode Encoding-based Discretization

  • Lim, Meng-Hui;Teoh, Andrew Beng Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권2호
    • /
    • pp.374-388
    • /
    • 2011
  • Biometric discretization is a process of transforming continuous biometric features of an identity into a binary bit string. This paper mainly focuses on improving the global discretization method - a discretization method that does not base on information specific to each user in bitstring extraction, which appears to be important in applications that prioritize strong security provision and strong privacy protection. In particular, we demonstrate how the actual performance of a global discretization could further be improved by embedding a global discriminative feature selection method and a Linearly Separable Subcode-based encoding technique. In addition, we examine a number of discriminative feature selection measures that can reliably be used for such discretization. Lastly, encouraging empirical results vindicate the feasibility of our approach.

선화증권 상의 Retla 약관의 유효성에 관한 연구 (A Study on the Validity of the Retla Clauses in Bills of Lading)

  • 최명국
    • 무역상무연구
    • /
    • 제61권
    • /
    • pp.93-111
    • /
    • 2014
  • In this article, I have reviewed the validity of the Retla Clauses in bills of lading. In Tokio Marine(1970), US courts have permitted carriers to include Retla Clauses in their bills of lading that essentially disclaim all responsibility for the required statement. Simon J in The Saga Explorer(2012) disagreed with the decision of no representation in Tokio Marine and held that the statement with the Retla Clauses made on the bills of lading as to the cargo's apparent condition was a fraudulent misrepresentation. Simon J also requested a strong carriers' honest conduct. However, because the shippers always request the clean bill of lading for trade purpose and never call for a substitute bill of lading showing the true condition of goods, carriers will inevitably continue to clause bills of lading if they have no other better way of protecting themselves in the situation of Tokio Marine or The Saga Explorer. For the present, the decision of misrepresentation in The Saga Explorer might be helpless to change the position of the assignees of the bills of lading. And it seems that the debate on the validity of the Retla Clauses in bills of lading will be continued for the time being. In these circumstances, if the buyers hope to void the potential dispute, they may have a special agreement in the sale of goods contract, for example, requiring a pre-shipment inspection of the goods so as to know the actual condition of the goods on shipment.

  • PDF