foreword - drodro.deakin.edu.au/eserv/du:30049292/abawejy-advancedsignal-2012.pdf · braking...

Foreword

Advanced Signal Processing are areas that attracted many academic and industry

professionals to research and develop. The goal of this conference is to bring together the

researchers from academia and industry as well as practitioners to share ideas, problems

and solutions relating to the multifaceted aspects of Signal Processing.

We would like to express our gratitude to all of the authors of submitted papers and to all

attendees, for their contributions and participation. We believe in the need for continuing

this undertaking in the future.

We acknowledge the great effort of all the Chairs and the members of Editorial

Committee of the above-listed event. Special thanks go to SERSC (Science &

Engineering Research Support soCiety) for supporting this conference.

We are grateful in particular to the following speaker who kindly accepted our invitation

and, in this way, helped to meet the objectives of the conference: : Prof. Jemal Abawajy,

Deakin University, Australia.

March 2012

Chairs of ASP 2012

Preface

We would like to welcome you to the Regular Papers proceedings of The 1st

International Conference on Advanced Signal Processing (ASP 2012) which was held

on March 30-31, 2012, at Olympic Parktel, Seoul, Korea.

ASP 2012 is focused on various aspects of advances Advanced Signal Processing. It

provided a chance for academic and industry professionals to discuss recent progress

in the related areas. We expect that the conference and its publications will be a

trigger for further related research and technology improvements in this important

subject. We would like to acknowledge the great effort of all the Chairs and members

of the Editorial Committee.

We would like to express our gratitude to all of the authors of submitted papers and to

all attendees, for their contributions and participation. We believe in the need for

continuing this undertaking in the future.

Once more, we would like to thank all the organizations and individuals who

supported this event as a whole and, in particular, helped in the success of ASP 2012.

March 2012

Jemal Abawajy

Sabah Mohammed

Ronnie D. Caytiles

Yvette E. Gelogo

Organization

General Chair

Jemal Abawajy, Deakin University, Australia

Program Chair

Sabah Mohammed, Lakehead University, Canada

Editorial Committee

Wai-chi Fang, National Chiao Tung University, Taiwan

Adrian Stoica, NASA JPL, USA

Javier Garcia-Villalba, Universidad Complutense of Madrid, Spain

Byungjoo Park, Hannam University, Korea

Aboul Ella Hassanien, Cairo University, Egypt

Dominik Slezak, Warsaw University & Infobright, Poland

Gongzhu Hu, Central Michigan University, U.S.A

Kirk P. Arnett, Mississippi State University, U.S.A

Sankar Kumar Pal, Indian Statistical Institute, India

Martin Drahansky, BUT, Faculty of Information Technology, Czech Republic

Filip Orsag, BUT, Faculty of Information Technology, Czech Republic

Samir Kumar Bandyopadhyay, University of Calcutta, Kolkata, India

Tadashi Dohi, Hiroshima University, Japan

Tatsuya Akutsu, Kyoto University, Japan

Carlos Ramos, GECAD and ISEP, Portugal

Muhammad Khurram Khan, King Saud University, KSA

Hideo KURODA, FPT University, Vietnam

Wenbin Jiang, Huazhong University of Science & Technology, China

Tao Gong, Donghua University, China

Haengkon Kim, Catholic University of Daegu, Korea

Byeongho Kang, University of Tasmania, Australia

Jin Wang, Nanjing University of Information Science & Technology, China

Table of Contents

An Intelligent Buffer Management for Packet Scheduling Algorithm in Multihop

Wireless LANs ........................................................................................................................... 1

Nor Aida Mahiddin, Sulaiman Mahiddin, Wan Mohd Hasbullah Wan Abd Rahman

A Trust Community Clustering in E-commerce ........................................................................... 2

Shaozhong Zhang, Jungan Chen, Haidong Zhong, Zhaoxi Fang, Jiong Shi

Low Complexity Bi-directional Image Quality Assessment for Digital Image Stabilization ......... 3

Sangwoo Ahn, Linbo Luo, Jongpark Kim, Jongwha Chong

Analysis of SCTP and TCP in Voice Communication ................................................................. 4

Ikram Ud Din, Noor ul Amin, Arif Iqbal

Vietnam License plate characters and numbers recognition based on improved algorithm using

Artificial neural network ............................................................................................................. 5

VinhDu Mai, Duoqian Miao, Ruizhi Wang, Hongyun Zhang

A Study on Interoperability for Systems Operating in VHF/UHF Bands

with Geographic Information ...................................................................................................... 6

Kyoung-Whoan Suh, Jung-Ho Ahn, Jeong-Seok Jang, Jong-Hyeon Ahn, Dae-Ho Kim,

Chang-Won Lee, Im-Seob Shim, Yong-Chan Jeon

Robust Hand Gesture Recognition with P-N Learning ................................................................. 7

Hong-Min Zhu, Chi-Man Pun and Cong Lin

Face Super-Resolution via Shape Classification and Subspace Learning ...................................... 8

Lu Tao, Hu Ruimin, Han Zhen, Xia Yang, Gao Shang

Automated Segmentation and WP-SVD Method for Classifying Pulmonary Nodule Image ......... 9

Tak-Yee Wong, Ching-Hsue Cheng

Mobile Agent Group Communication Protocol Guaranteeing Totally Ordered Message

Delivery Condition ................................................................................................................... 10

Jinho Ahn

The Improvement of the Reliability of the ADS-B data by employing an IMM Filter ................ 11

Taehwan Cho, Inseong Song, Eunmee Jang, Wanoh Yoon, Sangbang Choi

Improved Coarse Range Alignment for ISAR Imaging Multiple Targets Flying in Formation .... 12

Sang H. Park, Moon G. Joo

A Non-Contact Positive Electrode for the Precision Reclamation of Display Surfaces ............... 13

P.S. Pa

A Robot Design with Energy Saving Performance via an Effective Regenerative

Braking Control System ............................................................................................................ 14

P.S. Pa, S.C. Chang, J.H. Shieh

An Untraceable, Anonymity and Secure Sealed-bid Auction Schemes using Threshold

Cryptosystem without A Third Party ......................................................................................... 15

Wei-Chen Wu, Horng-Twu Liaw, and Chih-Ta Yen

A Skin Region detection Method by Statistical and Possible World Models .............................. 16

Keming Mao, Zhiliang Zhu, Jun Na, Zhuofu Deng

Human Action Recognition Using Segmentation of Accumulated Movement ............................ 17

Nae Joung Kwak, Teuk-Seob Song

A Detection Method of Multicomponent LFM Signals Based on S-Transform Ridge

and Hough Transform .............................................................................................................. 18

Dianwei Wang, Jiulun Fan, Yonghua Li, Ying Liu, Daxiang Li

Iterative Equalization Scheme of Power Line Communication Systems for Ubiquitous

Healthcare Applications ............................................................................................................ 19

Yoon Hyun Kim, Jin Young Kim

Novel Interference Mitigation Scheme for Convergence System Based on PLC and VLC ......... 20

Yoon Hyun Kim, In Hwan Park, Jae Soo Yang, Yocheol Kim, Jea Sang Cha,

Kye San Lee, Yeong Min Jang, Jin Young Kim

Classification of Normal and Overweight Women using Facial Characteristics

for Medical Applications ........................................................................................................... 21

Bum Ju Lee, Jun-Hyeong Do, Jong Yeol Kim

Classification of pulmonary Nodule from Low dose CT Scan Images using Neural Network ..... 22

M. Arfan Jaffar, Wook-Jin Choi, Tae-Sun Choi

Reversible Data Hiding with Large Embedding Capacity for Color Palette Images .................... 23

Munkhbaatar Doyoddorj, Chul Sur, Youngho Park and Kyung-Hyune Rhee

A 3D Registration Algorithm for Abdominal PET-CT and MR images Using Intensity

and Feature Information ............................................................................................................ 24

Hakjae Lee, Kisung Lee, Jungmin Kim, Sung-Kwan Joo, Gi-Jeong Cheon,

Sang Moo Lim, and Kyeong Min Kim

Artificial Neural Network for the Diagnosis of Genes in Human Skeletal

Muscle Channelopathies ........................................................................................................... 25

InSeop Na, MyeongKyu Kim, SangCheol Park, SooHyung Kim and Ha Le

Improved Histogram Specification using Multiresolution in the Spatial Domain

for Image Enhancement ............................................................................................................ 26

Kyung-Moo Huh, Su-Min Kang, and Young-Bok Joo

Design of Equalized Maximum Likelihood Sequence Receiver for a Magnetic

Recording Channel ................................................................................................................... 27

Chung-Jung Huang, Tsai-Sheng Kao, Hao-Hsiang Ku, and Hsia-Hung Ou

A Novel Container ISO-Code Recognition Method using Texture Clustering with

a Spatial Structure Window ....................................................................................................... 28

Kyung-mo Koo, Eui-young Cha

Real-time Estimation of Length and Energy Expenditure of Each Step using Noisy

and Orientation-free Acceleration Obtained from an Android Smartphone................................. 29

Yao Meng, Hee-Cheol Kim and Sang-Hoon Yi

An Improved Fast 2DPCA based Nonlocal Means filter ........................................................... 30

Yuhui Zheng, Jianwei Zhang, Wei Tian ,Yunjie Chen, Lu Liu

Hybrid Image Segmentation using Compression and Texture based Region Merging ................ 31

Ning-Yu An, Chi-Man Pun

Human and Robot Tracking Using Histogram of Oriented Gradient Feature

in Intelligent Space ................................................................................................................... 32

Jeong-Eom Lee, Joo-Hyung Kim, Sang-Jun Kim, Gon-Soo Kim,

Joo-Ho Lee and Gwi-Tae Park

The Evaluation of Reliability for Clinical Performance Ability Using

Computer-based Examination ................................................................................................... 33

Seong-Ran Lee

Optimized Facial Features-Based Age Classification ................................................................. 34

Md. Zahangir Alom, Ruoyu Du, Hyo Jong Lee

Facial Expressions Recognition from Complex Background Using Face Context

and Adaptively weighted sub-pattern PCA ................................................................................ 35

Md. Zahangir Alom, Ruoyu Du, Hyo Jong Lee

Photo Retrieval based on a Combination of Geo-referenced Attributes and Low-level

Visual Features ......................................................................................................................... 36

Yong-Hwan Lee, Hyochang Ahn, Han-jin Cho, June-Hwan Lee and Sang-Burm Rhee

Area-Efficient Fault-Handling for Survivable Signal-Processing Architectures .......................... 37

Naveed Imran, Jooheung Lee, Youngju Kim, Mingjie Lin, and Ronald F. DeMara

Face Recognition System Using Improved Super-Resolution Reconstruction Method ............... 38

Sang-Heon Lee, Myoung-Kyu Sohn, Soo-Ah Yoon, Tae-Gyoun Lee,

Jin-Ho Cho and Chul-Ho Won

Fast Image Stitching Based on Improved SURF Algorithm ...................................................... 39

Hyochang Ahn, Yong-Hwan Lee, Han-Jin Cho, June-Hwan Lee, Sang-Burm Rhee

A new LDPCA decoding Method for Distributed Video Coding ................................................ 40

Hwanseok Jang, Sangwoo Lee, Sang Ju Park

A Novel Fast Mode Decision Algorithm on the Enhancement Layer in H.264/AVC

Scalable Video Coding .............................................................................................................. 41

Sangwoo Lee, Sang Ju Park

Enhancement of Generic Graph cut Algorithm by Flat Area Filtering in Stereo Matching .......... 42

Hoang Giang Son, Seong Ik Cho, Kisung Lee, Sung-Kwan Joo,

Seunghwan Ro, and DongYong Kwak

Symmetric Data-Conjugate Method for ICI Minimization in OFDM System ............................. 43

Heung-Gyoon Ryu and Do-Hoon Kim

Performance Evaluation of Noisy Wireless OFDM Channel Using 64-Quadrature

Amplitude Modulation .............................................................................................................. 44

Maksudur Rahman Jonayed and Sung Won Kim

Study on the Optimal Analysis Method for Nonlinear System Using Orthogonal

Function Matrices ..................................................................................................................... 45

Joon-Hoon Park

Non-Root Based Decentralized Hybrid Wireless Mesh Protocol for Wireless Mesh Networks ... 46

Madhusudan Singh and Song-Gon Lee

Genetic Design of Interval Type-2 Fuzzy Set-based Fuzzy Neural Networks

with Multiple-Output ................................................................................................................ 47

Keon-Jun Park, Dong-Yoon Lee

A Security-Provable Communication Protocol of RFID Systems in Internet of Things .............. 48

HuiDan Gao, YaJun Guo, JianQun Cui, HengGeng Hao, Hui Shi

Automatic Flower Recognition using Smartphone ..................................................................... 49

Soon-Won Hong, Byung Joon Park and Lynn Choi

Efficient mixed-radix FFT architectures .................................................................................... 50

Jinyong Lee, Youngseh Kim, Kanghoon Kim and Younglok Kim

An Image Retrieval System Using a New Graph Matching Approach ........................................ 51

Sangcheol Park, Wanhyun Cho, Sunworl Kim, and Soonyoung Park

Detection and Recognition of Multiple Moving Objects in Video Sequence using Fast Level

Set Method and Hidden Markov Model .................................................................................... 52

Wanhyun Cho, Sunworl Kim, Sangcheol Park, Jonghyun Park, Soonyoung Park

A Resource Scheduling Mechanism for Power Reduction in Extended Virtual

Machine System ....................................................................................................................... 53

Yunfa Li, Qili Zhou, Jian Wan, Rong Ouyang, Jiling Zhang, Xingdong You

Analysis and Compensation of Phase Noise in the MISO SFBC DFT-Spread

OFDM Communication System ................................................................................................ 54

Heung-Gyoon Ryu, Donggeon An

Prognostic Marker for Patients in the Non ST Elevation Myocardial Infarction ......................... 55

Ho Sun Shon, Jang-Whan Bae, Kyung-Kuk Hwang, Keun Ho Ryu

A Multimodal Fusion Algorithm Based on FRR and FAR Using SVM ...................................... 56

Yong Li, Jianping Yin, En Zhu, Fayao Liu, Xinwang Liu, Jianmin Zhao

Trend Following With Float-encoding Genetic Algorithm ......................................................... 57

Yain-Whar Si, Simon Fong, Jiahua Luo

Mining Association Rules in Microarray Datasets by Using a MapReduce Framework ............ 58

Md. Rezaul Karim, A. T. M Golam Bari, Byeong-Soo Jeong, and Ho-Jin Choi

Financial Time Series Representation Based on Turning Points with Sliding Window ............... 59

Yain-Whar Si, Jiangling Yin

Blind Deconvolution Based on Empirical Mode Decomposition in Ultrasonic Evaluation ......... 60

Youngseok Lee, Myungwoo Nam

Time Domain Audio Watermarking Scheme for Copyright Protection Based

on Multiple Embedding............................................................................................................. 61

Md. Rifat Shahriar, Sangjin Cho, Ui-Pil Chong

A Study on Color-Texture Image Watermarking Based on Texture Analysis ............................. 62

Myeongsu Kang, Truc T. K. Nguyen, Cheol-Hong Kim, and Jong-Myon Kim

Facial Expression Recognition Using Gabor Filter and Local Transitional Pattern ..................... 63

Tanveer Ahsan, Taskeed Jabid, Ui-Pil Chong

Parallel Approaches for Medical Image Registration ................................................................. 64

Jong-Myon Kim and Cheol-Hong Kim

Design of Cost and Performance Efficient Fast Fourier Transform Processors

with Various Number Systems .................................................................................................. 65

Seung-Ho Ok, Sungho Kang, Jin-Ho Ahn, Yong-Hwan Lee, Byungin Moon

Protecting Malicious Attacks from Unauthorized WOL ............................................................. 66

Simon S. H. Park, Wookey Lee, Chasung Lim and Jumi Kim

Classification of Camera-Models based on Two-step Transition Matrix .................................... 67

Shang Gao, Rui-Min Hu, Tao Lu

Determining the Discontinuities and Locations for Three Dimensional Trajectory Data

Analysis in Teleoperation ......................................................................................................... 68

Kiwon Yeom, Stephen R. Ellis, Bernard D. Adelstein

Self-Synchronized Peak Alignment for Flexible Comparison of Teleoperated Mobile

Object Trajectories .................................................................................................................... 69

Kiwon Yeom, Stephen R. Ellis, Bernard D. Adelstein

Utterance Verification for POI Item Recognition in Automotive Navigation Application ........... 70

Jeomja Kang, Youngjoo Suh, Hoirin Kim, Young-Sun Yun

Priority-based Chunk Scheduling Algorithm for Large Scale P2P Live Streaming System ......... 71

Hongyun Yang, Ruimin Hu, Xuhui Chen

The Master-Slave Time Synchronization Protocol for Ubiquitous Sensor Network .................... 72

Moonsun Shin, Bumju Lee, Youngjin Jung

Improvement of the Position Estimation of Mobile Robot Using Multi-Sensor Fusion ............... 73

Taeseok Jin, Hyunsik Kim, and Jongwook Kim

Development of Pressure Sensor and Comparison of Carotid/Radial Pulses and Central

Aortic Pulse .............................................................................................................................. 74

Ran Wei, Young Chul Lim, Hee Sun Kim, Moo Yong Rhee, Jae Joong Im

Implementing Cloud Computing in the Current IT Environments of Korean

Government Agencies ............................................................................................................... 75

Jong-Seok Kim, Mihye Kim, Hyeong-Ok Lee

A Failure Analysis for Search Engines Using Inference Networks ............................................. 76

Sa-kwang Song, Sung Hyon Myaeng, Hanmin Jung, Seung-Woo Lee

Dynamic Materialization of Wildcard Rules for Improving the Efficiency

of Rule-based Reasoning ........................................................................................................... 77

Seungwoo Lee, Hanmin Jung, Pyung Kim

Secure Overlay Network Service for Global Cooperation .......................................................... 78

DaeHee Seo, JangMi Baek, GaeIl An, YoungHwan Bang, KangChan Lee

A Study on Information Security in Smartwork ......................................................................... 79

Hee-Kyung Kong, Kihoon Sung

All-optical Coder/Decoder for Packet-level Synchronization and Header Recognition

for Mesh-Connected Ring Networks ......................................................................................... 80

Hae Geun Kim, Hyuek Jae Lee

Hybrid Sensing Model using User Scenario for Smart Service .................................................. 81

Svetlana Kim and YongIk Yoon

A Situation-awareness based Error Sharing Agent running on a Cloud Computing

Environment ............................................................................................................................. 82

Eungnam Ko, Soongohn Kim

Typhoon Recognition and Center Positioning based on Satellite Cloud Image ........................... 83

Wei Tian, Tinghuai Ma, Jin Wang, Qiaoqiao Yan, Sungyoung Lee

Optimal Wireless Sensor Nodes Placement using Fuzzy C-means Algorithm ............................ 84

Ki Hwan Eom, Chong Ryol Park, Sang Won Yoon, Kyung Kwon Jung

A Feedback-Diffusion Scheme with Modified Huffman Coding in Wireless

Sensor Networks ....................................................................................................................... 85

Myungho Yeo, Jaesoo Yoo, Dongmin Seo

Energy Efficient Feedback Message Communication using Intermediate Node Selection

and Control in INSENS ............................................................................................................. 86

Ji Won Kim, Tae Ho Cho

An Efficient User Authentication Scheme for Wireless Communications .................................. 87

Woongryul Jeon, Kwangwoo Lee, Byunghee Lee, Yunho Lee, Dongho Won

A Runtime System Behavior Evaluation Methodology for Autonomic Systems Using

Dynamic Weight-changing method ........................................................................................... 88

Chonghyun Lee , Hyunsang Youn, Ingeol Jeon, Eunseok Lee

A Practical and Secure Remote User Authentication Scheme Using Smart Cards ...................... 89

Jin Qiuyan, Kwangwoo Lee, Dongho Won

Misconfiguration Analysis and Design Guidelines for Routing Policy Configuration

Management ............................................................................................................................ 90

Sihyung Lee and Hyong S. Kim

Detection of Inside and Outside Attacks in Sensor Networks combining SEF and LEAP ........... 91

Su Man Nam, Tae Ho Cho

EBCHS : An Energy Balanced Cluster-Heads Selection Method

for Wireless Sensor Networks ................................................................................................... 92

Choon-Sung Nam, Young-Shin Han and Dong-Ryeol Shin

Genetic Algorithm Based Secure Data Transmission for Wireless Sensor Networks .................. 93

Jin Myoung Kim, In-Geol Chun, Won-Tae Kim

Malicious Node Detection in Mobile Sensor Networks Using Sequential Analysis .................... 94

Jun-Won Ho

Large Vocabulary Continuous Speech Recognition Combining with Likelihood-based

Features based on Segmental Conditional Random Fields ......................................................... 95

Hwa Jeon Song, Hoon Chung, Euisok Chung, Byong-Ok Kang, Hyungbae Jeon,

Yunkeun Lee, and Ho-Young Jung

A Packet Loss Concealment Algorithm Based on Artificial Bandwidth Extension

for Scalable Wideband Speech and Audio Coding ..................................................................... 96

Nam In Park, Jin Ah Kang, and Hong Kook Kim

Hierarchical Multiple Endpoint Detection for Speech Recognition in Mobile Environments ...... 97

Kiyoung Park and Yunkeun Lee

MDCT-Domain Noise Reduction with Block Switching for the Application

to MPEG Audio Coding ............................................................................................................ 98

Kwang Myung Jeon, Nam In Park, Hong Kook Kim, Myung Kyu Choi,

Lighton Cephas Hwang, and Sang Ryong Kim

Speech Enhancement Based on Blind Signal Cancellation in the Presence of Diffuse

Background Noise .................................................................................................................... 99

Jaesik Hwang and Hyung-Min Park

Extension of DUET for Blind Separation of Speech Signals in Reverberant Environments ...... 100

Tae-Jun Lee, Minook Kim, and Hyung-Min Park

Cancellation of Nonlinear Acoustic Interference in Dual Smartphone Scenarios

