cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
Indonesian Journal of Electrical Engineering and Computer Science
Published by Institute of Advanced Engineering and Science
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 100 Documents
 1   2   3   4   5 
Search results for , issue "Vol 11, No 11: November 2013" : 100 Documents clear
Visible and Infrared Image Fusion Using the Lifting Wavelet Yuelin Zou; Xiaoqiang Liang; Tongming Wang
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 11: November 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In recent years image fusion plays a vital role in the image processing area. Fused images would help in doing many applications in image processing like segmentation, image enhancement and many.In order to improve the effect of fusion visible and infrared image images of the same scene, this paper presents an image fusion method based on lifting wavelet domain. Firstly, the source images are decomposed using lifting wavelet domain transform (LWT). Secondly, a weighted average approach based on normalized Shannon entropy is used to fuse low frequency lifting wavelet coefficients of the visible and infrared images. The fusion rule of local energy maximum is used to combine corresponding high frequency coefficients. After fusing low and high frequency coefficients of the source images, the final fused image is obtained using the inverse LWT. The experiments show that the proposed method provides improved subjective and objectives results as compared to previous image fusion methods such as Laplacian transform and traditional Wavelet transform. DOI: http://dx.doi.org/10.11591/telkomnika.v11i11.2898
Multi-Objective Optimization Algorithms Design based on Support Vector Regression Metamodeling Qi Zhang; Guangchun Yang; Rui Tang; Guoqi Xiang
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 11: November 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In order to solve the multi-objective optimization problem in the complex engineering, in this paper a NSGA-II multi-objective optimization algorithms based on Support Vector Regression Metamodeling is presented. Appropriate design parameter samples are selected by experimental design theories, and the response samples are obtained from the experiments or numerical simulations, used the SVM method to establish the metamodels of the objective performance functions and constraints, and reconstructed the original optimal problem. The reconstructed metamodels was solved by NSGA-II algorithm and took the structure optimization of the microwave power divider as an example to illustrate the proposed methodology and solve themulti-objective optimization problem. The results show that this methodology is feasible and highly effective, and thus it can be used in the optimum design of engineering fields. DOI: http://dx.doi.org/10.11591/telkomnika.v11i11.2628
An Improved Apriori Algorithm for Association Rules Xingli Liu; Huali Liu
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 11: November 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

According Apriori algorithm characteristic achieve its improvement and apply it to the knowledge correlation of the curriculum in sumulation experiment. Firstly, it is mainly by simplifying the binary storage method to change data in the database, and then to get the largest frequent itemsets.The experiment results showed that the improved algorithm obviously improve the efficiency ;secondly ,establish a new database to simulate applied experiment ,consisted of student achievement of various knowledge points in the computer programming course,and then using this optimized algorithm to found the course knowledge frequent itemsets in a database, which is closely interrelated knowledge points mainly by setting up different minimum support value to get various frequent itemsets .According to these frequent itemsets of the course it can be applied to reestablish a new course knowledge system to further improve the teaching quality, this method can also be achieved the knowledge system reform of other course or course group.  DOI: http://dx.doi.org/10.11591/telkomnika.v11i11.3491 
Wideband Tuning of Impedance Matching for actual RF Networks using AQPSO Yin Xin; Tan Yang Hong; Liao Jiwang
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 11: November 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

An adaptive wideband impedance matching technique using a passive PI-network is presented in the paper on the basis of adaptive quantum particle swarm optimization algorithms (AQPSO), which  avoiding the drawbacks of the standard particle swarm optimization (PSO) algorithm. The Wideband Tuning technique is for actual RF chips. So on-chip models for RF capacitors and inductors are considered. And the effects of the parasitic component loss in the PI-network are analyzed. Then the circuit is simplified according to the sensitivities of the elements. Therefore, the computational complexity is dramatically reduced. Finally, the AQPSO algorithm is adopted to maximize the power transmission efficiency. Simulation results show that the proposed tuning technique can achieve good accuracy of impedance matching and load power. The reflection coefficient and VSWR obtained are also satisfactory. Moreover, the proposed method can be useful for software defined radio systems using a single antenna for multiple mobile and wireless bands. DOI: http://dx.doi.org/10.11591/telkomnika.v11i11.3504
Visualization of License Plate Recognition System Zhiyi Ruan; Ying Zou; Dongming Hong; Lurong Wu
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 11: November 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The image of the license plate is located and segmented by some digital-image processing technologies such as gray-scale processing, gray-scale stretching and filtering, edge detection, morphological processing, Hough transformation etc. According to the characteristics of the license plate, binary matrix of character image sets the fuzzy matrix, and based on the principle of proximity computing space of closeness to get the fuzzy pattern recognition of characters. On the basis of the data of image pixels, the samples which are randomly selected under noisy condition and which are treated by morphological processing are randomly selected, and then the samples are used to test the simulation and identification of Back Propagation (BP) Neural Networks. With the mathematical software-Matlab programming, the license plates are recognized. The aim is to develop the Visualization of user interface in License Plate Recognition System. DOI: http://dx.doi.org/10.11591/telkomnika.v11i11.3520
Detecting and Tracking Hair Impurities in Mushroom Semi-product Images Wang Xiuping; He Zhongjiao
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 11: November 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

