• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.027 seconds

Dictionary Learning based Superresolution on 4D Light Field Images (4차원 Light Field 영상에서 Dictionary Learning 기반 초해상도 알고리즘)

  • Lee, Seung-Jae;Park, In Kyu
    • Journal of Broadcast Engineering
    • /
    • v.20 no.5
    • /
    • pp.676-686
    • /
    • 2015
  • A 4D light field image is represented in traditional 2D spatial domain and additional 2D angular domain. The 4D light field has a resolution limitation both in spatial and angular domains since 4D signals are captured by 2D CMOS sensor with limited resolution. In this paper, we propose a dictionary learning-based superresolution algorithm in 4D light field domain to overcome the resolution limitation. The proposed algorithm performs dictionary learning using a large number of extracted 4D light field patches. Then, a high resolution light field image is reconstructed from a low resolution input using the learned dictionary. In this paper, we reconstruct a 4D light field image to have double resolution both in spatial and angular domains. Experimental result shows that the proposed method outperforms the traditional method for the test images captured by a commercial light field camera, i.e. Lytro.

Fall Recognition Algorithm Using Gravity-Weighted 3-Axis Accelerometer Data (3축 가속도 센서 데이터에 중력 방향 가중치를 사용한 낙상 인식 알고리듬)

  • Kim, Nam Ho;Yu, Yun Seop
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.6
    • /
    • pp.254-259
    • /
    • 2013
  • A newly developed fall recognition algorithm using gravity weighted 3-axis accelerometer data as the input of HMM (Hidden Markov Model) is introduced. Five types of fall feature parameters including the sum vector magnitude(SVM) and a newly-defined gravity-weighted sum vector magnitude(GSVM) are applied to a HMM to evaluate the accuracy of fall recognition. A GSVM parameter shows the best accuracy of falls which is 100% of sensitivity and 97.96% of specificity, and comparing with SVM, the results archive more improved recognition rate, 5.2% of sensitivity and 4.5% of specificity. GSVM shows higher recognition rate than SVM due to expressing falls characteristics well, whereas SVM expresses the only momentum.

Fine-tuning SVM for Enhancing Speech/Music Classification (SVM의 미세조정을 통한 음성/음악 분류 성능향상)

  • Lim, Chung-Soo;Song, Ji-Hyun;Chang, Joon-Hyuk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.2
    • /
    • pp.141-148
    • /
    • 2011
  • Support vector machines have been extensively studied and utilized in pattern recognition area for years. One of interesting applications of this technique is music/speech classification for a standardized codec such as 3GPP2 selectable mode vocoder. In this paper, we propose a novel approach that improves the speech/music classification of support vector machines. While conventional support vector machine optimization techniques apply during training phase, the proposed technique can be adopted in classification phase. In this regard, the proposed approach can be developed and employed in parallel with conventional optimizations, resulting in synergistic boost in classification performance. We first analyze the impact of kernel width parameter on the classifications made by support vector machines. From this analysis, we observe that we can fine-tune outputs of support vector machines with the kernel width parameter. To make the most of this capability, we identify strong correlation among neighboring input frames, and use this correlation information as a guide to adjusting kernel width parameter. According to the experimental results, the proposed algorithm is found to have potential for improving the performance of support vector machines.

3D BIM-based Building Energy Efficiency Solution for Carbon Emission Reduction (탄소저감을 위한 3D BIM 기반 건물 에너지 효율화 방안)

  • Lee, Dong Hwan;Kwon, Kee Jung;Shin, Ju Ho;Park, Seunghee
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.33 no.3
    • /
    • pp.1235-1242
    • /
    • 2013
  • This study deals with the BIM (Building Information Modeling)-based energy performance analysis implemented in EnergyPlus. The BIM model constructed at Revit is updated at Design Builder, adding HVAC models and converted compatibly with the EnergyPlus. We can obtain the input values about HVAC system and building environment such as HVAC system efficient, the number of air changes and energy consumption of equipment on applying GAs (Genetic algorithms). After modification about HVAC system, Optimization about HVAC system energy consumption can be analyzed. In order to maximize the building energy performance, a genetic algorithm (GA)-based optimization technique is applied to the modified HVAC models. Throughout the proposed building energy simulation, finally, the best optimized HVAC control schedule for the target building can be obtained in the form of "supply air temperature schedule". Throughout the supply air temperature schedule is applied to energy performance simulation, we obtained energy saving effect result on simulation.

Hand Shape Detection and Recognition using Self Organized Feature Map(SOMF) and Principal Component Analysis (자기 조직화 특징 지도(SOFM)와 주성분 분석을 이용한 손 형상 검출 및 인식)

  • Kim, Kyoung-Ho;Lee, Kee-Jun
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.11
    • /
    • pp.28-36
    • /
    • 2013
  • This study proposed a robust detection algorithm. It detects hands more stably with respect to changes in light and rotation for the identification of a hand shape. Also it satisfies both efficiency of calculation and the function of detection. The algorithm proposed segmented the hand area through pre-processing using a hand shape as input information in an environment with a single camera and then identified the shape using a Self Organized Feature Map(SOFM). However, as it is not easy to exactly recognize a hand area which is sensitive to light, it has a large degree of freedom, and there is a large error bound, to enhance the identification rate, rotation information on the hand shape was made into a database and then a principal component analysis was conducted. Also, as there were fewer calculations due to the fewer dimensions, the time for real-time identification could be decreased.

