4.2 Article

Robust edge detector based on anisotropic diffusion-driven process

Journal

INFORMATION PROCESSING LETTERS
Volume 116, Issue 5, Pages 373-378

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2015.12.003

Keywords

Edge detector; Perona-Malik; Object detection; Image restoration; Information retrieval

Ask authors/readers for more resources

Edge detection involves a process to discriminate, highlight, and extract useful image features (edges and contours). In many situations, we prefer an edge detector that distinguishes these features more accurately, and which comfortably deals with a variety of data. Our observations, however, discovered that most edge-defining functionals underperform and generate false edges under poor imaging conditions. Therefore, the current research proposes a robust diffusion-driven edge detector for seriously degraded images. The method is iterative, and suppresses noise while simultaneously marking real edges and deemphasizing false edges. The anisotropic nature of the new functional helps to remove noise and to preserve semantic structures. Even more importantly, the functional exhibits a forward-backward behavior that may sharpen and strengthen edges. Comparisons with some other classical approaches demonstrate superiority of the proposed approach. (C) 2015 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Review Computer Science, Information Systems

Recent developments and trends in point set registration methods

Baraka Maiseli, Yanfeng Gu, Huijun Gao

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION (2017)

Article Computer Science, Software Engineering

Robust cost function for optimizing chamfer masks

Baraka Jacob Maiseli, LiFei Bai, Xianqiang Yang, Yanfeng Gu, Huijun Gao

VISUAL COMPUTER (2018)

Article Computer Science, Information Systems

Perona-Malik model with self-adjusting shape-defining constant

Baraka Maiseli, Hubert Msuya, Suzan Kessy, Michael Kisangiri

INFORMATION PROCESSING LETTERS (2018)

Article Engineering, Electrical & Electronic

Optimum design of chamfer masks using symmetric mean absolute percentage error

Baraka Jacob Maiseli

EURASIP JOURNAL ON IMAGE AND VIDEO PROCESSING (2019)

Article Computer Science, Artificial Intelligence

Cost-effective and accurate palm vein recognition system based on multiframe super-resolution algorithms

Venance Kilian, Nassor Ally, Josiah Nombo, Abdi T. Abdalla, Baraka Maiseli

IET BIOMETRICS (2020)

Article Engineering, Electrical & Electronic

On the convexification of the Perona-Malik diffusion model

Baraka Jacob Maiseli

SIGNAL IMAGE AND VIDEO PROCESSING (2020)

Article Computer Science, Information Systems

Diffusion-Driven Image Denoising Model with Texture Preservation Capabilities

Nassor Ally, Josiah Nombo, Kwame Ibwe, Abdi T. Abdalla, Baraka Jacob Maiseli

Summary: Noise removal in images is a challenging problem that has attracted attention from many scholars. Recent methods focus on restoring semantic features while preserving textures remains an open research question. An image denoising method based on anisotropic diffusion processes has been proposed to effectively preserve edges, contours, and textures.

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY (2021)

Article Engineering, Electrical & Electronic

Fast sparse image reconstruction method in through-the-wall radars using limited memory Broyden-Fletcher-Goldfarb-Shanno algorithm

Candida Mwisomba, Abdi T. Abdalla, Idrissa Amour, Florian Mkemwa, Baraka Maiseli

Summary: Compressed sensing has revolutionized through-the-wall radar imaging by allowing image signal recovery using a portion of data, however, nonlinear methods have increased computational costs, limiting practical applications. This study introduces the use of LBFGS algorithm to lower image reconstruction time, achieving an 87% reduction in computational time relative to classical methods, even under scenarios with increased targets or data volume. The proposed method remains robust in noisy environments, demonstrating its potential in practical applications.

INTERNATIONAL JOURNAL OF MICROWAVE AND WIRELESS TECHNOLOGIES (2022)

Article Engineering, Electrical & Electronic

Aspect dependent-based ghost suppression for extended targets in through-the-wall radar imaging under compressive sensing framework

Mugundu Rambika, Abdi T. Abdalla, Baraka Maiseli, Idrissa Amour, Alfred Mwambela

Summary: This paper proposes a ghost suppression method for extended targets based on the AD feature, which can effectively improve the multipath ghost problem in through-the-wall radar imaging.

EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING (2022)

Article Multidisciplinary Sciences

Early identification of Tuta absoluta in tomato plants using deep learning

Lilian Mkonyi, Denis Rubanga, Mgaya Richard, Never Zekeya, Shimada Sawahiko, Baraka Maiseli, Dina Machuve

SCIENTIFIC AFRICAN (2020)