for Robust Speech Recognition ............................................................................................... 101

Jeong-Sik Park, Gil-Jin Jang, Ji-Hwan Kim, and Sang-Hoon Kim

Monaural Speech Segregation Based on Pitch Track Correction Using Particle Filtering ......... 102

Han-Gyu Kim, Gil-Jin Jang, Jeong-Sik Park, Yung-Hwan Oh

Fast Language Model Adaptation Using MDI ......................................................................... 103

Donghyun Lee, Kyunghee Lee, Kwang-Ho Kim, Ji-Hwan Kim,

Hyungbae Jeon, and Yunkeun Lee

Analysis of Desynchronization in Music Identification ............................................................ 104

Namhyun Cho, Dong-hoon Shin, Kwang-Ho Kim, Jeong-Sik Park, Gil-Jin Jang,

and Ji-Hwan Kim

Low Bit-Rate Super-Wideband Speech and Audio Coding based on Sinusoidal Coding

and Spectral Band Replication ................................................................................................ 105

Kosangrok Oh, Dong Hoon Sung, and Seung Ho Choi

Howling Detection based on Statistical Analysis of Temporal Power Spectra .......................... 106

Jae-Won Lee and Seung Ho Choi

RF Impairment Compensation Technique for Millimeter-Wave Broadband

Multimedia Communication Systems ...................................................................................... 107

Hyung Chul Park09

Advanced Congestion Adaptive Routing Mechanism .............................................................. 108

Geetam Singh Tomar

Enhancement of Security in MAODV using SHA-512 ............................................................ 109

Gulshan Kumar, Mritunjay Rai, Tae-sik Kim

Adaptive Learning in Agents Behavior: A Framework for Electricity Markets Simulation ....... 110

Tiago Pinto, Zita Vale, Tiago M. Sousa

Secure Auto-Configuration Protocols in Mobile Ad Hoc Networks ......................................... 111

Ana Lucila Sandoval Orozco, Julián García Matesanz, Luis Javier García Villalba,

José Duván Márquez Díaz and Tai-hoon Kim

Application of Mobile Technology in Virtual Communities with Information

of Conflict-Affected Areas ...................................................................................................... 112

Julio César Rodríguez Ribón, Luis Javier García Villalba and Tai-hoon Kim

Dynamic Service-Driven Credential Management for Grid Computing ................................... 113

Jemal H. Abawajy and Taihoon Kim

A Real-time Detection of Moving Object Inspired from Frog's Visual Characteristic ............... 114

Zhiyong Li, Zhen Jiang, Junmin Liu, Chao Chen

Interaural Time Difference Estimation for Binaural Speech Separation in Reverberant

Multi-Source Environments .................................................................................................... 115

Ji Hun Park and Hong Kook Kim

The importance of considering costs in inductive learning ....................................................... 116

Alberto Freitas, Pavel Brazdil, Altamiro da Costa-Pereira

Quality in hospital administrative databases ............................................................................ 117

Alberto Freitas, Juliano Gaspar, Nuno Rocha, Goreti Marreiros,

Altamiro da Costa-Pereira

Advanced Signal Processing (ASP 2012), Conference Proceedings

1

Abstract: An Intelligent Buffer Management for Packet Scheduling

Algorithm in Multihop Wireless LANs

Nor Aida BintiMahiddin1*

, Ahmad Nazari Bin Mohd Rose1, Shamala Subramaniam

2,

Sulaiman Bin Mahiddin3, WM Hasbullah Bin Wan AbdRahman

1

1University Sultan ZainalAbidin

2University Putra Malaysia

3Scan Associates

{aidamahiddin}@unisza.edu.my, {anm}@unisza.edu.my,

{shamala}@fsktm.upm.edu.my,

{sulaiman}@scan-associates.net, {wmhasbullah}@unisza.edu.my

*corresponding author

Abstract

In this paper, an intelligent buffer management for packet scheduling algorithm in

multihop wireless LANs has been proposed. In the recommended scheme, the

mechanism of adaptive scheme will be integrated with a queue scheduler, as an effort

to enhance the performance of the packet scheduling. The modus operandi of the

strategy is intelligently identified the buffer and route based on the intended server’s

availability. By doing so, it has been shown that the problem of packet loss has been

successfully avoided. When simulated, the proposed scheme has demonstrated better

achievement in per-flow fairness compared to FIFO and max-min algorithm.


2

Abstract: A Trust Community Clustering in E-commerce

Shaozhong Zhang1*

, Jungan Chen1, Haidong Zhong

2, Zhaoxi Fang

1, Jiong Shi

1

1 Institute of Electronics and Information, Zhejiang Wanli University,

315100, Ningbo,China

2 Institute of Modern Logistics, Zhejiang Wanli University,

315100, Ningbo,China

*[email protected]

Abstract

Users may buy or use the services of a commodity or business only when they trust

them in e-commerce environment. This trust as a reputation can be built up by the

business itself. However, users tend to trust the evaluation of the goods or business

around other users. Many e-commerce sites have established a variety of evaluation

rating system. The most care about is what the user should trust facing with these

large comments. This paper presents a social network to analysis trust network in E-

commerce. Direct trust information degree and global trust information degree are

used to build trust relations among subjects and combine the shortest path algorithm

to build trust network. A trust community clustering is constructed and a clustering

algorithm presents for E-commerce trust network. Experiments show that the method

of building trust through the network model can well describe the main indirect E-

commerce trust and the algorithm has obvious advantages in accuracy and time cost.

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant

No. 71071145 and 61003254) , the Natural Science Foundation of Zhejiang Province

(Grant No.Y6090027, Y1101123, and Y1110200 ) and the Modern Port Service

Industry and Culture Research Center of the Key Research Base of Philosophy and

Social Sciences of Zhejiang Province.


3

Abstract: Low Complexity Bi-directional Image Quality Assessment

for Digital Image Stabilization

Sangwoo Ahn1, Linbo Luo

2, Jongpark Kim

3, Jongwha Chong

2*

1 Department of Nanoscale Semiconductor Engineering, Hanyang University, Seoul,

Rep. of Korea, 2Department of Electronics and Computer Engineering, Hanyang University,Seoul,

Rep. of Korea, 3 CIS Digital Design Group, SK Hynix Semiconductor Inc., Seoul, Rep. Korea

*[email protected]

Abstract

In this paper, a computational model to measure the image quality of digital image

processing is proposed. The computational models for image quality assessment (IQA)

based on the fact that edges of objects play an important role in the human visual

system have been researched. Considering this characteristic, edge width which

indicates clarity of edge is measured. After obtaining the edge width, values are

normalized suitable for assessment. The simulations which are performed on

benchmark IQA databases demonstrate that the proposed algorithm can achieve high

consistency with the subjective evaluations and has low computational complexity.

Consequently, the proposed method can be applied to digital image stabilization due

to its low computational complexity.


4

Abstract: Analysis of SCTP and TCP in Voice Communication

IkramUd Din, Noor ul Amin, ArifIqbal

Department of IT, Hazara University

[email protected], [email protected], [email protected]

Abstract

The number of users is increasing rapidly with the transmission of voice over IP;

therefore, it is indispensable to provide fast transmission without delay and jitter,

which severely affect voice quality. This paper examines the performance of two

transport layer protocols: SCTP and TCP in transmission of voice packets. Generally,

when packets arrive at destination then these packets are affected by jitter, therefore,

researchers apply different algorithms on them in the buffer to minimize jitter. In this

paper, the Chunk-based Jitter Management (CJM) algorithm is applied on packets in

the buffer. The paper presents two topologies to analyze the performance of TCP and

SCTP in case of delay and jitter. The functionality of these protocols is simulated and

tested in NS2. The results show a good increase in throughput and delay and jitter

minimization.

Acknowledgements

This research has been supported and funded by Hazara University, Mansehra,

Pakistan.


5

Abstract: Vietnam License plate characters and numbers recognition

based on improved algorithm using Artificial neural network

VinhDu Mai1,2

, Duoqian Miao1, Ruizhi Wang

1, Hongyun Zhang

1

1Department of Computer Science and Technology,

Tongji University, Shanghai, China 2Electrical & Electronic Department,

University of Transport and Communications, Vietnam

[email protected], [email protected], [email protected],

[email protected]

Abstract

In this paper, we focus on the characters & numbers recognition part and give out an

improved method to recognize characters & numbers of Vietnam License Plates (LP),

we will use a Multi Layer Perceptron (MLP) neural network and back-propagation

(BP) algorithm to recognize characters & numbers of the Vietnam LP. In the training

work, we will use two networks for characters & numbers training with noises, which

the computing time and accuracy will be improved, in the using network work, we

will use the image processing technology for pre-processing to obtain high quality of

characters & numbers before put in the trained network to improve accuracy of the

system. Specially, we will consider for the specific characteristics of Vietnam LP

(size, shape, one-row LP and two-row LP) and we implemented 600 Vietnam LP

images, which obtained from the actual system, these images are very different

background such as illumination, license angles, size and type, colors, light conditions

in Vietnam environment. Our approach more effective than of some the existing

method earlier and satisfied for all types and color of Vietnam license plates and

Vietnam environment, average rate of accuracy to is 98.00% and average computing

time is 0.13s to finish recognize a LP image.

Acknowledgements

This work supported by National Natural Science Foundation of China (No.

60970061, 61075056) and the Fundamental Research Funds for the Central

Universities.


6

Abstract: A Study on Interoperability for Systems Operating in

VHF/UHF Bands with Geographic Information

Kyoung-Whoan Suh1,*

, Jung-Ho Ahn2, Jeong-Seok Jang

3, Jong-Hyeon Ahn

2, Dae-Ho

Kim2, Chang-Won Lee

4, Im-Seob Shim

4, Yong-Chan Jeon

4

1Electronic Engineering, Kangnam University,

2Computer and Media Information Engineering, Kangnam University,

3Instutute of Industrial-Academic Technology, Kangnam University,

4Advanced Defense Development

1,2,3111, Gugal-Dong, Giheung-Gu, Yongin-City, Gyeonggi-Do, 446-702, Korea

4Songpa P.O Box 132, Seoul, 138-600, Korea

{1kwsuh,

2markajh,

2helloplay,

2jungho}@kangnam.ac.kr,

[email protected],

{4changwon,

4imseob,

4ycjeon}@add.re.kr

Abstract

Taking advantage of radio propagation prediction of Rec. ITU-R P.1546, used for

terrestrial services in the VHF and UHF bands, with geographic information,

formulations of received signal and discrimination angle are presented to assess

interoperability for wireless systems. The frequency-distance separation rule has been

adopted for interference analysis based upon the minimum coupling loss with the

maximum allowable interference level. To obtain some numerical results for assumed

system parameters, real geography data are taken for the given area, and performance

evaluations including protection ratio and frequency dependent rejection are also

reviewed for 64-QAM fixed wireless system, interfered with radar operating at co-

channel frequency as well as frequency offset. Finally to examine interference effect

of victim receiver with respect to radar beam direction, the received interference

powers are calculated as functions of frequency offset and azimuth as well as

elevation angles. The methodology developed here can be actually applied to evaluate

frequency coordination for various frequency dependent systems under the net-centric

warfare (NCW) environment.


7

Abstract: Robust Hand Gesture Recognition with P-N Learning

Hong-Min Zhu, Chi-Man Pun and Cong Lin

Department of Computer and Information Science

University of Macau, Macau SAR, China

{yb07422, cmpun, yb17403}@umac.mo

Abstract

Human action understanding is one of the most attractive research areas in computer

vision. In this paper, we focus on a subset of human action which is the gesture

performed by hand motion. To track the trajectory of motion, we adopt efficient and

robust object detection and tracking schemes, which used Randomized Forest and

Online Appearance model. Multiple hand templates are leaned using positive and

negative samples (P-N learning). According to robust hand tracking and trajectory

enhancement, we recognize the gesture with the baseline SVM tool. The effectiveness

of the approach is demonstrated by experiments on the dataset of hand signed digit

gestures.

Acknowledgements

The authors would like to thank the referees for their valuable comments. This work

was supported in part by the Research Committee of the University of Macau.


8

Abstract: Face Super-Resolution via Shape Classification and

Subspace Learning

Lu Tao1,2

, Hu Ruimin 1,3

, Han Zhen 1,3

, Xia Yang1, Gao Shang

1

1National Engineering Research Center on Multimedia Software, Wuhan University,

Wuhan 430072, China 2Hubei Province Key Laboratory of Intelligent Robot, College of Computer Science

and Engineering Wuhan Institute of Technology, Wuhan, 430073, China

3School of Computer, Wuhan University, Wuhan 430072, China

{lut,rmhu,zhenh,xiay,gaos}@whu.edu.cn

Abstract

In learning-based super-resolution algorithm, it is very important to select the train

dataset for getting more accurate priori. A novel Face shape classification algorithm

based on Hausdorff Distance is proposed in this paper. The most similar faces are

selected to build up the train dataset due to the face shape similarity. Firstly, Active

Shape Model is used to get the face shape vectors which contain some information

about face contour. Then Iterative Self organizing Data Analysis Techniques

