• 제목/요약/키워드: encoding

검색결과 4,315건 처리시간 0.036초

Double Random Phase Encryption Based Orthogonal Encoding Technique for Color Images

  • Lee, In-Ho;Cho, Myungjin
    • Journal of the Optical Society of Korea
    • /
    • 제18권2호
    • /
    • pp.129-133
    • /
    • 2014
  • In this paper, we propose a simple Double random phase encryption (DRPE)-based orthogonal encoding technique for color image encryption. In the proposed orthogonal encoding technique, a color image is decomposed into red, green, and blue components before encryption, and the three components are independently encrypted with DRPE using the same key in order to decrease the complexity of encryption and decryption. Then, the encrypted data are encoded with a Hadamard matrix that has the orthogonal property. The purpose of the proposed orthogonal encoding technique is to improve the security of DRPE using the same key at the cost of a little complexity. The proposed orthogonal encoder consists of simple linear operations, so that it is easy to implement. We also provide the simulation results in order to show the effects of the proposed orthogonal encoding technique.

부호화와 인출이 회상에 미치는 영향 (Effects of Encoding and Retrieval in Recall)

  • 이경희;이정희;김미해
    • 아동학회지
    • /
    • 제9권2호
    • /
    • pp.119-132
    • /
    • 1988
  • The purpose of the present study was to investigate the age-related and encoding-, or retrieval- conditions-related differences in recall and to assess any possible interaction between encoding and retrieval conditions. 108 first and fifth grade children and college adults were presented a 30 item set of pictures for recall it a 2-trial study-test procedure. The data were analyzed in 3(age) x 3(encoding condition) x 3(retrieval condition) x 2(trials) mixed analyses of variance with repeated measures on the last factor. The results indicated the age-related differences in recall and encoding conditions-related differences in recall in the fifth-graders and college adults. Also, the first and fifth grade children's recall was influenced by retrieval conditions. The fifth graders' recall was a function of the interaction of encoding and retrieval conditions.

  • PDF

적층 패턴 기반의 서피스 인코딩 방법 (Surface Encoding Method Based on the Superposed Pattern)

  • 정광석;박성준
    • 한국생산제조학회지
    • /
    • 제21권1호
    • /
    • pp.58-64
    • /
    • 2012
  • Instead of the surface pattern arranged repeatedly in two axial direction on a plane, we propose double patterns superposing two one-axial linear patterns as a reference target for surface encoding. A upper layer of the superposed pattern is the transparent glass with grooves cut in it at a fixed pitch. The position is sensed by detecting a shift of beam due to difference of a refractive index. And a lower layer is the aluminum with color-coated grooves. The amount of beam reflected on the layer varies according to its targeting position and is detected for encoding. For the above reference pattern, we can detect two-axial positions using only the single beam. Furthermore, the pattern size can be expanded with a size of the detector kept constant, meaning that the measured range can be expanded easily. In this paper, we review the existing optical encoding methods for grid pattern, and discuss the hardware implementation of the suggested surface encoding method.

병렬 LDPCA 채널코드 부호화 방법을 사용한 고속 분산비디오부호화 (Fast Distributed Video Coding using Parallel LDPCA Encoding)

  • 박종빈;전병우
    • 방송공학회논문지
    • /
    • 제16권1호
    • /
    • pp.144-154
    • /
    • 2011
  • 본 논문에서는 고속, 저전력 비디오 부호화에 적합한 변환영역 Wyner-Ziv 분산비디오부호화기를 더욱 고속화하기 위한 병렬처리 방법을 제안한다. 기존의 변환영역 Wyner-Ziv 분산비디오부호화 방법은 양자화 된 변환계수를 비트플레인 단위로 분해한 후 비트플레인별로 순차적으로 LDPCA 채널코드로 부호화함에 따라 전체 부호화 연산량에서 LDPCA 부호화가 평균적으로 60% 정도 차지하였고, 이러한 복잡도는 고비트율로 부호화 할수록 더욱 증가하였다. 본 논문에서는 이런 분산비디오부호화 방법의 복잡도 문제를 개선하기 위해 여러 개의 비트플레인들을 하나의 메시지묶음으로 묶어서 한 번의 연산으로 여러 개의 데이터를 동시에 고속 LDPCA 채널코드 부호화하는 병렬화 방법을 제안한다. 이를 통해 기존의 순차적 방법에 비해 저비트율에서는 8배, 고비트율에서는 55배까지 LDPCA 채널코드 부호화 속도를 향상시켰다. 결과적으로 전체 변환영역 Wyner-Ziv 분산비디오부호화에서 LDPCA 채널코드 부호화의 상대적인 복잡도 비율을 평균 9%까지 낮출 수 있었으며, Wyner-Ziv 영상의 부호화 속도도 QCIF 크기 영상을 2.5GHz 속도의 CPU를 가진 PC환경에서 GOP 길이가 64인 경우 초당 700 ~ 2,300장을 부호화 할 수 있음을 확인했다. 제안 방법은 LDPCA를 사용하는 화소영역 Wyner-Ziv 분산비디오부호화에도 적용 가능하여 고속의 부호화가 요구되는 다양한 응용에 활용이 기대된다.

