• Title/Summary/Keyword: 특징변환

Search Result 1,731, Processing Time 0.029 seconds

Design of Ubiquitous Payment Process for Enhancing Seamlessness and Privacy (연결완전성 제고와 프라이버시 보호를 위한 유비쿼터스 지불 프로세스의 설계)

  • Lee, Kyoung Jun;Jeong, Mu Jeong
    • Journal of Intelligence and Information Systems
    • /
    • v.12 no.3
    • /
    • pp.1-13
    • /
    • 2006
  • Ubiquitous computing is a study area explained in a myriad of contexts and technological terms. Payment, however, refers in nature to an act of money transfer from one entity to another, and it is obvious that a payment method will be valued as long as the transaction can be completed with safety no matter what technology was used. The key to U-payment is convenience and security in the transfer of financial information. The purpose of this paper is to find a desirable U-payment scheme by looking at the characteristics of seamlessness under the ubiquitous environments, strong personal device, and peer-based information transactions. We also propose U-SDT Protocol integrating technologies such as Radio Frequency Identification (RFID), Bluetooth, Personal Payment Device, Account Managing Application and Transaction ID as a way to make transactions between users seamless and secure better privacy protection.

  • PDF

Automatic segmentation of a tongue area and oriental medicine tongue diagnosis system using the learning of the area features (영역 특징 학습을 이용한 혀의 자동 영역 분리 및 한의학적 설진 시스템)

  • Lee, Min-taek;Lee, Kyu-won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.4
    • /
    • pp.826-832
    • /
    • 2016
  • In this paper, we propose a tongue diagnosis system for determining the presence of specific taste crack area as a first step in the digital tongue diagnosis system that anyone can use easily without special equipment and expensive digital tongue diagnosis equipment. Training DB was developed by the Haar-like feature, Adaboost learning on the basis of 261 pictures which was collected in Oriental medicine. Tongue candidate regions were detected from the input image by the learning results and calculated the average value of the HUE component to separate only the tongue area in the detected candidate regions. A tongue area is separated through the Connected Component Labeling from the contour of tongue detected. The palate regions were divided by the relative width and height of the tongue regions separated. Image on the taste area is converted to gray image and binarized with each of the average brightness values. A crack in the presence or absence was determined via Connected Component Labeling with binary images.

Evaluation of shape similarity for 3D models (3차원 모델을 위한 형상 유사성 평가)

  • Kim, Jeong-Sik;Choi, Soo-Mi
    • The KIPS Transactions:PartA
    • /
    • v.10A no.4
    • /
    • pp.357-368
    • /
    • 2003
  • Evaluation of shape similarity for 3D models is essential in many areas - medicine, mechanical engineering, molecular biology, etc. Moreover, as 3D models are commonly used on the Web, many researches have been made on the classification and retrieval of 3D models. In this paper, we describe methods for 3D shape representation and major concepts of similarity evaluation, and analyze the key features of recent researches for shape comparison after classifying them into four categories including multi-resolution, topology, 2D image, and statistics based methods. In addition, we evaluated the performance of the reviewed methods by the selected criteria such as uniqueness, robustness, invariance, multi-resolution, efficiency, and comparison scope. Multi-resolution based methods have resulted in decreased computation time for comparison and increased preprocessing time. The methods using geometric and topological information were able to compare more various types of models and were robust to partial shape comparison. 2D image based methods incurred overheads in time and space complexity. Statistics based methods allowed for shape comparison without pose-normalization and showed robustness against affine transformations and noise.

Implementation of Multiview Calibration System for An Effective 3D Display (효과적인 3차원 디스플레이를 위한 다시점 영상왜곡 보정처리 시스템 구현)

  • Bae Kyung-Hoon;Park Jae-Sung;Yi Dong-Sik;Kim Eun-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.1C
    • /
    • pp.36-45
    • /
    • 2006
  • In this paper, multiview calibration system for an effective 3D display is proposed. This system can be obtain 4-view image from multiview camera system. Also it can be rectify lens and camera distortion, error of bright and color, and it can be calibrate distortion of geometry. In this paper, we proposed the signal processing skill to calibrate the camera distortions which are able to take place from the acquisited multiview images. The discordance of the brightness and the colors are calibrated the color transform by extracting the feature point, correspondence point. And the difference of brightness is calibrated by using the differential map of brightness from each camera image. A spherical lens distortion is corrected by extracting the pattern of the multiview camera images. Finally the camera error and size among the multiview cameras is calibrated by removing the distortion. Accordingly, this proposed rectification & calibration system enable to effective 3D display and acquire natural multiview 3D image.

Improvement of performance for the LBG algorithm by the decision of initial codevectors (초기 코드백터 결정에 의한 LBG 알고리즘의 성능 개선)

  • Hong, Chi-Hwun;Ch0, Che-Hwang
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.2
    • /
    • pp.16-29
    • /
    • 1995
  • Choosing initial codevectors in the LBG algorithm controls the performance of a codebook, because it only guarantees a locally optimal codebook. In this paper, we propose the decision method of initial codevectors by a decision radius which takes for feature vectors DC, low frequency, medium frequency and high frequency terms generated by a DCT. The more the decision radius is increased in order to decide initial codevectors, the more the number of membership vectors and the standard deviation for distance among the initial codevectors are increased. To obtain improved performance for a codebook, the decision radius for DC term is required above 0.9 of the membership rate and those for low frequency, medium frequency and high frequency terms under 0.6 of it.

  • PDF