Article Engineering, Multidisciplinary

Robust Edge Detection Method for the Segmentation of Diabetic Foot Ulcer Images

Rehema Mwawado, Baraka Maiseli, Mussa Dida

ENGINEERING TECHNOLOGY & APPLIED SCIENCE RESEARCH (2020)

Proceedings Paper Computer Science, Interdisciplinary Applications

Consumers' Acceptance Intentions to Use Cashback Systems: A Case of SNAPnSAVE Application in South Africa

Elizabeth D. Matemba, Guoxin Li, Baraka J. Maiseli, Portia M. Tladi

PROCEEDINGS OF 2018 2ND INTERNATIONAL CONFERENCE ON SOFTWARE AND E-BUSINESS (ICSEB 2018) (2018)

Article Computer Science, Information Systems

Consumers' Stickiness to Mobile Payment Applications: An Empirical Study of WeChat Wallet

Elizabeth D. Matemba, Guoxin Li, Baraka J. Maiseli

JOURNAL OF DATABASE MANAGEMENT (2018)

Proceedings Paper Engineering, Industrial

Lp-TV Model for Structure Extraction with End-to-End Contour learning

Chunwei Song, Baraka Maiseli, Wangmeng Zuo, Huijun Gao

IECON 2017 - 43RD ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY (2017)

Review Engineering, Multidisciplinary

Exploring pilot assignment methods for pilot contamination mitigation in massive MIMO systems

Angelina Misso, Mussa Kissaka, Baraka Maiseli

COGENT ENGINEERING (2020)

Article Computer Science, Information Systems

Word automatic groups of nilpotency class 2

Andre Nies, Frank Stephan

Summary: We investigate word automaticity for nilpotent groups of class 2 with prime exponent p. It is proven that the infinitely generated free group in this category is not word automatic. However, the infinite extra-special p-group Ep and an intermediate group Hp with an infinite center are both word automatic. Additionally, a method for demonstrating automaticity of central extensions of abelian groups via co-cycles is introduced.

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

A new key recovery attack on a code-based signature from the Lyubashevsky framework

Chik How Tan, Theo Fanuela Prabowo

Summary: This paper presents a new key recovery attack on a Hamming-metric code-based signature scheme proposed by SHMWW. The attack extends the statistical part of the attack proposed by ABDKPS. In addition to classifying the columns of the secret matrix, the attack also determines the entries of the identity columns of this matrix via statistical method. The attack has better time complexity and can recover the secret key in under 45 minutes with no more than 1500 signatures.

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

On the hull number on cycle convexity of graphs

Julio Araujo, Victor Campos, Darlan Girao, Joao Nogueira, Antonio Salgueiro, Ana Silva

Summary: This paper studies the parameter hull number in a graph convexity called Cycle Convexity, which is motivated by related notions in Knot Theory. The authors define the interval function and investigate the properties and computational methods of the minimum convex set for a graph G.

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

Worst-case analysis of LPT scheduling on a small number of non-identical processors

Takuto Mitsunobu, Reiji Suda, Vorapong Suppakitpaisarn

Summary: The investigation on the approximation ratio of the longest processing time (LPT) scheduling algorithm has been conducted in various studies. While the ratio is known for identical processors, it remains unknown for processors with different speeds. This study provides a tight approximation ratio for three, four, and five processors, showing that the ratios are no larger than the lower bound provided by Gonzalez et al. (1977) [14]. The ratios are approximately 1.38, 1.43, and 1.46 for three, four, and five processors, respectively.

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

Simplicity in Eulerian circuits: Uniqueness and safety

Nidia Obscura Acosta, Alexandru I. Tomescu

Summary: This paper presents a new linear-time checkable characterization of directed graphs with a unique Eulerian circuit. The characterization is based on a simple condition of when two edges must appear consecutively in all Eulerian circuits, in terms of cut nodes of the underlying undirected graph of G. Additionally, the paper proposes a method to compute all maximal safe walks appearing in all Eulerian circuits in linear time.

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

A short note on A note on single-machine scheduling with job-dependent learning effects

Dar-Li Yang, Yung-Tsung Hou, Wen-Hung Kuo

Summary: The research states that the single-machine makespan minimization problem can be solved as an assignment problem in O(n3) time. Subsequent research shows that if the job-dependent learning effects are correlated with the level of sophistication of the jobs and have a lower bound, the scheduling problem can be solved in O(nlogn) time by sequencing the jobs according to the shortest processing time rule. The SPT job sequence remains optimal when the job-dependent learning effects are inversely correlated with the level of sophistication and have an upper bound. The main results of the paper are correct, but there are errors in Corollary 1 and incomplete proofs for Proposition 1 and Corollary 1. This note provides a counter example for the latter case and a modified corollary. A lemma is presented to complete the proofs for Proposition 1 and Corollary 1. Finally, a simple algorithm is developed to solve the latter case in O(n2) time.

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