Development of a GML 3.0 Encoding System Using Mapping Rules

  • Lee Yong Soo;Kim Dong O;Hong Dong Sook;Han Ki Joon
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 학술대회지
    • /
    • pp.723-728
    • /
    • 2004
  • Recently, because of the extensive use of geographic information in the various fields, the requirement for the easy circulation and utilization of the various geographic information among the individuals, organizations, societies and countries is raised. In order to support the interoperability of the heterogeneous geographic information in the various fields, OGC(Open GIS Consortium) proposed the GML(Geography Markup Language) specification that defines the XML encoding rule about the heterogeneous geographic information. In addition, ISO/TC 211 adopted the GML specification to make it as the international standard. Therefore, in this paper, we first analyzed the GML 3.0 specification in detail that can support the interoperability of the heterogeneous geographic information. And then we suggested and applied the mapping rule that define the encoding method to improve the encoding process easily and efficiently. Finally, we designed and implemented the GML 3.0 encoding system using the mapping rule to encode the geographic information that was constructed in spatial databases into the GML 3.0 document. Especially, we used ZEUS as a spatial database system to test our encoding system in this paper.

  • PDF

고속 스케일러블 동영상 부호화 알고리듬 (A Fast Scalable Video Encoding Algorithm)

  • 문용호
    • 대한임베디드공학회논문지
    • /
    • 제7권5호
    • /
    • pp.285-290
    • /
    • 2012
  • In this paper, we propose a fast encoding algorithm for scalable video encoding without compromising coding performance. Through analysis on multiple motion estimation processes performed at the enhancement layer, we show redundant motion estimations and suggest the condition under which the redundant ones can efficiently be determined without additional memory. Based on the condition, the redundant motion estimation processes are excluded in the proposed algorithm. Simulation results show that the proposed algorithm is faster than the conventional fast encoding method without performance degradation and additional memory.

색광 부호화와 전연산 후캐리 처리를 이용한 논리 및 산술연산 (Logic/Arithmetic Operation Using Color Light Encoding and Pre-operation Post-carry Processing Methods)

  • 황상현;배장근;김성용;김수중
    • 한국통신학회:학술대회논문집
    • /
    • 한국통신학회 1991년도 추계종합학술발표회논문집
    • /
    • pp.86-91
    • /
    • 1991
  • A capability of performing the optical logic and arithmetic operations is followed by an effective encoding technique. In this paper, we proposed the color light encoding technique. By using this encoding technique, the space bandwidth product(SBP) is minimized in the output plane. In addition, we proposed the pre-operation pro-carry processing method that performs faster than the same time operation and carry processing method in optical computing. We proposed that the color liquid crystal device(CLCD) is used as the encoded color light input source.

벡터합을 이용한 위치 예측 기법 (Prediction Method Using Weighted Vector Addition)

  • 이현석;양성봉
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2000년도 가을 학술발표논문집 Vol.27 No.2 (2)
    • /
    • pp.529-531
    • /
    • 2000
  • 본 논문은 Geometry Compression 분야에서 다뤄지는 압축기법 중 delta encoding 과정을 보완하여 좀 더 높은 압축률을 얻고자 하는 vertex position prediction 과정에 대한 내용으로 구성되어 있다. 이것은 triangle strip 형태의 입력을 받아서 그 vertex data 중 position 정보들간의 delta encoding 과정을 예측 기법을 이용한 encoding 과정으로 대체하여 Huffman encoding 과정에서의 symbol 개수를 줄여 압축률을 향상시키자는 개념에서 출발한다. triangle strip 생성 기법 중 greedy algorithm을 적용한 후, 기존의 parallelogram 방식과 이 논문에서 새로이 제안하는 방식을 비교하여 보다 나은 압축 방식을 제시하는 것이 이 논문의 목적이다. 이 논문에서 제시하는 방식을 실험한 결과, 기존의 예측 기법에 비해 2.4% 정도의 향상을 보여주고 있다.

  • PDF

제시양식 및 부호화조건과 단서양식이 아동의 회상에 미치는 영향 (Effects of Presentation Modality, Encoding Condition and Cue Modality on Child Recall)

  • 박명자;최경숙
    • 아동학회지
    • /
    • 제11권1호
    • /
    • pp.45-57
    • /
    • 1990
  • The purpose of the present study was to investigate the age-related differences in recall and to assess effects of presentation modality, encoding condition and cue modality on recall in terms of encoding specificity principles and dual-coding theory. Eighty children in each of 3grades(first, third and fifth) were presented a 30-item set of pictures or words on cars for recall in a study-test procedure. The experiment was designed as a 3(age) x 2(presentation modality:picture or word) x 2(encoding condition:random or category) x 2(cue modality:picuture or word) factorial design. Statistical analyses were with four-way ANOVA and $Scheff\acute{e}$ test. It was concluded from these results that when the stimulus was presented by pictures, encoded by category and the cues were also presented by pictures, recall increased in all ages. These results were interpreted in terms of encoding specificity principles and dual-coding theory.

  • PDF

저밀도 부호의 고속 부호화 알고리즘 (Fast Encoding Algorithm of Low Density Codes)

  • 이광재;손영수
    • 한국전자통신학회논문지
    • /
    • 제9권4호
    • /
    • pp.403-408
    • /
    • 2014
  • 본 논문에서 우리는 저밀도 부호의 부호화 문제를 고찰한다. 특히 순환 치환 행렬을 이용한 저밀도 부호의 고속 부호화 알고리즘을 제시하였다. 고속 부호화 알고리즘은 고속 Hadamard 변환과 유사하며 결과적으로 제안 기법은 저밀도 부호의 간단하며 고속화된 부호화 알고리즘임을 보여주고 있다.