scholarly journals Efficient and Deep Vehicle Re-Identification Using Multi-Level Feature Extraction

2019 ◽  
Vol 9 (7) ◽  
pp. 1291 ◽  
Author(s):  
Zakria ◽  
Jingye Cai ◽  
Jianhua Deng ◽  
Muhammad Aftab ◽  
Muhammad Khokhar ◽  
...  

The intelligent transportation system is currently an active research area, and vehicle re-identification (Re-Id) is a fundamental task to implement it. It determines whether the given vehicle image obtained from one camera has already appeared over a camera network or not. There are many possible practical applications where the vehicle Re-Id system can be employed, such as intelligent vehicle parking, suspicious vehicle tracking, vehicle incident detection, vehicle counting, and automatic toll collection. This task becomes more challenging because of intra-class similarity, viewpoint changes, and inconsistent environmental conditions. In this paper, we propose a novel approach that re-identifies a vehicle in two steps: first we shortlist the vehicle from a gallery set on the basis of appearance, and then in the second step we verify the shortlisted vehicle’s license plates with a query image to identify the targeted vehicle. In our model, the global channel extracts the feature vector from the whole vehicle image, and the local region channel extracts more discriminative and salient features from different regions. In addition to this, we jointly incorporate attributes like model, type, and color, etc. Lastly, we use a siamese neural network to verify license plates to reach the exact vehicle. Extensive experimental results on the benchmark dataset VeRi-776 demonstrate the effectiveness of the proposed model as compared to various state-of-the-art methods.

Mathematics ◽  
2021 ◽  
Vol 9 (23) ◽  
pp. 3052
Author(s):  
Liping Xiong ◽  
Sumei Guo

Specification and verification of coalitional strategic abilities have been an active research area in multi-agent systems, artificial intelligence, and game theory. Recently, many strategic logics, e.g., Strategy Logic (SL) and alternating-time temporal logic (ATL*), have been proposed based on classical temporal logics, e.g., linear-time temporal logic (LTL) and computational tree logic (CTL*), respectively. However, these logics cannot express general ω-regular properties, the need for which are considered compelling from practical applications, especially in industry. To remedy this problem, in this paper, based on linear dynamic logic (LDL), proposed by Moshe Y. Vardi, we propose LDL-based Strategy Logic (LDL-SL). Interpreted on concurrent game structures, LDL-SL extends SL, which contains existential/universal quantification operators about regular expressions. Here we adopt a branching-time version. This logic can express general ω-regular properties and describe more programmed constraints about individual/group strategies. Then we study three types of fragments (i.e., one-goal, ATL-like, star-free) of LDL-SL. Furthermore, we show that prevalent strategic logics based on LTL/CTL*, such as SL/ATL*, are exactly equivalent with those corresponding star-free strategic logics, where only star-free regular expressions are considered. Moreover, results show that reasoning complexity about the model-checking problems for these new logics, including one-goal and ATL-like fragments, is not harder than those of corresponding SL or ATL*.


For years’ radiologist and clinician continues to employs various approaches, machine learning algorithms included to detect, diagnose, and prevent diseases using medical imaging. Recent advances in deep learning made medical imaging analysis and processing an active research area, various algorithms for segmentation, detection, and classification have been proposed. In this survey, we describe the trends of deep learning algorithms use in medical imaging, their architecture, hardware, and software used are all discussed. We concluded with the proposed model for brain lesion segmentation and classification using Magnetic Resonance Images (MRI).


Author(s):  
Chandra Yadav ◽  
Aditi Sharan

Automatic text document summarization is active research area in text mining field. In this article, the authors are proposing two new approaches (three models) for sentence selection, and a new entropy-based summary evaluation criteria. The first approach is based on the algebraic model, Singular Value Decomposition (SVD), i.e. Latent Semantic Analysis (LSA) and model is termed as proposed_model-1, and Second Approach is based on entropy that is further divided into proposed_model-2 and proposed_model-3. In first proposed model, the authors are using right singular matrix, and second & third proposed models are based on Shannon entropy. The advantage of these models is that these are not a Length dominating model, giving better results, and low redundancy. Along with these three new models, an entropy-based summary evaluation criteria is proposed and tested. They are also showing that their entropy based proposed models statistically closer to DUC-2002's standard/gold summary. In this article, the authors are using a dataset taken from Document Understanding Conference-2002.


Author(s):  
S. Dhinakaran