A new area operator was proposed to extract axes feature of hair impurity in mushroom semi-product images. This operator was based on the local intensity comparison, and it had two advantages: 1) its outputs reached local maxima at the hair axes; 2) the accurate direction information of the hair axes could be derived by it. After the axes feature of the hairs was extracted using the proposed operator, an extended Kalman filter was applied to track the hairs. The searching path was established when a cost function was minimized. Starting points of the tracking path were found using dyadic wavelet analysis. The proposed algorithm had good adaptivity for the arbitrary orientation of the hairs. The experiment results showed that hairs could be tracked accurately. DOI: http://dx.doi.org/10.11591/telkomnika.v11i11.3542
A Novel Wisdom Network Design and Its Principles Fuhong Lin; Xianwei Zhou
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 11: November 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Next generation network is a hot topic that lots of researchers have paid their attention to this point. The main idea is making people more comfortable and convenient. This paper presents a novel wisdom network which tends to achieve the above mentioned advantages. This network is composed by User Part and Server Part. Further, Server Part is divided into Gateway Server part and Data Server part. According to the network architecture, some design principles are analyzed and modeled, including the following aspects: resource registration and retrieval, data pieces replication, Gateway Server performance and load balance achievement. Key word:Wisdom network, resource registration and retrieval, data replication, load balance. DOI: http://dx.doi.org/10.11591/telkomnika.v11i11.3584
Route Optimization of Stacker in Automatic Warehouse Based on Genetic Algorithm Cui Changqing; Wang Yiqiang
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 11: November 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Today, automatic warehouse system gradually replaced manual labor, and played an important role in the production work, especially in the cargo handling work. It was important to research the time-consuming and efficiency of stacker in the automated warehouse system. This paper researched the path of stacker in automated warehouse and calculated the operation time of stacker working path according to actual working condition, and then put forward a route optimization method of stacker based on genetic algorithm, finally simulated this algorithm by using MATLAB. The simulation results showed that this algorithm could shorten the way of stacker, and increase the working efficiency of the warehouse. DOI: http://dx.doi.org/10.11591/telkomnika.v11i11.2959
Routing Optimization for Wireless Sensor Network Based on Cloud Adaptive Particle Swarm Optimization Algorithm Xu Bao
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 11: November 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

One of the most important targets of routing algorithm for Wireless Sensor Network (WSN) is to prolong the network lifetime. Aimed at the features of WSN, a new routing optimization approach based on cloud adaptive particle swarm optimization algorithm is put forward in this paper. All paths appear at the same time in one round are fused in one particle, and the coding rule of particle is set down. The particle itself is defined as its position, the number of replaceable relay nodes in paths is defined as the velocity of particle. Cloud algorithm is used to optimize the inertia weight of particle. Optimize rules are laid out, and both residual energy of nodes and variance of all paths’ length are considered in objective function. Simulations find out the best value of balance factor in objective function, also prove that this approach can control the energy consumption of network, enhance the viability of nodes, and prolong the lifetime of network. DOI: http://dx.doi.org/10.11591/telkomnika.v11i11.3486
A Simple Compound Control Method for Flexible-link Manipulator Sanxiu Wang; Li Yu; Jianming Xu; Kexing Xu
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 11: November 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

This paper presents a composite control scheme based on singular perturbation theory, which decouples the system of flexible-link manipulator into rigid motion (slow subsystem) and flexible vibration (fast subsystem) two different time scale subsystems. For the slow subsystem, a controller combined computer torque method and robust control is employed to track the desired trajectory, while, a state feedback control is used to stabilize the fast subsystem to suppress the vibration. The simulation results show that the proposed control strategy has good tracking performance and suppress the flexible-link vibration effectively. DOI: http://dx.doi.org/10.11591/telkomnika.v11i11.3515

Page 2 of 10 | Total Record : 100

 1   2   3   4   5 

Filter by Year

2013 2013


