Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jianmei Yang

dblp:80/1280 · DBLP profile ↗
← Back
10ranked-venue papers
2as first author
0since 2021 · last 2018
0009-0005-6634-3051ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-authorHuman-computer interaction and ubiquitous computing · 3 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 1 first-authorArtificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Digital forensics and information hiding · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding
digital forensics
0.312018
A Fast Forgery Detection Algorithm Based on Exponential-Fourier Moments for Video Region Duplication · IEEE Trans. Multim. 2018
Digital forensics and information hiding › forgery detection
video forgery detection
0.312018
A Fast Forgery Detection Algorithm Based on Exponential-Fourier Moments for Video Region Duplication · IEEE Trans. Multim. 2018

Methods — techniques the papers use, named apart from their topics

fast compression tracking · 0.7exponential-fourier moments · 0.7
YearPublicationVenuePosition
2018 A Fast Forgery Detection Algorithm Based on Exponential-Fourier Moments for Video Region Duplication
abstract
Region duplication is one of the most common methods of video forgery. Existing forgery detection algorithms generally suffer from inefficiency and are not effective for the forged regions with mirroring. To address these problems, we present a fast forgery detection algorithm based on Exponential-Fourier moments (EFMs) for detecting region duplication in videos. The algorithm first extracts EFMs features from each block in the current frame, and performs a fast match to find potential matching pairs. Then, a postverification scheme is designed to eliminate falsely matched pairs and locate the altered regions in the current frame. Finally, an adaptive parameter-based fast compression tracking algorithm is used to track the tampered regions in the subsequent frames. The experimental results show that our proposed algorithm has higher detection accuracy and computational efficiency than those of previous algorithms.
Lichao Su, Cuihua Li, Yuecong Lai, Jianmei Yang
IEEE Trans. Multim.4
2016 Using similarity analysis to detect frame duplication forgery in videos
Jianmei Yang, Lichao Su
Multim. Tools Appl.1
2015 A video forgery detection algorithm based on compressive sensing
Lichao Su, Jianmei Yang
Multim. Tools Appl.3
2010 On Mining Statistically Significant Attribute Association Information
abstract
Knowledge of the association information between the attributes in a data set provides insight into the underlying structure of the data and explains the relationships (independence, synergy, redundancy) between the attributes. Complex models learnt computationally from the data are more interpretable to a human analyst when such interdependencies are known. In this paper, we focus on mining two types of association information among the attributes – correlation information and interaction information which capture multivariate dependencies between the data attributes. Identifying the statistically significant attribute associations is a computationally challenging task – the number of possible associations increases exponentially and many associations contain redundant information when a number of correlated attributes are present. In this paper, we explore efficient data mining methods to discover non-redundant attribute sets that contain significant association information indicating the presence of informative patterns in the data.
Pritam Chanda, Jianmei Yang, Aidong Zhang 0001, Murali Ramanathan
SDM2
2010 Network analysis and rule mining of export market structure evolvement
abstract
Networks are well-suited model for representing complex systems and processes. This paper proposed a novel perspective on study of the evolvement of export market structure by combining network-based approach with data mining technology. Firstly, bipartite networks were constructed to describe the relationships that form between enterprises and their export markets based on China's Guangdong custom statistical data for the 2000-2005 periods. Network analysis techniques were used to analyze and describe the topology properties of the whole networks as well as their evolution over time. Secondly, data mining techniques were used to identify most frequent association relations and evolvement rule hidden in bipartite networks.
Jianmei Yang
SMC2
2008 Aggregation of fuzzy opinions with an area between the centroid point and the original point under group decision making
abstract
It is an important issue to obtain the consensus opinion under group decision making. In this paper, we propose a new approach to aggregate the experts’ opinions which is based on the area between the centroid points of fuzzy numbers and the original point. The opinions of experts are represented by positive fuzzy numbers which include the normal and the non-normal trapezoidal fuzzy numbers as well as interval numbers. A new index that the consensus of each expert to others is constructed by using a similarity measure under the area. We also take into consideration the importance of each expert in the process of aggregation. The operational procedure is simple and the numerical examples show its reliability.
Qiaoxing Li, Jianmei Yang
FUZZ-IEEE2
2008 Simulation of rivalry spread effect over the competitive pressure network
abstract
Most existing dynamic competition studies focus on the rivalry between two firms, neglecting the truth that firms in some multimarket industry are competing over a network. By combining the competitive pressure network model and certain complex network approaches, the paper proposes a method to simulate the spread effect of tactical rivalry actions over a network. The method is helpful in understanding factors that may affect the spread effect of rivalry, and the relationship between a firm's network properties in the industry and its power in spreading the rivalry.
Dong Zhuang, Jianmei Yang
SMC2
2006 The Bipartite Network Based Growth Mechanisms of Complex Company Competitive Relationship Networks
abstract
Prominent scale-free distributions of competitive relationships are observed in some empirical studies on some complex company competitive relationship networks (CRNs). To uncover the driving forces of these properties, the company-product bipartite network model, which is the prototype of CRN, is used to depict the dynamics of industries. The growth mechanisms of the network model based on the industry-specific traits are helpful in understanding the different properties of CRNs between industries. A simplified simulation implies that the structural properties of CRNs can be different among industries and may alter at different life cycle stages of an industry
Dong Zhuang, Jianmei Yang, Xiangdong Pan, Weiliang Tang
APSCC2
2005 An Efficient Adaptive Focused Crawler Based on Ontology Learning
abstract
The enormous growth of the World Wide Web has made it important to perform resource discovery efficiently. Consequently, several new ideas have been proposed; among them a key technique is focused crawling which is able to crawl particular topical portions of the World Wide Web quickly without having to explore all Web pages. In this paper, we present an intelligent focused crawler algorithm in which we embed ontology to evaluate the page's relevance to the topic. Compared with other algorithms using domain knowledge, our algorithm can evolve the ontology automatically during crawl process. Considering the instinct characteristics of the ontology, propagation has also been imported to accelerate the evolution of the ontology. We applied our approaches in several tasks and provided an empirical evaluation which has shown promising results.
Yang Gao 0001, Jianmei Yang, Bin Luo 0003
HIS3
2003 A synthesis and innovation to methodologies of enterprise strategy research - its conceptual frameworks and theoretical hypotheses
abstract
Based on recent progress in research of systems concept and systems methodology, including systems metaphor, systems of system methodology and total systems intervention, new conceptual frameworks and theoretical hypothesis on the synthesis and innovation of the enterprise strategy research schools were raised in this paper, so that to overcome difficulties which may occur in the practice of enterprise strategy research methodology.
Jianmei Yang, Yuning He
SMC1