<p>The field of image retrieval has been an active research area for several decades and has been paid more and more attention in recent years as a result of the dramatic and fast increase in the volume of digital images. Content-based image retrieval (CBIR) is a new but widely adopted method for finding images from vast and un annotated image databases. In recent years, a variety of techniques have been developed to improve the performance of CBIR. In reaction to the needs of users, who feel problems connected with traditional methods of image searching and indexing, researchers focus their interest on techniques for retrieving images on the basis of automatically-derived features, often denoted as Content-Based Image Retrieval (CBIR). CBIR systems index the media documents using salient features extracted from the actual media rather than by textual annotations. Query by content is nowadays a very active research field, with many systems being developed by industrial and academic teams. Results performed by these teams are really promising. The situation gets diametrically different when we move our attention from the usual CBIR task, i.e. the retrieval of images which are similar (as a whole) to the query image, to the task “find all images that contain the query image”. The proposed CBIR technique uses more than one clustering techniques to improve the performance of CBIR. This optimized method makes use of K-means and Hierarchical clustering technique to improve the execution time and performance of image retrieval systems in high dimensional sets. In this similarity measure is totally based on colors. In this paper more focus area is the way of combination of clustering technique in order to get faster output of images. In this paper the clustering techniques are discussed and analyzed. Also, we propose a method HDK that uses more than one clustering technique to improve the performance of CBIR. This method makes use of hierarchical and divides and conquers K-means clustering technique with equivalency and compatible relation concepts to improve the performance of the K-Means for using in high dimensional datasets. It also introduced the feature like color, texture and shape for accurate and effective retrieval system.</p>


2020 ◽  
Vol 2020 (9) ◽  
pp. 323-1-323-8
Author(s):  
Litao Hu ◽  
Zhenhua Hu ◽  
Peter Bauer ◽  
Todd J. Harris ◽  
Jan P. Allebach

Image quality assessment has been a very active research area in the field of image processing, and there have been numerous methods proposed. However, most of the existing methods focus on digital images that only or mainly contain pictures or photos taken by digital cameras. Traditional approaches evaluate an input image as a whole and try to estimate a quality score for the image, in order to give viewers an idea of how “good” the image looks. In this paper, we mainly focus on the quality evaluation of contents of symbols like texts, bar-codes, QR-codes, lines, and hand-writings in target images. Estimating a quality score for this kind of information can be based on whether or not it is readable by a human, or recognizable by a decoder. Moreover, we mainly study the viewing quality of the scanned document of a printed image. For this purpose, we propose a novel image quality assessment algorithm that is able to determine the readability of a scanned document or regions in a scanned document. Experimental results on some testing images demonstrate the effectiveness of our method.


Author(s):  
Ishu Bansal ◽  
Rajnish Kansal

VANET is branch of networking that is used for communication in intelligent transportation system. In this process of VANET various nodes are interconnected to each other and road side units. R2R, V2V and V2R communication has been done in VANET. Due to variouscommunications under VANET routing protocols have overhead for computation of shortest path and transmission of information with minimum delay. Delay in the network cause minimum safety. In this paper an approach has been proposed that can be used for transmission of safety message over the network with minimum delay. On the basis of proposed approach safety message can be transmitted in shortest interval of time so that safety can be achieved in the network.


Sensors ◽  
2020 ◽  
Vol 20 (6) ◽  
pp. 1633 ◽  
Author(s):  
Beom-Su Kim ◽  
Sangdae Kim ◽  
Kyong Hoon Kim ◽  
Tae-Eung Sung ◽  
Babar Shah ◽  
...  

Many applications are able to obtain enriched information by employing a wireless multimedia sensor network (WMSN) in industrial environments, which consists of nodes that are capable of processing multimedia data. However, as many aspects of WMSNs still need to be refined, this remains a potential research area. An efficient application needs the ability to capture and store the latest information about an object or event, which requires real-time multimedia data to be delivered to the sink timely. Motivated to achieve this goal, we developed a new adaptive QoS routing protocol based on the (m,k)-firm model. The proposed model processes captured information by employing a multimedia stream in the (m,k)-firm format. In addition, the model includes a new adaptive real-time protocol and traffic handling scheme to transmit event information by selecting the next hop according to the flow status as well as the requirement of the (m,k)-firm model. Different from the previous approach, two level adjustment in routing protocol and traffic management are able to increase the number of successful packets within the deadline as well as path setup schemes along the previous route is able to reduce the packet loss until a new path is established. Our simulation results demonstrate that the proposed schemes are able to improve the stream dynamic success ratio and network lifetime compared to previous work by meeting the requirement of the (m,k)-firm model regardless of the amount of traffic.