Reset
Filter By Issues
All Issue Vol 41, No 2: February 2026 Vol 41, No 1: January 2026 Vol 40, No 3: December 2025 Vol 40, No 2: November 2025 Vol 40, No 1: October 2025 Vol 39, No 3: September 2025 Vol 39, No 2: August 2025 Vol 39, No 1: July 2025 Vol 38, No 3: June 2025 Vol 38, No 2: May 2025 Vol 38, No 1: April 2025 Vol 37, No 3: March 2025 Vol 37, No 2: February 2025 Vol 37, No 1: January 2025 Vol 36, No 3: December 2024 Vol 36, No 2: November 2024 Vol 36, No 1: October 2024 Vol 35, No 3: September 2024 Vol 35, No 2: August 2024 Vol 35, No 1: July 2024 Vol 34, No 3: June 2024 Vol 34, No 2: May 2024 Vol 34, No 1: April 2024 Vol 33, No 3: March 2024 Vol 33, No 2: February 2024 Vol 33, No 1: January 2024 Vol 32, No 3: December 2023 Vol 32, No 1: October 2023 Vol 31, No 3: September 2023 Vol 31, No 2: August 2023 Vol 31, No 1: July 2023 Vol 30, No 3: June 2023 Vol 30, No 2: May 2023 Vol 30, No 1: April 2023 Vol 29, No 3: March 2023 Vol 29, No 2: February 2023 Vol 29, No 1: January 2023 Vol 28, No 3: December 2022 Vol 28, No 2: November 2022 Vol 28, No 1: October 2022 Vol 27, No 3: September 2022 Vol 27, No 2: August 2022 Vol 27, No 1: July 2022 Vol 26, No 3: June 2022 Vol 26, No 2: May 2022 Vol 26, No 1: April 2022 Vol 25, No 3: March 2022 Vol 25, No 2: February 2022 Vol 25, No 1: January 2022 Vol 24, No 3: December 2021 Vol 24, No 2: November 2021 Vol 24, No 1: October 2021 Vol 23, No 3: September 2021 Vol 23, No 2: August 2021 Vol 23, No 1: July 2021 Vol 22, No 3: June 2021 Vol 22, No 2: May 2021 Vol 22, No 1: April 2021 Vol 21, No 3: March 2021 Vol 21, No 2: February 2021 Vol 21, No 1: January 2021 Vol 20, No 3: December 2020 Vol 20, No 2: November 2020 Vol 20, No 1: October 2020 Vol 19, No 3: September 2020 Vol 19, No 2: August 2020 Vol 19, No 1: July 2020 Vol 18, No 3: June 2020 Vol 18, No 2: May 2020 Vol 18, No 1: April 2020 Vol 17, No 3: March 2020 Vol 17, No 2: February 2020 Vol 17, No 1: January 2020 Vol 16, No 3: December 2019 Vol 16, No 2: November 2019 Vol 16, No 1: October 2019 Vol 15, No 3: September 2019 Vol 15, No 2: August 2019 Vol 15, No 1: July 2019 Vol 14, No 3: June 2019 Vol 14, No 2: May 2019 Vol 14, No 1: April 2019 Vol 13, No 3: March 2019 Vol 13, No 2: February 2019 Vol 13, No 1: January 2019 Vol 12, No 3: December 2018 Vol 12, No 2: November 2018 Vol 12, No 1: October 2018 Vol 11, No 3: September 2018 Vol 11, No 2: August 2018 Vol 11, No 1: July 2018 Vol 10, No 3: June 2018 Vol 10, No 2: May 2018 Vol 10, No 1: April 2018 Vol 9, No 3: March 2018 Vol 9, No 2: February 2018 Vol 9, No 1: January 2018 Vol 8, No 3: December 2017 Vol 8, No 2: November 2017 Vol 8, No 1: October 2017 Vol 7, No 3: September 2017 Vol 7, No 2: August 2017 Vol 7, No 1: July 2017 Vol 6, No 3: June 2017 Vol 6, No 2: May 2017 Vol 6, No 1: April 2017 Vol 5, No 3: March 2017 Vol 5, No 2: February 2017 Vol 5, No 1: January 2017 Vol 4, No 3: December 2016 Vol 4, No 2: November 2016 Vol 4, No 1: October 2016 Vol 3, No 3: September 2016 Vol 3, No 2: August 2016 Vol 3, No 1: July 2016 Vol 2, No 3: June 2016 Vol 2, No 2: May 2016 Vol 2, No 1: April 2016 Vol 1, No 3: March 2016 Vol 1, No 2: February 2016 Vol 1, No 1: January 2016 Vol 16, No 3: December 2015 Vol 16, No 2: November 2015 Vol 16, No 1: October 2015 Vol 15, No 3: September 2015 Vol 15, No 2: August 2015 Vol 15, No 1: July 2015 Vol 14, No 3: June 2015 Vol 14, No 2: May 2015 Vol 14, No 1: April 2015 Vol 13, No 3: March 2015 Vol 13, No 2: February 2015 Vol 13, No 1: January 2015 Vol 12, No 12: December 2014 Vol 12, No 11: November 2014 Vol 12, No 10: October 2014 Vol 12, No 9: September 2014 Vol 12, No 8: August 2014 Vol 12, No 7: July 2014 Vol 12, No 6: June 2014 Vol 12, No 5: May 2014 Vol 12, No 4: April 2014 Vol 12, No 3: March 2014 Vol 12, No 2: February 2014 Vol 12, No 1: January 2014 Vol 11, No 12: December 2013 Vol 11, No 11: November 2013 Vol 11, No 10: October 2013 Vol 11, No 9: September 2013 Vol 11, No 8: August 2013 Vol 11, No 7: July 2013 Vol 11, No 6: June 2013 Vol 11, No 5: May 2013 Vol 11, No 4: April 2013 Vol 11, No 3: March 2013 Vol 11, No 2: February 2013 Vol 11, No 1: January 2013 Vol 10, No 8: December 2012 Vol 10, No 7: November 2012 Vol 10, No 6: October 2012 Vol 10, No 5: September 2012 Vol 10, No 4: August 2012 Vol 10, No 3: July 2012 More Issue