15.07.2014 Views

Conference Program of WCICA 2012

Conference Program of WCICA 2012

Conference Program of WCICA 2012

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

<strong>Conference</strong> <strong>Program</strong> <strong>WCICA</strong> <strong>2012</strong><br />

through the video frames. After that the step is the selection <strong>of</strong> the 20<br />

optimal key facial points, those which change the most with changes in<br />

expression. Since the distance <strong>of</strong> geometric features, a set <strong>of</strong> displacement<br />

vectors, is <strong>of</strong> a high dimensions, it is mapped into a low dimensional<br />

space, called feature space, by applying PCA expansion. Then<br />

estimation <strong>of</strong> input image is achieved by projecting it on to the feature<br />

space. After build the feature space, we trained SVM classification and<br />

tested it for result.<br />

◁ PSaC-47<br />

Sequence Detection <strong>of</strong> Planetary Surface Craters From DEM Data,<br />

pp.4775–4779<br />

Yu, Zhengshi<br />

Zhu, Shengying<br />

CUI, Pingyuan<br />

Beijing Inst. <strong>of</strong> Tech.<br />

Beijing Inst. <strong>of</strong> Tech.<br />

Beijing Inst. <strong>of</strong> Tech.<br />

The research on identification and recognition <strong>of</strong> impact craters on planetary<br />

surface is focused on how to detect them from background. A novel<br />

sequence algorithm is proposed to crater detection that utilizes DEM<br />

data instead <strong>of</strong> images. By investigating the features <strong>of</strong> ideal craters,<br />

several constraints can be developed to extract candidate crater edges<br />

from other topographies. Based on the fact that the shape <strong>of</strong> most<br />

craters is approximate to an ellipse, the Least Median Square Ellipse<br />

Fitting Method can be used to exclude pseudo-edges, and to reserve<br />

the real edges which contain the feature <strong>of</strong> the crater. The location,<br />

orientation and other physical parameters <strong>of</strong> the crater can be determined<br />

by fitting real edges to an ellipse based on Robust Least Square<br />

Method. Mathematical simulations are performed with the moon DEM<br />

data. The results show that the topography-based crater detection algorithm<br />

<strong>of</strong>fers an effective method for identification and characterization<br />

<strong>of</strong> ellipse-like impact craters, and the accuracy is high enough.<br />

◁ PSaC-48<br />

A video tracking method based on Niche Particle Swarm Algorithm-<br />

Particle Filter, pp.4780–4783<br />

Li, Xin<br />

Chen, Wenjie<br />

Shang, Zengguang<br />

Beijing Inst. <strong>of</strong> Tech.<br />

Beijing Inst. <strong>of</strong> Tech.<br />

The Chinese people’s liberation army<br />

In order to improve the stability and robustness in video tracking based<br />

on particle filter. We proposed Niche Particle Swarm Algorithm-Particle<br />

Filter (NPSA-PF) which applies Niche Particle Swarm Algorithm to the<br />

re-sampling stage in particle filter. The ability <strong>of</strong> Niche Particle Swarm<br />

Algorithm which improves the particles’local search ability and weakens<br />

the information sharing between particles, effectively reduces the<br />

tracking particles number and improves tracking stability and robustness.<br />

We use it in video tracking and the performance is validated to<br />

be effective.<br />

◁ PSaC-49<br />

An Efficient Approach <strong>of</strong> 3D Ear Recognition, pp.4784–4790<br />

Wang, Kai<br />

Mu, Zhichun<br />

He, Zhijun<br />

Univ. <strong>of</strong> Sci. & Tech. Beijing<br />

School <strong>of</strong> Automation & Electrical Engineering,<br />

Univ. <strong>of</strong> Sci. & Tech. Beijing<br />

China Nuclear Power Engineering Co.,Ltd<br />

The Iterative Closest Point(ICP) algorithm is usually used for 3D ear<br />

recognition in the literatures. However, the high computational cost<br />

<strong>of</strong> ICP limits the application <strong>of</strong> 3D ear biometrics. In this paper, we<br />

present an efficient approach based on local feature and ICP for 3D<br />

ear recognition. The local features are detected and represented with<br />

LSP(Local Surface Patch), and used to compute the initial transformation<br />

for matching with ICP. An elite preservation strategy is introduced<br />

to refine the candidate gallery ears that a modified ICP algorithm with<br />

kd-tree index, distance and uniqueness constraints is applied to. The<br />

proposed approach achieved a rank-1 recognition rate 98.55% on Collection<br />

J2 <strong>of</strong> UND biometrics datasets. Matching an ear with a gallery<br />

requires only 1.73 sec on average.<br />

◁ PSaC-50<br />

A new method on Solving Correlation Dimension <strong>of</strong> Chaotic Timeseries,<br />

