This paper discusses and sums up the basic criterions of guaranteeing the labeling quality and abstracts the four basic factors including the conflict for a label with a label,overlay for label with the features,posit...This paper discusses and sums up the basic criterions of guaranteeing the labeling quality and abstracts the four basic factors including the conflict for a label with a label,overlay for label with the features,position’s priority and the association for a label with its feature.By establishing the scoring system,a formalized four-factors quality evaluation model is constructed.Last,this paper introduces the experimental result of the quality evaluation model applied to the automatic map labeling system-MapLabel.展开更多
Among the huge diversity of ideas that show up while studying graph theory,one that has obtained a lot of popularity is the concept of labelings of graphs.Graph labelings give valuable mathematical models for a wide s...Among the huge diversity of ideas that show up while studying graph theory,one that has obtained a lot of popularity is the concept of labelings of graphs.Graph labelings give valuable mathematical models for a wide scope of applications in high technologies(cryptography,astronomy,data security,various coding theory problems,communication networks,etc.).A labeling or a valuation of a graph is any mapping that sends a certain set of graph elements to a certain set of numbers subject to certain conditions.Graph labeling is a mapping of elements of the graph,i.e.,vertex and for edges to a set of numbers(usually positive integers),called labels.If the domain is the vertex-set or the edge-set,the labelings are called vertex labelings or edge labelings respectively.Similarly,if the domain is V(G)[E(G)],then the labeling is called total labeling.A reflexive edge irregular k-labeling of graph introduced by Tanna et al.:A total labeling of graph such that for any two different edges ab and a'b'of the graph their weights has wt_(x)(ab)=x(a)+x(ab)+x(b) and wt_(x)(a'b')=x(a')+x(a'b')+x(b') are distinct.The smallest value of k for which such labeling exist is called the reflexive edge strength of the graph and is denoted by res(G).In this paper we have found the exact value of the reflexive edge irregularity strength of the categorical product of two paths (P_(a)×P_(b))for any choice of a≥3 and b≥3.展开更多
Image-maps,a hybrid design with satellite images as background and map symbols uploaded,aim to combine the advantages of maps’high interpretation efficiency and satellite images’realism.The usability of image-maps i...Image-maps,a hybrid design with satellite images as background and map symbols uploaded,aim to combine the advantages of maps’high interpretation efficiency and satellite images’realism.The usability of image-maps is influenced by the representations of background images and map symbols.Many researchers explored the optimizations for background images and symbolization techniques for symbols to reduce the complexity of image-maps and improve the usability.However,little literature was found for the optimum amount of symbol loading.This study focuses on the effects of background image complexity and map symbol load on the usability(i.e.,effectiveness and efficiency)of image-maps.Experiments were conducted by user studies via eye-tracking equipment and an online questionnaire survey.Experimental data sets included image-maps with ten levels of map symbol load in ten areas.Forty volunteers took part in the target searching experiments.It has been found that the usability,i.e.,average time viewed(efficiency)and average revisits(effectiveness)of targets recorded,is influenced by the complexity of background images,a peak exists for optimum symbol load for an image-map.The optimum levels for symbol load for different image-maps also have a peak when the complexity of the background image/image map increases.The complexity of background images serves as a guideline for optimum map symbol load in image-map design.This study enhanced user experience by optimizing visual clarity and managing cognitive load.Understanding how these factors interact can help create adaptive maps that maintain clarity and usability,guiding AI algorithms to adjust symbol density based on user context.This research establishes the practices for map design,making cartographic tools more innovative and more user-centric.展开更多
The mapping method is a forward-modeling method that transforms the irregular surface to horizontal by mapping the rectangular grid as curved; moreover, the wave field calculations move from the physical domain to the...The mapping method is a forward-modeling method that transforms the irregular surface to horizontal by mapping the rectangular grid as curved; moreover, the wave field calculations move from the physical domain to the calculation domain. The mapping method deals with the irregular surface and the low-velocity layer underneath it using a fine grid. For the deeper high-velocity layers, the use of a fine grid causes local oversampling. In addition, when the irregular surface is transformed to horizontal, the flattened interface below the surface is transformed to curved, which produces inaccurate modeling results because of the presence of ladder-like burrs in the simulated seismic wave. Thus, we propose the mapping method based on the dual-variable finite-difference staggered grid. The proposed method uses different size grid spacings in different regions and locally variable time steps to match the size variability of grid spacings. Numerical examples suggest that the proposed method requires less memory storage capacity and improves the computational efficiency compared with forward modeling methods based on the conventional grid.展开更多
相位展开是磁共振成像技术应用中最关键的环节之一,可以为磁共振的某些重要临床应用提供精确的相位信息。然而,由于临床磁共振成像过程中,部分区域真实的相位存在急剧变化,同时伴有不同性态的噪声污染,导致相位展开时存在信息的高度不...相位展开是磁共振成像技术应用中最关键的环节之一,可以为磁共振的某些重要临床应用提供精确的相位信息。然而,由于临床磁共振成像过程中,部分区域真实的相位存在急剧变化,同时伴有不同性态的噪声污染,导致相位展开时存在信息的高度不一致性。为了有效地解决上述难题,基于马尔可夫-最大后验(Markov Random Field& Maximum A Posterioi,MRF-MAP)模型,首次将相位展开看作计算机视觉中的标记问题,并结合磁共振相位数据的特点,设计出相位图的模糊质量图,完成相位展开的能量函数构建。针对能量函数的优化求解,采用高效的图割算法进行。展开更多
In the field of medical images,pixel-level labels are time-consuming and expensive to acquire,while image-level labels are relatively easier to obtain.Therefore,it makes sense to learn more information(knowledge)from ...In the field of medical images,pixel-level labels are time-consuming and expensive to acquire,while image-level labels are relatively easier to obtain.Therefore,it makes sense to learn more information(knowledge)from a small number of hard-to-get pixel-level annotated images to apply to different tasks to maximize their usefulness and save time and training costs.In this paper,using Pixel-Level Labeled Images forMulti-Task Learning(PLDMLT),we focus on grading the severity of fundus images for Diabetic Retinopathy(DR).This is because,for the segmentation task,there is a finely labeled mask,while the severity grading task is without classification labels.To this end,we propose a two-stage multi-label learning weakly supervised algorithm,which generates initial classification pseudo labels in the first stage and visualizes heat maps at all levels of severity using Grad-Cam to further provide medical interpretability for the classification task.A multitask model framework with U-net as the baseline is proposed in the second stage.A label update network is designed to alleviate the gradient balance between the classification and segmentation tasks.Extensive experimental results show that our PLDMLTmethod significantly outperforms other stateof-the-art methods in DR segmentation on two public datasets,achieving up to 98.897%segmentation accuracy.In addition,our method achieves comparable competitiveness with single-task fully supervised learning in the DR severity grading task.展开更多
The quick response code based artificial labels are applied to provide semantic concepts and relations of surroundings that permit the understanding of complexity and limitations of semantic recognition and scene only...The quick response code based artificial labels are applied to provide semantic concepts and relations of surroundings that permit the understanding of complexity and limitations of semantic recognition and scene only with robot's vision.By imitating spatial cognizing mechanism of human,the robot constantly received the information of artificial labels at cognitive-guide points in a wide range of structured environment to achieve the perception of the environment and robot navigation.The immune network algorithm was used to form the environmental awareness mechanism with "distributed representation".The color recognition and SIFT feature matching algorithm were fused to achieve the memory and cognition of scenario tag.Then the cognition-guide-action based cognizing semantic map was built.Along with the continuously abundant map,the robot did no longer need to rely on the artificial label,and it could plan path and navigate freely.Experimental results show that the artificial label designed in this work can improve the cognitive ability of the robot,navigate the robot in the case of semi-unknown environment,and build the cognizing semantic map favorably.展开更多
This contribution proposes a new combination symbol mapper/8-ary constellation, which is a joint optimization of an 8-ary signal constellation and its symbol mapping operation, to improve the performance of Bit Interl...This contribution proposes a new combination symbol mapper/8-ary constellation, which is a joint optimization of an 8-ary signal constellation and its symbol mapping operation, to improve the performance of Bit Interleaved Coded Modulation with Iterative Decoding (BICM-ID). The basic idea was to use the so called (1,7) constellation (which is a capacitive efficient constellation) instead of the conventional 8-PSK constellation and to choose the most suitable mapping for it. A comparative study between the combinations most suitable mapping/(1,7) constellation and SSP mapping/conventional 8-PSK constellation has been carried out. Simulation results showed that the 1st combination significantly outperforms the 2nd combination and with only 4 iterations, it gives better performance than the 2nd combination with 8 iterations. A gain of 4 dB is given by iteration 4 of the 1st combination compared to iteration 8 of the 2nd combination at a BER level equal to 10-5, and it (iteration 4 of the 1st combination) can attain a BER equal to 10-7 for, only, a SNR = 5.6 dB.展开更多
基金Funded by the National Natural Science Foundation of China(N0.40001019).
文摘This paper discusses and sums up the basic criterions of guaranteeing the labeling quality and abstracts the four basic factors including the conflict for a label with a label,overlay for label with the features,position’s priority and the association for a label with its feature.By establishing the scoring system,a formalized four-factors quality evaluation model is constructed.Last,this paper introduces the experimental result of the quality evaluation model applied to the automatic map labeling system-MapLabel.
文摘Among the huge diversity of ideas that show up while studying graph theory,one that has obtained a lot of popularity is the concept of labelings of graphs.Graph labelings give valuable mathematical models for a wide scope of applications in high technologies(cryptography,astronomy,data security,various coding theory problems,communication networks,etc.).A labeling or a valuation of a graph is any mapping that sends a certain set of graph elements to a certain set of numbers subject to certain conditions.Graph labeling is a mapping of elements of the graph,i.e.,vertex and for edges to a set of numbers(usually positive integers),called labels.If the domain is the vertex-set or the edge-set,the labelings are called vertex labelings or edge labelings respectively.Similarly,if the domain is V(G)[E(G)],then the labeling is called total labeling.A reflexive edge irregular k-labeling of graph introduced by Tanna et al.:A total labeling of graph such that for any two different edges ab and a'b'of the graph their weights has wt_(x)(ab)=x(a)+x(ab)+x(b) and wt_(x)(a'b')=x(a')+x(a'b')+x(b') are distinct.The smallest value of k for which such labeling exist is called the reflexive edge strength of the graph and is denoted by res(G).In this paper we have found the exact value of the reflexive edge irregularity strength of the categorical product of two paths (P_(a)×P_(b))for any choice of a≥3 and b≥3.
基金National Natural Science Foundation of China(No.42301518)Hubei Key Laboratory of Regional Development and Environmental Response(No.2023(A)002)Key Laboratory of the Evaluation and Monitoring of Southwest Land Resources(Ministry of Education)(No.TDSYS202304).
文摘Image-maps,a hybrid design with satellite images as background and map symbols uploaded,aim to combine the advantages of maps’high interpretation efficiency and satellite images’realism.The usability of image-maps is influenced by the representations of background images and map symbols.Many researchers explored the optimizations for background images and symbolization techniques for symbols to reduce the complexity of image-maps and improve the usability.However,little literature was found for the optimum amount of symbol loading.This study focuses on the effects of background image complexity and map symbol load on the usability(i.e.,effectiveness and efficiency)of image-maps.Experiments were conducted by user studies via eye-tracking equipment and an online questionnaire survey.Experimental data sets included image-maps with ten levels of map symbol load in ten areas.Forty volunteers took part in the target searching experiments.It has been found that the usability,i.e.,average time viewed(efficiency)and average revisits(effectiveness)of targets recorded,is influenced by the complexity of background images,a peak exists for optimum symbol load for an image-map.The optimum levels for symbol load for different image-maps also have a peak when the complexity of the background image/image map increases.The complexity of background images serves as a guideline for optimum map symbol load in image-map design.This study enhanced user experience by optimizing visual clarity and managing cognitive load.Understanding how these factors interact can help create adaptive maps that maintain clarity and usability,guiding AI algorithms to adjust symbol density based on user context.This research establishes the practices for map design,making cartographic tools more innovative and more user-centric.
基金financially supported by the National Natural Science Foundation of China(Nos.41104069 and 41274124)the National 973 Project(Nos.2014CB239006 and 2011CB202402)+1 种基金the Shandong Natural Science Foundation of China(No.ZR2011DQ016)Fundamental Research Funds for Central Universities(No.R1401005A)
文摘The mapping method is a forward-modeling method that transforms the irregular surface to horizontal by mapping the rectangular grid as curved; moreover, the wave field calculations move from the physical domain to the calculation domain. The mapping method deals with the irregular surface and the low-velocity layer underneath it using a fine grid. For the deeper high-velocity layers, the use of a fine grid causes local oversampling. In addition, when the irregular surface is transformed to horizontal, the flattened interface below the surface is transformed to curved, which produces inaccurate modeling results because of the presence of ladder-like burrs in the simulated seismic wave. Thus, we propose the mapping method based on the dual-variable finite-difference staggered grid. The proposed method uses different size grid spacings in different regions and locally variable time steps to match the size variability of grid spacings. Numerical examples suggest that the proposed method requires less memory storage capacity and improves the computational efficiency compared with forward modeling methods based on the conventional grid.
文摘相位展开是磁共振成像技术应用中最关键的环节之一,可以为磁共振的某些重要临床应用提供精确的相位信息。然而,由于临床磁共振成像过程中,部分区域真实的相位存在急剧变化,同时伴有不同性态的噪声污染,导致相位展开时存在信息的高度不一致性。为了有效地解决上述难题,基于马尔可夫-最大后验(Markov Random Field& Maximum A Posterioi,MRF-MAP)模型,首次将相位展开看作计算机视觉中的标记问题,并结合磁共振相位数据的特点,设计出相位图的模糊质量图,完成相位展开的能量函数构建。针对能量函数的优化求解,采用高效的图割算法进行。
文摘In the field of medical images,pixel-level labels are time-consuming and expensive to acquire,while image-level labels are relatively easier to obtain.Therefore,it makes sense to learn more information(knowledge)from a small number of hard-to-get pixel-level annotated images to apply to different tasks to maximize their usefulness and save time and training costs.In this paper,using Pixel-Level Labeled Images forMulti-Task Learning(PLDMLT),we focus on grading the severity of fundus images for Diabetic Retinopathy(DR).This is because,for the segmentation task,there is a finely labeled mask,while the severity grading task is without classification labels.To this end,we propose a two-stage multi-label learning weakly supervised algorithm,which generates initial classification pseudo labels in the first stage and visualizes heat maps at all levels of severity using Grad-Cam to further provide medical interpretability for the classification task.A multitask model framework with U-net as the baseline is proposed in the second stage.A label update network is designed to alleviate the gradient balance between the classification and segmentation tasks.Extensive experimental results show that our PLDMLTmethod significantly outperforms other stateof-the-art methods in DR segmentation on two public datasets,achieving up to 98.897%segmentation accuracy.In addition,our method achieves comparable competitiveness with single-task fully supervised learning in the DR severity grading task.
基金Projects(61203330,61104009,61075092)supported by the National Natural Science Foundation of ChinaProject(2013M540546)supported by China Postdoctoral Science Foundation+2 种基金Projects(ZR2012FM031,ZR2011FM011,ZR2010FM007)supported by Shandong Provincal Nature Science Foundation,ChinaProjects(2011JC017,2012TS078)supported by Independent Innovation Foundation of Shandong University,ChinaProject(201203058)supported by Shandong Provincal Postdoctoral Innovation Foundation,China
文摘The quick response code based artificial labels are applied to provide semantic concepts and relations of surroundings that permit the understanding of complexity and limitations of semantic recognition and scene only with robot's vision.By imitating spatial cognizing mechanism of human,the robot constantly received the information of artificial labels at cognitive-guide points in a wide range of structured environment to achieve the perception of the environment and robot navigation.The immune network algorithm was used to form the environmental awareness mechanism with "distributed representation".The color recognition and SIFT feature matching algorithm were fused to achieve the memory and cognition of scenario tag.Then the cognition-guide-action based cognizing semantic map was built.Along with the continuously abundant map,the robot did no longer need to rely on the artificial label,and it could plan path and navigate freely.Experimental results show that the artificial label designed in this work can improve the cognitive ability of the robot,navigate the robot in the case of semi-unknown environment,and build the cognizing semantic map favorably.
文摘This contribution proposes a new combination symbol mapper/8-ary constellation, which is a joint optimization of an 8-ary signal constellation and its symbol mapping operation, to improve the performance of Bit Interleaved Coded Modulation with Iterative Decoding (BICM-ID). The basic idea was to use the so called (1,7) constellation (which is a capacitive efficient constellation) instead of the conventional 8-PSK constellation and to choose the most suitable mapping for it. A comparative study between the combinations most suitable mapping/(1,7) constellation and SSP mapping/conventional 8-PSK constellation has been carried out. Simulation results showed that the 1st combination significantly outperforms the 2nd combination and with only 4 iterations, it gives better performance than the 2nd combination with 8 iterations. A gain of 4 dB is given by iteration 4 of the 1st combination compared to iteration 8 of the 2nd combination at a BER level equal to 10-5, and it (iteration 4 of the 1st combination) can attain a BER equal to 10-7 for, only, a SNR = 5.6 dB.
