Fangfang Wang

Fangfang Wang

Auto-generated profile, based on publicly available information

Fangfang Wang

Hangzhou Normal University, Hangzhou, China

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 September 2014 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
FWFang-Fang Wang
Fang-Fang Wang
LCLi-Fei Chen
Li-Fei Chen
CSChao-Ton Su
Chao-Ton Su

5 November 2024 in Computer Vision and Image Understanding
Verified
Journal Article
Closed access
YZYiyi Zhang
Yiyi Zhang
ZYZhiwen Ying
Zhiwen Ying
YZYing Zheng
Ying Zheng
CWCuiling Wu
Cuiling Wu
NLNannan Li
Nannan Li
XXXiaogang Xu
Xiaogang Xu

29 October 2023
Verified
Conference Paper
Open access
HLHangfei Li
Hangfei Li
YWYiming Wu
Yiming Wu
FWFangfang Wang
Fangfang Wang
Language-based fashion image retrieval, as a kind of composed image retrieval, presents a substantial challenge in the domain of multi-modal retrieval. This task aims to retrieve the target fashion item in the gallery given a reference image and a modification text. Existing approaches primarily concentrate on developing a static multi-modal fusion module to learn the combined semantics of the reference image and modification text. Despite their commendable advancements, these approaches are still limited by a deficiency in flexibility, which is attributed to the application of a singluar fusion module across diverse input queries. In contrast to static fusion methods, we propose a novel method termed Dynamic Fusion Network (DFN) to compose the multi-granularity features dynamically by considering the consistency of routing path and modality-specific information simultaneously. In specific, our proposed method is consisted of two modules: (1) Dynamic Network. The dynamic network enables a flexible combination of the different operation modules, providing multi-granularity modality interaction for each reference image and modifier text. (2) Modality Specific Routers (MSR). The MSR generates precise routing decisions based on the distinct semantics and distributions of each reference image and modifier text. Extensive experiments on three benchmarks,\textiti.e., FashionIQ, Shoes and Fashion200K, demonstrate the effectiveness of our proposed model compared with the existing methods.


12 August 2020 in arXiv
Verified
Preprint
Open access
PDF file
FWFangfang Wang
Fangfang Wang
YCYifeng CHEN
Yifeng CHEN
FWFei Wu
Fei Wu
XLXi Li
Xi Li
Arbitrary-shaped text detection is a challenging task due to the complex geometric layouts of texts such as large aspect ratios, various scales, random rotations and curve shapes. Most state-of-the-art methods solve this problem from bottom-up perspectives, seeking to model a text instance of complex geometric layouts with simple local units (e.g., local boxes or pixels) and generate detections with heuristic post-processings. In this work, we propose an arbitrary-shaped text detection method, namely TextRay, which conducts top-down contour-based geometric modeling and geometric parameter learning within a single-shot anchor-free framework. The geometric modeling is carried out under polar system with a bidirectional mapping scheme between shape space and parameter space, encoding complex geometric layouts into unified representations. For effective learning of the representations, we design a central-weighted training strategy and a content loss which builds propagation paths between geometric encodings and visual content. TextRay outputs simple polygon detections at one pass with only one NMS post-processing. Experiments on several benchmark datasets demonstrate the effectiveness of the proposed approach. The code is available at https://github.com/LianaWang/TextRay.

13 January 2022 in arXiv
Verified
Preprint
Open access
PDF file
YCYifeng CHEN
Yifeng CHEN
WCWenqing Chu
Wenqing Chu
FWFangfang Wang
Fangfang Wang
YTYing Tai
Ying Tai
RYRan Yi
Ran Yi
XLXi Li
Xi Li
Recently, there is growing attention on one-stage panoptic segmentation methods which aim to segment instances and stuff jointly within a fully convolutional pipeline efficiently. However, most of the existing works directly feed the backbone features to various segmentation heads ignoring the demands for semantic and instance segmentation are different: The former needs semantic-level discriminative features, while the latter requires features to be distinguishable across instances. To alleviate this, we propose to first predict semantic-level and instance-level correlations among different locations that are utilized to enhance the backbone features, and then feed the improved discriminative features into the corresponding segmentation heads, respectively. Specifically, we organize the correlations between a given location and all locations as a continuous sequence and predict it as a whole. Considering that such a sequence can be extremely complicated, we adopt Discrete Fourier Transform (DFT), a tool that can approximate an arbitrary sequence parameterized by amplitudes and phrases. For different tasks, we generate these parameters from the backbone features in a fully convolutional way which is optimized implicitly by corresponding tasks. As a result, these accurate and consistent correlations contribute to producing plausible discriminative features which meet the requirements of the complicated panoptic segmentation task. To verify the effectiveness of our methods, we conduct experiments on several challenging panoptic segmentation datasets and achieve state-of-the-art performance on MS COCO with $45.1$\% PQ and ADE20k with $32.6$\% PQ.