scholarly journals Two‐way constraint network for RGB‐Infrared person re‐identification

2021 ◽  
Author(s):  
Haitang Zeng ◽  
Weipeng Hu ◽  
Dihu Chen ◽  
Haifeng Hu
Keyword(s):  

2011 ◽  
Vol 124 (9) ◽  
pp. 1603-1603
Author(s):  
A. Hruby ◽  
M. Zapatka ◽  
S. Heucke ◽  
L. Rieger ◽  
Y. Wu ◽  
...  




Author(s):  
Xinsheng Xu ◽  
Tianhong Yan ◽  
Yangke Ding

AbstractProduct variant design, as one of the key enabling technologies of mass customization, is the transfer of variant information among mating parts from the perspective of informatics. A dimension constraint network (DCN) among mating parts carries on the task of transferring variant information. What are the information transfer characteristics of dimensions in a constraint network is a fundamental issue to plan the product variant design process reasonably. We begin by showing the natural dynamics of the DCN from two aspects: structure and uncertainty. The information efficiency of the DCN was proposed based on its simple path to specify the information transfer capability of the network. Based on this, the information centrality of the dimension was developed by measuring the efficiency loss of the DCN after the removal of a dimension from the network, which describes the information transfer capability of this dimension. Further, the information centrality of a part was derived. Using a spherical valve subassembly, we calculated the information centrality of the dimensions in a constraint network. We determined that the information centrality of dimension is highly correlated to its out-degree. An approach to plan the sequence of the part variant design according to its information centrality was proposed. We calculated the uncertainties of the DCN and its cumulative uncertainties under different sequences of the part variant design. Results indicate that part variant design under the descending information centrality of the parts minimizes the uncertainty of the DCN. This suggests a new method of planning the sequence of part variant design.





Author(s):  
Sudhakar Y. Reddy ◽  
Kenneth W. Fertig

Abstract Design Sheet™ is a constraint management system specially designed for doing conceptual design cost and performance tradeoff studies. It represents the design models as constraints between design variables, and uses graph-theoretic algorithms to decompose large systems of nonlinear equations into smaller pieces that can be solved robustly. This paper describes extensions to Design Sheet that enable it to manage functions as variables in a constraint network. The paper also discusses the new capabilities of function encapsulation and explicit differentiation that are built on top of these extensions. The ability to encapsulate a part of the constraint network into a function, and use it in other constraints, promotes model reuse and improves computational efficiency. The capability to automatically differentiate certain variables with respect to other design variables allows Design Sheet to be used for solving practical optimization problems. In combination with the tradeoff capability, this enables the designer to track changing optima in trade studies. The paper also provides a couple of optimization examples to demonstrate these new capabilities.



2020 ◽  
Vol 15 (4) ◽  
pp. 439-474
Author(s):  
Soroush Mobasheri ◽  
Mehrnoush Shamsfard

Representation of scientific knowledge in ontologies suffers so often from the lack of computational knowledge required for inference. This article aims to perform quantitative analysis on physical systems, that is, to answer questions about values of quantitative state variables of a physical system with known structure. For this objective, we incorporate procedural knowledge on two distinct levels. At the domain-specific level, we propose a representation model for scientific knowledge, i.e. variables, theories, and laws of nature. At the domain-independent level, we provide an algorithm which, given a system S with known structure and a relevant scientific theory T, extracts a constraint network, whose variables are state variables of S defined by T, and whose constraints raise from relevant laws in T. The constraint network is then solved, to build a system of equations whose unknowns are the output variables of S. The proposed representation model and reasoning algorithm are evaluated by applying them to classic analysis examples.



2020 ◽  
Vol 2020 ◽  
pp. 1-11 ◽  
Author(s):  
Chu He ◽  
Zishan Shi ◽  
Peizhang Fang ◽  
Dehui Xiong ◽  
Bokun He ◽  
...  

In recent years, methods based on neural network have achieved excellent performance for image segmentation. However, segmentation around the edge area is still unsatisfactory when dealing with complex boundaries. This paper proposes an edge prior semantic segmentation architecture based on Bayesian framework. The entire framework is composed of three network structures, a likelihood network and an edge prior network at the front, followed by a constraint network. The likelihood network produces a rough segmentation result, which is later optimized by edge prior information, including the edge map and the edge distance. For the constraint network, the modified domain transform method is proposed, in which the diffusion direction is revised through the newly defined distance map and some added constraint conditions. Experiments about the proposed approach and several contrastive methods show that our proposed method had good performance and outperformed FCN in terms of average accuracy for 0.0209 on ESAR data set.



NeuroImage ◽  
2020 ◽  
Vol 208 ◽  
pp. 116412 ◽  
Author(s):  
Chris McNorgan ◽  
Gregory J. Smith ◽  
Erica S. Edwards




Sign in / Sign up

Export Citation Format

Share Document