Abstract: The H.264/AVC standard uses an intra prediction, 9
directional modes for 4x4 luma blocks and 8x8 luma blocks, 4
directional modes for 16x16 macroblock and 8x8 chroma blocks,
respectively. It means that, for a macroblock, it has to perform 736
different RDO calculation before a best RDO modes is determined.
With this Multiple intra-mode prediction, intra coding of H.264/AVC
offers a considerably higher improvement in coding efficiency
compared to other compression standards, but computational
complexity is increased significantly. This paper presents a fast intra
prediction algorithm for H.264/AVC intra prediction based a
characteristic of homogeneity information. In this study, the gradient
prediction method used to predict the homogeneous area and the
quadratic prediction function used to predict the nonhomogeneous
area. Based on the correlation between the homogeneity and block
size, the smaller block is predicted by gradient prediction and
quadratic prediction, so the bigger block is predicted by gradient
prediction. Experimental results are presented to show that the
proposed method reduce the complexity by up to 76.07%
maintaining the similar PSNR quality with about 1.94%bit rate
increase in average.
Abstract: METIS is the Multi Element Telescope for Imaging
and Spectroscopy, a Coronagraph aboard the European Space
Agency-s Solar Orbiter Mission aimed at the observation of the solar
corona via both VIS and UV/EUV narrow-band imaging and spectroscopy. METIS, with its multi-wavelength capabilities, will
study in detail the physical processes responsible for the corona heating and the origin and properties of the slow and fast solar wind.
METIS electronics will collect and process scientific data thanks to its detectors proximity electronics, the digital front-end subsystem
electronics and the MPPU, the Main Power and Processing Unit,
hosting a space-qualified processor, memories and some rad-hard
FPGAs acting as digital controllers.This paper reports on the overall
METIS electronics architecture and data processing capabilities
conceived to address all the scientific issues as a trade-off solution between requirements and allocated resources, just before the
Preliminary Design Review as an ESA milestone in April 2012.
Abstract: Local Linear Neuro-Fuzzy Models (LLNFM) like other neuro- fuzzy systems are adaptive networks and provide robust learning capabilities and are widely utilized in various applications such as pattern recognition, system identification, image processing and prediction. Local linear model tree (LOLIMOT) is a type of Takagi-Sugeno-Kang neuro fuzzy algorithm which has proven its efficiency compared with other neuro fuzzy networks in learning the nonlinear systems and pattern recognition. In this paper, a dedicated reconfigurable and parallel processing hardware for LOLIMOT algorithm and its applications are presented. This hardware realizes on-chip learning which gives it the capability to work as a standalone device in a system. The synthesis results on FPGA platforms show its potential to improve the speed at least 250 of times faster than software implemented algorithms.
Abstract: This paper presents a new classification algorithm using colour and texture for obstacle detection. Colour information is computationally cheap to learn and process. However in many cases, colour alone does not provide enough information for classification. Texture information can improve classification performance but usually comes at an expensive cost. Our algorithm uses both colour and texture features but texture is only needed when colour is unreliable. During the training stage, texture features are learned specifically to improve the performance of a colour classifier. The algorithm learns a set of simple texture features and only the most effective features are used in the classification stage. Therefore our algorithm has a very good classification rate while is still fast enough to run on a limited computer platform. The proposed algorithm was tested with a challenging outdoor image set. Test result shows the algorithm achieves a much better trade-off between classification performance and efficiency than a typical colour classifier.
Abstract: Aerial and satellite images are information rich. They are also complex to analyze. For GIS systems, many features require fast and reliable extraction of roads and intersections. In this paper, we study efficient and reliable automatic extraction algorithms to address some difficult issues that are commonly seen in high resolution aerial and satellite images, nonetheless not well addressed in existing solutions, such as blurring, broken or missing road boundaries, lack of road profiles, heavy shadows, and interfering surrounding objects. The new scheme is based on a new method, namely reference circle, to properly identify the pixels that belong to the same road and use this information to recover the whole road network. This feature is invariable to the shape and direction of roads and tolerates heavy noise and disturbances. Road extraction based on reference circles is much more noise tolerant and flexible than the previous edge-detection based algorithms. The scheme is able to extract roads reliably from images with complex contents and heavy obstructions, such as the high resolution aerial/satellite images available from Google maps.
Abstract: XML files contain data which is in well formatted manner. By studying the format or semantics of the grammar it will be helpful for fast retrieval of the data. There are many algorithms which describes about searching the data from XML files. There are no. of approaches which uses data structure or are related to the contents of the document. In these cases user must know about the structure of the document and information retrieval techniques using NLPs is related to content of the document. Hence the result may be irrelevant or not so successful and may take more time to search.. This paper presents fast XML retrieval techniques by using new indexing technique and the concept of RXML. When indexing an XML document, the system takes into account both the document content and the document structure and assigns the value to each tag from file. To query the system, a user is not constrained about fixed format of query.
Abstract: Groundwater is one of the most important water
resources in Fars province. Based on this study, 95 percent of the
total annual water consumption in Fars is used for agriculture,
whereas the percentages for domestic and industrial uses are 4 and 1
percent, respectively. Population growth, urban and industrial
growth, and agricultural development in Fars have created a
condition of water stress. In this province, farmers and other users are
pumping groundwater faster than its natural replenishment rate,
causing a continuous drop in groundwater tables and depletion of this
resource. In this research variation of groundwater level, their effects
and ways to help control groundwater levels in aquifer of the Niriz
plains in Fars plain were evaluated .Excessive exploitation of
groundwater in this aquifer caused the groundwater levels fall too
fast or to unacceptable levels. The average drawdown of the
groundwater level in this plain were 9.1 meters during 1997 to
2004. The purpose of this study is to evaluate water level changes in
the Niriz Aquifer in the Fars province in order to determine the areas
of greatest depletion, the cause of depletion, and predict the
remaining life of the aquifer.
Abstract: Climate change is a phenomenon has been based on
the available evidence from a very long time ago and now its
existence is very probable. The speed and nature of climate
parameters changes at the middle of twentieth century has been
different and its quickness more than the before and its trend changed
to some extent comparing to the past. Climate change issue now
regarded as not only one of the most common scientific topic but also
a social political one, is not a new issue. Climate change is a
complicated atmospheric oceanic phenomenon on a global scale and
long-term. Precipitation pattern change, fast decrease of snowcovered
resources and its rapid melting, increased evaporation, the
occurrence of destroying floods, water shortage crisis, severe
reduction at the rate of harvesting agricultural products and, so on are
all the significant of climate change. To cope with this phenomenon,
its consequences and events in which public instruction is the most
important but it may be climate that no significant cant and effective
action has been done so far. The present article is included a part of
one surrey about climate change in Fars. The study area having
annually mean temperature 14 and precipitation 320 mm .23 stations
inside the basin with a common 37 year statistical period have been
applied to the meteorology data (1974-2010). Man-kendal and
change factor methods are two statistical methods, applying them, the
trend of changes and the annual mean average temperature and the
annual minimum mean temperature were studied by using them.
Based on time series for each parameter, the annual mean average
temperature and the mean of annual maximum temperature have a
rising trend so that this trend is clearer to the mean of annual
maximum temperature.
Abstract: In this paper, study on carbonation process of several types of advanced plasters on lime basis is presented. The movement of carbonation head was measured by colorimetric method using phenolphtalein. The rate of carbonation was accessed also by gravimetric method. Samples of studied materials were placed into the climatic chamber for simulation of environment with high concentration of CO2. The particular samples were on all lateral sides and on the bottom side provided by epoxy resin in order to arrange 1-D transport of CO2 into the studied samples. The carbonation rates of particular materials pointed to the time dependence of diffusion process of CO2 for all the studied plasters. From the quantitative point of view, the carbonation of advanced modified plasters was much faster than for the reference lime plaster, what is beneficial for the practical application of the tested newly developed materials.
Abstract: The paper presents the applications of artificial
intelligence technique called adaptive tabu search to design the
controller of a buck converter. The averaging model derived from the
DQ and generalized state-space averaging methods is applied to
simulate the system during a searching process. The simulations
using such averaging model require the faster computational time
compared with that of the full topology model from the software
packages. The reported model is suitable for the work in the paper in
which the repeating calculation is needed for searching the best
solution. The results will show that the proposed design technique
can provide the better output waveforms compared with those
designed from the classical method.
Abstract: Realistic 3D face model is desired in various
applications such as face recognition, games, avatars, animations, and
etc. Construction of 3D face model is composed of 1) building a face
shape model and 2) rendering the face shape model. Thus, building a
realistic 3D face shape model is an essential step for realistic 3D face
model. Recently, 3D morphable model is successfully introduced to
deal with the various human face shapes. 3D dense correspondence
problem should be precedently resolved for constructing a realistic 3D
dense morphable face shape model. Several approaches to 3D dense
correspondence problem in 3D face modeling have been proposed
previously, and among them optical flow based algorithms and TPS
(Thin Plate Spline) based algorithms are representative. Optical flow
based algorithms require texture information of faces, which is
sensitive to variation of illumination. In TPS based algorithms
proposed so far, TPS process is performed on the 2D projection
representation in cylindrical coordinates of the 3D face data, not
directly on the 3D face data and thus errors due to distortion in data
during 2D TPS process may be inevitable.
In this paper, we propose a new 3D dense correspondence algorithm
for 3D dense morphable face shape modeling. The proposed algorithm
does not need texture information and applies TPS directly on 3D face
data. Through construction procedures, it is observed that the proposed
algorithm constructs realistic 3D face morphable model reliably and
fast.
Abstract: This paper describes dynamic analysis using proposed
fast finite element method for a shock absorbing structure including a
sponge. The structure is supported by nonlinear concentrated springs.
The restoring force of the spring has cubic nonlinearity and linear
hysteresis damping. To calculate damping properties for the structures
including elastic body and porous body, displacement vectors as
common unknown variable are solved under coupled condition. Under
small amplitude, we apply asymptotic method to complex eigenvalue
problem of this system to obtain modal parameters. And then
expressions of modal loss factor are derived approximately. This
approach was proposed by one of the authors previously. We call this
method as Modal Strain and Kinetic Energy Method (MSKE method).
Further, using the modal loss factors, the discretized equations in
physical coordinate are transformed into the nonlinear ordinary
coupled equations using normal coordinate corresponding to linear
natural modes. This transformation yields computation efficiency. As
a numerical example of a shock absorbing structures, we adopt double
skins with a sponge. The double skins are supported by nonlinear
concentrated springs. We clarify influences of amplitude of the input
force on nonlinear and chaotic responses.
Abstract: H.264/AVC offers a considerably higher improvement
in coding efficiency compared to other compression standards such
as MPEG-2, but computational complexity is increased significantly.
In this paper, we propose selective mode decision schemes for fast
intra prediction mode selection. The objective is to reduce the
computational complexity of the H.264/AVC encoder without
significant rate-distortion performance degradation. In our proposed
schemes, the intra prediction complexity is reduced by limiting the
luma and chroma prediction modes using the directional information
of the 16×16 prediction mode. Experimental results are presented to
show that the proposed schemes reduce the complexity by up to 78%
maintaining the similar PSNR quality with about 1.46% bit rate
increase in average.
Abstract: The approaches to make an agent generate intelligent actions in the AI field might be roughly categorized into two ways–the classical planning and situated action system. It is well known that each system have its own strength and weakness. However, each system also has its own application field. In particular, most of situated action systems do not directly deal with the logical problem. This paper first briefly mentions the novel action generator to situatedly extract a set of actions, which is likely to help to achieve the goal at the current situation in the relaxed logical space. After performing the action set, the agent should recognize the situation for deciding the next likely action set. However, since the extracted action is an approximation of the action which helps to achieve the goal, the agent could be caught into the deadlock of the problem. This paper proposes the newly developed hybrid architecture to solve the problem, which combines the novel situated action generator with the conventional planner. The empirical result in some planning domains shows that the quality of the resultant path to the goal is mostly acceptable as well as deriving the fast response time, and suggests the correlation between the structure of problems and the organization of each system which generates the action.
Abstract: This paper presents a design method of self-tuning
Quantitative Feedback Theory (QFT) by using improved deadbeat
control algorithm. QFT is a technique to achieve robust control with
pre-defined specifications whereas deadbeat is an algorithm that
could bring the output to steady state with minimum step size.
Nevertheless, usually there are large peaks in the deadbeat response.
By integrating QFT specifications into deadbeat algorithm, the large
peaks could be tolerated. On the other hand, emerging QFT with
adaptive element will produce a robust controller with wider
coverage of uncertainty. By combining QFT-based deadbeat
algorithm and adaptive element, superior controller that is called selftuning
QFT-based deadbeat controller could be achieved. The output
response that is fast, robust and adaptive is expected. Using a grain
dryer plant model as a pilot case-study, the performance of the
proposed method has been evaluated and analyzed. Grain drying
process is very complex with highly nonlinear behaviour, long delay,
affected by environmental changes and affected by disturbances.
Performance comparisons have been performed between the
proposed self-tuning QFT-based deadbeat, standard QFT and
standard dead-beat controllers. The efficiency of the self-tuning QFTbased
dead-beat controller has been proven from the tests results in
terms of controller’s parameters are updated online, less percentage
of overshoot and settling time especially when there are variations in
the plant.
Abstract: In this paper, genetic algorithm (GA) is proposed for
the design of an optimization algorithm to achieve the bandwidth
allocation of ATM network. In Broadband ISDN, the ATM is a highbandwidth;
fast packet switching and multiplexing technique. Using
ATM it can be flexibly reconfigure the network and reassign the
bandwidth to meet the requirements of all types of services. By
dynamically routing the traffic and adjusting the bandwidth
assignment, the average packet delay of the whole network can be
reduced to a minimum. M/M/1 model can be used to analyze the
performance.
Abstract: Positron emission particle tracking (PEPT) is a
technique in which a single radioactive tracer particle can be
accurately tracked as it moves. A limitation of PET is that in order to
reconstruct a tomographic image it is necessary to acquire a large
volume of data (millions of events), so it is difficult to study rapidly
changing systems. By considering this fact, PEPT is a very fast
process compared with PET.
In PEPT detecting both photons defines a line and the annihilation
is assumed to have occurred somewhere along this line. The location
of the tracer can be determined to within a few mm from coincident
detection of a small number of pairs of back-to-back gamma rays and
using triangulation. This can be achieved many times per second and
the track of a moving particle can be reliably followed. This
technique was invented at the University of Birmingham [1].
The attempt in PEPT is not to form an image of the tracer particle
but simply to determine its location with time. If this tracer is
followed for a long enough period within a closed, circulating system
it explores all possible types of motion.
The application of PEPT to industrial process systems carried out
at the University of Birmingham is categorized in two subjects: the
behaviour of granular materials and viscous fluids. Granular
materials are processed in industry for example in the manufacture of
pharmaceuticals, ceramics, food, polymers and PEPT has been used
in a number of ways to study the behaviour of these systems [2].
PEPT allows the possibility of tracking a single particle within the
bed [3]. Also PEPT has been used for studying systems such as: fluid
flow, viscous fluids in mixers [4], using a neutrally-buoyant tracer
particle [5].
Abstract: Automatic detection of bleeding is of practical
importance since capsule endoscopy produces an extremely large
number of images. Algorithm development of bleeding detection in
the digestive tract is difficult due to different contrasts among the
images, food dregs, secretion and others. In this study, were assigned
weighting factors derived from the independent features of the
contrast and brightness between bleeding and normality. Spectral
analysis based on weighting factors was fast and accurate. Results
were a sensitivity of 87% and a specificity of 90% when the accuracy
was determined for each pixel out of 42 endoscope images.
Abstract: In this paper we present a technique to speed up
ICA based on the idea of reducing the dimensionality of the data
set preserving the quality of the results. In particular we refer to
FastICA algorithm which uses the Kurtosis as statistical property
to be maximized. By performing a particular Johnson-Lindenstrauss
like projection of the data set, we find the minimum dimensionality
reduction rate ¤ü, defined as the ratio between the size k of the reduced
space and the original one d, which guarantees a narrow confidence
interval of such estimator with high confidence level. The derived
dimensionality reduction rate depends on a system control parameter
β easily computed a priori on the basis of the observations only.
Extensive simulations have been done on different sets of real world
signals. They show that actually the dimensionality reduction is very
high, it preserves the quality of the decomposition and impressively
speeds up FastICA. On the other hand, a set of signals, on which the
estimated reduction rate is greater than 1, exhibits bad decomposition
results if reduced, thus validating the reliability of the parameter β.
We are confident that our method will lead to a better approach to
real time applications.
Abstract: Video sensor networks operate on stringent requirements
of latency. Packets have a deadline within which they have
to be delivered. Violation of the deadline causes a packet to be
treated as lost and the loss of packets ultimately affects the quality
of the application. Network latency is typically a function of many
interacting components. In this paper, we propose ways of reducing
the forwarding latency of a packet at intermediate nodes. The
forwarding latency is caused by a combination of processing delay
and queueing delay. The former is incurred in order to determine the
next hop in dynamic routing. We show that unless link failures in a
very specific and unlikely pattern, a vast majority of these lookups
are redundant. To counter this we propose source routing as the
routing strategy. However, source routing suffers from issues related
to scalability and being impervious to network dynamics. We propose
solutions to counter these and show that source routing is definitely
a viable option in practical sized video networks. We also propose a
fast and fair packet scheduling algorithm that reduces queueing delay
at the nodes. We support our claims through extensive simulation on
realistic topologies with practical traffic loads and failure patterns.