pp.4820–4824<br />

Qiao, Meiying<br />

Ma, Xiaoping<br />

China Univ. Mining & Tech.<br />

China Univ. <strong>of</strong> Mining & Tech.<br />

Traditional G-P algorithm exist two drawbacks in solving the correlation<br />

dimension <strong>of</strong> chaotic time series. The one is the subjective existence to<br />

determine scaleless range, the other is calculation error is large when<br />

the amount <strong>of</strong> data is small. For two shortcomings, the fuzzy C-means<br />

clustering is introduced to the G-P algorithm to determine the no-scales<br />

range. Least-squares fitting method is used to find the saturation correlation<br />

dimension value in determining the scalelesss range. Using different<br />

amount <strong>of</strong> Loren and Rossler data, such as 500,1000,2000,5000<br />

and 10000, verify the improved algorithm in this paper,. Simulation results<br />

show that the error relatively small if the delay time is small when<br />

the amount <strong>of</strong> 500, 1000 and 2000. With the length <strong>of</strong> data increases,<br />

the cluster centre value <strong>of</strong> the slope relatively flat closer to their ideal<br />

value. The conclusions are applicable to Lorenz and Rossler data.<br />

◁ PSaC-51<br />

3D Ear Modeling Based on SFS, pp.4837–4841<br />

Liu, Cong<br />

Mu, Zhichun<br />

Wang, Kai<br />

Zeng, Hui<br />

Univ. <strong>of</strong> Sci. & Tech. Beijing<br />

School <strong>of</strong> Automation & Electrical Engineering,<br />

Univ. <strong>of</strong> Sci. & Tech. Beijing<br />

Univ. <strong>of</strong> Sci. & Tech. Beijing<br />

Univ. <strong>of</strong> Sci. & Tech. beijing<br />

Ear recognition, by using ear for identification recognition, is a kind <strong>of</strong><br />

new biometric identification technology. Currently there are a lot <strong>of</strong> ear<br />

recognition methods based on 2D images, while 3D data can provide<br />

more information. 3D reconstruction methods based on multiple 2D images<br />

have a common difficult which is to extract corresponding feature<br />

points <strong>of</strong> different images. In this paper, SFS(Shape From Shading)<br />

was used for 3D modeling by only one grayscale image. Light direction<br />

was estimated by analyzing singular points, which refers to the greatest<br />

grayscale point, in 2D grayscale image. In addition, in order to achieve<br />

more accurate 3D modes, the abnormal high brightness <strong>of</strong> the cavity<br />

<strong>of</strong> auricular concha is processed. The matching accuracy <strong>of</strong> the model<br />

can reach to 84%. Therefore the experiments shown that the method<br />

proposed in this paper is simple and effective to modeling 3D ear.<br />

◁ PSaC-52<br />

A Target Detection Method in Dynamic Scene Based on Harris Algorithm<br />

with Sub-block Threshold, pp.4842–4847<br />

Lu, Jinghua<br />

LEI, Yinghui<br />

Chen, Jie<br />

Zhang, Juan<br />

Beijing Inst. <strong>of</strong> Tech.<br />

Beijing Inst. <strong>of</strong> Tech.<br />

Beijing Inst. <strong>of</strong> Tech.<br />

Beijing Inst. <strong>of</strong> Tech.<br />

In this paper, an improved Harris algorithm for the target detection in dynamic<br />

scene due to the camera motion is presented. First, a sub-block<br />

thresholding method is proposed to solve the problem <strong>of</strong> uneven distribution<br />

<strong>of</strong> corners detected by Harris algorithm. Then, the improved<br />

Harris algorithm is used to extract feature points, which are used to<br />

estimate the parameters <strong>of</strong> global motion with the random-max consistency<br />

algorithm and the least-square method. Compensated by the<br />

result parameters, the reference image together with the current image<br />

are used to detect the target with the frame difference method. Experiment<br />

results show that the algorithm can detect the moving target more<br />

accurately in dynamic scene.<br />

◁ PSaC-53<br />

Robust Visual Tracking with Classifier-like Appearance Model and Entropy<br />

Particle Filter, pp.4853–4858<br />

Song, Yu<br />

Li, Qingling<br />

Yan, Deli<br />

Kang, Yifei<br />

Beijing Jiaotong Univ.<br />

China Univ. <strong>of</strong> Mining & Tech., Beijing<br />

Beijing Jiaotong Univ.<br />

beijing jiaotong Univ.<br />

The detection based visual tracker treats tracking as the object and its<br />

surround background online classification problem. There are two<br />

main difficult issues in this method: one is to specify exact labels for<br />

the online samples, the other is to avoid template drift that caused by<br />

wrong update <strong>of</strong> the classifier-like appearance model. To overcome<br />

198

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!