• Title/Summary/Keyword: feature coding

Search Result 204, Processing Time 0.03 seconds

A block-based face detection algorithm for the efficient video coding of a videophone (효율적인 화상회의 동영상 압축을 위한 블록기반 얼굴 검출 방식)

  • Kim, Ki-Ju;Bang, Kyoung-Gu;Moon, Jeong-Mee;Kim, Jae-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9C
    • /
    • pp.1258-1268
    • /
    • 2004
  • We propose a new fast, algorithm which is used for detecting frontal face in the frequency domain based on human skin-color using OCT coefficient of dynamic image compression and skin color information. The region where each pixel has a value of skin-color were extracted from U and V value based on DCT coefficient obtained in the process of Image compression using skin-color map in the Y, U, V color space A morphological filter and labeling method are used to eliminate noise in the resulting image We propose the algorithm to detect fastly human face that estimate the directional feature and variance of luminance block of human skin-color Then Extraction of face was completed adaptively on both background have the object analogous to skin-color and background is simple in the proposed algorithm The performance of face detection algorithm is illustrated by some simulation results earned out on various races We confined that a success rate of 94 % was achieved from the experimental results.

Texture Image Database Retrieval Using JPEG-2000 Partial Entropy Decoding (JPEG-2000 부분 엔트로피 복호화에 의향 질감 영상 데이터베이스 검색)

  • Park, Ha-Joong;Jung, Ho-Youl
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5C
    • /
    • pp.496-512
    • /
    • 2007
  • In this paper, we propose a novel JPEG-2000 compressed image retrieval system using feature vector extracted through partial entropy decoding. Main idea of the proposed method is to utilize the context information that is generated during entropy encoding/decoding. In the framework of JPEG-2000, the context of a current coefficient is determined depending on the pattern of the significance and/or the sign of its neighbors in three bit-plane coding passes and four coding modes. The contexts provide a model for estimating the probability of each symbol to be coded. And they can efficiently describe texture images which have different pattern because they represent the local property of images. In addition, our system can directly search the images in the JPEG-2000 compressed domain without full decompression. Therefore, our proposed scheme can accelerate the work of retrieving images. We create various distortion and similarity image databases using MIT VisTex texture images for simulation. we evaluate the proposed algorithm comparing with the previous ones. Through simulations, we demonstrate that our method achieves good performance in terms of the retrieval accuracy as well as the computational complexity.

Trumpis Coded FH/MFSK Performance in Noise Jamming Environments (Trumpis 길쌈부호를 적용한 FH/MFSK 시스템의 잡음재밍에 대한 성능 분석)

  • 송문규;사공석진;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.10
    • /
    • pp.1100-1108
    • /
    • 1992
  • The evaluation of coded error probabilities for antijam communication systems is usually difficult to do and, thus, easy-to-evaluate upper bounds are used. Since it is relatively easy to evaluate the cutoff rate for the coding channel, the coded bit error bounds for most antijam systems of interest can be easily expressed directly in terms of this cutoff rate parameter using the relationship between the bit error bounds and cutoff rate for AWGN channel. The key feature of these bounds is the decoupling of the coding aspects of the system from the remaining part of the communication system which includes jamming, suboptimum detectors, and arbitrary decoding metrics which may or may not use jammer state knowledge. In this paper the bit error bounds for the Trumpis coded FH/MFSK with an AWGN channel are translated into the corresponding bit error bounds for boradband and partial band noise jammer. And the impact of the side information about jammer state is also evaluated with these upper bounds. Although it is considered for the soft decision detector, it is also applicable to the hard decision detector.

  • PDF

Parallelized Architecture of Serial Finite Field Multipliers for Fast Computation (유한체 상에서 고속 연산을 위한 직렬 곱셈기의 병렬화 구조)

  • Cho, Yong-Suk
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.17 no.1
    • /
    • pp.33-39
    • /
    • 2007
  • Finite field multipliers are the basic building blocks in many applications such as error-control coding, cryptography and digital signal processing. Hence, the design of efficient dedicated finite field multiplier architectures can lead to dramatic improvement on the overall system performance. In this paper, a new bit serial structure for a multiplier with low latency in Galois field is presented. To speed up multiplication processing, we divide the product polynomial into several parts and then process them in parallel. The proposed multiplier operates standard basis of $GF(2^m)$ and is faster than bit serial ones but with lower area complexity than bit parallel ones. The most significant feature of the proposed architecture is that a trade-off between hardware complexity and delay time can be achieved.

