IJCCS (Indonesian Journal of Computing and Cybernetics Systems)
Not a member yet
    480 research outputs found

    The Use Of Color, Wavelet Coefficient and Texture Features

    No full text
    A Query-by-Image ability often required in many multimedia or video database application. In this case the system retrieves similar images found in the database whose features are the same as the features of the query image. The key performance is in the selection of a set of features used for characterizing images in the video database. In this research a method for searching images in a video database is developed. The method accepts an image as its input and find similar images in the database. Three features are selected to characterize images in the database : color histogram, wavelet coefficients and texture. The method is tested on video database consisting eleven videos represented in RGB dan YCbCr color models. It was found that the method found all query images as long as the quality of the input image is good

    Design and Implementation 3D Karambol Game Application Using DirectX

    No full text
    The 3D game industry in Indonesia is increasing that can be seen by many game centre are always full of customers. But most of the game centre are not using original software because an original one can be very expensive. That is not the only reason, the other reason is that not many Indonesian are developing their own game software. And these increase the use of pirated game software. In this final assignment has been designed and developed, a game application titled 3D Karambol. This application is using DirectX and capable to process karambol game -a tradisional game from Indonesia-, to transform the game objects in 3D world, to do collision detection between those objects and to interact with the users through input device such as keyboard and mouse

    Face Detection Using Backpropagation Neural Networks

    No full text
    AbstractThis paper summarizes a research effort in human face detection. A system to locate human faces in images, especially when used as a front-end for a human face identification system, could have many applications in the law enforcement and security professions. The approach presented here is a hybrid system using an edge deletion preprocessor and back-propagation neural networks. The method proposed successfully detected multiple faces. The results obtained are reported along with a discussion for improving the system.Keywords: Backpropagation neural networks, Edge Detectio

    Fuzzy C-Means Clustering Model Data Mining For Recognizing Stock Data Sampling Pattern

    No full text
    AbstractCapital market has been beneficial to companies and investor. For investors, the capital market provides two economical advantages, namely deviden and capital gain, and a non-economical one that is a voting .} hare in Shareholders General Meeting. But, it can also penalize the share owners. In order to prevent them from the risk, the investors should predict the prospect of their companies. As a consequence of having an abstract commodity, the share quality will be determined by the validity of their company profile information. Any information of stock value fluctuation from Jakarta Stock Exchange can be a useful consideration and a good measurement for data analysis. In the context of preventing the shareholders from the risk, this research focuses on stock data sample category or stock data sample pattern by using Fuzzy c-Me, MS Clustering Model which providing any useful information jar the investors. lite research analyses stock data such as Individual Index, Volume and Amount on Property and Real Estate Emitter Group at Jakarta Stock Exchange from January 1 till December 31 of 204. 'he mining process follows Cross Industry Standard Process model for Data Mining (CRISP,. DM) in the form of circle with these steps: Business Understanding, Data Understanding, Data Preparation, Modelling, Evaluation and Deployment. At this modelling process, the Fuzzy c-Means Clustering Model will be applied. Data Mining Fuzzy c-Means Clustering Model can analyze stock data in a big database with many complex variables especially for finding the data sample pattern, and then building Fuzzy Inference System for stimulating inputs to be outputs that based on Fuzzy Logic by recognising the pattern.Keywords: Data Mining, AUz..:y c-Means Clustering Model, Pattern Recognitio

    An Implementation of Audio Security Using DES Algorithm

    No full text
    AbstractData security is an important problem in computer technology. This paper discusses security system for audio data. This technology is crucial because the multimedia technology has been improved very fast. One of the common audio format forms is wave audio format. The wave format is an uncompressed file format which is for RIFF specification owned by Microsoft. It is used for saving multimedia file. By using DES algorithm, the wave data could be encrypted for hiding information contained in the data. DES algorithm is chosen in this research because DES algorithm is one of the best symmetrical cryptography algorithms and it has been used world wide. This research is expected to give contribution to the audio security concept, especially for audio data security using wave file format.Keywords : audio security, DES algorithm, wave Oma

    An Application of Expert System to Identify Trees Utilizing Leaf Images

    No full text
    AbstractTree identification is a very important to support almost all activities in the forest sector. Unfortunately, the inavailability of data and computer programs that is user friendly have caused ineficiency in tree identification. This research tries to make an expert system to identify trees by using the leaf images. To store the data in the knowledge base one must choose one of the some leaf images that are in the data base available in the program according the characteristic of the leaf. Each leaf image has a code and the accumulation of all codes build a tree code then this code is saved in the knowledge base. The tree code is used to identify a tree by making the comparison between input chosen by user and the tree code in the knowledge base using forward chaining. User who has information about a tree can add to the knowledge base but this information must be validated by an expert before it is used in the system. Another task of an expert is to give a CF (certainty factor) for each tree.The result of this research shows that no more errors are found due to input mistakes and the program is more user friendly. Another advantage is that the knowledge base is more flexible, dynamic and well organized Validation of knowledge base by experts can increase the quality and accuracy of using the knowledge base system.Keywords : expert system, leaf image, knowledge base, forward chaining, C

    An Application of Expert System For Diagnozing Endoparsitism Gastrointestinal Disease In Livestock Animals

    No full text
    AbstractThe goal of this research is to make an expert system as a tool for diagnozing endoparsitism gastrointestinal disease for cows and sheep. The knowledge base of the system has been acquired from some interviews with some doctors from the internal diseases animal's unit at Animal's Hospital, Gadjah Mada University Jogjakarta, some text books, journals, and research papers. The inference machine of the system uses Forward Chaining and uncertainty data methods using Dempster-Shafer Theory.The system has a consultation session with an interactive dialog that can be used by the users. A user gives information such as user's data, and answers the questions about the endoparsitism gastrointestinal symptoms that might be had by his animal. From the answers, the system computes the possibility of the animal to suffer from endoparsitism gastrointestinal, informs the life cycle parasites, and suggests a therapy for it.Keywords : Expert System, diagnoze, endoparsitism gastrointestinal disease, Forward chaining method, Dempster-Shafer Tear

    Stock Data Clustering of Food and Beverage Company

    No full text
    AbstractCluster analysis can be defined as identifying groups of similar objects to discover distribution of patterns and interesting correlations in large data sets. Clustering analysis is important in the fields of pattern recognition and pattern classification. Over the years many methods have been developed for clustering data. In general, clustering methods can be categoried into two categories, i.e., fuzzy clustering and hard clustering. Fuzzy C-means is one of many methods of clustering based on fuzzy approach, while K-Means and K-Medoid are methods clustering based on crisp approach.This study aims to apply Fuzzy C-Means, K-Means and K-Medoid methods for clustering stock data in a jbod and beverage company. The main goal is to find a clustering method that can produce optimal clusters, The resulting clusters are validated using Dunn'• Index (DI). It is expected that the result of this reseach can be used to support decision making in the food and beverage company.Keywords : Clustering, Fuzzy C-Means, K-Means, K-Medoid, Cluster Validity, Dunn's Index (Dl

    Artificial Intelligence on Computer Based Chess Game: An Implementation of Alpha-Beta-Cutoff Search Method

    No full text
    AbstractA chess program usually consists of three main parts, that is, a move generator to generate all legal moves, an evaluation function to evaluate each move, and a search function to select the best move. The search function is the core of thinking process. The goal of this research is to implement the alpha beta cutoff as a search method. This method is derived from minimax search method and is more optimal than the minimax search method.In minimax, all nodes is searched and compared one by one to get the best value. On the other hand, the alpha beta cut of methd only searches nodes which make contribution to the previous value and cuts off nodes which are not useful. It means that the alpha beta method will not search and compare all nodes. The new node will be better than the previous one and replace the old value with the new one. This will make the alpha beta method requires smaller search time.The proposed method is tested by doing a series of matches between humans and a computer. The results show that the computer has ability to think well and performs a good artcial intelligence though it is very open to be modified and more optimized.Keywords: move generator function, evaluation function, search function, minimax, alpha beta cutof

    Asymmetric Watermarking Scheme Based on Correlation Testing

    No full text
    AbstractAsymmetric watermarking is the second generation of watermarking scheme which uses different keys for embedding and detecting watermark. Key for embedding is private or secret, but key for detecting can be available publicly and everyone who has the key can detect watermark Watermark detection does not need to be original multimedia data. Detection of watermark is realized using correlation test between public key and multimedia data received. In most of schemes, private key is the watermark itself; public key is public watermark which correlates to the private watermark This paper presents concept of asymmetric watermarking scheme that based on correlation test and reviews some schemes of asymmetric watermarking that have been proposed by researchers.Keywords: asymmetric watermarking, private key, public key, watermark., multimeelia,:correlation

    454

    full texts

    480

    metadata records
    Updated in last 30 days.
    IJCCS (Indonesian Journal of Computing and Cybernetics Systems)
    Access Repository Dashboard
    Do you manage Open Research Online? Become a CORE Member to access insider analytics, issue reports and manage access to outputs from your repository in the CORE Repository Dashboard! 👇