Frame Reliability Weighting for Robust Speech Recognition (프레임 신뢰도 가중에 의한 강인한 음성인식)

  • 조훈영;김락용;오영환
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.3
    • /
    • pp.323-329
    • /
    • 2002
  • This paper proposes a frame reliability weighting method to compensate for a time-selective noise that occurs at random positions of speech signal contaminating certain parts of the speech signal. Speech frames have different degrees of reliability and the reliability is proportional to SNR (signal-to noise ratio). While it is feasible to estimate frame Sl? by using the noise information from non-speech interval under a stationary noisy situation, it is difficult to obtain noise spectrum for a time-selective noise. Therefore, we used statistical models of clean speech for the estimation of the frame reliability. The proposed MFR (model-based frame reliability) approximates frame SNR values using filterbank energy vectors that are obtained by the inverse transformation of input MFCC (mal-frequency cepstral coefficient) vectors and mean vectors of a reference model. Experiments on various burnt noises revealed that the proposed method could represent the frame reliability effectively. We could improve the recognition performance by using MFR values as weighting factors at the likelihood calculation step.

A Performance Evaluation of a RISC-Based Digital Signal Processor Architecture (RISC 기반 DSP 프로세서 아키텍쳐의 성능 평가)

  • Kang, Ji-Yang;Lee, Jong-Bok;Sung, Won-Yong
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.2
    • /
    • pp.1-13
    • /
    • 1999
  • As the complexity of DSP (Digital Signal Processing) applications increases, the need for new architectures supporting efficient high-level language compilers also grows. By combining several DSP processor specific features, such as single cycle MAC (Multiply-and-ACcumulate), direct memory access, automatic address generation, and hardware looping, with a RISC core having many general purpose registers and orthogonal instructions, a high-performance and compiler-friendly RISC-based DSP processors can be designed. In this study, we develop a code-converter that can exploit these DSP architectural features by post-processing compiler-generated assembly code, and evaluate the performance effects of each feature using seven DSP-kernel benchmarks and a QCELP vocoder program. Finally, we also compare the performances with several existing DSP processors, such as TMS320C3x, TMS320C54x, and TMS320C5x.

  • PDF

Detection of Spliced Image Using Run-length of Wavelet Coefficients and Statistical Moments (웨이블릿 계수의 런-길이와 통계적 모멘트를 이용한 접합 영상 검출)

  • Kim, Tae-Hyung;Han, Jong-Goo;Park, Tae-Hee;Eom, Il-Kyu
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.152-159
    • /
    • 2014
  • In this paper, we introduce a run-length for wavelet coefficients and present a image splicing detection method using the statistical moments for the wavelet run-length. Various pre-processings for the suspicious image are performed to emphasize the discontinuous edges caused by the image splicing. The proposed scheme has the merit that can exploit the various statistical characteristics of the wavelet transform. We extracted up to 72 features, and performed training and testing using SVM(support vector machine). Experimental results showed that the proposed method generates similar detection results compared to the existing methods. In addition, we showed the wavelet domain run-length is useful to detect the spliced image.

Feature-based Topological Mesh Metamorphosis (위상 변환을 통한 특징 기반 메쉬 몰핑)

  • An, Min-Su;Lee, Seung-Yong
    • Journal of the Korea Computer Graphics Society
    • /
    • v.7 no.4
    • /
    • pp.1-8
    • /
    • 2001
  • 3D mesh metamorphosis (morphing) deals with two input polyhedral objects and generates an animation in which the source mesh gradually changes to the target through in-between meshes. The basic and common idea of previous mesh morphing techniques can be summarized as the construction and interpolation of a metamesh. However, an approach based on a metamesh has fundamental limitations of complicated in-between meshes and no topology (connectivity) changes in a metamorphosis. This paper presents a novel approach for 3D mesh morphing, which is not based on a metamesh and overcomes the limitations of previous work. The approach simultaneously interpolates the topology and geometry of input meshes. With the approach, an in-between mesh contains only the vertices from the source and target meshes. Since no additional vertices are introduced, the in-between meshes are much simpler than those generated by previous techniques.

  • PDF

Multi-face Detection from Complex Background Using Hierarchical Attention Operators (복잡한 배경에서 계층적 주목 연산자를 이용한 다중 얼굴 검출)

  • 이재근;김복만;서경석;최흥문
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.6
    • /
    • pp.121-126
    • /
    • 2004
  • An efficient multi face detection technique is proposed based on hierarchical context-free attention operators in which multiple faces are efficiently detected from a noisy and complex background. A noise-tolerant generalized symmetry transform (NTSGT) is applied hierarchically, as a context free attention operator, to the input pyramidal image for the high speed global location of the regions of face candidates (ROFCs) with a single mask. For the face verification, local NTGST is applied within each ROFC to confirm the existence of the detailed facial features. First, by globally applying NTGST which introduces the average pyramid method and focusing to the input image with complex background, ROFCs with recognizable resolution are detected robustly. Morphological operations are applied only to the each detected ROFCs to emphasize the facial features like eyes and lips. Then, eyes are detected by locally appling NTGST to the ROFCs and only faces are detected by verifying the existence of the geometrical features of the faces relatively to the location of eyes. The experimental results show that the proposed method can efficiently detect multiple faces from a noisy or complex background with 93.5% detection rate.