An Effect of Aggregation of Point Features to Areal Units on K-Index (점사상의 지역단위 집계가 K-지표에 미치는 영향)

  • Lee Byoung-Kil
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.24 no.1
    • /
    • pp.131-138
    • /
    • 2006
  • Recently, data gathering and algorithm developing are in progress for the GIS application using point feature. Several researches prove that verification of the spatial clustering and evaluation of inter-dependencies between event and control are possible. On the other hand, most of the point features as GIS data are gathered by indirect method, such as address geo-coding, rather than by direct method, such as field surveying. Futhermore, lots of statistics by administrative district based on the point features have no coordinates information of the points. In this study, calculating the K-index in GIS environment, to evaluate the effect of aggregation of raw data on K-index, K-indices estimated from raw data (parcel unit), topographically aggregated data (block unit), administratively aggregated data (administrative district unit) are compared and evaluated. As a result, point feature, highly clustered in local area, is largely distorted when aggregated administratively. But, the K-indices of topographically aggregated data is very similar to the K-indices of raw data.

A Lightweight HL7 Message Strategy for Real-Time ECG Monitoring (실시간 심전도 모니터링을 위한 HL7 메시지 간소화 전략)

  • Lee, Kuyeon;Kang, Kyungtae;Lee, Jaemyoun;Park, Juyoung
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.3
    • /
    • pp.183-191
    • /
    • 2015
  • Recent developments in IT have made real-time ECG monitoring possible, and this represents a promising application for the emerging HL7 standard for the exchange of clinical information. However, applying the HL7 standard directly to real-time ECG monitoring causes problems, because the partial duplication of data within an HL7 message increases the amount of data to be transmitted, and the time taken to process it. We reduce these overheads by Feature Scaling, by standardizing the range of independent variables or features of data, while nevertheless generating HL7-compliant messages. We also use a De-Duplication algorithm to eliminate the partial repetition of the OBX field in an HL7 ORU message. Our strategy shortens the time required to create messages by 51%, and reduces the size of messages by 1/8, compared to naive HL7 coding.

Melanocyte-stimulating Hormone Receptor (MC1R) Genotype and Its Effects on Coat Color in Korean Jindo Dogs

  • Hong, Kyung-Won;Kim, Sang-Wook;Jang, Hong-Chul;Yang, Seung-Min;Shin, Young-Bin;Hong, Yoon-Hye;Kim, Jong-Seok;Oh, Seok-Il;Choi, Yoon-Ju;Chung, Dong-Hee;Yang, Boh-Suk;Lee, Ji-Woong;Choi, Bong-Hwan
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.22 no.8
    • /
    • pp.1078-1084
    • /
    • 2009
  • The Jindo dog is a Korean natural monument and is recognized by the Fédération Cynologique Internationale. A prominent feature is the diverse coat color within the breed. To analyze the genetic basis of variation in the Jindo coat color, we sequenced the protein-coding regions of the melanocortin 1 receptor gene (MC1R). The MC1R coding sequence was determined from 154 dogs in five breeds (Jindo, Labrador Retriever, English Springer Spaniel, Belgian Malinois, and German Shepherd). To confirm the genetic structure of sampled populations, we tested for Hardy-Weinberg equilibrium (HWE) and computed $F_{st}$ The sample populations did not significantly deviate from HWE. $F_{st}$ was 0.02 between white and fawn Jindo dogs; this was lower than $F_{st}$ between breeds. Six single nucleotide polymorphisms (SNPs) were detected in the MC1R coding region. Among the six SNPs, five were non-synonymous (S90G, T105A, Q159P, M264V, and R306ter) and one was synonymous SNP (Y298Y). From the SNPs, we predicted four haplotypes (H1, H2, H3, and H4) for Jindo MC1R. Jindo dogs had different haplotypes corresponding to different coat colors. H1 was frequently observed in white Jindo dogs with an odds ratio of 5.03 (95% CI: 2.27-11.18, p<0.0001), whereas H2 and H4 were observed only in fawn Jindo dogs. Our findings indicate that SNP haplotype can influence coat color. Knowledge of MC1R haplotypes can help discriminate white and fawn coats in Jindo dogs. We hope this report will trigger more research into the genetics of this traditional Korean dog and will be a reference for dogs of Asian origin. Also, our results will provide a useful genetic marker for Jindo dog breeders who have selected for specific colors.