Algorithm (ISODATA）classifies all faces from Chinese face dataset into certain

categories based on Hausdorff Distance. And subspace learning-based eigenface are

used to achieve satisfied image quality with the selected train dataset. Experiments

show that the face super-resolution algorithm based on shape classification can

improve the subjective and objective quality of the input low-resolution face images

and can outperform many state-of-the- art global-based face super-resolution methods.

Acknowledgements

This paper was supported by the major national science and technology special

projects （2010ZX03004-003-03, the National Natural Science Foundation of China

(61172173, 60832002,61070080,60970160, 61003184), the Natural Science

Foundation of Hubei Province of China (2009CDA134, 2010CDB05103), the

Fundamental Research Funds for the Central Universities (201121102020009，

3101011), the Hubei Province Key Laboratory of Intelligent Robot（HBRI 200907）,

the youths science foundation of Wuhan institute of technology.


9

Abstract: Automated Segmentation and WP-SVD Method for

Classifying Pulmonary Nodule Image

Tak-Yee Wong2, Ching-Hsue Cheng

1*

1Department of Information Management, National Yunlin University of Science and

Technology, 123, Section 3, University Road, Touliu, Yunlin 640, Taiwan 2Department of Radiology, St. Martin de Porres Hospital, Chiai Taiwan

*[email protected]

Abstract

In the last decade, the high prevalence of lung cancer, more and more researcher

concern about diagnosing pulmonary lesions in chest computed tomography (CT).

However, the great amount of CT scans of each patient still is a challenge for

specialists, specialists would spend a great amount of their time and effort to analysis

those CT scans. So the fatigue of specialists was considered as limitation in the early

diagnosis stage. And the inter-reader variability in the detection of nodules by

specialists may exist. Hence, many literatures have proposed methods for automatic

diagnosis by computer-aided detection (CAD) to assist artificial inspection. But there

are some problems brought with those proposed methods, such as time-consuming

work of automatically diagnosing by CAD for the large number of CT slices. Based

above mentioned problem, this study proposes a hybrid method to initially classify

lungs images. Firstly, adjusting the contrast of chest images can change those images

from indistinct to clear, and then proposed a novel hybrid method. From the results,

this paper can obtain three contributions: (1) Proposed automated segmentation

method can refine the lungs regions and improve the classification performance. (2)

The proposed method can be executed before doctor diagnosis or computer-aided

system, which can be sure that input CT image need to be detected out the actual

positions, shapes or other information of nodules. (3) The results display a higher

accuracy in RS based on WP-SVD than other classification methods, which verifies

that proposed method can reduce time and cost of lung nodule diagnosis.


10

Abstract: Mobile Agent Group Communication Protocol

Guaranteeing Totally Ordered Message Delivery Condition

Jinho Ahn

Dept. of Comp. Sci., Kyonggi Univ., 94-6 Iuidong, Yeongtong, Suwon Gyeonggido

443-760, Republic of Korea

[email protected]

Abstract

In this paper, an atomic mobile agent group communication protocol is designed to

have the following beneficial features. The protocol enables each agent to adaptively

choose a small number of forwarders among its visiting nodes based on its decision.

This feature leads to avoiding the home node centralization, and reducing the size of

storage for saving agent location information required by each forwarder and the

length of the routing path to targeted agents. Also, it replicates paths on which

messages should be transmitted to their targeting mobile agents in an effective manner.

The mobile agent group location cache each sending agent keeps in our protocol can

considerably speed up message delivery to a group of agents and lower message

forwarding load imposing on forwarders. Furthermore, it allows messages destined to

a group of agents to be reliably delivered to all surviving agents in the same order

despite their mobility and F forwarders' failures unlike the other existing ones.

Simulation results indicate that our protocol considerably performs better than the

existing one in terms of message delivery and location information management costs.

Acknowledgements

This work was supported by Kyonggi University Research Grant 2010.


11

Abstract: The Improvement of the Reliability of the ADS-B data

by employing an IMM Filter

Taehwan Cho*, Inseong Song, Eunmee Jang, Wanoh Yoon, Sangbang Choi

Department of Electronics Engineering, Inha University, Incheon, Korea

[email protected]*, [email protected]

Abstract

With the advances of CNS/ATM, the new scheme for air traffic management, the

digital communication based ADS-B system is being implemented in the surveillance

field. However, since the position information gleaned from the ADS-B system is

obtained from the GNSS, the reliability of the ADS-B relies on this information and

therefore the ADS-B data includes GNSS errors. In this paper, we applied an IMM

filter to the ADS-B data in order to improve the reliability of the ADS-B data.

Comparisons with the original ADS-B data and the ADS-B data with the IMM filter

show that the ADS-B data with the IMM filter provides a better performance. The

errors in the original ADS-B data are 33.2m, but errors in the ADS-B data with the

IMM filter are 28.8m.

Acknowledgements

This research was supported by a grant (code# 10aviation-navigation01) from

Aviation Improvement Program funded by Ministry of Land, Transport and Maritime

Affairs of Korean government.


12

Abstract: Improved Coarse Range Alignment for ISAR Imaging

Multiple Targets Flying in Formation

Sang H. Park1 and Moon G. Joo

2

1Department of Electronic Engineering, Pukyong National University,Busan, Korea

2Department of Information and Communications Engineering,Pukyong National

University, Busan, Korea

[email protected]

Abstract

A novel algorithm to coarsely align range profiles derived from multiple targets flying

in formation is presented. The flight trajectory is modeled using a combination of a

polynomial and Gaussian basis functions. Initial parameters of the polynomial and

Gaussian basis functions are determined by fitting the proposed model to the center of

mass curve of a new binary image derived from the range profile history using the

least square curve-fitting algorithm, and the optimum value is found using particle

swarm optimization. This method is computationally more efficient and less sensitive

to mismatch between the polynomial and the trajectory than is the existing segmented

alignment.

Acknowledgements

This work is the result of the "Human Resource Development Center for Economic

Region Leading Industry" Project, supported by the Ministry of Education, Science &

Technology (MEST) and the National Research Foundation of Korea (NRF).


13

Abstract: A Non-Contact Positive Electrode for the Precision

Reclamation of Display Surfaces

P.S. Pa

Department of Digital Content Design, Graduate School of Toy and Game Design

National Taipei University of Education, No.134, Sec. 2, Heping E. Rd., Taipei City

106, Taiwan

[email protected]

Abstract

A newly designed removal process for the optical device surfaces is presented that is

safe and highly efficient. It uses a non-contact positive electrode that replaces the

workpiece-anode (contact module) of the traditional micro-electrochemical machining

process, for the precision reclamation of display color filter surfaces. A small gap

between the positive electrode and the ITO surface, or a small distance between the

negative and positive electrodes, accompanied by a large electrical discharge mobility,

results in a higher removal rate of the ITO microstructure. The “non-contact module”

improves production and provides higher efficiency and quality of machining than the

contact module. The positive non-contact electrode design eliminates scoring of the

display color filter surface. A higher voltage and a more rapid feed rate effectively

increases the rate of ITO removal. This enhances the feed rate of the display color

filter (the average ITO removal speed of the non-contact module is 1.23 times benefit

than that of a contact module) and ensures high surface quality of display color filters

and reduces production costs. The average light transmittance of the three primary

colors is also maintained at the same level after executing the “non-contact module”

process to remove the ITO compared to without the ITO coating.


14

Abstract: A Robot Design with Energy Saving Performance via an

Effective Regenerative Braking Control System

P.S. Pa*, S.C. Chang, J.H. Shieh

Department of Digital Content Design, Graduate School of Toy and Game Design,

National Taipei University of Education

NO. 134, Sec. 2, Heping E. Rd., Taipei City 106, Taiwan *[email protected]

Abstract

This study is aimed at the “design model of regenerative braking control” that

provides a more convenient energy using methods for a tripedal-robot product to be

saved the energy from brake regeneration energy. Authors use the “Time Ratio

Control（TRC）method Work Module” for the robot design. A design model of

regenerative braking control of the tripedal-robot and an experimental identification is

presented to achieve regenerative current effectively. A simulation and experimental

results show that are effective in tracking the regenerative current command. By

evaluating the simulation results, a simulator could provide valuable data to design

and analyze prototypes of the tripedal-robot. Therefore, rapid prototyping can be

achieved to speed up the development of the robots. The platform of the tripedal robot

will become a significant design reference for the commercialization of different

industrial robots, and it will provide the design of industrial robots with more options

and useful applications. It finds that the robot moved forward smoothly, and indicates

that the regenerative braking control can be used for the robot. A renewable energy

system can provide the tripedal-robot with a high efficiency power source storing

mechanism and can accomplish the circular use of “Energy Saving”.


15

Abstract: An Untraceable, Anonymity and Secure Sealed-bid Auction

Schemes using Threshold Cryptosystem without A Third Party

Wei-Chen Wu1, Horng-Twu Liaw

2, and Chih-Ta Yen

3

1Computer Center, Hsin Sheng College of Medical Care and Management,

Taoyuan County, Taiwan, R.O.C. 2Department of Information Management, Shih Hsin University, Taipei,

Taiwan, R.O.C. 3Department of Information Management, National Taiwan University of

Science and Technology, Taipei, Taiwan, R.O.C. [email protected],

[email protected]

Abstract

This paper proposes untraceable and secure sealed-bid auction schemes which adopt

threshold cryptosystem without a third party. In the previous proposed sealed-bid

auction schemes, an auctioneer is responsible for opening bids. However, malicious

auctioneers can conspire with malicious bidders by revealing all bidding prices before

the bid opening stage for bidding optimal bidding price to win the auction. To prevent

against this, we decide to eliminate auctioneer from opening phase and involve plural

clerks to choose secret keys, and then clerks distribute public keys to each other. On

the bid opening phase, the clerks can cooperate with each other to open the bids

without an auctioneer by using Pedersen’s protocol and Lagrange interpolating

polynomial. Hence, an auctioneer is only responsible for verifying user’s

identification and checking whether bids are valid or not. Furthermore, for enhancing

security in our schemes, we utilize a hardware framework entitled “Untraceable

Decryptor” to make all bids pass through it when the bids are transferred to clerks.


16

Abstract: A Skin Region detection Method by Statistical and Possible

World Models

Keming Mao1,2,*

, Zhiliang Zhu1,2

, Jun Na1,2

, Zhuofu Deng1,2

1College of Software, Northeastern University, Liaoning, Shenyang, 110006, China

2Cloud Computing Engineering & Technology Research Center of Liaoning Province

Shenyang, 110006, China

*[email protected]

Abstract

Skin pixel detection plays a key role for applications ranging from human face

recognition, naked image detection, human gesture detection and analysis, image

classification and retrieval, etc. This paper proposes a novel color based skin pixel

detection method that works on JPEG compressed images. Feature is defined and

extracted directly from JPEG format images. A histogram based Bayes statistical

model is constructed and two kind regions are gained first, skin region and non-skin

region with maximal possibility are detected, with undetermined region left. Then

space relationship between skin region along with its neighbors is analyzed and a

Possible World models is constructed, which is used for reexamine the undetermined

regions in finally detection. Experimental results show that our proposed method

achieves good efficiency and effectiveness.


17

Abstract: Human Action Recognition Using Segmentation of

Accumulated Movement

Nae Joung Kwak, Teuk-Seob Song*

Mokwon University, Doandong, Seogu, Dae-jeon, Korea

[email protected], [email protected]*

Abstract

This paper proposes a method of classifying human action. The proposed method

models the background, gets differences between input video and the background

model to split objects, and recognizes human action by using coordinates of object,

directions of that and accumulated movement regions of that. The proposed method

has been experimented for 8 different movements using 4 people using video input of

a webcam and it has shown good results in terms of recognizing human action.

Acknowledgement

This research was supported by Basic Science Research Program through the National

Research Foundation of Korea (NRF) funded by the Ministry of Education, Science

and Technology (2011-0005121).


18

Abstract: A Detection Method of Multicomponent LFM Signals

Based on S-Transform Ridge and Hough Transform

Dianwei Wang1,*

, Jiulun Fan1, Yonghua Li

2, Ying Liu

1, Daxiang Li

1

1 School of Communication and Information Engineering, Xi’an University of Posts

and Telecommunications, Xi’an, 710121, China. 2 State Key Laboratory of Astronautic Dynamics, China Xi’an Satellite Control

Center, Xi’an, 710043, China. *[email protected]

Abstract

To solve the multicomponent LFM signals detection problems of error detection

caused by the cross-terms in WVD-Hough methods and low precision due to poor

time-frequency concentration in S-Hough transform, this paper proposed a detection

method of multicomponent LFM signals based on S-transform ridge-Hough transform.

Firstly calculate the time-frequency distribution (TFD) of signals by S-transform and

extraction its TFD ridges, then execute Hough transform to the S-transform ridges on

the time-frequency plane to detect the LFM signals. The simulation results show that

this method has good performance in detection the LFM signals in low SNR case.

Acknowledgement

This work is supported by the 2011 Special Research Programs of the Education

Department of Shaanxi Province (11JK0994).


19

Abstract: Iterative Equalization Scheme of Power Line

Communication Systems for Ubiquitous Healthcare Applications

Yoon Hyun Kim, Jin Young Kim

Department of Wireless Communications Engineering, Kwangwoon University, Wolgye-Dong,

Nowon-Gu, Seoul, 447-1 Korea

{yoonhyun, jinyoung}@kw.ac.kr

Abstract

In this paper, we propose and simulate Turbo equalizer scheme with zero-forcing (ZF)

and minimum mean square error (MMSE) for high speed power line communication

(PLC) systems. Because PLC systems suffer from impulsive noise and multipath

fading, inter-symbol interference (ISI) occurs. In order to overcome the effect of ISI,

we utilize Turbo equalizer scheme for achieving performance improvement. The

performance is evaluated in terms of bit error rate (BER). From simulation results, we

confirm that system performance can be significantly improved when the Turbo

equalizer employed. It is also confirmed BER performance improves as the number of

iteration increase.

Acknowledgement

This work was, in part, supported by the National Research Foundation of Korea(NRF)

grant funded by the Korea government(MEST) (No. 2011-0029329), and in part,

supported by the MKE (The Ministry of Knowledge Economy), Korea, under the

ITRC (Information Technology Research Center) support program supervised by the

NIPA (National IT Industry Promotion Agency)" (NIPA-2012-(C1090-1211-0005)),

and in part supported by Kwangwoon University in 2012.


20

Abstract: Novel Interference Mitigation Scheme for Convergence

System Based on PLC and VLC

Yoon Hyun Kim1, In Hwan Park

1, Jae Soo Yang

2, Yocheol Kim

3, Jea Sang Cha

4,

Kye San Lee5, Yeong Min Jang

6, Jin Young Kim

1,

1Kwanwoon University, Department of Electronics Convergence Engineering,

Wolgye-Dong, Nowon-Gu, Seoul, 447-1 Korea 2Dankook University, Department of Electronic Engineering, Yongin 448-701, Korea

3LG Electronics, Mobile Communication R&D Center, Gasandong 219-24,

Geumcheongu, Seoul 153-023 Korea 4Seoul national university of technology, Department of Media Engineering, Seoul

139-743, Korea 5Kyunghee University, Department of Electronics and Radio Engineering, Gyeonggi

446-701, Korea 6Kookmin University, College of Electrical Engineering, Seoul 136-702, Korea

{yoonhyun, inhwan, jinyoung}@kw.ac.kr, {jyang1}@paran.com,{yckim}@lge.com},

{chajs}@snut.ac.kr, {kyesan}@khu.ac.kr, {yjang} @kookmin.ac.kr

Abstract

In this paper, we propose novel home network architecture, and analyze performance

of interference mitigation scheme for the proposed convergence system with power

line communication (PLC) and visible light communication (VLC). This convergence

system can provide high speed multimedia service in indoor wireless environment.

In order to validate the proposed system, interference scenario is suggested and

analyzed by employing zero-forcing (ZF) and minimum mean square error (MMSE)

schemes to mitigate the interference. From simulation results, it is confirmed that

interference significantly affects the proposed convergence system performance and

the employed detectors are very effective in mitigating interference. The results of the

paper can be applied to design of smart home network and various indoor multimedia

service sites by employing advantageous features of PLC and VLC.

Acknowledgement

This work was, in part, supported by the IT R&D program of MKE/KEIT. (10035264,

Development of Home Network Tech. based on LED-ID), and in part, supported by

Basic Science Research Program through the National Research Foundation of

Korea(NRF) funded by the Ministry of Education, Science and

Technology(MEST)"(No. 2011-0025983), and in part supported by Kwangwoon

University in 2012.


21

Abstract: Classification of Normal and Overweight Women using

Facial Characteristics for Medical Applications

Bum Ju Lee, Jun-Hyeong Do, Jong Yeol Kim*

Division of Constitutional Medicine Research, Korea Institute of Oriental Medicine


* Corresponding author: 1672 Yuseongdae-ro, Yuseong-gu, Deajeon 305-

811, Republic of Korea, Telephone: +82-42-861-9593, Fax: +82-42-868-

9480

Abstract

Body mass index (BMI) is an important clinical measure for patients with obesity-

related diseases. In this paper, we first propose a method of classifying normal and

overweight status using facial characteristics. Based on 688 female subjects in 2

groups according to age differences, our classification model showed AUC (area

under the ROC curve) values ranging from 0.760 to 0.861 and kappa values ranging

from 0.401 to 0.512. Statistical analysis using unpaired t-test revealed that many

features were significantly different (p < 0.05) and highly significantly different (p <

0.0000) between normal and overweight classes in each group. These results will

provide better discriminatory characteristics for studies in obesity, face recognition,

facial morphology, and medical science, and may be useful in developing alternative

diagnosis methods for BMI status in telemedicine and emergency medical service.

Acknowledgement

This work was supported in part by National Research Foundation of Korea (NRF)

grant funded by the Korea government (MEST) (20110027738).


22

Abstract: Classification of pulmonary Nodule from Low dose CT

Scan Images using Neural Network

M. Arfan Jaffar, Wook-Jin Choi, Tae-Sun Choi*

Gwangju Institute of Science and Technology, Korea

[email protected], [email protected], [email protected] *Corresponding Author

Abstract

Lungs nodule detection and classification is a very crucial step for computer aided

diagnosis (CAD) systems. In this paper, we have proposed a CAD system that

consists of multiple phases. In the first phase, Lungs segmentation has been

performed. After that, region of interest ROI that contains nodule has been extracted.

Different types of features have been extracted for nodule classification. Artificial

Neural Network (ANN) has been used for classification. The technique was tested on

the dataset Lungs Image Database Consortium LIDC and images taken from Aga

Khan Medical University. The results confirm to the validity of technique as well as

enhanced performance.

Acknowledgement

This research work was supported by the Bio Imaging Research Centre at Gwangju

Institute of Science and Technology (GIST), Korea.


23

Abstract: Reversible Data Hiding with Large Embedding Capacity

for Color Palette Images

Munkhbaatar Doyoddorj, Chul Sur, Youngho Park and Kyung-Hyune Rhee*

Department of IT Convergence and Application Engineering,

Pukyong National University, Republic of Korea

{d_mbtr, kahlil, pyhoya, khrhee}@pknu.ac.kr

Abstract

In this paper, we present a reversible data hiding scheme which enhances the

embedding capacity for color palette images and can recover the embedded data from

the stego image without causing any visual distortions to the cover image. In

particular, we make use of the differences between a center index and its neighboring

indexes in each sub-blocks of indexed table by using a palette color replacement.

Moreover, we can embed up to 28� bytes into a 512 × 512 color image, which

provides much more embedding capacity than the existing reversible data hiding

schemes. The experimental results confirm the effectiveness of our scheme in term of

hiding capacity of embedding data and visual quality of stego image.

Acknowledgement



and Technology (Grant No. 2011-0012849).


24

Abstract: A 3D Registration Algorithm for Abdominal PET-CT and

MR images Using Intensity and Feature Information

Hakjae Lee1, Kisung Lee

1,*, Jungmin Kim

1, Sung-Kwan Joo

2, Gi-Jeong Cheon

3,

Sang Moo Lim4, and Kyeong Min Kim

4

1Department of Radiologic Science, College of Health Science, Korea University,

2Department of Electrical Engineering, Korea University

3Department of Nuclear Medicine, Korea University Anam Hospital

4Korea Institute of Radiological & Medical Sciences Research Center *[email protected], Phone: 82-2-940-2825, Fax : 82-2-917-9074

Abstract

The aim of this study is to develop a 3D registration algorithm for PET/CT and MR

images acquired from independent PET/CT and MR imaging systems. Combined

PET/CT images provide anatomical and functional information and MR images have

high resolutions for soft tissues. With the registration technique, the strengths of each

modality image can be combined so that we can achieve higher performance in

diagnosis and radiotherapy planning. The proposed method consists of two stages:

normalized mutual information (NMI) based global matching and independent

component analysis (ICA) based refinement. In the global matching, the field of view

of the CT and MR images are adjusted to the same size in the preprocessing step.

Then, the target image is geometrically transformed, and the similarities between the

two images are measured with NMI. The optimization step updates the transformation

parameters to efficiently find the best matched parameter set. In the refinement stage,

ICA planes from the windowed image slices were extracted and the similarity

between the images was measured to determine the transformation parameters of the

control points. B-spline based freeform deformation was performed for the

geometrical transformation. The results showed good agreement between PET/CT and

MR images.

Acknowledgement

This work was supported by MEST through The Program of Development Research

Center of PET Application Technology, Converging Research Center Program

(2011K000727), and Basic Atomic Energy Research Institute (BAERI) (2010-

0018616) through the National Research Foundation of Korea funded by the Ministry

of Education, Science and Technology.


25

Abstract: Artificial Neural Network for the Diagnosis of Genes

in Human Skeletal Muscle Channelopathies

InSeop Na1, MyeongKyu Kim

3*, SangCheol Park

2, SooHyung Kim

1 and Ha Le

1

1School of Electronics & Computer Engineering Chonnam National University,

2Samsung Medison Co., Ltd., Seoul, Korea

3Dept. of Neurology, Chonnam National University Medical School, Gwangju, Korea

*[email protected]

Abstract

In this study, we apply artificial neural network (ANN) for the diagnosis of clinical

phenotypes of Human Skeletal Muscular Channelopathies (HSMCs) for the proper

genetic tests. We systematically reviewed over 500 literatures on the human skeletal

muscle channelopathies (205 literatures for SCN4A, 69 CACNA1S, 91 CLCN1 and

141 KCNJ2 mutations) based on the studies of all genetically confirmed cases of

HSMCs up to November 2010. Finally, we perform genotype-phenotype correlation

with 627 genetically proven HSMC cases (from 585 kindreds and 1082 affected

family members). We design back propagation ANN. All the data were used as input

data. ANN is designed as 45-8-4. Total number of first layer is 45 neurons, 8 hidden

layer neurons and four output layer neurons. We use the bootstrapping method to

estimate the experimental results for both training and testing data. After training, the

program is able to differentiate all genetic-types. In test set, our system successfully

classify all the genetic-types of CNCNA1S, CLCL1, KCNJ2 and SCN4A. The overall

performance accuracy is 98.06% for CACNA1S, 91.84% for CLCN1, 83.33% for

KCNJ2, 79.26% for SCN4A and average accuracy was 88.52%. According to the

results, the priority of gene or domain that should be tested is determined more readily,

accurately, and promptly. We introduce here our system for proper genetic tests that is

being operated on the basis of the clinical data from almost all genetically proven

HSMC cases ever reported. It is expected that our system would become more

powerful when the phenotype-genotype correlation data from new cases are further

accumulated and would contribute to construct the database for a new genetic

classification system for HSMCs.

Acknowledgement

This research was supported by the MKE, under the ITRCsupport program supervised

by the NIPA (NIPA-2012-H0301-12-3005).


26

Abstract: Improved Histogram Specification using Multiresolution

in the Spatial Domain for Image Enhancement

1Kyung-Moo Huh,

1Su-Min Kang, and

2Young-Bok Joo*

1Dankook Univ. (Cheonan Campus), Anseo-dong Cheonan-si Chungcheongnam-do

Republic of Korea 2Korea Univ. of T.E, Byeongcheon-myeon Cheonan-si Chungcheongnam-do Republic

of Korea

Telephone: 1+82-41-550-3548, 2+82-41-560-1487

Fax: 2+82-41-560-1462


Abstract

The histogram specification turns a shape of a histogram into that we want to specify. This

technique can be applied usefully in various image processing fields such as machine vision.

However, the histogram specification technique has its basic limits. For instance, the

histogram does not have location information of pixels. Also, the accuracy of specification

drops because of quantization error of digitized image. In this paper, we proposed a

multiresolution histogram specification method in order to improve the accuracy of

specification in terms of resemblance between destination and source image. The

experimental results show that the proposed method dramatically enhances the accuracy of

specification compared to the conventional methods.


27

Abstract: Design of Equalized Maximum Likelihood Sequence

Receiver for a Magnetic Recording Channel

Chung-Jung Huang1, Tsai-Sheng Kao

2,*, Hao-Hsiang Ku

3, and Hsia-Hung Ou

4

1Department of Electrical Engineering, National Chiao Tung University, Taiwan,

R.O.C. 2Department of Electronic Engineering, Hwa-Hsia Institute of Technology, Taiwan,

R.O.C. 3Department of Computer Science and Information Engineering, Hwa-Hsia Institute

of Technology, Taiwan, R.O.C. 4Graduate Institute of International Sports Affairs, National Taiwan Sport University,

Taiwan, R.O.C.

Abstract

The nonlinear effects, known as transition shift and partial erasure, arise and limit the

performance of the detector in a high-density magnetic recording channel. Although

the partial response maximum likelihood (PRML) sequence detector can achieve an

acceptable performance in a reasonable realization complexity, the given target

response is not optimized. In this article, we jointly optimize the coefficients of the

partial equalizer and target response for an equalized maximum likelihood sequence

receiver such that the mean squared error between the outputs of the partial equalizer

and target response is minimized in the presence of the partial erasure effect, and

evaluate the bit error rates (BERs) of the extended partial response class VI (EPR4)

equalized channel. In addition, the mean squared error and bit error rate are simulated

to verify the proposed method for an EPR4-equalized channel; the results indicate

both the mean squared error and bit error rate for the proposed method are improved

as compared with those of the conventional design.

Acknowledgements

This work was supported in part by National Science Council, Taiwan, under Grant

numbers NSC 100-2221-E-146-004 and NSC 99-2218-E-146-003-MY2.


28

Abstract: A Novel Container ISO-Code Recognition Method

using Texture Clustering with a Spatial Structure Window

Kyung-mo Koo, Eui-young Cha*

Computer Engineering, Pusan National University,

Busandaehak-ro 63beon-gil, Geumjeong-gu, Busan 609-735 Korea

[email protected], [email protected]

Abstract

In this paper we present a novel container ISO-code recognition method which uses

vertical edge information, a spatial structure window, and texture clustering. The

vertical edge information is extracted using a top-hat transform. The candidate region

and type of ISO-Code is obtained using a Spatial Structure Window (SSW) which

wraps around the vertical edges. The ISO-Code is extracted using texture clustering

by the K-Means algorithm which is then recognized by a Back-propagation Neural

Network (BP). Experiments confirmed the robustness of the recognition algorithm on

real images and videos.


29

Abstract: Real-time Estimation of Length and Energy Expenditure of

Each Step using Noisy and Orientation-free Acceleration Obtained

from an Android Smartphone

Yao Meng1, Hee-Cheol Kim

2 and Sang-Hoon Yi

3*

1,2Dept. of Computer Engineering, Ubiquitous Healthcare Research Center,

Inje University, South Korea 3Dept. of Computer Aided Science, Institute of Basic Science, Inje University,

South Korea [email protected],

[email protected],

3*[email protected]

Abstract

Smartphone applications are increasing in popularity and are being widely used in the

field of health and medicine. This study describes and implements a robust real-time

algorithm estimating step length and energy expenditure (EE) on a commercially

available Android smartphone containing a low-grade 3-axis accelerometer. The

placement of smartphone is free to collect acceleration data, which enables the

resulting signal noisy and non-stationary. Preprocessing and step detection are applied

to the obtained acceleration signal. Number of steps, distance and EE are estimated

based on the detected step cycles and the leg length of Koreans in ages from 20 to 40

years. The meaningful experimental results indicate the feasibility and promise of the

mobile health (mHealth) technology in the dawning age of ubiquitous computing and

real-time data processing.

Acknowledgements

We acknowledge financial support from the Korean Ministry of Knowledge Economy

(#10033321) provided for this work.


30

Abstract: An Improved Fast 2DPCA based Nonlocal Means filter

Yuhui Zheng1, Jianwei Zhang

2, Wei Tian

1 ,Yunjie Chen

2, Lu Liu

1

1Jiangsu Engineering Center of Network Monitoring, Nanjing University of

Information Science & Technology, Nanjing, 210044 2College of Math&Physics, Nanjing University of Information Science & Technology,

Nanjing, 210044

{marser1031, generalcyj}@yahoo.com.cn; {zhangjw, tw, 002131}@nuist.edu.cn

Abstract

Recently, the Nonlocal means filter are widely studied. Unfortunately, the

computational complexity of this method is quite a burden. Therefore, several pre-

selection methods have been suggested. In this work, the pre-selection based nonlocal

means filters are analyzed, and pointed out that most of them had defects in terms of

feature extraction from image patch. In our former work [18], we propose a scheme to

more efficiently preselect similar patches, based on the two-dimensional principal

component analysis (2DPCA). Although the method can yield good results, the

computational complexity remains high. We proposed a simple version of the 2DPCA

NL-mean filter [18], which directly employs features extracted by the patch-oriented

2DPCA to compute the weights. Experimental results show that our method can

achieve better filtering results in a variety of images, such as weak gradient image,

face image and texture image.

Acknowledgements

The authors wish to thank National Natural Science Foundation of

China(61173072,61003209), the Academic Program Development of Jiangsu Higher

Education Institutions, Natural Science Foundation of the Higher Education

Institutions of Jiangsu Province(10KJB520011,10KJB520012), Natural Science

Foundation of Jiangsu Province(BK2011824,BK2011825),and the Scientific Research

Staring Foundation of Nanjing University of Information Science and Technology

for supports.


31

Abstract: Hybrid Image Segmentation using Compression and

Texture based Region Merging

Ning-Yu An*, Chi-Man Pun

Department of Computer and Information Science

University of Macau, Macau SAR, China

{ya97414, cmpun }@umac.mo

Abstract

A Hybrid image segmentation method by watershed, compression and texture based

region merging strategy is proposed in this paper. First of all, an efficient improved

watershed transform is implemented to over-segment the image, the slight boundaries

are described. Then followed by a tiny region merging stage, some regions are

agglomerated into Gaussian-like clusters, the criterion of which is the coding length

of L*a*b feature vectors. Finally, the residual regions are combined by their textures,

which are measured from the entropy of wavelet matrices. The comparisons of

different texture regions are effective and obvious, and the experiments on the

Berkeley dataset display that our algorithm has accurate and robust segmentation

results.

Acknowledgements

The authors would like to thank the referees for their valuable comments. This work

was supported in part by the Research Committee of the University of Macau.


32

Abstract: Human and Robot Tracking Using Histogram of Oriented

Gradient Feature in Intelligent Space

Jeong-Eom Lee1, Joo-Hyung Kim

1, Sang-Jun Kim

1, Gon-Soo Kim

1, Joo-Ho Lee

2 and

Gwi-Tae Park1*

1School of Electrical Engineering, Korea University, Seongbuk-gu, Seoul, Korea

{marejeno, gtpark}@korea.ac.kr 2College of Information Science and Engineering, Ritsumeikan University, Kusatsu-si,

Shiga, Japan

[email protected]

Abstract

This paper describes a real-time human and robot tracking method in Intelligent Space

with multi-camera networks. The proposed method detects candidates for humans and

robots by using the histogram of oriented gradients (HOG) feature in an image. To

classify humans and robots from the candidates in real time, we apply cascaded

structure to constructing a strong classifier which consists of many weak classifiers as

follows: a linear support vector machine (SVM) and a radial-basis function (RBF)

SVM. By using the multiple view geometry, the method estimates the 3D position of

humans and robots from their 2D coordinates on image coordinate system, and tracks

their positions by using stochastic approach. To test the performance of the method,

humans and robots are asked to move according to given rectangular and circular

paths. Experimental results show that the proposed method is able to reduce the

localization error and be good for a practical application of human-centered services

in the Intelligent Space.

Acknowledgements



and Technology (2010-0016536). This work was supported by KAKENHI

(23500248).


33

Abstract: The Evaluation of Reliability for Clinical Performance

Ability Using Computer-based Examination

Seong-Ran Lee¹

Department of Medical Information, Kongju National University,

182 Shinkwan-dong, Kongju, Chungnam, South Korea,

[email protected], +82-41-850-0343

Abstract

The paper is focused on the evaluation of reliability for clinical performance ability

using computer-based examination. The subjects consisted of 84 doctors working in a

medical institute located in Metropolitan area from November 21 to December 21,

2011. The reliability of this paper in skill was good with a Cronbach’s alpha of 0.88.

Clinical courtesy was significantly higher in interns than in residents and physicians

(p=0.02). In conclusion, this paper revealed that reliability was appropriate as

evaluation method for the reliable performance ability using computer-based

examination.


34

Abstract: Optimized Facial Feature-Based Age Classification

Md. Zahangir Alom, Ruoyu Du, and Hyo Jong Lee*

Department of Computer Science and Engineering, Center for Advanced Image and

Information Technology ,Chonbuk National University, Jeonju, South Korea

{zahan.cse,ruoyudu}@gmail.com, {hlee}@jbnu.ac.kr

Abstract

The evaluation and measurement of human body dimensions are achieved by physical

anthropometry. The main goal of this research is to optimization of facial feature

point by establishing a mathematical relationship among facial features and used

optimize feature points for age classification. According to this proposes method,

sixteen Euclidean distances are calculated from the eighteen selected facial feature

points vertically as well as horizontally. The distances between the specified features

points increase with respect the age progression of a human from his or her childhood

but the ratio of the distances does not change (δ =1.618). Feature distances are used

for classification of age using Support Vector Machine (SVM) - Sequential Minimal

Optimization (SMO) algorithm and shown around 96% accuracy.


35

Abstract: Facial Expression Recognition from Complex Background

Using Face Context and Adaptively Weighted Sub-Pattern PCA

Hyo Jong Lee*, Md. Zahangir Alom, and Ruoyu Du

Department of Computer Science and Engineering, Center for Advanced Image and

Information Techonology, Chonbuk National University, Jeonju, South Korea

{zahan.cse,ruoyudu}@gmail.com, {hlee}@jbnu.ac.kr

Abstract

This paper discusses on face context and adaptively weighted sub-pattern PCA (Aw-

SpPCA) based facial expressions recognition system. We have segmented the face

and other parts of the body from the complex environment based on the skin color

model. We proposed an algorithm to detect a face region from the segmented image

based on constant ratio called golden ratio (δ =1.618). Finally we cropped the desired

part of the face to analysis the expression of a person. Unlike PCA based on a whole

image pattern, Aw-SpPCA operates directly on its sub patterns partitioned from an

original whole pattern and separately extracts features from them. Aw-SpPCA can

adaptively compute the contributions of each part and then endows them to a

classification task in order to enhance the robustness to both expression and

illumination variations. Experiments on one standard face with five types of facial

expression database shows that the proposed method is competitive.

Acknowledgements

This paper was supported by research funds of Chonbuk National University in 2010.


36

Abstract: Photo Retrieval based on a Combination of Geo-referenced

Attributes and Low-level Visual Features

Yong-Hwan Lee1, Hyochang Ahn

1, Han-jin Cho

2, June-Hwan Lee

2 and

Sang-Burm Rhee1*

1Department of Applied Computer Engineering, Dankook University

2Department of Smart Mobile, Far East University


*Corresponding

author

Abstract

This paper proposes a new efficient image retrieval method that automatically

indexed for searching relevant images using a combination of geo-referenced

attributes and low-level visual features. Photo image is labeled with its GPS

coordinates and UTC date-time stamp at the moment of capture, and these data are

then utilized to create two layer structures for spatial and temporal indexed for photo

retrieval. In order to evaluate the performance of the proposed scheme, we assess the

simulation performance in terms of average precision and F-score using digital photo

collections. Comparing the proposed approach to search using visual content alone, an

improvement of around 16~18% was observed in experimental trials. These results

reveal that combining content and context information is markedly more effective and

meaningful than using only visual content for this task.

Acknowledgements

This work was supported by 2012 Dankook university project for funding RICT.


37

Abstract: Area-Efficient Fault-Handling for Survivable Signal-

Processing Architectures

Naveed Imran1, Jooheung Lee*

2, Youngju Kim

2, Mingjie Lin

1, and

Ronald F. DeMara1

1Department of Electrical Engineering and Computer Science, University of Central

Florida, Orlando, FL, 32816 USA

[email protected], [email protected], [email protected] 2Department of Electronic and Electrical Engineering, Hongik University, Korea


Abstract

We propose an area-efficient dynamic fault-handling approach to achieve high

survivability for DSP circuits. Its benefits include requiring only a uniplex instance of

the datapath, which has been partitioned into N + 1 Processing Elements (PEs) where

N is the number of PEs utilized for fault-free throughput. Fault detection, isolation,

and recovery are performed using discrepancy information derived from the existing

functional throughput by reconfiguring one of the N + 1 Partially Reconfigurable

Regions (PRRs) to replicate each of the N modules in succession. This differs

significantly from the conventional approaches that heavily rely on static

temporal/spatial redundancy and sophisticated error prediction/estimation techniques.

The principal space complexity metric is the additional physical resources utilized to

support the underlying fault-handling mechanism where a single PRR can check the

health of multiple distinct functional blocks, by leveraging the property of dynamic

partial reconfiguration. We demonstrate this approach by implementing a video

encoder’s DCT block with a Xilinx Virtex-4 device and also numerically simulating a

Canny Edge Detector. Results clearly demonstrate the recovery of functionality lost

due to randomly injected simulated stuck-at faults using only throughput data values

rather than additional test vectors. Using a modular PE design, the area overhead of

providing fault-handling capability was 12.5% for the DCT Block and 10% for the

Canny edge detector. Moreover, the module granularity can be varied to

accommodate tradeoffs of fault detection latency versus fault isolation specificity, as

desired by the DSP circuit designer.


38

Abstract: Face Recognition System Using Improved Super-Resolution

Reconstruction Method

Sang-Heon Lee1, Myoung-Kyu Sohn

1, Soo-Ah Yoon

2, Tae-Gyoun Lee

2,

Jin-Ho Cho2, and Chul-Ho Won

3

1Dept. IT convergence, DGIST, Daegu, Republic of Korea

{pobbylee, smk}@dgist.ac.kr 2College of IT Engineering, Kyungpook National University, Daegu, Republic of

Korea

{sa211, tg78, jhcho}@ee.knu.ac.kr

3Dept. of High Tech. Medical System, Kyungil University, Daegu, Republic of Korea

[email protected], Corresponding author

Abstract

For face recognition systems employed for intelligent surveillance it is very important

to enhance the recognition rate when using low-resolution (LR) face images captured

at long distances, that is, in the user’s non-cooperative environment. In order to

improve the performance of face recognition systems, we propose a novel super-

resolution (SR) method that is an improved version of the Papoulis-Gerchberg (PG)

method and the iterative back projection (IBP) method. The suggested approach

combines the IBP method in the spatial domain and the PG method in the frequency

domain to enhance the sharpness of edge regions. We compare our method with

various conventional SR methods. The experimental results show that the proposed

SR method has a better peak signal-to-noise ratio than the other methods and better

face recognition performance when we use a reconstructed SR image as input to the

system than when we use an unaltered LR input face image.

Acknowledgements

This work was supported by the DGIST (Daegu Gyeongbuk Institute of Science and

Technology) R&D Program of the Ministry of Education, Science and Technology of

Korea (11-IT-03).


39

Abstract: Fast Image Stitching Based on Improved SURF Algorithm

Hyochang Ahn*, Yong-Hwan Lee

*, Han-Jin Cho

**, June-Hwan Lee

**,

Sang-Burm Rhee*

*Department of Computer Science and Engineering, Dankook University

Jukjeon-dong, Yongin-si, Gyeonggi-do, Republic of Korea **

Department of Smart mobile, Far East University

Eumseong-gun, Chungcheongbuk-do, Republic of Korea

[email protected], [email protected], [email protected],


Abstract

Recently, we can easily create high resolution images with digital cameras for high-

performance and make use them at variety fields. Especially, the image stitching method

which adjusts couple of images has researched. Image stitching can be applied in the field of

military purposes for satellites and reconnaissance aircraft, and computer vision for medical

image and the map. In this paper, we have proposed fast image stitching based on improved

SURF algorithm using meaningful features on processing of matching images after extracting

features in scenery image. Several images are extracted features to find out matched point in

each image. The meaningful features are classified through removing the error like noise in

extracted features and are matched point in each image. Image stitching time is improved by

reducing processing time in image matching. In our results, processing time of feature

matching and image stitching is faster than previous algorithms, and also it can generate

natural-looking stitched image.


40

Abstract: A new LDPCA decoding Method for Distributed Video

Coding

Hwanseok Jang, Sangwoo Lee, Sang Ju Park*

School of Electronic & Electrical Engineering, Hongik University,

72-1, Sangsu-Dong, Mapo-Gu, Seoul, 121-791 Korea,

+82-2-320-1475, +82-2-320-1119 (FAX)

{hsjang, klassesw}@mail.hongik.ac.kr, [email protected]*

Abstract

Distributed video coding (DVC) is a new coding paradigm targeting applications with

the need of low-complexity encoding at the cost of a high-complexity decoding.

LDPC (A) codes are widely used in DVC. In this paper, we introduce a new decoding

method for LDPC (A) code improving the error correcting capability for both AWGN

and DVC channels.

Acknowledgments



and Technology (20110025927).


41

Abstract: A Novel Fast Mode Decision Algorithm on the

Enhancement Layer in H.264/AVC Scalable Video Coding

Sangwoo Lee, Sang Ju Park*

School of Electronic & Electrical Engineering, Hongik University,

72-1, Sangsu-Dong, Mapo-Gu, Seoul, Korea 121-791,

+82-2-320-1475, +82-2-320-1119 (FAX)


Abstract

Scalable video coding (SVC) is standardized as an H.264/AVC extension, by JVT at

November, 2007. The characteristic of the SVC is the encoding of a high-quality

video bitstream that contains one or more subset bitstreams that can themselves be

decoded with an existing H.264/AVC decoder. We propose a new algorithm for

SVC that can quickly decide the enhancement layer macro block (MB) mode using

lower layers’ statistical characteristics. The proposed algorithm limits the candidate

MB modes to modes predicted from the base layer for spatial scalable coding. The

algorithm can reduce the encoding time while almost maintaining PSNR and bitrate.

Acknowledgments

This work was supported by the Seoul R&BD Program no. 10555.


42

Abstract: Enhancement of Generic Graph cut Algorithm by

Flat Area Filtering in Stereo Matching

Hoang Giang Son1, Seong Ik Cho

2, Kisung Lee

1*, Sung-Kwan Joo

3, Seunghwan Ro

4,

and DongYong Kwak2

1College Of Heath Science, Korea University, San 1, Jeongreung-dong, Seongbuk-gu,

Seoul, Korea 2Electronics and Telecommunications Research Institute, 218 Gajeong-ro Yuseong-gu,

Daejeon, Korea 3School of Electrical Engineering, Korea University, 5-ga, Anam-dong, Seongbuk-gu,

Seoul, Korea 4Department of Radio Science Engineering, Kongju National University, 34 Kongupdae-gil

Chonan-si, Chungnam

*[email protected]

Abstract

This paper describes an advanced approach in enhancing the performance of the

conventionally used graph cut algorithm. While a large number of graph cuts for

solving the stereo matching problem have been proposed as can be seen on the

Middlebury website, those have some limitations such as relatively slow speed

compared to local matching algorithms and poor disparity reconstruction the area

where intensity varies smoothly. In order to accomplish the performance enhancement,

we propose two preprocessing steps applicable to the conventional graph cuts that can

handle occluded area. First one is the extraction of the textureless area so as to fix the

area as an occluded one when applying the graph cut algorithm. Second one is the

introduction of a precise dissimilarity cost considering the sub-pixel intensity

variation so as to reduce the convergence time. We used a recently developed graph

cut proposed by Kolmogorov and Zabih(2006). We set the extracted textureless area

as the occluded one, and did the sum of absolute difference of sub-pixel intensity as

the cost function. The experimental results show enhanced disparity information and

shorter processing time as well as robust performance.

Acknowledgments

This work was supported by MKE/ISTK, [Mega Convergence Core Technology

Development].s


43

Abstract: Symmetric Data-Conjugate Method for ICI Minimization

in OFDM System

Heung-Gyoon Ryu and Do-Hoon Kim

Department of Electronic Engineering, Chungbuk National University,

12 Kaesin-dong, Cheongju, Korea


Abstract

In the OFDM (orthogonal frequency division multiplexing) system, ICI (inter-sub-

carrier-interference) is a serious problem. In this paper, two kinds of modified ICI

self-cancellation methods are newly proposed and compared for the performance

evaluation. CPE (common phase error), ICI and CIR (carrier to interference power

ratio) are derived and discussed by the linear approximation of the phase noise. As

results, this proposed symmetric data-conjugate method has the best ICI minimization

efficiency, ICI minimization performance gradually degrades according to the order

of symmetric data-conjugate method, data-conjugate method, symmetric data-

conversion method and data-conversion method. However, the symmetric data-

conjugate method provokes PAPR problem unlike the proposed symmetric data-

conversion method. PAPR property becomes worse according to the order of data-

conjugate method, symmetric data-conversion method, symmetric data-conjugate

method and data-conversion method. Therefore, symmetric data-conjugate method

can result in the best BER performance, when HPA nonlinearity cannot be neglected,

data-conjugate method achieves the best BER performance.

Acknowledgments



and Technology (No. 2010-0007567).


44

Abstract: Performance Evaluation of Noisy Wireless OFDM Channel

Using 64-Quadrature Amplitude Modulation

Maksudur Rahman Jonayed and Sung Won Kim*

Department of Information and Communication Engineering

Yeungnam University, Republic of Korea

Abstract

Orthogonal Frequency Division Multiplexing technique is one of the most prominent

access techniques for both wired and wireless communication system. It is specially

selected as an access technique of the fourth generation mobile cellular

communication system. In this paper, the system model of OFDM is discussed along

with the transmitter and receiver model. The performance of Orthogonal Frequency

Division Multiplexing channel is measured in context of Bit Error Rate incorporating

convolution coding under Additive White Gaussian Noisy environment. 64-

Quadrature Amplitude Modulation (QAM) is selected to enhance the voice

communication, especially in mobile cellular network. Entire system is examined

based on MATLAB simulation.

Acknowledgments

This research was conducted under the industrial infrastructure program for

fundamental technologies (No. 10033630) which is funded by the Ministry of

Knowledge Economy (MKE, Korea).


45

Abstract: Study on the Optimal Analysis Method for Nonlinear

System Using Orthogonal Function Matrices

Joon-Hoon Park

Department of Control & Instruments Eng., Chungju National University,

Chungju 380-702, Korea

[email protected]

Abstract

One of the most promising areas of application of Walsh functions is in multiplexing.

Several experimental multiplexing system have been developed that make use of the

rather different technology. Walsh transform is perhaps the most well-known of non-

sinusoidal orthogonal transforms. Walsh transform has gained prominence in various

digital signal processing applications. And solutions of linear and nonlinear

differential equations with boundary conditions can often be written as a weighted

sum of Walsh orthogonal solution functions. In this paper, a method for system

analysis and processing of nonlinear system was presented using orthogonal functions

and its transform. The applied method is very useful to analysis of nonlinear system

and it is superior to conventional numerical method or other previous algorithms.

Acknowledgments

“The research was supported by a grant from the Academic Research Program of

Chungju National University in 2010”


46

Abstract: Non-Root Based Decentralized Hybrid Wireless Mesh

Protocol for Wireless Mesh Networks

Madhusudan Singh and Song-Gon Lee*

Dept. of Ubiquitous IT, Division of Computer & Information Engineering,

Dongseo University, Busan- 617-716, Korea


Phone: 8251320176; Fax: 82513278955

Abstract

Wireless mesh networks is a type of mobile ad-hoc networks. In WMNs, all nodes are

static or related with fixed position. WMNs have a default routing protocol, hybrid

wireless mesh protocol, which is root constrained and tree-based proactive routing

protocol. During reactive routing, it always initiates with PREQ broadcasting message.

However, problems exist in this routing protocol, such as large overhead, low

efficiency and long packet delay. Hence, to solve these issues, we propose a scheme

which uses different root for different transmission, without the use of the fixed tree

based hybrid wireless mesh protocol for IEEE802.11s. We call this method as

decentralized hybrid wireless mesh protocol. In this paper, we did some modifications

in the reactive and proactive routing mechanism such a way that the responsibility of

mesh portal point is increased, and also made some modifications in root

announcement scheme to solve the problems in the reactive routing protocol. We use

NS-2 simulator to evaluate the performance of decentralized hybrid wireless mesh

protocol compared with AODV, OLSR and hybrid wireless mesh protocol

respectively.

Acknowledgments

This work is supported by the 2011 National Research Foundation of Korea (Grant

No. 2011-0004713).


47

Abstract: Genetic Design of Interval Type-2 Fuzzy Set-based Fuzzy

Neural Networks with Multiple-Output

Keon-Jun Park1, Dong-Yoon Lee

2,*

1Dept. of Information and Communication Engineering, Wonkwang University,

344-2, Shinyong-dong, Iksan-si, Chonbuk, 570-749 South Korea 2Dept. of Electrical Electronic Engineering, Joongbu University, 101, Daehak-ro,

Chubu-myeon, Geumsan-gun, Chungnam, 312-702 South Korea


Abstract

In this paper, we present the design of interval type-2 fuzzy set-based fuzzy neural

networks with multi-output (IT2FSFNNm) for pattern recognition. IT2FSFNNm is

the networks of combination between the fuzzy neural networks (FNNs) and interval

type-2 fuzzy set with uncertainty. The premise part of the networks is composed of

the fuzzy partition of respective input spaces and the consequence part of the

networks is represented by polynomial functions with interval set. To estimate the

values of the parameters of IT2FSFNNm we consider real-coded genetic algorithms.

The proposed network is evaluated with the use of numerical experimentation.


48

Abstract: A Security-Provable Communication Protocol of RFID

Systems in Internet of Things

HuiDan Gao, YaJun Guo*, JianQun Cui, HengGeng Hao, Hui Shi

Department of Computer Science, Central China Normal University,

Wuhan 430079, China

Tel: 86+ 027+67868318, Email:[email protected]

Abstract

Radio frequency identification (RFID) is one popular technology and one of the key

technologies which constitute internet of things. However, because the channel

between the tag and the reader is insecure, security and privacy issues of RFID

systems is the focus of the present study. By analyzing several typical RFID security

protocols, for the special security requirements of RFID systems in internet of things,

in this paper, we propose a security-provable communication protocol SPCP, then

analyze and certificate the security of the protocol in details by the random oracle

model. Analysis show that the protocol not only can solve the cloning attack, replay

attack, tag tracking and other common security issues of RFID Systems in internet of

things, but also can solve the internal attack and the ownership transfer of tags and

other issues of RFID Systems in internet of things. In addition, according to the

comparisons, SPCP has good performance.


49

Abstract: Automatic Flower Recognition using Smartphone

1Soon-Won Hong,

2Byung Joon Park and

1Lynn Choi

1School of Electrical Engineering, Korea University,

{aldig, lchoi}@korea.ac.kr 2Department of Computer Science, Kwangwoon University

[email protected]

Abstract

In this paper we propose an automatic recognition system of flower on smartphone. In

most of the existing schemes a user directly adjusts a flower's outline. This approach

is inefficient in terms of user friendliness. Therefore, we eliminate user interaction

from a flower recognition process. The recognition system of flower which is

configured as Server-Client finds flower region by using color and edge information

of images. After extracting color and contours data in flower region, the server

compares input image with the reference image stored on a server by using k-means

clustering and histogram matching. And then it sends the most similar image to the

user. We can obtain recognition result of 90.8 % for 5 sets of flower image from 100

species.

Acknowledgements



and Technology (2011-0005004).


50

Abstract: Efficient mixed-radix FFT architectures

Jinyong Lee1, Youngseh Kim

1, Kanghoon Kim

1 and Younglok Kim

1

1Department of Electrical Engineering,

Sogang University, Seoul, Korea

[email protected] and [email protected]

Abstract

The efficient implementation of fast Fourier transform (FFT) processor is still the

most important issue in digital signal processing area. In this paper, we analysis

existing radix structures of FFT process, and then we propose the novel mixed-radix

algorithm which is made by combining more than two different radix structures. The

proposed strucuter has less number of radix stages and non-trivial multiplications. As

a result of applying to the 64 point FFT, the hardware complexities of proposed

mixed-radix are significantly reduced by about 26% and 14% compared with the

existing radix-23 and radix-4 architectures.

Acknowledgements

This work is supported by “The second stage of BK21” and the CAD tool is

supported by “IDEC” in 2012.


51

Abstract: An Image Retrieval System Using a New Graph Matching

Approach

Sangcheol Park1, Wanhyun Cho2,

*, Sunworl Kim3, and Soonyoung Park

4

1Samsung Medison, Teheran-ro 108-gil, Gangnam-gu, Seoul 135-851 South Korea

2 Department of Statistics, Chonnam National University, Gwangju 500-757

South Korea

3 Radiation Health Research Institute, Korea Hydro & Nuclear Power Co., Ltd.,

Seoul, South Korea

4 Dept. Electronic Engineering, Mokpo National University, Chonnam, South Korea

*[email protected]

Abstract

The pairwise graph matching scores between two images play a very important role in

image retrieval systems. Accurate and efficient image matching is thus a key

component in content-based image retrieval (CBIR) systems that use a graph

matching algorithm. In this paper, we propose an image retrieval system using a new

graph matching algorithm based on Bayes theorem and Dirichlet distribution. First,

we explain this algorithm in detail. Then we represent an image as the graph using an

MSER region detector to be used as vertexes and the SIFT descriptor to assign

attributes to the edges of the graph. Then the correspondence between the two graphs

is acquired using the proposed graph matching approach. Finally, the correlation

coefficient criterion between the corresponding descriptor sets is calculated to be

considered as the similarity measure of two images. The experimental results show

that the proposed system effectively searches for relevant images with various

projective distortions.

Acknowledgements



and Technology (KRF-2010-0013757).


52

Abstract: Detection and Recognition of Multiple Moving Objects in

Video Sequence using Fast Level Set Method and Hidden Markov

Model

Wanhyun Cho1, Sunworl Kim

2, Sangcheol Park

3, Jonghyun Park

4*, Soonyoung Park

4

1Dept. Statistics, Chonnam National University, Korea

2Radiation Health Research Institute, Korea Hydro & Nuclear Power Co., Ltd.,

Korea 3Samsung Medison Co., Ltd., Korea

4Dept. Electronic Engineering, Mokpo National University, Korea

[email protected], {sunworl, park.sangc}@gmail.com,{pjhyun,sypark}@mokpo.ac.kr

Abstract

In this paper, we propose a novel algorithm for the real-time detection and recognition

of multiple moving objects that sequentially integrates a fast level set method and the

hidden Markov model (HMM). First, we apply the Clausius entropy difference

method in transformed image to detect the coarse region of the moving objects and

construct a mask image covering the detected coarse region. Second, taking the initial

region as the mask image given by the coarse detection step, we derive a dense

detection region for moving objects by applying the curve evolution theory with a fast

level set method and the smart narrow band algorithm. Third, we use a discrete

wavelet transformation technique to extract proper feature vectors from the detected

dense image. Finally, we use the hidden Markov model to accurately recognize

moving objects. Experimental results show that our proposed method can effectively

detect and accurately recognize moving objects in video sequences.

Acknowledgements

This work was supported by a National Research Foundation of Korea (NRF) grant

funded by the Korean Government (MEST) (KRF-2010-0013757) and (2010-

0003360).


53

Abstract: A Resource Scheduling Mechanism for Power Reduction in

Extended Virtual Machine System

Yunfa Li, Qili Zhou, Jian Wan, Rong Ouyang, Jiling Zhang, Xingdong You

School of Computer Science and Technology, Hangzhou Dianzi University, 310018

Hangzhou, China

[email protected]

Abstract

With the growth of system resources, it has become very difficult problem that how to

schedule system resources for tasks and reduce power consumption in extended

virtual machine system. In order to resolve this problem, we propose a resource

scheduling mechanism. In the resource scheduling mechanism, we first propose a

resource scheduling model for power reduction. Then, we present an algorithm to

resolve the optimal solution of the model. In order to justify the feasibility and

availability of the resource scheduling mechanism, a series of experiments have been

done. The results show that it is feasible to schedule system resources and reduce

power consumption in extended virtual machine system.

Acknowledgements

This paper is supported by National Basic 973 Research Program of China under

grant No.2007CB310900, Zhejiang Povincial Natural Science Foundation of China

under Grant No. Y1090297, Y6090312 and Y1101104.


54

Abstract: Analysis and Compensation of Phase Noise in the MISO

SFBC DFT-Spread OFDM Communication System

Heung-Gyoon Ryu, Donggeon An

Department of Electronic Engineering, Chungbuk National University,

12 Kaesin-dong, Cheongju, Korea


Abstract

In the two transmit/one receive antenna configuration, we theoretically analyze and

evaluate the phase noise influence on the MISO (multiple-input single output) type

DFT-Spread OFDM(orthogonal frequency division multiplexing) system, especially

SFBC (space frequency block coding) DFT-Spread OFDM system, then, apply

several phase noise compensation method to minimize interference. Simulation results

show that in the SFBC DFT-Spread OFDM system, the ICI (inter-sub-carrier-

interference) and SCI (self-channel-interference) cannot be neglected because 2× 1

SFBC DFT-Spread OFDM even intensifies phase noise influence due to the

simultaneous generation of more SCI and ICI than 2× 1 DFT-Spread OFDM only, so

interference compensation is necessary. It is found that data-conjugate ICI self-

cancellation method and symmetric data-conjugate ICI self-cancellation method can

achieve considerable performance improvement than SFBC method in 2× 1 DFT-

Spread OFDM system, besides, data-conjugate method is superior than symmetric

data-conjugate method.

Acknowledgements





55

Abstract: Prognostic Marker for Patients of the Non ST Elevation

Myocardial Infarction

Ho Sun Shon1, Soo Ho Park

1, Mohamed Bashir

1, Jang-Whan Bae

2, Kyung-Kuk

Hwang2, Keun Ho Ryu

1*

1Database Laboratory, Department of Computer Science, Chungbuk National

University, Cheongju, Chungbuk, 361-763, Republic of Korea 2Department of Medicine, School of Medicine, Chungbuk National University,

Cheongju, Chungbuk, 361-763, Republic of Korea 1{shon0621, soohopark, mohamed, khryu}@dblab.chungbuk.ac.kr

2{drcorazon, kyungkuk}@chungbuk.ac.kr

*Corresponding Author

Abstract

In this paper we analyzed only the patients of the NSTEMI (Non ST-segment

elevation myocardial infarction) who arrived at the hospital within 12 hours after

symptoms started. Using 12 months of NSTEMI follow-up data, the characteristics of

the clinical data, the risk factor, and the blood tested in the hospital visit were

analyzed for Major Adverse Cardiac Events (MACE) patients. MACE includes

cardiac death, MI (mycocardial infarction), Re-PCI, and CABG (coronary artery

bypass graft). As a result, from the NSTEMI patients which can be followed up for

over 12 months, NT-ProBNP (p=0.014) and age (p=0.045) are found to be the

independent risk factors related to MACE. Accordingly, they can be useful for the

diagnosis and prognosis about NSTEMI patients as a biomarker.

Acknowledgements

This work was supported by the National Research Foundation of Korea (NRF) grant

funded by the Korea government (MEST) (No. 2011-0001044).


56

Abstract: A Multimodal Fusion Algorithm Based on FRR and FAR

Using SVM

Yong Li1, 2

, Jianping Yin1, En Zhu

1, Fayao Liu1, Xinwang Liu1 , Jianmin Zhao

3*,

1 School of Computer, National University of Defense Technology, Changsha, Hunan

Province, China 2 Engineering College of Armed Police Forces, Xi'an 710086, China

3 Top Key Discipline of Computer Software and Theory in Zhejiang Provincial

Colleges, Zhejiang Normal University, 321004,China

{liyong, jpyin, enzhu}@nudt.edu.cn, [email protected],

[email protected],[email protected]

Abstract

Remarkable improvements in recognition can be achieved through multibiometric

fusion. Among various fusion techniques, score level fusion is the most frequently

used in multibiometric system. Already existing score level fusion approaches can be

categorized into three classes: transformation-based, density-based and classifier-

based. In this paper, advantages and disadvantages of the three fusion techniques are

analyzed. And then we propose a novel fusion algorithm based on False Reject Rate

(FRR), and False Accept Rate(FAR) using Support Vector Machine(SVM). It

transfers scores into corresponding FRR and FAR, thus avoiding calculate posteriori

probability of a certain score, as well as be capable of illustrating distribution of

matching scores. The proposed method takes full advantages of both capabilities of

FRR and FAR to describe the order of score, and classification of SVM. Experimental

results show that the proposed method outperforms several representative approaches

and can effectively improve the performance of multibiometric system.

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant

No. 60970034), the Foundation for the Author of National Excellent Doctoral

Dissertation (Grant No. 2007B4), and the Opening Fund of Top Key Discipline of

Computer Software and Theory in Zhejiang Provincial Colleges at Zhejiang Normal

University(Grant No. ZSDZZZZXK38).


57

Abstract: Trend Following With Float-encoding Genetic Algorithm

Yain-Whar Si, Simon Fong, Jiahua Luo

Department of Computer and Information Science, University of Macau

Av. Padre Tomas Pereira, Taipa, Macau

{fstasp, ccfong, mb15457}@umac.mo

Abstract

Stock trend following plays an important role in technical analysis. In this paper, we

propose a model based on Float-encoding Genetic Algorithm (FGA) to determine the

best thresholds for trend following in financial time series. Trend following is based

on the thresholds called P&Q which is calculated from the amount of an uptrend and

downtrend to determine when to buy and sell at a particular time point. In our model,

we first smooth the closing price by Exponential Moving Average (EMA) and

partition the sample data into two parts respectively for training and testing. During

the training session, FGA is used to find the best P&Q values which optimizes the

overall profit based on a chosen EMA. The resulted P&Q is then evaluated against the

testing data. Experiments conducted on Hang Sang Index (HSI) from Hong Kong

shows promising results.

Acknowledgements

This research is funded by the University of Macau.


58

Abstract: Mining Association Rules in Microarray Datasets by Using

a MapReduce Framework

Md. Rezaul Karim1, A. T. M Golam Bari

1, Byeong-Soo Jeong

1, and Ho-Jin Choi

2 1Department of Computer Engineering, Kyung Hee University, Republic of Korea 2Department of Computer Science, Korea Advanced Institute of Science and

Technology, Republic of Korea

{asif_karim, bari, jeong}@khu.ac.kr; [email protected]

Abstract

Microarray dataset is very huge with a large number of columns but a small number

of rows. Such dataset poses a great challenge for finding association rules in a faster

way. In addition, it is also very important to extract biologically meaningful

information from the huge amount of gene expression data in understanding of gene

regulation networks and cellular state, because most cellular processes are regulated

by changes in gene expression. Association rule mining techniques are helpful to find

relationship between genes, but most of the developed association rule mining

algorithms are based on main memory and single processor based techniques which

are not capable of handling large data and producing result in a faster way. In this

paper, we proposed a MapReduce framework for mining association rules from a

huge microarray gene expression dataset on Hadoop; which not only overcomes the

main memory bottleneck but also highly scalable in terms of increasing data size.

Extensive experimental results show that our proposed approach is efficient for

mining high confident association rules from large microarray gene expression

datasets in terms of time and scalability.

Acknowledgements

This work was supported by a grant from the NIPA (National IT Industry Promotion

Agency, Korea) in 2011 (Fostering Global IT Human Resource Project) and the

National Research Foundation (NRF) grant (No. 2011-0018264) of Ministry of

Education, Science and Technology (MEST) of Korea.


59

Abstract: Financial Time Series Representation Based on Turning

Points with Sliding Window

Yain-Whar Si, Jiangling Yin

Department of Computer and Information Science, University of Macau

Av. Padre Tomas Pereira, Taipa, Macau


Abstract

Financial time series analysis and prediction are active research problems in the

financial data mining area due to the attractive commercial applications. However,

financial time series data are large in size and dynamic and non-linear in nature, and

they thus pose a considerable challenge for analysts attempting to discover the

required information. A necessary step prior to information mining is the

dimensionality reduction of the time series representation. In this paper, we propose a

novel representation method for stock time series that is based on turning points (TPs),

which can well represent the fluctuation of time series. The proposed method selects

TPs through sliding windows and lets the representation interval in an even way over

the time series. And the method can be used directly for online representation and

real-time applications, such as online pattern detection and the similar subsequences

matching.

Acknowledgements

This research is funded by the University of Macau.


60

Abstract: Blind Deconvolution Based on Empirical Mode

Decomposition in Ultrasonic Evaluation

Youngseok Lee*, Myungwoo Nam

Dept. Of Electronic Eng., Chungwoon Univ., Daehak- Gil 25, Hongsung, Chungnam,

350-701, Korea*

Dept. Of Electronic CAD, Hyejeon College, Daehak- Gil 25, Hongsung, Chungnam,

350-702, Korea

[email protected]*, [email protected]

Abstract

In this paper, we proposed new ultrasonic evaluation method to detect internal flaw in

material using empirical mode decomposition and blind deconvolution process. At

first, the maximum power IMF among IMFs obtained from EMD, was selected and

was applied to blind deconvolution process. Then, the impulse response which was

made by inverse filter in blind deconvolution process, was applied to the maximum

power IMF. In order to evaluate the proposed method, the conventional methods were

compared using the specimen with artificial defects. From the experiment results, the

proposed method can be confirmed that it can detect the flaw position more accurate

than conventional methods.


61

Abstract: Time Domain Audio Watermarking Scheme for Copyright

Protection Based on Multiple Embedding

Md. Rifat Shahriar1, Sangjin Cho

2, Ui-Pil Chong

*1

1Dept. of Computer Engineering and Information Technology,

2School of Electrical

Engineering, University of Ulsan, Ulsan, South Korea [email protected],

[email protected],

*[email protected]

Abstract

An audio watermarking technique in the time domain, based on multiple embedding,

is proposed in this paper. Exploiting the properties of Polar coordinate system, more

than one marking space is obtained from the host audio where watermarks are

embedded which facilitates to attain higher embedding capacity for this scheme. High

quality of the audio is maintained by controlling distortion level during embedding

that is verified by the objective measurement of quality. Security of the proposed

system is ensured by the random embedding positions and associated information

which cannot be determined statistically without the secret key. Error correction code

(ECC) is also incorporated is this scheme to enhance robustness of the watermark

message against external attacks. Eventually, a high retrieval rate of the watermark

message is ensured by the performance test results.

Acknowledgements


Research Foundation of Korea (NRF) funded by Ministry of Education, Science and

Technology (2011-0014554).


62

Abstract: A Study on Color-Texture Image Watermarking Based on

Texture Analysis

Myeongsu Kang1, Truc T. K. Nguyen

1, Cheol-Hong Kim

2, and Jong-Myon Kim

1,*

1School of Electrical Engineering, University of Ulsan, Ulsan, South Korea,

2School of Electronics and Computer Engineering, Chonnam National University,

Kwangju, South Korea 1{ilmareboy, nguyenthikimtruc, jongmyon.kim}@gmail.com,

[email protected]

Abstract

Nowadays, texture images have been presented and used in a great deal of industry

and life application and copyright protection of texture images has become urgent

problem. With this reason, we propose a color-texture image watermarking algorithm

utilizing texture properties. The proposed algorithm selects suitable blocks to embed a

watermark by using energy and homogeneity properties of grey level co-occurrence

matrices as an input of the fuzzy c-means clustering algorithm. To embed a

watermark, we firstly perform discrete wavelet transform (DWT) on the selected

blocks and choose one of DWT subbands. Then, we finally embed a watermark into

discrete cosine transformed blocks with a gain factor. In this study, we also explored

the impact of DWT subbands and gain factors with respect to imperceptibility and

robustness against various watermarking attacks. Experimental results showed that the

proposed algorithm achieved higher values of peak signal-to-noise ratio (47.66 dB to

48.04 dB), lower values of M-SVD (8.84 to 15.6), and higher values of normalized

correlation (0.7193 to 1) for all of watermarking attacks when we embedded a

watermark into the HH band with a gain factor α =42.

Acknowledgements

This work was supported by the National Research Foundation of Korea (NRF) Grant

Funded by the Korean Government (MEST) (No. 2011-0004289, No. 2011-0017941).


63

Abstract: Facial Expression Recognition Using Gabor Filter and

Local Transitional Pattern

Tanveer Ahsan1, Taskeed Jabid2, Ui-Pil Chong

1,*

1School of Electrical Engineering, University of Ulsan, Ulsan, South Korea

[email protected], *[email protected] 2Department of Computer Science and Engineering, East West University, Dhaka,

Bangladesh

[email protected]

Abstract

Automatic facial expression analysis plays a major role in catching emotional state of

a human being and can be effectively used in the field of human-computer interaction.

Using an effective facial feature is the most critical part for a successful facial

expression recognition system. This paper proposes a novel approach in pursuit of

recognizing facial expression where facial feature is represented by a hybrid of Gabor

wavelet transform of an image and local transitional pattern (LTP) code. Expression

images are classified into prototype expression via support vector machine (SVM)

with different kernel. Experimental results using Cohn-Kanade expression database is

compared with other methods which demonstrate the superiority of the proposed

approach which successfully identifies more than 95% of facial expressions correctly.

Acknowledgements

This work was supported by a grant from the NIPA (National IT industry Promotion

Agency), (Fostering Global IT Human Resource Project). The authors would also like

to thank the School of Excellence in Electrical Engineering at University of Ulsan.


64

Abstract: Parallel Approaches for Medical Image Registration

Jong-Myon Kim1 and Cheol-Hong Kim

2,*

1School of Electrical Engineering, University of Ulsan, Ulsan, South Korea,

2School of Electronics and Computer Engineering, Chonnam National University,

Kwangju, South Korea [email protected],

[email protected]

Abstract

Medical image registration plays an important role in medical imaging in the early

detection of cancers. An essential component in most medical registration approaches

is resampling algorithms. These algorithms, however, demand tremendous

computational power associated with similarity computation. The increasing

availability of parallel computers makes parallelizing these tasks an attractive option.

This paper presents parallel approaches for the resampling algorithms using a

representative parallel Single Instruction, Multiple Data (SIMD) processor array to

meet the computational requirements. This paper also presents not only a general

theory of resampling algorithms including rotation, scaling, and translation, but also

parallel implementations of these algorithms on the SIMD processor array.

Experimental results show that parallel approaches achieve a speedup of 2.6x over the

FPGA implementations with the same clock frequency of 80 MHz.

Acknowledgements

This work was supported by the National Research Foundation of Korea (NRF) Grant

Funded by the Korean Government (MEST) (No. 2011-0003350, No. 2011-0017941).


65

Abstract: Design of Cost and Performance Efficient Fast Fourier

Transform Processors with Various Number Systems

Seung-Ho Ok1, Sungho Kang

2, Jin-Ho Ahn

3, Yong-Hwan Lee

4, and Byungin Moon

5,*

1School of Electrical Engineering & Computer Science, Kyungpook National

University, Daegu 702-701, Korea 2Department of Electrical and Electronic Engineering, Yonsei University, Seoul 120-

749, Korea 3Department of Electronic Engineering, Hoseo University, Chungcheongnam-do 330-

713, Korea 4School of Electronic Engineering, Kumoh National Institute of Technology, Gumi

730-701, Korea 5School of Electronics Engineering, Kyungpook National University, Daegu 702-701,

Korea [email protected],

[email protected],

[email protected],

[email protected],

[email protected]

Abstract

In this paper, we design fast Fourier transform (FFT) processors and discuss the

influence which the type of number system and the word length of the FFT have on

the performance and cost of FFT processors. The type of number system and the word

length of the FFT are important factors in FFT processors. Thus, these factors should

be determined with careful consideration in the design of FFT processors. In this

paper, we design 64, 256 and 1024-length radix-4 FFT processors based on various

number systems, including fixed-point, block floating-point and floating-point

number systems, with a 0.18-µm complementary metal–oxide–semiconductor,

(CMOS) technology. Then, we discuss the cost and performance of FFT processors

that vary depending on the type of number system and the word length used. Finally,

from the practical analysis of the experiment results, we propose a cost and

performance effective word length for floating-point FFT processors.

Acknowledgements

This research was supported by the MKE (The Ministry of Knowledge Economy),

Korea, under the CITRC (Convergence Information Technology Research Center)

support program (NIPA-2012-C6150-1202-0011) supervised by the NIPA (National

IT Industry Promotion Agency).


66

Abstract: Protecting Malicious Attacks from Unauthorized WOL

Simon S. H. Park1, Wookey Lee

2, Chasung Lim

3 and Jumi Kim

4

1Dept. Industrial Engineering, Inha University, 253 Yonghyon 4-dong, Nam-gu,

Incheon, Korea 2ASEC(AhnLab Security Emergency Response Center), AhnLab, Inc

673, Sampyeong-dong, Bundang-gu, Seongnam-si, Gyeonggi-do, Korea 3Korea Small Business Institute, 16-2 Yoido, Yeongdeungpo-ku, Seoul, Korea

[email protected], {1fgm0626,

2trinity}@inha.ac.kr,

[email protected],

[email protected]

Abstract

Sending magic packet is one of the remote computer functions that can wake up the

computer through the coded signal. However there is a problem. Because of the

packet’s characteristics, every computer in the same network can receive the

broadcasted signal. When the system is awakened by WOL unintentionally, the

possibility of information leakage should be increased. In this proceeding, we suggest

a method that how to prevent attacks like involuntary switched-on of a system. For

solving this problem, we block unauthorized WOL by authentication server.

Acknowledgements

This work was supported by Defense Acquisition Program Administration and

Agency for Defense Development under the contract UD080042AD, Korea.


67

Abstract: Classification of Camera-Models based on Two-step

Transition Matrix

Shang Gao1, Rui-Min Hu

1*, Tao Lu

2

1 National Engineering Research Center for Multimedia Software, Wuhan University,

Wuhan, China 2 Hubei Province Key Laboratory of Intelligent Robot, Wuhan Institute of Technology,

Wuhan, 430070, China


Abstract

In this paper, we propose a camera-model classification method based on two-step

transition Matrix. The artifacts introduced by the whole camera inside imaging

processing can reflect model-specific to some extent, and will be left on JPEG

quantified coefficients more or less. Therefore, for camera-model identification, we

can model JPEG quantified coefficients by Markov process, and use two-step

transition matrix as features to capture these artifacts. We design a 63-D feature set

and perform camera-model classification. Image from seven camera models in the

Dresden Image Database are chosen as our experiment database. Experiment results

show that in seven models detection, even with low dimension features, the average

detection accuracy of our method can reach to 99.49%, which is higher than that of

previous Markov method [12].

Acknowledgements

The Database in this paper is from ‘Dresden Image Database’. This paper was

supported by the major national science and technology special projects

（2010ZX03004-003-03） , the National Natural Science Foundation of China

(61070080, 60970160, 61003184), the Natural Science Foundation of Hubei Province

of China (2009CDA134, 2010CDB05103), the Fundamental Research Funds for the

Central Universities (3101011), the Hubei Province Key Laboratory of Intelligent

Robot（HBRI 200907） , the youths science foundation of Wuhan institute of

technology.


68

Abstract: Determining the Discontinuities and Locations for

Three Dimensional Trajectory Data Analysis in Teleoperation

Kiwon Yeom1, Stephen R. Ellis

1, Bernard D. Adelstein

1

NASA Ames Research Center, Moffett Field, CA 94035, USA

[email protected]

Abstract

Change points are abrupt variations in a data sequence. Detection of change points is

useful in modeling, analyzing, and predicting time series in application areas such as

robotics and teleoperation. In this paper, a change point is defined to be a

discontinuity in one of its derivatives. This paper presents a reliable method for

detecting discontinuities within a three dimensional trajectory data. The problem of

determining one or more discontinuities is considered in regular and irregular

trajectory data from teleoperation. We examine the geometric detection algorithm and

illustrate the use of the method on real data examples.


69

Abstract: Self-Synchronized Peak Alignment for Flexible Comparison

of Teleoperated Mobile Object Trajectories

Kiwon Yeom1, Stephen R. Ellis

1, Bernard D. Adelstein

1

NASA Ames Research Center, Moffett Field, CA 94035, USA

[email protected]

Abstract

The dynamic time warping (DTW) can be used to find the optimal alignment between

two trajectories (time series) and to determine the similarity, classification, and

corresponding area of trajectories. Although DTW has been successfully used in

many domains, it might still fail to find obvious natural alignments in two trajectories

because a characteristic for example, peak in one trajectory is slightly higher or lower

than its corresponding time line in the other sequence. This can lead to unintuitive and

undesirable behavior such as singularities. In this paper, we investigate a self-

synchronizing peak alignment algorithm based on DTW in conjunction with moving

window. The crucial difference is that we attempt to find the correct warping by

comparing peaks which can be considered as most important feature in any time

series. We demonstrate the implement of the proposed algorithm. In addition, we

compare the proposed algorithm with previous DTW algorithm using our teleoperated

data set.

Acknowledgements

This work was supported by a grant from NASA and performed at Advanced Control

and Display Lab.


70

Abstract: Utterance Verification for POI Item Recognition in

Automotive Navigation Application

Jeomja Kang1,*

, Youngjoo Suh2, Hoirin Kim

2, Young-Sun Yun

3

1Spoken Language Processing Team, Electronics and Telecommunications Research

Institute, 138, Gajeong-ro, Yuseong-gu, Daejeon, 305-700, Korea 2KAIST, 291, Daehak-ro, Yuseong-gu, Daejeon, 305-701, Korea

3Hannam University, 133 Ojeong-dong, Daedeok-gu, Daejeon, 306-791, Korea

*[email protected]

Abstract

In this paper, we propose an efficient utterance verification technique to confirm the

results of very large vocabulary isolated speech recognition, namely, the N-best-based

point-of-interest (POI) item recognition for automotive navigation application. The

proposed technique utilizes a combined confidence measure (CM) by incorporating

the classical monophone-antimodel-based CM and the N-best-driven triphone-

antimodel-based CM. Experimental results showed that the proposed technique

provides equal error rates of 12.6% and 13.1% in verifying the 1-best recognition

results and the overall 10-best recognition results, respectively, in the 550k Korean

POI item-based speech recognition domain.

Acknowledgements

This work was supported by the Industrial Strategic technology development program

10035252, Development of dialog-based spontaneous speech interface technology on

mobile platform funded by the Ministry of Knowledge Economy(MKE,Korea) and

was supported in part by the National Research foundation of Korea (NRF)

grant(2010-0013288) funded by the Korea government(MEST).


71

Abstract: Priority-based Chunk Scheduling Algorithm for Large

Scale P2P Live Streaming System

Hongyun Yang*1, 2

, Ruimin Hu1, 2

, Xuhui Chen3, Jun Chen

1, 2

1 Computer School, Wuhan University, Hubei, 430072, China

2 National Engineering Research Center for Multimedia Software, Wuhan University,

Hubei, 430072, China 3

College of Mathematics & Computer Science, Wuhan Textile University, Hubei,

430073, China

[email protected]*,[email protected], [email protected]

Abstract

Chunk-based mesh-pull Peer-to-Peer (P2P) streaming is being considered as the most

promising approach to deliver real-time video to large scale users over the Internet.

Currently the majorities of chunk scheduling approaches focus on receiver side’s

chunk/peer selection strategies and neglect the service order at supplier side, which

will cause the user’s video quality descending in overloaded operating environments.

In this paper, we first propose the supplier side chunk priority model considering

requested chunks’ urgency of playback and rarity. Then based on the model, we

formulate the supplier side scheduling problem as a linear programming problem and

propose a greedy bandwidth resource allocation algorithm to solve it. The extensive

experiments demonstrate the proposed scheme effective in improving the quality of

experience of end users in overloaded operating environments comparing to the FCFS

(First Come First Service) scheme.

Acknowledgements

This paper is supported in part by the major national science and technology special

project in China (Grant No.2010ZX03004-003-03) and National Nature Science

Foundation of China (No.60832002, No.61172173).


72

Abstract: The Master-Slave Time Synchronization Protocol for

Ubiquitous Sensor Network

Moonsun Shin*, Bumju Lee, Youngjin Jung*

Department of Computer Engineering, Konkuk University, Chungju, Chungbuk,

Korea

Division of Constitutional Medicine Research, Korea Institute of Oriental Medicine,

Korea

Dept. of Cyberinfrastructure Development, KISTI, Korea

* Corresponding authors: Youngjin Jung, Moonsun Shin,

322 Danwol-dong, Chungju-si, Chungbuk, Konkuk University,

380-701, Republic of Korea,

Email: [email protected], Telephone: +82-43-840-3602, Fax: +82-43-840-3600

Abstract

The sensor networks can be used attractively for various application areas such as

military, air pollution, healthcare, and risk-associated applications. Time

synchronization is important in Ubiquitous Sensor Networks (USN) systems. In this

paper, we propose specific time synchronization based on master-slave topology for

the global time synchronization of USN with heterogeneous sensor nodes. The sensor

nodes which are homogeneous with the Sink Node become to be time-sync master

nodes and other sensor nodes which are different with the Sink Node must be time-

sync slave nodes which have to be belonged to the one of the specific master nodes.

The time-sync master nodes are always able to be synchronized with the Sink Node of

USN, because general algorithm of time synchronization is available due to the same

crystal clock. Then time-sync master nodes enable time-sync slave nodes to be

synchronized sleep periods. The proposed master-slave time synchronization for

heterogeneous sensor nodes of USN is also helpful for power saving by maintaining

maximum sleep time.


73

Abstract: Improvement of the Position Estimation of Mobile Robot

Using Multi-Sensor Fusion

Taeseok Jin1, Hyunsik Kim2, and Jongwook Kim3 1Dept. of Mechatronics Engineering, Dongseo University

2Dept. of Robot System Engineering, Tongmyong University 3Dept. of Electronics Engineering, DonA University


Abstract

In this paper, to implement a real time localization system, a new absolute position

estimation method for a mobile robot in indoor environment is proposed in this paper.

Design and implementation of the localization system comes from the usage of active

beacon systems (based upon RFID technology). The active beacon system is

composed of an RFID receiver and an ultra-sonic transmitter. The RFID receiver gets

the synchronization signal from the mobile robot and the ultra-sonic transmitter sends

out the traveling signal to be used for measuring the distance. Position of a mobile

robot in a three dimensional space can be calculated basically from the distance

information from three beacons and the absolute position information of the beacons

themselves. In some case, the mobile robot can get the ultrasonic signals from only

one or two beacons, because of the obstacles located along the moving path.

Therefore, in this paper, as one of our dedicated contribution, the position estimation

scheme with less than three sensors has been developed. Also, the Extended Kalman

Filter algorithm is applied for the improvement of position estimation accuracy of the

mobile robot.

Acknowledgements

This study was supported by research funds from Dong-A University.


74

Abstract: Development of Pressure Sensor and Comparison of

Carotid/Radial Pulses and Central Aortic Pulse

Ran Wei1,4

, Young Chul Lim1, Hee Sun Kim

2, Moo Yong Rhee

3, Jae Joong Im

1

1Division of Electronic Engineering, Chonbuk National University, Jeonju, Korea

2UnC Co., Ltd., JeonJu, Korea

3Cardiovascular Center, Dongguk University College of Medicine, Ilsan Hospital,

Goyang, Korea 4School of Electronics and Information Engineering, Tianjin Polytechnic University,

Xiqing, Tianjin, China

[email protected]

Abstract

Aortic blood pressure is more meaningful than brachial blood pressures for clinical

diagnosis, and ambulatory blood pressure monitoring is better predictor for the

outcomes than clinical blood pressure monitoring. However, there are few devices

which provide continuous central blood pressures and arterial stiffness noninvasively,

there still exist problems to be solved such as removal of calibration of blood pressure

values using traditional cuff-type blood pressure monitoring device. In this study,

pressure sensors were developed to detect two radial and one carotid pulse waveforms.

Central aortic pulse, two radial pulses and carotid pulse were recorded simultaneously

during surgery. Parameters were extracted and the relationships among them were

examined. Standard deviations for radial pulse pressures were all within the range of

±5 mmHg for every setup. Augmentation index from aortic pulse showed much lower

value than that from the radial sites. The pulse pressures of carotid pulse pressure

were within the range of ±5 mmHg for every setup. The values of averaged

augmentation index showed different trends, and it probably was caused by the

different force applied to the pressure sensor on the carotid artery.

Acknowledgements

This work was supported by the small and medium business administration and

second stage of Brain Korea 21 Project.


75

Abstract: Implementing Cloud Computing in the Current IT

Environments of Korean Government Agencies

Jong-Seok Kim1, Mihye Kim

2, Hyeong-Ok Lee

3*

1School of Electrical Engineering and Computer Science, Yeungnam University

[email protected]

2Department of Computer Science Education, Catholic University of Daegu

[email protected] 3Department of Computer Education, Sunchon National University

*[email protected]

Abstract

This paper presents implementation strategies for building cloud-based IT

environments for Korean central government agencies (K-Cloud Centers), to improve

service delivery in the public sector and reduce the cost of government operations.

This will be achieved by the introduction of cloud computing technologies in the data

centers of the National Computing and Information Agency (NCIA). This paper also

proposes an approach for building wide-area cloud-based IT centers for Korean local

government autonomous entities (W-Cloud Centers), to enhance the efficiency of IT

resource utilization via the consolidation of all IT resources operated by these local

entities. Through the implementations of cloud computing in the public sector, the

Korean government can realize a digital government capable of providing enhanced

service environments, while reducing IT-related budgetary expenditures and

protecting the environment.

Acknowledgements

This research was financially supported by the Ministry of Education, Science

Technology (MEST) and National Research Foundation of Korea (NRF) through the

Mid-Career Researcher Program (2009-0086676).


76

Abstract: A Failure Analysis for Search Engines Using Inference

Networks

Sa-kwang Song*, Sung Hyon Myaeng**, Hanmin Jung*, Seung-Woo Lee*

* Korea Institute of Science and Technology Information

{esmallj,jhm,swlee}@kisti.re.kr

** Korea Advanced Institute of Science and Technology

[email protected]

Corresponding Author: [email protected]

Abstract

We introduce a novel failure analysis method for retrieval engines, the aim of which

is to enable engine developers to identify the indexing or query processing

components that lead to ranking failures. The entire process of documents and queries

are modeled in a Bayesian inference network in which nodes represent terms and

layers represent different processing components. By computing and showing the

extent to which each node plays a role in causing a relevant (or irrelevant) document

to be ranked high (or low), the proposed method can signal the nodes to be examined

and hence the components to be modified. In order to show how well the

failure/success nodes are selected, we re-calculated the weight of the failure/success

terms in a retrieval system and simulated its running. We achieved a 13.2% increase

in MAP using TREC-3 test collection. This clearly shows that the proposed method

can be used for automatic failure analysis of a system with test runs and that its

effectiveness can be improved even automatically, let alone with expected

improvements and with actual modifications of the relevant components.


77

Abstract: Dynamic Materialization of Wildcard Rules for Improving

the Efficiency of Rule-based Reasoning

Seungwoo Lee1, Hanmin Jung

1*, Pyung Kim

2

Korea Institute of Science and Technology Information1

Jeonju National University of Education2

{swlee, jhm}@kisti.re.kr1, [email protected]

2

Abstract

Many entailment rules from RDF and OWL semantics have wildcard patterns in their

conditions. These wildcard pattern rules often cause inefficiency in rule-based

reasoning because all asserted triples can be matched to wildcard patterns. What is

worse, the wildcard pattern rules often cause much more inefficiency, like too-

exhaustive use of memory in the reasoning of a large-scale ontology. In this paper, we

propose a method that dynamically materializes wildcard pattern rules into specific

rules by referring to ontology schema. The proposed materialization method can avoid

inefficiency and be embedded into a Rete framework, which is a representative

algorithm for rule-based reasoning. We evaluated the effects of the materialization by

counting the reduced number of join nodes and the reduced number of join operations

tried and measuring the size of alpha memory and the elapsed time in reasoning. The

number and size were dramatically reduced and the increasing ratio of reasoning time

was almost constant. From these results, we are convinced that the performance of

rule-based Rete reasoning can be considerably improved by the suggested dynamic

materialization of wildcard pattern rules.


78

Abstract: Secure Overlay Network Service for Global Cooperation

DaeHee Seo1, JangMi Baek

2, GaeIl An

1, YoungHwan Bang

3, KangChan Lee

1

1Electronics and Telecommunications Research Institute

2SoonChunhyang University,

3Korea Institute of Industrial Technology

[email protected], [email protected], [email protected], [email protected],

[email protected]

Abstract

This paper aims to analyze vulnerability of overlay networks for the existing P2P

service and suggest a secure and efficient secure overlay network. Encryption

functions are used to provide encryption, explicit mutual authentication and session

keys are provided to ensure secure communication, and a middle object is suggested

to maintain efficiency. Moreover, Time stamps are used for each communication

process to provide effective network security service. And so in this paper, an update

of ESCORT network scheme[4] approach and through the routing protocol to secure

communicate between users to provide session key based secure channel. Thus, the

proposed secure overlay network provides not only security for P2P users but also

other advantages such as user privacy protection, secure communication and effective

security management through centralized control.

Acknowledgements

This paper has been supported by the Software R&D program of KCC. [10914-06002,

Development of global collaborative integrated security control system]


79

Abstract: A Study on Information Security in Smartwork

Hee-Kyung Kong, Kihoon Sung*

Electronics and Telecommunications Research Institute

{konghk, skh64261}@etri.re.kr

Abstract

Interest in information security in the smartwork environment has been increasing, as

the advancement of ICT technology is causing the transformation of telework into

smartwork. However, investment in security remains insufficient as regards the

investment needed for the development of solutions to support the rapid changes in

the work environment, management doubts about the benefits of investment in

information security, and the lack of a coherent system of analysis of information

security issues in the work environment. This paper describes a study on the use of

AHP to deduce the decision criteria for investment in information security by

analyzing a number of information security considerations in the smartwork

environment. The study indicates that ‘business efficiency’ is the most important

criterion of evaluation and that ‘infrastructure security’ and ‘public computer security’

are the major information security issues.


80

Abstract: All-optical Coder/Decoder for Packet-level Synchronization

and Header Recognition for Mesh-Connected Ring Networks

Hae Geun Kim* and Hyuek Jae Lee**

*School of Computer and Information Communication, Catholic University of

Daegu, 330 Kumrak-ri, Hayang-up, Kyungsan-si, 712-702, Korea

Tel:+82-53-850-2744, FAX: +82-53-850-2750

[email protected]

**Division of Information and Communication, Kyungnam University

449 Wolyoung-dong, Masan, 631-701, Korea

[email protected]

Abstract

A novel self-routing packet switch using an all-optical coherent 3-bit optical

Coder/Decoder for packet-level synchronization and header recognition in an ultra-

high speed optical network is experimentally demonstrated. Using this scheme, a

mesh-connected ring network based on wavelength division multiplexing channels

resolves a packet contention problem without optical buffers in optical LANs. Usually,

two essential functions to perform optical self-routing packet switching are packet-

level synchronization and header recognition which are implemented, separately. In

this paper, the all-optical coherent ‘3-bit code’ Coder/Decoder performs two essential

functions, simultaneously and is successfully demonstrated.

Acknowledgements

This research was supported by the Research Grants of Catholic University of Daegu

in 2011.


81

Abstract: Hybrid Sensing Model using User Scenario for Smart

Service

Svetlana Kim and YongIk Yoon*

Department of Multimedia Science, Sookmyung Women’s University

Chungpa-dong 2ga, Younsan-Gu, 140-742, Seoul, Korea



Abstract

The information for recommendation services is collected to make the user scenario

depending on time, location, action based on the sensing process. This paper is

proposed a service recommendation model based on user scenario using hybrid

sensing-awareness. The scenarios can help predict a user’s situation and provide the

services in advance. Also, content categories as well as the content type are

determined depending on the scenario. The scenario is a method for providing the best

service as well as a basis for the user’s situation. Using this method, proposing a new

smart service

Acknowledgements


Korea, under IT/SW Creative research program supervised by the NIPA (National IT

Industry Promotion Agency)" (NIPA-2011-C1820-1101-0005).


82

Abstract: A Situation-awareness based Error Sharing Agent

running on a Cloud Computing Environment

Eungnam Ko*, Soongohn Kim (Corresponding Author)** * Division of Information & Communication, Baekseok University, 115, Anseo-

Dong, Cheonan, Chungnam, 330-704, Korea **

Division of Computer and Game Science, Joongbu University, 101 Daehakro,

Chubu-Meon, GumsanGun, Chungnam, 312-702, Korea

*[email protected], **[email protected]

Abstract

This paper proposes a situation-awareness based error sharing agent running on a

cloud computing environment. An example of a situation-awareness is RCSM

(Reconfigurable Context-Sensitive Middleware). However, it did not include services

for cloud computing, other services, and error control support in the architecture. The

cloud computing environment distributes IT (Information Technology) resources and

allocates according to user's request, so there should be a study on technology that

manages these resources effectively. This paper focuses cloud application services

which include social interaction, multi-user media sharing, and layered media service.

Especially, we describe a RCSM based error sharing agent running on a cloud

computing environment.


83

Abstract: Typhoon Recognition and Center Positioning based on

Satellite Cloud Image

Wei Tian 1,2

, Tinghuai Ma1, Jin Wang

1, Qiaoqiao Yan

1, Sungyoung Lee

3

1 Jiangsu Engineering Center of Network Monitoring, Nanjing University of

Information Science& Technology, China 2

School of Atmospheric Science, Nanjing University of Information Science&

Technology, China 3 Computer Engineering Department, Kyung Hee University, South Korea

{tw, thma, wangjin, qqyan}@nuist.edu.cn; [email protected]

Abstract

Because typhoon has different characteristics in different development stages, such as

texture, shape, and area, we compute segmentation of typhoon cloud system by using

two value image connected region labeling algorithm, based on recognition of

typhoon cloud system, we propose a novel algorithm of locating typhoon's center by

mathematical morphology which deals with cloud image typhoon. Experimental

results show that the typhoon can be recognized and located effectively in a

meteorological Satellite cloud image. Primary meteorological service application

shows that the method has higher recognition rate and cloud center positioning

accuracy.

Acknowledgements

This research was supported by the Basic Science Research Program through the

National Research Foundation (NRF) of Korea funded by the Ministry of Education,

Science and Technology (2011-0002980). This work was also supported in part by the

National Science Foundation under Grant No.61173143 and supported by a project

funded by the Priority Academic Program Development of Jiangsu Higher Education

Institutions. Prof. Sungyoung Lee is the corresponding author.


84

Abstract: Optimal Wireless Sensor Nodes Placement using Fuzzy C-

means Algorithm

Ki Hwan Eom1, Chong Ryol Park

1, Sang Won Yoon

1, Kyung Kwon Jung

2

1Dongguk University,

2Korea Electronics Technology Institute

{kihwanum, parkcr, sangwony}@dongguk.edu, [email protected]

Abstract

In this paper, we propose an intelligent deployment of sensor network for reliable

communication. The proposed method determines optimal transmission range based

on the wireless channel characteristics, and searches the optimal number of sensor

nodes, and optimal locations with fuzzy C-means algorithm (FCM). We calculate

packet reception rate (PRR) against a distance uses the log-normal path loss model,

and decide the communication range of sensor node from PRR. In order to verify the

effectiveness of the proposed method, we performed simulations on the searching for

intelligent deployment and checking for link condition of sensor network. We

demonstrate that optimal transmission range is 20 m, and optimal number of sensor

nodes is 8 or higher.

Acknowledgements

This research was supported by the Agriculture Research Center program of the

Ministry for Food, Agriculture, Forestry and Fisheries, Korea.


85

Abstract: A Feedback-Diffusion Scheme with Modified Huffman

Coding in Wireless Sensor Networks

Myungho Yeo1, Jaesoo Yoo

2, Dongmin Seo

3,*

1Agency for Defense Development, KOREA 2Chungbuk National University, KOREA

3Korea Institute of Science Technology Information, KOREA

[email protected],

[email protected],

[email protected]

Abstract

We propose a novel compression scheme, called feedback-diffusion to exploit the

global statistics of sensor readings. While base stations or mobile sinks just collect

sensor data in the conventional algorithm, our proposed scheme extracts global

statistics from historical readings and broadcasts its feedback into the network. Then,

sensor nodes compress their current readings by using feedback and transmit the

compact data to the base station or mobile sink. We also propose a variant of Huffman

coding as feedback to achieve both compression enhancement and energy-efficiency.

Our simulation results show that feedback-diffusion with modified Huffman coding

compresses sensor data by about 40% and prolongs network lifetime by about 30%.

Acknowledgements

This work was supported by the Dual Use Technology program of the DUTC, South

Korea [Surveillance and Reconnaissance Sensor Network Development].


86

Abstract: Energy Efficient Feedback Message Communication using

Intermediate Node Selection and Control in INSENS

Ji Won Kim and *Tae Ho Cho

College of Information and Communication Engineering, Sungkyunkwan University,

300 Cheoncheon-dong, Jangan-gu, Suwon, Republic of Korea, +82-31-290-7221

[email protected], *[email protected]

Abstract

Sensor nodes have limitations of hardware performance. Therefore a wireless sensor

network is operated that consider security and energy consumption. The INtrusion-

tolerant routing protocol for wireless SEnsor NetworkS (INSENS) is proposed to

prevent network layer attacks such as wormhole or Sybil attack and guarantees secure

data transmission. To achieve these objectives, all nodes send feedback message

containing own all neighbor node information to the base station in route discovery

phase of INSENS. It causes excessive energy consumption because of the network

density of them. We propose the control method that selects an intermediate node,

sending a feedback messages including the entire neighbor node information. Non-

selected nodes send feedback message including only the parent node information. In

the proposed method, intermediate node is selected as probability that is computed

evaluation function. This is computed using a type and amount of feedback message.

Simulation shows that proposed method can complete the network topology using low

energy consumption.

Acknowledgements





87

Abstract: An Efficient User Authentication Scheme for Wireless

Communications

Woongryul Jeon1, Kwangwoo Lee

1, Byunghee Lee

1, Yunho Lee

2, and Dongho Won

1*

1School of Information and Communication Engineering, Sungkyunkwan University.

2Department of Cyber Security & Police, Gwangju University.

{wrjeon, kwlee, bhlee, dhwon }@security.re.kr, [email protected]


Abstract

In 2011, Li and Lee proposed a novel user authentication scheme with anonymity for

wireless communications. In particular, Li and Lee defined two more session keys and

adopted Diffie-Hellman key agreement method for their scheme to establish two more

session keys. However, since modular exponential computation demands plenty of

resources, their scheme is very inefficient. Thus, in this paper, we address the

drawbacks of Li and Lee's scheme and propose an efficient user authentication

scheme for wireless communications with same functionality and security.

Acknowledgements


Korea, under the ITRC(Information Technology Research Center) support program

supervised by the NIPA(National IT Industry Promotion Agency)" (NIPA-2012-

C1090-1101-0004).


