UM澳門大學http://repository.um.edu.mo:802019-05-25T13:45:25Z2019-05-25T13:45:25ZSegmentation-based Image Hash for Precise Tamper LocalizationYan, Cai-PingPun, Chi-Manhttp://repository.um.edu.mo:80/handle/10692/188812019-05-24T03:33:34Z2019-05-24T03:32:56ZTitle: Segmentation-based Image Hash for Precise Tamper Localization
Authors: Yan, Cai-Ping; Pun, Chi-Man
Description: <p>The block-based analysis for tamper localization is&nbsp;a prevailing mechanism in hash-based forgery detection&nbsp;algorithm. One of the main problems with a block-based analysis&nbsp;is its rough localization stemming from that the forensic hashes&nbsp;attached to the images are lack of contour information. In this&nbsp;paper, we present a novel tamper detection model which can&nbsp;generate an accurate tamper localization result. The main&nbsp;difference to the traditional algorithms is that the proposed&nbsp;model segments the image into closed regions based on strong&nbsp;edges. Then the color and position features of the closed regions&nbsp;are extracted as a forensic hash. Furthermore, a graph-based&nbsp;ranking algorithm is proposed to establish the region&nbsp;correspondence between the received image and forensic one by&nbsp;exploiting their intrinsic structure information. Experimental&nbsp;results demonstrate that the proposed tamper detection model is&nbsp;a promising method for precise tamper localization compared&nbsp;with state-of-the-art methods.</p>2019-05-24T03:32:56ZDeep Fusion Network for Splicing Forgery LocalizationLiu, BoPun, Chi-Manhttp://repository.um.edu.mo:80/handle/10692/188802019-05-24T03:26:54Z2019-05-24T03:26:18ZTitle: Deep Fusion Network for Splicing Forgery Localization
Authors: Liu, Bo; Pun, Chi-Man
Description: <p>Digital splicing is a common type of image forgery: some regions of an image are replaced with contents from other images. To locate altered regions in a tampered picture is a challenging work because the difference is unknown between the altered regions and the original regions and it is thus necessary to search the large hypothesis space for a convincing result. In this paper, we proposed a novel deep fusion network to locate tampered area by tracing its border. A group of deep convolutional neural networks called Base-Net were firstly trained to response the certain type of splicing forgery respectively. Then, some layers of the Base-Net are selected and combined as a deep fusion neural network (Fusion-Net). After fine-tuning by a very small number of pictures, Fusion-Net is able to discern whether an image block is synthesized from different origins. Experiments on the benchmark datasets show that our method is effective in various situations and outperform state-of-the-art methods.</p>2019-05-24T03:26:18ZHigh-quality-guided artificial bee colony algorithm for designing loudspeakerGao, HaoLi, HaolunLiu, YeLu, HuiminKim, HyoungseopPun, Chi-manhttp://repository.um.edu.mo:80/handle/10692/188792019-05-24T03:24:13Z2019-05-24T03:23:51ZTitle: High-quality-guided artificial bee colony algorithm for designing loudspeaker
Authors: Gao, Hao; Li, Haolun; Liu, Ye; Lu, Huimin; Kim, Hyoungseop; Pun, Chi-man
Description: <p>Designing the loudspeaker could be concerned as an optimization problem. Like most electromagnetic device design issues, it demonstrates multimodal, multidimensional and constrained. The traditional design method cannot achieve a satisfactory model within a certain period of time. In this paper, a high-quality-guided artificial bee colony algorithm is proposed to increase its convergence speed and search accuracy by gradually changing the number of updating dimensions and searching closer to better locations. The algorithm is first tested on some representative basic benchmark functions and then is applied to a loudspeaker design problem. By comparing with some classical algorithms, the performance of our algorithm is verified.</p>2019-05-24T03:23:51ZAn artificial bee algorithm with a leading group and its application into image registrationHu, HaidongPun, Chi-ManLiu, YeLai, XiangjingYang, ZeyuGao, Haohttp://repository.um.edu.mo:80/handle/10692/188782019-05-24T03:21:31Z2019-05-24T03:21:04ZTitle: An artificial bee algorithm with a leading group and its application into image registration
Authors: Hu, Haidong; Pun, Chi-Man; Liu, Ye; Lai, Xiangjing; Yang, Zeyu; Gao, Hao
Description: <p>A popular optimization algorithm, the artificial bee colony algorithm (ABC), has attracted great attention over the recent years for its powerful global search ability. However, its slow convergence rate limits its development. In this paper, to further enhance its performance, we first introduced a new concept of a leading group, which includes some individuals with excellent performance, into the traditional ABC. The updated bee then selects one individual from the group to follow, which accelerates the convergence rate of the population. Furthermore, to enable the ABC algorithm to acquire greater opprotunities to search within a larger space, a logistic chaotic operator was introduced into our algorithm to balance its global and local search abilities. The performance of the algorithm proposed is tested on the traditional 12 benchmark functions and an image registration problem. The results reveal that our algorithm provides more acceptable results compared with the other algorithms.</p>2019-05-24T03:21:04ZPolar-wavelet energy signatures for rotation-invariant texture classificationPun, Chi-Manhttp://repository.um.edu.mo:80/handle/10692/188772019-05-24T03:13:02Z2019-05-24T03:12:18ZTitle: Polar-wavelet energy signatures for rotation-invariant texture classification
Authors: Pun, Chi-Man
Description: <p>This paper proposes a scheme to extract rotation-invariant polar-wavelet energy signatures for texture classification. Firstly, we apply polar transform to a given texture and decompose the transformed image to generate a set of redundant shift-invariant sub-bands of wavelet packet coefficients with orthonormal wavelet bases. Then we compute the polar-wavelet energy signatures from each sub-band, and select the most dominant features to form a feature vector for texture classification. The experimental results, based on testing 7200 texture images, with different orientations, against 25 texture classes, show that the proposed scheme using the Euclidean classifier outperforms two other common rotation-invariant texture classification methods, its overall accuracy rate being 89.4%, demonstrating that the extracted energy signatures are effective rotation invariant features.</p>2019-05-24T03:12:18ZCollaborative Product Representation for Emergent Electronic MarketplaceGuo, JingzhiSun, Chengzhenghttp://repository.um.edu.mo:80/handle/10692/188762019-05-24T03:06:59Z2019-05-24T03:06:19ZTitle: Collaborative Product Representation for Emergent Electronic Marketplace
Authors: Guo, Jingzhi; Sun, Chengzheng
Description: <p>A B2B e-marketplace is emergent with product representation requirements in continuous changes. To capture the emergence, this paper proposes a novel collaborative product representation approach that collaboratively generates new product representations in real-time both at the sides of sellers/buyers and e-marketplace providers. The approach employs a well-defined product representation construct that decomposes each representation into a set of hierarchically arranged vector concept-based annotations and sub-structures. The use of vector-based concepts achieves flexibility, exactness and evolvability of the whole product representation system.</p>2019-05-24T03:06:19ZInter-Enterprise Business Document ExchangeGuo, Jingzhihttp://repository.um.edu.mo:80/handle/10692/188752019-05-24T03:04:15Z2019-05-24T03:00:59ZTitle: Inter-Enterprise Business Document Exchange
Authors: Guo, Jingzhi
Description: <p>Electronic business document interoperation is the cornerstone of business process integration. An essential issue for business document interoperation is to maintain semantic consistency of the exchanged business documents between any two autonomous business communities, where the document sender and receiver have no misunderstanding in using the exchanged documents. Existing approaches to resolving this issue either adopts document standards to map heterogeneous document elements or applies business ontologies to mediate inconsistent document elements. While these approaches are effective in certain degree, the issues of limited flexibility and evolvability in using standards and the lack of accuracy in using ontologies to mediate document elements must be explored and resolved. This paper proposes a Collaborative Document Exchange (CODEX) approach to resolving the issues. In this approach, structures and concepts of business document are separated and layered in CODEX framework. Structures provide the commonality of business documents through classified concept identifiers while concepts support particularity of business documents through collaboration.</p>2019-05-24T03:00:59ZSemantic Document Exchange through Mediation of Machine Natural LanguageQin, PengGuo, JingzhiXu,YilingWang,Lonhqihttp://repository.um.edu.mo:80/handle/10692/188742019-05-24T02:57:14Z2019-05-24T02:55:05ZTitle: Semantic Document Exchange through Mediation of Machine Natural Language
Authors: Qin, Peng; Guo, Jingzhi; Xu,Yiling; Wang,Lonhqi
Description: <p>In global e-commerce, semantic document exchange ensures unambiguity and shares same meaning for documents sender and receiver cross different natural languages (e.g., English to Chinese), as the difference makes the translation between cross-language documents complex and inaccurate. This paper proposed a novel collaborative framework of semantic document exchange through a mediation approach which provides a sentence-based machine natural language (MNL). Here, the MNL constructs a grammatical case structure to compatible with all languages. Thus, the mediation framework enables the sentence computer-readable and understandable without ambiguity, simultaneously the MNL can improve accuracy and reduce the complexity of mapping in semantic document exchange.</p>2019-05-24T02:55:05ZLinear duration invariantsZhou, ChaochenZhang, JingzhouYang, LuLi, Xiaoshanhttp://repository.um.edu.mo:80/handle/10692/188732019-05-24T02:51:25Z2019-05-24T02:49:13ZTitle: Linear duration invariants
Authors: Zhou, Chaochen; Zhang, Jingzhou; Yang, Lu; Li, Xiaoshan
Description: <p>This paper is to present an algorithm to decide whether a real-time system satisfies a set of invariants which are constructed from linear inequalities of integrated durations of system states. Real-time systems in the paper are taken to be real-time automata which set up for each of state transitions a lower time bound and an upper time bound. The satisfaction problem can be translated into a family of&nbsp;<em>linear programming problems</em>. The algorithm is, according to the invariants, to reduce the infinite family of linear programming problems to an equivalent one with only finite members, and then to solve each of linear programming problems efficiently. The algorithm is so simple that no prerequisite of linear programming theory is assumed.</p>2019-05-24T02:49:13ZA duration calculus with infinite intervalsZhou, ChaochenDang, Van HuangLi, Xiaoshanhttp://repository.um.edu.mo:80/handle/10692/188722019-05-24T02:50:47Z2019-05-24T02:49:07ZTitle: A duration calculus with infinite intervals
Authors: Zhou, Chaochen; Dang, Van Huang; Li, Xiaoshan
Description: <p>This paper introduces infinite intervals into the Duration Calculus [33]. The extended calculus defines a state duration over an infinite interval by a property which specifies the limit of the state duration over finite intervals, and excludes the description operator. Thus the calculus can be established without involvement of unpleasant calculation of infinity. With limits of state durations, one can treat conventional liveness and fairness, and can also measure liveness and fairness through properties of limits. Including both finite and infinite intervals, the calculus can, in a simple manner, distinguish between terminating behaviour and nonterminating behaviour, and therefore directly specify and reason about sequentiality.</p>2019-05-24T02:49:07Z