cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Siti Nurmaini
Contact Email
comengappjournal@unsri.ac.id
Phone
+6285268048092
Journal Mail Official
comengappjournal@unsri.ac.id
Editorial Address
Jurusan Sistem Komputer, Fakultas Ilmu Komputer, Universtas Sriwijaya, KampusUnsri Bukit Besar, Palembang
Location
Kab. ogan ilir,
Sumatera selatan
INDONESIA
ComEngApp : Computer Engineering and Applications Journal
Published by Universitas Sriwijaya
ISSN : 22524274     EISSN : 22525459     DOI : 10.18495
Core Subject : Science, Engineering,
Computer Science & IT Engineering
ComEngApp-Journal (Collaboration between University of Sriwijaya, Kirklareli University and IAES) is an international forum for scientists and engineers involved in all aspects of computer engineering and technology to publish high quality and refereed papers. This Journal is an open access journal that provides online publication (three times a year) of articles in all areas of the subject in computer engineering and application. ComEngApp-Journal wishes to provide good chances for academic and industry professionals to discuss recent progress in various areas of computer science and computer engineering.
Arjuna Subject : Teknik (semua kategori) - Teknik (Lain-Lain)
Articles 2 Documents
 1 
Search results for , issue "Vol. 2 No. 2 (2013)" : 2 Documents clear
An Analysis of Adaptive Approach for Document Binarization Malik, Reza Firsandaya; Saparudin; Septyliana, Intan
Computer Engineering and Applications Journal (ComEngApp) Vol. 2 No. 2 (2013)
Publisher : Universitas Sriwijaya

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

Abstract

Abstract Binarization is an initial step in document image analysis for differentiate text area from background. Determination of binarization technique is really important to retrieve all the text information especially from degraded document image. This paper explains about adaptive binarization using Gatos’s method. Gatos’s method is doing preprocessing, foreground estimation using Sauvola’s method, background estimation, upsampling, final thresholding and postprocessing. In this paper, Sauvola’s method is final thresholding from Wiener filter image result and source image, and count F-Measure from both of these binary image results. By using optimum constant value on k value, n local window, Ksw and Ksw1, Gatos’s method can produced binary image better than Sauvola’s method based on F-Measure value. Sauvola’s method produces average value F=84,62%, Sauvola’s method with Wiener filter produces average value F=99.06% and Gatos’s method produces average value F=99,43%. Keyword : Degraded Document Image, Adaptive Approcah for Binarization, Gatos’s  Method, Sauvola’s MethodDOI: 10.18495/comengapp.22.185194
Proposed Developements of Blind Signature Scheme Based on ECC Amounas, F.; Kinani, E.H. El
Computer Engineering and Applications Journal (ComEngApp) Vol. 2 No. 2 (2013)
Publisher : Universitas Sriwijaya

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

Abstract

Detecting and gaining clues from the crime scene plays a major role in the process of investigation. Now a days with increase of cybercrime and fraud on the internet, digital forensics gaining importance. It needs to collect information the events happened at crime place. This paper deals with event reconstruction process which is useful for digital crime scene. The process of reconstruction is based on crime event and event characteristics. It also furnishes crime rate guess using some semi-formal techniques. Keyword: Digital Investigation, Digital Forensics, Events, Attack Trees, Reconstruction

Page 1 of 1 | Total Record : 2

 1 

Filter by Year

2013 2013


Reset
Filter By Issues
All Issue Vol. 14 No. 2 (2025) Vol. 14 No. 1 (2025) Vol 14 No 1 (2025) Vol 13 No 03 (2024) Vol. 13 No. 3 (2024) Vol. 13 No. 2 (2024) Vol 13 No 2 (2024) Vol. 13 No. 1 (2024) Vol 13 No 1 (2024) Vol 12 No 3 (2023) Vol. 12 No. 3 (2023) Vol. 12 No. 2 (2023) Vol 12 No 2 (2023) Vol 12 No 1 (2023) Vol. 12 No. 1 (2023) Vol 11 No 3 (2022) Vol. 11 No. 3 (2022) Vol. 11 No. 2 (2022) Vol 11 No 2 (2022) Vol 11 No 1 (2022) Vol. 11 No. 1 (2022) Vol 10 No 3 (2021) Vol 10 No 2 (2021) Vol 10 No 1 (2021) Vol 9 No 3 (2020) Vol 9 No 2 (2020) Vol 9 No 1 (2020) Vol 8 No 3 (2019) Vol 8 No 2 (2019) Vol 8 No 1 (2019) Vol 7 No 3 (2018) Vol 7 No 2 (2018) Vol 7 No 1 (2018) Vol 6 No 3 (2017) Vol 6 No 2 (2017) Vol. 6 No. 2 (2017) Vol. 6 No. 1 (2017) Vol 6 No 1 (2017) Vol 5 No 3 (2016) Vol. 5 No. 3 (2016) Vol 5 No 2 (2016) Vol 5 No 1 (2016) Vol 4 No 3 (2015) Vol 4 No 2 (2015) Vol 4 No 1 (2015) Vol 3 No 3 (2014) Vol 3 No 2 (2014) Vol 3 No 1 (2014) Vol 2 No 3 (2013) Vol. 2 No. 3 (2013) Vol. 2 No. 2 (2013) Vol 2 No 2 (2013) Vol 2 No 1 (2013) Vol. 2 No. 1 (2013) Vol 1 No 2 (2012) Vol. 1 No. 2 (2012) Vol 1 No 1 (2012) More Issue