88

Abstract: A Runtime System Behavior Evaluation Methodology for

Autonomic Systems Using a Dynamic Weight-changing method

Chonghyun Lee1, Hyunsang Youn

1, Ingeol Jeon

2, Eunseok Lee

1,

1Sungkyunkwan University, Department of Computer Engineering,

Suwon, South Korea 2Electronics and Telecommunications Research Institute(ETRI),

Daejeon, South Korea 1{carve9142, wizehack, leees}@skku.edu,

[email protected]

Abstract

We propose a novel approach to evaluating autonomic systems at runtime. Our

proposed method takes advantage of a goal model that has been widely used at the

requirement elicitation phase to capture the system requirements. We suggest a state-

based goal model that becomes dynamically activated as the system state changes. In

addition, we defined the type of constraints that can be used to evaluate the goal

satisfaction level and we proposed a dynamic weight changing method for the goal

model that can adjust the model depending on the environment.

Acknowledgements

This work was supported by the IT R&D Program of MKE/KEIT [10035708, “The

Development of CPS (Cyber-Physical Systems) Core Technologies for High

Confidential Autonomic Control Software”]


89

Abstract: A Practical and Secure Remote User Authentication

Scheme Using Smart Cards

Jin Qiuyan, Kwangwoo Lee, and Dongho Won* 1Information Security Group, Sungkyunkwan University,

