Upload
others
View
0
Download
0
Embed Size (px)
Citation preview
University of Technology, Sydney ■ Sydney ■ Australia ■
The Book of Abstract
7th
International Conference
Computer Graphics, Imaging & Visualisation
Percep
tua
lly
-Gu
ided
Desi
gn
of
No
np
ersp
ecti
ves
Th
ro
ug
h P
icto
ria
l D
ep
th C
ues
Ken
ich
i Y
osh
ida
1, S
hig
eo T
akah
ash
i1, H
iro
aki
On
o1, Is
sei
Fu
jish
iro
2,
Mas
ato
Ok
ada
(dow
nlo
aded f
rom
Wik
imedia
Com
mons).
CGIV2010 - i
L O N D O N U K
S Y D N E Y A U S T R A L I A
U_A_f2-3.3 // U_A_f3-1.2 // U_A_f3-2.4 © Hans Dehlinger, Professor Emeritus
University of Kassel, Germany
The subjects are line-oriented generative drawings, executed on a pen-plotter. The drawings make use of straight poly-lines only. By
definition, such drawings are “sharp”, because of the nature of the
lines used. From photographic images “unsharp”, (blurred, out of focus) images are well known. The ones we are interested in are the
result of an intentional effort of the photographer. The question arises, can drawings be produced that appear to be unsharp despite being
produced entirely of sharp lines. The drawings are experiments to generate such drawings. They are copsed of three layers of the same
drawing which are slightly scaled against each other. The point of origin of scaling is usually not in the center of the drawing.
IV10 & cgiv2010 - DIGITAL ART GALLERY Online Exhibition July 2010 - June 2011
V I R T U A L G A L L E R Y V E N U E
www .gra ph ics l in k . co .uk /D AR T .h tm
Exhibiting Artists:
Akio Yamanaka // Japan
Corrinne Whitaker // member of
Contemporary Art in Los Angeles and the
Carmel Gallery Alliance, USA
Da Young Ju // Art College Hong-Ik
University, South Korea
Dena Elisabeth Eber // Bowling Green
State University, OH, USA
Gabrielle Peters // University of Applied
Sciences and Arts Computer Science,
Germany
Gloria DeFilipps Brush //Department
of Art & Design at the University of
Minnesota Duluth, USA
Hans Dehlinger // University of Kassel, Germany
Harvey Goldman //University of
Massachusetts Dartmouth, USA
James Faure Walker //Kingston
University, UK
Jason Nelson //Griffith University
Australia
Jing Zhou //New Jersey, USA
Jonathan Craig Hounshell //East
Tennessee State University, USA
Joohyun Pyune // USA Kathy Brew // independent videomaker,
USA Roberto Guerra // Universidad Nacional
de Ingenieria, Lima Perú
Kellen Moss // 3D Animator
Leslie Nobler Farber //USA
Mary Visser //Southwestern University
USA
Monika Wulfers // USA Martin John Callanan //UCL
Environment Institute, UK
Philip Sanders // New York University
USA
Sheila Pinkel // Pomona College, USA
~ USA Raymond St Arnaud // Canada Victor Acevedo // USA
Victor Atman // USA
CGIV2010_PROGRAMME
CGIV2010_ 1
U T S A u s t r a l i a
A full-day Event: Saturday 7th August 2010, Time: 9:30 -17:00
Computer Graphics, Imaging and Visualisation DOCTORAL RESARCH WORKSHOP
Organised by Visualisation & Graphics Research Unit of LSBU, UK
& Department of Computer Systems, Faculty of Information Technology, University of Technology, Sydney, Australia
Computer Graphics, Imaging and Visualization –CGIV- Forum is an annual forum that is held for 7 year running. This year CGIV
forum in collaboration with the Visualisation & Graphics Research Unit of LSBU, UK and the Department of Computer Systems , Faculty of Information Technology, University of Technology, Sydney, Australia are pleased to announce Doctoral Research Workshop within the scope of the 7th International conference on Computer Graphics, Imaging and Visualization (CGIV2010). This workshop provides an opportunity for PhD students to present their work, receive feedback and to meet other researchers working in CGIV area. The focus of this workshop will be on the pros and cons of various Computer Graphics, Imaging and Visualization ideas and solutions and its potential impact on both the research community and the industry in general.
All doctoral students involved in Computer Graphics, Imaging and Visualization research area are welcome to attend. The event is organised in four sessions with up to four PhD students per session. Presenters, which are PhD students at various stages of their PhD, will give an outline of their PhD research in order to benefit from feedback about their work and methodology from a
combined industry & research panel.
CGIV2010_PROGRAMME
CGIV2010_ 2
U T S A u s t r a l i a
Saturday 7 August 2010
10:00 < UTS - Lecture theatre Foyer > Registration
10:30 -
13:00
< UTS - CB10.02.240 Postgraduate Seminar Room >
A full-day Event: saturday 7th August 2010, Time: 10:30 -16:30 Computer Graphics, Imaging and Visualisation Doctoral Research Workshop Chair: Professors Ebad Banissi, Muhammad Sarfraz, and Mao Lin Huang 10:30 An introduction from Doctoral Research Workshop chair and organiser
11:00 Visutsak, Porawat, King Mongkut's Institute of Technology Ladkrabang, Thailand 11:45 Wahab, Dr. Abd Fatah, University Malaysia Terengganu, Malaysia
12:30 View of what examiners look for in a PhD
13:00 < UTS - Dining Hall >
Lunch Break
14:00 < UTS - CB10.02.240 Postgraduate Seminar Room >
14:00 Choi, Changryoul, Hanyang University, South Korea
14:45 Oh, Hyeongchul, Hanyang University, South Korea
15:30 Break 16:00 1-1 feedback round table discussion
Final commentary
Close
CGIV2010_PROGRAMME
CGIV2010_ i
U T S A u s t r a l i a
Sunday 8 August 2010
09:30 < UTS - Lecture theatre Foyer > Registration
10:40 < UTS - CB10.02.230 Postgraduate Seminar Room >
Opening & Welcome
Welcome & official opening from UTS Conference welcome from cgiv2010 committee
Co-Chairman: Prof. M. Sarfraz Department of Information Science, Kuwait University
Prof. Ebad Banissi VGRU, LSBU, UK
Organizing co-Chairman: Prof. Maolin Huang Faculty of Information Technology. University of Technology, Sydney, Australia
11:30 < Lecture Theatre # Foyer >
Morning Coffee Break / Photograph Session 12:00 < UTS - CB10.02.230 Postgraduate Seminar Room >
Session CGIV10_1.1: Computer Graphic, Visualisation and Imaging Application Chair: Prof Ebad Banissi, VGRU, LSBU, UK
Polygonisation of non-Manifold Implicit Surfaces Using a Dual Grid and Points D. J. Harbinson, R. J. Balsys, and K. G. Suffern
Perceptually-Guided Design of Nonperspectives through Pictorial Depth Cues Kenichi Yoshida, Shigeo Takahashi, Hiroaki Ono, Issei Fujishiro, and Masato Okada
13:00 < UTS - Dining Hall > Lunch Break
CGIV2010_PROGRAMME
CGIV2010_ ii
U T S A u s t r a l i a
14:00
-
15:20
< UTS - CB10.02.230 Postgraduate Seminar Room >
Session CGIV10_1.3: Multimedia Chair: Prof. Ron Balsys; Central Queensland University Australia
Character Skin Deformation: A Survey E. Chaudhry, L. H. You, and Jian J. Zhang
Caching Scheme for Handheld Device in Mobile Video-on-demand System
Putra Sumari and Amir Rizaan Rahiman
The Height Variance Range for One Frequency Fringe Pattern Profilometry Yi Ding, Jiangtao Xi, Yanguang Yu, Joe Chicharo, and Wenqing Cheng
Development of Partial Face Recognition Framework
H. F. Neo, C. C. Teo, and Andrew B. J. Teoh
Reviewing Principles and Elements of Animation for Motion Capture-Based Walk, Run and Jump
Jong Sze Joon 15:20 < Lecture Theatre # Foyer >
Break 15:50
-
17:00
< UTS - CB10.02.230 Postgraduate Seminar Room >
Session CGIV10_2.5: Image/Video Analysis for Face Recognition II Chair: Prof Maolin Huang, Faculty of Information Technology. University of Technology, Sydney, Australia
Combining Boundary and Skeleton Information for Convex and Concave Points Detection Ali Salem Bin Samma, Abdullah Zawawi Talib, and Rosalina Abdul Salam
Shape Analysis and Recognition Based on Skeleton and Morphological Structure Donggang Yu, Jesse S. Jin, Suhuai Luo, Wei Lai, Mira Park, and Tuan D. Pham
Motion Compensated Frame Interpolation using Adaptive Adjacency Pixel Information
Hyeongchul Oh, Joohyun Lee, Changki Min, and Jechang Jeong
Ordinal Region-Based Representations for Iris Recognition
C. C. Teo, H. F. Neo, and H. T. Ewe
Jawi Character Recognition Using the Trace Transform Mohammad F. Nasrudin, Maria Petrou, and Leonidas Kotoulas
Video Objects Behavior Recognition using Fast MHI Approach Yi-Ching Liaw, Wei-Chih Chen, and Tsung-Jen Huang
CGIV2010_PROGRAMME
CGIV2010_ iii
U T S A u s t r a l i a
Monday 9 August 2010
09:00
–
1800
Cgiv2010_Social Networking Event
<To be finalised>
19:30
-
21:30
Cgiv2010_ Social Event Conference Dinner
<To be finalised>
CGIV2010_PROGRAMME
CGIV2010_ iv
U T S A u s t r a l i a
Tuesday 10 August 210
08:30 Registration
9:00 < UTS - CB02.07.004B - Tutorial Room >
Session CGIV10_3.1: Computer-Aided Geometric
Design Chair: Prof. Ahmad Nasri, Computer Graphics & Animation Lab
and Department of Computer Science , AUB, Lebnan
Fuzzy Interpolation Rational Bezier Curve
Abd. Fatah Wahab, Rozaimi Zakaria, and Jamaludin Md. Ali
Differential Evolution Optimization for Bezier Curve Fitting Priza Pandunata and Siti Mariyam Hj Shamsuddin
NURBS Curve Approximation using Particle Swarm Optimization
Delint Ira Setyo Adi, Siti Mariyam bt Shamsuddin, and Siti Zaiton Mohd Hashim
Interpolation with PH quintic spirals Zulfiqar Habib and Manabu Sakai
Approximating boundary of bitmap characters using Genetic Algorithm
Muhammad Sarfraz, Malik Zawwar Hussain, Misbah Irshad, and Ayesha Khalid
Generating Elliptic Curves modulo p for Cryptography using Mathematica software
Hailiza Kamarulhaili
Simplified Local Binary Pattern Descriptor for Character Recognition of Vehicle
Lixia Liu, Honggang Zhang, Aiping Feng, Xinxin Wan, and Jun Guo
The Application of Ubiquitous Robotics in Visualization Jesse S. Jin and Ghalib Alshammri
< UTS - CB02.07.008-g-b LECTURE ROOM >
Session CGIV10_3.2: CGIV Chair: Prof. jiangtao xi, University of Wollongong, Australia
Low Complexity Weighted Two-Bit Transforms Based Multiple Candidates Motion Estimation Exploiting the Redundant Computations
Changryoul Choi and Jechang Jeong
A Robust Evolutionary Based Digital Image Watermarking Technique in DCT Domain
Majid Rafigh and Mohsen Ebrahimi Moghaddam
Visual Interface Tools to Solve Real-World Examination Timetabling Problem
J. Joshua Thomas, Ahamad Tajudin Khader, Bahari Belaton, and Eben Christy
Evaluating the Usability of Visualizations of Normal Behavioral Models for Analytical Reasoning
Maria Riveiro and Göran Falkman
A Robust Multiple Object Tracking Algorithm Under Highly Occlusion
Dang Xiaoyan, Zhang Ya, Wang Wei, Wang Zhuo, and Wang Zhihua
Expressive MPEG-4 Facial Animation Using Quadratic Deformation Models
Mohammad Obaid, Ramakrishnan Mukundan, Mark Billinghurst, and Catherine Pelachaud
Principles of Photorealism to Develop Photorealistic Visualisation for Interface Design: A Review
Jong Sze Joon
CGIV2010_PROGRAMME
CGIV2010_ v
U T S A u s t r a l i a
11:00 <Foyer>
Break 11:30 < UTS - CB02.07.008-g-b LECTURE ROOM >
Session CGIV10_3.7: CGIV Chair: Prof. M. Sarfraz, Department of Information Science, Kuwait University
Visual Computer Game Features for Teaching Relativity
David Carr
<Keynote Lecture> Sketch-Based Subdivision Models for Graphics and Animation
Conference Closing from cgiv10 committee: Co-Chairman: Prof. M. Sarfraz Department of Information Science, Kuwait University
Prof. Ebad Banissi VGRU, LSBU, UK
Prof. Maolin Huang Faculty of Information Technology. University of Technology, Sydney, Australia
13:00 < Lecture Theatre # Foyer >
Lunch Break 13:30 < UTS - CB02.07.004B - Tutorial Room >
cgiv2011-Committee Members Meeting Close
CGIV2010_Abstracts
CGIV2010_ 1
U T S A u s t r a l i a
ABSTRACTS
Doctoral Research Workshop
Chair: Professors Ebad Banissi, Muhammad Sarfraz, and Mao Lin Huang
Knowledge-based approach for skeleton approximation
Visutsak, Porawat; Prachumrak, Korakot
A 3D skeleton is a one-voxel thick, graph-like structure widely used in the area of a character animation. In this paper, we propose a novel method for computing the skeleton of the 3D character models based on a-priori knowledge. We present several algorithms for computing the skeleton based on Blum‟s Medial Axis Transform and geodesic distance algorithm. We show that the algorithm can generate the smoothed skeleton in a compact form, while providing the essential joints of the skeletal structure. Since most of skeletons of biped and quadruped character models have the same global features (spine and joints), the notion of similarity is crucial importance in comparing the unknown character models with the others stored in the database. We extend the algorithm with an approach of content-based analysis for automatic and efficient retrieval, classification, and annotation of the 3D character models. The method has several steps. First, the octree of the input model is calculated and used to compare with the octrees of the 3D models stored in the octrees database. By comparing the octrees similarity, if the result is exact match, the corresponding skeleton will be retrieved from the skeletons database. Otherwise, the method finds the list of the close match (the octree similarity ratio which the value is greater than 0.8) in order to use to estimate the new skeleton. In the worst case, if the input octree does not match with any case in the octrees database, the method computes the skeleton and stores it in the skeletons database. The method is fast and efficient because it is not necessary to compute the skeleton from every input model. Thus, the computational time of our method depends only on the time of the octrees similarity calculation, and the time of
searching the similar octrees in the octrees database. Several examples show the results obtained with our approach.
Fuzzy Interpolation Rational Bezier Curve
Wahab, Abd Fatah; Zakaria, Rozaimi; Md Ali, Jamaluddin
Recently, interpolation methods especially in curves design are widely used for modeling data points. In this paper a new interpolation method for modeling fuzzy data using fuzzy interpolation rational Bezier curves is introduced based on fuzzy set theory. This method is able to model uncertainty data with definition of fuzzy data via fuzzy number concept. The fuzzy interpolation method is modeled using fuzzy interpolation rational cubic Bezier curve (in further will be referred as FIRCBC). For fuzzy n-data cases, segments curve constructed in order to interpolate fuzzy data piecewisely. For the illustration as hypothetical example, FIRCBC has been applied in verification of offline handwriting signature where the signatures become fuzzy cases.
Low Complexity Weighted Two-Bit Transforms Based Multiple Candidates Motion Estimation Exploiting the Redundant Computations
Choi, Changryoul; Jeong, Jechang
A low complexity weighted two-bit transforms (2BT) based multiple candidates motion estimation algorithm is proposed in this paper. By exploiting almost the identical operations in two different matching error criteria, we can efficiently determine two best motion vectors according to the respective matching criteria and can enhance the overall motion estimation accuracy. Experimental results show that the proposed algorithm achieves peak-to-peak signal-to-noise ratio (PSNR) gains about 0.47dB on average compared with the conventional 2BT-based motion estimation.
Motion Compensated Frame Interpolation using Adaptive Adjacency Pixel Information
Oh, Hyeongchul; Lee, Joohyun; Min, Changki; Jeong, Jechang
We propose an adaptive motion compensated frame interpolation scheme to develop the frame rate from a lower number into a higher
CGIV2010_Abstracts
CGIV2010_ 2
U T S A u s t r a l i a
one and the decoded video quality at the decoder. The proposed algorithm utilizes the preliminary frames of the forward and backward direction using the bilateral prediction. In the process of the preliminary frames, an additional interpolation is performed to fill the occlusion areas. If the calculated values between the reference and current frames are larger than the predetermine threshold, the block is chosen the occlusion area. Also, we perform the re-search to acquire the best blocks taking into account the number of available adjacency blocks for the occlusion areas. The experimental results show that the performance of the proposed algorithm has better PSNR and visual quality than the conventional methods.
Session CGIV10_1.1: Computer Graphic, Visualisation and Imaging Application Chair: Prof Ebad Banissi, VGRU, LSBU, UK
Polygonisation of non-Manifold Implicit Surfaces Using a Dual Grid and Points
D. J. Harbinson, R. J. Balsys, and K. G. Suffern
Our polygons/points method is octree based, uses interval and point sampling of the surface curvature to drive the subdivision, and uses a pruning algorithm to generate points that are rendered where the surface curvature is high, or around non-manifold features. This approach allows us to visualise both manifold and non-manifold implicit surfaces of high complexity. We discuss necessary modifications of the dual grid method to polygonise the surfaces. The main advantage of the dual grid is that cracks do not form between shared plotting node faces that are at different depths. Polygons are formed as a mixture of triangles and quads and the rendering can be hardware accelerated. We also discuss improvements to the grid so that slither triangle do not form.
We render a variety of non-manifold implicit surfaces to demonstrate the results from our algorithm. We discuss the advantages of this approach.
Perceptually-Guided Design of Nonperspectives through Pictorial Depth Cues
Kenichi Yoshida, Shigeo Takahashi, Hiroaki Ono, Issei Fujishiro, and Masato Okada
Introducing distortions into perspective views is a popular technique to direct our visual attention to specific objects, as seen in hand-drawn illustrations and cartoon animations. This type of image expression, called non-perspective projection, is feasible in visual communication, because the human visual system can reconstruct the target three-dimensional (3D) scene correctly provided that the corresponding image distortions are within a certain perceptual tolerance. In this paper, we develop a perceptual approach to guiding the design of such non-perspective images by referring to the 3D perception induced by pictorial depth cues. We formulate an acceptable tolerance by investigating how we perceive image distortion according to the change in the configuration of pictorial depth cues. The obtained formulation is then incorporated into our new algorithm, with which we can automatically control plausible image deformation by simply modifying the position and size of specific objects in a scene.
Session CGIV10_1.3: Multimedia Chair: Prof. Ron Balsys; Central Queensland University
Australia
Character Skin Deformation: A Survey
E. Chaudhry, L. H. You, and Jian J. Zhang
Skin deformation plays a very important role in creating realistic character animation. A lot of research efforts have been devoted to the development of skin deformation techniques. The paper provides a survey of various techniques and classify them into three major
CGIV2010_Abstracts
CGIV2010_ 3
U T S A u s t r a l i a
categories; surface-based, volume-based and curve-based techniques. Surface based techniques are divided into purely geometric and physics-based. Volume-based techniques are grouped into purely geometric, anatomy based, and physics-based. Curve-based techniques are classified as free form deformation, purely geometric sweep deformation, cross section method; physics based sweep deformation, static curve-based skin deformation, and dynamic curve-based skin deformation. For each group, a representative technique is introduced. The strengths and weaknesses of each technique are analysed. Finally, some future research directions are discussed.
Caching Scheme for Handheld Device in Mobile Video-on-demand System
Putra Sumari and Amir Rizaan Rahiman
Mobile Video on demand (VOD) system is a video streaming system that allows mobile clients to browse and watch videos anywhere and anytime from a remote video server. In this system, the video server employs staggered broadcasting protocol to disseminate video to mobile clients within the MANET environment. In this protocol, video is divided into small segments and are repeatedly broadcasted within server‟s channel in periodic basis. Clients can join any of the channels to receive the segments and begin to watch the video. The drawback of periodic broadcasting is it leads mobile clients to have a long waiting time (range in several minutes) due to the issue of channel transitions period. Once the client misses the segment of one channel then he/she has to transit for another channel looks for similar segment. The transition is quite lengthily. In this paper we focus on reducing the waiting time by proposing two caching schemes. Our caching scheme works based on the ability of MANET infrastructure and its buffer system to have a direct communication among mobile clients. This paper present the basic caching architecture and follows by first, a Neighbour-based caching scheme allows clients to get help from neighbour‟s buffer for the playback, and finally a Relay-based caching scheme uses middle clients to relay the video from client to another client. Simulation shows that
our two caching schemes can reduce clients delay tremendously in comparison with the case of no caching scheme.
The Height Variance Range for One Frequency Fringe Pattern Profilometry
Yi Ding, Jiangtao Xi, Yanguang Yu, Joe Chicharo, and Wenqing Cheng
The upper limit on the complexity of the surface shape that can be accurately determined is an important performance measure associated with fringe pattern profilometry. This metric is evaluated as the variance of height between the two adjacent pixels on the fringe patterns reflected from the object surface. This paper presents novel results on this metric based on the Nyquist sampling theorem originally developed in the area of communication theory. Compared to existing results, we indicate that the fringe width and digital image resolution also affect the height variance range significantly. This result can be used to increase the measurement range for projection system.
Development of Partial Face Recognition Framework
H. F. Neo, C. C. Teo, and Andrew B. J. Teoh
This paper presents a new framework of face recognition system that utilizes partial information available from front face where the users are willing and able to provide for access control. It is especially useful for people where part of their face is scarred and defect thus need to be covered. Hence, either top part/eye region (people is wearing veil or mask) or bottom part of face (people is wearing sunglasses) will be recognized respectively. The partial face data are tested with Principle Component Analysis (PCA), Non-negative matrix factorization (NMF), Local NMF (LNMF) and Spatially Confined NMF (SFNMF). The experiment results show that our proposed framework is able to achieve recognition rate of .95.17% with r = 80 by using SFNMF for bottom face region. On the other hand, eye region achieves 95.12% with r = 10 by using LNMF.
CGIV2010_Abstracts
CGIV2010_ 4
U T S A u s t r a l i a
Reviewing Principles and Elements of Animation for Motion Capture-Based Walk, Run and Jump
Jong Sze Joon
This study aims to study the detail of human motion by experimenting and extracting the subjects‟ core motions for analysis based on Principles of animation and Elements of animation. Sampling various subjects of physical differences, this study attempts to acquire various motion parameters based on certain predefined actions. In addition, this study also applies enhanced motion editing techniques to retarget and constraint the captured data. This study concentrates on the level of details of motions of various subjects with differences in physical attributes. We outline how different physique produces different behavioural patterns based upon mass and proportion. This study considers „motion‟ to identify the differences in each subject‟s physical attributes by sampling subjects of physical differences.
Session CGIV10_2.5: Image/Video Analysis for Face Recognition II
Chair: Prof Maolin Huang, Faculty of Information Technology. University of Technology, Sydney, Australia
Combining Boundary and Skeleton Information for Convex and Concave Points Detection
Ali Salem Bin Samma, Abdullah Zawawi Talib, and Rosalina Abdul Salam
Basically, detecting convex and concave points on the boundary of an object plays an important role in computer vision, object recognition and image understanding. In this paper a method that combines boundary and skeleton information for detecting these critical points is proposed. Specifically, the method is developed with the aim of obtaining high performance and efficiency, and producing a more robust method in detecting concave and convex points with minimum cost of computation. Furthermore, for faster execution of the proposed method, the detection of convex and concave points
can be run concurrently. In order to evaluate the performance of the proposed method, the results of the proposed method are compared with three related convex and concave points detection methods. The experimental results have shown that the proposed method provides better output and detection rate.
Shape Analysis and Recognition Based on Skeleton and Morphological Structure
Donggang Yu, Jesse S. Jin, Suhuai Luo, Wei Lai, Mira Park, and Tuan D. Pham
This paper presents a novel and effective method of shape analysis and recognition based on skeleton and morphological structure. A series of pre-processing algorithms, smooth following and liberalization are introduced, and series of morphological structural points of image contour are extracted and merged.
A series of basic shapes and a main shape of object image are described and segmented based on skeleton and morphological structure. Object shape is efficiently analyzed and recognized based on the extracted series of basic shapes and main shape.
Comparing with other methods, the proposed method need not sample training set. Also, the new method can be used to analyze and recognize the shape structure of any shape, and there is no any requirement for the processed image data set. The new method can be used in image analysis, intelligent recognition, techniques, applications, systems and tools.
Motion Compensated Frame Interpolation using Adaptive Adjacency Pixel Information
Hyeongchul Oh, Joohyun Lee, Changki Min, and Jechang Jeong
We propose an adaptive motion compensated frame interpolation scheme to develop the frame rate from a lower number into a higher one and the decoded video quality at the decoder. The proposed algorithm utilizes the preliminary frames of the forward and backward direction using the bilateral prediction. In the process of
CGIV2010_Abstracts
CGIV2010_ 5
U T S A u s t r a l i a
the preliminary frames, an additional interpolation is performed to fill the occlusion areas. If the calculated values between the reference and current frames are larger than the predetermine threshold, the block is chosen the occlusion area. Also, we perform the re-search to acquire the best blocks taking into account the number of available adjacency blocks for the occlusion areas. The experimental results show that the performance of the proposed algorithm has better PSNR and visual quality than the conventional methods.
Ordinal Region-Based Representations for Iris Recognition
Chuan Chin Teo, Han Foon Neo, and H. T. Ewe
This paper presents local ordinal measures for iris recognition. It is inspired by the mechanism of response properties in neuroscience. The ordinal relationships can preserve the stability among a group of neighboring regions against noise in a given iris image. In this scheme, the iris texture is represented by a set of similarities and dissimilarities across neighboring regions. The experiment results show that proposed simple algorithm can achieve a reasonable recognition rate as compared to existing complex algorithms.
Jawi Character Recognition Using the Trace Transform
Mohammad F. Nasrudin, Maria Petrou, and Leonidas Kotoulas
The Trace transform, a generalization of the Radon transform, allows one to construct image features that are invariant to a chosen group of image transformations. In this paper, we use some features, which are invariant to affine distortion, generated by the trace transform to discriminate between Jawi characters. The process consists of tracing an image with straight lines, in all possible orientations, along which certain functionals of the image function are calculated. For each combination of functionals we derive a function of orientation of the tracing lines that is known as an object signature. If the functionals used have some predefined properties, this signature can be used to characterise the character in an affine way. We demonstrate the usefulness of the derived
signature and compare the result of character recognition with those obtained by using features based on affine moment invariants and angular radial transform.
Video Objects Behavior Recognition using Fast MHI Approach
Yi-Ching Liaw, Wei-Chih Chen, and Tsung-Jen Huang
The concept of motion history image (MHI) is widely adopted by many researchers to solve problems of video objects behavior recognition. In the case of predefined behaviors with various durations, the computation time of behavior recognition will increase intensely. In this paper, a fast MHI approach is proposed to reduce the computation time of the MHI approach by storing multiple sets of features for a predefined behavior and using the partial distance computation method. In this paper, 9 local orientations proposed by Cheng et al and squared Euclidean distance are used in our behavior matching process to demonstrate the performance of the proposed approach. Experimental results show that the proposed method can effectively reduce the computation time of the MHI method.
Session CGIV10_3.1: Computer-Aided Geometric Design
Chair: Prof. Ahmad Nasri, Computer Graphics & Animation Lab and Department of Computer Science , AUB, Lebnan
Fuzzy Interpolation Rational Bezier Curve
Abd. Fatah Wahab, Rozaimi Zakaria, and Jamaludin Md. Ali
Recently, interpolation methods especially in curves design are widely used for modeling data points. In this paper a new interpolation method for modeling fuzzy data using fuzzy interpolation rational Bezier curves is introduced based on fuzzy set theory. This method is able to model uncertainty data with definition of fuzzy data via fuzzy number concept. The fuzzy interpolation
CGIV2010_Abstracts
CGIV2010_ 6
U T S A u s t r a l i a
method is modeled using fuzzy interpolation rational cubic Bezier curve (in further will be referred as FIRCBC). For fuzzy n-data cases, segments curve constructed in order to interpolate fuzzy data piecewisely. For the illustration as hypothetical example, FIRCBC has been applied in verification of offline handwriting signature where the signatures become fuzzy cases.
Differential Evolution Optimization for Bezier Curve Fitting
Priza Pandunata, Siti Mariyam Hj Shamsuddin and Aida Ali
In this study, we propose an alternative solution for Bezier curve fitting with Differential Evolution (DE) algorithm. DE algorithm is conducted by randomly generated the control points of the Bezier curve. These generated control points are used to calculate the Bezier curve point. The fitness function of DE algorithm is computed to search for the minimum error. From the experiments, we found that the results of our proposed method achieve the minimum error value significantly.
NURBS Curve Approximation using Particle Swarm Optimization
Delint Ira Setyo Adi, Siti Mariyam bt Shamsuddin, and Siti Zaiton Mohd Hashim
This paper presents curve approximation problem using Particle Swarm Optimization (PSO). The proposed algorithm will be used to develop a skinning surface with PSO to keep the number of surface control points minimum. The experiments are conducted on various parameterization methods for approximating the curves. By implementing PSO on NURBS curve approximation, the weights of the curve can be adjusted accordingly. From the results, it can be concluded that the proposed method is promising in approximating NURBS curves using PSO.
Interpolation with PH quintic spirals
Zulfiqar Habib and Manabu Sakai
This paper finds a spiral segment matching G2 Hermite conditions for a single Pythagorean hodograph quintic polynomial. A spiral is free of local curvature extrema, making spiral design an interesting mathematical problem with importance for both physical and aesthetic applications. In the construction of highways or railway routes and in the path planning of non-holonomic mobile robots, it is often desirable to have a spiral segment with given positions, tangents, and curvatures at the end points.
Approximating boundary of bitmap characters using Genetic Algorithm
Muhammad Sarfraz, Malik Zawwar Hussain, Misbah Irshad, and Ayesha Khalid
This paper presents an algorithm to capture outline of bitmap characters. In order to obtain outline, a cubic function with one shape parameter is used. Genetic algorithm is applied to find the value of shape parameter. The procedure of capturing outline consists of the steps: boundary detection, detection of corner points, break points and fitting the curve.
Generating Elliptic Curves modulo p for Cryptography using Mathematica software
Hailiza Kamarulhaili
This paper discussed basic concepts of elliptic curves, from the definition of the elliptic curve defined by the Weierstrass equation up to its application to cryptography. The discussion includes the group operations on the curves, the addition law as well as the doubling formulas and how to generate a good curve cryptographically. These important properties come with some examples with the direction towards illustrating the use of elliptic curves in cryptography with the help of the Mathematica software.
Simplified Local Binary Pattern Descriptor for Character Recognition of Vehicle
Lixia Liu, Honggang Zhang, Aiping Feng, Xinxin Wan, and Jun Guo
CGIV2010_Abstracts
CGIV2010_ 7
U T S A u s t r a l i a
Local Binary Pattern (LBP) is a powerful texture descriptor for its tolerance against illumination changes and its computational simplicity. The basic LBP encodes 256 feature patterns in a 3*3 neighborhood, but not all the patterns are effective for classification. In this paper, we propose a simplified LBP(S-LBP) which produces optimal patterns by using the best coding principle for classification.
Meanwhile, we combine S-LBP and Mahalonobis distance in solving the practical problem of character recognition in Chinese license plate. Experimental results demonstrate the effectiveness of our method for vehicle license recognition comparing with other popular methods.
The Application of Ubiquitous Robotics in Visualization
Jesse S. Jin and Ghalib Alshammri
Ubiquitous robotics has recently become an important research topic
in the field of autonomous robotics. Furthermore, ubiquitous robotics may
allow integrating robotic technologies with other technologies such as
sensor networks, wireless security and software engineering. This
integration may inspire new way to build intelligent systems in the service
of the society. This research will allow the use of ubiquitous robots at
international airports through offering helpful services to travelers, to aid in the management of the airport and to enhance the ability of law
enforcement and security personnel to monitor and act in the airport. The
solution of the research problem is building effective middleware that will
play an important role in the development of useful ubiquitous robots for
international airports. It is expected that this project has a clear
commercial angle.
Keywords: Ubiquitous Robotics, Middleware, Mobile Robots, Software
Robots
Session CGIV10_3.2: CGIV Chair: Prof. jiangtao xi, University of Wollongong, Australia
Low Complexity Weighted Two-Bit Transforms Based Multiple Candidates Motion Estimation Exploiting the Redundant Computations
Changryoul Choi and Jechang Jeong
A low complexity weighted two-bit transforms (2BT) based multiple candidates motion estimation algorithm is proposed in this paper. By exploiting almost the identical operations in two different matching error criteria, we can efficiently determine two best motion vectors according to the respective matching criteria and can enhance the overall motion estimation accuracy. Experimental results show that the proposed algorithm achieves peak-to-peak signal-to-noise ratio (PSNR) gains about 0.47dB on average compared with the conventional 2BT-based motion estimation.
A Robust Evolutionary Based Digital Image Watermarking Technique in DCT Domain
Majid Rafigh and Mohsen Ebrahimi Moghaddam
Digital watermarking techniques are used for the digital right managements and copyright protection. As known, it is a big deal in watermarking systems to make a good trade of between the robustness and imperceptibility. This paper presents a watermarking algorithm in the DCT domain using an evolutionary algorithm to satisfy both of robustness and imperceptibility. We employ a genetic-based algorithm to select pairs in DCT coefficients and insert watermark bit according to mathematical relation between selected coefficients in each 8×8 DCT block of image. The proposed method has been implemented and tested under various attacks including JPEG compression, additive noise distortion, and image filtering. The achieved results show that image remains imperceptible while the watermark survives the attacks especially in case of JPEG compression
Visual Interface Tools to Solve Real-World Examination Timetabling Problem
CGIV2010_Abstracts
CGIV2010_ 8
U T S A u s t r a l i a
J. Joshua Thomas, Ahamad Tajudin Khader, Bahari Belaton, and Eben Christy
NP-Hard problems are hard to solve, it requires considerable computational power to generate solutions. The objective is to achieve better solution in less time. To obtain better solutions in semi-automated examination timetabling systems, we introduce visual interface tools to assist human to identify conflicts and turn the direction towards the feasible solution. We propose visual interface as a tool for the user to interact with the schedule generations.
Evaluating the Usability of Visualizations of Normal Behavioural Models for Analytical Reasoning
Maria Riveiro and Göran Falkman
Many approaches for anomaly detection use statistical based methods that build profiles of normalcy. In these cases, anomalies are defined as deviations from the normal models build from representative data. Detection systems based solely on these approaches typically generate high false alarm rates due to the difficulty of creating flawless models.
In order to support the comprehension, validation and update of such models, this paper is devoted to the visualization of normal behavioral models of sea traffic and their usability evaluation. First, we present geographical projections of the different probability density functions that represent the normal traffic behavior and second, we outline results from a usability assessment carried out in order to evaluate the ability of such visualizations to support representative tasks related to the establishment of normal situational picture
A Robust Multiple Object Tracking Algorithm Under Highly Occlusion
Dang Xiaoyan, Zhang Ya, Wang Wei, Wang Zhuo, and Wang Zhihua
We describe a real-time multiple face-tracking algorithm under highly occlusion. In order to resolve the occlusion and temporal lost problem, a robust data association + filtering procedure is proposed. The mechanism combines the census transform based block-by-
block strategy to infer the occlusion state via concerning observation changes of two faces. And a robust and straightforward filtering approach is provided to infer the state of the occluded object, so that the prior motion cues and observations are jointly utilized. Finally cross validation scheme is introduced to adjust the association process and resist unpredicted motion changes. Combining the proposed scheme to resist occlusion with a baseline discriminative kernel tracker, experiments demonstrate that the proposed tracking algorithm has favorable capability on video sequences.
Expressive MPEG-4 Facial Animation Using Quadratic Deformation Models
Mohammad Obaid, Ramakrishnan Mukundan, Mark Billinghurst, and Catherine Pelachaud
In this paper we propose an approach compliant with the MPEG-4 standard to synthesize and control facial expressions generated using 3D facial models. This is achieved by establishing the MPEG-4 facial animation standard conformity with the quadratic deformation model representations of facial expressions. This conformity allows us to utilize the MPEG-4 facial animation parameters (FAPs) with the quadratic deformation tables, as a higher layer, to compute the FAP values.
The FAP values for an expression E are computed by performing a linear mapping between a set of transformed MPEG-4 FAP points (using quadratic deformation models) and the 3D facial model semantics. The nature of the quadratic deformation model representations of facial expressions can be employed to synthesize and control the six main expressions (smile, sad, fear, surprise, anger, and disgust). Using Whissel's psychological studies on emotions we compute an interpolation parameter that is used to synthesize intermediate facial expressions.
The paper presents results of experimental studies performed using the Greta embodied conversational agent. The achieved results are promising and can lead to future research in synthesizing a wider range of facial expressions.
CGIV2010_Abstracts
CGIV2010_ 9
U T S A u s t r a l i a
Principles of Photorealism to Develop Photorealistic Visualisation for Interface Design: A Review
Jong Sze Joon
With the mindset of merging both aesthetics and technical knowledge to create believable 3D visualisation, a new set of refined Principles of Photorealism are applied to enhance the 3D rendering approach consequently creating realistic yet quick to create 3D visualisation for Interface Design. This paper discusses the importance of applying the principles with consideration of interface visualisation aspects towards the human environment and the interfaces within. This includes studies of depth, perspective and spatial studies in Computer Aided Design (CAD) and Virtual Reality Added Design (VRAD) for Interface Design. The case studies selected emphasize on exact measurement and accurate mapping as well as lighting techniques for the most realistic output. The outcome of this study serves as a guideline to identify basic principles and elements of Photorealism to create efficient photorealistic 3D rendering in terms of model properties, textures, lighting and rendering
Session CGIV10_3.7: CGIV Chair: Prof. M. Sarfraz, Department of Information Science,
Kuwait University
Visual Computer Game Features for Teaching Relativity
David Carr
This paper we describe incorporating Einstein's Special Theory of Relativity into an interactive computer game intended for learning and teaching purposes in Australian senior high school and tertiary education. In the game, which is based on \emph{Asteroids}, players can observe and interact with relativistic physics in the game environment and contrast them with classical models of mechanics. The emphasis is on conceptual portrayal with 2D graphics, rather than immersive and realistic 3D visualisation. The key relativistic
concepts of length contraction, time dilation, and mass dilation are each represented, as well as Doppler shifting of colour. We discuss design considerations and graphical devices for portraying these effects in the game, along with results and responses from user experiments.
<Keynote Lecture>
Sketch-Based Subdivision Models for Graphics and Animation
Ahmad Nasri, Computer Graphics & Animation Lab and Department of Computer Science , AUB, Lebnan
In this talk, we present an intuitive and interactive approach for using sketch-based interface to design subdivision models. The input to the system is a set of strokes forming the profile curves of the surface. From the constructed control polygons of the sketched curves, a coarse and quad dominant control mesh is generated with few extraordinary vertices or faces. The corresponding limit surface interpolates the profile curves with the capability of local control across these curves and of the model in general. Although our approach is oriented towards quad-based systems such as Catmull-Clark, it could well be adopted in other subdivision schemes. Local control of the produced models is provided over the sketched curves, providing the ability to add details such as creases and to adjust the shape of the surface by modifying curvature along their cross curvature values. Users of the system progressively add details to the initial models through various sketch based operations such as oversketching, cutting, and extrusions, allowing the creation of complex models with ease.
CGIV2010_PROGRAMME
U T S A u s t r a l i a
NOTES
D I G I T A L A R T G A L L E R Y a n o n l i n e e x h i b i t i o n July 2010 ~ June 2011
V I R T U A L G A L L E R Y
V E N U E www .g rap h ic s l in k .c o.uk /DART.h t m
Vis
ual
Sty
les o
f W
ayan
g K
uli
t K
ela
nta
n
Khor
Kheng K
ia &
and Y
uen M
ay C
han
Lim
kokw
ing U
niv
ers
ity &
Multim
edia
Univ
ers
ity,
Mala
ysia
Published by: Visualisation & Graphics Research Unit
London South Bank University, UK