Comparison of Characteristic Vector of Speech for Gender Recognition of Male and Female (남녀 성별인식을 위한 음성 특징벡터의 비교)

  • Jeong, Byeong-Goo;Choi, Jae-Seung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.7
    • /
    • pp.1370-1376
    • /
    • 2012
  • This paper proposes a gender recognition algorithm which classifies a male or female speaker. In this paper, characteristic vectors for the male and female speaker are analyzed, and recognition experiments for the proposed gender recognition by a neural network are performed using these characteristic vectors for the male and female. Input characteristic vectors of the proposed neural network are 10 LPC (Linear Predictive Coding) cepstrum coefficients, 12 LPC cepstrum coefficients, 12 FFT (Fast Fourier Transform) cepstrum coefficients and 1 RMS (Root Mean Square), and 12 LPC cepstrum coefficients and 8 FFT spectrum. The proposed neural network trained by 20-20-2 network are especially used in this experiment, using 12 LPC cepstrum coefficients and 8 FFT spectrum. From the experiment results, the average recognition rates obtained by the gender recognition algorithm is 99.8% for the male speaker and 96.5% for the female speaker.

Segment Join Technique for Processing in Queries Fast (빠른 XML질의 처리를 위한 세그먼트 조인 기법)

  • ;Moon Bongki;Lee Sukho
    • Journal of KIISE:Databases
    • /
    • v.32 no.3
    • /
    • pp.334-343
    • /
    • 2005
  • Complex queries such as path alld twig patterns have been the focus of much research on processing XML data. Structural join algorithms use a form of encoded structural information for elements in an XML document to facilitate join processing. Recently, structural join algorithms such as Twigstack and TSGeneric- have been developed to process such complex queries, and they have been shown that the processing costs of the algorithms are linearly proportional to the sum of input data. However, the algorithms have a shortcoming that their processing costs increase with the length of a queery. To overcome the shortcoming, we propose the segment join technique to augment the structural join with structural indexes such as the 1-Index. The SegmentTwig algorithm based on the segment join technique performs joins between a pair of segments, which is a series of query nodes, rather than joins between a pair of query nodes. Consequently, the query can be processed by reading only a query node per segment. Our experimental study shorts that segment join algorithms outperform the structural join methods consistently and considerably for various data sets.

The Development of an Automatic Tool for Formal Concept Analysis and its Applications on Medical Domain (형식개념분석을 위한 자동화 도구의 개발과 의료분야에서의 적용사례)

  • Kim, Hong-Gee;Kang, Yu-Kyung;Hwang, Suk-Hyung;Kim, Dong-Soon
    • The KIPS Transactions:PartD
    • /
    • v.13D no.7 s.110
    • /
    • pp.997-1008
    • /
    • 2006
  • For extracting and processing information explicitly from given data, Formal Concept Analysis(FCA) is provided a method which is widely used for data analysis and clustering. The data can be structured into concepts, which are formal abstractions human thought allowing meaningful comprehensible interpretation. However, most FCA tools mainly focus on analyzing one-valued contexts that represent objects, attributes and binary relations between them. There we few FCA tools available that provide scaling and analyzing many-valued contexts representing objects, attributes and relations with attributes' values. In this paper, we propose not only a scaling algorithm for interpreting and simplifying the multivalued input data, but also an algorithm to generate concepts and build concept hierarchy from given raw data as well. Based on these algorithms, we develop an automate tool, FCA Wizard, for concept analysis and concept hierarchy. We also present FCA Wizard based applications in medical domain.

Analysis of Turbo Coding and Decoding Algorithm for DVB-RCS Next Generation (DVB-RCS Next Generation을 위한 터보 부복호화 방식 분석)

  • Kim, Min-Hyuk;Park, Tae-Doo;Lim, Byeong-Su;Lee, In-Ki;Oh, Deock-Gil;Jung, Ji-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9C
    • /
    • pp.537-545
    • /
    • 2011
  • This paper analyzed performance of three dimensional turbo code and turbo ${\Phi}$ codes proposed in the next generation DVB-RCS systems. In the view of turbo ${\Phi}$ codes, we proposed the optimal permutation and puncturing patterns for triple binary input data. We also proposed optimal post-encoder types and interleaving algorithm for three dimensional turbo codes. Based on optimal parameters, we simulated both turbo codes, and we confirmed that the performance of turbo ${\Phi}$ codes are better than that of three dimensional turbo codes. However, the complexity of turbo ${\Phi}$ is more complex than that of three dimensional turbo codes by 18%.

Design of the Automotive Gateway Based on a Mapping Table (매핑 테이블 기반의 자동차용 게이트웨이 설계)

  • Oh, Se-Chun;Kim, Eui-Ryong;Kim, Young-Gon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.12
    • /
    • pp.1959-1968
    • /
    • 2016
  • The recent automobiles, a number of ECU inside the vehicle has been used. Also, each ECU is connected to different types of networks in accordance with the characteristics. Therefore, efficient data exchange between discrete network has emerged as a very important element. The gateway is responsible for the ability to exchange data between discrete network. In this study, we propose the new gateway algorithm to provide the structure of the mapping table to improve the efficiency of data exchange between discrete network. Also it provides a structure of a new gateway algorithm with a function of adjusting the priority of the data to be transmitted to another network arbitrarily. Moreover, the proposed gateway structure may simultaneously convert the transmission data input from a particular network to multiple networks. Another advantage is easy to change the entire data structure only if we change the table structure in the gateway.