300 Cheoncheon-dong, Jangan-gu, Suwon, Gyeonggi-do 440-746, Korea

{qyjin,kwlee,dhwon}@security.re.kr


Abstract

Recently, remote user authentication scheme is widely accepted since it is one of the

most convenient ways to authenticate the communication parties who transmit

messages through an insecure channel. During the last couples of decades, there are a

lot of approaches to remote user authentication. Although many remote user

authentication schemes are proposed, most of them are insecure against various

attacks. In 2009, Kim and Chung proposed a secure remote user authentication

scheme which is an improvement of Yoon and Yoo’s scheme. They claimed that their

scheme can prevent masquerading attack and can resist some other malicious attacks.

However, we found that Kim and Chung’s scheme is insecure against off-line

password guessing attack. To solve these problems, we proposed a more secure and

practical remote user authentication scheme which keeps the merits of Kim-Chung’s

scheme and resolves all of the aforementioned security flaws.

Acknowledgements


Korea, under the ITRC (Information Technology Research Center) support program

supervised by the NIPA (National IT Industry Promotion Agency)" (NIPA-2012-

C1090-1101-0004).


90

Abstract: Misconfiguration Analysis and Design Guidelines for

Routing Policy Configuration Management

1Sihyung Lee and

2Hyong S. Kim

