<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress.com" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>

<channel>
	<title>intelligent-system &amp;laquo; WordPress.com Tag Feed</title>
	<link>http://en.wordpress.com/tag/intelligent-system/</link>
	<description>Feed of posts on WordPress.com tagged "intelligent-system"</description>
	<pubDate>Thu, 03 Dec 2009 19:22:47 +0000</pubDate>

	<generator>http://en.wordpress.com/tags/</generator>
	<language>en</language>

<item>
<title><![CDATA[Hybrid Multi-Agent A.I. for Tactical Games]]></title>
<link>http://jestermax.wordpress.com/2009/11/18/hybrid-multi-agent-a-i-for-tactical-games/</link>
<pubDate>Thu, 19 Nov 2009 00:21:06 +0000</pubDate>
<dc:creator>jestermax</dc:creator>
<guid>http://jestermax.wordpress.com/2009/11/18/hybrid-multi-agent-a-i-for-tactical-games/</guid>
<description><![CDATA[As part of my Intelligent Systems course in my Masters program, I am working on a project that joins]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>As part of my Intelligent Systems course in my Masters program, I am working on a project that joins two intelligent systems together. I won&#8217;t post many of the finer details of the project (check out my conference paper once I get around to writing it), but it is a rule-based and genetic algorithm hybrid.</p>
<p>The idea here is not create a &#8220;super-agent&#8221; that can win at games, but more to simulate personality in NPC characters. I&#8217;ve yet to generate a decent set of experiment results, but things are looking good so far. I have my test software written and I&#8217;m about to add my genetic algorithm library to the project to see what happens.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Environment control strategy using Neural Network control for moss]]></title>
<link>http://samuraielit.wordpress.com/2008/12/06/environment-control-strategy-using-neural-network-control-for-moss/</link>
<pubDate>Sat, 06 Dec 2008 05:10:25 +0000</pubDate>
<dc:creator>samuraielit</dc:creator>
<guid>http://samuraielit.wordpress.com/2008/12/06/environment-control-strategy-using-neural-network-control-for-moss/</guid>
<description><![CDATA[This is a model of environmental control strategies based on plant responses using intelligent machi]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><blockquote>
<p style="text-align:justify;">This is a model of environmental control strategies based on plant responses using intelligent machine vision technique. <!--more--></p>
</blockquote>
<p style="text-align:justify;">Neural network was used to identify the relationship between plant moisture content and image features. Sunagoke moss water content prediction using relevant feature selection can also be applied as environmental control based on plant response. The figure below shows the neural network control system with a bio-feed back loop containing another neural network which converts the pictorial information into moss water content. The vegetative system is the controlled system which controlled variable is the moss water content. The control element of this system is the environment surrounding the plant with which the control inputs are temperature, humidity, CO2 concentration, water and light intensity.</p>
<p style="text-align:justify;"><img class="alignnone size-full wp-image-218" title="nn-control" src="http://samuraielit.wordpress.com/files/2008/12/nn-control.jpg" alt="nn-control" width="455" height="297" /></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Neural Network based Irrigation System for Sunagoke Moss]]></title>
<link>http://samuraielit.wordpress.com/2008/11/28/neural-network-based-irrigation-system-for-sunagoke-moss/</link>
<pubDate>Fri, 28 Nov 2008 06:36:37 +0000</pubDate>
<dc:creator>samuraielit</dc:creator>
<guid>http://samuraielit.wordpress.com/2008/11/28/neural-network-based-irrigation-system-for-sunagoke-moss/</guid>
<description><![CDATA[Substantial increases in yield could be possible if irrigation water was applied at the most appropr]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><blockquote>
<p style="text-align:justify;">Substantial increases in yield could be possible if irrigation water was applied at the most appropriate time and accurate amount of water to prevent excessive drought stress.<!--more--></p>
</blockquote>
<p style="text-align:justify;">With the increase in the cost of energy required to pump and move water to desired locations, coupled with the decrease of available water for irrigation, it is essential to attain the maximum benefit from each quantity of water used for irrigation. Plant drought stress detection is thus of great importance.</p>
<p style="text-align:justify;">Efficient control of water delivery to crops optimizes production quality while minimizing inputs to the system. Over-watering crops not only wastes water, it also leads to higher expenses in pumping energy, heat energy to dry the environment, and disease and pest treatments required due to damp conditions. Accurate water management in controlled-environment crop production is accomplished by irrigation when necessary and in the correct quantity.</p>
<p style="text-align:justify;">Human visual assessment of crop stress is qualitative at best, with the terms &#8220;good&#8221; or &#8220;poor&#8221; frequently used to describe crop condition. To improve the monitoring and irrigation process, automatic monitoring and quantitative describing of plant water content are necessary. Computer-controlled irrigation systems can utilize a range of data to achieve accurate delivery of water according to crop requirements. Automated control systems that use timers, supply-based measurements of water or demand-based models of expected water use do not attempt to measure the actual water content of the plants they serve. A more accurate control system would use the plant status as feedback for controlling the growth environment and irrigation. Hashimoto et al (1985) developed measurement and instrumentation in greenhouse to investigate ways to use the crop as a feedback for greenhouse control systems with the &#8220;speaking plant&#8221; approach.</p>
<p style="text-align:justify;">At present, because of the advances in electronic technology, machine vision can be applied to research on the development of an automatic prediction. Machine vision enables to handle a large amount of raw data and perform remote prediction. On the other hand, there are conventional image recognition methods such as statistical method and logical method of computation. However, they are not suitable for determining the water content in Sunagoke moss because of the complexity and ambiguity involved.</p>
<p style="text-align:justify;">Sunagoke moss is a biological product. Although Sunagoke moss may be cultivated in the same way, their shape, size, color and other characteristics are different, therefore it has various patterns in ET. Using machine vision to evaluate the water content of Sunagoke moss and extraction of image features become an important element because the water content of Sunagoke moss does not follow quantitative rules. It is important that a machine vision prediction system has learning process functions. Such a system enables to overcome the weakness of traditional type systems. Therefore, the researchers have developed an advanced prediction system using machine vision, involving image processing, image feature extraction, neural network and computer technologies.</p>
<p style="text-align:justify;">The model study as shown in figure 1 including: analyzing water content using weight measurement, image acquisition using digital camera, image processing and image analysis, feature extraction to extract color, morphology and textural features and the last is feature selection. The outputs of feature selection are selected subset of features and neural network (NN) weight that can be applied for neural network based irrigation.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/irr-01.jpg"><img class="size-full wp-image-203 aligncenter" title="irr-01" src="http://samuraielit.wordpress.com/files/2008/11/irr-01.jpg" alt="irr-01" width="455" height="310" /></a></p>
<p style="text-align:center;"><strong>Fig. 1</strong> <strong>Model study of neural-network-based irrigation system</strong></p>
<p style="text-align:justify;">If the relevant features have already selected, and optimum NN-weights have been determined, the flowchart of the prediction system software is shown in figure 2. The system can estimate water content according to their image features using the learned standard pattern. This software displays learning and prediction components as follows:</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/irr-02.jpg"><img class="size-full wp-image-204 aligncenter" title="irr-02" src="http://samuraielit.wordpress.com/files/2008/11/irr-02.jpg" alt="irr-02" width="199" height="409" /></a></p>
<p style="text-align:center;"><strong>Fig. 2</strong> <strong>Flowchart of machine vision prediction system software</strong></p>
<p style="text-align:justify;">The proposed irrigation control design of Sunagoke moss is illustrated in figure 3. Pictorial information from Sunagoke moss (selected features from Feature Selection) can be utilized as the input of Back-propagation Neural Network (BPNN) to detect dry area and the output is the amount lack of water. The water sprayer will irrigate the dry part of Sunagoke moss in accurate places and accurate amount of water. The decrement of dry area and optimum water condition can bring Sunagoke moss into optimum photosynthesis process. The main objective of this precision irrigation system is to optimize the water supply of Sunagoke moss and stabilize the amount of water content between 2 gg<sup>-1</sup> and 2.5 gg<sup>-1</sup>.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/irr-03.jpg"><img class="size-full wp-image-205 aligncenter" title="irr-03" src="http://samuraielit.wordpress.com/files/2008/11/irr-03.jpg" alt="irr-03" width="455" height="283" /></a></p>
<p style="text-align:center;"><strong>Fig. 3</strong> <strong>Proposed irrigation control design for Sunagoke moss</strong></p>
<p style="text-align:justify;">Water content has relation with optimum photosynthesis. Therefore, if we can determine part of area which is lack of water through positioning (coordinate system), then we can automatically give appropriate water at that precise area, so the decrement of dry area can bring Sunagoke moss into optimum photosynthesis process. Figure 4 shows the structure/design of NN-based irrigation system for Sunagoke moss which will be applied for Sunagoke moss cultivation in tunnel.</p>
<p style="text-align:center;"><strong><a href="http://samuraielit.wordpress.com/files/2008/11/moss-image-tunnel2.jpg"><img class="size-full wp-image-206 aligncenter" title="moss-image-tunnel2" src="http://samuraielit.wordpress.com/files/2008/11/moss-image-tunnel2.jpg" alt="moss-image-tunnel2" width="400" height="280" /></a></strong></p>
<p style="text-align:center;"><strong>Fig. 4 General design of NN-based Irrigation system for Sunagoke Moss</strong></p>
<p style="text-align:justify;"><strong><br />
</strong></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Feature selection for Moss water content prediction using Genetic-Neural Algorithm]]></title>
<link>http://samuraielit.wordpress.com/2008/11/28/feature-selection-fs-for-predicting-moss-water-content-using-genetic-neural-algorithm/</link>
<pubDate>Fri, 28 Nov 2008 02:24:01 +0000</pubDate>
<dc:creator>samuraielit</dc:creator>
<guid>http://samuraielit.wordpress.com/2008/11/28/feature-selection-fs-for-predicting-moss-water-content-using-genetic-neural-algorithm/</guid>
<description><![CDATA[In Genetic-neural algorithm methods, a search procedure in the space of possible feature subsets is ]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><blockquote>
<p style="text-align:justify;">In Genetic-neural algorithm methods, a search procedure in the space of possible feature subsets is defined, and various subsets of features are generated and evaluated. <!--more--></p>
</blockquote>
<p style="text-align:justify;">In wrapper methods, the evaluation of a specific subset of features is obtained by training and testing a specific classification/prediction model, rendering this approach tailored to a specific classification/prediction algorithm. To search the space of all feature subsets, a search algorithm is then wrapped around the classification/prediction model. However, as the space of feature subsets grows exponentially with the number of features, heuristic search methods are used to guide the search for an optimal subset. These search methods can be divided in two classes: deterministic and randomized search algorithms. In the wrapper approach proposed by Kohavi and John (1997), the feature subset selection algorithm exists as a wrapper around the induction algorithm. The feature subset selection algorithm conducts a search for a good subset using the induction algorithm itself as part of the function evaluating feature subsets. The idea behind the wrapper approach, shown in figure 1, is simple: the induction algorithm is considered as a black box. The induction algorithm is run on the data-set, usually partitioned into internal training and holdout sets, with different sets of features removed from the data. The feature subset with the highest estimated value is chosen as the final set on which to run the induction algorithm. The resulting classifier is then evaluated on an independent test set that was not used during the search.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/wr-01.jpg"><img class="size-full wp-image-191 aligncenter" title="wr-01" src="http://samuraielit.wordpress.com/files/2008/11/wr-01.jpg" alt="wr-01" width="455" height="180" /></a></p>
<p><strong>Fig.1  The wrapper approach to feature subset selection. The induction algorithm is used as a black box by the subset selection algorithm.</strong></p>
<p style="text-align:justify;">Advantages of wrapper approaches include the interaction between feature subset search and model selection, and the ability to take into account feature dependencies. A common disadvantage of these techniques is that they have a higher risk of over fitting than filter techniques and are very computationally intensive.<br />
Genetic Algorithms (GAs) are search algorithms based on the mechanics of natural selection and natural genetics (Goldberg, 1997).  GA are different from more normal optimization and search procedures in four ways: (1) GAs work with a coding of the parameter set, not the parameters themselves; (2) GAs search from a population of points, not a single point; (3) GAs use payoff (objective function) information, not derivatives or other auxiliary knowledge; and (4) GAs use probabilistic transition rules, not deterministic rules.<br />
Genetic algorithms are adaptive search techniques based on the principles of natural selection in biology. The GAs are stochastic global search methods that mimic the metaphor of natural biological evolution. They employ a population of competing solutions evolved over time to converge to an optimal solution. Effectively, the solution space is searched in parallel, which helps in avoiding local optima. For feature selection, a solution is typically a fixed length binary string representing a feature subset the value of each position in the string represents the presence or absence of a particular feature. The algorithm is an iterative process where each successive generation is produced by applying genetic operators such as crossover and mutation to the members of the current generation. Mutation changes some of the values (thus adding or deleting features) in a subset randomly. Crossover combines different features from a pair of subsets into a new subset. The application of genetic operators to population members is determined by their fitness (how good a feature subset is with respect to an evaluation strategy). Better feature subsets have a greater chance of being selected to form a new subset through crossover or mutation. In this manner, good subsets are &#8220;evolved&#8221; over time.</p>
<p style="text-align:justify;">A typical series of operations carried out when implementing a GAs paradigm is:<br />
•	Initialize the population;<br />
•	Calculate fitness for each chromosome in population;<br />
•	Reproduce selected chromosomes to form a new population;<br />
•	Perform crossover and mutation on the population;<br />
•	Loop to second step until some condition is met.</p>
<p style="text-align:justify;">Initialization of the population is commonly done by seeding the population with random values. The fitness value is proportional to the performance measurement of the function being optimized. The calculation of fitness values is conceptually simple. It can, however, be quite complex to implement in a way that optimizes the efficiency of the GAs search of the problem space. It is this fitness that guides the search of the problem space. After fitness calculation, the next step is reproduction. Reproduction comprises forming a new population, usually with the same total number of chromosomes, by selecting from members of the current population using a stochastic process that is weighted by each of their fitness values. The higher the fitness, the more likely it is that the chromosome will be selected for the new generation. One commonly used way is a roulette wheel procedure that assigns a portion of a roulette wheel to each population member where the size of the portion is proportional to the fitness value. This procedure is often combined with the elitist strategy, which ensures that the chromosome with the highest fitness is always copied into the next generation. The next operation is called crossover. To many evolutionary computation practitioners, crossover is what distinguishes GAs from other evolutionary computation paradigms. Crossover is the process of exchanging portions of the strings of two ‘‘parent&#8221; chromosomes. An overall probability is assigned to the crossover process, which is the probability that given two parents, the crossover process will occur. This probability is often in the range of 0.65-0.80. The final operation in the typical GAs procedure is mutation. Mutation consists of changing an element&#8217;s value at random, often with a constant probability for each element in the population. The probability of mutation can vary widely according to the application and the preference of the person exercising the GAs. However, values of between 0.001 and 0.01 are not unusual for mutation probability.</p>
<p style="text-align:justify;">In this research, a combined genetic-neural algorithm was developed for FS based on the neural network pattern recognition. We have extracted 50 features including: color (RGB and Grey level), morphological features (green area, perimeter and browning index) and textural features. Each individual in the population represents a candidate solution to the feature subset selection problem. There were (2<sup>50</sup>-1) possible feature subsets. The values of the  Back-propagation Neural Network (BPNN) inputs were the normalized image features that are between 0 and 1. One hidden layer (20 nodes) was used in BPNN. One output of BPNN was used to determine Sunagoke moss water content. The number of data have been used in BPNN were 124 image data with 10% data as testing set. The selected features are the inputs of the BPNN, which are used for water content prediction. In GAs for Feature Selection (FS) involves many generations. In each generation, evaluation of an individual (a feature subset) involves training neural networks. In this step, a binary vector of dimension 50 represents the individual in the population. The chromosome define contains 50 genes, one gene for each feature, which can take 2 values. A value of 0 indicates that the corresponding feature is not selected, while a value 1 means that the feature is selected. An initial population of chromosomes is randomly generated. Crossover was performed by 2 points real value crossover. Two points were selected randomly. Mutation process was also conducted randomly. Some best chromosomes were kept to be used in the next generation. Looping process was done until the fitness function converged to find best feature subset. The roulette wheel selection strategy was also used in the algorithm for FS. The parameter settings were: population size: 50; probability of best chromosomes: 0.2; probability of crossover: 0.8; probability of mutation: 0.01 and number of generation was developed until the fitness function converged. The fitness of the chromosome was calculated according to the prediction rate of the selected subset of features for predicting Sunagoke moss water content, as it is shown in figure 2.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/wr-02.jpg"><img class="size-full wp-image-192 aligncenter" title="wr-02" src="http://samuraielit.wordpress.com/files/2008/11/wr-02.jpg" alt="wr-02" width="455" height="321" /></a></p>
<p style="text-align:center;"><strong>Fig.2 Feature selection using combined genetic-neural algorithm.</strong></p>
<p><strong>Comparison between Filter and Wrapper Methods</strong></p>
<p style="text-align:justify;">We have investigated both filter and wrapper methods for feature selection. The research was conducted by the prediction rate based on testing set to calculate the fitness for reproduction of GAs. The number of hidden layer (1 hidden layer) and hidden nodes (20 nodes) were determined to be effectively used in BPNN structures to achieve the best prediction of water content. The results of FS are described as following. First of all, in most cases, the accuracy of prediction performance using five proposed FS method were greatly improved. It was shown in table 1 that there were some improvements in case of number of features used and the prediction error between methods using FS and method without FS.</p>
<p style="text-align:justify;">Among the filter methods, <em>Chi-Squared (X<sup>2</sup></em>) method got the highest performance for prediction with the validation error 0.009 and 31 features selected followed by Mutual Information (MI) with validation error 0.018 and 35 features selected. Corelation-based Feature Selection (CFS) and Linear Regression (LR) reached the minimum validation error approximately 0.023 and 0.020 and number of features selected 10 and 30 respectively.</p>
<p style="text-align:justify;">Overall the results, the experiments which were conducted using filter method, the results were much worse than using wrapper method (genetic-neural algorithm). Genetic-neural algorithm performed better compare to filter method with reliable improvement value of 76.6%. When analyzing the results of the genetic-neural algorithm, it is noticed that the lowest prediction testing error (MSE: 0.0021) was achieved by BPNN with a few sets of selected features (27 features). GAs shows that the fitness function converged after 120 generations using 50 populations in each generation. Fig. 4 shows the frequency selected for each relevant feature in every generation. There were nine most selected features with the frequency selected rate above 90%. The most contributed features to predict water content were: grey energy with frequency selected 100%, green/red ratio variance (98.2%), blue inverse difference moment (97.1%), red correlation (96.9%), red mean value (95.7%), red cluster tendency (93%), blue homogeneity (91.2%), green entropy (91.1%) and grey variance (90.6%). Genetic-neural algorithm has successfully selected relevant image features to determine water content of Sunagoke moss.</p>
<p style="text-align:center;"><strong>Table 1</strong>. <strong>Comparison analysis of five feature selection methods.</strong></p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/wr-03.jpg"><img class="size-full wp-image-193 aligncenter" title="wr-03" src="http://samuraielit.wordpress.com/files/2008/11/wr-03.jpg" alt="wr-03" width="455" height="223" /></a></p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/wr-04.jpg"><img class="size-full wp-image-194 aligncenter" title="wr-04" src="http://samuraielit.wordpress.com/files/2008/11/wr-04.jpg" alt="wr-04" width="455" height="320" /></a></p>
<p style="text-align:center;"><strong>Fig. 3 </strong> <strong>Fitness functions of genetic algorithm for feature selection.</strong></p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/wr-05.jpg"><img class="size-full wp-image-195 aligncenter" title="wr-05" src="http://samuraielit.wordpress.com/files/2008/11/wr-05.jpg" alt="wr-05" width="455" height="489" /></a></p>
<p style="text-align:center;"><strong>Fig. 4 </strong> <strong>The selection rate of every selected feature.</strong></p>
<p>If you want to know more about How this genetic-neural algorithm works, you can download PPT file <a href="http://www.ziddu.com/download/2776730/genetic-neural.ppt.html">HERE</a>.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[ASABE Annual International Meeting, Rhode Island, USA (2008)]]></title>
<link>http://samuraielit.wordpress.com/2008/11/27/asabe-annual-international-meeting-rhode-island-usa-2008/</link>
<pubDate>Thu, 27 Nov 2008 13:56:11 +0000</pubDate>
<dc:creator>samuraielit</dc:creator>
<guid>http://samuraielit.wordpress.com/2008/11/27/asabe-annual-international-meeting-rhode-island-usa-2008/</guid>
<description><![CDATA[Providence is one of the oldest cities in America and it has the architecture to prove. It has a lar]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><blockquote>
<p style="text-align:justify;">Providence is one of the oldest cities in America and it has the architecture to prove. It has a larger percentage of buildings on the National Historic Register than any other U.S. city, with scores of immaculately preserved Colonial, Federal, Greek Revival and Victorian homes and buildings.<!--more--></p>
</blockquote>
<p style="text-align:justify;">Story was begun when I arrived at Detroit Wayne County Airport Michigan, as usual, maybe because of &#8220;my name&#8221;, I should go to interrogation room again&#8230;(once more Again!!), and the immigration officer started to take my promise that I would do nothing bad in &#8220;their&#8221; country&#8230;.what a nice guy and polite officer, but let&#8217;s forget it. It&#8217;s only a matter of &#8220;culture&#8221;. But this time I have prepared by arranging my flight schedule to Providence a little bit longer because I already know that I will be in Interrogation room again.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ri-01.jpg"><img class="size-full wp-image-180 aligncenter" title="ri-01" src="http://samuraielit.wordpress.com/files/2008/11/ri-01.jpg" alt="ri-01" width="400" height="300" /></a></p>
<p style="text-align:center;"><strong>Detroit Wayne County Airport Michigan</strong></p>
<p style="text-align:justify;">The ASABE conference was held in Rhode Island Convention Center starting form June 28th until July 2nd.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ri-02.jpg"><img class="size-full wp-image-181 aligncenter" title="ri-02" src="http://samuraielit.wordpress.com/files/2008/11/ri-02.jpg" alt="ri-02" width="300" height="400" /></a></p>
<p style="text-align:center;"><strong>Rhode Island Convention Center</strong></p>
<p style="text-align:justify;">The Techincal Session including:</p>
<ol>
<li>Pesticide Application technologies</li>
<li>Biomass-Harvesting, storage, transporting, economic considerations and producers sustainability</li>
<li>Advances in soil dynamics</li>
<li>Development and performance of yield monitors</li>
<li>Soil erosion</li>
<li>Advances in soil and water engineering</li>
<li>Advance of numerical methods in food and process engineers</li>
<li>Wireless networks and applications</li>
<li>Bioimaging and machine vision for food safety, quality and processing</li>
<li>Air pollutant measurement and control from animal operations</li>
<li>Innovative energy strategies for controlled environments</li>
<li>Agricultural waste management</li>
<li>Ergonomics safety and health division</li>
<li>Sensing and Automation in food processing</li>
<li>Ethanol and biodiesel industry process improvement</li>
<li>biomass feedstock engineering issues</li>
<li>Emerging technologies in food processing</li>
<li>Physical properties of agricultural materials in relation to processing</li>
<li>Market-based approach to ecosystem management</li>
<li>Innovations in undergraduate and graduate education</li>
<li>Engineering technology and standards for developing countries</li>
<li>New development in cultural practices</li>
<li>Management tools for agricultural systems</li>
<li>Automated guidance of agricultural vehicles</li>
<li>Statistical techniques in hydrology</li>
<li>streambank erosion-processes and modeling</li>
<li>Soil erosion research</li>
<li>Soil erosion on non-agricultural lands</li>
<li>Advances in remote sensing applications for ET estimation and mapping</li>
<li>Advances in instrumentation and control</li>
<li>Advances in machine vision techniques</li>
<li>Structures and environment</li>
<li>Emerging technologies for agricultural safety and health</li>
<li>Food and process engineering</li>
<li>Emerging fermentation and purification technologies</li>
<li>Challenges in lignocellulosic conversion</li>
<li>Biological engineering</li>
<li>Forest based biomass: harvesting, processing, transport and storage</li>
<li>Power and machinery</li>
<li>Climate forecast for water resources decision support</li>
<li>modeling and evaluation of conservation practice</li>
<li><strong>Precision irrigation</strong></li>
<li>Micro/subsurface drip irrigation</li>
<li>Information and electrical technologies</li>
<li>Bulk solids and biomass storage systems</li>
<li>Animal responses to environmental factors</li>
<li>Greenhouse and nursery technology applications</li>
<li>Air Quality modeling</li>
<li>Nitrogen and phosphorus management for manure and litter</li>
<li>Food and safety engineering</li>
<li>Biofuel thermal-process development research</li>
<li>Drying and processing crops</li>
<li>Advances in multispectral and hyperspectral properties in food and agricultural products</li>
<li>Ethanol development research</li>
<li>Physical and chemical properties of biresource products and co-products</li>
<li>Bioenergy</li>
<li>Pesticide application technologies</li>
<li>State of the art on-the-go soil strength measurement</li>
<li>Spectral sensing for precision agriculture</li>
<li>Geospatial technologies for management decision making</li>
<li>Objective evaluation of hydrologic model</li>
<li>Watershed-scale nutrient cycling and sediment transport</li>
<li>Drainage research</li>
<li>Advances in irrigation</li>
<li>Sensors for automation and biorobotics</li>
<li>Air quality as related to agricultural waste management</li>
<li>Agri-industrial facility design and operation</li>
<li>Environment control for animal facilities</li>
<li>Advances and applications of nondestructive testing of agricultural and food products</li>
<li>Microwave and radio frequency heating in agricultural and food processing</li>
<li>Handling and storage of coproducts for energy and grains</li>
<li>Application of ecological engineering</li>
<li>Agricultural system modeling</li>
<li>Advances in cotton engineering</li>
<li>Fruit and vegetable engineering</li>
<li>Drainage and water quality</li>
<li>Irrigation management</li>
<li>Hydrology and biogeochemical process and modeling challenges in forest ecosystems</li>
<li>Hyperspectral and multispectral imaging</li>
<li>Heat and power generation from solar, wind, geothermal and other renewable energy systems</li>
<li>Water management and manure treatment on dairies</li>
<li>Innovative technologies for organic farming</li>
<li>Environmental bioconversion processes</li>
<li>Variable rate technology for precision agriculture</li>
<li>Microbial pathogen fate and transport</li>
<li>Drainage modeling at the field and watershed scale</li>
<li>Vegetative treatment systems</li>
<li>Ergonomics and human factors</li>
<li>Advances in coproduct and byproduct management and utilization</li>
<li>Hydrogen and biofuel development research</li>
<li>Wetland engineering</li>
</ol>
<p>This time I presented my paper in <strong>Precision Irrigation</strong> session.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ri-03.jpg"><img class="size-full wp-image-182 aligncenter" title="ri-03" src="http://samuraielit.wordpress.com/files/2008/11/ri-03.jpg" alt="ri-03" width="400" height="300" /></a></p>
<p style="text-align:center;"><strong>Oral Presentation</strong></p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ri-04.jpg"><img class="size-full wp-image-183 aligncenter" title="ri-04" src="http://samuraielit.wordpress.com/files/2008/11/ri-04.jpg" alt="ri-04" width="400" height="300" /></a></p>
<p style="text-align:center;"><strong>Poster session</strong></p>
<p style="text-align:center;"><strong>Intelligent Irrigation Control Using Color, Morphological and Textural Features in Sunagoke Moss</strong></p>
<p style="text-align:justify;">A non-invasive sensing technique for monitoring Sunagoke moss water conditions was proposed. This paper describes the design and development of precision irrigation control method by incorporating color, morphology and RGB color co-occurrence matrix (CCM) textural features. The objective of this study was to develop a model of artificial neural network and made comparison analysis of the color, morphology and textural features to determine appropriate combination of pictorial features to accurately predict water content. Optimum condition of Sunagoke moss based on photosynthesis rate, color features, morphological features and textural features can be achieved between 2 g/g- 2.5 g/g water content. Neural network model performance was tested successfully to describe the relationship between water content and image features (color, morphology and textural features). This system is helpful to explore the new way of water spraying in moss plant factories based on computer vision. It proposes the water irrigation technology of the plant factory to realize the automation and precision farming. Precision water and nutrition spraying system based on computer vision is very important, not only for spraying the water and nutrition scientifically, but also for improving the efficiency of spraying and decreasing the non- or off-target of moss to prevent from over watering.<br />
<strong>Keywords</strong>: Image analysis, artificial neural network, irrigation system, control, plant factories, precision farming.</p>
<p style="text-align:justify;">
<p style="text-align:justify;">Full paper can be downloaded <a href="http://www.ziddu.com/download/2773155/Hendrawan-Murase-ASABE-2008.doc.html">HERE</a>.</p>
<p style="text-align:justify;">
<p style="text-align:justify;">A little bit about my journey to Boston:</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ri-05.jpg"><img class="size-full wp-image-184 aligncenter" title="ri-05" src="http://samuraielit.wordpress.com/files/2008/11/ri-05.jpg" alt="ri-05" width="400" height="300" /></a></p>
<p style="text-align:center;"><strong>Boston Station</strong></p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ri-06.jpg"><img class="size-full wp-image-185 aligncenter" title="ri-06" src="http://samuraielit.wordpress.com/files/2008/11/ri-06.jpg" alt="ri-06" width="400" height="300" /></a></p>
<p style="text-align:center;"><strong>Massachusetts Institute of Technology</strong></p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ri-07.jpg"><img class="size-full wp-image-186 aligncenter" title="ri-07" src="http://samuraielit.wordpress.com/files/2008/11/ri-07.jpg" alt="ri-07" width="300" height="400" /></a></p>
<p style="text-align:center;"><strong>Harvard University</strong></p>
<p style="text-align:justify;">
<p style="text-align:justify;">
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[17th IFAC World Congress, Seoul Korea (2008)]]></title>
<link>http://samuraielit.wordpress.com/2008/11/27/17th-ifac-world-congress-seoul-korea-2008/</link>
<pubDate>Thu, 27 Nov 2008 11:44:17 +0000</pubDate>
<dc:creator>samuraielit</dc:creator>
<guid>http://samuraielit.wordpress.com/2008/11/27/17th-ifac-world-congress-seoul-korea-2008/</guid>
<description><![CDATA[The IFAC World Congress held in Seoul, Korea in 2008 is the 17th of the triennial IFAC World Congres]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><blockquote>
<p style="text-align:justify;">The IFAC World Congress held in Seoul, Korea in 2008 is the 17th of the triennial IFAC World Congress series&#8230;.a record number of more than 3700 papers have been submitted and approximately 2700 have been accepted. All of these papers was presented in 397 oral sessions and 7 poster sessions over the five day period, all in one conference venue of COEX, Seoul, Korea.<!--more--></p>
</blockquote>
<p style="text-align:justify;">Seoul is a city of infinite discoveries. With a history of 600 years, Seoul is a city, where the 5000-year Korean traditional and the modern technologies co-exists in a perfect harmony.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ifac-01.jpg"><img class="size-full wp-image-164 aligncenter" title="ifac-01" src="http://samuraielit.wordpress.com/files/2008/11/ifac-01.jpg" alt="ifac-01" width="400" height="300" /></a></p>
<p style="text-align:center;"><strong>Incheon Airport, Seoul</strong></p>
<p style="text-align:justify;">Incheon International Airport (ICN), the &#8216;Winged City&#8217;, is an airport development located on reclaimed land approximately 32 miles from downtown Seoul, South Korea.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ifac-02.jpg"><img class="size-full wp-image-165 aligncenter" title="ifac-02" src="http://samuraielit.wordpress.com/files/2008/11/ifac-02.jpg" alt="ifac-02" width="400" height="300" /></a></p>
<p style="text-align:center;"><strong>Deoksugung Palace</strong></p>
<p style="text-align:justify;">The main houses of the former Deoksugung Palace were Prince Wolsandaegun&#8217;s residence who was King Seongjong&#8217;s elder brother. About a century later, when King Seonjo returned to Seoul in 1593 after fleeing the Japanese invasion of 1592, he established a temporary residence here. Haenggung in Jeongreung-dong, was renamed Gyeongungung In 1611, by the next ruler, Gwanghaegun. After Gwanghaegun moved to Changdeokgung Palace in 1615, the palace remained vacant for about 200 years.<br />
In 1897, King Gojong returned to power, after having spent two years at the Russian legation in the wake of the assassination of his queen, Empress Myeongseong. He took up residence at Changdeokgung Palace, establishing an independent &#8216;Daehanjeguk Empire&#8217;.<br />
From that time until 1907, it was the center of historical turbulence. In 1907, King Gojong was forced to abdicate his throne, although he continued to live at the palace until he passed away in 1919. Since 1907, the palace has been known as Deoksugung.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ifac-03.jpg"><img class="size-full wp-image-166 aligncenter" title="ifac-03" src="http://samuraielit.wordpress.com/files/2008/11/ifac-03.jpg" alt="ifac-03" width="300" height="400" /></a></p>
<p style="text-align:center;"><strong>Seoul Tower</strong></p>
<p style="text-align:justify;">Viewable from almost anywhere in Seoul, Seoul Tower serves as an excellent landmark. Built on a 262 meter peak in Namsan Park, the tower reaches to 480 meters above sea level. When the weather and pollution levels cooperate, visiting the observation tower (370 meters above sea level) allows you to view the entire city and surrounding areas.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ifac-04.jpg"><img class="size-full wp-image-167 aligncenter" title="ifac-04" src="http://samuraielit.wordpress.com/files/2008/11/ifac-04.jpg" alt="ifac-04" width="400" height="300" /></a></p>
<p style="text-align:center;"><strong>Korean Cuisines</strong></p>
<p style="text-align:justify;">The venue for the 17th World Congress is COEX Convention Center which is located within the World Trade Center Seoul Complex in the central business area of Seoul, Korea.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ifac-05.jpg"><img class="size-full wp-image-168 aligncenter" title="ifac-05" src="http://samuraielit.wordpress.com/files/2008/11/ifac-05.jpg" alt="ifac-05" width="400" height="300" /></a></p>
<p style="text-align:center;"><strong>COEX Convention Center</strong></p>
<p style="text-align:justify;"><strong>Robot Demonstrations</strong></p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ifac-06.jpg"><img class="size-full wp-image-169 aligncenter" title="ifac-06" src="http://samuraielit.wordpress.com/files/2008/11/ifac-06.jpg" alt="ifac-06" width="300" height="400" /></a></p>
<p style="text-align:center;"><strong>MAHRU of KIST</strong></p>
<p style="text-align:justify;">MAHRU is the world&#8217;s first network-based humanoid. It has been endowed with artificial intelligence through a network. Unlike other famous humanoids, such as ASIMO, MAHRU focuses on network-based intelligence by using the network infrastructure, where Korea has world-class strengths.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ifac-07.jpg"><img class="size-full wp-image-170 aligncenter" title="ifac-07" src="http://samuraielit.wordpress.com/files/2008/11/ifac-07.jpg" alt="ifac-07" width="300" height="400" /></a></p>
<p style="text-align:center;"><strong>POMI of ETRI</strong></p>
<p style="text-align:justify;">POMI (Penguin Robot for Multimodal Interaction) is a five-senses-mounted emotional expression robot that has been endowed with artificial intelligence and active reaction modules. POMI was developed by the U-Robot Research Division of ETRI and the hardware platform company.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ifac-08.jpg"><img class="size-full wp-image-171 aligncenter" title="ifac-08" src="http://samuraielit.wordpress.com/files/2008/11/ifac-08.jpg" alt="ifac-08" width="400" height="300" /></a></p>
<p style="text-align:center;"><strong>EveR-1 of KITECH</strong></p>
<p style="text-align:justify;">The performance of the android, EveR-1, developed in KITECH (Korea Institute of Industrial Technology) was demonstrated. The appearance of EveR-1 is based on Korean Female. EveR-1 is not bipedal, but is capable of motion from her torso up.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ifac-09.jpg"><img class="size-full wp-image-172 aligncenter" title="ifac-09" src="http://samuraielit.wordpress.com/files/2008/11/ifac-09.jpg" alt="ifac-09" width="300" height="400" /></a></p>
<p style="text-align:center;"><strong>Robot Soccer Demonstration Game of FIRA</strong></p>
<p style="text-align:justify;">In this Conference, I presented my paper in Greenhouses and controlled agricultural production session.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ifac-10.jpg"><img class="size-full wp-image-173 aligncenter" title="ifac-10" src="http://samuraielit.wordpress.com/files/2008/11/ifac-10.jpg" alt="ifac-10" width="400" height="300" /></a></p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ifac-11.jpg"><img class="size-full wp-image-174 aligncenter" title="ifac-11" src="http://samuraielit.wordpress.com/files/2008/11/ifac-11.jpg" alt="ifac-11" width="400" height="300" /></a></p>
<p style="text-align:justify;">
<p style="text-align:center;"><strong>Water Irrigation Control for Sunagoke Moss Using Intelligent Image Analysis</strong></p>
<p style="text-align:justify;">A novel technique suitable for noninvasive measurements of moss water content is presented. In this paper, color image sensing is applied for measuring moss water content. Sunagoke moss Rhacomitrium canescens has been utilized as an active greening material to mitigate the urban heat island effect. The goal of this paper is to develop an intelligent image analysis system for water irrigation optimal control in Sunagoke moss. The combination of RGB components (green/red ratio, blue index, blue value and green index) using statistical pattern recognition can estimate water content and define the distribution of water condition in every pixel of Sunagoke moss images. The combination of colour image sensing and Artificial Neural Network (ANN) successfully described the relationship between water content and colour features i.e. average green index, average blue index, blue mean value, browning area index, green canopy index and average green/red ratio. This system is helpful to explore a new way of water spraying in Sunagoke moss plant factories based on computer vision. We propose a water irrigation technology of plant factory to realize the automation and precision farming. Precision water spraying system based on computer vision is important, not only for spraying the water scientifically, but also for improving the efficiency of spraying and decreasing the non- or off-target spraying to prevent over watering.<br />
<strong>Keywords</strong>: Image analysis, artificial neural network, optimal control, plant factories, precision farming.</p>
<p style="text-align:justify;">Full paper can be downloaded <a href="http://www.ziddu.com/download/2772668/IFAC-34167.pdf.html">HERE</a>.</p>
<p style="text-align:justify;">
<p style="text-align:justify;">
<p style="text-align:justify;">
<p style="text-align:justify;">
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[JSABEES Matsuyama, Ehime University (2008)]]></title>
<link>http://samuraielit.wordpress.com/2008/11/27/jsabees-matsuyama-ehime-university-2008/</link>
<pubDate>Thu, 27 Nov 2008 04:57:36 +0000</pubDate>
<dc:creator>samuraielit</dc:creator>
<guid>http://samuraielit.wordpress.com/2008/11/27/jsabees-matsuyama-ehime-university-2008/</guid>
<description><![CDATA[&#8230;.it was a JSABEES Annual Conference held in Matsuyama (Ehime University) in September 2008. T]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><blockquote><p>&#8230;.it was a JSABEES Annual Conference held in Matsuyama (Ehime University) in September 2008.<!--more--></p></blockquote>
<p style="text-align:justify;">The Conference focused on Basic and Applied Sciences for Intelligent Plant Production System, including:</p>
<ul style="text-align:justify;">
<li>Application of probe electrospray ionization for biological sample measurements</li>
<li>Crop status monitoring in greenhouse based on measurement of volatile organic compounds emitted by the plants</li>
<li>Environment control for production of valuable materials using plants in closed plant production systems</li>
<li>Intelligent bio-production system towards environment protection</li>
</ul>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ehim-01.jpg"><img class="size-full wp-image-149 aligncenter" title="ehim-01" src="http://samuraielit.wordpress.com/files/2008/11/ehim-01.jpg" alt="ehim-01" width="400" height="300" /></a></p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ehim-02.jpg"><img class="size-full wp-image-150 aligncenter" title="ehim-02" src="http://samuraielit.wordpress.com/files/2008/11/ehim-02.jpg" alt="ehim-02" width="400" height="300" /></a></p>
<p style="text-align:justify;">It is a closed system controlled environment greenhouse. But unfortunately we can&#8217;t take any picture inside. It was used for cultivating tomato plants and cucumber. The humidity was automatically controlled by using water sprayer trhough a small pipe-line at the top part of the greenhouse. The humidity sensor detected the low level of humidity, and it will send information to the sprayer to spray the water accurately to keep the humidity level in balance. The temperature is controlled by using heater and cooler. The harvest process was conducted automatically by using harvesting-robot with modified manipulator and machine vision. Machine vision was used to distinguish between the object (cucumber or tomato) and non-object (leaves), because as we know it is difficult to distinguish green cucumber and green leaves only by using visible light camera. Blue and red LED was used to detect photosynthesis rate, as we know that plants during the photosynthesis process absorb more red wavelength rather than other wavelength. My idea is introducing Neural Network based irrigation system&#8230;.so that the automatic control for water requirements can be much better.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ehim-03.jpg"><img class="size-full wp-image-151 aligncenter" title="ehim-03" src="http://samuraielit.wordpress.com/files/2008/11/ehim-03.jpg" alt="ehim-03" width="400" height="300" /></a></p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ehim-04.jpg"><img class="size-full wp-image-152 aligncenter" title="ehim-04" src="http://samuraielit.wordpress.com/files/2008/11/ehim-04.jpg" alt="ehim-04" width="400" height="300" /></a></p>
<p><strong>About Ehime Prefecture:</strong></p>
<p style="text-align:justify;">Surrounded by the calm Seto Inland Sea in the north, the Uwa Sea in the west and Shikoku Mountains in the south, Ehime Prefecture, with an area of about 5,676km sq. and a population of about 1,500,000, lies in the northern part of the island of Shikoku, the smallest of the four major islands of Japan.</p>
<p style="text-align:justify;">Its capital, Matsuyama, is the largest city on Shikoku, with a population of over 500,000 and an abundance of historical and cultural resources such as the famous Matsuyama Castle and Dogo Hot Spring Spa, the oldest bathing area in Japan.</p>
<p style="text-align:justify;">Ehime, which sounds feminine to Japanese ears and literally means &#8220;beautiful maiden&#8221;, is blessed by a mild climate with an average low of 5.3degrees C (42degrees F)in January and an average high of 27degrees C(81degrees F)in August. It offers natural beauty such as the Seto Inland Sea National Park, Ashizuri Uwakai National Park and Mt. Ishizuchi, the highest mountain in western Japan, and attracts millions of tourists annually. It has an average annual rainfall is about 1,300mm, however, most of it falls during the rainy season from mid-June to mid-July. Though there are various explanations concerning its origin, the name Ehime is very old, dating back to ancient myths and legends. Iyo, the old name for Ehime, is said to have first appeared as the name for the island of Shikoku in the &#8220;Kojiki&#8221; (Record of Ancient Matters) and the &#8220;Nihon Shoki&#8221; (Chronicles of Japan), both written in the early eighth century. It is also said that the name lyo is derived from lyu, which means hot water, since this area was famous for Dogo onsen (hot spring spa) as far back as the 6th and 7th centuries.</p>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/ehim-05.jpg"><img class="size-full wp-image-153 aligncenter" title="ehim-05" src="http://samuraielit.wordpress.com/files/2008/11/ehim-05.jpg" alt="ehim-05" width="400" height="300" /></a></p>
<p style="text-align:center;"><strong>Dogo Onsen</strong></p>
<p style="text-align:justify;">Following the Taika Reform of 645, this area was officially named Iyo-no-kuni. Since the beginning of Ehime&#8217;s history, the Seto Inland Sea has played an important role in the life of the people. During the middle ages (after the Taika Reforms),groups of marine guards called suigun appeared. Using their extensive knowledge of tides and currents, they gradually came to dominate over the vital seaborne supply route in the Inland Sea between the westen provinces and Kyoto, then the capital of Japan. Several Suigun active in the region joined together to form a coastal guard unit called the Iyo-Suigun. Their distinguished services in suppressing pirates in the Inland Sea, the Gempei War (late 12th century) and the battles against the Mongol invasion (1274 and 1281), won them a politically important role in the region. They prospered until this area was subjugated by Toyotomi Hideyoshi&#8217;s forces in 1585.</p>
<p style="text-align:justify;">During the feudal period, Iyo-no-kuni was cut up into eight fiefs or han known as Iyo- happan by the Tokugawa Shogunate. These were Matsuyama-han, the largest, Ozu-han, Niiya-han, Uwajima-han, Yoshida- han, Imabari-han, Saijo-han and Komatsu- han. Kato Yoshiakira who had fought bravely for Tokugawa Ieyasu in the Battle of Sekigahara (1600), was named lord of Matsuyama-han and established Matsuyama Castle on Katsuyama Hill. While constructing the castle, he arranged the town around the base of the hill, which is Matsuyama&#8217;s modern day downtown.</p>
<p style="text-align:justify;">In 1867 the feudal age ended, followed by a restoration of imperial rule. In 1868 the new era was named Meiji and the new government began centralizing its administrative power by abolishing the han and feudal class system in 1871. The Iyo-happan became eight prefectures. Finally in 1873, these prefectures were combined to make Ehime Prefecture, and Prefectural offices were set up in Matsuyama.</p>
<p style="text-align:justify;"><strong>My Presentation:</strong></p>
<p style="text-align:center;"><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--><br />
<strong><span style="font-size:11pt;font-family:&#34;" lang="EN-US">Micro Precision Irrigation System for Sunagoke Moss Production</span></strong></p>
<p><strong><span style="font-size:11pt;line-height:140%;font-family:&#34;" lang="EN-US">1. Introduction</span></strong></p>
<p class="MsoNormal" style="text-align:justify;"><span style="font-size:11pt;font-family:&#34;" lang="EN-US">This paper describes the design and development of precision irrigation control method by incorporating color, morphology and RGB color co-occurrence matrix (CCM) textural features. Feature selection techniques have become an apparent need in many bioinformatics applications. The objective of this study was to develop neural network based irrigation control model for Sunagoke moss using color, morphology and textural features with the application of feature selection techniques. This system is helpful to explore the new way of water spraying in moss plant factories based on computer vision. </span></p>
<p class="MsoNormal" style="line-height:140%;"><strong><span style="font-size:11pt;line-height:140%;font-family:&#34;" lang="EN-US">2. Material and Methods</span></strong></p>
<p class="MsoNormal" style="text-align:justify;"><span style="font-size:11pt;font-family:&#34;" lang="EN-US">A visible light camera was used to acquire Sunagoke moss images. In this study, samples of cultured Sunagoke moss were used. Growth chamber was used to control optimum growth environment parameters (Hendrawan and Murase, 2008). The temperature (<span>T</span>) in growth chamber was regulated at 15<sup>o</sup>C. Humidity (<span>H</span>) was regulated at 65%. Water was given in the amount of 1 gg<sup>-1</sup>, 2 gg<sup>-1</sup>, 3 gg<sup>-1</sup> and 4 gg<sup>-1</sup>. The light was controlled at 30 kflux (12 hours) and the CO<sub>2</sub> gas was controlled at 400 ppm. </span></p>
<p style="text-align:justify;"><span style="font-size:11pt;font-family:&#34;" lang="EN-US">Fig. 1 shows that image information were driven to a feature extraction module, where color, morphology and textural features data were obtained. The RGB color components included red index, green index, blue index, red mean value, green mean value, blue mean value and green per red ratio. Morphological features extracted included browning area index, green canopy index and perimeter index. Ten textural features were calculated using RGB CCM, including entropy, energy (angular second moment), contrast, homogeneity, sum mean (mean), variance, correlation, maximum probability, inverse difference moment and cluster tendency. Then, the reduced feature sets obtained after proper feature selection in the feature selection module. The predictor module was generated by applying Back-Propagation Neural Network (BPNN) to different features subsets as the input.</span></p>
<p style="text-align:center;"><span style="font-size:11pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/ehim-06.jpg"><img class="size-full wp-image-154 aligncenter" title="ehim-06" src="http://samuraielit.wordpress.com/files/2008/11/ehim-06.jpg" alt="ehim-06" width="454" height="39" /></a></span><a href="http://samuraielit.wordpress.com/files/2008/11/ehim-06.jpg"><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--> </a></p>
<p style="text-align:center;"><span style="font-size:11pt;font-family:&#34;" lang="EN-US">Figure 1. Generic design of noninvasive water content prediction</span></p>
<p class="MsoNormal" style="line-height:140%;"><strong><span style="font-size:11pt;line-height:140%;font-family:&#34;" lang="EN-US">3. Results and Discussion</span></strong></p>
<p style="text-align:justify;"><span style="font-size:11pt;font-family:&#34;" lang="EN-US">Figure 2 shows that water content influences photosynthesis (fig. 2a), color features (fig. 2b), morphological features (fig. 2c) and textural features (fig. 2d). The entire image features and photosynthesis reached the peak point at the water content of 2 gg<sup>-1</sup>– 2.5 gg<sup>-1</sup>. The result has shown that the combination of image features (color, morphology and textural features) can be used as noninvasive method to monitor the change of water content in Sunagoke moss.</span></p>
<p style="text-align:center;"><span style="font-size:11pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/ehim-07.jpg"><img class="size-full wp-image-155 aligncenter" title="ehim-07" src="http://samuraielit.wordpress.com/files/2008/11/ehim-07.jpg" alt="ehim-07" /></a></span></p>
<p style="text-align:center;"><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--> <span style="font-size:11pt;font-family:&#34;" lang="EN-US">Figure 2. (a) Photosynthesis, (b) color, (c) morphology and (d) CCM textural features</span></p>
<p style="text-align:justify;"><span style="font-size:11pt;font-family:&#34;" lang="EN-US">Neural network model performance was tested successfully to describe the relationship between water content and image features. The architecture of BPNN consisted of some combinations of image features as inputs which were selected by features selection techniques, one hidden layer and one output layer respectively. The 124 set data were used in training and inspection data. The training converged after approximately 20.000 iterations, learning coefficient of 0.1 and momentum of 0.9. The mean value of training and inspection root mean square error value were 1.2 x 10<sup>-2</sup> and 0.8 x 10<sup>-2</sup> respectively. For the purpose of feature selection, filter method was used and it showed that feature subset selection had a positive effect on the performance of BPNN on predicting water content. </span></p>
<p class="MsoNormal" style="line-height:140%;"><strong><span style="font-size:11pt;line-height:140%;font-family:&#34;" lang="EN-US">4. Conclusion</span></strong></p>
<p style="text-align:justify;"><span style="font-size:11pt;font-family:&#34;" lang="EN-US">A noninvasive measurement method for Sunagoke moss water content has been suggested. It was concluded that: 1) color, morphology and textural features can be used to monitor the change of Sunagoke moss water content; 2) BPNN method has successfully described the relationship between water content and image features; 3) feature subset selection enhanced the performance of BPNN by improving accuracy; 4) through the application of this system, the water consumption during irrigation process can be minimized and the Sunagoke moss product can be uniform.</span></p>
<p><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--><!--[if !mso]&#62;--></p>
<p class="MsoNormal" style="line-height:140%;"><strong><span style="font-size:11pt;line-height:140%;font-family:&#34;" lang="EN-US">5. References</span></strong></p>
<p style="text-align:justify;"><span style="font-size:11pt;font-family:&#34;" lang="EN-US">Hendrawan. Y and H. Murase. 2008. Intelligent irrigation control using color, morphological and textural features in Sunagoke Moss. An ASABE Annual International Meeting, Providence,  USA, June 29-July 2, paper number: 083858.</span></p>
<p style="text-align:justify;"><span style="font-size:11pt;font-family:&#34;" lang="EN-US">Hendrawan. Y and H. Murase. 2008. Water irrigation control for Sunagoke Moss using intelligent image analysis. 17<sup>th</sup> IFAC World Congress, Seoul, Korea, July 6-11, paper number: 2723.</span></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Feature Selection for Water content prediction using Filter Method]]></title>
<link>http://samuraielit.wordpress.com/2008/11/27/feature-selection-for-water-content-prediction-using-filter-method/</link>
<pubDate>Thu, 27 Nov 2008 03:54:54 +0000</pubDate>
<dc:creator>samuraielit</dc:creator>
<guid>http://samuraielit.wordpress.com/2008/11/27/feature-selection-for-water-content-prediction-using-filter-method/</guid>
<description><![CDATA[Filter techniques assess the relevance of features by looking only at the intrinsic properties of th]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><blockquote><p><span style="font-family:&#34;" lang="EN-US">Filter techniques assess the relevance of features by looking only at the intrinsic properties of the data. In most cases a feature relevance score is calculated, and low scoring features are removed. <!--more--></span></p></blockquote>
<p style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Afterwards, this subset of features is presented as input to the prediction/classification algorithm. Advantages of filter techniques are that they easily scale to very high-dimensional datasets, they are computationally simple and fast, and they are independent of the prediction/classification algorithm. As a result, feature selection needs to be performed only once, and then different classifiers/predictors can be evaluated. <span> </span>A common disadvantage of filter methods is that they ignore the interaction with the classifier/predictor and that most proposed techniques are univariate. This means that each feature is considered separately, thereby ignoring feature dependencies, which may lead to worse classification/prediction performance when compared to other types of Feature Selecition (FS) techniques. In order to overcome the problem of ignoring feature dependencies, a number of multivariate filter techniques were introduced, aiming at the incorporation of feature dependencies to some degree.</span></p>
<p style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The Chi-Squared (<em>X<sup>2</sup></em>) method evaluates features individually by measuring their chi-squared statistic with respect to the classes (Liu et al., 2002).<span> </span>For numeric attribute, the method first requires its range to be discretized into several intervals using, for example, the entropy-based discretization method. After calculating the <em>X<sup>2</sup> </em>value of all considered features, we can sort these values with the largest one at the first position, as the larger the <em>X<sup>2</sup> </em>value, the more important the feature is.</span><span style="font-size:12pt;font-family:&#34;"> </span><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The <em>X<sup>2</sup></em> value of an attribute is defined as:</span></p>
<p style="text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/ftr-01.jpg"><img class="size-full wp-image-121 aligncenter" title="ftr-01" src="http://samuraielit.wordpress.com/files/2008/11/ftr-01.jpg" alt="ftr-01" width="166" height="53" /></a></span></p>
<p style="text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/ftr-02.jpg"><img class="size-full wp-image-122 aligncenter" title="ftr-02" src="http://samuraielit.wordpress.com/files/2008/11/ftr-02.jpg" alt="ftr-02" width="77" height="45" /></a></span></p>
<p><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--><!--[if !mso]&#62;--></p>
<p class="MsoNormal" style="line-height:100%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">where: <em>m</em> is the number of intervals, <em>k</em> the number of classes, <em>A<sub>ij</sub></em> the number of samples in the <em>i</em>th interval, <em>j</em>th class, <em>Ri</em> the number of samples in the <em>i</em>th interval, <em>C<sub>j</sub></em><sub> </sub>the number of samples in the <em>j</em>th class, <em>N</em> the total number of samples, and <em>E<sub>ij</sub></em> the expected frequency of <em>A<sub>ij</sub></em>.</span></p>
<p class="MsoNormal" style="line-height:100%;text-align:justify;"><span style="font-size:12pt;line-height:100%;font-family:&#34;" lang="EN-US">MI function is suitable for assessing the information content of features (Gomez-Sanchis et al., 2008). We evaluated the mutual information (<em>I</em>) function for each feature and class variable, and the features with the highest mutual information function value were selected. The mutual information of two random variables <em>x</em> and <em>y</em> can be viewed as a quantity measuring the mutual dependence of the two variables (Shannon, 1948). The mutual information is widely used in applications area of FS for machine learning. </span></p>
<p style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">A probabilistic model of a nominal valued feature <em>Y</em> can be formed by estimating the individual probabilities of the values <em>y </em></span><em><span style="font-size:12pt;font-family:&#34;" lang="EN-US">∈</span><span style="font-size:12pt;font-family:&#34;" lang="EN-US"> Y</span></em><span style="font-size:12pt;font-family:&#34;" lang="EN-US"> from the training data. If this model is used to estimate the value of <em>Y</em> for a novel sample, then the entropy of the model is the number of bits it would take, on average, to correct the output of the model. Entropy is a measure of the uncertainty or unpredictability in a system. The entropy of <em>Y</em> is given by:</span></p>
<p style="text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/ftr-03.jpg"><img class="size-full wp-image-123 aligncenter" title="ftr-03" src="http://samuraielit.wordpress.com/files/2008/11/ftr-03.jpg" alt="ftr-03" width="190" height="38" /></a></span></p>
<p style="text-align:justify;"><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--> <span style="font-size:12pt;font-family:&#34;" lang="EN-US">If the observed values of <em>Y</em> in the training data are partitioned according to the values of a second feature <em>X</em>, and the entropy of <em>Y</em> with respect to the partitions induced by <em>X</em> is less than the entropy of <em>Y</em> prior t partitioning, then there is a relationship between features <em>Y</em> and <em>X</em>. <span> </span>Equation below gives the entropy of <em>Y</em> after observing <em>X</em>.</span></p>
<p style="text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/ftr-04.jpg"></a><a href="http://samuraielit.wordpress.com/files/2008/11/ftr-041.jpg"><img class="size-full wp-image-125 aligncenter" title="ftr-041" src="http://samuraielit.wordpress.com/files/2008/11/ftr-041.jpg" alt="ftr-041" width="294" height="38" /></a></span></p>
<p style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">where: <em>p(y&#124;x)</em> is the joint probability distribution function of <em>x</em> and <em>y</em>, and <em>p(x)</em> is the marginal probability distribution functions of <em>x</em> respectively.</span></p>
<p style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The amount by which the entropy of <em>Y</em> decrease reflects additional information about <em>Y</em> provided by <em>X</em> and is called the information gain, or alternatively, mutual information (MI) which is given by:</span></p>
<p style="text-align:center;"><em><span style="font-size:12pt;font-family:&#34;" lang="EN-US">gain = H(Y) – H(Y&#124;X)</span></em><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"><span> </span></span></p>
<p class="MsoNormal" style="line-height:200%;text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><span> </span><em>= H(X)-H(X&#124;Y)</em></span></p>
<p class="MsoNormal" style="line-height:200%;text-align:center;"><em><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"><span> </span><span> </span>= H(Y) + H(X) – H(X,Y)</span></em></p>
<p class="MsoNormal" style="text-align:justify;"><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--> <span style="font-size:12pt;font-family:&#34;" lang="EN-US">Information gain is a symmetrical measure that is, the amount of information gained about <em>Y </em>after observing <em>X</em> is equal to the amount of information gained about <em>X</em> after observing <em>Y</em>. Symmetry is a desirable property for a measure of feature-feature inter-correlation to have. Unfortunately, information gain is biased in favour of features with more values. Furthermore, the correlations should be normalized to ensure they are comparable and have the same affect. Symmetrical uncertainty compensates for information gain’s bias towards attributes with more values and normalizes its value to the range (0,1):</span></p>
<p class="MsoNormal" style="text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/ftr-05.jpg"><img class="size-full wp-image-126 aligncenter" title="ftr-05" src="http://samuraielit.wordpress.com/files/2008/11/ftr-05.jpg" alt="ftr-05" width="404" height="49" /></a></span></p>
<p class="MsoNormal" style="text-align:justify;"><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--> <span style="font-size:12pt;font-family:&#34;" lang="EN-US">The Correlation-based Feature Selection (CFS) method is another approach to FS. Rather than scoring (and ranking) individual features, the method scores (and ranks) the worth of subsets of features. As the feature subset space is usually huge, CFS uses a best-first-search heuristic. This heuristic algorithm takes into account the usefulness of individual features for predicting the class along with the level of inter-correlation among them. CFS first calculates a matrix of feature-class and feature-feature correlations from the training data. If the correlation between each of the components in a test and the outside variable is known, and the inter-correlation between each pair of components is given, then the relation between a composite test consisting of the summed components and the outside variable can be predicted from:</span></p>
<p class="MsoNormal" style="text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/ftr-06.jpg"><img class="size-full wp-image-127 aligncenter" title="ftr-06" src="http://samuraielit.wordpress.com/files/2008/11/ftr-06.jpg" alt="ftr-06" width="172" height="60" /></a></span></p>
<p style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">where: <em>Merit<sub>S</sub></em> is the heuristic merit of a feature subset <em>S</em> containing <em>k</em> features. r<sub>cf </sub>is the average feature-class correlation, and r<sub>ff </sub>is the average feature-feature inter-correlation.</span></p>
<p class="MsoNormal" style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">From the equation above, it shows that the correlation between a composite and an outside variable is a function of the number of component variables in the composite and the magnitude of the inter-correlations among them, together with the magnitude of the correlations between the components and the outside variable. Entering two illustrative values for r<sub>cf</sub> and allowing the values of <em>k</em> and r<sub>ff</sub> to vary, the formula is solved for <em>Merit<sub>S</sub>.</em> The conclusions of this equation can be drawn:</span></p>
<ul>
<li><!--[if !supportLists]--><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The higher the correlations between the components and the outside variable, the higher the correlation between composite and the outside variable</span></li>
<li><!--[if !supportLists]--><!--[endif]--><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The lower the inter-correlations among the components, the higher the correlation between the composite and the outside variable.</span></li>
<li><span style="font-size:12pt;font-family:&#34;" lang="EN-US">As the number of components in the composite increases, the correlation between the composite and the outside variable increases.</span></li>
</ul>
<p style="text-align:justify;"><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--> <span style="font-size:12pt;font-family:&#34;" lang="EN-US">Another method is using linear regression (LR). LR analyzes the relationship between two variables, X and Y. In general, the goal of LR is to find the line that best predicts Y from X. LR does this by finding the line that minimizes the sum of the squares of the vertical distances of the points from the line. The LR is defined as:</span></p>
<p style="text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/ftr-07.jpg"><img class="size-full wp-image-128 aligncenter" title="ftr-07" src="http://samuraielit.wordpress.com/files/2008/11/ftr-07.jpg" alt="ftr-07" width="77" height="20" /></a></span></p>
<p style="text-align:justify;"><span style="font-size:12pt;line-height:100%;font-family:&#34;" lang="EN-US">where: the coefficients <em>a</em> and <em>b</em> are determined by the condition that the sum of the square residuals is as small as possible.</span></p>
<p style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The results of <em>X<sup>2</sup></em>, MI, CFS and LR were feature ranking which ranked the features based on the relevancy to the predicted variable (water content). Back-propagation Neural Network (BPNN) was used to train selected features based on the ranking number to find relevant combination of features for predicting water content.</span></p>
<p style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The results of FS are described as following. First of all, in most cases, the accuracy of prediction performance using five proposed FS method were greatly improved. It was shown that there were some improvements in case of number of features used and the prediction error between methods using FS and method without FS. </span></p>
<p style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Among the filter methods, <em>X<sup>2</sup></em> method got the highest performance for prediction with the validation error 0.009 and 31 features selected followed by MI with testing error 0.018 and 35 features selected.</span></p>
<p style="text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/ftr-08.jpg"><img class="size-full wp-image-129 aligncenter" title="ftr-08" src="http://samuraielit.wordpress.com/files/2008/11/ftr-08.jpg" alt="ftr-08" width="364" height="217" /></a></span></p>
<p style="text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/ftr-09.jpg"><img class="size-full wp-image-130 aligncenter" title="ftr-09" src="http://samuraielit.wordpress.com/files/2008/11/ftr-09.jpg" alt="ftr-09" width="328" height="207" /></a></span></p>
<p style="text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/ftr-10.jpg"><img class="size-full wp-image-131 aligncenter" title="ftr-10" src="http://samuraielit.wordpress.com/files/2008/11/ftr-10.jpg" alt="ftr-10" width="364" height="214" /></a></span></p>
<p style="text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/ftr-11.jpg"><img class="size-full wp-image-132 aligncenter" title="ftr-11" src="http://samuraielit.wordpress.com/files/2008/11/ftr-11.jpg" alt="ftr-11" width="364" height="215" /></a><br />
</span></p>
<p class="MsoNormal" style="line-height:100%;">
<p class="MsoNormal">
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[JSABEES Rihga Royal Hotel, Sakai, Japan (2007)]]></title>
<link>http://samuraielit.wordpress.com/2008/11/25/jsabees-rihga-royal-hotel-sakai-japan-2007/</link>
<pubDate>Tue, 25 Nov 2008 09:36:00 +0000</pubDate>
<dc:creator>samuraielit</dc:creator>
<guid>http://samuraielit.wordpress.com/2008/11/25/jsabees-rihga-royal-hotel-sakai-japan-2007/</guid>
<description><![CDATA[&#8230;&#8230;It was a conference held in Rihga Royal Hotel, Sakai, Osaka, Japan in June 2007. I was]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><blockquote><p>&#8230;&#8230;It was a conference held in Rihga Royal Hotel, Sakai, Osaka, Japan in June 2007. I was interested in some fields of study such as: machine vision for precision irrigation, phytotron for closed greenhouse system, plant factory for optimizing environmental growth of plants, etc. I&#8217;m introducing fuzzy subtractive clustering in my presentation&#8230;<!--more--></p></blockquote>
<p style="text-align:center;"><a href="http://samuraielit.wordpress.com/files/2008/11/rihga-01.jpg"><img class="size-full wp-image-82 aligncenter" title="rihga-01" src="http://samuraielit.wordpress.com/files/2008/11/rihga-01.jpg" alt="rihga-01" width="320" height="240" /></a></p>
<p style="text-align:center;"><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--><br />
<strong><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Color Measurement for Estimating Growth Environment of Moss Using Artificial Neural Network</span></strong></p>
<p><strong><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><br />
</span></strong></p>
<p class="MsoNormal"><strong><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Introduction</span></strong></p>
<p class="MsoNormal" style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The number of application using machine vision and digital image processing techniques in the agricultural sector are increasing rapidly. The quantification of the visual properties can play an important role to improve and automate agricultural management tasks. Non-destructive methods to analyze the growth and development of plants are becoming common and being applied in practice with the development of computers and electronics devices. Simple visible light digital cameras offer a potential for expanded forms of plant ecological research. Using a visible light digital camera can be used as a model for simple field estimations of photosynthesis and carbon gain.</span></p>
<p class="MsoNormal" style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Sunagoke moss <em>Rhacomitrium canescens</em> has been utilized as an active greening material to mitigate the urban heat island effect. The method of image processing of moss was developed, in order to obtain the information about the color appearance based on environment status to be used in intelligent image processing system to determine optimum photosynthesis. </span></p>
<p class="MsoNormal"><strong><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Objectives</span></strong></p>
<p class="MsoNormal" style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The general aim of the project is to investigate the possibility of using intelligent image processing as a tool to facilitate optimum growth environment for photosynthesis management of moss. This has been subdivided into three objectives i.e. developing image processing techniques to determine optimum growth environment of moss based on color appearance, clustering color appearances using Fuzzy Subtractive Clustering (FSC) and modeling the relationship between growth environment parameters and color appearances using an Artificial Neural Network (ANN).</span></p>
<p class="MsoNormal"><strong><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Methods</span></strong></p>
<p style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Moss images were taken through the digital camera and processed by image processing algorithm with image resolution of 500&#215;344 pixels. In this study, samples of cultured Sunagoke moss <em>Rhacomitrium canescens</em> were used. Growth chamber was used to control different variations of environment parameters. The temperature (<em>T</em>) in growth chamber was regulated at 10, 15, or 20 <sup>o</sup>C. Humidity (<em>H</em>) was regulated at 50, 65, or 80%. Water was given in the amount of 1 gr/gr or 2 gr/gr. The light was controlled at 30 kflux (hours of light=12h) and the CO<sub>2</sub> gas was controlled at 400 ppm. The RGB factors i.e. red index, green index, blue index, red mean value, green mean value, and blue mean value were analyzed using Image Processing software built in Visual Basic.</span><!--[if gte mso 9]&#62;   &#60;![endif]--><!--[if !mso]&#62;--></p>
<p class="MsoNormal" style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Green area index is defined as total percentage of RGB pixel value which the green color level is up to the threshold points (R=149, G=138, and B=89). These points have been tested effectively to differentiate green area pixel from background and browning area pixel. Browning area index is defined as total percentage of RGB pixel value which is exist in the threshold points (R=70-130 and G=70-100), and it has been tested effectively to measure browning area of cultured Sunagoke moss.</span></p>
<p class="MsoNormal" style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The humidity level was found to be correlated with average green index (r<sup>2</sup>=0.88), green mean value (r<sup>2</sup>=0.93), green area index (r<sup>2</sup>=0.93) and browning area index (r<sup>2</sup>=0.94). </span></p>
<p class="MsoNormal"><strong><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Result</span></strong></p>
<p class="MsoNormal" style="text-align:center;"><strong><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/rihga-02.jpg"><img class="size-full wp-image-83 aligncenter" title="rihga-02" src="http://samuraielit.wordpress.com/files/2008/11/rihga-02.jpg" alt="rihga-02" width="265" height="161" /></a><br />
</span></strong></p>
<p class="MsoNormal" style="text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/rihga-03.jpg"><img class="size-full wp-image-84 aligncenter" title="rihga-03" src="http://samuraielit.wordpress.com/files/2008/11/rihga-03.jpg" alt="rihga-03" width="265" height="161" /></a></span></p>
<p class="MsoNormal">
<p class="MsoNormal" style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">From the observation, averagely the highest point of the average green index (48.9%) and green mean value (168.75) was found at (T=15-20<sup>o</sup>C, H=65%, and water=2gr/gr). the highest increase of green area index (6.87%) was found at (T=20<sup> o</sup>C , H=65%, and water=2gr/gr). The higher amount of humidity and water content makes the higher value of average green index, green mean value, and green area index. The higher amount of humidity and water content makes the browning area index getting decrease. </span></p>
<p class="MsoNormal" style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">In this study, we selected FSC approach to determine cluster centers from the inputs i.e. average RGB index and RGB mean value using parameter radius=0.4. This value is the maximum distance between any two points within the same cluster, yet less than the distance between any two points from different clusters where each point belongs. The multiplier squash factor value=1.25. The criteria for cluster center consideration are based on acceptance and rejection ratios. Acceptance ratio can be determined by fractions of the potential first cluster center, above which another data point will be accepted. Rejection ratio is the condition to reject a data point to be a cluster center, which is obtained from fractions of the potential first cluster center, below which a data point will be rejected as a cluster center. We chose 0.5 as the acceptance ratio for the first cluster center. We chose the rejection ratio 0.15 to derive other cluster centers. We found 3 clusters of color features. From these 3 clusters we can analyze that generally the first cluster has lower value of average green index and green mean value (low humidity and low water content), the second cluster has medium value of average green index and green mean value, and the third cluster has higher value of average green index and green mean value (high humidity and high water content). </span></p>
<p class="MsoNormal" style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Backpropagation neural networks were used to develop the relationship between growth environment parameters with color clusters, green area index and browning area index. These neural networks used temperature, humidity, water, and time as their inputs. Using color clusters as output parameters, a minimum learning error of 5.46&#215;10<sup>-2</sup> was attained at convergence of the ANN training and validation error of </span><span style="font-size:12pt;font-family:&#34;" lang="EN-US">±</span><span style="font-size:12pt;font-family:&#34;" lang="EN-US">1.94&#215;10<sup>-2</sup> was attained at ANN validation. Using green area index as output parameters, a minimum learning error of 5.32&#215;10<sup>-2</sup> was attained at convergence of the ANN training and validation error of </span><span style="font-size:12pt;font-family:&#34;" lang="EN-US">±</span><span style="font-size:12pt;font-family:&#34;" lang="EN-US">8.66&#215;10<sup>-2</sup> was attained at ANN validation. Using browning area index as output parameters, a minimum learning error of 7.65&#215;10<sup>-2</sup> was attained at convergence of the ANN training and validation error of </span><span style="font-size:12pt;font-family:&#34;" lang="EN-US">±</span><span style="font-size:12pt;font-family:&#34;" lang="EN-US">9.05&#215;10<sup>-2</sup> was attained at ANN validation. ANN model performance was tested successfully to describe the relationship between growth environment parameters and color appearance using backpropagation supervised learning method and inspection data.</span></p>
<p class="MsoNormal"><strong><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Conclusion</span></strong></p>
<p style="text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">In this study, we found that visible light camera can visualize growth environment condition using visible color appearance. ANN has successfully described the relationship between growth environment and color appearance. We envision in our future work concerning the combination of visible light image processing and infrared camera. Using the combination of visible light camera features and infrared features can make better observation to visualize the relationship between growth environment condition and optimum photosynthesis process of moss.</span></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Back-Propagation Neural Network-moss water content prediction]]></title>
<link>http://samuraielit.wordpress.com/2008/11/25/back-propagation-neural-network-moss-water-content-prediction/</link>
<pubDate>Tue, 25 Nov 2008 08:58:43 +0000</pubDate>
<dc:creator>samuraielit</dc:creator>
<guid>http://samuraielit.wordpress.com/2008/11/25/back-propagation-neural-network-moss-water-content-prediction/</guid>
<description><![CDATA[The training of a neural network facilitates it to learn to reproduce a mapping from a set of input ]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><blockquote>
<p class="MsoNormal" style="text-align:justify;"><span style="font-family:&#34;" lang="EN-US">The training of a neural network facilitates it to learn</span><span style="font-family:&#34;" lang="EN-US"> </span><span style="font-family:&#34;" lang="EN-US">to reproduce a mapping from a set of input vectors and</span><span style="font-family:&#34;" lang="EN-US"> </span><span style="font-family:&#34;" lang="EN-US">the corresponding set of desired output vectors. <!--more--></span></p>
</blockquote>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">The input and output vectors are</span><span style="font-size:12pt;line-height:200%;font-family:&#34;"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">presented via the input and output layers, respectively.</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">The input layer fans out the input data without making</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">calculations. The data flow along the connection towards</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">the hidden and the output layers. Each unit in the hidden</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">layer transforms the incoming data by executing specified</span><span style="font-size:12pt;line-height:200%;font-family:&#34;"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">functions. It then outputs the transformed data to the</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">next layer. Each unit in the output layer makes a similar</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">transformation on the data from the hidden layer and,</span><span style="font-size:12pt;line-height:200%;font-family:&#34;"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">optionally, from the input layer. The final result is that</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">the input vector is mapped into some corresponding</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">output vector at the output layer.</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">If learning is facilitated, the actual output vector is</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">compared with the desired output vector, and the error</span><span style="font-size:12pt;line-height:200%;font-family:&#34;"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">between the two vectors is calculated. The error values are then used to calculate the</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">weights for all output and hidden layer processing units</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">and thereby reduce the error in the network output. This</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">process is repeated until the mapping has been trained to</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">the desired accuracy or until it appears that the network</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">has learned as well as it can. For a given set of training</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">data, a particular set of weights will result in some degree</span><span style="font-size:12pt;line-height:200%;font-family:&#34;"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">of mapping accuracy. The purpose is to find a set of</span><span style="font-size:12pt;line-height:200%;font-family:&#34;"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">weights that will minimize error. </span><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Input features were for the models were image features including color, morphology and textural features, respectively. A three layer structure shown in Figure 1 was adapted for all the models. </span></p>
<p class="MsoNormal" style="line-height:200%;text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-01.jpg"><img class="size-full wp-image-58 aligncenter" title="nn-01" src="http://samuraielit.wordpress.com/files/2008/11/nn-01.jpg" alt="nn-01" width="455" height="283" /></a></span></p>
<p class="MsoNormal" style="line-height:200%;text-align:center;"><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--><!--  /* Font Definitions */  @font-face 	{font-family:"ＭＳ 明朝"; 	panose-1:2 2 6 9 4 2 5 8 3 4; 	mso-font-alt:"MS Mincho"; 	mso-font-charset:128; 	mso-generic-font-family:roman; 	mso-font-pitch:fixed; 	mso-font-signature:-1610612033 1757936891 16 0 131231 0;} @font-face 	{font-family:Century; 	panose-1:2 4 6 4 5 5 5 2 3 4; 	mso-font-charset:0; 	mso-generic-font-family:roman; 	mso-font-pitch:variable; 	mso-font-signature:647 0 0 0 159 0;} @font-face 	{font-family:"\@ＭＳ 明朝"; 	panose-1:2 2 6 9 4 2 5 8 3 4; 	mso-font-charset:128; 	mso-generic-font-family:roman; 	mso-font-pitch:fixed; 	mso-font-signature:-1610612033 1757936891 16 0 131231 0;}  /* Style Definitions */  p.MsoNormal, li.MsoNormal, div.MsoNormal 	{mso-style-parent:""; 	margin:0mm; 	margin-bottom:.0001pt; 	text-align:justify; 	text-justify:inter-ideograph; 	mso-pagination:none; 	font-size:10.5pt; 	mso-bidi-font-size:12.0pt; 	font-family:Century; 	mso-fareast-font-family:"ＭＳ 明朝"; 	mso-bidi-font-family:"Times New Roman"; 	mso-font-kerning:1.0pt;}  /* Page Definitions */  @page 	{mso-page-border-surround-header:no; 	mso-page-border-surround-footer:no;} @page Section1 	{size:612.0pt 792.0pt; 	margin:99.25pt 30.0mm 30.0mm 30.0mm; 	mso-header-margin:36.0pt; 	mso-footer-margin:36.0pt; 	mso-paper-source:0;} div.Section1 	{page:Section1;} --><!--[if gte mso 10]&#62; &#60;!   /* Style Definitions */  table.MsoNormalTable 	{mso-style-name:"Table Normal"; 	mso-tstyle-rowband-size:0; 	mso-tstyle-colband-size:0; 	mso-style-noshow:yes; 	mso-style-parent:""; 	mso-padding-alt:0mm 5.4pt 0mm 5.4pt; 	mso-para-margin:0mm; 	mso-para-margin-bottom:.0001pt; 	mso-pagination:widow-orphan; 	font-size:10.0pt; 	font-family:"Times New Roman"; 	mso-fareast-font-family:"Times New Roman"; 	mso-ansi-language:#0400; 	mso-fareast-language:#0400; 	mso-bidi-language:#0400;} --> <!--[endif]--><strong><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Fig. 1 </span></strong><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Architecture of neural network (BPNN) models.</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--><!--  /* Font Definitions */  @font-face 	{font-family:"ＭＳ 明朝"; 	panose-1:2 2 6 9 4 2 5 8 3 4; 	mso-font-alt:"MS Mincho"; 	mso-font-charset:128; 	mso-generic-font-family:roman; 	mso-font-pitch:fixed; 	mso-font-signature:-1610612033 1757936891 16 0 131231 0;} @font-face 	{font-family:Century; 	panose-1:2 4 6 4 5 5 5 2 3 4; 	mso-font-charset:0; 	mso-generic-font-family:roman; 	mso-font-pitch:variable; 	mso-font-signature:647 0 0 0 159 0;} @font-face 	{font-family:"\@ＭＳ 明朝"; 	panose-1:2 2 6 9 4 2 5 8 3 4; 	mso-font-charset:128; 	mso-generic-font-family:roman; 	mso-font-pitch:fixed; 	mso-font-signature:-1610612033 1757936891 16 0 131231 0;}  /* Style Definitions */  p.MsoNormal, li.MsoNormal, div.MsoNormal 	{mso-style-parent:""; 	margin:0mm; 	margin-bottom:.0001pt; 	text-align:justify; 	text-justify:inter-ideograph; 	mso-pagination:none; 	font-size:10.5pt; 	mso-bidi-font-size:12.0pt; 	font-family:Century; 	mso-fareast-font-family:"ＭＳ 明朝"; 	mso-bidi-font-family:"Times New Roman"; 	mso-font-kerning:1.0pt;}  /* Page Definitions */  @page 	{mso-page-border-surround-header:no; 	mso-page-border-surround-footer:no;} @page Section1 	{size:612.0pt 792.0pt; 	margin:99.25pt 30.0mm 30.0mm 30.0mm; 	mso-header-margin:36.0pt; 	mso-footer-margin:36.0pt; 	mso-paper-source:0;} div.Section1 	{page:Section1;} --><!--[if gte mso 10]&#62; &#60;!   /* Style Definitions */  table.MsoNormalTable 	{mso-style-name:"Table Normal"; 	mso-tstyle-rowband-size:0; 	mso-tstyle-colband-size:0; 	mso-style-noshow:yes; 	mso-style-parent:""; 	mso-padding-alt:0mm 5.4pt 0mm 5.4pt; 	mso-para-margin:0mm; 	mso-para-margin-bottom:.0001pt; 	mso-pagination:widow-orphan; 	font-size:10.0pt; 	font-family:"Times New Roman"; 	mso-fareast-font-family:"Times New Roman"; 	mso-ansi-language:#0400; 	mso-fareast-language:#0400; 	mso-bidi-language:#0400;} --> <!--[endif]--><span style="font-size:12pt;font-family:&#34;" lang="EN-US">During the forward propagation, the network transfers its input data as shown by equation (1), where <em>x<sub>i</sub></em> is the activation level of unit <em>i</em>, and <em>v<sub>ij</sub></em> is the synapse weight from unit <em>i</em> to unit <em>j</em> (unit <em>i </em>and <em>j</em> are in the input and hidden layers, respectively), and <em>z_in<sub>j</sub></em> is the weighted sum of inputs to the <em>j<sup>th</sup></em> unit in the hidden layer.</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-02.jpg"><img class="size-full wp-image-59 alignleft" title="nn-02" src="http://samuraielit.wordpress.com/files/2008/11/nn-02.jpg" alt="nn-02" width="193" height="64" /></a> </span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">equation (1)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The hidden unit <em>j</em> has a sigmoid transfer function that computes the output <em>z<sub>j</sub></em><sub> </sub>shown by equation (2). The output <em>z<sub>j</sub> </em>becomes the next input for the output unit <em>k</em>, which has a summation through another synapse weight <em>w<sub>jk</sub></em>, <em>i</em>=1,2,…<em>m</em>, <em>j</em>=1,2,…<em>h</em> and <em>k</em>=1,2,…<em>n</em>. The weighted sum of inputs <em>y_in<sub>k</sub></em> in equation (3) received by the output unit <em>k</em> undergoes a transfer function <em>y<sub>k</sub></em>, expressed by equation (4).</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-03.jpg"><img class="size-full wp-image-60 alignleft" title="nn-03" src="http://samuraielit.wordpress.com/files/2008/11/nn-03.jpg" alt="nn-03" width="153" height="70" /></a><br />
</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">equation (2)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-04.jpg"><img class="size-full wp-image-61 alignleft" title="nn-04" src="http://samuraielit.wordpress.com/files/2008/11/nn-04.jpg" alt="nn-04" width="193" height="59" /></a></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">equation (3)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><br />
</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-05.jpg"><img class="size-full wp-image-62 alignleft" title="nn-05" src="http://samuraielit.wordpress.com/files/2008/11/nn-05.jpg" alt="nn-05" width="130" height="58" /></a></span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">equation (4)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The backward propagation involves calculating, for all processing units, error values that are used during synapse weight adjustments. The calculations being at the output layer and progress backward through the network to the input layer. Equation (5), respectively, compute the error values δ<em><sub>k</sub></em><sub> </sub>for unit <em>k</em> in the output layer and unit <em>j</em> in the hidden layer. In the equations, <em>t<sub>k</sub></em> and <em>y<sub>k</sub></em> are the target and the output values of unit <em>k</em>, respectively, <em>f’(x)</em> is the derivative of the sigmoid function <em>f</em>, and <em>y_in<sub>k</sub></em> is the weighted sum of inputs to <em>j</em> and <em>k</em>, respectively. For the hidden layer, a weighted sum is taken of the values of δ for all units that receive output from unit <em>j</em>.</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-06.jpg"><img class="size-full wp-image-63 alignleft" title="nn-06" src="http://samuraielit.wordpress.com/files/2008/11/nn-06.jpg" alt="nn-06" width="229" height="35" /></a> equation (5)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Each synapse weight is adjusted by taking into account the δ value of the unit that receives input from that interconnection. The weight adjustment is based on equation (6 and 7), where α is the learning rate which is the error value of the target unit, and <em>z<sub>j</sub></em> is the output value of the originating unit.</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-07.jpg"><img class="size-full wp-image-64 alignleft" title="nn-07" src="http://samuraielit.wordpress.com/files/2008/11/nn-07.jpg" alt="nn-07" width="133" height="37" /></a> equation (6)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><br />
</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-08.jpg"><img class="size-full wp-image-65 alignleft" title="nn-08" src="http://samuraielit.wordpress.com/files/2008/11/nn-08.jpg" alt="nn-08" width="121" height="38" /></a> equation (7)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">In every hidden unit <em>z<sub>j</sub></em><sub> </sub>­, <em>j</em>= 1,2,…<em>h</em> we can calculate error information in equation (9) by using weighted input in equation (8) and its derivative value.</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-09.jpg"><img class="size-full wp-image-66 alignleft" title="nn-09" src="http://samuraielit.wordpress.com/files/2008/11/nn-09.jpg" alt="nn-09" width="145" height="55" /></a> </span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">equation (8)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><br />
</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-10.jpg"><img class="size-full wp-image-67 alignleft" title="nn-10" src="http://samuraielit.wordpress.com/files/2008/11/nn-10.jpg" alt="nn-10" width="217" height="38" /></a> equation (9)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The corrected weight in hidden layer can be calculated using equation (10) and equation (11) which will be used to improve the synapse weight <em>v<sub>ij</sub></em>.</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-11.jpg"><img class="size-full wp-image-68 alignleft" title="nn-11" src="http://samuraielit.wordpress.com/files/2008/11/nn-11.jpg" alt="nn-11" width="145" height="42" /></a> equation (10)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><br />
</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-12-copy.jpg"><img class="size-full wp-image-69 alignleft" title="nn-12-copy" src="http://samuraielit.wordpress.com/files/2008/11/nn-12-copy.jpg" alt="nn-12-copy" width="133" height="44" /></a> equation (11)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Every output unit <em>y<sub>k</sub></em>, <em>k=1,2,…n</em> will improve bias value and synapse weight <em>w<sub>jk</sub></em> value <em>j</em>=<em>1,2,…h</em> as shown in equation (12).</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-13.jpg"><img class="size-full wp-image-70 alignleft" title="nn-13" src="http://samuraielit.wordpress.com/files/2008/11/nn-13.jpg" alt="nn-13" width="217" height="38" /></a> equation (12)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Every hidden unit <em>z<sub>j</sub></em>, <em>j=1,2,…h</em> will improve bias value and synapse weight <em>v<sub>ij</sub></em> value <em>i=1,2,…m</em> as shown in equation (13).</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-14.jpg"><img class="size-full wp-image-71 alignleft" title="nn-14" src="http://samuraielit.wordpress.com/files/2008/11/nn-14.jpg" alt="nn-14" width="181" height="37" /></a> equation (13)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">The number of neurons in the input layer was determined by the number of input features. The number of neurons in the hidden layer was determined by trial and error. The output layer consisted of a single neuron. The MSE given by equation 14 was used as the performance criterion for the models:</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-15.jpg"><img class="size-full wp-image-72 alignleft" title="nn-15" src="http://samuraielit.wordpress.com/files/2008/11/nn-15.jpg" alt="nn-15" width="166" height="49" /></a> equation (14)</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;">
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US">where: <em>N<sub>n</sub></em> is number of input feature vectors, <em>S<sub>i</sub></em> is the water content predicted by the BPNN model, and <em>St<sub>i</sub></em> is the target of water content.</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">In this study, the BPNN theory, generally accepted as a useful tool for the recognition of various patterns, and image processing technique were used for the development of the desired software. </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">A three layer BPNN model with default number of neurons in one hidden layer was used in this study. The sample’s color, morphology and textural features were used to develop BPNN models for water content estimation. The 212 samples data of Sunagoke moss were randomized</span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"> and divided into two parts which were 75% data as training set and 25% data as validation set. The models were trained in 400 iterations. </span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">Neural network model performance was tested successfully to describe the relationship between water content and image features. Comparison analysis as shown in table 1 was conducted to find the best model to determine water content using color, morphology and textural features and three layers BPNN. The validation-set results show that BPNN method can estimate water content of Sunagoke moss better than SPC method using 4 image features <em>i.e</em>: (1) green/red ratio mean value; (2) blue index; (3) blue mean value and (4) green index with the reliability improvement value of 82.33%. The performance of BPNN using all features (106 features) has shown good result in training but not so well in validation. The combination of Saturation<sub>HSV</sub> CCM textural features performed better in detecting water content than other models respectively based on validation-set with the MSE of 0.0226. The most five contributing parameters for the water content estimation using BPNN based on validation-set were: (1) Saturation<em><sub>HSV</sub></em> CCM textural features (MSE: 0.0226); (2) Saturation<em><sub>HSL</sub></em> CCM textural features (MSE: 0.0239); (3) Red CCM textural features (MSE: 0.0261); (4) Blue CCM textural features (MSE: 0.0261) and (5) Green CCM textural features (MSE: 0.0273).</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:center;"><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--><br />
<strong><span style="font-size:12pt;font-family:&#34;" lang="EN-US">Table 1</span></strong><span style="font-size:12pt;font-family:&#34;" lang="EN-US"> Comparison analysis using SPC and BPNN.</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:center;"><span style="font-size:12pt;font-family:&#34;" lang="EN-US"><a href="http://samuraielit.wordpress.com/files/2008/11/nn-16.jpg"><img class="size-full wp-image-73 aligncenter" title="nn-16" src="http://samuraielit.wordpress.com/files/2008/11/nn-16.jpg" alt="nn-16" width="455" height="684" /></a><br />
</span></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Feature Selection (basic overview)]]></title>
<link>http://samuraielit.wordpress.com/2008/11/24/feature-selection-basic-overview/</link>
<pubDate>Mon, 24 Nov 2008 06:38:21 +0000</pubDate>
<dc:creator>samuraielit</dc:creator>
<guid>http://samuraielit.wordpress.com/2008/11/24/feature-selection-basic-overview/</guid>
<description><![CDATA[Selecting features that are suitable for an application is one of the most important parts in solvin]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p><!--[if gte mso 9]&#62;  Normal 0  0 2  false false false               MicrosoftInternetExplorer4  &#60;![endif]--><!--[if gte mso 9]&#62;   &#60;![endif]--><!--[if !mso]&#62;--></p>
<blockquote>
<p class="MsoNormal" style="text-align:justify;"><span style="font-family:&#34;" lang="EN-US">Selecting features that are suitable for an application is one of the most important parts in solving the problem.<!--more--></span></p>
</blockquote>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">Feature subset selection is the process of identifying and removing as much irrelevant and redundant information as possible. This reduces the dimensionality of the data and may allow learning algorithms to operate faster and more effectively. In some cases, accuracy on future classification can be improved; in others, the result is a more compact, easily interpreted representation of the target concept.</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">FS algorithms perform a search through the space of feature subsets, and, as a consequence, must address four basic issues affecting the nature of the search (Langley, 1994):</span></p>
<p class="MsoNormal" style="margin-left:18pt;text-indent:-18pt;line-height:200%;text-align:justify;"><!--[if !supportLists]--><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"><span>1.<span style="font-family:&#34;font-style:normal;font-variant:normal;font-weight:normal;font-size:7pt;line-height:normal;"> </span></span></span><!--[endif]--><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">Starting point. Selecting a point in the feature subset space from which to begin the search can affect the direction of the search. One option is to begin with no features and successively add attributes. In this case, the search is said to proceed forward through the search space. Conversely, the search can begin with all features and successively remove them. In this case, the search proceeds backwards through the search space. Another alternative is to begin somewhere in the middle and move outwards from this point.</span></p>
<p class="MsoNormal" style="margin-left:18pt;text-indent:-18pt;line-height:200%;text-align:justify;"><!--[if !supportLists]--><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"><span>2.<span style="font-family:&#34;font-style:normal;font-variant:normal;font-weight:normal;font-size:7pt;line-height:normal;"> </span></span></span><!--[endif]--><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">Search organization. An exhaustive search of the feature subspace is prohibitive for all but a small initial number of features. With <em>N</em> initial features there exist 2<sup>N</sup>-1 possible subsets. Heuristic search strategies are more feasible than exhaustive ones and can give good results, although they do not guarantee finding the optimal subset. </span></p>
<p class="MsoNormal" style="margin-left:18pt;text-indent:-18pt;line-height:200%;text-align:justify;"><!--[if !supportLists]--><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"><span>3.<span style="font-family:&#34;font-style:normal;font-variant:normal;font-weight:normal;font-size:7pt;line-height:normal;"> </span></span></span><!--[endif]--><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">Evaluation strategy. How feature subsets are evaluated is the single biggest differentiating factor among feature selection algorithms for machine learning.</span></p>
<p class="MsoNormal" style="margin-left:18pt;text-indent:-18pt;line-height:200%;text-align:justify;"><!--[if !supportLists]--><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US"><span>4.<span style="font-family:&#34;font-style:normal;font-variant:normal;font-weight:normal;font-size:7pt;line-height:normal;"> </span></span></span><!--[endif]--><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">Stopping criterion. A feature selector must decide when to stop searching through the space of feature subsets. Depending on the evaluation strategy, a feature selector might stop adding or removing features when none of the alternatives improves upon the merit of a current feature subset. Alternatively, the algorithm might continue to revise the feature subset as long as the merit does not degrade. A further option could be to continue generating feature subsets until reaching the opposite end of the search space and then select the best.</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">As many pattern recognition techniques were originally not designed to cope with large amounts of irrelevant features, combining them with FS techniques has become a necessity in many applications. The objectives of FS are manifold, the most important ones being: a) to avoid over-fitting and improve model performance, <em>i.e.</em> prediction performance in the case of supervised classification and better cluster detection in the case of clustering, b) to provide faster and more cost-effective models, and c) to gain a deeper insight into the underlying processes that generated the data.</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">FS techniques can be organized into three categories depending on how they combine the FS search with the construction of the classification/prediction model: filter methods, wrapper methods and embedded methods. In this study we focus to solve FS problem using filter and wrapper methods. Filter techniques assess the relevance of features by looking only at the intrinsic properties of the data. Whereas filter techniques treat the problem of finding a good feature subset independently of the model selection step, wrapper methods embed the model hypothesis search within the feature subset search. In a third class of FS, termed embedded techniques, the search for an optimal subset of features is built into the classifier construction, and can be seen as a search in the combined space of feature subsets and hypotheses. Just like wrapper approach, embedded approaches are thus specific to a given learning algorithm. Embedded methods have the advantage that they include the interaction with the classification/prediction model, while at the same thing being far less computationally intensive than wrapper methods.</span></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Pattern Recognition (basic overview)]]></title>
<link>http://samuraielit.wordpress.com/2008/11/24/pattern-recognition-basic-overview/</link>
<pubDate>Mon, 24 Nov 2008 06:05:05 +0000</pubDate>
<dc:creator>samuraielit</dc:creator>
<guid>http://samuraielit.wordpress.com/2008/11/24/pattern-recognition-basic-overview/</guid>
<description><![CDATA[Pattern recognition, one of the fields of machine learning, is defined as the imposition of identity]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><blockquote>
<p class="MsoNormal" style="text-align:justify;"><span style="font-family:&#34;" lang="EN-US">Pattern recognition, one of the fields of machine learning, is defined as the imposition of identity on input data, such as speech, images, or a stream of text, by the recognition and delineation of patterns it contains and their relationship. <!--more--></span></p>
</blockquote>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">Methods of pattern recognition are used to classify recurring patterns in data on the basis of either a priory knowledge or information directly extracted from the data.Thus, the resulting learning strategy is characterized as either supervised or unsupervised learning. Normally, pattern recognition involves gathering observations on certain objects in a standardized manner and classifying them on the basis of a formerly agreed set of object features.</span></p>
<p class="MsoNormal" style="line-height:200%;text-align:justify;"><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">In the past decade, various researchers have used image processing and pattern recognition techniques in agricultural applications. The underlying approach for all of the pattern recognition techniques is the same. First, images are acquired from the environment using an analog, digital, or video camera. Then, image processing and image analysis techniques are applied to extract useful features that are necessary for further analysis of these images. Afterwards, discriminant techniques are employed to classify the images, using such techniques as parametric or non-parametric statistical and neural networks (NN), which are available to address the specific problem at hand. The selection of the image processing techniques and the classification strategies are important for the successful implementation of any machine vision system, and are typically application dependent.</span><span style="font-size:12pt;line-height:200%;font-family:&#34;"> </span><span style="font-size:12pt;line-height:200%;font-family:&#34;" lang="EN-US">In the past few years, there have been numerous studies of the application of NN in the research related to agriculture. NN is an aspect of artificial intelligence (AI) research. </span></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[CCTV Camera Whole Saler &amp; Distributor In India &amp; Abroad]]></title>
<link>http://cctvsecurity.wordpress.com/2008/11/15/cctvcamera/</link>
<pubDate>Sat, 15 Nov 2008 11:33:12 +0000</pubDate>
<dc:creator>aditgroups</dc:creator>
<guid>http://cctvsecurity.wordpress.com/2008/11/15/cctvcamera/</guid>
<description><![CDATA[  WELCOME TO ADIT ADIT Enterprise is a wholesale distribution business providing complete range of E]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p> </p>
<table id="middlemaintable" border="0" cellspacing="0" cellpadding="0" width="100%">
<tbody>
<tr>
<td>
<table border="0" cellspacing="0" cellpadding="0" width="100%">
<tbody>
<tr>
<td align="left" valign="bottom">
<h1 class="title1">WELCOME <span class="title2">TO ADIT</span></h1>
</td>
</tr>
<tr>
<td><img src="http://aditgroup.com/images/spacer.gif" alt="" width="1" height="5" /></td>
</tr>
<tr>
<td align="left" valign="top">
<p class="normaltext"><strong>ADIT Enterprise</strong> is a wholesale distribution business providing complete range of Electronic Security Systems all over India &#38; abroad.</p>
<p class="normaltext">ADIT Enterprise is a professional, distinguished Distribution Company in the Electronic surveillance industry, a leading company in the Global Industry for full range of <a href="http://aditgroup.com/products/cctv/cctv_camera.htm"><strong>CCTV solutions</strong></a> (camera, CCTV surveillance system, switcher, recorder, accessories and many more), Fire Alarm Systems, Time Attendance &#38; Access Control System, P.A System, Hotel Automation System and others also. Continuously for 24 hours &#38; 365 days our Technical team is looking for new products with latest technology and latest fashion design to meet changing market requirements.</p>
<p class="normaltext">Company’s Main Products are <span class="producttitle"><a href="http://aditgroup.com/products/cctv/cctv_camera.htm">CCTV System</a>,</span> <span class="producttitle" title="cctv switcher"><a href="http://aditgroup.com/products/cctv/cctv_switcher.htm">Switcher, </a></span><span class="producttitle" title="cctv recorder"><a href="http://aditgroup.com/products/cctv/cctv_recorder.htm">Recorder,</a></span> <span class="producttitle"><a title="CCTV Accessories" href="http://aditgroup.com/products/cctv/cctv_accessories.htm">Accessories,</a></span> <span class="producttitle" title="Fire Alarm system"><a href="http://aditgroup.com/products/fire_alarm/fire_panel.htm">Fire Alarm System,</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-amlifier.htm">P.A. system,</a></span><span class="producttitle"><a href="http://aditgroup.com/products/hotel-automation/hotel-automation.htm">Hotel Automation,</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/fire_alarm/fire_panel.htm">Intelligent system,</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/fire_alarm/fire_conventional_dectector.htm">Conventional system, </a></span><span class="producttitle"><a href="http://aditgroup.com/products/fire_alarm/fire_gas.htm">Gas extinguishing system,</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/box-speaker/box-speaker.htm">Box Speaker</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-ceiling-speaker.htm">, Ceiling speaker</a></span>, <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-wall-mount-speaker.htm">Wall Mount Speaker, </a></span><span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-art-panel.htm">Art Frame Speaker,</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-column-speaker.htm">Column Speaker</a></span>, <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-garden-speaker.htm">Garden Speaker,</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-projection-speaker.htm">Projection Speakers</a></span>,<span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-volume-control.htm">Volume Control,</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-amlifier.htm">Amplifier</a></span>, <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-conference-system.htm">Conference System,</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-desktop-mike.htm">Desktop Mike,</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-pendant-speakers.htm">Pendant Speakers,</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-handheld-microphones.htm">Handheld Microphones,</a></span><span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-wireless-microphone.htm">Wireless Microphone,</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-microphone-stand.htm">Microphone Stands,</a></span> <span class="producttitle">Wireless Conference,</span> <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/p-a-zone-speaker-selector.htm">Zone Speaker Selector, </a></span><span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/monitor-panel/01-monitor-panel-at-z217.htm">Monitor Panel,</a></span><span class="producttitle">Emergency Panel,</span> <span class="producttitle"><a href="http://aditgroup.com/products/p-a-system/pre-amplifier/01-pre-amplifier-at-z216.htm">Pre Amplifier</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/hotel-automation/hotel-automation.htm">, Hotel Automation,</a></span> <span class="producttitle"><a href="http://aditgroup.com/products/ta_access/ta_access.htm">T.A. Access</a></span>.</p>
<p class="normaltext">We attach great attention to product quality, and conduct strict QC procedures. We believe our excellent products could bring lots of profits to our Dealers and Distributors.</p>
<p><strong>Our Commitment to our Clients:</strong></p>
<ul class="list">
<li>Commitment to Quality</li>
<li>Product Training Program</li>
<li>Wide range of products</li>
<li>Services Support</li>
<li>Competitive pricing</li>
<li>Latest Technologies &#38; Features</li>
<li>Ready Stock</li>
<li>Promotional Support</li>
<li>Technical Support in your Projects</li>
</ul>
<p> </td>
</tr>
</tbody>
</table>
</td>
</tr>
<tr>
<td><img src="http://aditgroup.com/images/spacer.gif" alt="" width="1" height="15" /></td>
</tr>
<tr>
<td>
<table border="0" cellspacing="0" cellpadding="0" width="100%">
<tbody>
<tr>
<td align="left" valign="bottom">
<h1 class="title1">RANGE OF <span class="title2">PRODUCTS</span></h1>
</td>
</tr>
<tr>
<td>
<table border="0" cellspacing="0" cellpadding="0" width="100%" align="center">
<tbody>
<tr>
<td width="141" height="85"><img src="http://aditgroup.com/images/cctv_thumb.gif" alt="CCTV Camera" width="130" height="72" /></td>
<td width="141"><img src="http://aditgroup.com/images/fire_alarm_thumb.gif" alt="Fire Alarm System" width="130" height="72" /></td>
<td width="141"><img src="http://aditgroup.com/images/time_thumb.gif" alt="Time Attendance" width="130" height="72" /></td>
<td width="141"><img src="http://aditgroup.com/images/pa_thumb.gif" alt="PA System" width="130" height="72" /></td>
<td>      </p>
<p> </td>
</tr>
<tr>
<td class="color1"><a title="CCTV Camera" href="http://aditgroup.com/products/cctv/cctv_camera.htm">CCTV Camera</a></td>
<td class="color2"><a title="Fire Alarm System" href="http://aditgroup.com/products/fire_alarm/fire_panel.htm">Fire Alaram System</a></td>
<td class="color3"><a title="Time Attendance" href="http://aditgroup.com/products/ta_access/ta_access.htm">Time Attendance</a></td>
<td class="color4"><a title="PA System" href="http://aditgroup.com/products/p-a-system/p-a-ceiling-speaker.htm">PA System</a></td>
<td class="color5"><span style="text-decoration:underline;"><br />
</span></td>
</tr>
</tbody>
</table>
</td>
</tr>
</tbody>
</table>
</td>
</tr>
</tbody>
</table>
<p style="text-align:center;"><a title="Bookmark and Share" rel="nofollow" href="http://www.addthis.com/bookmark.php" target="_blank"><img src="http://s7.addthis.com/button1-share.gif" border="0" alt="Bookmark and Share" width="125" height="16" /></a></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Web Semantic overview]]></title>
<link>http://nttuyen.wordpress.com/2008/06/02/web-semantic-overview/</link>
<pubDate>Mon, 02 Jun 2008 09:17:11 +0000</pubDate>
<dc:creator>nttuyen</dc:creator>
<guid>http://nttuyen.wordpress.com/2008/06/02/web-semantic-overview/</guid>
<description><![CDATA[Đây là bài giới thiệu về web semantic được lấy từ trang  phpvn.org . Semantic web hay web ngữ nghĩa ]]></description>
<content:encoded><![CDATA[Đây là bài giới thiệu về web semantic được lấy từ trang  phpvn.org . Semantic web hay web ngữ nghĩa ]]></content:encoded>
</item>
<item>
<title><![CDATA[REGIS: Cari Cari Paper Web 3.0]]></title>
<link>http://linuxgembel.wordpress.com/2008/03/15/regis-cari-cari-paper-web-30/</link>
<pubDate>Sat, 15 Mar 2008 11:10:55 +0000</pubDate>
<dc:creator>Kiki Ahmadi</dc:creator>
<guid>http://linuxgembel.wordpress.com/2008/03/15/regis-cari-cari-paper-web-30/</guid>
<description><![CDATA[So she said what&#8217;s the problem baby What&#8217;s the problem I don&#8217;t know Well maybe I]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p><font face="Verdana" size="5"><font size="2"><i> So she said what&#8217;s the problem baby<br />
What&#8217;s the problem I don&#8217;t know<br />
Well maybe I&#8217;m in love (love)<br />
Think about it every time<br />
I think about it<br />
Can&#8217;t stop thinking &#8217;bout it<br />
- Accidentally In Love</i></font></font></p>
<p>KENAPA NERAKA!!!! Beeuuhh, barusan tau dari <a href="http://kholes.wordpress.com" title="kholes!!!" target="_blank">kholes</a> . Ternyata senen besok ada kelas REGIS : Research Group On Intelligent System jam setengah 4 sore. Padahal harusnya seperti yang sudah distate oleh advisor REGIS (Pak Ruly Soelaiman Skom Mkom), pertemuan selanjutnya setiap <strike>korban</strike> pengikut REGIS ini diharapkan sudah membawa (dan membaca tentunya) paper untuk didiskusikan belum. Langsung deh blingsatan dan gelagapan. Mulai obok obok<a href="http://ieee.com" title="horror" target="_blank"> IEEE</a> dan google deh saya.</p>
<p>Mulailah dengan sesuatu yang anda minati, begitu nasehat dari advisor REGIS. Karena bingung apa yang sebenarnya saya minati , makanya saya gak mulai mulai (BEUUH!!). Setelah memaksa dan menarik diri saya sendiri, mulai deh saya browsing. Mulai untuk mencari cari topik dalam belantara Intelligent System yang penuh dengan rumus rumus liar, pasir hisap integral differensial dan angka angka haus darah. Akhirnya ada satu topik yang menarik buat saya, <b>web 3.0.</b></p>
<p><img src="http://www.digitalrhetoric.org/course/web1to3.jpg" alt="Web 3.0" height="309" width="470" /><br />
<i><br />
Generasi Web, diambil dari <a href="http://www.digitalrhetoric.org/course" title="retorika digital" target="_blank">sini</a></i></p>
<p><!--more--></p>
<p>Merangkum apa yang sudah tertulis di wikipedia, web 3.0 sebenarnya hanya terminologi yang digunakan oleh orang orang yang berkecimpung di dunia web untuk menggambarkan generasi baru dari dunia WWW. Beberapa inovasi yang diprediksikan dapat menjadi pemicu alih generasi web dari 2.0 ke 3.0 adalah :</p>
<ul>
<li>Web Semantik (saya masih belum ngeh masalah ini)</li>
<li>Mashups (menggabungkan konten dari macem macem web untuk personalisasi)</li>
<li>Service Oriented Architecture (WSDL, SOAP, Web Service, BPEL!!  Ampun DJ!! calon TA gua!!!)</li>
<li>3D Web Apps (kayak <a href="http://www.secondlife.com" title="secondlife" target="_blank">SecondLife</a> gtu mungkin)</li>
<li>Data Web &#38; Web Mining (Web sebagai database)</li>
<li>Intelligent Web (Nah ini yang saya pengen bahas, blum ngerti tapi)</li>
</ul>
<p>Untuk paper REGIS, masih nyari nyari yang masalah Intelligent Web ini. Setelah beberapa puluh menit dihabiskan. Cuman nemu 2 abstrak paper doank. Karena dua paper ini ada di jurnal berbayar, jadi bingung gimana cara nya donlot.</p>
<p>Dua paper yang saya temukan ini antara lain :</p>
<ul>
<li><i><span class="headNavBlueXLarge2">                                                              Adapting agent communication languages for semantic Web service inter-communication</span></i></li>
<li><span class="headNavBlueXLarge2"><i>A fuzzy web intelligence application: web-based fuzzy expert agents for online learning evaluation</i><br />
</span></li>
</ul>
<p><span class="headNavBlueXLarge2">Yang pertama mbahas masalah komunikasi data untuk web semantik.Yang kedua implementasi logika fuzzy untuk penentuan keputusan berdasarkan penalaran halus (soft reasoning) berbasis web. Tenang bro, kedua duanya saya juga sama sekali gak <b>NGERTI BLAS. </b> Yang kedua kayaknya yang lebih masuk ke Intelligent System. Kata kata &#8220;fuzzy&#8221; udah bikin bergidik, untungnya di abstrak paper tersebut disebutkan bahwa implementasinya menggunakan servlet dan JDBC. Lumayanlah buat memotivasi sedikit. <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />   </span></p>
<p>Sementara ini masih menceburkan diri ke wikipedia untuk mencoba mengerti beberapa istilah istilah bahasa klingon yang menghambat proses untuk memahami kedua paper <strike>laknat</strike> tersebut. Beberapa istilah tersebut antara lain:</p>
<ul>
<li>Fuzzy Logic</li>
<li>Soft Computing</li>
<li>Orchestration</li>
<li>Context Aware</li>
<li>Semantic Web</li>
<li>Ontology</li>
<li>Web Mining</li>
</ul>
<p>Tampaknya malem minggu ini saya habiskan dengan <a href="http://linuxgembel.wordpress.com/2008/03/09/malem-minggu-boosting-my-brains/" title="Kapan saya punya pacar" target="_blank">brain boosting</a> lagi deh. Kapan gak jomblonya klo kayak gini terus T_T. Semangat temen temen!!!</p>
<p><i>just open up your heart and let the sun shine in<br />
- frente</i></p>
<p>Tulisan terkait</p>
<ul>
<li> <a href="http://linuxgembel.wordpress.com/2008/03/07/regis-session-research-what-how-and-why/" target="_blank">REGIS Session: Research What, How and Why</a></li>
<li><a href="http://linuxgembel.wordpress.com/2008/02/22/intelligent-system-research-group/" target="_blank">Intelligent System Research Group</a></li>
<li><a href="http://linuxgembel.wordpress.com/2008/02/22/3-bidang-minat/" target="_blank">3 Bidang Minat</a></li>
<li><a href="http://linuxgembel.wordpress.com/2008/03/09/malem-minggu-boosting-my-brains/" target="_blank">Malem minggu: Boosting my brains</a></li>
</ul>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Intelligent System Research Group]]></title>
<link>http://linuxgembel.wordpress.com/2008/02/22/intelligent-system-research-group/</link>
<pubDate>Fri, 22 Feb 2008 14:56:48 +0000</pubDate>
<dc:creator>Kiki Ahmadi</dc:creator>
<guid>http://linuxgembel.wordpress.com/2008/02/22/intelligent-system-research-group/</guid>
<description><![CDATA[no, what do you own the world? How do you own disorder, disorder, Now, somewhere between the sacred ]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p><i> no, what do you own the world?<br />
How do you own disorder, disorder,<br />
Now, somewhere between the sacred silence,<br />
Sacred silence and sleep,<br />
Somewhere, between the sacred silence and sleep,<br />
Disorder, disorder, disorder.<br />
- Toxicity, System Of A Down</i></p>
<p><i></i><br />
Hari kamis kemaren adalah pertemuan pertama dari mata kuliah Intelligent System. Mata kuliah yang saya anggap angker. Dan kebetulan di ampu (di ajar) oleh dosen yang &#8220;angker&#8221; juga. Sebelumnya saya sebenarnya pengen menghindar dari dosen teresebut, tetapi karena dua kelas beliau semua yang mengajar ya apa boleh buat. Kenapa mata kuliah ini angker?because its all about mathematics and stuff. Bayangin aja gimana kedernya waktu mendengarkan penjelasan beliau mengenai integral tingkat 10. Im really suck at math dan mata kuliah ini bakal jadi mimpi buruk bagi saya.</p>
<p>Setelah beberapa menit pembukaan dan overview mengenai machine learning, neural network dan review paper beliau, ada sesuatu yang benar benar baru saya dengar sepanjuang sejarah perkuliahan saya. Pak Rully Soelaiman, dosen saya ini menawarkan untuk membagi kelas Intelligent System menjadi dua. Kelas reguler dan kelas riset. Klo yang kelas reguler kuliahnya biasa aja, klo yang kelas riset kuliahnya modelny mirip dengan kuliah s2. Setiap mahasiwa diberikan sebuah paper, dan sepanjang kuliahnya itu isinya mbahas paper, presentasi, bikin proposal riset dan segala macem. Dan yang jelas materi papernya gak jauh jauh dari Intelligent System ini. Setelah itu dibagikan kertas pendaftaran, yang tertarik tanda tangan di kertas itu.</p>
<p>Saya tanda tangan di kertas itu. Nekat? Yap!! Ini kontrak mati saya dengan Pak Rully. Seperti yang pernah saya ceritakan pada postingan sebelumnya, seumur hidup saya menghindar dengan sesuatu yang berbau matematis. Ada gejala kejang kejang mirip epilepsi setiap kali saya melihat rumus dan macem macemnya. ketika dihadapkan dengan pilihan seperti ini? apakah saya akan terus lari? Nggak, saya memilih buat stand up and take the stake. Sampai kapan saya harus lari? dan ini kesempatan buat saya untuk melihat sejauh mana sih batas kemampuan saya. Dan saya memprediksikan bakalan berdarah darah di kelas ini, im going to walk thru hell. Saya juga pengen liat, sejauh mana saya bisa bertahan dari hentakan gelombang otak melihat rumus rumus neural network yang bejibun.</p>
<p>Kelas riset masih mulai sekitaran 2 minggu lagi. Masih ada waktu buat mempersiapkan mental, tapi sudah terlambat untuk mundur. Sementara ini masih asyik baca baca masalah SOA, thanx to mas Joni Farizal. Ada yang sempet nanya, &#8220;Gak jadi E business mbel?&#8221; wekekekek kayaknya masih pur, ini kan riset. Dan buat informasi aja, kelas riset cuman sekitar 20 an orang. Hmm kayaknya kita butuh nama deh buat ini. Ada yang punya usul?</p>
<p>Segitu deh laporannya. Tetep semangat!!!</p>
<p>: )</p>
<p><i></i></p>
</div>]]></content:encoded>
</item>

</channel>
</rss>
