An Effective Heuristic-Based Approach for Partitioning

Zhao, Xibin; Zhang, Hehua; Jiang, Yu; Song, Songzheng; Jiao, Xun; Gao, Ming

doi:10.1155/2013/138037

Cited by 11 publications

(9 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The traditional hand-crafted feature-based approaches can be broadly divided into two groups [9] [10]: 2D image-based approaches [11] [12] [13] [14] and model-based approaches [15] [16] [17].…”

Section: A Hand-crafted Feature-based Approachesmentioning

confidence: 99%

2DSlicesNet: A 2D Slice-Based Convolutional Neural Network for 3D Object Retrieval and Classification

2021

View full text Add to dashboard Cite

3D data can be instrumental to the computer vision field as it provides insightful information about the full 3D models' geometry. Recently, with easy access to both computational power and huge 3D databases, it is feasible to apply convolutional neural networks to automatically extract the 3D models' features. This paper presents a novel approach, called 2DSlicesNet, which deals with the issue of 3D model retrieval and classification using a 2D slice-based representation with a 3D convolutional neural network.The assumption in this context is that similar 3D models will be composed of almost identical 2D slices. Therefore, we first transform each normalized 3D model into a set of 2D slices corresponding to its first main axis, and then use them as input data to our 3D convolutional neural network. Experimental results and comparison with state-of-the-art approaches, using ModelNet10 and ModelNet40 datasets, prove that our proposed 2DSlicesNet approach can reach notable rates of accuracy in classification and retrieval.INDEX TERMS Deep learning, 2D slices, 3D Convolutional neural network, 3D object classification, 3D object retrieval.

show abstract

Section: A Hand-crafted Feature-based Approachesmentioning

confidence: 99%

2DSlicesNet: A 2D Slice-Based Convolutional Neural Network for 3D Object Retrieval and Classification

2021

View full text Add to dashboard Cite

show abstract

“…Because the reliability formalization results in a more complex optimization problem, which cannot be simplified to the knaspack problem, the domain-specific based acceleration algorithms cannot be applied. In this paper, the general purpose algorithm [32], [9] based on the genetic algorithm and simulated annealing algorithm is customized to get the final result of the system design. First, we apply the original genetic algorithm (ALG1) presented in [33] to the uncertain partitioning problem P 2 .…”

Section: Problem Solutionmentioning

confidence: 99%

“…First, we apply the original genetic algorithm (ALG1) presented in [33] to the uncertain partitioning problem P 2 . Then, the enhanced algorithm (ALG2) presented in our previous work [32], [9] is also customized to solve the problem.…”

Section: Problem Solutionmentioning

confidence: 99%

“…Recently, many research efforts have been undertaken to automate this task. Those efforts include exact partitioning [6], [7], [8] and heuristic partitioning models [9], [10], [11], [12], [13]. But few algorithms address the issue that we cannot accurately determine the cost and time of system components, and few works take the reliability characterization into account.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Uncertainty Theory Based Reliability-Centric Cyber-Physical System Design

Jiang

Wang

Jiao³

et al. 2019

2019 International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE C

Self Cite

View full text Add to dashboard Cite

Cyber-physical systems (CPSs) are built from, and depend upon, the seamless integration of software and hardware components. The most important challenge in CPS design and verification is to design CPS to be reliable in a variety of uncertainties, i.e., unanticipated and rapidly evolving environments and disturbances. The costs, delays and reliability of the designed CPS are highly dependent on software-hardware partitioning in the design. The key challenges in partitioning CPSs is that it is difficult to formalize reliability characterization in the same way as the uncertain cost and time delay. In this paper, we propose a new CPS design paradigm for reliability assurance while coping with uncertainty. To be specific, we develop an uncertain programming model for partitioning based on the uncertainty theory, to support the assured reliability. The uncertainty effect of the cost and delay time of components to be implemented can be modeled by the uncertainty variables with uncertainty distributions, and the reliability characterization is recursively derived. We convert the uncertain programming model and customize an improved heuristic to solve the converted model. Experiment results on some benchmarks and random graphs show that the uncertain method produces the design with higher reliability. Besides, in order to demonstrate the effectiveness of our model for in coping with uncertainty in design stage, we apply this uncertain framework and existing deterministic models in the design process of a subsystem that is used in real world subway control. The system implemented based on the uncertain model works better than the result of deterministic models. The proposed design paradigm has the potential to be generalized to the design of CPSs for greater assurances of safety and security under a variety of uncertainties.

show abstract

“…An example of development of algorithms for solving partitioning problems can be paper [13]. Application of multiagents was proposed in [14].…”

Section: Literature Review and Problem Statementmentioning

confidence: 99%

Study of the mathematical models of optimal partitioning for particular cases

Firsov

2018

EEJET

View full text Add to dashboard Cite

Досліджено особливості застосування теорії задач неперервного розбиття множин для випадку, коли вихідна множина є частиною плоскої кривої. Сформульована задача для окремого випадку відомої постановки. Ця задача розв'язана з урахуванням запропонованих обмежень. Виконано обчислювальний експеримент. Зроблено висновки про можливості прикладного застосування розв'язків поставленої задачі Ключові слова: оптимальне розбиття, неперервна множина, мінімізація, довжина дуги, центр множини, метрика, розташування Исследованы особенности применения теории задач непрерывного разбиения множеств для случая, когда исходное множество является частью плоской кривой. Сформулирована задача для частного случая известной постановки. Эта задача решена с учётом предложенных ограничений. Проведён вычислительный эксперимент. Сделаны выводы о возможности прикладного применения решения поставленной задачи Ключевые слова: оптимальное разбиение, непрерывное множество, минимизация, длина дуги, центр множества, метрика, размещение

show abstract

An Effective Heuristic-Based Approach for Partitioning

Cited by 11 publications

References 34 publications

2DSlicesNet: A 2D Slice-Based Convolutional Neural Network for 3D Object Retrieval and Classification

2DSlicesNet: A 2D Slice-Based Convolutional Neural Network for 3D Object Retrieval and Classification

Uncertainty Theory Based Reliability-Centric Cyber-Physical System Design

Study of the mathematical models of optimal partitioning for particular cases

Contact Info

Product

Resources

About