1Seoul Women’s University, South Korea

2Carnegie Mellon University, Pittsburgh, PA


Abstract

Routing policy configurations are one of the crucial elements of network

configurations since they deal with a network’s connectivity, quality of service, and

security. However, the languages and user interfaces used to configure routing

policies are not well suited to network operators’ needs. This often leads to

configuration errors and lengthens the time taken to resolve problems. To better

understand causes of this problem, we analyze 354 configuration errors that we

collected in four production networks over an eight-month period. We also learn from

network operators, who provide feedback about features that cause mistakes and

delays. We observe two major problems in current routing-policy configuration

management: (i) the large number of obsolete and irrelevant configurations and (ii)

insufficient support for reuse of common configuration segments. Based on this

observation, we propose a set of guidelines for creating more usable configuration

management.

Acknowledgements

This work was supported by a special research grant from Seoul Women’s University

(2012).


91

Abstract: Detection of Inside and Outside Attacks in Sensor Networks

combining SEF and LEAP

Su Man Nam and Tae Ho Cho*

Sungkyunkwan University, College of Information and Communication Engineering,

Sungkyunkwan University, Suwon 440-746, Republic of Korea

+82-31-290-7221

[email protected], *[email protected]

Abstract

Sensor nodes are deployed in an open environment, thus compromised and