2021 ◽  
Vol 25 (3) ◽  
pp. 711-738
Author(s):  
Phu Pham ◽  
Phuc Do

Link prediction on heterogeneous information network (HIN) is considered as a challenge problem due to the complexity and diversity in types of nodes and links. Currently, there are remained challenges of meta-path-based link prediction in HIN. Previous works of link prediction in HIN via network embedding approach are mainly focused on exploiting features of node rather than existing relations in forms of meta-paths between nodes. In fact, predicting the existence of new links between non-linked nodes is absolutely inconvincible. Moreover, recent HIN-based embedding models also lack of thorough evaluations on the topic similarity between text-based nodes along given meta-paths. To tackle these challenges, in this paper, we proposed a novel approach of topic-driven multiple meta-path-based HIN representation learning framework, namely W-MMP2Vec. Our model leverages the quality of node representations by combining multiple meta-paths as well as calculating the topic similarity weight for each meta-path during the processes of network embedding learning in content-based HINs. To validate our approach, we apply W-TMP2Vec model in solving several link prediction tasks in both content-based and non-content-based HINs (DBLP, IMDB and BlogCatalog). The experimental outputs demonstrate the effectiveness of proposed model which outperforms recent state-of-the-art HIN representation learning models.


2021 ◽  
Vol 9 (1) ◽  
Author(s):  
Karin Wildi ◽  
Samantha Livingstone ◽  
Chiara Palmieri ◽  
Gianluigi LiBassi ◽  
Jacky Suen ◽  
...  

AbstractThe acute respiratory distress syndrome (ARDS) is a severe lung disorder with a high morbidity and mortality which affects all age groups. Despite active research with intense, ongoing attempts in developing pharmacological agents to treat ARDS, its mortality rate remains unaltered high and treatment is still only supportive. Over the years, there have been many attempts to identify meaningful subgroups likely to react differently to treatment among the heterogenous ARDS population, most of them unsuccessful. Only recently, analysis of large ARDS cohorts from randomized controlled trials have identified the presence of distinct biological subphenotypes among ARDS patients: a hypoinflammatory (or uninflamed; named P1) and a hyperinflammatory (or reactive; named P2) subphenotype have been proposed and corroborated with existing retrospective data. The hyperinflammatory subphenotyope was clearly associated with shock state, metabolic acidosis, and worse clinical outcomes. Core features of the respective subphenotypes were identified consistently in all assessed cohorts, independently of the studied population, the geographical location, the study design, or the analysis method. Additionally and clinically even more relevant treatment efficacies, as assessed retrospectively, appeared to be highly dependent on the respective subphenotype. This discovery launches a promising new approach to targeted medicine in ARDS. Even though it is now widely accepted that each ARDS subphenotype has distinct functional, biological, and mechanistic differences, there are crucial gaps in our knowledge, hindering the translation to bedside application. First of all, the underlying driving biological factors are still largely unknown, and secondly, there is currently no option for fast and easy identification of ARDS subphenotypes. This narrative review aims to summarize the evidence in biological subphenotyping in ARDS and tries to point out the current issues that will need addressing before translation of biological subohenotypes into clinical practice will be possible.


2021 ◽  
pp. 1-11
Author(s):  
Aysu Melis Buyuk ◽  
Gul T. Temur

In line with the increase in consciousness on sustainability in today’s global world, great emphasis has been attached to food waste management. Food waste is a complex issue to manage due to uncertainties on quality, quantity, location, and time of wastes, and it involves different decisions at many stages from seed to post-consumption. These ambiguities re-quire that some decisions should be handled in a linguistic and ambiguous environment. That forces researchers to benefit from fuzzy sets mostly utilized to deal with subjectivity that causes uncertainty. In this study, as a novel approach, the spherical fuzzy analytic hierarchy process (SFAHP) was used to select the best food treatment option. In the model, four main criteria (infrastructural, governmental, economic, and environmental) and their thirteen sub-criteria are considered. A real case is conducted to show how the proposed model can be used to assess four food waste treatment options (composting, anaerobic digestion, landfilling, and incineration). Also, a sensitivity analysis is generated to check whether the evaluations on the main criteria can change the results or not. The proposed model aims to create a subsidiary tool for decision makers in relevant companies and institutions.


Sign in / Sign up

Export Citation Format

Share Document