Article
Management
Stefano Coniglio, Fabio Furini, Pablo San Segundo
Summary: This study introduces a novel combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts, which effectively combines different procedures for pruning branch-and-bound nodes. The algorithm shows high pruning potential and low computational effort, outperforming state-of-the-art methods by up to two orders of magnitude in speed.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Multidisciplinary Sciences
Philipp Nolte, Marcel Brettmacher, Chris Johann Groger, Tim Gellhaus, Angelika Svetlove, Arndt F. Schilling, Frauke Alves, Christoph Russmann, Christian Dullin
Summary: This study presents a novel workflow for the analysis of hard-tissue histology using conventional microCT scans and 3D printed fiducial markers. The workflow allows for the analysis of 3D structural features and directs the sectioning process to regions of interest. The registration of 2D histological images into the 3D anatomical context enables the co-registration of morphological analysis and local 3D information obtained from microCT data.
SCIENTIFIC REPORTS
(2023)
Article
Computer Science, Hardware & Architecture
Mingqiang Zhou, Qianqian Zeng, Ping Guo
Summary: The Maximum Clique Problem is a classic NP-hard problem with various applications. Existing solutions often suffer from low efficiency due to the upper bound not being close enough to the optimal result. This paper proposes a new efficient branch and bound algorithm called SMC-BRB, which utilizes heuristics and color-based upper bound to reduce the number of branches in the exact search stage, improving the efficiency of solving the problem.
JOURNAL OF SUPERCOMPUTING
(2023)
Article
Agriculture, Multidisciplinary
Eugene Kok, Xing Wang, Chao Chen
Summary: The shortage of agricultural labourers has led to the development of fruit harvesting robots globally. However, selective avoidance of obstacles such as tree branches in unstructured orchards remains a challenge. This study presents a framework that utilizes RGB-D camera data to reconstruct and recover obscured 3D branches, with promising results in branch segmentation and recovery accuracy.
COMPUTERS AND ELECTRONICS IN AGRICULTURE
(2023)
Article
Computer Science, Artificial Intelligence
Junyi Hou, Lei Yu, Shumin Fei
Summary: This paper proposes a high-quality voxel 3D reconstruction system for large scenes based on the branch and bound method, which obtains high-precision 3D models by optimizing camera pose and utilizing the truncated signed distance function.
EXPERT SYSTEMS WITH APPLICATIONS
(2022)
Article
Environmental Sciences
Siliang Du, Yilin Xiao, Jingwei Huang, Mingwei Sun, Mingzhong Liu
Summary: GLFNet is a method proposed for the detection and matching of local features in remote-sensing images, leveraging existing sparse feature points as guided points. It addresses the challenge of establishing correct matches among images with significant differences in lighting or perspectives by searching for regions in the target image with features similar to the guided points in the source image. GLFNet consists of a coarse-level match network and a fine-level regression network to efficiently search for accurate matches.
Article
Management
Fabio Furini, Ivana Ljubic, Pablo San Segundo, Yanlu Zhao
Summary: The Edge Interdiction Clique Problem aims to minimize the size of the maximum clique in a graph by removing a subset of at most k edges. A new ILP formulation and branch-and-cut algorithm have been proposed to address this problem, which has shown significant improvement over existing approaches through extensive testing.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Management
Yi Zhou, Weibo Lin, Jin-Kao Hao, Mingyu Xiao, Yan Jin
Summary: An s-bundle is a connected graph with a vertex connectivity of at least n - s, used to represent cohesive groups with an emphasis on member connectivity; the algorithm solves this NP-hard problem with new branching rules, graph coloring-based bounding technique, and reduction rules using structural information, outperforming existing approaches on well-known benchmark graphs.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Oncology
Max C. Lindemann, Lukas Glaenzer, Anjali A. Roeth, Thomas Schmitz-Rode, Ioana Slabu
Summary: Three-dimensional models of tumor vascular networks are important for in vitro and in silico investigations, and can potentially be used for the development of in vitro systems. This work presents an algorithm-based method using histologic slices to reconstruct a 3D vascular network model with high resolution and accuracy.
Article
Engineering, Electrical & Electronic
Mingwei Cao, Hao Gao, Wei Jia
Summary: This paper discusses the importance of stable image matching in 3D reconstruction and proposes a stable image-matching method. By designing steps such as feature point detection, descriptor extraction, feature matching, and matching verification, the method exhibits high matching precision and fast speed in experiments.
INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS
(2021)
Article
Chemistry, Multidisciplinary
Mingwei Cao, Haiyan Jiang, Haifeng Zhao
Summary: This paper proposes an image matching method for 3D reconstruction, which can achieve high matching accuracy in a short amount of time through hash index. The method addresses the issues of low accuracy and slow speeds when dealing with large-scale image datasets.
APPLIED SCIENCES-BASEL
(2023)
Article
Computer Science, Artificial Intelligence
Xingyu Jiang, Yifan Xia, Xiao-Ping Zhang, Jiayi Ma
Summary: This paper proposes a general optimization framework based on graph matching to address the mis-match removal problem in feature-based matching. By combining integer quadratic programming with a compensation term, the authors formulate the problem and introduce the Local Graph Structure Consensus (LGSC) for discouraging matches. The proposed approach preserves geometric topology and achieves superior performance in terms of accuracy and robustness.
PATTERN RECOGNITION
(2022)
Article
Computer Science, Artificial Intelligence
Yabo Fu, Yang Lei, Tonghe Wang, Pretesh Patel, Ashesh B. Jani, Hui Mao, Walter J. Curran, Tian Liu, Xiaofeng Yang
Summary: A non-rigid MR-TRUS image registration framework was proposed for prostate interventions, utilizing CNN for prostate segmentation and point-cloud based network for rapid 3D point cloud matching. The network was trained using deformation field generated by finite element analysis, achieving good registration accuracy and robustness in MR-TRUS image registration.
MEDICAL IMAGE ANALYSIS
(2021)
Article
Biology
Jonas Cordes, Thomas Enzlein, Christian Marsching, Marven Hinze, Sandy Engelhardt, Carsten Hopf, Ivo Wolf
Summary: M(2)aia is an extensible open-source application that provides interactive and memory-efficient data access and signal processing for multiple large MSI datasets. It extends MITK and offers features such as fast visual interaction, image segmentation, 3D image reconstruction, and multi-modal registration, making it suitable for a wide range of MSI analysis tasks.
Article
Engineering, Electrical & Electronic
Jyun-Ping Jhan, Jiann-Yeou Rau
Summary: The study proposed a normalized SURF (N-SURF) method that can significantly increase correct matches (CMs) among multi-spectral images, enabling one-step image registration. Evaluation using datasets from three representative MSCs showed N-SURF outperforms SURF in registration accuracy.
IEEE JOURNAL OF SELECTED TOPICS IN APPLIED EARTH OBSERVATIONS AND REMOTE SENSING
(2021)
Article
Computer Science, Interdisciplinary Applications
Larisa Komosko, Mikhail Batsyn, Pablo San Segundo, Panos M. Pardalos
JOURNAL OF COMBINATORIAL OPTIMIZATION
(2016)
Article
Computer Science, Artificial Intelligence
Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn, Alexey Nikolaev, Panos M. Pardalos
APPLIED INTELLIGENCE
(2016)
Article
Computer Science, Interdisciplinary Applications
Pablo San Segundo, Alvaro Lopez, Panos M. Pardalos
COMPUTERS & OPERATIONS RESEARCH
(2016)
Article
Operations Research & Management Science
Pablo San Segundo, Alvaro Lopez, Jorge Artieda, Panos M. Pardalos
OPTIMIZATION LETTERS
(2017)
Article
Computer Science, Software Engineering
Pablo San Segundo, Jorge Artieda, Mikhail Batsyn, Panos M. Pardalos
OPTIMIZATION METHODS & SOFTWARE
(2017)
Article
Computer Science, Interdisciplinary Applications
Pablo San Segundo, Jorge Artieda, Darren Strash
COMPUTERS & OPERATIONS RESEARCH
(2018)
Article
Management
Fabio Furini, Ivana Ljubic, Sebastien Martin, Pablo San Segundo
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2019)
Article
Computer Science, Interdisciplinary Applications
Pablo San Segundo, Fabio Furini, Jorge Artieda
COMPUTERS & OPERATIONS RESEARCH
(2019)
Article
Management
Pablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubic
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2019)
Article
Management
Stefano Coniglio, Fabio Furini, Pablo San Segundo
Summary: This study introduces a novel combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts, which effectively combines different procedures for pruning branch-and-bound nodes. The algorithm shows high pruning potential and low computational effort, outperforming state-of-the-art methods by up to two orders of magnitude in speed.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Management
Pablo San Segundo, Fabio Furini, Rafael Leon
Summary: A binary constraint satisfaction problem is a fundamental problem in Constraint Programming. We have developed a new exact algorithm that solves the problem by reformulating it as a k-clique problem on a microstructure graph representation. Our algorithm improves the domain reduction filtering and performs graph reordering, resulting in superior performance in extensive benchmark tests.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Management
Pablo San Segundo, Fabio Furini, David Alvarez, Panos M. Pardalos
Summary: Given a graph, the maximum clique problem (MCP) asks for determining a complete subgraph with the largest possible number of vertices. We propose a new exact algorithm, called CliSAT , to solve the MCP to proven optimality. This problem is of fundamental importance in graph theory and combinatorial optimization due to its practical relevance for a wide range of applications.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Proceedings Paper
Mathematics, Applied
Cristobal Tapia, Pablo San Segundo, Ramon Galan
MATHEMATICAL METHODS & COMPUTATIONAL TECHNIQUES IN SCIENCE & ENGINEERING
(2017)
Article
Computer Science, Information Systems
Pablo San Segundo, Alexey Nikolaev, Mikhail Batsyn, Panos M. Pardalos