susceptible to malicious attackers. A false report injection attack of the inside attacks

drains the energy resource of each node through the compromised node, and a

sinkhole of the outside attacks destroys constructed routing paths of each node

through an adversary node. To detect these attacks, the statistical en-route filtering

method (SEF) and the localized encryption and authentication protocol (LEAP) are

proposed respectively. This paper proposes a method to effectively detect these

attacks in a sensor node based on these methods when these attacks occur

simultaneously. We improve energy savings of each node through four keys of our

proposed method while maintaining the strong security level in the sensor network.

We have evaluated the effectiveness of the proposed method as compared to the

application scheme of SEF and LEAP. The experiment results reveal that the

proposed method decreases a quantity of transmissions up to 9% while maintaining

the detection power.

Acknowledgements





92

Abstract: EBCHS: An Energy Balanced Cluster-Heads Selection

Method for Wireless Sensor Networks

Choon-Sung Nam, Young-Shin Han and Dong-Ryeol Shin*

School of Information and Communication, Sungkyunkwan University, Suwon, Korea

{namgun99, hanys, drshin*} @ skku.edu

Abstract

A wireless sensor network (WSN) is a self-organizing network in which sensor nodes

with limited resource are scattered in an area of interest to gather information. Many

researchers have studied methods to reduce the energy consumption of sensor nodes

with limited resource. Clustering is a typical technique to reduce the energy consumed

by nodes and prevent duplication of data by the sensor nodes. Generally, cluster heads

are selected by rotation to distribute energy consumption. However, the elected

cluster head cannot be elected again, until the round ends, although it may have more

energy remaining than do other nodes. Thus, there are energy gap between sensor

nodes. Thus, any node should be able to be a cluster head, although nodes were

selected as a cluster head before the round ends. This paper finds an energy-balanced

cluster-heads selection method and distributes the energy consumption of sensor

nodes.


93

Abstract: Genetic Algorithm Based Secure Data Transmission for

Wireless Sensor Networks

Jin Myoung Kim, In-Geol Chun, Won-Tae Kim

CPS Research Team, Embedded SW Research Division,

SW-SoC Convergence Lab, ETRI

{jm.kim, igchun, wtkim}@etri.re.kr

Abstract

In applications of wireless sensor networks, it is important how to efficiently and

securely get the sensed data from the territory where is the existence of radio-

jamming zone and security issue. To solve this problem we propose a genetic

algorithm (GA) based secure data transmission method for reliable transmission while

considering the balanced energy depletion of the sensor nodes. For ensuring security,

we also propose a key distribution scheme. In the proposal, GA finds an efficient

routing pathby considering the radio-jamming zone,transmission distance, average

remaining energy and hop count. BS then distributes the key with consideration of the

path to encrypt sensing data. In simulation, our proposed method is compared with

LEACH and Hierarchical PEGASIS. The simulation results show that the proposed

method is efficient in both the energy consumption and success ratio of delivery.

Acknowledgements