Fast Motion Estimation for Variable Motion Block Size in H.264 Standard (H.264 표준의 가변 움직임 블록을 위한 고속 움직임 탐색 기법)

  • 최웅일;전병우
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.6
    • /
    • pp.209-220
    • /
    • 2004
  • The main feature of H.264 standard against conventional video standards is the high coding efficiency and the network friendliness. In spite of these outstanding features, it is not easy to implement H.264 codec as a real-time system due to its high requirement of memory bandwidth and intensive computation. Although the variable block size motion compensation using multiple reference frames is one of the key coding tools to bring about its main performance gain, it demands substantial computational complexity due to SAD (Sum of Absolute Difference) calculation among all possible combinations of coding modes to find the best motion vector. For speedup of motion estimation process, therefore, this paper proposes fast algorithms for both integer-pel and fractional-pel motion search. Since many conventional fast integer-pel motion estimation algorithms are not suitable for H.264 having variable motion block sizes, we propose the motion field adaptive search using the hierarchical block structure based on the diamond search applicable to variable motion block sizes. Besides, we also propose fast fractional-pel motion search using small diamond search centered by predictive motion vector based on statistical characteristic of motion vector.

Salience of Envelope Interaural Time Difference of High Frequency as Spatial Feature (공간감 인자로서의 고주파 대역 포락선 양이 시간차의 유효성)

  • Seo, Jeong-Hun;Chon, Sang-Bae;Sung, Koeng-Mo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.29 no.6
    • /
    • pp.381-387
    • /
    • 2010
  • Both timbral features and spatial features are important in the assessment of multichannel audio coding systems. The prediction model, extending the ITU-R Rec. BS. 1387-1 to multichannel audio coding systems, with the use of spatial features such as ITDDist (Interaural Time Difference Distortion), ILDDist (Interaural Level Difference Distortion), and IACCDist (InterAural Cross-correlation Coefficient Distortion) was proposed by Choi et al. In that model, ITDDistswere only computed for low frequency bands (below 1500Hz), and ILDDists were computed only for high frequency bands (over 2500Hz) according to classical duplex theory. However, in the high frequency range, information in temporal envelope is also important in spatial perception, especially in sound localization. A new model to compute the ITD distortions of temporal envelopes in high frequency components is introduced in this paper to investigate the role of such ITD on spatial perception quantitatively. The computed ITD distortions of temporal envelopes in high frequency components were highly correlated with perceived sound quality of multichannel audio sounds.

Efficient and Robust Correspondence Detection between Unbalanced Stereo Images

  • Kim, Yong-Ho;Kim, Jong-Su;Lee, Sangkeun;Choi, Jong-Soo
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.1 no.3
    • /
    • pp.161-170
    • /
    • 2012
  • This paper presents an efficient and robust approach for determining the correspondence between unbalanced stereo images. The disparity vectors were used instead of feature points, such as corners, to calculate a correspondence relationship. For a faster and optimal estimation, the vectors were classified into several regions, and the homography of each region was calculated using the RANSAC algorithm. The correspondence image was calculated from the images transformed by each homography. Although it provided good results under normal conditions, it was difficult to obtain reliable results in an unbalanced stereo pair. Therefore, a balancing method is also proposed to minimize the unbalance effects using the histogram specification and structural similarity index. The experimental results showed that the proposed approach outperformed the baseline algorithms with respect to the speed and peak-signal-to-noise ratio. This work can be applied to practical fields including 3D depth map acquisition, fast stereo coding, 2D-to-3D conversion, etc.

  • PDF