Recursion-free modular arithmetic in the lambda-calculus

Maximilien Mackie

Summary: This research investigates encodings for modular arithmetic in the lambda-calculus. Two approaches are considered: adapting existing numeral systems and creating a new one. The focus of this paper is to provide original techniques for encoding modular arithmetic directly. A modular arithmetic numeral system is presented, complete with multiplication and an implementation of the Chinese remainder theorem, all without recursion i.e., without using fixed-point operators.

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

Linear threshold functions in decision lists, decision trees, and depth-2 circuits

Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah

Summary: We demonstrate that polynomial-size constant-rank linear decision trees (LDTs) can be transformed into polynomial-size depth-2 threshold circuits LTF o LTF. An intermediate structure is polynomial-size decision lists that refer to a conjunction of a fixed number of linear threshold functions (LTFs); we prove that these are equivalent to polynomial-size exact linear decision lists (ELDLs), which query precise threshold functions (ELTFs).

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

Unbiased estimation of inner product via higher order count sketch

Bhisham Dev Verma, Rameshwar Pratap, Manoj Thakur

Summary: Count sketch is a popular sketching algorithm used for frequency estimation in data streams and pairwise inner product for real-valued vectors. This paper extends count sketch and introduces a higher-order count sketch algorithm, which compresses input tensors to approximate the queried features. It is shown that the higher-order count sketch can also closely approximate the pairwise inner product and provides a concentration analysis of the estimate.

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality

Jean Lienardy, Frederic Lafitte

Summary: OCB3 is an authenticated encryption mode of operation that allows for associated data (AEAD), and it is known for its maturity and provable security. However, this note highlights a small flaw in the security proof of OCB3 that can result in a loss of security when using short nonces. This flaw has implications worse than nonce-repetition, as it compromises confidentiality and authenticity until the key is changed. Various approaches to fix this flaw in OCB3 are presented.

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

On approximate near-neighbors search under the (continuous) Frechet distance in higher dimensions

Majid Mirzanezhad

Summary: This paper proposes the first data structure for curves under the (continuous) Frechet distance in higher dimensions, which can efficiently report all curves with distances less than a given value to a query curve. For a given k value in the preprocessing stage, we propose a deterministic data structure that can answer (1 + epsilon)delta-ANNS queries in O (kd) query time, where D is the diameter of P.

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

Security weakness of a certificate-based proxy signature scheme for IIoT environments

Je Hong Park, Woo-Hwan Kim

Summary: This paper revisits Zhu et al.'s attack on a certificate-based proxy signature scheme proposed by Verma et al., and shows that the fundamental problem of Verma et al.'s scheme lies in its use of a weak ordinary signature scheme. Furthermore, the paper demonstrates that the attack against Verma et al.'s scheme can be similarly applied to the revised scheme, as they share many components using the weak signature.

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

The maximum linear arrangement problem for trees under projectivity and planarity

Lluis Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho

Summary: This study focuses on two variants of the Maximum Linear Arrangement problem, namely the planar variant for free trees and the projective variant for rooted trees. Linear time and space complexity algorithms are presented to solve these two problems. Additionally, properties of maximum projective and planar arrangements are proven, and it is shown that caterpillar trees maximize planar MaxLA among all trees of a fixed size, thereby generalizing a previous extremal result on trees.

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

Anti Tai mapping for unordered labeled trees

Mislav Blazevic, Stefan Canzar, Khaled Elbassioni, Domagoj Matijevic

Summary: This paper studies the Tai mapping and anti Tai mapping problems between rooted labeled trees. For unordered trees, finding the maximum-weight Tai mapping is proven to be NP-complete. The paper provides an efficient algorithm for finding the maximum-weight anti Tai mapping and presents a polynomial computable lower bound for the optimal anti Tai mapping based on special conditions.

INFORMATION PROCESSING LETTERS (2024)

Article Computer Science, Information Systems

The facility location problem with maximum distance constraint

Xiaowei Li, Xiwen Lu

Summary: The facility location problem with maximum distance constraint is investigated and a (3,1)-approximation algorithm is proposed. The algorithm is compared with the previous one and is found to have lower memory requirements and is suitable for large-scale problems.

INFORMATION PROCESSING LETTERS (2024)