This work was supported by the IT R&D Program of MKE/KEIT [10035708, "The

Development of CPS (Cyber-Physical Systems) Core Technologies for High

Confidential Autonomic Control Software"]


94

Abstract: Malicious Node Detection in Mobile Sensor Networks Using

Sequential Analysis

Jun-Won Ho

Department of Information Security, Seoul Women’s University

621 Hwarangro, Nowon-Gu, Seoul, South Korea

[email protected]

Abstract

In ad hoc and sensor networks, reputation-based trust management schemes have been

widely used to identify the malicious nodes. These schemes leverage each node’s

behaviors for malicious node detection and thus require a certain amount of time to

observe the behaviors of nodes. In mobile sensor networks, however, malicious sensor

nodes frequently move to different locations and thus it is likely difficult to collect

enough evidence for mobile malicious nodes. Moreover, when reputation-based

schemes are employed, it is not easy to revoke the malicious nodes due to the risk of

false positives. To mitigate these limitations of reputation-based schemes, we propose

a sequential analysis aided software attestation scheme for malicious node detection

in mobile sensor networks. In our scheme, by leveraging the intuition that mobile

malicious nodes highly likely encounter as many mobile benign nodes as possible in

order to maximize their influence, we adapt sequential analysis to perform software

attestations more frequently against highly mobile nodes than lowly mobile nodes and

thus quickly detect mobile malicious nodes.

Acknowledgements

This work was supported by a research grant from Seoul Women’s University (2011).


95

Abstract: Large Vocabulary Continuous Speech Recognition

Combining with Likelihood-based Features based on

Segmental Conditional Random Fields

Hwa Jeon Song, Hoon Chung, Euisok Chung, Byong-Ok Kang,

Hyungbae Jeon, Yunkeun Lee, and Ho-Young Jung*

Spoken Language Processing Team, ETRI, Daejeon, Korea

*[email protected]

Abstract

In decoding results over input utterances, although a recognition rate is increased

according to the size N in N-best results, some confusion is happened due to similar

likelihood values among the hypothesized word sequences. If the discriminative

information among words in specific speech region but not whole utterance can be

added, this operation can change the word ranks. However, a processing unit in most

of automatic speech recognizer (ASR) is a frame but not a segment, while

discriminative information for ASR is included in a segment, such as phone and word,

but not a frame. That is, a useful information extraction from segments with various

durations is important to improve the system performance. Actually, we can extract

useful multi-scale information in speech, such as phone and word lattices, from

various event detectors. However, it is very difficult that this multi-scale information

is jointly modeled in traditional ASR based on a frame synchronous processing. This

means the need of Markov assumption modeling of a segment level and classifier

combining of various segment scales of observations. Thus, this paper adopts the

segmental conditional random field (SCRF) framework and proposes new likelihood-

based external features for the large vocabulary continuous speech recognition.

Evaluation in a mobile voice search domain shows that the proposed features provide

some improvements over the conventional SCRF.

Acknowledgements

This work was supported by the Industrial Strategic technology development program,


mobile platform funded by the Ministry of Knowledge Economy (MKE), Korea.


96

Abstract: A Packet Loss Concealment Algorithm Based

on Artificial Bandwidth Extension for Scalable

Wideband Speech and Audio Coding

Nam In Park, Jin Ah Kang, and Hong Kook Kim*

School of Information and Communications, Gwangju Institute of Science and

Technology, 1 Oryong-dong, Buk-gu, Gwangju 500-712, Korea

*[email protected]

Abstract

In this paper, we propose an artificial bandwidth extension (ABE)-based packet loss

concealment (PLC) algorithm in order to improve the quality of decoded speech when

packet losses occur in a scalable wideband speech coder. The proposed PLC

algorithm is composed of three main functions such as packet loss concealment in the

narrowband, ABE from narrowband to wideband, and smoothing of wideband using

the previous good frames. In order to demonstrate the effectiveness of the proposed

PLC algorithm, it is replaced with the existing PLC algorithm employed in ITU-T

Recommendation G.729.1. Subsequently, a performance comparison is carried out

between the proposed and the existing PLC algorithms in terms of log spectral

distortion (LSD), waveform comparison, and an A-B preference test under different

random and burst packet loss conditions. It is shown from the comparison that the

proposed PLC algorithm provides significantly better speech quality than the

conventional PLC of the ITU-T G.729.1.

Acknowledgements

This work was supported in part by the Practical R&D Program of the GIST

Technology Initiative (GTI), Gwangju Institute of Science and Technology, Korea.


97

Abstract: Hierarchical Multiple Endpoint Detection for Speech

Recognition in Mobile Environments

Kiyoung Park* and Yunkeun Lee

Spoken Language Processing Team, Electronics and Telecommunications Research

Institute, 218 Gajeong-ro, Yuseong-gu, Daejeon, 305-700, Korea

{pkyoung,yklee}@etri.re.kr

Abstract

The endpoint detection is the very beginning part of most speech-enabled systems and

has crucial effect to the overall system performances. Despite of extensive researches

on this area, the robust detection of speech signals in noisy environments is still

challenging especially in the mobile applications because the environments in use are

very diverse. To enhance the robustness of detection in diverse conditions, a robust

endpoint detection algorithm using a hierarchical structure is proposed. In the

proposed algorithm, multiple detectors work independently with the different

priorities and the results are integrated effectively. The proposed algorithm is

evaluated in two respects; in the detection accuracy and in the recognition rates. The

detection accuracy is measured by comparing the detected endpoints with the

reference points which manually labeled. The speech recognition experiments are also

performed with the large vocabulary speech recognition system. In both

experiments the proposed algorithm works effectively in diverse conditions and

shows the superior performance to the individual detectors.

Acknowledgements

This work was supported by the Industrial Strategic technology development program,


mobile platform funded by the Ministry of Knowledge Economy (MKE, Korea).


98

Abstract: MDCT-Domain Noise Reduction with Block Switching for

the Application to MPEG Audio Coding

Kwang Myung Jeon1, Nam In Park

1, Hong Kook Kim

1,*, Myung Kyu Choi2, Lighton

Cephas Hwang2, and Sang Ryong Kim

2

1 School of Information and Communications, Gwangju Institute of Science and

Technology, 1 Oryong-dong, Buk-gu, Gwangju 500-712, Korea 2Digital Imaging Business, Samsung Electronics, Gyeonggi-do 443-742, Korea

*Corresponding Author: [email protected]

Abstract

In this paper, a noise reduction method in the modified discrete cosine transform

(MDCT) domain is proposed for the application to MPEG advanced audio coding

(AAC). By compatibly sharing the block switching process and the perceptual sub-

band definition embedded in MPEG AAC, the proposed method can be efficiently

realized with very low computational complexity. In particular, noise reduction for a

long block is achieved by multi-band spectral subtraction (MBSS) with perceptually

weighted scale-factor bands. Then, over-subtraction with masking is applied to reduce

musical noise. Noise reduction for a short block is performed by sub-band power

scaling in order to maintain power coherency with the previous denoised long block.

It is shown from performance evaluation that the denoising performance of the

proposed method is comparable to that of a commercially available noise reduction

method, and its complexity is sufficiently low to be implemented in real-time on most

resource-constrained audio recording devices.


99

Abstract: Speech Enhancement Based on Blind Signal Cancellation in

the Presence of Diffuse Background Noise

Jaesik Hwang and Hyung-Min Park*

Department of Electronic Engineering, Sogang University, Seoul 121-742,

Republic of Korea

{diziso, hpark}@sogang.ac.kr

Abstract

This paper describes a speech enhancement method using two microphone signals in

the presence of diffuse background noise. Assuming there was a dominant point

source corresponding to target speech, frequency-domain (FD) blind signal extraction

(BSE) followed by the projection back (PB) method enhanced the target speech.

However, the method assumed perfect extraction of the clean target speech even

though diffuse noise could not be sufficiently canceled by combination of the

observations. Instead of direct extraction of the target speech, we estimate noise signal

by FD blind signal cancellation (BSC) based on sparsity minimization to form a null

to the direction of a target source, and the negative value of the estimated parameter is

also used to obtain a beamforming output. Then, both output signals are exploited to

enhance target speech by Wiener filtering with a gain derived under the assumption

that two microphone signals are corrupted by diffuse noise. Experimental results show

that the parameters estimated by the FD-BSC are more accurate than those estimated

by the FD-BSE and the proposed method delivers better enhancement performance

than the FD-BSE followed by the PB method.

Acknowledgements

This research was supported by the Converging Research Center Program funded by

the Ministry of Education, Science and Technology (No. 2011K000659).


100

Abstract: Extension of DUET for Blind Separation of Speech Signals

in Reverberant Environments

Tae-Jun Lee, Minook Kim, and Hyung-Min Park*

Department of Electronic Engineering, Sogang University, Seoul, 171-742,

Republic of Korea

{taejun28, min8328, hpark}@sogang.ac.kr

Abstract

A method for blind separation of speech signals based on degenerate unmixing and

estimation technique (DUET) in reverberant environments is described. Because the

conventional DUET estimates only a pair of relative attenuation and time-delay

parameters over all frequencies for a source by assuming delayed mixing, it may not

successfully separate reverberant mixtures when these parameters vary with

frequency. In this paper, we propose a method for separating reverberant mixtures by

estimating frequency-dependent parameters for each source. In order to estimate

accurate parameters, we employ the Linde-Buzo-Gray (LBG) algorithm to initialize

the parameters with limited data at each frequency bin, and we derive online update

algorithms of the parameters for convolutive mixtures. In addition, the permutation

problem is involved because the estimation is performed separately in each frequency

bin, so we also introduce a permutation alignment method based on correlations of

spectral envelopes. Experimental results verify the effectiveness of the proposed

method in reverberant environments.

Acknowledgements


National Research Foundation of Korea (NRF) funded by the Ministry of Education,

Science and Technology of Korea (No. 2010-0025703).


101

Abstract: Cancellation of Nonlinear Acoustic Interference in Dual

Smartphone Scenarios

for Robust Speech Recognition

Jeong-Sik PARK1, Gil-Jin JANG

*2, Ji-Hwan KIM

3, and Sang-Hoon KIM

4

1Mokwon University, Daejeon, South Korea

2Ulsan National Institute of Science and Technology (UNIST), Ulsan, South Korea

3Sogang University, Seoul 121-742, South Korea

4Electronics and Telecommunications Research Institute, Daejeon, South Korea


Abstract

This paper presents a method for canceling interfering sounds in a target signal with

an incomplete and nonlinearly corrupted reference signal. One of the applicable

environments is that a smartphone is performing voice recognition under very loud,

background interference, and another smartphone is providing a reference signal for

the interference. Because the relationship between the interfering source and the

reference is not always linear due to the distortion caused by transmission and digital

audio coding, neither conventional adaptive noise cancellation (ANC), nor blind

signal separation (BSS) techniques can handle the given problem. We propose a

channel equalization method on the nonlinear distortion based on maximizing the

instantaneous correlation between the two channels, and an iterative interference

activity detection algorithm that provides optimal estimation of the equalization filter

coefficients. The reference signal from the secondary device is equalized to the

interference in the primary device, which is then suppressed by the computed Wiener

filters. Our experimental results show good interference suppression performance as

evidenced by improved voice recognition rates in a simulated airport scenario.

Acknowledgements


National Research Foundation of Korea (NRF) funded by the Ministry of Education,

Science and Technology (no. 2010-0025642 and no. 2011-0005419), and by the

Ministry of Knowledge Economy, Korea (2008-S-019-02, Development of Portable

Korean-English Automatic Speech Translation Technology).


102

Abstract: Monaural Speech Segregation Based on Pitch Track

Correction Using Particle Filtering

Han-Gyu KIM1, Gil-Jin JANG

*2, Jeong-Sik PARK

3, Yung-Hwan OH

1

1Korea Advanced Institute of Science and Technology (KAIST), Daejeon, South Korea

2Ulsan National Institute of Science and Technology (UNIST), Ulsan, South Korea

3Mokwon University, Daejeon, South Korea


Abstract

We propose a novel method to improve the performance of monaural speech

segregation. Our method is based on pitch track correction using particle filtering. The

conventional approach for pitch track correction simply uses the peaks of the

autocorrelation functions, depending only on the longest reliable pitch streak. To

enhance the conventional approach, we consider all reliable pitch streaks rather than

only the longest one and correct unreliable pitch using a particle filter. To apply the

particle filtering technique for pitch track correction, an importance weight

computation method using foreground stream is proposed. To verify the efficiency of

the proposed method, a number of speech segregation experiments for mixtures of

speech and various competing sound sources in various mixing signal-to-noise ratios

(SNRs) were carried out. With respect to several performance measures including

SNR, energy loss ratio, and noise residue ratio of the segregated speech, the proposed

method exhibits better performance than the conventional approach.

Acknowledgements

This work was supported by Basic Science Research Program through the National


and Technology (no. 2010-0025642).


103

Abstract: Fast Language Model Adaptation Using MDI

Donghyun Lee1, Kyunghee Lee

1, Kwang-Ho Kim

1, Ji-Hwan Kim

1,*, Hyungbae Jeon

2,

Yunkeun Lee2

1Sogang University, Seoul, Korea (R.O.K)

{redizard, ekyunghee, kimkwangho, kimjihwan}@sogang.ac.kr 2Electronics and Telecommunications Reseach Institute, Daejon, Korea (R.O.K)

{hbjeon, yklee}@etri.re.kr


Abstract

The work in this paper focused on fast language model adaptation using Minimum

Discrimination Information (MDI) method for a small size domain corpus, which

consists of sentences from 30 seconds to 120 seconds in length. We devise a

Language Model (LM) adaptation method based on MDI. We view a background LM

as a discrete distribution and build an adapted LM to be close as possible to the

background LM, satisfying unigram constraints empirically derived from the

adaptation corpus.

Acknowledgements

This work was supported by the industrial strategic technology development program,


mobile platform funded by the Ministry of Knowledge Economy (MKE, Korea).


104

Abstract: Analysis of Desynchronization in Music Identification

Namhyun Cho1, Donghoon Shin

1, Kwang-Ho Kim

1,

Jeong-Sik Park2, Gil-Jin Jang

3, Ji-Hwan Kim

1†,

1Sogang University, Seoul, Korea

{cnh2769, donghoon84, kimkwangho, kimjihwan}@sogang.ac.kr 2Mokwon University, Daejeon, Korea

{parkjs}@mokwon.ac.kr 3Ulsan National Institute of Science and Technology (UNIST), Ulsan, Korea

{gjang}@unist.ac.kr

Abstract

Music Identification System (MIS) produces an identification result by comparing

audio fingerprints generated from input signal with those generated from original

music. We present an empirical desynchronization analysis of audio hashing in MIS.

Desynchronization distort position of peak point which can lead wrong recognition

result. In worst case, peak point hit ratio between input signal and original music

plunges 40.8%.

Acknowledgements

This work was supported by the National Research Foundation of Korea (NRF) grant

funded by the Korea Government (MEST) (2011-0027537).


105

Abstract: Low Bit-Rate Super-Wideband Speech and Audio Coding

based on Sinusoidal Coding and Spectral Band Replication

Kosangrok Oh, Dong Hoon Sung, Seung Ho Choi*

Dept. of Electronic and IT Media Engineering

Seoul National University of Science and Technology

Seoul 139-743, Korea


Abstract

In this work, we propose novel low bit-rate super-wideband speech and audio coding

techniques that are based on low bit-rate sinusoidal coding and correlation-based

spectral band replication (SBR). The sinusoidal coding technique utilizes the local

rms energy of modified discrete cosine transform (MDCT) coefficients in selecting

peak MDCTs and the SBR is based on the pseudo-spectral correlation between low

band and high band. From the objective and subjective evaluation, the proposed

techniques are shown experimentally to give improved performance compared to

ITU-T G.718 Annex B.

Acknowledgements

This work was supported in part by Electronics and Telecommunications Research

Institute (ETRI) and in part by Seoul National University of Science and Technology.


106

Abstract: Howling Detection based on Statistical Analysis of

Temporal Power Spectra

Jae-Won Lee1 and Seung Ho Choi

2,*

1Graduate School of NID Fusion Technology

Seoul National University of Science and Technology, Seoul, Korea 2Department of Electronic and IT Media Engineering

Seoul National University of Science and Technology, Seoul, Korea


Abstract

Howling is generated due to acoustic feedback circuit and is difficult to predict since it varies

depending on the indoor environment. Furthermore, it is hard to distinguish between original

and howling signals in real-time. In this paper, we propose a novel howling detection method

based on statistical analysis of temporal power spectra. The proposed method is shown

experimentally to be suitable for howling detection.

Acknowledgements

This work was supported by Seoul National University of Science and Technology.


107

Abstract: RF Impairment Compensation Technique for Millimeter-

Wave Broadband Multimedia Communication Systems

Hyung Chul Park

Department of Electronic and Information Engineering,

Seoul National University of Science and Technology,

Gongneung 2-dong, Nowon-gu, Seoul, 139-743, Korea

[email protected]

Abstract

This paper presents a novel RF impairment compensation technique for improving

image-rejection performance in millimeter-wave broadband multimedia

communication systems. The proposed method compensates for the impairment of

multi-port junction-based direct receivers (MPDRs), which is suitable for broadband

multimedia service in the millimeter-wave band. This paper, first, theoretically

analyzes the relationship between impairment and I/Q imbalance. Then, based on the

analysis, this paper evaluates the accuracy of impairment compensation, i.e., I/Q

regeneration, for MPDRs in terms of the image-rejection ratio (IRR). An iterative

single-frequency continuous-wave signal-based I/Q regeneration method is proposed

to improve the IRR performance of MPDRs. Using the proposed method, the IRR

performance of MPDRs becomes better than or equal to that of conventional receivers

using I/Q imbalance compensation methods. Simulation results show that MPDRs

using the proposed method can achieve an IRR of more than 70 dB, and that the bit

error rate performances are almost the same as those of conventional coherent

demodulators, even in fading channels.

Acknowledgements

This work was supported by Seoul National University of Science and Technology.


108

Abstract: Advanced Congestion Adaptive Routing Mechanism

Geetam Singh Tomar

Machine Intelligence Research Labs, New Jiwaji Nagar, Gwalior 474011 India

[email protected]

Abstract

As the services have increased many fold with variety of data types pumped into

network, which included multimedia and fast changing conditions. The problem of

congestion has also increased and posing the threat to Network performance and

degradation of throughput due to change in topology and drawbacks in routing

algorithms. In this paper, two a new routing protocol Advanced Optimized Link State

Routing (A-OLSR) has been proposed and performance has been evaluated on the

basis of existing protocols. In this protocol the modifications have been done in OLSR

protocol in terms of pause time, speed, CBR connections, which have been done by

modifying frame format and simulation concepts. The performance of OLSR & A-

OLSR have been analyzed using varying Pause time, Speed, CBR Connections & also

by varying number of nodes to provide the qualitative assessment of the applicability

of protocols in different scenarios. The simulations are carried out using the Qualnet

4.5 simulation tool, which is used to run ad hoc simulations. The performance of

network by using this protocol has enhanced if compared with existing protocols of

the same nature. The concept of the protocol is has been put for validation in various

mobility and constrained conditions.


109

Abstract: Enhancement of Security in MAODV using SHA-512

Gulshan Kumar1, Mritunjay Rai

1, Tae-sik Kim

2

1Department of Computer Science and Engineering,

Lovely Professional University, Punjab, India

[email protected], [email protected] 2 International University of Korea, Gyeongnam, South Korea

Corresponding Author, [email protected]

Abstract

A Mobile Ad-hoc Networks (MANET) is refer to as a collection of autonomous

devices that are equipped with the wireless communication and networking

capabilities such that Ad-hoc network are infrastructure less, self-organizing and use

decentralized approach. There are various sort of attacks that are noticed in MANET

thus analyzing the various attacks a secured mechanism is built on MAODV

(Multicast Ad-hoc On-Demand Distance Vector Routing Protocol) to ensure Integrity

by Implementing SHA-512 algorithm. Also we analyze the Performance by using NS-

2 to simulate the proposed idea.


110

Abstract: Adaptive Learning in Agents Behavior:

A Framework for Electricity Markets Simulation

Tiago Pinto, Zita Vale, Tiago M. Sousa

GECAD – Knowledge Engineering and Decision-Support Research Center

Institute of Engineering – Polytechnic of Porto (ISEP/IPP)

{tmp, zav, tmsbs}@isep.ipp.pt

Abstract

Electricity markets are complex environments, involving a large number of different

entities, playing in a dynamic scene to obtain the best advantages and profits. MASCEM

(Multi-Agent System for Competitive Electricity Markets) is a multi-agent electricity

market simulator to model market players and simulate their operation in the market.

Market players are entities with specific characteristics and objectives, making their

decisions and interacting with other players. This paper presents ALBidS (Adaptive

Learning strategic Bidding System) – a multiagent system that provides decision support

to MASCEM’s negotiating agents so that they can properly achieve their goals. ALBidS

uses artificial intelligence methodologies and data analysis algorithms to provide

effective adaptive learning capabilities to such negotiating entities. Several distinct

strategies to build actions proposals are concerned, so that the best can be chosen at each

time, depending on the context and simulation circumstances. The choosing process

includes reinforcement learning algorithms, a mechanism for negotiating contexts

analysis, a mechanism for the management of the efficiency/effectiveness balance of the

system, and a mechanism for competitor players’ profiles definition.

Acknowledgement

This work is supported by FEDER Funds through the “Programa Operacional Factores de

Competitividade - COMPETE” program and by National Funds through FCT “Fundação

para a Ciência e a Tecnologia” under the project: FCOMP-01-0124-FEDER-PEst-

OE/EEI/UI0760/2011


111

Abstract: Secure Auto-Configuration Protocols in Mobile Ad Hoc

Networks Ana Lucila Sandoval Orozco

1, Julián García Matesanz

2, Luis Javier García Villalba

1,*, José Duván

Márquez Díaz3 and Tai-hoon Kim

5

1 Grupo de Análisis, Seguridad y Sistemas (GASS)

Departamento de Ingeniería del Software e Inteligencia Artificial (DISIA)

Facultad de Informática, Despacho 431, Universidad Complutense de Madrid (UCM)

Calle Profesor José García Santesmases s/n, Ciudad Universitaria, 28040 Madrid, Spain

E-mail: {asandoval, javiergv}@fdi.ucm.es 2 Grupo de Análisis, Seguridad y Sistemas (GASS)

Sección Departamental de Sistemas Informáticos y Computación

- Lenguajes y Sistemas Informáticos y Ciencias de la Computación e Inteligencia Artificial -

Facultad de Ciencias Matemáticas, Despacho 310-F, Universidad Complutense de Madrid (UCM)

Plaza de Ciencias, 3, Ciudad Universitaria, 28040 Madrid, Spain

E-mail: [email protected] 3 Grupo de Redes de Computadores e Ingeniería de Software (GRECIS)

Departamento de Ingeniería de Sistemas, Universidad del Norte

Km. 5 Autopista a Puerto Colombia, Barranquilla, Colombia

E‐mail: [email protected] 5 Department of Information Technology, Global Vision School Australia (GVSA)

20 Virgina Court, Sandy Bay, Tasmania, Australia

E‐mail: [email protected]

Abstract

Ad hoc networks are built on the basis of a communication without infrastructure and major

investigations have focused on the routing problems and auto-configuration. However, there is little

progress in solving the secure auto-configuration problems in mobile ad hoc networks (MANETs),

which has led to the proliferation of threats given the vulnerabilities of MANETs. It is clear that ad

hoc networks have no centralized mechanism for defense against threats, such as a firewall, an

intrusion detection system or a proxy. Therefore, it is necessary that the defense of interests of each

of the ad hoc components is the responsibility of each member node. This paper shows the most

common threats to ad hoc networks and reviews several proposals that attempt to minimize some of

these threats, showing their protection ability and vulnerabilities in light of the threats that might

arise.

Acknowledgement

This work was supported by the Ministerio de Industria, Turismo y Comercio (MITyC, Spain)

through the Projects Avanza Competitividad I+D+I TSI-020100-2011-165 and TSI‐020100‐2010‐

482 and the Ministerio de Ciencia e Innovación (MICINN, Spain) through the Project TEC2010‐

18894/TCM. This work was also supported by the Departamento Administrativo de Ciencia,

Tecnología e Innovación (COLCIENCIAS, Colombia) through Programa de Recuperación

Contingente which funds the Project 121545221101. This work was also supported by the Security

Engineering Research Center, granted by the Ministry of Knowledge Economy (MKE, Korea).


Abstract: Application of Mobile Technology in Virtual Communities with

Information of Conflict-Affected Areas

Julio César Rodríguez Ribón1, Luis Javier García Villalba

2 and Tai-hoon Kim

3,4,*

1 Programa de Ingeniería de Sistemas, Facultad de Ingenierías, Universidad de Cartagena

Campus de Ciencias Económicas e Ingeniería (Sede Piedra de Bolívar), Cartagena de Indias,

Colombia

E-mail: [email protected] 2 Grupo de Análisis, Seguridad y Sistemas (GASS)

Departamento de Ingeniería del Software e Inteligencia Artificial (DISIA)

Facultad de Informática, Despacho 431, Universidad Complutense de Madrid (UCM)

Calle Profesor José García Santesmases s/n, Ciudad Universitaria, 28040 Madrid, Spain

E-mail: [email protected] 3Department of Multimedia Engineering, Hannam University

133 Ojeong-dong, Daedeok-gu, Daejeon, Korea

E-mail: [email protected] 4

Department of Information Technology, Global Vision School Australia (GVSA)

20 Virgina Court, Sandy Bay, Tasmania, Australia

E-mail: [email protected]

Abstract Virtual communities are groups or organizations that have common interests and objectives and

develop strategies to reach those goals. There is a range of organizations which have expertise that

have been documented over the years, related to conflict areas (Universities, NGOs, governments,

etc.). Many of these organizations have put their expertise in digital media that can be accessed by its

members through technology platforms, many of them online. The collection process is expensive and

their expertise is largely difficult to access because of the nature of conflict in the territories. Also in

many cases there is no information related to these areas or no information is known about them; is

also true that organizations that have such information do not possess adequate technological tools to

share with others. The information in conflict areas is useful for decision making, to generate public

policies for the control and humanitarian support, and diversity of solutions that can be offered to the

victims of conflicts. Organizations are willing to cooperate and share their expertise with others, but

there is a technological problem that is making the above impossible and therefore causing isolation.

This is caused by the inability of the technology platforms that each organization has, to locate and

interoperate with expertise from other platforms. There is also a problem for community members

regarding the location and access to territorial information they share. This paper describes an

experience in which mobile technologies are used as sensing devices to identify positioning and

movement of people who are in conflict areas and to capture multimedia information in such territory.

These sensing devices allow access to a portfolio of services from a cooperating cloud of territorial

information in the region of Montes de Maria (Colombia), which is a territory with social, political and

public order conflicts. With this experience, a solution to the problem of technological isolation is

offered and access to the expertise shared by peers in the community.

Acknowledgment

This work was supported by the Ministerio de Industria, Turismo y Comercio (MITyC, Spain) through

the Project Avanza Competitividad I+D+I TSI‐020100‐2011‐165.

This work was also supported by the Security Engineering Research Center, granted by the Ministry of

Knowledge Economy (MKE, Korea).

Thanks to Diana Marcela for providing language help and Jorge Perea for providing simulation help.


112

Abstract: Dynamic Service-Driven Credential Management for Grid

Computing

Jemal H. Abawajy1 and Taihoon Kim

2

1School of Information Technology, Deakin University, Waurn Ponds, VIC., 3217,

Australia. 2Department of Information Technology, Global Vision School Australia,

Abstract

The ideal vision of Grid computing is to enable transparent sharing of computational

resources and services across multiple independent organizational boundaries. Each Grid

may have its own unique way to authorize and authentic users in order to control access

to their resources. Therefore, the dynamic and cross-organizational aspects of Grids

introduce challenging management and policy issues for controlling access to Grid

resources. In this paper, we propose an architecture of a scalable, secure and reliable on-

line credential management service that provides multiple Grid computing users with

secure mechanism for storing one or multiple credentials and access them based on need

at anytime from anywhere. Moreover, it provides an online credential exchange service.

In addition, users can Audit the credential usage.


114

Abstract: A Real-time Detection of Moving Object Inspired from

Frog's Visual Characteristic

Zhi-yong Li1, Zhen Jiang

1, Jun-min Liu

1, Chao Chen

1

1 College of Information Science and Engineering,

Hunan University, Changsha, China.

[email protected],{245736419, 326860194}@qq.com

Abstract

In this paper, we propose a method to detect moving object in surveillance video

using edge extraction and spatio-temporal entropy based on the visual features of frog

eyes. The algorithm is divided into three steps: first, filtering out the noise and some

unnecessary information in the image sequence; second, detecting the edge point of

the smoothed image obtained in first step by Canny's operator; At last, calculating the

spatio-temporal entropy of the detected edge point and compare it in adjacent frames.

If the difference exceeds a certain intensity, then the edge point will be considered as

a part of moving object. Experimental results show the proposed method can

effectively detect the edge of moving object and has low computational complexity.

Acknowledgment

The authors would like to thank the National Natural Science Foundation of China

(Grant No. 61173107), Natural Science Foundation of Hunan Province, China (Grant

No. 10JJ5068) and the Science and Technology Plan of Changsha, Hunan Province,

China (Grant No. K1109099-11) for their supports.


115

Abstract: Interaural Time Difference Estimation for Binaural Speech

Separation in Reverberant Multi-Source Environments

Ji Hun Park and Hong Kook Kim*

School of Information and Communications,

Gwangju Institute of Science and Technology

1 Oryong-dong, Buk-gu, Gwangju 500-712, Korea

Abstract

In this paper, a robust interaural time difference (ITD) estimation method is proposed for

separating a target speech signal in reverberant multi-source environments. In the pro-

posed method, signal separation is achieved by comparing the estimated ITD with the

ITD corresponding to the location of the target speech signal. To this end, the auditory

signals are first represented in the time-frequency (T-F) domain, and each T-F segment is

de-trended to reduce the effects of reverberation. The ITD for each T-F segment is then

estimated using a generalized cross-correlation (GCC) with a maximum likelihood (ML)

weighting function. In particular, the ML weighting function is designed to further reduce

the reverberation effect. It is demonstrated here that the proposed ITD estimation method

outperforms the conventional cross-correlation-based ITD estimation method under re-

verberant conditions in terms of the signal-to-noise ratio (SNR) and signal-to-distortion

ratio (SDR) of separated speech signals.

Acknowledgement

This work was supported in part by the Basic Science Research Program through the Na-

tional Research Foundation of Korea (NRF) funded by the Ministry of Education, Science

and Tech-nology (No. 2011-0026201), and by the basic research project through a grant

provided by GIST in 2012.


116

Abstract: The importance of considering costs in inductive learning

Alberto Freitas1,2,*

, Pavel Brazdil3, Altamiro da Costa-Pereira

1,2

1Department of Health Information and Decision Sciences, Faculty of Medicine,

University of Porto, Portugal 2CINTESIS - Center for Research in Health Technologies and Information Systems,

Portugal 3LIAAD-INESC Porto L.A., Faculty of Economics, University of Porto, Portugal


Abstract

Cost-sensitive learning aims to minimize costs while maximizing the accuracy of the

learner. In this paper we present algorithms that are sensitive to various types of costs.

We review recent strategies for cost-sensitive learning in medicine focusing not only on

the main costs, namely attribute costs and misclassification costs, but also on other, often

not considered, costs. We discuss the benefits of these cost-sensitive approaches to learn

cost-sensitive models. Cost-effective solutions, with substantial savings, can be achieved

if different types of costs are considered in learning tasks.


117

Abstract: Quality in hospital administrative databases

Alberto Freitas1, 2, *, Juliano Gaspar1, 2, Nuno Rocha1, 2, Goreti Marreiros3, Altamiro da Costa-

Pereira1, 2

1 Department of Health Information and Decision Sciences, Faculty of Medicine, University of

Porto, Portugal 2 CINTESIS - Center for Research in Health Technologies and Information Systems, Portugal

3 GECAD – Knowledge Engineering and Decision Support Group, Institute of Engineering –

Polytechnic of Porto, Portugal

{alberto, jgaspar, nunorocha}@med.up.pt, [email protected], [email protected]

Abstract

The clinical content of administrative databases includes, among others, patient demographic

characteristics, codes for diagnoses and procedures. The data in these databases is standardized,

clearly defined, readily available, less expensive than collected by other means, and normally

covers hospitalizations in entire geographic areas. Although with some limitations, this data is

often used to evaluate the quality of healthcare. Under these circumstances, the quality of the data,

for instance, errors, or it completeness, is of central importance and should never be ignored.

Both the minimization of data quality problems and a deep knowledge about this data (e.g., how

to select a patient group) are important for users to trust and to correctly interpret results. In this

paper we present, discuss and give some recommendations for some problems found in these

administrative databases. We also present a simple tool that can be used to screen the quality of

data through the use of domain specific data quality indicators. These indicators can significantly

contribute to better data, to give steps towards a continuous increase of data quality and, certainly,

to better informed decision-making.

Acknowledgement

The authors wish to thank ACSS, for providing access to the data, and the support given by the

research project HR-QoD – Quality of data (outliers, inconsistencies and errors) in hospital

inpatient databases: methods and implications for data modeling, cleansing and analysis (project

PTDC/SAU – ESA /75660/ 2006). This work is partially supported by FEDER Funds through the

“Programa Operacional Factores de Competitividade - COMPETE” program and by National

Funds through FCT “Fundação para a Ciência e a Tecnologia” under the project: FCOMP-01-

0124-FEDER-PEst-OE/EEI/UI0760/2011.

foreword - drodro.deakin.edu.au/eserv/du:30049292/abawejy-advancedsignal-2012.pdf · braking...

Documents